全文获取类型
收费全文 | 5897篇 |
免费 | 298篇 |
国内免费 | 10篇 |
专业分类
电工技术 | 151篇 |
综合类 | 23篇 |
化学工业 | 1363篇 |
金属工艺 | 77篇 |
机械仪表 | 154篇 |
建筑科学 | 238篇 |
矿业工程 | 2篇 |
能源动力 | 191篇 |
轻工业 | 662篇 |
水利工程 | 57篇 |
石油天然气 | 17篇 |
武器工业 | 1篇 |
无线电 | 881篇 |
一般工业技术 | 882篇 |
冶金工业 | 522篇 |
原子能技术 | 39篇 |
自动化技术 | 945篇 |
出版年
2023年 | 50篇 |
2022年 | 228篇 |
2021年 | 237篇 |
2020年 | 117篇 |
2019年 | 120篇 |
2018年 | 169篇 |
2017年 | 143篇 |
2016年 | 201篇 |
2015年 | 154篇 |
2014年 | 235篇 |
2013年 | 391篇 |
2012年 | 333篇 |
2011年 | 405篇 |
2010年 | 283篇 |
2009年 | 303篇 |
2008年 | 275篇 |
2007年 | 250篇 |
2006年 | 238篇 |
2005年 | 181篇 |
2004年 | 151篇 |
2003年 | 135篇 |
2002年 | 144篇 |
2001年 | 104篇 |
2000年 | 94篇 |
1999年 | 105篇 |
1998年 | 213篇 |
1997年 | 152篇 |
1996年 | 110篇 |
1995年 | 81篇 |
1994年 | 87篇 |
1993年 | 74篇 |
1992年 | 49篇 |
1991年 | 27篇 |
1990年 | 49篇 |
1989年 | 31篇 |
1988年 | 28篇 |
1987年 | 24篇 |
1986年 | 10篇 |
1985年 | 16篇 |
1984年 | 22篇 |
1983年 | 18篇 |
1982年 | 16篇 |
1981年 | 15篇 |
1980年 | 23篇 |
1979年 | 10篇 |
1977年 | 12篇 |
1976年 | 10篇 |
1975年 | 16篇 |
1974年 | 8篇 |
1965年 | 9篇 |
排序方式: 共有6205条查询结果,搜索用时 0 毫秒
81.
Intensional query answering by partial evaluation 总被引:1,自引:0,他引:1
Giuseppe de Giacomo 《Journal of Intelligent Information Systems》1996,7(3):205-233
82.
Giuseppe Ascia Vincenzo Catania Alessandro G. Di Nuovo Maurizio Palesi Davide Patti 《Applied Soft Computing》2011,11(1):382-398
Multi-objective evolutionary algorithms (MOEAs) have received increasing interest in industry because they have proved to be powerful optimizers. Despite the great success achieved, however, MOEAs have also encountered many challenges in real-world applications. One of the main difficulties in applying MOEAs is the large number of fitness evaluations (objective calculations) that are often needed before an acceptable solution can be found. There are, in fact, several industrial situations in which fitness evaluations are computationally expensive and the time available is very short. In these applications efficient strategies to approximate the fitness function have to be adopted, looking for a trade-off between optimization performance and efficiency. This is the case in designing a complex embedded system, where it is necessary to define an optimal architecture in relation to certain performance indexes while respecting strict time-to-market constraints. This activity, known as design space exploration (DSE), is still a great challenge for the EDA (electronic design automation) community. One of the most important bottlenecks in the overall design flow of an embedded system is due to simulation. Simulation occurs at every phase of the design flow and is used to evaluate a system which is a candidate for implementation. In this paper we focus on system level design, proposing an extensive comparison of the state-of-the-art of MOEA approaches with an approach based on fuzzy approximation to speed up the evaluation of a candidate system configuration. The comparison is performed in a real case study: optimization of the performance and power dissipation of embedded architectures based on a Very Long Instruction Word (VLIW) microprocessor in a mobile multimedia application domain. The results of the comparison demonstrate that the fuzzy approach outperforms in terms of both performance and efficiency the state of the art in MOEA strategies applied to DSE of a parameterized embedded system. 相似文献
83.
Vincenza Carchiolo Michele Malgeri Giuseppe Mangioni Vincenzo Nicosia 《Journal of Parallel and Distributed Computing》2010
Nature is a great source of inspiration for scientists, because natural systems seem to be able to find the best way to solve a given problem by using simple and robust mechanisms. Studying complex natural systems, scientists usually find that simple local dynamics lead to sophisticated macroscopic structures and behaviour. It seems that some kind of local interaction rules naturally allow the system to auto-organize itself as an efficient and robust structure, which can easily solve different tasks. Examples of such complex systems are social networks, where a small set of basic interaction rules leads to a relatively robust and efficient communication structure. In this paper, we present PROSA, a semantic peer-to-peer (P2P) overlay network inspired by social dynamics. The way queries are forwarded and links among peers are established in PROSA resemble the way people ask other people for collaboration, help or information. Behaving as a social network of peers, PROSA naturally evolves to a small world, where all peers can be reached in a fast and efficient way. The underlying algorithm used for query forwarding, based only on local choices, is both reliable and effective: peers sharing similar resources are eventually connected with each other, allowing queries to be successfully answered in a really small amount of time. The resulting emergent structure can guarantee fast responses and good query recall. 相似文献
84.
85.
This paper proposes two maintenance schemes for reused products. In order to reduce the purchasing cost or conform to the concept of environmental protection, reuse is considered as one of the most efficient strategies. However, the initial quality of reused product is often inferior to the new one and then product failures will occur frequently during usage period. Therefore, two periodical preventive maintenance (PM) policies in this paper are developed to decrease the high failure rate of the second-hand products. When a second-hand product with Weibull life time distribution of known age is intended to be used for a pre-specified period of time, the optimal number of PM actions and the corresponding maintenance degree are derived such that the expected total maintenance cost is minimized. The impact of providing preventive maintenance is illustrated through numerical examples. 相似文献
86.
Claudia Archetti Luca Bertazzi Giuseppe Paletta M. Grazia Speranza 《Computers & Operations Research》2011
We consider a production-distribution system, where a facility produces one commodity which is distributed to a set of retailers by a fleet of vehicles. Each retailer defines a maximum level of the inventory. The production policy, the retailers replenishment policies and the transportation policy have to be determined so as to minimize the total system cost. The overall cost is composed by fixed and variable production costs at the facility, inventory costs at both facility and retailers and routing costs. We study two different types of replenishment policies. The well-known order-up to level (OU) policy, where the quantity shipped to each retailer is such that the level of its inventory reaches the maximum level, and the maximum level (ML) policy, where the quantity shipped to each retailer is such that the inventory is not greater than the maximum level. We first show that when the transportation is outsourced, the problem with OU policy is NP-hard, whereas there exists a class of instances where the problem with ML policy can be solved in polynomial time. We also show the worst-case performance of the OU policy with respect to the more flexible ML policy. Then, we focus on the ML policy and the design of a hybrid heuristic. We also present an exact algorithm for the solution of the problem with one vehicle. Results of computational experiments carried out on small size instances show that the heuristic can produce high quality solutions in a very short amount of time. Results obtained on a large set of randomly generated problem instances are also shown, aimed at comparing the two policies. 相似文献
87.
88.
Lo JT 《Neural computation》2011,23(10):2626-2682
A biologically plausible low-order model (LOM) of biological neural networks is proposed. LOM is a recurrent hierarchical network of models of dendritic nodes and trees; spiking and nonspiking neurons; unsupervised, supervised covariance and accumulative learning mechanisms; feedback connections; and a scheme for maximal generalization. These component models are motivated and necessitated by making LOM learn and retrieve easily without differentiation, optimization, or iteration, and cluster, detect, and recognize multiple and hierarchical corrupted, distorted, and occluded temporal and spatial patterns. Four models of dendritic nodes are given that are all described as a hyperbolic polynomial that acts like an exclusive-OR logic gate when the model dendritic nodes input two binary digits. A model dendritic encoder that is a network of model dendritic nodes encodes its inputs such that the resultant codes have an orthogonality property. Such codes are stored in synapses by unsupervised covariance learning, supervised covariance learning, or unsupervised accumulative learning, depending on the type of postsynaptic neuron. A masking matrix for a dendritic tree, whose upper part comprises model dendritic encoders, enables maximal generalization on corrupted, distorted, and occluded data. It is a mathematical organization and idealization of dendritic trees with overlapped and nested input vectors. A model nonspiking neuron transmits inhibitory graded signals to modulate its neighboring model spiking neurons. Model spiking neurons evaluate the subjective probability distribution (SPD) of the labels of the inputs to model dendritic encoders and generate spike trains with such SPDs as firing rates. Feedback connections from the same or higher layers with different numbers of unit-delay devices reflect different signal traveling times, enabling LOM to fully utilize temporally and spatially associated information. Biological plausibility of the component models is discussed. Numerical examples are given to demonstrate how LOM operates in retrieving, generalizing, and unsupervised and supervised learning. 相似文献
89.
90.
The representer theorem for kernel methods states that the solution of the associated variational problem can be expressed
as the linear combination of a finite number of kernel functions. However, for non-smooth loss functions, the analytic characterization
of the coefficients poses nontrivial problems. Standard approaches resort to constrained optimization reformulations which,
in general, lack a closed-form solution. Herein, by a proper change of variable, it is shown that, for any convex loss function,
the coefficients satisfy a system of algebraic equations in a fixed-point form, which may be directly obtained from the primal
formulation. The algebraic characterization is specialized to regression and classification methods and the fixed-point equations
are explicitly characterized for many loss functions of practical interest. The consequences of the main result are then investigated
along two directions. First, the existence of an unconstrained smooth reformulation of the original non-smooth problem is
proven. Second, in the context of SURE (Stein’s Unbiased Risk Estimation), a general formula for the degrees of freedom of
kernel regression methods is derived. 相似文献