全文获取类型
收费全文 | 3928篇 |
免费 | 345篇 |
国内免费 | 237篇 |
专业分类
电工技术 | 115篇 |
综合类 | 330篇 |
化学工业 | 134篇 |
金属工艺 | 74篇 |
机械仪表 | 132篇 |
建筑科学 | 161篇 |
矿业工程 | 72篇 |
能源动力 | 63篇 |
轻工业 | 88篇 |
水利工程 | 74篇 |
石油天然气 | 31篇 |
武器工业 | 30篇 |
无线电 | 219篇 |
一般工业技术 | 223篇 |
冶金工业 | 169篇 |
原子能技术 | 11篇 |
自动化技术 | 2584篇 |
出版年
2024年 | 17篇 |
2023年 | 40篇 |
2022年 | 68篇 |
2021年 | 94篇 |
2020年 | 94篇 |
2019年 | 80篇 |
2018年 | 89篇 |
2017年 | 86篇 |
2016年 | 98篇 |
2015年 | 121篇 |
2014年 | 194篇 |
2013年 | 198篇 |
2012年 | 189篇 |
2011年 | 262篇 |
2010年 | 210篇 |
2009年 | 235篇 |
2008年 | 284篇 |
2007年 | 230篇 |
2006年 | 260篇 |
2005年 | 182篇 |
2004年 | 180篇 |
2003年 | 143篇 |
2002年 | 153篇 |
2001年 | 142篇 |
2000年 | 117篇 |
1999年 | 90篇 |
1998年 | 79篇 |
1997年 | 82篇 |
1996年 | 80篇 |
1995年 | 72篇 |
1994年 | 67篇 |
1993年 | 51篇 |
1992年 | 48篇 |
1991年 | 30篇 |
1990年 | 27篇 |
1989年 | 22篇 |
1988年 | 10篇 |
1987年 | 8篇 |
1986年 | 13篇 |
1985年 | 18篇 |
1984年 | 8篇 |
1983年 | 9篇 |
1982年 | 10篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1979年 | 5篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1955年 | 1篇 |
排序方式: 共有4510条查询结果,搜索用时 15 毫秒
1.
Topic modeling is a popular analytical tool for evaluating data. Numerous methods of topic modeling have been developed which consider many kinds of relationships and restrictions within datasets; however, these methods are not frequently employed. Instead many researchers gravitate to Latent Dirichlet Analysis, which although flexible and adaptive, is not always suited for modeling more complex data relationships. We present different topic modeling approaches capable of dealing with correlation between topics, the changes of topics over time, as well as the ability to handle short texts such as encountered in social media or sparse text data. We also briefly review the algorithms which are used to optimize and infer parameters in topic modeling, which is essential to producing meaningful results regardless of method. We believe this review will encourage more diversity when performing topic modeling and help determine what topic modeling method best suits the user needs. 相似文献
2.
3.
A real-time distributed database system (RTDDBS) must maintain the consistency constraints of objects and must also guarantee
the time constraints imposed by each request arriving at the system. Such a time constraint of a request is usually defined
as a deadline period, which means that the request must be serviced on or before its time constraint. Servicing these requests
may incur I/O costs, control-message transferring costs or data-message transferring costs. As a result, in our work, we first
present a mathematical model that considers all these costs. Using this cost model, our objective is to service all the requests
on or before their respective deadline periods and minimize the total servicing cost. To this end, from theoretical standpoint, we design
a dynamic object replication algorithm, referred to as Real-time distributed dynamic Window Mechanism (RDDWM), that adapts to the random patterns of read-write requests. Using competitive analysis, from practical perspective,
we study the performance of RDDWM algorithm under two different extreme conditions, i.e., when the deadline period of each
request is sufficiently long and when the deadline period of each request is very short. Several illustrative examples are
provided for the ease of understanding.
Recommended by: Ashfaq Khokhar 相似文献
4.
Three-dimensional models, or pharmacophores, describing Euclidean constraints on the location on small molecules of functional
groups (like hydrophobic groups, hydrogen acceptors and donors, etc.), are often used in drug design to describe the medicinal
activity of potential drugs (or ‘ligands’). This medicinal activity is produced by interaction of the functional groups on
the ligand with a binding site on a target protein. In identifying structure-activity relations of this kind there are three
principal issues: (1) It is often difficult to “align” the ligands in order to identify common structural properties that
may be responsible for activity; (2) Ligands in solution can adopt different shapes (or `conformations’) arising from torsional
rotations about bonds. The 3-D molecular substructure is typically sought on one or more low-energy conformers; and (3) Pharmacophore
models must, ideally, predict medicinal activity on some quantitative scale. It has been shown that the logical representation
adopted by Inductive Logic Programming (ILP) naturally resolves many of the difficulties associated with the alignment and
multi-conformation issues. However, the predictions of models constructed by ILP have hitherto only been nominal, predicting
medicinal activity to be present or absent. In this paper, we investigate the construction of two kinds of quantitative pharmacophoric
models with ILP: (a) Models that predict the probability that a ligand is “active”; and (b) Models that predict the actual
medicinal activity of a ligand. Quantitative predictions are obtained by the utilising the following statistical procedures
as background knowledge: logistic regression and naive Bayes, for probability prediction; linear and kernel regression, for
activity prediction. The multi-conformation issue and, more generally, the relational representation used by ILP results in
some special difficulties in the use of any statistical procedure. We present the principal issues and some solutions. Specifically,
using data on the inhibition of the protease Thermolysin, we demonstrate that it is possible for an ILP program to construct
good quantitative structure-activity models. We also comment on the relationship of this work to other recent developments
in statistical relational learning.
Editors: Tamás Horváth and Akihiro Yamamoto 相似文献
5.
This article proposes a model of the ways in which dyadic interactions between employees who occupy 1 of 4 archetypal social roles in organizations can lead to either episodic or institutionalized patterns of victimization. The model shows how the occurrence of victimization involving these 4 role types is influenced by organizational variables such as power differences, culture, and access to social capital. The model integrates behavioral and social structural antecedents of victimization to develop a relational perspective on the dynamics of harmful behavior in the workplace. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
6.
An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple algebraic expressions. We first analyze the relationship between the transitive closure of expressions in Relational Algebra and Datalog programs. We then review sequential methods for evaluating transitive closure, distinguishing iterative and direct methods. We address the parallelization of these methods, by discussing various forms of parallelization. Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are applied to linear Datalog queries. We also provide a quantitative analysis that shows the impact of the initial data distribution on the performance of methods.
Recommended by: Patrick Valduriez 相似文献
7.
Wesley W. Chu Ph.D. Ion T. leong Ph.D. Ricky K. Taira Ph.D. 《The VLDB Journal The International Journal on Very Large Data Bases》1994,3(4):445-477
We introduce a semantic data model to capture the hierarchical, spatial, temporal, and evolutionary semantics of images in pictorial databases. This model mimics the user's conceptual view of the image content, providing the framework and guidelines for preprocessing to extract image features. Based on the model constructs, a spatial evolutionary query language (SEQL), which provides direct image object manipulation capabilities, is presented. With semantic information captured in the model, spatial evolutionary queries are answered efficiently. Using an object-oriented platform, a prototype medical-image management system was implemented at UCLA to demonstrate the feasibility of the proposed approach. 相似文献
8.
The aditi deductive database system 总被引:2,自引:0,他引:2
Jayen Vaghanl BSc Kotagiri Ramamohanarao Ph.D. David B. Kemp Ph.D. Zoltan Somogyi Ph.D. Peter J. Stuckey Ph.D. Tim S. Leask BSc James Harland Ph.D. 《The VLDB Journal The International Journal on Very Large Data Bases》1994,3(2):245-288
Deductive databases generalize relational databases by providing support for recursive views and non-atomic data. Aditi is a deductive system based on the client-server model; it is inherently multi-user and capable of exploiting parallelism on shared-memory multiprocessors. The back-end uses relational technology for efficiency in the management of disk-based data and uses optimization algorithms especially developed for the bottom-up evaluation of logical queries involving recursion. The front-end interacts with the user in a logical language that has more expressive power than relational query languages. We present the structure of Aditi, discuss its components in some detail, and present performance figures. 相似文献
9.
The requirements on an object-oriented DBMS for management of information in a large, complex enterprise are presented. These requirements aid in the achievement of an environment characterized by data sharing, open architectures, application and data portability, and assurance of data integrity. They were defined from the point of view of a user of the DBMS; therefore they describe the expected functionality of the DBMS and do not specify the method of implementation to achieve this functionality. They encompass requirements on the data model, query and data manipulation languages, the system architecure, interfaces to the system, change management, and transaction management. 相似文献
10.
Stolorow Robert D.; Atwood George E.; Orange Donna M. 《Canadian Metallurgical Quarterly》2006,23(1):184
In omitting crucial words and sentencees, neglecting relevant citations, and overlooking important distinctions, Jon Mills' (see record 2005-04819-001) critique of relational psychoanalysis significantly misrepresents the authors' viewpoint. This viewpoint seeks to contextualize, but not to nullify, individual worlds of experience and their limiting horizons. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献