全文获取类型
收费全文 | 2280篇 |
免费 | 158篇 |
国内免费 | 4篇 |
学科分类
工业技术 | 2442篇 |
出版年
2023年 | 6篇 |
2022年 | 10篇 |
2021年 | 37篇 |
2020年 | 37篇 |
2019年 | 62篇 |
2018年 | 72篇 |
2017年 | 52篇 |
2016年 | 64篇 |
2015年 | 55篇 |
2014年 | 77篇 |
2013年 | 158篇 |
2012年 | 103篇 |
2011年 | 107篇 |
2010年 | 108篇 |
2009年 | 125篇 |
2008年 | 117篇 |
2007年 | 100篇 |
2006年 | 91篇 |
2005年 | 71篇 |
2004年 | 61篇 |
2003年 | 61篇 |
2002年 | 56篇 |
2001年 | 39篇 |
2000年 | 40篇 |
1999年 | 49篇 |
1998年 | 183篇 |
1997年 | 108篇 |
1996年 | 81篇 |
1995年 | 46篇 |
1994年 | 36篇 |
1993年 | 36篇 |
1992年 | 15篇 |
1991年 | 12篇 |
1990年 | 13篇 |
1989年 | 12篇 |
1988年 | 18篇 |
1987年 | 11篇 |
1986年 | 7篇 |
1985年 | 9篇 |
1984年 | 5篇 |
1983年 | 7篇 |
1982年 | 6篇 |
1981年 | 8篇 |
1979年 | 5篇 |
1978年 | 6篇 |
1977年 | 9篇 |
1976年 | 18篇 |
1967年 | 3篇 |
1966年 | 10篇 |
1965年 | 5篇 |
排序方式: 共有2442条查询结果,搜索用时 15 毫秒
71.
We present a compiler that can be used to automatically obtain efficient Java implementations of parsing algorithms from formal specifications expressed as parsing schemata. The system performs an analysis of the inference rules in the input schemata in order to determine the best data structures and indexes to use, and to ensure that the generated implementations are efficient. The system described is general enough to be able to handle all kinds of schemata for different grammar formalisms, such as context‐free grammars and tree‐adjoining grammars, and it provides an extensibility mechanism allowing the user to define custom notational elements. This compiler has proven very useful for analyzing, prototyping and comparing natural‐language parsers in real domains, as can be seen in the empirical examples provided at the end of the paper. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
72.
The aim of this paper is to propose a procedure to estimate missing preference values when dealing with incomplete fuzzy linguistic preference relations assessed using a two‐tuple fuzzy linguistic approach. This procedure attempts to estimate the missing information in an individual incomplete fuzzy linguistic preference relation using only the preference values provided by the respective expert. It is guided by the additive consistency property to maintain experts' consistency levels. Additionally, we present a selection process of alternatives in group decision making with incomplete fuzzy linguistic preference relations and analyze the use of our estimation procedure in the decision process. © 2008 Wiley Periodicals, Inc. 相似文献
73.
José Aguilar 《Applied Artificial Intelligence》2016,30(7):720-743
Cognitive maps are a tool to represent knowledge from a qualitative perspective, allowing to create models of complex systems where an exact mathematical model cannot be used because of the complexity of the system. In the literature, several tools have been proposed to develop cognitive maps and fuzzy cognitive maps (FCMs); one of them is FCM Designer. This paper designs and implements an extension to the FCM Designer tool that allows creating multilayer FCM. With this extension, it is possible to have several FCMs for the same problem, where each one expresses a different level of knowledge of the system under study, but interlinked. Thus, one can have a first level of detailed abstraction of the system with specific information and then more general levels. In addition, we can have different levels where the variables of one level depend on those of another level. That is, the multilayer approach enriches the modeled systems with flow of information between layers, to derive information about the concepts involved in layers from the concepts in other layers. In our multilayer approach, the relationship between the cognitive maps in different layers can be carried out in various ways: with fuzzy rules, connections with weights and with mathematical equations. This work presents the design and the implementation of the extension of the FCM Designer tool, and several test cases in different domains: a FCM to analyze emergent properties of Wikipedia a FCM for medical analysis for diagnosis, and another like recommender system. 相似文献
74.
Francisco Jes��s Mart��n-Mateos Jos�� Luis Ruiz-Reina Jos�� Antonio Alonso Mar��a Jos�� Hidalgo 《Journal of Automated Reasoning》2011,47(3):229-250
Higman??s lemma is an important result in infinitary combinatorics, which has been formalized in several theorem provers. In this paper we present a formalization and proof of Higman??s Lemma in the ACL2 theorem prover. Our formalization is based on a proof by Murthy and Russell, where the key termination argument is justified by the multiset relation induced by a well-founded relation. To our knowledge, this is the first mechanization of this proof. 相似文献
75.
Exception handling in workflow management systems 总被引:1,自引:0,他引:1
Hagen C. Alonso G. 《IEEE transactions on pattern analysis and machine intelligence》2000,26(10):943-958
Fault tolerance is a key requirement in process support systems (PSS), a class of distributed computing middleware encompassing applications such as workflow management systems and process centered software engineering environments. A PSS controls the flow of work between programs and users in networked environments based on a “metaprogram” (the process). The resulting applications are characterized by a high degree of distribution and a high degree of heterogeneity (properties that make fault tolerance both highly desirable and difficult to achieve). We present a solution for implementing more reliable processes by using exception handling, as it is used in programming languages, and atomicity, as it is known from the transaction concept in database management systems. We describe the mechanism incorporating both transactions and exceptions and present a validation technique allowing to assess the correctness of process specifications 相似文献
76.
Since wavelets were introduced in the radiosity algorithm 5 , surprisingly little research has been devoted to higher order wavelets and their use in radiosity algorithms. A previous study 13 has shown that wavelet radiosity, and especially higher order wavelet radiosity was not bringing significant improvements over hierarchical radiosity and was having a very important extra memory cost, thus prohibiting any effective computation. In this paper, we present a new implementation of wavelets in the radiosity algorithm, that is substantially different from previous implementations in several key areas (refinement oracle, link storage, resolution algorithm). We show that, with this implementation, higher order wavelets are actually bringing an improvement over standard hierarchical radiosity and lower order wavelets. 相似文献
77.
On spiking neural P systems and partially blind counter machines 总被引:1,自引:0,他引:1
A k-output spiking neural P system (SNP) with output neurons, , generates a tuple of positive integers if, starting from the initial configuration, there is a sequence of steps such that during the computation,
each O
i
generates exactly two spikes aa (the times the pair aa are generated may be different for different output neurons) and the time interval between the first a and the second a is n
i
. After the output neurons generate their pairs of spikes, the system eventually halts. We give characterizations of sets
definable by partially blind multicounter machines in terms of k-output SNPs operating in a sequential mode. Slight variations of the models make them universal. 相似文献
78.
Fernández-Miyakawa ME Dorr R Fernández LE Uzal FA Ibarra C 《Computer methods and programs in biomedicine》2007,85(2):95-100
This paper describes the development of a simple system for measurement of net water movement through biological membrane barriers. The system is based on the detection of a water meniscus inside a polyethylene tube, which reflects the water movement inside one hemichamber of a modified Ussing chamber containing a membrane barrier. The detection device consists of a commercial computer-controlled flat bed scanner and specifically developed software. This system allows one to perform a relatively high number of individual experiments per physical unit. It is a flexible and affordable device, which allows comparatively more information per unit to be obtained than previously described methods. 相似文献
79.
A simple problem concerning evaluation of programs is shown to be nonelementary recursive. The problem is the following: Given an input-free programP (i.e. all variables are initially 0) without nested loops using only instructions of the formx ← 1, x ← x + y, \(x \leftarrow x\dot - y\) ,do x... end, doesP output 0? This problem has time complexity \(2^{2^{ {\mathinner{\mkern2mu\raise1pt\hbox{.}\mkern2mu \raise4pt\hbox{.}\mkern2mu\raise7pt\hbox{.}\mkern1mu}} ^2 } } \) }cn-levels for some constantc. Other results are presented which show how the complexity of the 0-evaluation problem changes when the nonlooping instructions are varied. For example, it is shown that 0-evaluation is PSPACE-complete even for the case when the nonlooping instructions are onlyx ← x + 1,if x = 0then y ←y \(y \leftarrow y\dot - 1\) . 相似文献
80.
Let be the class of real-time nondeterministic one-counter machines whose counters make at mostone reversal. Let 1 (respectively, 2) be the subclass consisting of machines whose only nondeterministic move is in the choice of when to reverse the counter (respectively, when to start using the counter). 1 and 2 are among the simplest known classes of machines for which the universe problem has been shown undecidable. (The universe problem for a class of machines is the problem of deciding if an arbitrary machine in the class accepts all its inputs.) Here, we show that the classes of languages accepted by machines in 1 and 2 are incomparable. Moreover, the union of the language classes is properly contained in the class defined by . We also, briefly, look at the closure properties of these machines.This research was supported in part by NSF Grant MCS78-01736. 相似文献