全文获取类型
收费全文 | 5164篇 |
免费 | 144篇 |
国内免费 | 11篇 |
专业分类
电工技术 | 68篇 |
综合类 | 7篇 |
化学工业 | 948篇 |
金属工艺 | 118篇 |
机械仪表 | 168篇 |
建筑科学 | 132篇 |
矿业工程 | 6篇 |
能源动力 | 202篇 |
轻工业 | 282篇 |
水利工程 | 10篇 |
石油天然气 | 16篇 |
无线电 | 914篇 |
一般工业技术 | 926篇 |
冶金工业 | 529篇 |
原子能技术 | 26篇 |
自动化技术 | 967篇 |
出版年
2023年 | 27篇 |
2022年 | 95篇 |
2021年 | 131篇 |
2020年 | 39篇 |
2019年 | 62篇 |
2018年 | 77篇 |
2017年 | 79篇 |
2016年 | 101篇 |
2015年 | 105篇 |
2014年 | 148篇 |
2013年 | 429篇 |
2012年 | 264篇 |
2011年 | 351篇 |
2010年 | 295篇 |
2009年 | 347篇 |
2008年 | 287篇 |
2007年 | 254篇 |
2006年 | 209篇 |
2005年 | 167篇 |
2004年 | 148篇 |
2003年 | 140篇 |
2002年 | 110篇 |
2001年 | 108篇 |
2000年 | 77篇 |
1999年 | 95篇 |
1998年 | 217篇 |
1997年 | 148篇 |
1996年 | 130篇 |
1995年 | 85篇 |
1994年 | 96篇 |
1993年 | 87篇 |
1992年 | 56篇 |
1991年 | 37篇 |
1990年 | 38篇 |
1989年 | 36篇 |
1988年 | 36篇 |
1987年 | 19篇 |
1986年 | 18篇 |
1985年 | 15篇 |
1984年 | 16篇 |
1983年 | 10篇 |
1982年 | 17篇 |
1980年 | 9篇 |
1979年 | 20篇 |
1978年 | 12篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1975年 | 9篇 |
1974年 | 8篇 |
1973年 | 9篇 |
排序方式: 共有5319条查询结果,搜索用时 0 毫秒
101.
The majority of the scheduling studies carry a common assumption that machines are available all the time. However, machines may not always be available in the scheduling period due to breakdown or preventive maintenance. Taking preventive maintenance activity into consideration, we dealt with the two-machine flowshop scheduling problem with makespan objective. The preventive maintenance policy in this paper was dependent on the number of finished jobs. The integer programming model was proposed. We combined two recent constructive heuristics, HI algorithm and H algorithm, with Johnson’s algorithm, and named the combined heuristic H&J algorithm. We also developed a constructive heuristic, HD, with time complexities O(n2). Based on the difference in job processing times on two machines, both H&J and HD showed good performance, and the latter was slightly better. The HD algorithm was able to obtain the optimality in 98.88% of cases. We also employed the branch and bound (B&B) algorithm to obtain the optimum. With a good upper bound and a modified lower bound, the proposed B&B algorithm performed significantly effectively. 相似文献
102.
Tsung-Han Tsai Author Vitae Author Vitae Chih-Lun Fang Author Vitae 《Pattern recognition》2009,42(7):1496-1510
In video indexing and summarization, videotext is the very compact and accurate information. Most videotext detection and extraction methods only deal with the static videotext on video frames. Few methods can handle motion videotext efficiently since motion videotext is hardly extracted well. In this paper, we propose a two-directional videotext extractor, called 2DVTE. It is developed as an integrated system to detect, localize and extract the scrolling videotexts. First, the detection method is carried out by edge information to classify regions into text and non-text regions. Second, referring to the localization on scrolling videotext, we propose the two-dimensional projection profile method with horizontal and vertical edge map information. Considering the characteristics of Chinese text, the vertical edge map is used to localize the possible text region and horizontal edge map is used to refine the text region. Third, the extraction method consists of dual mode adaptive thresholding and multi-seed filling algorithm. In the dual mode adaptive thresholding, it produces the non-rectangle pattern to divide the background and foreground more precisely. Referring to the multi-seed filling algorithm, it is based on the consideration of the minimum and maximum length and four directions of the stroke while the previous method only considers the minimum length and two directions of the stroke. With this multi-seed exploitation on strokes, precise seeds are obtained to produce more sophisticated videotext. Considering high throughput and the low complexity issue, we can achieve a real-time system on detecting, localizing, and extracting the scrolling videotexts with only one frame usage instead of multi-frame integration in other literatures. According to the experiment results on various video sequences, all of the horizontal and vertical scrolling videotexts can be extracted precisely. We also make comparisons with other methods. In our analysis, the performance of our algorithm is superior to other existing methods in speed and quality. 相似文献
103.
Since color recording and color representing abilities of various media are very different, color information is often lost or misrepresented in the process of image transmission and reproduction. A Color Management System (CMS) based on iCAM color appearance model is presented in this paper. It can be used either in computer operation system software or application software for obtaining color consistency across different software applications, imaging devices, imaging media and viewing conditions. 相似文献
104.
Yung-Wei Kao Tzu-Han Kao Chi-Yang Tsai Shyan-Ming Yuan 《Computer Standards & Interfaces》2009,31(2):437-453
It is common to browse web pages via mobile devices. However, most of the web pages were designed for desktop computers equipped with big screens. When browsing on mobile devices, a user has to scroll up and down to find the information they want because of the limited screen size. Some commercial products reformat web pages. However, the result pages still contain irrelevant information. We propose a system to personalize users’ mobile web pages. A user can determine which blocks in a web page should be retained. The sequence of these blocks can also be altered according to individual preferences. 相似文献
105.
Wireless local area networks provide high speed data transferring rate to a mobile device. And it is crucial to integrate together two critical issues, the authentication and roaming in heterogeneous networks. For this, Tsai and Chang proposed a SIM-based authentication mechanism for wireless local area networks in 2006. Tsai and Chang's scheme provides an integration method of mobile cellular networks and wireless local area networks. Unfortunately, we found that there are some weaknesses existing in their scheme. In this paper, we propose an improved version for a user roaming in heterogeneous networks. Besides, we also proposed a mobile IP model to provide a better efficiency for a mobile user in WLAN environment. 相似文献
106.
Yih-Kuen Tsay Yu-Fang Chen Ming-Hsien Tsai Kang-Nien Wu Wen-Chin Chan Chi-Jian Luo Jinn-Shu Chang 《Formal Aspects of Computing》2009,21(3):259-275
We introduce a graphical interactive tool, named GOAL, that can assist the user in understanding Büchi automata, linear temporal
logic, and their relation. Büchi automata and linear temporal logic are closely related and have long served as fundamental
building blocks of linear-time model checking. Understanding their relation is instrumental in discovering algorithmic solutions
to model checking problems or simply in using those solutions, e.g., specifying a temporal property directly by an automaton
rather than a temporal formula so that the property can be verified by an algorithm that operates on automata. One main function
of the GOAL tool is translation of a temporal formula into an equivalent Büchi automaton that can be further manipulated visually.
The user may edit the resulting automaton, attempting to optimize it, or simply run the automaton on some inputs to get a
basic understanding of how it operates. GOAL includes a large number of translation algorithms, most of which support past
temporal operators. With the option of viewing the intermediate steps of a translation, the user can quickly grasp how a translation
algorithm works. The tool also provides various standard operations and tests on Büchi automata, in particular the equivalence
test which is essential for checking if a hand-drawn automaton is correct in the sense that it is equivalent to some intended
temporal formula or reference automaton. Several use cases are elaborated to show how these GOAL functions may be combined
to facilitate the learning and teaching of Büchi automata and linear temporal logic.
This work was partially supported by the National Science Council, Taiwan (R.O.C.) under grants NSC94-2213-E-002-089, NSC95-2221-E-002-127,
NSC95-3114-P-001-001-Y02 (iCAST 2006), NSC96-3114-P-001-002-Y (iCAST 2007), and NSC97-2221-E-002-074-MY3. 相似文献
107.
This article investigates the use of femtosecond laser induced surface morphology on silicon wafer surface in water confinement.
Unlike irradiation of silicon surfaces in the air, there are no laser induced periodic structures, but irregular roughness
is formed when the silicon wafer is ablated under water. The unique discovery of a smoothly processed silicon surface in water
confinement under certain laser parameter combinations may help improve laser direct micromachining surface quality in industrial
applications. 相似文献
108.
Stephen J.H. Yang Jia Zhang Leon Lin Jeffrey J.P. Tsai 《Expert systems with applications》2009,36(7):10312-10324
As a large amount of information is added onto the Internet on a daily basis, the efficiency of peer-to-peer (P2P) search has become increasingly important. However, how to quickly discover the right resource in a large-scale P2P network without generating too much network traffic remains highly challenging. In this paper, we propose a novel P2P search method, by applying the concept of social grouping and intelligent social search; we derive peers into social groups in a P2P network to improve search performance. Through a super-peer-based architecture, we establish and maintain virtual social groups on top of a P2P network. The interactions between the peers in the P2P network are used to incrementally build the social relationships between the peers in the associated social groups. In such a P2P network, a search query is propagated along the social groups in the overlay social network. Our preliminary experiments have demonstrated that our method can significantly shorten search routes and result in a higher peer search performance. In addition, our method also enhances the trustworthiness of search results because searches go through trusted peers. 相似文献
109.
Ming-Chao Chiang Author Vitae Chun-Wei Tsai Author Vitae Chu-Sing Yang Author Vitae 《Information Sciences》2011,181(4):716-3410
This paper presents an efficient algorithm, called pattern reduction (PR), for reducing the computation time of k-means and k-means-based clustering algorithms. The proposed algorithm works by compressing and removing at each iteration patterns that are unlikely to change their membership thereafter. Not only is the proposed algorithm simple and easy to implement, but it can also be applied to many other iterative clustering algorithms such as kernel-based and population-based clustering algorithms. Our experiments—from 2 to 1000 dimensions and 150 to 10,000,000 patterns—indicate that with a small loss of quality, the proposed algorithm can significantly reduce the computation time of all state-of-the-art clustering algorithms evaluated in this paper, especially for large and high-dimensional data sets. 相似文献
110.
Ribbed helix lip seals for rotating shafts have been widely used to retain oil and exclude contaminants in many applications throughout the industry. The objective of this study is to better understand the basic flow behavior associated with the pumping process of a ribbed helix lip seal. The theoretical model consists of a flow analysis of the lubricating film of the hydraulic fluid in conjunction with a stress analysis of the lip seal distortion. The complicated mechanical interaction between the oil flow and rubber deformation was simulated using a coupled fluid–structure approach implemented in a commercial computational fluid dynamics (CFD) code ESI-CFD, ACE+®. The flow characteristics and rubber deformation around a ribbed helix lip seal were fully resolved in a pumping-rate test environment, where both air and oil sides were filled with oil initially. The three-dimensional pressure field solved by the model via the coupled flow-stress analysis was compared with the predictions obtained from the model via the nondeformable rubber assumption to elucidate the significant effect of the fluid–structure interaction on accurate simulation of the oil pumping behavior. In the rotating speed ranging from 1000 to 6000 rpm, both measured and calculated pumping rates increase with the shaft speed for a ribbed helix lip seal. As compared to the baseline case, calculations with considering the fluid–structure interaction at higher rotary speeds can result in thicker oil films, and in turn produce greater pumping rates. 相似文献