全文获取类型
收费全文 | 328篇 |
免费 | 7篇 |
专业分类
电工技术 | 1篇 |
化学工业 | 27篇 |
金属工艺 | 2篇 |
机械仪表 | 4篇 |
建筑科学 | 5篇 |
能源动力 | 3篇 |
轻工业 | 7篇 |
水利工程 | 1篇 |
无线电 | 23篇 |
一般工业技术 | 44篇 |
冶金工业 | 17篇 |
原子能技术 | 1篇 |
自动化技术 | 200篇 |
出版年
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 3篇 |
2020年 | 1篇 |
2019年 | 2篇 |
2018年 | 4篇 |
2017年 | 11篇 |
2016年 | 14篇 |
2015年 | 8篇 |
2014年 | 14篇 |
2013年 | 27篇 |
2012年 | 20篇 |
2011年 | 29篇 |
2010年 | 24篇 |
2009年 | 18篇 |
2008年 | 18篇 |
2007年 | 15篇 |
2006年 | 13篇 |
2005年 | 8篇 |
2004年 | 15篇 |
2003年 | 16篇 |
2002年 | 7篇 |
2001年 | 8篇 |
2000年 | 8篇 |
1999年 | 1篇 |
1998年 | 4篇 |
1997年 | 10篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 1篇 |
1992年 | 4篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 5篇 |
1985年 | 3篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有335条查询结果,搜索用时 0 毫秒
1.
The TSIMMIS Approach to Mediation: Data Models and Languages 总被引:18,自引:2,他引:16
Hector Garcia-Molina Yannis Papakonstantinou Dallan Quass Anand Rajaraman Yehoshua Sagiv Jeffrey Ullman Vasilis Vassalos Jennifer Widom 《Journal of Intelligent Information Systems》1997,8(2):117-132
TSIMMIS—The Stanford-IBM Manager of Multiple InformationSources—is a system for integrating information. It offers a datamodel and a common query language that are designed to support thecombining of information from many different sources. It also offerstools for generating automatically the components that are needed tobuild systems for integrating information. In this paper we shalldiscuss the principal architectural features and their rationale. 相似文献
2.
3.
What is the value of a scientist and its impact upon the scientific thinking? How can we measure the prestige of a journal or a conference? The evaluation of the scientific work of a scientist and the estimation of the quality of a journal or conference has long attracted significant interest, due to the benefits by obtaining an unbiased and fair criterion. Although it appears to be simple, defining a quality metric is not an easy task. To overcome the disadvantages of the present metrics used for ranking scientists and journals, J. E. Hirsch proposed a pioneering metric, the now famous h-index. In this article we demonstrate several inefficiencies of this index and develop a pair of generalizations and effective variants of it to deal with scientist ranking and publication forum ranking. The new citation indices are able to disclose trendsetters in scientific research, as well as researchers that constantly shape their field with their influential work, no matter how old they are. We exhibit the effectiveness and the benefits of the new indices to unfold the full potential of the h-index, with extensive experimental results obtained from the DBLP, a widely known on-line digital library. 相似文献
4.
When a set of rules generates (conflicting) values for a virtual attribute of some tuple, the system must resolve the inconsistency and decide on a unique value that is assigned to that attribute. In most current systems, the conflict is resolved based on criteria that choose one of the rules in the conflicting set and use the value that it generated. There are several applications, however, where inconsistencies of the above form arise, whose semantics demand a different form of resolution. We propose a general framework for the study of the conflict resolution problem, and suggest a variety of resolution criteria, which collectively subsume all previously known solutions. With several new criteria being introduced, the semantics of several applications are captured more accurately than in the past. We discuss how conflict resolution criteria can be specified at the schema or the rule-module level. Finally, we suggest some implementation techniques based on rule indexing, which allow conflicts to be resolved efficiently at compile time, so that at run time only a single rule is processed.An earlier version of this work appeared under the title Conflict Resolution of Rules Assigning Values to Virtual Attributes inProceedings of the 1989 ACM-Sigmod Conference, Portland, OR, June 1989, pp. 205–214.Partially supported by the National Science Foundation under Grant IRI-9157368 (PYI Award) and by grants from DEC, HP, and AT&T.Partially supported by the National Science Foundation under Grant IRI-9057573 (PYI Award), IBM, DEC, and the University of Maryland Institute for Advanced Computer Studies (UMIACS). 相似文献
5.
6.
Iosif Vranakis Anastasia Papadioti Yannis Tselentis Anna Psaroulaki Georgios Tsiotis 《Proteomics. Clinical applications》2013,7(1-2):193-204
Coxiella burnetii, the causative agent of Q fever, is an intracellular bacterium and a potential weapon for bioterrorism. The widespread throughout the world, zoonosis is manifested clinically as a self-limited febrile illness, as pneumonia (acute Q fever) or as a chronic illness with endocarditis being its major complication. The recent Netherlands Q fever outbreak has driven the bacterium from a relatively cryptic, underappreciated, “niche” microorganism on the sideline of bacteriology, to one of possibly great impact on public health. Advances in the study of this microorganism proceeded slowly, primarily due to the, until recently, obligatory intracellular nature of the pathogen that in its virulent phase I must be manipulated under biosafety level-3 conditions. Proteomic studies, in particular, have generated a vast amount of information concerning several aspects of the bacterium such as virulence factors, detection/diagnostic and immunogenic biomarkers, inter-/intraspecies variation, resistance to antibiotics, and secreted effector proteins with significant clinical impact. The phenomenon observed following the genomics era, that of generation and accumulation of huge amount of data that ultimately end up unexploited on several databases, begins to emerge in the proteomics field as well. This review will focus on the advances in the field of C. burnetii proteomics through MS, attempting in parallel to utilize some of the proteomics findings by suggesting future directions for the improvement of Q fever diagnosis and therapy. 相似文献
7.
Athanasios Drigas Lefteris Koukianakis Yannis Papagerasimou 《Computers in human behavior》2011,27(4):1416-1423
Cognitive science is the scientific domain which studies, analyzes, simulates and infers for various aspects, functions and procedures of human mentality such as, thinking, logic, language, knowledge, memory, learning, perception and the ability to solve problems. E-psychology is in close relation with the cognitive science domain, but expands beyond it, as e-psychology is the efficient convergence of psychology and Information and Communication Technologies (ICTs). E-psychology offers a number of services such as supporting, diagnosis, assessment, therapy, counseling, intervention and tests through an effective exploitation of ICTs. This article presents a user-friendly, flexible and adaptive electronic platform, which supports both synchronous and asynchronous e-psychology activities through the use of informative and communicative tools and services, which can be adapted to support various methods of e-psychology activities. It is important to underline that e-psychology is not an alternative psychology field, but a resource to enhance the conventional psychology process. 相似文献
8.
Christos Doulkeridis Akrivi Vlachou Kjetil Nørvåg Yannis Kotidis Michalis Vazirgiannis 《Peer-to-Peer Networking and Applications》2010,3(1):67-79
The advent of the World Wide Web has made an enormous amount of information available to everyone and the widespread use of
digital equipment enables end-users (peers) to produce their own digital content. This vast amount of information requires scalable data management systems. Peer-to-peer
(P2P) systems have so far been well established in several application areas, with file-sharing being the most prominent.
The next challenge that needs to be addressed is (more complex) data sharing, management and query processing, thus facilitating
the delivery of a wide spectrum of novel data-centric applications to the end-user, while providing high Quality-of-Service.
In this paper, we propose a self-organizing P2P system that is capable to identify peers with similar content and intentionally
assign them to the same super-peer. During content retrieval, fewer super-peers need to be contacted and therefore efficient
similarity search is supported, in terms of reduced network traffic and contacted peers. Our approach increases the responsiveness
and reliability of a P2P system and we demonstrate the advantages of our approach using large-scale simulations. 相似文献
9.
Alfonso E. Gerevini Patrik Haslum Derek Long Alessandro Saetti Yannis Dimopoulos 《Artificial Intelligence》2009,173(5-6):619-668
The international planning competition (IPC) is an important driver for planning research. The general goals of the IPC include pushing the state of the art in planning technology by posing new scientific challenges, encouraging direct comparison of planning systems and techniques, developing and improving a common planning domain definition language, and designing new planning domains and problems for the research community. This paper focuses on the deterministic part of the fifth international planning competition (IPC5), presenting the language and benchmark domains that we developed for the competition, as well as a detailed experimental evaluation of the deterministic planners that entered IPC5, which helps to understand the state of the art in the field.We present an extension of pddl, called pddl3, allowing the user to express strong and soft constraints about the structure of the desired plans, as well as strong and soft problem goals. We discuss the expressive power of the new language focusing on the restricted version that was used in IPC5, for which we give some basic results about its compilability into pddl2. Moreover, we study the relative performance of the IPC5 planners in terms of solved problems, CPU time, and plan quality; we analyse their behaviour with respect to the winners of the previous competition; and we evaluate them in terms of their capability of dealing with soft goals and constraints, and of finding good quality plans in general. Overall, the results indicate significant progress in the field, but they also reveal that some important issues remain open and require further research, such as dealing with strong constraints and computing high quality plans in metric-time domains and domains involving soft goals or constraints. 相似文献
10.
Yannis Smaragdakis Christoph Csallner Ranjith Subramanian 《Automated Software Engineering》2009,16(1):73-99
We explore the automatic generation of test data that respect constraints expressed in the Object-Role Modeling (ORM) language.
ORM is a popular conceptual modeling language, primarily targeting database applications, with significant uses in practice.
The general problem of even checking whether an ORM diagram is satisfiable is quite hard: restricted forms are easily NP-hard
and the problem is undecidable for some expressive formulations of ORM. Brute-force mapping to input for constraint and SAT
solvers does not scale: state-of-the-art solvers fail to find data to satisfy uniqueness and mandatory constraints in realistic
time even for small examples. We instead define a restricted subset of ORM that allows efficient reasoning yet contains most
constraints overwhelmingly used in practice. We show that the problem of deciding whether these constraints are consistent
(i.e., whether we can generate appropriate test data) is solvable in polynomial time, and we produce a highly efficient (interactive
speed) checker. Additionally, we analyze over 160 ORM diagrams that capture data models from industrial practice and demonstrate
that our subset of ORM is expressive enough to handle their vast majority. 相似文献