全文获取类型
收费全文 | 246篇 |
免费 | 10篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 5篇 |
综合类 | 16篇 |
化学工业 | 16篇 |
金属工艺 | 2篇 |
机械仪表 | 5篇 |
建筑科学 | 22篇 |
矿业工程 | 6篇 |
能源动力 | 2篇 |
轻工业 | 12篇 |
水利工程 | 7篇 |
石油天然气 | 2篇 |
无线电 | 6篇 |
一般工业技术 | 11篇 |
冶金工业 | 77篇 |
原子能技术 | 3篇 |
自动化技术 | 69篇 |
出版年
2023年 | 2篇 |
2022年 | 4篇 |
2021年 | 6篇 |
2020年 | 5篇 |
2019年 | 5篇 |
2018年 | 2篇 |
2017年 | 3篇 |
2016年 | 8篇 |
2015年 | 6篇 |
2014年 | 8篇 |
2013年 | 17篇 |
2012年 | 8篇 |
2011年 | 24篇 |
2010年 | 20篇 |
2009年 | 16篇 |
2008年 | 17篇 |
2007年 | 8篇 |
2006年 | 12篇 |
2005年 | 15篇 |
2004年 | 15篇 |
2003年 | 11篇 |
2002年 | 10篇 |
2001年 | 8篇 |
2000年 | 1篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1988年 | 1篇 |
1985年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1974年 | 2篇 |
1958年 | 2篇 |
1955年 | 1篇 |
1954年 | 1篇 |
排序方式: 共有261条查询结果,搜索用时 0 毫秒
1.
Yoon Carolyn; Feinberg Fred; Hu Ping; Gutchess Angela Hall; Hedden Trey; Chen Hiu-Ying Mary; Jing Qicheng; Cui Yao; Park Denise C. 《Canadian Metallurgical Quarterly》2004,19(3):379
Understanding how aging influences cognition across different cultures has been hindered by a lack of standardized, cross-referenced verbal stimuli. This study introduces a database of such item-level stimuli for both younger and older adults, in China and the United States, and makes 3 distinct contributions. First, the authors specify which item categories generalize across age and/or cultural groups, rigorously quantifying differences among them. Second, they introduce novel, powerful methods to measure between-group differences in freely generated ranked data, the rank-ordered logit model and Hellinger Affinity. Finally, a broad archive of tested, cross-linguistic stimuli is now freely available to researchers: data, similarity measures, and all stimulus materials for 105 categories and 4 culture-by-age groups, comprising over 10,000 fully translated unique item responses. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
2.
Text planning is traditionally done as a separate process, independent of linguistic realization. However, I show in this paper that it is essential for a text planner to know the linguistic consequences of its actions. The choice of how to realize an element affects how much information is conveyed (e.g., “Floyd arrived safely in Boston” vs. “Floyd landed safely at Logan”) and what other information can be added (e.g., “Peter was deciding for an hour” vs. *“Peter made a decision for an hour”). The choice of realization also affects how the relative salience of the elements being expressed will be perceived (e.g., “The green car is in the garage” vs. “The car in the garage is green”). I have defined an intermediate level of representation for text planning, called the Text Structure. It is an abstract linguistic level that reflects germane linguistic constraints while abstracting away from syntactic detail. This representation allows the text planner to have greater control over the decisions, so that it can take advantage of the expressiveness of language to convey subtleties of meaning. More importantly, the Text Structure allows the generation process overall to be incremental, since it ensures that the text plan being composed will always be expressible in the language. La planification de textes est habituellement réalisée séparément, sans tenir compte de la réalisation linguistique. Cependant, ľauteur demontre dans cet article qu'il est essentiel à un planificateur de textes de connai̊tre les conséquences linguistiques de ses actions. Le choix de la méhode de réalisation ?un élément influe sur la quantité?informations qui est transmise (par ex.: 〈〈 Floyd est arrivé sain et sauf à Boston 〉〉 et 〈〈 Floyd a atterri sain et sauf àľaéroport Logan 〉〉) et sur quelle autre information peut ětre ajoutée. Le choix de la méthode de réalisation influe également sur la façon dont les caractères saillants des ééments qui sont exprimés seront perçus (par ex.: 〈〈 la voiture verte est dans le garage 〉〉 et 〈〈 la voiture dans le garage est verte 〉〉). L'auteur a défini un niveau intérmediaire de représentation pour la planification de textes qu'il a appelé structure de texte. Il; s'agit ?'un niveau linguistique abstrait qui refléte les contraintes linguistiques appropriées tout en s'éloignant du détail syntaxique. Cette représentation permet au planificateur de textes ?avoir un meilleur contrǒle des décisions, et done de tirer profit de la force ?expression du langage afin de tenir compte des subtiliés de sens. Plus important encore, la structure de texte permet au processus de génération ?ětre incrémentiel, car elle s'assure que le plan de texte en voie de composition soit toujours exprimable dans le langage. 相似文献
3.
Kosta Došen 《Journal of Logic, Language and Information》1992,1(3):173-201
The goal of this paper is to show how modal logic may be conceived as recording the derived rules of a logical system in the system itself. This conception of modal logic was propounded by Dana Scott in the early seventies. Here, similar ideas are pursued in a context less classical than Scott's.First a family of propositional logical systems is considered, which is obtained by gradually adding structural rules to a variant of the nonassociative Lambek calculus. In this family one finds systems that correspond to the associative Lambek calculus, linear logic, relevant logics, BCK logic and intuitionistic logic. Above these basic systems, sequent systems parallel to the basic systems are constructed, which formalize various notions of derived rules for the basic systems. The deduction theorem is provable for the basic systems if, and only if, they are at least as strong as systems corresponding to linear logic, or BCK logic, depending on the language, and their deductive metalogic is not stronger than they are.However, though we do not always have the deduction theorem, we may always obtain a modal analogue of the deduction theorem for conservative modal extensions of the basic systems. Modal postulates which are necessary and sufficient for that are postulates of S4 plus modal postulates which mimic structural rules. For example, the modal postulates which Girard has recently considered in linear logic are necessary and sufficient for the modal analogue of the deduction theorem.All this may lead towards results about functional completeness in categories. When functional completeness, which is analogous to the deduction theorem, fails, we may perhaps envisage a modal analogue of functional completeness in a modal category, of which our original category is a full subcategory. 相似文献
4.
Raed Shatnawi Author Vitae Wei Li Author Vitae 《Journal of Systems and Software》2008,81(11):1868-1882
Many empirical studies have found that software metrics can predict class error proneness and the prediction can be used to accurately group error-prone classes. Recent empirical studies have used open source systems. These studies, however, focused on the relationship between software metrics and class error proneness during the development phase of software projects. Whether software metrics can still predict class error proneness in a system’s post-release evolution is still a question to be answered. This study examined three releases of the Eclipse project and found that although some metrics can still predict class error proneness in three error-severity categories, the accuracy of the prediction decreased from release to release. Furthermore, we found that the prediction cannot be used to build a metrics model to identify error-prone classes with acceptable accuracy. These findings suggest that as a system evolves, the use of some commonly used metrics to identify which classes are more prone to errors becomes increasingly difficult and we should seek alternative methods (to the metric-prediction models) to locate error-prone classes if we want high accuracy. 相似文献
5.
在网络层次上进行区域交通信号控制、交通分配和路径诱导是缓解交通堵塞的有效途径之一。为进一步提高城市交通网络分类检测的准确性,将支持向量机(Support Vector Machine)应用于交通事件的模式分类研究。通过提出一种基于多类别支持向量机的交通模式分类方法,设计了适合该检测系统的网络结构。仿真结果表明:相对于其他算法,城市交通网络的状态可分为数量有限且不同类型的模式,并且这些模式不断重复出现,当系统识别出网络处于某种模式时,就可参照事先确定的优化参数及策略进行交通控制和诱导,以缓解交通拥塞,提高交通系统的运行效率。该网络结构对于小样本数据具有检测率高、误报率低的优点,完全适用于城市交通的模式分类,同时也存在不足之处,指出了今后进一步研究的方向。 相似文献
6.
7.
Franz Baader Werner Nutt 《Applicable Algebra in Engineering, Communication and Computing》1996,7(4):309-337
We study the class of theories for which solving unification problems is equivalent to solving systems of linear equations over a semiring. It encompasses important examples like the theories of Abelian monoids, idempotent Abelian monoids, and Abelian groups. This class has been introduced by the authors independently of each other as commutative theories (Baader) and monoidal theories (Nutt).We show that commutative theories and monoidal theories indeed define the same class (modulo a translation of the signature), and we prove that it is undecidable whether a given theory belongs to it. In the remainder of the paper we investigate combinations of commutative/monoidal theories with other theories. We show that finitary commutative/monoidal theories always satisfy the requirements for applying general methods developed for the combination of unification algorithms for disjoint equational theories.Then we study the adjunction of monoids of homomorphisms to commutative/monoidal theories. This is a special case of a non-disjoint combination, which has an algebraic counterpart in the corresponding semiring. By studying equations over this semiring, we identify a large subclass of commutative/monoidal theories that are of unification type zero. We also show with methods from linear algebra that unitary and finitary commutative/monoidal theories do not change their unification type when they are augmented by a finite monoid of homomor-phisms, and how algorithms for the extended theory can be obtained from algorithms for the basic theory. 相似文献
8.
9.
In this paper, we consider Centroidal Voronoi Tessellations (CVTs) and study their regularity. CVTs are geometric structures that enable regular tessellations of geometric objects and are widely used in shape modelling and analysis. While several efficient iterative schemes, with defined local convergence properties, have been proposed to compute CVTs, little attention has been paid to the evaluation of the resulting cell decompositions. In this paper, we propose a regularity criterion that allows us to evaluate and compare CVTs independently of their sizes and of their cell numbers. This criterion allows us to compare CVTs on a common basis. It builds on earlier theoretical work showing that second moments of cells converge to a lower bound when optimizing CVTs. In addition to proposing a regularity criterion, this paper also considers computational strategies to determine regular CVTs. We introduce a hierarchical framework that propagates regularity over decomposition levels and hence provides CVTs with provably better regularities than existing methods. We illustrate these principles with a wide range of experiments on synthetic and real models. 相似文献
10.
A. Yu. Dorogov 《Cybernetics and Systems Analysis》2001,37(2):175-181
Structural models of modular neural networks without loops are considered. The notion of a weakly connected network is introduced. A genetic principle of generation of weakly connected neural networks is proposed, and its reproductive power is proved on the basis of the theory of categories. Algorithmic realizations of structural synthesis are considered. Some examples are given. 相似文献