全文获取类型
收费全文 | 754篇 |
免费 | 20篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 3篇 |
化学工业 | 151篇 |
金属工艺 | 6篇 |
机械仪表 | 12篇 |
建筑科学 | 22篇 |
能源动力 | 24篇 |
轻工业 | 60篇 |
水利工程 | 8篇 |
无线电 | 99篇 |
一般工业技术 | 88篇 |
冶金工业 | 13篇 |
原子能技术 | 5篇 |
自动化技术 | 284篇 |
出版年
2024年 | 1篇 |
2023年 | 6篇 |
2022年 | 21篇 |
2021年 | 19篇 |
2020年 | 12篇 |
2019年 | 12篇 |
2018年 | 15篇 |
2017年 | 17篇 |
2016年 | 23篇 |
2015年 | 27篇 |
2014年 | 31篇 |
2013年 | 62篇 |
2012年 | 53篇 |
2011年 | 55篇 |
2010年 | 42篇 |
2009年 | 59篇 |
2008年 | 49篇 |
2007年 | 50篇 |
2006年 | 42篇 |
2005年 | 30篇 |
2004年 | 22篇 |
2003年 | 19篇 |
2002年 | 15篇 |
2001年 | 9篇 |
2000年 | 5篇 |
1999年 | 9篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 7篇 |
1995年 | 8篇 |
1994年 | 7篇 |
1993年 | 2篇 |
1992年 | 4篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 3篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1980年 | 1篇 |
1977年 | 1篇 |
1970年 | 1篇 |
1965年 | 1篇 |
1958年 | 1篇 |
1957年 | 2篇 |
排序方式: 共有775条查询结果,搜索用时 15 毫秒
81.
The Mahalanobis-Taguchi (MT) strategy combines mathematical and statistical concepts like Mahalanobis distance, Gram-Schmidt orthogonalization and experimental designs to support diagnosis and decision-making based on multivariate data. The primary purpose is to develop a scale to measure the degree of abnormality of cases, compared to “normal” or “healthy” cases, i.e. a continuous scale from a set of binary classified cases. An optimal subset of variables for measuring abnormality is then selected and rules for future diagnosis are defined based on them and the measurement scale. This maps well to problems in software defect prediction based on a multivariate set of software metrics and attributes. In this paper, the MT strategy combined with a cluster analysis technique for determining the most appropriate training set, is described and applied to well-known datasets in order to evaluate the fault-proneness of software modules. The measurement scale resulting from the MT strategy is evaluated using ROC curves and shows that it is a promising technique for software defect diagnosis. It compares favorably to previously evaluated methods on a number of publically available data sets. The special characteristic of the MT strategy that it quantifies the level of abnormality can also stimulate and inform discussions with engineers and managers in different defect prediction situations. 相似文献
82.
Katerina Diamantaki Charalampos Rizopoulos Dimitris Charitos Nikos Tsianos 《Personal and Ubiquitous Computing》2011,15(1):37-49
Multiuser location-aware applications present a new form of mediated communication that takes place within a digital as well as a physical spatial context. The inherently hybrid character of locative media use necessitates that the designers of such applications take into account the way communication and social interaction is influenced by contextual elements. In this paper, an investigation into the communicational and social practices of users who participate in a location-based game is presented, with an emphasis on group formation and dynamics, interpersonal communication, and experienced sense of immersion. This investigation employs a methodological approach that is reliant on both qualitative and quantitative data analysis. A series of this user experience study’s results are presented and discussed. 相似文献
83.
Stavros Papadopoulos Yin Yang Dimitris Papadias 《The VLDB Journal The International Journal on Very Large Data Bases》2010,19(2):161-180
According to the database outsourcing model, a data owner delegates database functionality to a third-party service provider, which answers queries received from clients. Authenticated query processing enables the clients to verify the correctness of query results. Despite the abundance of methods for authenticated processing in conventional databases, there is limited work on outsourced data streams. Stream environments pose new challenges such as the need for fast structure updating, support for continuous query processing and authentication, and provision for temporal completeness. Specifically, in addition to the correctness of individual results, the client must be able to verify that there are no missing results in between data updates. This paper presents a comprehensive set of methods covering relational streams. We first describe REF, a technique that achieves correctness and temporal completeness but incurs false transmissions, i.e., the provider has to inform the clients whenever there is a data update, even if their results are not affected. Then, we propose CADS, which minimizes the processing and transmission overhead through an elaborate indexing scheme and a virtual caching mechanism. In addition, we present an analytical study to determine the optimal indexing granularity, and extend CADS for the case that the data distribution changes over time. Finally, we evaluate the effectiveness of our techniques through extensive experiments. 相似文献
84.
Gabriel Tsechpenakis Dimitris Metaxas Carol Neidle 《Computer Vision and Image Understanding》2006,104(2-3):140
We present a data-driven dynamic coupling between discrete and continuous methods for tracking objects of high dofs, which overcomes the limitations of previous techniques. In our approach, two trackers work in parallel, and the coupling between them is based on the tracking error. We use a model-based continuous method to achieve accurate results and, in cases of failure, we re-initialize the model using our discrete tracker. This method maintains the accuracy of a more tightly coupled system, while increasing its efficiency. At any given frame, our discrete tracker uses the current and several previous frames to search into a database for the best matching solution. For improved robustness, object configuration sequences, rather than single configurations, are stored in the database. We apply our framework to the problem of 3D hand tracking from image sequences and the discrimination between fingerspelling and continuous signs in American Sign Language. 相似文献
85.
Apostolos Malatras Dimitris Geneiatakis Ioannis Vakalis 《International Journal of Information Security》2017,16(6):653-671
In the Internet era, users’ fundamental privacy and anonymity rights have received significant research and regulatory attention. This is not only a result of the exponential growth of data that users generate when accomplishing their daily task by means of computing devices with advanced capabilities, but also because of inherent data properties that allow them to be linked with a real or soft identity. Service providers exploit these facts for user monitoring and identification, albeit impacting users’ anonymity, based mainly on personal identifiable information or on sensors that generate unique data to provide personalized services. In this paper, we report on the feasibility of user identification using general system features like memory, CPU and network data, as provided by the underlying operating system. We provide a general framework based on supervised machine learning algorithms both for distinguishing users and informing them about their anonymity exposure. We conduct a series of experiments to collect trial datasets for users’ engagement on a shared computing platform. We evaluate various well-known classifiers in terms of their effectiveness in distinguishing users, and we perform a sensitivity analysis of their configuration setup to discover optimal settings under diverse conditions. Furthermore, we examine the bounds of sampling data to eliminate the chances of user identification and thus promote anonymity. Overall results show that under certain configurations users’ anonymity can be preserved, while in other cases users’ identification can be inferred with high accuracy, without relying on personal identifiable information. 相似文献
86.
87.
Nikos Papadakis Dimitris Plexousakis Myron Papadakis Harris Manifavas 《Journal of Intelligent Information Systems》2012,38(1):41-94
In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature
on reasoning about action are inadequate because they rely on the assumption that fluents persist, and because actions have
effects on the next situation only. In this paper we provide a solution to the ramification problem based on an extension
of the situation calculus and the work of McCain and Turner. More specifically, we study the case where there are conflicting
effects of an action, a particularly complex problem. Also we present a tool which implements the proposed solution. 相似文献
88.
Siome Goldenstein Menelaos Karavelas Dimitris Metaxas Leonidas Guibas Eric Aaron Ambarish Goswami 《Computers & Graphics》2001,25(6):983-998
We present a new methodology for agent modeling that is scalable and efficient. It is based on the integration of nonlinear dynamical systems and kinetic data structures. The method consists of three layers, which together model 3D agent steering, crowds and flocks among moving and static obstacles. The first layer, the local layer employs nonlinear dynamical systems theory to models low-level behaviors. It is fast and efficient, and it does not depend on the total number of agents in the environment. This dynamical systems-based approach also allows us to establish continuous numerical parameters for modifying each agent's behavior. The second layer, a global environment layer consists of a specifically designed kinetic data structure to track efficiently the immediate environment of each agent and know which obstacles/agents are near or visible to the given agent. This layer reduces the complexity in the local layer. In the third layer, a global planning layer, the problem of target tracking is generalized in a way that allows navigation in maze-like terrains, avoidance of local minima and cooperation between agents. We implement this layer based on two approaches that are suitable for different applications: One approach is to track the closest single moving or static target; the second is to use a pre-specified vector field, which may be generated automatically (with harmonic functions, for example) or based on user input to achieve the desired output. We also discuss how hybrid systems concepts for global planning can capitalize on both our layered approach and the continuous, reactive nature of our agent steering.
We demonstrate the power of the approach through a series of experiments simulating single/multiple agents and crowds moving towards moving/static targets in complex environments. 相似文献
89.
Dimitris Vassis Petros Belsis Christos Skourlas Grammati Pantziou 《Personal and Ubiquitous Computing》2010,14(6):563-573
Advances on sensor technology, wireless environments and data mining introduce new possibilities in the healthcare sector,
realizing the anytime-anywhere access to medical information. Towards this direction, integration of packet-switched networks
and sensor devices can be effective in deploying assistive environments, such as home monitoring for elderly or patients.
In this paper we describe a policy-based architecture that utilizes wireless sensor devices, advanced network topologies and
software agents to enable remote monitoring of patients and elderly people; through the aforementioned technologies we achieve
continuous monitoring of a patient’s condition and we can proceed when necessary with proper actions. We also present a software
framework and network architecture that realizes the provision of remote medical services, in compliance with the imposed
security and privacy requirements. A proof of concept prototype is also deployed, along with an evaluation of the overall
architecture’s performance. 相似文献
90.
Reverse nearest neighbors in large graphs 总被引:3,自引:0,他引:3
Man Lung Yiu Dimitris Papadias Nikos Mamoulis Yufei Tao 《Knowledge and Data Engineering, IEEE Transactions on》2006,18(4):540-553
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in Euclidean spaces, there is no previous work in the context of large graphs. In this paper, we provide a fundamental lemma, which can be used to prune the search space while traversing the graph in search for RNN. Based on it, we develop two RNN methods; an eager algorithm that attempts to prune network nodes as soon as they are visited and a lazy technique that prunes the search space when a data point is discovered. We study retrieval of an arbitrary number k of reverse nearest neighbors, investigate the benefits of materialization, cover several query types, and deal with cases where the queries and the data objects reside on nodes or edges of the graph. The proposed techniques are evaluated in various practical scenarios involving spatial maps, computer networks, and the DBLP coauthorship graph. 相似文献