全文获取类型
收费全文 | 3679篇 |
免费 | 272篇 |
国内免费 | 24篇 |
专业分类
电工技术 | 52篇 |
综合类 | 20篇 |
化学工业 | 957篇 |
金属工艺 | 68篇 |
机械仪表 | 79篇 |
建筑科学 | 132篇 |
矿业工程 | 9篇 |
能源动力 | 129篇 |
轻工业 | 500篇 |
水利工程 | 46篇 |
石油天然气 | 28篇 |
武器工业 | 2篇 |
无线电 | 323篇 |
一般工业技术 | 476篇 |
冶金工业 | 548篇 |
原子能技术 | 17篇 |
自动化技术 | 589篇 |
出版年
2024年 | 7篇 |
2023年 | 33篇 |
2022年 | 96篇 |
2021年 | 173篇 |
2020年 | 106篇 |
2019年 | 110篇 |
2018年 | 139篇 |
2017年 | 136篇 |
2016年 | 147篇 |
2015年 | 114篇 |
2014年 | 141篇 |
2013年 | 255篇 |
2012年 | 179篇 |
2011年 | 239篇 |
2010年 | 158篇 |
2009年 | 168篇 |
2008年 | 159篇 |
2007年 | 163篇 |
2006年 | 131篇 |
2005年 | 100篇 |
2004年 | 89篇 |
2003年 | 102篇 |
2002年 | 102篇 |
2001年 | 57篇 |
2000年 | 46篇 |
1999年 | 43篇 |
1998年 | 179篇 |
1997年 | 113篇 |
1996年 | 109篇 |
1995年 | 58篇 |
1994年 | 43篇 |
1993年 | 52篇 |
1992年 | 17篇 |
1991年 | 17篇 |
1990年 | 15篇 |
1989年 | 13篇 |
1988年 | 10篇 |
1987年 | 16篇 |
1986年 | 13篇 |
1985年 | 16篇 |
1984年 | 5篇 |
1983年 | 8篇 |
1982年 | 4篇 |
1981年 | 9篇 |
1980年 | 8篇 |
1979年 | 11篇 |
1978年 | 8篇 |
1977年 | 12篇 |
1976年 | 22篇 |
1971年 | 7篇 |
排序方式: 共有3975条查询结果,搜索用时 234 毫秒
81.
This paper examines the role played by feedforward in model predictive control (MPC). We contrast feedforward with preview action. The latter is standard in model predictive control, whereas feedforward has been rarely, if ever, used in contemporary formulations of MPC. We argue that feedforward can significantly improve performance in the presence of measurement noise and certain types of model uncertainty. 相似文献
82.
83.
Diego Castaño José Patricio Díaz Varela Antoni Torrens 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2011,15(7):1449-1455
In this paper, we show that free algebras in the variety of residuated lattices and some of its subvarieties are directly
indecomposable and show, as a consequence, the direct indecomposability of free algebras for some classes of their bounded
implicative subreducts. 相似文献
84.
Wil M. P. van der Aalst Marlon Dumas Florian Gottschalk Arthur H. M. ter Hofstede Marcello La Rosa Jan Mendling 《Formal Aspects of Computing》2010,22(3-4):459-482
A configurable process model captures a family of related process models in a single artifact. Such models are intended to be configured to fit the requirements of specific organizations or projects, leading to individualized process models that are subsequently used for domain analysis or solution design. This article proposes a formal foundation for individualizing configurable process models incrementally, while preserving correctness, both with respect to syntax and behavioral semantics. Specifically, assuming the configurable process model is behaviorally sound, the individualized process models are guaranteed to be sound. The theory is first developed in the context of Petri nets and then extended to a process modeling notation widely used in practice, namely Event-driven Process Chains. 相似文献
85.
Gonzalez Hector Han Jiawei Cheng Hong Li Xiaolei Klabjan Diego Wu Tianyi 《Knowledge and Data Engineering, IEEE Transactions on》2010,22(1):90-104
Massive Radio Frequency Identification (RFID) data sets are expected to become commonplace in supply chain management systems. Warehousing and mining this data is an essential problem with great potential benefits for inventory management, object tracking, and product procurement processes. Since RFID tags can be used to identify each individual item, enormous amounts of location-tracking data are generated. With such data, object movements can be modeled by movement graphs, where nodes correspond to locations and edges record the history of item transitions between locations. In this study, we develop a movement graph model as a compact representation of RFID data sets. Since spatiotemporal as well as item information can be associated with the objects in such a model, the movement graph can be huge, complex, and multidimensional in nature. We show that such a graph can be better organized around gateway nodes, which serve as bridges connecting different regions of the movement graph. A graph-based object movement cube can be constructed by merging and collapsing nodes and edges according to an application-oriented topological structure. Moreover, we propose an efficient cubing algorithm that performs simultaneous aggregation of both spatiotemporal and item dimensions on a partitioned movement graph, guided by such a topological structure. 相似文献
86.
Mitsuo Takaki Diego Cavalcanti Rohit Gheyi Juliano Iyoda Marcelo d’Amorim Ricardo B. C. Prudêncio 《Innovations in Systems and Software Engineering》2010,6(3):243-253
The complexity of constraints is a major obstacle for constraint-based software verification. Automatic constraint solvers are fundamentally incomplete: input constraints often build on some undecidable theory or some theory the solver does not support. This paper proposes and evaluates several randomized solvers to address this issue. We compared the effectiveness of a symbolic solver (CVC3), a random solver, two heuristic search solvers, and seven hybrid solvers (i.e. mix of random, symbolic, and heuristic solvers). We evaluated the solvers on a benchmark generated with a concolic execution of 9 subjects. The performance of each solver was measured by its precision, which is the fraction of constraints that the solver can find solution out of the total number of constraints that some solver can find solution. As expected, symbolic solving subsumes the other approaches for the 4 subjects that only generate decidable constraints. For the remaining 5 subjects, which contain undecidable constraints, the hybrid solvers achieved the highest precision (fraction of constraints that a solver can find a solution out of the total number of satisfiable constraints). We also observed that the solvers were complementary, which suggests that one should alternate their use in iterations of a concolic execution driver. 相似文献
87.
Marcello La Rosa Hajo A. Reijers Wil M.P. van der Aalst Remco M. Dijkman Jan Mendling Marlon Dumas Luciano García-Bañuelos 《Expert systems with applications》2011,38(6):7029-7040
Business process models are becoming available in large numbers due to their widespread use in many industrial applications such as enterprise and quality engineering projects. On the one hand, this raises a challenge as to their proper management: how can it be ensured that the proper process model is always available to the interested stakeholder? On the other hand, the richness of a large set of process models also offers opportunities, for example with respect to the re-use of existing model parts for new models. This paper describes the functionality and architecture of an advanced process model repository, named APROMORE. This tool brings together a rich set of features for the analysis, management and usage of large sets of process models, drawing from state-of-the art research in the field of process modeling. A prototype of the platform is presented in this paper, demonstrating its feasibility, as well as an outlook on the further development of APROMORE. 相似文献
88.
A configurable process model provides a consolidated view of a family of business processes. It promotes the reuse of proven practices by providing analysts with a generic modeling artifact from which to derive individual process models. Unfortunately, the scope of existing notations for configurable process modeling is restricted, thus hindering their applicability. Specifically, these notations focus on capturing tasks and control-flow dependencies, neglecting equally important ingredients of business processes such as data and resources. This research fills this gap by proposing a configurable process modeling notation incorporating features for capturing resources, data and physical objects involved in the performance of tasks. The proposal has been implemented in a toolset that assists analysts during the configuration phase and guarantees the correctness of the resulting process models. The approach has been validated by means of a case study from the film industry. 相似文献
89.
90.
Diego Salas-Gonzalez Ercan E. Kuruoglu 《Computational statistics & data analysis》2009,53(5):1535-1546
DNA microarray has been recognized as being an important tool for studying the expression of thousands of genes simultaneously. These experiments allow us to compare two different samples of cDNA obtained under different conditions. A novel method for the analysis of replicated microarray experiments based upon the modelling of gene expression distribution as a mixture of α-stable distributions is presented. Some features of the distribution of gene expression, such as Pareto tails and the fact that the variance of any given array increases concomitantly with an increase in the number of genes studied, suggest the possibility of modelling gene expression distribution on the basis of α-stable density. The proposed methodology uses very well known properties of α-stable distribution, such as the scale mixture of normals. A Bayesian log-posterior odds is calculated, which allows us to decide whether a gene is expressed differentially or not. The proposed methodology is illustrated using simulated and experimental data and the results are compared with other existing statistical approaches. The proposed heavy-tail model improves the performance of other distributions and is easily applicable to microarray gene data, specially if the dataset contains outliers or presents high variance between replicates. 相似文献