全文获取类型
收费全文 | 4622篇 |
免费 | 487篇 |
国内免费 | 141篇 |
专业分类
电工技术 | 48篇 |
综合类 | 241篇 |
化学工业 | 2184篇 |
金属工艺 | 119篇 |
机械仪表 | 59篇 |
建筑科学 | 86篇 |
矿业工程 | 57篇 |
能源动力 | 27篇 |
轻工业 | 545篇 |
水利工程 | 5篇 |
石油天然气 | 139篇 |
武器工业 | 12篇 |
无线电 | 183篇 |
一般工业技术 | 382篇 |
冶金工业 | 112篇 |
原子能技术 | 44篇 |
自动化技术 | 1007篇 |
出版年
2024年 | 13篇 |
2023年 | 70篇 |
2022年 | 95篇 |
2021年 | 152篇 |
2020年 | 127篇 |
2019年 | 143篇 |
2018年 | 131篇 |
2017年 | 130篇 |
2016年 | 154篇 |
2015年 | 177篇 |
2014年 | 219篇 |
2013年 | 311篇 |
2012年 | 311篇 |
2011年 | 304篇 |
2010年 | 234篇 |
2009年 | 284篇 |
2008年 | 262篇 |
2007年 | 251篇 |
2006年 | 277篇 |
2005年 | 236篇 |
2004年 | 220篇 |
2003年 | 169篇 |
2002年 | 182篇 |
2001年 | 144篇 |
2000年 | 119篇 |
1999年 | 107篇 |
1998年 | 80篇 |
1997年 | 56篇 |
1996年 | 57篇 |
1995年 | 56篇 |
1994年 | 38篇 |
1993年 | 26篇 |
1992年 | 22篇 |
1991年 | 16篇 |
1990年 | 12篇 |
1989年 | 14篇 |
1988年 | 12篇 |
1987年 | 10篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1984年 | 8篇 |
1983年 | 2篇 |
1979年 | 2篇 |
1976年 | 2篇 |
1971年 | 1篇 |
1964年 | 1篇 |
1963年 | 1篇 |
1959年 | 2篇 |
1956年 | 1篇 |
1955年 | 1篇 |
排序方式: 共有5250条查询结果,搜索用时 31 毫秒
81.
Wayne Madsen 《Information Security Journal: A Global Perspective》2013,22(1):11-16
ABSTRACT Communicating with confidential data requires special attention in a mobile agents environment, especially when the other hosts must be prevented from eavesdropping on the communication. We propose a communication model for secured communication between the agents belonging to publishers and consumers data. Confidentiality is ensured using our on-the-fly encryption-decryption sequence using ElGamal system to directly convert the message or plaintext into one that is encrypted directly with the public key of consumer. The scheme ensures that the data possessed by the agents is secured at all times when it is executing at any untrusted host. Our minimal implementation of the model with Aglets agent platform gives the first faithful picture of the happenings in the model. Finally, we also explain how the homomorphic property of ElGamal scheme can be integrated with our model for a Web-based application such as voting involving multiple agents. 相似文献
82.
83.
一个图的全染色被称为点可区别的即对任意两个不同点的相关联元素及其本身所构成的色集合不同。其中所用的最少颜色数称为G的点可区别全色数。本文定义了一种排序方法:三角排序。利用该排序的结果证明了当n≡5(mod8)和C4n-1/2+2〈m≤C4n/2+2时,梯图Lm≌Pm×P2的点可区别全色数为n。 相似文献
84.
一个图的全染色被称为点可区别的即对任意两个不同点的相关联元素及其本身所构成的色集合不同,其中所用的最少颜色数称为G的点可区别全色数。本文定义了一种排序方法:三角排序。利用该排序的结果证明了当n≡4(mod8)和C4n-1/2+2〈m≤C4n/2+2时,梯图Lm■Pm×P2的点可区别全色数为n。 相似文献
85.
Multicast routing in mobile ad hoc networks (MANETs) poses several challenges due to inherent characteristics of the network such as node mobility, reliability, scarce resources, etc. This paper proposes an Agent Based Multicast Routing Scheme (ABMRS) in MANETs, which uses a set of static and mobile agents. Five types of agents are used in the scheme: Route manager static agent, Network initiation mobile agent, Network management static agent, Multicast initiation mobile agent and Multicast management static agent. The scheme operates in the following steps: (1) to identify reliable nodes; (2) to connect reliable nodes through intermediate nodes; (3) to construct a backbone for multicasting using reliable nodes and intermediate nodes; (4) to join multicast group members to the backbone; (5) to perform backbone and group members management in case of mobility. The scheme has been simulated in various network scenarios to test operation effectiveness in terms of performance parameters such as packet delivery ratio, control overheads and group reliability. Also, a comparison of proposed scheme with MAODV (Multicast Ad hoc on-demand Distance Vector) protocol is presented. ABMRS performs better than MAODV as observed from the simulation. ABMRS offers flexible and adaptable multicast services and also supports component based software development. 相似文献
86.
Vladimir Yanovsky 《Information Processing Letters》2008,108(1):41-44
Dotted interval graphs were introduced by Aumann et al. [Y. Aumann, M. Lewenstein, O. Melamud, R. Pinter, Z. Yakhini, Dotted interval graphs and high throughput genotyping, in: ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 339-348] as a generalization of interval graphs. The problem of coloring these graphs found application in high-throughput genotyping. Jiang [M. Jiang, Approximating minimum coloring and maximum independent set in dotted interval graphs, Information Processing Letters 98 (2006) 29-33] improves the approximation ratio of Aumann et al. [Y. Aumann, M. Lewenstein, O. Melamud, R. Pinter, Z. Yakhini, Dotted interval graphs and high throughput genotyping, in: ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 339-348]. In this work we improve the approximation ratio of Jiang [M. Jiang, Approximating minimum coloring and maximum independent set in dotted interval graphs, Information Processing Letters 98 (2006) 29-33] and Aumann et al. [Y. Aumann, M. Lewenstein, O. Melamud, R. Pinter, Z. Yakhini, Dotted interval graphs and high throughput genotyping, in: ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, pp. 339-348]. In the exposition we develop a generalization of the problem of finding the maximum number of non-attacking queens on a triangle. 相似文献
87.
88.
Abstract. A proper coloring of the edges of a graph G is called acyclic if there is no two-colored cycle in G . The acyclic edge chromatic number of G , denoted by a'(G) , is the least number of colors in an acyclic edge coloring of G . For certain graphs G , a'(G)\geq Δ(G)+2 where Δ(G) is the maximum degree in G . It is known that a'(G)≤ Δ + 2 for almost all Δ -regular graphs, including all Δ -regular graphs whose girth is at least cΔ log Δ . We prove that determining the acyclic edge chromatic number of an arbitrary graph is an NP-complete problem. For graphs
G with sufficiently large girth in terms of Δ(G) , we present deterministic polynomial-time algorithms that color the edges of G acyclically using at most Δ(G)+2 colors. 相似文献
89.
Pablo GotthelfAuthor Vitae Alejandro ZuninoCristian MateosAuthor Vitae Marcelo CampoAuthor Vitae 《Journal of Parallel and Distributed Computing》2008
The lack of proper support for multicast services in the Internet has hindered the widespread use of applications that rely on group communication services such as mobile software agents. Although they do not require high bandwidth or heavy traffic, these types of applications need to cooperate in a scalable, fair and decentralized way. This paper presents GMAC, an overlay network that implements all multicast related functionality–including membership management and packet forwarding–in the end systems. GMAC introduces a new approach for providing multicast services for mobile agent platforms in a decentralized way, where group members cooperate in a fair way, minimize the protocol overhead, thus achieving great scalability. Simulations comparing GMAC with other approaches, in aspects such as end-to-end group propagation delay, group latency, group bandwidth, protocol overhead, resource utilization and failure recovery, show that GMAC is a scalable and robust solution to provide multicast services in a decentralized way to mobile software agent platforms with requirements similar to MoviLog. 相似文献
90.
Abdolhossein Sarrafzadeh Samuel Alexander Farhad Dadgostar Chao Fan Abbas Bigdeli 《Computers in human behavior》2008,24(4):1342-1363
Many software systems would significantly improve performance if they could adapt to the emotional state of the user, for example if Intelligent Tutoring Systems (ITSs), ATM’s, ticketing machines could recognise when users were confused, frustrated or angry they could guide the user back to remedial help systems so improving the service. Many researchers now feel strongly that ITSs would be significantly enhanced if computers could adapt to the emotions of students. This idea has spawned the developing field of affective tutoring systems (ATSs): ATSs are ITSs that are able to adapt to the affective state of students. The term “affective tutoring system” can be traced back as far as Rosalind Picard’s book Affective Computing in 1997.This paper presents research leading to the development of Easy with Eve, an ATS for primary school mathematics. The system utilises a network of computer systems, mainly embedded devices to detect student emotion and other significant bio-signals. It will then adapt to students and displays emotion via a lifelike agent called Eve. Eve’s tutoring adaptations are guided by a case-based method for adapting to student states; this method uses data that was generated by an observational study of human tutors. This paper presents the observational study, the case-based method, the ATS itself and its implementation on a distributed computer systems for real-time performance, and finally the implications of the findings for Human Computer Interaction in general and e-learning in particular. Web-based applications of the technology developed in this research are discussed throughout the paper. 相似文献