全文获取类型
收费全文 | 755篇 |
免费 | 41篇 |
国内免费 | 6篇 |
学科分类
工业技术 | 802篇 |
出版年
2024年 | 2篇 |
2023年 | 2篇 |
2022年 | 9篇 |
2021年 | 19篇 |
2020年 | 16篇 |
2019年 | 17篇 |
2018年 | 15篇 |
2017年 | 24篇 |
2016年 | 30篇 |
2015年 | 36篇 |
2014年 | 30篇 |
2013年 | 65篇 |
2012年 | 37篇 |
2011年 | 54篇 |
2010年 | 39篇 |
2009年 | 41篇 |
2008年 | 36篇 |
2007年 | 44篇 |
2006年 | 23篇 |
2005年 | 26篇 |
2004年 | 27篇 |
2003年 | 26篇 |
2002年 | 16篇 |
2001年 | 19篇 |
2000年 | 13篇 |
1999年 | 8篇 |
1998年 | 20篇 |
1997年 | 14篇 |
1996年 | 7篇 |
1995年 | 8篇 |
1994年 | 5篇 |
1993年 | 11篇 |
1992年 | 5篇 |
1990年 | 2篇 |
1989年 | 5篇 |
1988年 | 2篇 |
1987年 | 7篇 |
1986年 | 3篇 |
1985年 | 8篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 4篇 |
1979年 | 2篇 |
1977年 | 7篇 |
1976年 | 3篇 |
1972年 | 2篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有802条查询结果,搜索用时 15 毫秒
1.
The notion of pseudorandomness is the theoretical foundation on which to consider the soundness of a basic structure used in some block ciphers. We examine the pseudorandomness of the block cipher KASUMI, which will be used in the next‐generation cellular phones. First, we prove that the four‐round unbalanced MISTY‐type transformation is pseudorandom in order to illustrate the pseudorandomness of the inside round function FI of KASUMI under an adaptive distinguisher model. Second, we show that the three‐round KASUMI‐like structure is not pseudorandom but the four‐round KASUMI‐like structure is pseudorandom under a non‐adaptive distinguisher model. 相似文献
2.
The PBD-Closure of Constant-Composition Codes 总被引:3,自引:0,他引:3
Yeow Meng Chee Ling A.C.H. San Ling Hao Shen 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2007,53(8):2685-2692
We show an interesting pairwise balanced design (PBD)-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A consequence of this PBD-closure result is that the size of optimal constant-composition codes can be determined for infinite families of parameter sets from just a single example of an optimal code. As an application, the sizes of several infinite families of optimal constant-composition codes are derived. In particular, the problem of determining the size of optimal constant-composition codes having distance four and weight three is solved for all lengths sufficiently large. This problem was previously unresolved for odd lengths, except for lengths seven and eleven. 相似文献
3.
Chee -Keng Yap 《Algorithmica》1988,3(1-4):279-288
We give a parallel method for triangulating a simple polygon by two (parallel) calls to the trapezoidal map computation. The method is simpler and more elegant than previous methods. Along the way we obtain an interesting partition of one-sided monotone polygons. Using the best-known trapezoidal map algorithm, ours run in timeO(logn) usingO(n) CREW PRAM processors. 相似文献
4.
Computer-mediated communication has become a popular platform for identity construction and experimentation as well as social interaction for those who identify as lesbian, gay, bisexual or transgender (LGBT). The creation of user-generated videos has allowed content creators to share experiences on LGBT topics. With bullying becoming more common amongst LGBT youth, it is important to obtain a greater understanding of this phenomenon. In our study, we report on the analysis of 151 YouTube videos which were identified as having LGBT- and bullying-related content. The analysis reveals how content creators openly disclose personal information about themselves and their experiences in a non-anonymous rhetoric with an unknown public. These disclosures could indicate a desire to seek friendship, support and provide empathy. 相似文献
5.
Kim Kihyeun Son Myungwoo Pak Yusin Chee Sang-Soo Auxilia Francis Malar Lee Byung-Kee Lee Sungeun Kang Sun Kil Lee Chaedeok Lee Jeong Soo Kim Ki Kang Jang Yun Hee Lee Byoung Hun Jung Gun-Young Ham Moon-Ho 《Nano Research》2018,11(7):3957-3957
Nano Research - The order of the authors in the original version of this article was unfortunately incorrect on the first page and the first page of the ESM. Instead of Myungwoo Son1, Yusin Pak1,... 相似文献
6.
Thermal actuated sliders are being widely used in today’s hard disk drive industry for its advantages of easier control of flying height (FH) and less risk of contacts with the disk. This article uses a coupled-field analysis method, which includes an air bearing model, a heat transfer model and a thermal-structural finite element model to investigate the FH changes of thermal actuated sliders at various environmental conditions. The mechanism of water vapour’s contribution to air bearing pressure loss is explained and a new humidity model is proposed to calculate this pressure loss. The temperature effects are also considered in the simulation models. It is observed that the environmental temperature and humidity have significant effects on slider’s FH changes, but their effects on the thermal protrusion height are limited. A humidity sensitivity study is also made and the results are discussed. It is found that the slider with thermal protrusion on its trailing pad will be more sensitive to the humidity. Besides air bearing stiffness, some other factors such as peak pressure, protrusion shape and air bearing surface (ABS) design will also contribute to the slider’s humidity sensitivity. 相似文献
7.
8.
Kok Yew Ng Chee Pin Tan Rini Akmeliawati Christopher Edwards 《Asian journal of control》2010,12(5):656-660
This paper investigates and presents conditions that guarantee disturbance decoupled fault reconstruction using sliding mode observers, which are less stringent than those of previous work, and show that disturbance reconstruction is not necessary. An aircraft model validates the ideas proposed in this paper. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society 相似文献
9.
This paper proposes a probabilistic variant of the SOM-kMER (Self Organising Map-kernel-based Maximum Entropy learning Rule)
model for data classification. The classifier, known as pSOM-kMER (probabilistic SOM-kMER), is able to operate in a probabilistic
environment and to implement the principles of statistical decision theory in undertaking classification problems. A distinctive
feature of pSOM-kMER is its ability in revealing the underlying structure of data. In addition, the Receptive Field (RF) regions
generated can be used for variable kernel and non-parametric density estimation. Empirical evaluation using benchmark datasets
shows that pSOM-kMER is able to achieve good performance as compared with those from a number of machine learning systems.
The applicability of the proposed model as a useful data classifier is also demonstrated with a real-world medical data classification
problem. 相似文献
10.
Joc Cing Tay Cheun Hou Tng Chee Siong Chan 《Genetic Programming and Evolvable Machines》2008,9(1):5-37
The game of tag is frequently used in the study of pursuit and evasion strategies that are discovered through competitive
coevolution. The aim of coevolution is to create an arms race where opposing populations cyclically evolve in incremental
improvements, driving the system towards better strategies. A coevolutionary simulation of the game of tag involving two populations
of agents; pursuers and evaders, is developed to investigate the effects of a boundary and two obstacles. The evolution of
strategies through Chemical Genetic Programming optimizes the mapping of genotypic strings to phenotypic trees. Four experiments
were conducted, distinguished by speed differentials and environmental conditions. Designing experiments to evaluate the efficacy
of emergent strategies often reveal necessary steps needed for coevolutionary progress. The experiments that excluded obstacles
and boundaries provided design pointers to ensure coevolutionary progress as well as a deeper understanding of strategies
that emerged when obstacles and boundaries were added. In the latter, we found that an awareness of the environment and the
pursuer was not critical in an evader’s strategy to survive, instead heading to the edge of the boundary or behind an obstacle
in a bid to ‘throw-off or hide from the pursuer’ or simply turn in circles was often sufficient, thereby revealing possible
suboptimal strategies that were environment specific. We also observed that a condition for coevolutionary progress was that
the problem complexity must be surmountable by at least one population; that is, some pursuer must be able to tag an opponent.
Due to the use of amino-acid building blocks in our Chemical Genetic Program, our simulations were able to achieve significant
complexity in a short period of time.
相似文献
Joc Cing TayEmail: |