全文获取类型
收费全文 | 4634篇 |
免费 | 333篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 49篇 |
综合类 | 6篇 |
化学工业 | 1242篇 |
金属工艺 | 92篇 |
机械仪表 | 159篇 |
建筑科学 | 210篇 |
矿业工程 | 19篇 |
能源动力 | 157篇 |
轻工业 | 889篇 |
水利工程 | 42篇 |
石油天然气 | 23篇 |
无线电 | 250篇 |
一般工业技术 | 765篇 |
冶金工业 | 245篇 |
原子能技术 | 34篇 |
自动化技术 | 794篇 |
出版年
2024年 | 9篇 |
2023年 | 49篇 |
2022年 | 145篇 |
2021年 | 204篇 |
2020年 | 143篇 |
2019年 | 166篇 |
2018年 | 200篇 |
2017年 | 192篇 |
2016年 | 221篇 |
2015年 | 155篇 |
2014年 | 213篇 |
2013年 | 369篇 |
2012年 | 310篇 |
2011年 | 341篇 |
2010年 | 257篇 |
2009年 | 266篇 |
2008年 | 221篇 |
2007年 | 197篇 |
2006年 | 172篇 |
2005年 | 144篇 |
2004年 | 127篇 |
2003年 | 102篇 |
2002年 | 110篇 |
2001年 | 67篇 |
2000年 | 52篇 |
1999年 | 52篇 |
1998年 | 90篇 |
1997年 | 57篇 |
1996年 | 55篇 |
1995年 | 51篇 |
1994年 | 31篇 |
1993年 | 29篇 |
1992年 | 20篇 |
1991年 | 17篇 |
1990年 | 12篇 |
1989年 | 19篇 |
1988年 | 8篇 |
1987年 | 7篇 |
1986年 | 13篇 |
1985年 | 13篇 |
1984年 | 8篇 |
1983年 | 8篇 |
1982年 | 8篇 |
1981年 | 8篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1977年 | 9篇 |
1976年 | 7篇 |
1975年 | 5篇 |
排序方式: 共有4976条查询结果,搜索用时 62 毫秒
101.
This paper presents a syntactic approach based on Adjacency Grammars (AG) for sketch diagram modeling and understanding. Diagrams are a combination of graphical symbols arranged according to a set of spatial rules defined by a visual language. AG describe visual shapes by productions defined in terms of terminal and non-terminal symbols (graphical primitives and subshapes), and a set functions describing the spatial arrangements between symbols. Our approach to sketch diagram understanding provides three main contributions. First, since AG are linear grammars, there is a need to define shapes and relations inherently bidimensional using a sequential formalism. Second, our parsing approach uses an indexing structure based on a spatial tessellation. This serves to reduce the search space when finding candidates to produce a valid reduction. This allows order-free parsing of 2D visual sentences while keeping combinatorial explosion in check. Third, working with sketches requires a distortion model to cope with the natural variations of hand drawn strokes. To this end we extended the basic grammar with a distortion measure modeled on the allowable variation on spatial constraints associated with grammar productions. Finally, the paper reports on an experimental framework an interactive system for sketch analysis. User tests performed on two real scenarios show that our approach is usable in interactive settings. 相似文献
102.
Mark Anderson Rajiv D. Banker Nirup M. Menon Jorge A. Romero 《Information Technology and Management》2011,12(3):197-212
This paper examines the impact of the duration of ERP implementation on firm performance both during and after implementation.
Organizations choose either an accelerated implementation approach or a traditional (longer) implementation approach. The
former approach gives the organization the advantage of speed, but the disadvantage of fitting its processes to that of a
packaged (thus, undifferentiated from competitors) ERP. The latter approach allows the organization to redesign strategy and
processes, and thus, search for ways to be unique from its competition. The study uses a regression model to capture the changes
in various performance measures during and after implementation between firms that implemented the ERP, using the performance
measure of a matched group of firms that did not implement an ERP as a benchmark/control sample, on the basis of the duration
of the implementation. Financial data from Compustat, and data on start date and end date of ERP implementation between 1990
and 2005 for firms in the Oil and Gas industry was collected from an ERP vendor. Results show that measures such as return
on sales improved after implementation. However, measures such as inventory turnover, which reflect operational benefits,
improve during implementation. We find that accelerated implementation confers both operational and strategic benefits. This
study highlights the strategic consequences of the different choices of implementation. 相似文献
103.
This paper proposes a new approach for the segmentation of both near-end and far-end intima-media regions of the common carotid artery in ultrasound images. The method requires minimal user interaction and is able to segment the near-end wall in arteries with large, hypoechogenic and irregular plaques, issues usually not considered previously due to the increased segmentation difficulty. 相似文献
104.
Jorge E. Mendoza Bruno Castanier Christelle Guéret Andrés L. Medaglia Nubia Velasco 《Computers & Operations Research》2010,37(11):1886-1898
The multi-compartment vehicle routing problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of customers for several products that, because of incompatibility constraints, must be loaded in independent vehicle compartments. Despite its wide practical applicability the MC-VRP has not received much attention in the literature, and the few existing methods assume perfect knowledge of the customer demands, regardless of their stochastic nature. This paper extends the MC-VRP by introducing uncertainty on what it is known as the MC-VRP with stochastic demands (MC-VRPSD). The MC-VRPSD is modeled as a stochastic program with recourse and solved by means of a memetic algorithm. The proposed memetic algorithm couples genetic operators and local search procedures proven to be effective on deterministic routing problems with a novel individual evaluation and reparation strategy that accounts for the stochastic nature of the problem. The algorithm was tested on instances of up to 484 customers, and its results were compared to those obtained by a savings-based heuristic and a memetic algorithm (MA/SCS) for the MC-VRP that uses a spare capacity strategy to handle demand fluctuations. In addition to effectively solve the MC-VRPSD, the proposed MA/SCS also improved 14 best known solutions in a 40-problem testbed for the MC-VRP. 相似文献
105.
Inés González-Rodríguez Camino R. Vela Jorge Puente 《Journal of Intelligent Manufacturing》2010,21(1):65-73
In this work we consider a multiobjective job shop problem with uncertain durations and crisp due dates. Ill-known durations
are modelled as fuzzy numbers. We take a fuzzy goal programming approach to propose a generic multiobjective model based on
lexicographical minimisation of expected values. To solve the resulting problem, we propose a genetic algorithm searching
in the space of possibly active schedules. Experimental results are presented for several problem instances, solved by the
GA according to the proposed model, considering three objectives: makespan, tardiness and idleness. The results illustrate
the potential of the proposed multiobjective model and genetic algorithm. 相似文献
106.
Iván García-Magariño Rubén Fuentes-Fernández Jorge J. Gómez-Sanz 《Information and Software Technology》2010,52(4):422-435
Computer-Aided Software Engineering (CASE) tools support modeling-related activities in development projects. Given the variety of tools and functionalities, it is quite common to work with several tools in the same project. However, data cannot usually be exchanged between these tools without loss of information. Recent approaches address this model interchange problem using metamodels to characterize the involved information and transformations to export/import it. Nevertheless, most of these solutions focus on the abstract syntax of models. They fail to consider aspects such as the presentation of models or tool-specific information, which are either disregarded or represented in ad-hoc ways that make difficult their processing. In order to overcome these limitations, this paper introduces a framework to define metamodels of CASE tools and a process to carry out the model interchange using them. The proposed metamodels have a modular organization with several internal metamodels. Each of them is aimed at describing some specific information about content, structure and presentation for both models and tools. The paper illustrates this approach with a case study used for comparison with existing works for this problem. 相似文献
107.
Cândida M. Pereira Jorge A. Ambrósio Amílcar L. Ramalho 《Multibody System Dynamics》2010,24(3):303-324
To overcome the difficulty on building manually complex models of chain drives, this work proposes a comprehensive methodology to build multibody models of any general chain drive automatically from a minimal set of data. The proposed procedure also evaluates the initial positions and velocities of all components of the drive that are consistent with the kinematic joints or with the contact pairs used in the model. In this methodology, all links and sprockets are represented by rigid bodies connected to each other either by ideal or by clearance revolute joints. The clearance revolute joint contact is further extended to handle the contact between the chain rollers and the sprocket teeth exact profiles. A suitable cylindrical continuous contact law is applied to describe the interaction on all contact pairs. One of the complexities of the computational study of roller chain drives is the large number of bodies in the system and the dynamics of the successive engagement and disengagement of the rollers with the sprockets. Each time a roller engages or disengages with a sprocket tooth, the number of rigid bodies in contact changes. The search for the contact pairs is recognized as one of the most time consuming task in contact analysis. This work proposes a procedure to specify the contact pairs and their update during the dynamic analysis optimizing the computational efficiency of the contact search. The methodologies adopted result in a general computer program that is applied and demonstrated in a generic chain drive that can be used in industrial machines, vehicle engines or any other type of mechanical system. 相似文献
108.
Navigational features have been largely recognized as fundamental for graph database query languages. This fact has motivated several authors to propose RDF query languages with navigational capabilities. In this paper, we propose the query language nSPARQL that uses nested regular expressions to navigate RDF data. We study some of the fundamental properties of nSPARQL and nested regular expressions concerning expressiveness and complexity of evaluation. Regarding expressiveness, we show that nSPARQL is expressive enough to answer queries considering the semantics of the RDFS vocabulary by directly traversing the input graph. We also show that nesting is necessary in nSPARQL to obtain this last result, and we study the expressiveness of the combination of nested regular expressions and SPARQL operators. Regarding complexity of evaluation, we prove that given an RDF graph G and a nested regular expression E, this problem can be solved in time O(|G||E|). 相似文献
109.
Dan Lin Prathima Rao Elisa Bertino Ninghui Li Jorge Lobo 《International Journal of Information Security》2010,9(4):253-273
Policy integration and inter-operation is often a crucial requirement when parties with different access control policies
need to participate in collaborative applications and coalitions. Such requirement is even more difficult to address for dynamic
large-scale collaborations, in which the number of access control policies to analyze and compare can be quite large. An important
step in policy integration and inter-operation is to analyze the similarity of policies. Policy similarity can sometimes also
be a pre-condition for establishing a collaboration, in that a party may enter a collaboration with another party only if
the policies enforced by the other party match or are very close to its own policies. Existing approaches to the problem of
analyzing and comparing access control policies are very limited, in that they only deal with some special cases. By recognizing
that a suitable approach to the policy analysis and comparison requires combining different approaches, we propose in this
paper a comprehensive environment—EXAM. The environment supports various types of analysis query, which we categorize in the
paper. A key component of such environment, on which we focus in the paper, is the policy analyzer able to perform several
types of analysis. Specifically, our policy analyzer combines the advantages of existing MTBDD-based and SAT-solver-based
techniques. Our experimental results, also reported in the paper, demonstrate the efficiency of our analyzer. 相似文献
110.
Manuel Silva Jorge Júlvez Cristian Mahulea C. Renato Vázquez 《Discrete Event Dynamic Systems》2011,21(4):427-497
As a preliminary overview, this work provides first a broad tutorial on the fluidization of discrete event dynamic models,
an efficient technique for dealing with the classical state explosion problem. Even if named as continuous or fluid, the relaxed models obtained are frequently hybrid in a technical sense. Thus,
there is plenty of room for using discrete, hybrid and continuous model techniques for logical verification, performance evaluation
and control studies. Moreover, the possibilities for transferring concepts and techniques from one modeling paradigm to others
are very significant, so there is much space for synergy. As a central modeling paradigm for parallel and synchronized discrete
event systems, Petri nets (PNs) are then considered in much more detail. In this sense, this paper is somewhat complementary
to David and Alla (2010). Our presentation of fluid views or approximations of PNs has sometimes a flavor of a survey, but also introduces some new
ideas or techniques. Among the aspects that distinguish the adopted approach are: the focus on the relationships between discrete and continuous PN models, both for untimed, i.e., fully non-deterministic abstractions, and timed versions; the use of structure theory of (discrete) PNs, algebraic and graph based concepts and results; and the bridge to Automatic Control Theory. After discussing
observability and controllability issues, the most technical part in this work, the paper concludes with some remarks and
possible directions for future research. 相似文献