全文获取类型
收费全文 | 4802篇 |
免费 | 123篇 |
国内免费 | 42篇 |
专业分类
电工技术 | 152篇 |
综合类 | 40篇 |
化学工业 | 1100篇 |
金属工艺 | 114篇 |
机械仪表 | 173篇 |
建筑科学 | 139篇 |
矿业工程 | 23篇 |
能源动力 | 159篇 |
轻工业 | 332篇 |
水利工程 | 31篇 |
石油天然气 | 12篇 |
武器工业 | 2篇 |
无线电 | 439篇 |
一般工业技术 | 726篇 |
冶金工业 | 835篇 |
原子能技术 | 68篇 |
自动化技术 | 622篇 |
出版年
2023年 | 18篇 |
2022年 | 74篇 |
2021年 | 85篇 |
2020年 | 40篇 |
2019年 | 76篇 |
2018年 | 86篇 |
2017年 | 66篇 |
2016年 | 82篇 |
2015年 | 68篇 |
2014年 | 104篇 |
2013年 | 209篇 |
2012年 | 170篇 |
2011年 | 274篇 |
2010年 | 239篇 |
2009年 | 264篇 |
2008年 | 259篇 |
2007年 | 221篇 |
2006年 | 197篇 |
2005年 | 215篇 |
2004年 | 126篇 |
2003年 | 141篇 |
2002年 | 133篇 |
2001年 | 106篇 |
2000年 | 86篇 |
1999年 | 94篇 |
1998年 | 296篇 |
1997年 | 169篇 |
1996年 | 134篇 |
1995年 | 87篇 |
1994年 | 102篇 |
1993年 | 114篇 |
1992年 | 59篇 |
1991年 | 51篇 |
1990年 | 52篇 |
1989年 | 33篇 |
1988年 | 38篇 |
1987年 | 30篇 |
1986年 | 26篇 |
1985年 | 47篇 |
1984年 | 33篇 |
1983年 | 38篇 |
1982年 | 30篇 |
1981年 | 41篇 |
1980年 | 27篇 |
1979年 | 19篇 |
1978年 | 17篇 |
1977年 | 24篇 |
1976年 | 36篇 |
1975年 | 5篇 |
1974年 | 8篇 |
排序方式: 共有4967条查询结果,搜索用时 15 毫秒
71.
72.
Ken Kaneiwa 《Knowledge》2011,24(5):629-641
Order-sorted logic is a useful tool for knowledge representation and reasoning because it enables representation of sorted terms and formulas along with partially ordered sorts (called sort-hierarchy). However, this logic cannot represent more complex sorted expressions when they are true in any possible world (as rigid) or some possible worlds (as modality) such as time, space, belief, or situation. In this study, we extend order-sorted logic by introducing existential rigidity and many modalities. In the extended logic, sorted modal formulas are interpreted over the Cartesian product of sets of possible worlds. We present a new labeled tableau calculus to check the (un)satisfiability and validity of sorted modal formulas. 相似文献
73.
We propose a system that allows the user to design a continuous flow animation starting from a still fluid image. The basic idea is to apply the fluid motion extracted from a video example to the target image. The system first decomposes the video example into three components, an average image, a flow field and residuals. The user then specifies equivalent information over the target image. The user manually paints the rough flow field, and the system automatically refines it using the estimated gradients of the target image. The user semi-automatically transfers the residuals onto the target image. The system then approximates the average image and synthesizes an animation on the target image by adding the transferred residuals and warping them according to the user-specified flow field. Finally, the system adjusts the appearance of the resulting animation by applying histogram matching. We designed animations of various pictures, such as rivers, waterfalls, fires, and smoke. 相似文献
74.
Jorge Lopez-Moreno Jorge JimenezSunil Hadap Ken AnjyoErik Reinhard Diego Gutierrez 《Computers & Graphics》2011,35(1):99-111
Recent works in image editing are opening up new possibilities to manipulate and enhance input images. Within this context, we leverage well-known characteristics of human perception along with a simple depth approximation algorithm to generate non-photorealistic renditions that would be difficult to achieve with existing methods. Once a perceptually plausible depth map is obtained from the input image, we show how simple algorithms yield powerful new depictions of such an image. Additionally, we show how artistic manipulation of depth maps can be used to create novel non-photorealistic versions, for which we provide the user with an intuitive interface. Our real-time implementation on graphics hardware allows the user to efficiently explore artistic possibilities for each image. We show results produced with six different styles proving the versatility of our approach, and validate our assumptions and simplifications by means of a user study. 相似文献
75.
Len Seligman Paul Lehner Ken Smith Chris Elsaesser David Mattox 《Journal of Intelligent Information Systems》2000,14(1):29-50
We are interested in information management for decision support applications, especially those that monitor distributed, heterogeneous databases to assess time-critical decisions. Users of such applications can easily be overwhelmed with data that may change rapidly, may conflict, and may be redundant. Developers are faced with a dilemma: either filter out most information and risk excluding critical items, or gather possibly irrelevant or redundant information, and overwhelm the decision maker. This paper describes a solution to this dilemma called decision-centric information monitoring (DCIM). First, we observe that decision support systems should monitor only information that can potentially change some decision. We present an architecture for DCIM that meets the requirements implied by this observation. We describe techniques for identifying the highest value information to monitor and techniques for monitoring that information despite autonomy, distribution, and heterogeneity of data sources. Finally, we present lessons learned from building LOOKOUT, which is to our knowledge the first implementation of a top-to-bottom system performing decision-centric information monitoring. 相似文献
76.
Replica Placement Strategies in Data Grid 总被引:1,自引:0,他引:1
Replication is a technique used in Data Grid environments that helps to reduce access latency and network bandwidth utilization.
Replication also increases data availability thereby enhancing system reliability. The research addresses the problem of replication
in Data Grid environment by investigating a set of highly decentralized dynamic replica placement algorithms. Replica placement
algorithms are based on heuristics that consider both network latency and user requests to select the best candidate sites
to place replicas. Due to dynamic nature of Grid, the candidate site holds replicas currently may not be the best sites to
fetch replicas in subsequent periods. Therefore, a replica maintenance algorithm is proposed to relocate replicas to different
sites if the performance metric degrades significantly. The study of our replica placement algorithms is carried out using
a model of the EU Data Grid Testbed 1 [Bell et al. Comput. Appl., 17(4), 2003] sites and their associated network geometry. We validate our replica placement
algorithms with total file transfer times, the number of local file accesses, and the number of remote file accesses. 相似文献
77.
Evans WJ Yoo CS Lee GW Cynn H Lipp MJ Visbeck K 《The Review of scientific instruments》2007,78(7):073904
We have developed a unique device, a dynamic diamond anvil cell (dDAC), which repetitively applies a time-dependent load/pressure profile to a sample. This capability allows studies of the kinetics of phase transitions and metastable phases at compression (strain) rates of up to 500 GPa/s (approximately 0.16 s(-1) for a metal). Our approach adapts electromechanical piezoelectric actuators to a conventional diamond anvil cell design, which enables precise specification and control of a time-dependent applied load/pressure. Existing DAC instrumentation and experimental techniques are easily adapted to the dDAC to measure the properties of a sample under the varying load/pressure conditions. This capability addresses the sparsely studied regime of dynamic phenomena between static research (diamond anvil cells and large volume presses) and dynamic shock-driven experiments (gas guns, explosive, and laser shock). We present an overview of a variety of experimental measurements that can be made with this device. 相似文献
78.
We propose EMD-L1: a fast and exact algorithm for computing the Earth Mover's Distance (EMD) between a pair of histograms. The efficiency of the new algorithm enables its application to problems that were previously prohibitive due to high time complexities. The proposed EMD-L1 significantly simplifies the original linear programming formulation of EMD. Exploiting the L1 metric structure, the number of unknown variables in EMD-L1 is reduced to O(N) from O(N2) of the original EMD for a histogram with N bins. In addition, the number of constraints is reduced by half and the objective function of the linear program is simplified. Formally, without any approximation, we prove that the EMD-L1 formulation is equivalent to the original EMD with a L1 ground distance. To perform the EMD-L1 computation, we propose an efficient tree-based algorithm, Tree-EMD. Tree-EMD exploits the fact that a basic feasible solution of the simplex algorithm-based solver forms a spanning tree when we interpret EMD-L1 as a network flow optimization problem. We empirically show that this new algorithm has an average time complexity of O(N2), which significantly improves the best reported supercubic complexity of the original EMD. The accuracy of the proposed methods is evaluated by experiments for two computation-intensive problems: shape recognition and interest point matching using multidimensional histogram-based local features. For shape recognition, EMD-L1 is applied to compare shape contexts on the widely tested MPEG7 shape data set, as well as an articulated shape data set. For interest point matching, SIFT, shape context and spin image are tested on both synthetic and real image pairs with large geometrical deformation, illumination change, and heavy intensity noise. The results demonstrate that our EMD-L1-based solutions outperform previously reported state-of-the-art features and distance measures in solving the two tasks. 相似文献
79.
Ken Maynard Patrick Moss Marcus Whitehead S. Narayanan Matt Garay Nathan Brannon Raj Gopal Kantamneni & Todd Kustra 《Expert Systems》2001,18(2):88-98
Although developments on software agents have led to useful applications in automation of routine tasks such as electronic mail filtering, there is a scarcity of research that empirically evaluates the performance of a software agent versus that of a human reasoner, whose problem-solving capabilities the agent embodies. In the context of a game of a chance, namely Yahtzee©, we identified strategies deployed by expert human reasoners and developed a decision tree for agent development. This paper describes the computer implementation of the Yahtzee game as well as the software agent. It also presents a comparison of the performance of humans versus an automated agent. Results indicate that, in this context, the software agent embodies human expertise at a high level of fidelity. 相似文献
80.
Inspired by recent studies regarding dendritic computation, we constructed a recurrent neural network model incorporating dendritic lateral inhibition. Our model consists of an input layer and a neuron layer that includes excitatory cells and an inhibitory cell; this inhibitory cell is activated by the pooled activities of all the excitatory cells, and it in turn inhibits each dendritic branch of the excitatory cells that receive excitations from the input layer. Dendritic nonlinear operation consisting of branch-specifically rectified inhibition and saturation is described by imposing nonlinear transfer functions before summation over the branches. In this model with sufficiently strong recurrent excitation, on transiently presenting a stimulus that has a high correlation with feed- forward connections of one of the excitatory cells, the corresponding cell becomes highly active, and the activity is sustained after the stimulus is turned off, whereas all the other excitatory cells continue to have low activities. But on transiently presenting a stimulus that does not have high correlations with feedforward connections of any of the excitatory cells, all the excitatory cells continue to have low activities. Interestingly, such stimulus-selective sustained response is preserved for a wide range of stimulus intensity. We derive an analytical formulation of the model in the limit where individual excitatory cells have an infinite number of dendritic branches and prove the existence of an equilibrium point corresponding to such a balanced low-level activity state as observed in the simulations, whose stability depends solely on the signal-to-noise ratio of the stimulus. We propose this model as a model of stimulus selectivity equipped with self-sustainability and intensity-invariance simultaneously, which was difficult in the conventional competitive neural networks with a similar degree of complexity in their network architecture. We discuss the biological relevance of the model in a general framework of computational neuroscience. 相似文献