全文获取类型
收费全文 | 84685篇 |
免费 | 978篇 |
国内免费 | 406篇 |
专业分类
电工技术 | 830篇 |
综合类 | 2316篇 |
化学工业 | 11767篇 |
金属工艺 | 4798篇 |
机械仪表 | 3040篇 |
建筑科学 | 2171篇 |
矿业工程 | 562篇 |
能源动力 | 1149篇 |
轻工业 | 3679篇 |
水利工程 | 1270篇 |
石油天然气 | 342篇 |
无线电 | 9312篇 |
一般工业技术 | 16477篇 |
冶金工业 | 2703篇 |
原子能技术 | 281篇 |
自动化技术 | 25372篇 |
出版年
2022年 | 22篇 |
2021年 | 28篇 |
2020年 | 22篇 |
2019年 | 23篇 |
2018年 | 14461篇 |
2017年 | 13384篇 |
2016年 | 9975篇 |
2015年 | 624篇 |
2014年 | 272篇 |
2013年 | 268篇 |
2012年 | 3171篇 |
2011年 | 9479篇 |
2010年 | 8338篇 |
2009年 | 5577篇 |
2008年 | 6821篇 |
2007年 | 7820篇 |
2006年 | 144篇 |
2005年 | 1248篇 |
2004年 | 1176篇 |
2003年 | 1204篇 |
2002年 | 568篇 |
2001年 | 111篇 |
2000年 | 199篇 |
1999年 | 64篇 |
1998年 | 85篇 |
1997年 | 54篇 |
1996年 | 68篇 |
1995年 | 27篇 |
1994年 | 21篇 |
1993年 | 25篇 |
1992年 | 24篇 |
1991年 | 36篇 |
1990年 | 16篇 |
1989年 | 17篇 |
1988年 | 14篇 |
1969年 | 24篇 |
1968年 | 43篇 |
1967年 | 33篇 |
1966年 | 42篇 |
1965年 | 44篇 |
1963年 | 28篇 |
1962年 | 22篇 |
1961年 | 18篇 |
1960年 | 30篇 |
1959年 | 35篇 |
1958年 | 37篇 |
1957年 | 36篇 |
1956年 | 34篇 |
1955年 | 63篇 |
1954年 | 68篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
201.
202.
Category Partition Method (CPM) is a general approach to specification-based program testing, where test frame reduction and
refinement are two important issues. Test frame reduction is necessary since too many test frames may be produced, and test
frame refinement is important since during CPM testing new information about test frame generation may be achieved and considered
incrementally. Besides the information provided by testers or users, implementation related knowledge offers alternative information
for reducing and refining CPM test frames. This paper explores the idea by proposing a call patterns semantics based test
frame updating method for Prolog programs, in which a call patterns analysis is used to collect information about the way
in which procedures are used in a program. The updated test frames will be represented as constraints. The effect of our test
frame updating is two-fold. On one hand, it removes “uncared” data from the original set of test frames; on the other hand,
it refines the test frames to which we should pay more attention. The first effect makes the input domain on which a procedure
must be tested a subset of the procedure’s input domain, and the latter makes testers stand more chance to find out the faults
that are more likely to show their presence in the use of the program under consideration. Our test frame updating method
preserves the effectiveness of CPM testing with respect to the detection of faults we care. The test case generation from
the updated set of test frames is also discussed. In order to show the applicability of our method an approximation call patterns
semantics is proposed, and the test frame updating on the semantics is illustrated by an example.
相似文献
Lingzhong ZhaoEmail: |
203.
The identification of part families and machine groups that form the cells is a major step in the development of a cellular
manufacturing system and, consequently, a large number of concepts, theories and algorithms have been proposed. One common
assumption for most of these cell formation algorithms is that the product mix remains stable over a period of time. In today’s
world, the market demand is being shaped by consumers resulting in a highly volatile market. This has given rise to a new
class of products characterized by low volume and high variety. To incorporate product mix changes into an existing cellular
manufacturing system many important issues have to be tackled. In this paper, a methodology to incorporate new parts and machines
into an existing cellular manufacturing system has been presented. The objective is to fit the new parts and machines into an existing cellular manufacturing system thereby increasing machine utilization and reducing
investment in new equipment. 相似文献
204.
This paper reports on recent results in a series of the work of the authors on the stability and nonlinear control for general
dynamical systems described by retarded functional differential and difference equations. Both internal and external stability
properties are studied. The corresponding Lyapunov and Razuminkhin characterizations for input-to-state and input-to-output
stabilities are proposed. Necessary and sufficient Lyapunov-like conditions are derived for robust nonlinear stabilization.
In particular, an explicit controller design procedure is developed for a new class of nonlinear time-delay systems. Lastly,
sufficient assumptions, including a small-gain condition, are presented for guaranteeing the input-to-output stability of
coupled systems comprised of retarded functional differential and difference equations. 相似文献
205.
High fidelity repeater false-target badly affects a radar system’s detecting, tracking, and data processing. It is an available approach of confronting false-target for radar that discriminates firstly and then eliminates. Whereas for the technique progress about the repeater false-target jam, it is more and more difficult to discriminate this jam in the time-domain, frequency-domain, or space-domain. The technique using polarization information to discriminate the target and false-target is discussed in th... 相似文献
206.
207.
Yi-Song Wang 《计算机科学技术学报》2009,24(6):1125-1137
Logic programming under the stable model semantics is proposed as a non-monotonic language for knowledge representation and
reasoning in artificial intelligence. In this paper, we explore and extend the notion of compatibility and the Λ operator, which were first proposed by Zhang to characterize default theories. First, we present a new characterization
of stable models of a logic program and show that an extended notion of compatibility can characterize stable submodels. We further propose the notion of weak auto-compatibility which characterizes the Normal Forward Chaining Construction proposed by Marek, Nerode and Remmel. Previously, this construction was only known to construct the stable models of FC-normal
logic programs, which turn out to be a proper subclass of weakly auto-compatible logic programs. We investigate the properties
and complexity issues for weakly auto-compatible logic programs and compare them with some subclasses of logic programs. 相似文献
208.
Hua-Fu Li 《Multimedia Tools and Applications》2009,41(2):287-304
Mining of music data is one of the most important problems in multimedia data mining. In this paper, two research issues of
mining music data, i.e., online mining of music query streams and change detection of music query streams, are discussed.
First, we proposed an efficient online algorithm, FTP-stream (Frequent Temporal Pattern mining of streams), to mine all frequent melody structures over sliding windows of music melody sequence streams. An effective bit-sequence
representation is used in the proposed algorithm to reduce the time and memory needed to slide the windows. An effective list
structure is developed in the FTP-stream algorithm to overcome the performance bottleneck of 2-candidate generation. Experiments
show that the proposed algorithm FTP-stream only needs a half of memory requirement of original melody sequence data, and
just scans the music query stream once. After mining frequent melody structures, we developed a simple online algorithm, MQS-change
(changes of Music Query Streams), to detect the changes of frequent melody structures in current user-centered music query streams. Two music melody
structures (set of chord-sets and string of chord-sets) are maintained and four melody structure changes (positive burst,
negative burst, increasing change and decreasing change) are monitored in a new summary data structure, MSC-list (a list of Music Structure Changes). Experiments show that the MQS-change algorithm is an effective online method to detect the changes of music melody
structures over continuous music query streams.
相似文献
Hua-Fu LiEmail: |
209.
Ronen Gradwohl Moni Naor Benny Pinkas Guy N. Rothblum 《Theory of Computing Systems》2009,44(2):245-268
We consider cryptographic and physical zero-knowledge proof schemes for Sudoku, a popular combinatorial puzzle. We discuss
methods that allow one party, the prover, to convince another party, the verifier, that the prover has solved a Sudoku puzzle,
without revealing the solution to the verifier. The question of interest is how a prover can show: (i) that there is a solution
to the given puzzle, and (ii) that he knows the solution, while not giving away any information about the solution to the
verifier.
In this paper we consider several protocols that achieve these goals. Broadly speaking, the protocols are either cryptographic
or physical. By a cryptographic protocol we mean one in the usual model found in the foundations of cryptography literature.
In this model, two machines exchange messages, and the security of the protocol relies on computational hardness. By a physical
protocol we mean one that is implementable by humans using common objects, and preferably without the aid of computers. In
particular, our physical protocols utilize items such as scratch-off cards, similar to those used in lotteries, or even just
simple playing cards.
The cryptographic protocols are direct and efficient, and do not involve a reduction to other problems. The physical protocols
are meant to be understood by “lay-people” and implementable without the use of computers.
Research of R. Gradwohl was supported by US-Israel Binational Science Foundation Grant 2002246.
Research of M. Naor was supported in part by a grant from the Israel Science Foundation.
Research of B. Pinkas was supported in part by the Israel Science Foundation (grant number 860/06).
Research of G.N. Rothblum was supported by NSF grant CNS-0430450 and NSF grant CFF-0635297. 相似文献
210.
Analysis is conducted for slender beams with a varying cross-section under large non-linear elastic deformation. A thickness
variation function is derived to achieve optimal - constant maximum bending stress distribution along the beam for inclined
end load of arbitrary direction. Closed form solutions are derived for the large deflections that correspond to the various
loading conditions. The analysis is repeated for a beam with optimally varying width (for arbitrary end force) and the width
variation function is also determined. 相似文献