首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   926篇
  免费   40篇
  国内免费   1篇
电工技术   18篇
化学工业   251篇
金属工艺   11篇
机械仪表   13篇
建筑科学   31篇
矿业工程   3篇
能源动力   30篇
轻工业   97篇
水利工程   10篇
石油天然气   4篇
无线电   98篇
一般工业技术   131篇
冶金工业   31篇
自动化技术   239篇
  2024年   1篇
  2023年   8篇
  2022年   34篇
  2021年   25篇
  2020年   24篇
  2019年   32篇
  2018年   38篇
  2017年   26篇
  2016年   35篇
  2015年   27篇
  2014年   31篇
  2013年   57篇
  2012年   75篇
  2011年   59篇
  2010年   45篇
  2009年   41篇
  2008年   52篇
  2007年   60篇
  2006年   45篇
  2005年   25篇
  2004年   38篇
  2003年   17篇
  2002年   22篇
  2001年   13篇
  2000年   10篇
  1999年   13篇
  1998年   6篇
  1997年   15篇
  1996年   9篇
  1995年   7篇
  1994年   7篇
  1993年   4篇
  1992年   2篇
  1991年   8篇
  1990年   1篇
  1989年   5篇
  1988年   4篇
  1987年   7篇
  1986年   9篇
  1985年   5篇
  1984年   4篇
  1983年   8篇
  1982年   3篇
  1981年   1篇
  1980年   2篇
  1979年   2篇
  1977年   3篇
  1976年   2篇
排序方式: 共有967条查询结果,搜索用时 15 毫秒
81.
Probabilistic model checking for the quantification of DoS security threats   总被引:1,自引:0,他引:1  
Secure authentication features of communication and electronic commerce protocols involve computationally expensive and memory intensive cryptographic operations that have the potential to be turned into denial-of-service (DoS) exploits. Recent proposals attempt to improve DoS resistance by implementing a trade-off between the resources required for the potential victim(s) with the resources used by a prospective attacker. Such improvements have been proposed for the Internet Key Exchange (IKE), the Just Fast Keying (JFK) key agreement protocol and the Secure Sockets Layer (SSL/TLS) protocol. In present article, we introduce probabilistic model checking as an efficient tool-assisted approach for systematically quantifying DoS security threats. We model a security protocol with a fixed network topology using probabilistic specifications for the protocol participants. We attach into the protocol model, a probabilistic attacker model which performs DoS related actions with assigned cost values. The costs for the protocol participants and the attacker reflect the level of some resource expenditure (memory, processing capacity or communication bandwidth) for the associated actions. From the developed model we obtain a Discrete Time Markov Chain (DTMC) via property preserving discrete-time semantics. The DTMC model is verified using the PRISM model checker that produces probabilistic estimates for the analyzed DoS threat. In this way, it is possible to evaluate the level of resource expenditure for the attacker, beyond which the likelihood of widespread attack is reduced and subsequently to compare alternative design considerations for optimal resistance to the analyzed DoS threat. Our approach is validated through the analysis of the Host Identity Protocol (HIP). The HIP base-exchange is seen as a cryptographic key-exchange protocol with special features related to DoS protection. We analyze a serious DoS threat, for which we provide probabilistic estimates, as well as results for the associated attacker and participants' costs.  相似文献   
82.
We study a simple technique, originally presented by Herlihy (ACM Trans. Program. Lang. Syst. 15(5):745–770, 1993), for executing concurrently, in a wait-free manner, blocks of code that have been programmed for sequential execution and require significant synchronization in order to be performed in parallel. We first present an implementation of this technique, called Sim, which employs a collect object. We describe a simple implementation of a collect object from a single shared object that supports atomic Add (or XOR) in addition to read; this implementation has step complexity O(1). By plugging in to Sim this implementation, Sim exhibits constant step complexity as well. This allows us to derive lower bounds on the step complexity of implementations of several shared objects, like Add, XOR, collect, and snapshot objects, from LL/SC objects. We then present a practical version of Sim, called PSim, which is implemented in a real shared-memory machine. From a theoretical perspective, PSim has worse step complexity than Sim, its theoretical analog; in practice though, we experimentally show that PSim is highly-efficient: it outperforms several state-of-the-art lock-based and lock-free synchronization techniques, and this given that it is wait-free, i.e. that it satisfies a stronger progress condition than all the algorithms that it outperforms. We have used PSim to get highly-efficient wait-free implementations of stacks and queues.  相似文献   
83.
84.
85.
The present work proposes a systematic methodology for the optimal selection of controller parameters in the sense of minimizing a performance index, which is a quadratic function of the tracking error and the control effort. The performance index is calculated explicitly as an algebraic function of the controller parameters by solving Zubov's partial differential equation (PDE). Standard optimization techniques are then employed for the calculation of the optimal values of the controller parameters. The solution of Zubov's PDE is also used to estimate the closed-loop stability region for the chosen values of the controller parameters. The proposed approach is finally illustrated in a chemical reactor control problem.  相似文献   
86.
In the present paper the problem of disturbance rejection of single input-single output neutral time delay systems with multiple measurable disturbances is solved via dynamic controllers. In particular, the general form of the controller matrices is presented, while the necessary and sufficient conditions for the controller to be realizable are offered. The proposed technique is applied to a test case neutral time delay central heating system. In particular, the nonlinear model of the plant and its linearized approximation are presented. Based on the linearized model, a two-stage controller is designed in order to regulate the room temperature and the boiler effluent temperature. The performance of the closed loop system is investigated through computational experiments.  相似文献   
87.
Online reviews have received much attention recently in the literature, as their visibility has been proven to play an important role during the purchase process. Furthermore, recent theoretical insight argue that the votes casted on how helpful an online review is (review helpfulness) are of particular importance, since they constitute a focal point for examining consumer decision making during the purchase process. In this paper, we explore the interplay between online review helpfulness, rating score and the qualitative characteristics of the review text as measured by readability tests. We construct a theoretical model based on three elements: conformity, understandability and expressiveness and we investigate the directional relationship between the qualitative characteristics of the review text, review helpfulness and the impact of review helpfulness on the review score. Furthermore, we examine whether this relation holds for extreme and moderate review scores. To validate this model we applied four basic readability measures to a dataset containing 37,221 reviews collected from Amazon UK, in order to determine the relationship between the percentage of helpful votes awarded to a review and the review text’s stylistic elements. We also investigated the interrelationships between extremely helpful and unhelpful reviews, as well as absolutely positive and negative reviews using intergroup comparisons. We found that review readability had a greater effect on the helpfulness ratio of a review than its length; in addition, extremely helpful reviews received a higher score than those considered less helpful. The present study contributes to the ever growing literature on on-line reviews by showing that readability tests demonstrate a directional relationship with average length reviews and their helpfulness and that this relationship holds both for moderate and extreme review scores.  相似文献   
88.
The embedding of a small but expressive language of multidimensional functional programming in a well known and widely used language of object‐oriented programming leads to the combination of two radically different programming models. In this paper, we formally define the syntax and semantics of GLU?, which can be thought of as the multidimensional core of Lucid and GLU, and we describe its implementation as a language embedded in C++. With the aid of a few examples, we argue that the marriage of the two programming models is not only compatible and natural, but also that it produces a new and interesting hybrid language. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
89.
The current technological evolutions enter 3D geo-informatics into their digital age, enabling new potential applications in the field of virtual tourism, pleasure, entertainment and cultural heritage. It is argued that 3D information provides the natural way of navigation. However, personalization is a key aspect in a navigation system, since a route that incorporates user preferences is ultimately more suitable than the route with the shortest distance or travel time. Usually, user’s preferences are expressed as a set of weights that regulate the degree of importance of the scene metadata on the route selection process. These weights, however, are defined by the users, setting the complexity to the user’s side, which makes personalization an arduous task. In this paper, we propose an alternative approach in which metadata weights are estimated implicitly and transparently to the users, transferring the complexity to the system side. This is achieved by introducing a relevance feedback on-line learning strategy which automatically adjusts metadata weights by exploiting information fed back to the system about the relevance of user’s preferences judgments given in a form of pair-wise comparisons. Practically implementing a relevance feedback algorithm presents the limitation that several pair-wise comparisons (samples) are required to converge to a set of reliable metadata weights. For this reason, we propose in this paper a weight rectification strategy that improves weight estimation by exploiting metadata interrelations defined through an ontology. In the sequel, a genetic optimization algorithm is incorporated to select the most user preferred routes based on a multi-criteria minimization approach. To increase the degree of personalization in 3D navigation, we have also introduced an efficient algorithm for estimating 3D trajectories around objects of interest by merging best selected 2D projected views that contain faces which are mostly preferred by the users. We have conducted simulations and comparisons with other approaches either in the field of on-line learning or route selection using objective metrics in terms of precision and recall values. The results indicate that our system yields on average a 13.76 % improvement of precision as regards the learning strategy and an improvement of 8.75 % regarding route selection. In addition, we conclude that the ontology driven weight rectification strategy can reduce the number of samples (pair-wise comparisons) required of 76 % to achieve the same precision. Qualitative comparisons have been also performed using a use case route scenario in the city of Athens.  相似文献   
90.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号