全文获取类型
收费全文 | 2679篇 |
免费 | 119篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 14篇 |
综合类 | 7篇 |
化学工业 | 539篇 |
金属工艺 | 306篇 |
机械仪表 | 95篇 |
建筑科学 | 92篇 |
矿业工程 | 7篇 |
能源动力 | 62篇 |
轻工业 | 401篇 |
水利工程 | 28篇 |
石油天然气 | 11篇 |
无线电 | 130篇 |
一般工业技术 | 357篇 |
冶金工业 | 219篇 |
原子能技术 | 12篇 |
自动化技术 | 520篇 |
出版年
2024年 | 6篇 |
2023年 | 15篇 |
2022年 | 56篇 |
2021年 | 67篇 |
2020年 | 50篇 |
2019年 | 75篇 |
2018年 | 137篇 |
2017年 | 138篇 |
2016年 | 139篇 |
2015年 | 135篇 |
2014年 | 94篇 |
2013年 | 156篇 |
2012年 | 145篇 |
2011年 | 737篇 |
2010年 | 146篇 |
2009年 | 138篇 |
2008年 | 102篇 |
2007年 | 68篇 |
2006年 | 64篇 |
2005年 | 46篇 |
2004年 | 39篇 |
2003年 | 30篇 |
2002年 | 27篇 |
2001年 | 22篇 |
2000年 | 18篇 |
1999年 | 19篇 |
1998年 | 36篇 |
1997年 | 28篇 |
1996年 | 17篇 |
1995年 | 11篇 |
1994年 | 12篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1991年 | 2篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1983年 | 1篇 |
1981年 | 3篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1976年 | 1篇 |
1973年 | 1篇 |
1941年 | 1篇 |
排序方式: 共有2800条查询结果,搜索用时 46 毫秒
61.
We propose a data mining approach to predict human wine taste preferences that is based on easily available analytical tests at the certification step. A large dataset (when compared to other studies in this domain) is considered, with white and red vinho verde samples (from Portugal). Three regression techniques were applied, under a computationally efficient procedure that performs simultaneous variable and model selection. The support vector machine achieved promising results, outperforming the multiple regression and neural network methods. Such model is useful to support the oenologist wine tasting evaluations and improve wine production. Furthermore, similar techniques can help in target marketing by modeling consumer tastes from niche markets. 相似文献
62.
Rafael Antonello Stênio Fernandes Josilene Moreira Paulo Cunha Carlos Kamienski Djamel Sadok 《Multimedia Systems》2009,15(1):33-47
Virtual Worlds (VW), such as Massive Multiplayer Online Social Games, have been gaining increasing attention in the last few
years, mainly due to the new way users interact with them. However, little effort has been devoted to understand their traffic
profile and the implications to the traffic management area. With the current growing rate of VWs’ usage, their traffic demand
could eventually impose a significant burden on the operation of a typical Internet Service Provider (ISP) network. In this
paper, we seek to understand the traffic behavior of an increasingly popular VW application, namely Second Life (SL), from
both the connection and network level perspectives. We also show results of a traffic analysis of a SL client, when an avatar
performs different actions in the VW, at different places and under different network conditions. Our results show that SL
makes intensive use of network resources (mostly bandwidth), since the capacity needed for having a full SL experience (listening
to live music) may reach 500 kbps. We then extend the traffic analysis work on SL by providing analytical models for its traffic
profile. We aim at helping the network management and planning area to estimate the impact of an intense use of such VW on
access links or core networks. Such synthetic models are also useful to the networking research community for the use in network
simulations. 相似文献
63.
José Rosado Filipe Silva Vítor Santos António Amaro 《Journal of Intelligent and Robotic Systems》2016,83(3-4):375-391
In order to properly function in real-world environments, the gait of a humanoid robot must be able to adapt to new situations as well as to deal with unexpected perturbations. A promising research direction is the modular generation of movements that results from the combination of a set of basic primitives. In this paper, we present a robot control framework that provides adaptive biped locomotion by combining the modulation of dynamic movement primitives (DMPs) with rhythm and phase coordination. The first objective is to explore the use of rhythmic movement primitives for generating biped locomotion from human demonstrations. The second objective is to evaluate how the proposed framework can be used to generalize and adapt the human demonstrations by adjusting a few open control parameters of the learned model. This paper contributes with a particular view into the problem of adaptive locomotion by addressing three aspects that, in the specific context of biped robots, have not received much attention. First, the demonstrations examples are extracted from human gaits in which the human stance foot will be constrained to remain in flat contact with the ground, forcing the “bent-knee” at all times in contrast with the typical straight-legged style. Second, this paper addresses the important concept of generalization from a single demonstration. Third, a clear departure is assumed from the classical control that forces the robot’s motion to follow a predefined fixed timing into a more event-based controller. The applicability of the proposed control architecture is demonstrated by numerical simulations, focusing on the adaptation of the robot’s gait pattern to irregularities on the ground surface, stepping over obstacles and, at the same time, on the tolerance to external disturbances. 相似文献
64.
It is known that the dynamic equations of motion for constrained mechanical multibody systems are frequently formulated using the Newton–Euler’s approach, which is augmented with the acceleration constraint equations. This formulation results in the establishment of a mixed set of partial differential and algebraic equations, which are solved in order to predict the dynamic behavior of general multibody systems. The classical solution of the equations of motion is highly prone to constraints violation because the position and velocity constraint equations are not fulfilled. In this work, a general and comprehensive methodology to eliminate the constraints violation at the position and velocity levels is offered. The basic idea of the described approach is to add corrective terms to the position and velocity vectors with the intent to satisfy the corresponding kinematic constraint equations. These corrective terms are evaluated as a function of the Moore–Penrose generalized inverse of the Jacobian matrix and of the kinematic constraint equations. The described methodology is embedded in the standard method to solve the equations of motion based on the technique of Lagrange multipliers. Finally, the effectiveness of the described methodology is demonstrated through the dynamic modeling and simulation of different planar and spatial multibody systems. The outcomes in terms of constraints violation at the position and velocity levels, conservation of the total energy and computational efficiency are analyzed and compared with those obtained with the standard Lagrange multipliers method, the Baumgarte stabilization method, the augmented Lagrangian formulation, the index-1 augmented Lagrangian, and the coordinate partitioning method. 相似文献
65.
S��ndor V��gv?lgyi 《Acta Informatica》2011,48(5-6):317-361
We present an additional feature to the Challenge Handshake Authentication Protocol. It makes the protocol resilient to offline brute-force/dictionary attacks. We base our contribution to the protocol on the concept of a rewrite complement for ground term rewrite systems (GTRSs). We also introduce and study the notion of a type-based complement which is a special case of a rewrite complement. We show the following decision results. Given GTRSs A, C, and a reduced GTRS B over some ranked alphabet ??, one can decide whether C is a type-based complement of A for B. Given a GTRS A and a reduced GTRS B over some ranked alphabet ??, one can decide whether there is a GTRS C such that C is a type-based complement of A for B. If the answer is yes, then we can construct such a GTRS C. 相似文献
66.
This paper is concerned with model-based isolation and estimation of additive faults in discrete-time linear Gaussian systems. The isolation problem is stated as a multiple composite hypothesis testing on the innovation sequence of the Kalman filter (KF) that considers the system operating under fault-free conditions. Fault estimation is carried out, after isolating a fault mode, by using the Maximum a Posteriori (MAP) criterion. An explicit solution is presented for both fault isolation and estimation when the parameters of the fault modes are assumed to be realizations of specific random variables (RV). 相似文献
67.
Francisco Jes��s Mart��n-Mateos Jos�� Luis Ruiz-Reina Jos�� Antonio Alonso Mar��a Jos�� Hidalgo 《Journal of Automated Reasoning》2011,47(3):229-250
Higman??s lemma is an important result in infinitary combinatorics, which has been formalized in several theorem provers. In this paper we present a formalization and proof of Higman??s Lemma in the ACL2 theorem prover. Our formalization is based on a proof by Murthy and Russell, where the key termination argument is justified by the multiset relation induced by a well-founded relation. To our knowledge, this is the first mechanization of this proof. 相似文献
68.
Simultaneous aligning and smoothing of surface triangulations 总被引:1,自引:0,他引:1
Jos�� M. Escobar Rafael Montenegro Eduardo Rodr��guez Gustavo Montero 《Engineering with Computers》2011,27(1):17-29
In this work we develop a procedure to deform a given surface triangulation to obtain its alignment with interior curves.
These curves are defined by splines in a parametric space and, subsequently, mapped to the surface triangulation. We have
restricted our study to orthogonal mapping, so we require the curves to be included in a patch of the surface that can be
orthogonally projected onto a plane (our parametric space). For example, the curves can represent interfaces between different
materials or boundary conditions, internal boundaries or feature lines. Another setting in which this procedure can be used
is the adaption of a reference mesh to changing curves in the course of an evolutionary process. Specifically, we propose
a new method that moves the nodes of the mesh, maintaining its topology, in order to achieve two objectives simultaneously:
the piecewise approximation of the curves by edges of the surface triangulation and the optimization of the resulting mesh.
We will designate this procedure as projecting/smoothing method and it is based on the smoothing technique that we have introduced for surface triangulations in previous works. The
mesh quality improvement is obtained by an iterative process where each free node is moved to a new position that minimizes a certain objective function. The minimization process is done on the parametric
plane attending to the surface piece-wise approximation and to an algebraic quality measure (mean ratio) of the set of triangles that are connected to the free node. So, the 3-D local projecting/smoothing problem is reduced to a 2-D optimization problem. Several applications of this method
are presented. 相似文献
69.
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev?CYao) intruders are modeled by Horn theories and security analysis boils down to solving the derivation problem for Horn theories. This approach and the tools based on this approach, including ProVerif, have been very successful in the automatic analysis of cryptographic protocols. However, dealing with the algebraic properties of operators, such as the exclusive OR (XOR), which are frequently used in cryptographic protocols has been problematic. In particular, ProVerif cannot deal with XOR. In this paper, we show how to reduce the derivation problem for Horn theories with XOR to the XOR-free case. Our reduction works for an expressive class of Horn theories. A large class of intruder capabilities and protocols that employ the XOR operator can be modeled by these theories. Our reduction allows us to carry out protocol analysis using tools, such as ProVerif, that cannot deal with XOR, but are very efficient in the XOR-free case. We implemented our reduction and, in combination with ProVerif, used it for the fully automatic analysis of several protocols that employ the XOR operator. Among others, our analysis revealed a new attack on an IBM security module. 相似文献
70.
We thoroughly study the behavioural theory of epi, a ??-calculus extended with polyadic synchronisation. We show that the natural contextual equivalence, barbed congruence, coincides with early bisimilarity, which is thus its co-inductive characterisation. Moreover, we relate early bisimilarity with the other usual notions, ground, late and open, obtaining a lattice of equivalence relations that clarifies the relationship among the ??standard?? bisimilarities. Furthermore, we apply the theory developed to obtain an expressiveness result: epi extended with key encryption primitives may be fully abstractly encoded in the original epi calculus. The proposed encoding is sound and complete with respect to barbed congruence; hence, cryptographic epi (crypto-epi) gets behavioural theory for free, which contrasts with other process languages with cryptographic constructs that usually require a big effort to develop such theory. Therefore, it is possible to use crypto-epi to analyse and to verify properties of security protocols using equational reasoning. To illustrate this claim, we prove compliance with symmetric and asymmetric cryptographic system laws, and the correctness of a protocol of secure message exchange. 相似文献