全文获取类型
收费全文 | 755篇 |
免费 | 21篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 3篇 |
化学工业 | 151篇 |
金属工艺 | 5篇 |
机械仪表 | 12篇 |
建筑科学 | 22篇 |
能源动力 | 24篇 |
轻工业 | 64篇 |
水利工程 | 8篇 |
无线电 | 99篇 |
一般工业技术 | 88篇 |
冶金工业 | 13篇 |
原子能技术 | 5篇 |
自动化技术 | 283篇 |
出版年
2024年 | 1篇 |
2023年 | 6篇 |
2022年 | 21篇 |
2021年 | 19篇 |
2020年 | 12篇 |
2019年 | 12篇 |
2018年 | 15篇 |
2017年 | 17篇 |
2016年 | 23篇 |
2015年 | 27篇 |
2014年 | 30篇 |
2013年 | 62篇 |
2012年 | 53篇 |
2011年 | 55篇 |
2010年 | 42篇 |
2009年 | 59篇 |
2008年 | 49篇 |
2007年 | 50篇 |
2006年 | 42篇 |
2005年 | 30篇 |
2004年 | 22篇 |
2003年 | 19篇 |
2002年 | 15篇 |
2001年 | 9篇 |
2000年 | 5篇 |
1999年 | 11篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 7篇 |
1995年 | 8篇 |
1994年 | 8篇 |
1993年 | 2篇 |
1992年 | 4篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 3篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1980年 | 1篇 |
1977年 | 1篇 |
1970年 | 1篇 |
1965年 | 1篇 |
1958年 | 1篇 |
1957年 | 2篇 |
排序方式: 共有777条查询结果,搜索用时 15 毫秒
31.
Siome Goldenstein Menelaos Karavelas Dimitris Metaxas Leonidas Guibas Eric Aaron Ambarish Goswami 《Computers & Graphics》2001,25(6):983-998
We present a new methodology for agent modeling that is scalable and efficient. It is based on the integration of nonlinear dynamical systems and kinetic data structures. The method consists of three layers, which together model 3D agent steering, crowds and flocks among moving and static obstacles. The first layer, the local layer employs nonlinear dynamical systems theory to models low-level behaviors. It is fast and efficient, and it does not depend on the total number of agents in the environment. This dynamical systems-based approach also allows us to establish continuous numerical parameters for modifying each agent's behavior. The second layer, a global environment layer consists of a specifically designed kinetic data structure to track efficiently the immediate environment of each agent and know which obstacles/agents are near or visible to the given agent. This layer reduces the complexity in the local layer. In the third layer, a global planning layer, the problem of target tracking is generalized in a way that allows navigation in maze-like terrains, avoidance of local minima and cooperation between agents. We implement this layer based on two approaches that are suitable for different applications: One approach is to track the closest single moving or static target; the second is to use a pre-specified vector field, which may be generated automatically (with harmonic functions, for example) or based on user input to achieve the desired output. We also discuss how hybrid systems concepts for global planning can capitalize on both our layered approach and the continuous, reactive nature of our agent steering.
We demonstrate the power of the approach through a series of experiments simulating single/multiple agents and crowds moving towards moving/static targets in complex environments. 相似文献
32.
33.
This paper presents an artificial neural network-based multiscale method for coupling continuum and molecular simulations. Molecular dynamics modelling is employed as a local “high resolution” refinement of computational data required by the continuum computational fluid dynamics solver. The coupling between atomistic and continuum simulations is obtained by an artificial neural network (ANN) methodology. The ANN aims to optimise the transfer of information through minimisation of (1) the computational cost by avoiding repetitive atomistic simulations of nearly identical states, and (2) the fluctuation strength of the atomistic outputs that are fed back to the continuum solver. Results are presented for prototype flows such as the isothermal Couette flow with slip boundary conditions and the slip Couette flow with heat transfer. 相似文献
34.
35.
36.
37.
Stamatis Zampetakis Yannis Tzitzikas Asterios Leonidis Dimitris Kotzinos 《Journal of Visual Languages and Computing》2012,23(3):137-153
The visualization of ontologies is a challenging task especially if they are large. In this paper we propose a visualization approach which is based on star-like graphs of variable radius which enables users to gradually explore and navigate through the entire ontology without overloading them. The star-like graphs are visualized using a Force Directed Placement algorithm (FDP) specially suited for RDF schemas whose configuration parameters can be adjusted interactively by the end-user via an intuitive on-screen tool bar. In addition, and since each star-like graph exhibits different graph features, we propose a novel automatic configuration method for the FDP algorithm parameters that is based on a number of quality metrics (area density and verticality of subclass hierarchies) and corresponding corrective actions. The experimental evaluation showed the quality of the yielded layout is significantly improved and the proposed approach is acceptably fast for real-time exploration. The user study showed that users prefer these views and perform various very common tasks faster. 相似文献
38.
Our interest lies in solving sum of squares (SOS) relaxations of large-scale unconstrained polynomial optimization problems. Because interior-point methods for solving these problems are severely limited by the large-scale, we are motivated to explore efficient implementations of an accelerated first-order method to solve this class of problems. By exploiting special structural properties of this problem class, we greatly reduce the computational cost of the first-order method at each iteration. We report promising computational results as well as a curious observation about the behaviour of the first-order method for the SOS relaxations of the unconstrained polynomial optimization problem. 相似文献
39.
The Mahalanobis-Taguchi (MT) strategy combines mathematical and statistical concepts like Mahalanobis distance, Gram-Schmidt
orthogonalization and experimental designs to support diagnosis and decision-making based on multivariate data. The primary
purpose is to develop a scale to measure the degree of abnormality of cases, compared to “normal” or “healthy” cases, i.e.
a continuous scale from a set of binary classified cases. An optimal subset of variables for measuring abnormality is then
selected and rules for future diagnosis are defined based on them and the measurement scale. This maps well to problems in
software defect prediction based on a multivariate set of software metrics and attributes. In this paper, the MT strategy
combined with a cluster analysis technique for determining the most appropriate training set, is described and applied to
well-known datasets in order to evaluate the fault-proneness of software modules. The measurement scale resulting from the
MT strategy is evaluated using ROC curves and shows that it is a promising technique for software defect diagnosis. It compares
favorably to previously evaluated methods on a number of publically available data sets. The special characteristic of the
MT strategy that it quantifies the level of abnormality can also stimulate and inform discussions with engineers and managers
in different defect prediction situations. 相似文献
40.
Stavros Papadopoulos Yin Yang Dimitris Papadias 《The VLDB Journal The International Journal on Very Large Data Bases》2010,19(2):161-180
According to the database outsourcing model, a data owner delegates database functionality to a third-party service provider, which answers queries received from clients.
Authenticated query processing enables the clients to verify the correctness of query results. Despite the abundance of methods for authenticated processing
in conventional databases, there is limited work on outsourced data streams. Stream environments pose new challenges such
as the need for fast structure updating, support for continuous query processing and authentication, and provision for temporal completeness. Specifically, in addition to the correctness of individual results, the client must be able to verify that there are no
missing results in between data updates. This paper presents a comprehensive set of methods covering relational streams. We
first describe REF, a technique that achieves correctness and temporal completeness but incurs false transmissions, i.e.,
the provider has to inform the clients whenever there is a data update, even if their results are not affected. Then, we propose
CADS, which minimizes the processing and transmission overhead through an elaborate indexing scheme and a virtual caching
mechanism. In addition, we present an analytical study to determine the optimal indexing granularity, and extend CADS for
the case that the data distribution changes over time. Finally, we evaluate the effectiveness of our techniques through extensive
experiments. 相似文献