全文获取类型
收费全文 | 1388篇 |
免费 | 42篇 |
专业分类
电工技术 | 17篇 |
化学工业 | 137篇 |
金属工艺 | 29篇 |
机械仪表 | 17篇 |
建筑科学 | 58篇 |
矿业工程 | 27篇 |
能源动力 | 24篇 |
轻工业 | 124篇 |
水利工程 | 14篇 |
石油天然气 | 22篇 |
武器工业 | 1篇 |
无线电 | 202篇 |
一般工业技术 | 165篇 |
冶金工业 | 232篇 |
原子能技术 | 4篇 |
自动化技术 | 357篇 |
出版年
2023年 | 9篇 |
2022年 | 8篇 |
2021年 | 23篇 |
2020年 | 19篇 |
2019年 | 25篇 |
2018年 | 27篇 |
2017年 | 40篇 |
2016年 | 43篇 |
2015年 | 33篇 |
2014年 | 54篇 |
2013年 | 77篇 |
2012年 | 58篇 |
2011年 | 101篇 |
2010年 | 86篇 |
2009年 | 70篇 |
2008年 | 85篇 |
2007年 | 82篇 |
2006年 | 75篇 |
2005年 | 62篇 |
2004年 | 58篇 |
2003年 | 53篇 |
2002年 | 31篇 |
2001年 | 29篇 |
2000年 | 13篇 |
1999年 | 22篇 |
1998年 | 16篇 |
1997年 | 21篇 |
1996年 | 54篇 |
1995年 | 26篇 |
1994年 | 14篇 |
1993年 | 16篇 |
1992年 | 12篇 |
1991年 | 4篇 |
1990年 | 6篇 |
1989年 | 6篇 |
1988年 | 8篇 |
1987年 | 10篇 |
1986年 | 6篇 |
1985年 | 9篇 |
1984年 | 8篇 |
1983年 | 4篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 4篇 |
1977年 | 1篇 |
1976年 | 4篇 |
1975年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有1430条查询结果,搜索用时 15 毫秒
11.
12.
Cheating is rampant in current gameplay on the Internet. However, it isn't as well understood as we might expect. The authors summarize the various known methods of cheating and define a taxonomy of online game cheating with respect to the underlying vulnerability, consequence, and cheating principal. This taxonomy provides a systematic introduction to the characteristics of cheats in online games and how they can arise. Although cheating in online games is largely due to various security failures, the four traditional aspects of security—confidentiality, integrity, availability, and authenticity—are insufficient to explain it. Instead, fairness becomes a vital additional aspect, and its enforcement provides a convincing perspective for understanding security techniques' role in developing and operating online games. 相似文献
13.
Jeff Jones 《Natural computing》2011,10(4):1345-1369
The single-celled organism Physarum polycephalum efficiently constructs and minimises dynamical nutrient transport networks resembling proximity graphs in the Toussaint hierarchy.
We present a particle model which collectively approximates the behaviour of Physarum. We demonstrate spontaneous transport network formation and complex network evolution using the model and show that the model
collectively exhibits quasi-physical emergent properties, allowing it to be considered as a virtual computing material. This
material is used as an unconventional method to approximate spatially represented geometry problems by representing network
nodes as nutrient sources. We demonstrate three different methods for the construction, evolution and minimisation of Physarum-like transport networks which approximate Steiner trees, relative neighbourhood graphs, convex hulls and concave hulls. We
extend the model to adapt population size in response to nutrient availability and show how network evolution is dependent
on relative node position (specifically inter-node angle), sensor scaling and nutrient concentration. We track network evolution
using a real-time method to record transport network topology in response to global differences in nutrient concentration.
We show how Steiner nodes are utilised at low nutrient concentrations whereas direct connections to nutrients are favoured
when nutrient concentration is high. The results suggest that the foraging and minimising behaviour of Physarum-like transport networks reflect complex interplay between nutrient concentration, nutrient location, maximising foraging
area coverage and minimising transport distance. The properties and behaviour of the synthetic virtual plasmodium may be useful
in future physical instances of distributed unconventional computing devices, and may also provide clues to the generation
of emergent computation behaviour by Physarum. 相似文献
14.
Jeff Winter Author Vitae Kari Rönkkö Author Vitae 《Journal of Systems and Software》2010,83(11):2059-2072
This article presents an experience report where we compare 8 years of experience of product related usability testing and evaluation with principles for software process improvement (SPI). In theory the product and the process views are often seen to be complementary, but studies of industry have demonstrated the opposite. Therefore, more empirical studies are needed to understand and improve the present situation. We find areas of close agreement as well as areas where our work illuminates new characteristics. It has been identified that successful SPI is dependent upon being successfully combined with a business orientation. Usability and business orientation also have strong connections although this has not been extensively addressed in SPI publications. Reasons for this could be that usability focuses on product metrics whilst today's SPI mainly focuses on process metrics. Also because today's SPI is dominated by striving towards a standardized, controllable, and predictable software engineering process; whilst successful usability efforts in organisations are more about creating a creative organisational culture advocating a useful product throughout the development and product life cycle. We provide a study and discussion that supports future development when combining usability and product focus with SPI, in particular if these efforts are related to usability process improvement efforts. 相似文献
15.
Anneliese A. Andrews Jeff Offutt Curtis Dyreson Christopher J. Mallery Kshamta Jerath Roger Alexander 《Information and Software Technology》2010,52(1):52-66
Web applications are fast becoming more widespread, larger, more interactive, and more essential to the international use of computers. It is well understood that web applications must be highly dependable, and as a field we are just now beginning to understand how to model and test Web applications. One straightforward technique is to model Web applications as finite state machines. However, large numbers of input fields, input choices and the ability to enter values in any order combine to create a state space explosion problem. This paper evaluates a solution that uses constraints on the inputs to reduce the number of transitions, thus compressing the FSM. The paper presents an analysis of the potential savings of the compression technique and reports actual savings from two case studies. 相似文献
16.
Web software applications have become complex, sophisticated programs that are based on novel computing technologies. Their
most essential characteristic is that they represent a different kind of software deployment—most of the software is never delivered to customers’ computers, but remains on servers, allowing customers to run the software
across the web. Although powerful, this deployment model brings new challenges to developers and testers. Checking static
HTML links is no longer sufficient; web applications must be evaluated as complex software products. This paper focuses on
three aspects of web applications that are unique to this type of deployment: (1) an extremely loose form of coupling that
features distributed integration, (2) the ability that users have to directly change the potential flow of execution, and (3) the dynamic creation of HTML forms. Taken together, these aspects allow the potential control flow to vary with each execution, thus the possible control flows cannot be determined statically, prohibiting several
standard analysis techniques that are fundamental to many software engineering activities. This paper presents a new way to
model web applications, based on software couplings that are new to web applications, dynamic flow of control, distributed
integration, and partial dynamic web application development. This model is based on the notion of atomic sections, which allow analysis tools to build the analog of a control flow graph for web applications. The atomic section model has
numerous applications in web applications; this paper applies the model to the problem of testing web applications. 相似文献
17.
Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models 总被引:1,自引:0,他引:1
We demonstrate that certain large-clique graph triangulations can be useful for reducing computational requirements when making queries on mixed stochastic/deterministic graphical models. This is counter to the conventional wisdom that triangulations that minimize clique size are always most desirable for use in computing queries on graphical models. Many of these large-clique triangulations are non-minimal and are thus unattainable via the popular elimination algorithm. We introduce ancestral pairs as the basis for novel triangulation heuristics and prove that no more than the addition of edges between ancestral pairs needs to be considered when searching for state space optimal triangulations in such graphs. Empirical results on random and real world graphs are given. We also present an algorithm and correctness proof for determining if a triangulation can be obtained via elimination, and we show that the decision problem associated with finding optimal state space triangulations in this mixed setting is NP-complete. 相似文献
18.
“Global Interoperability Using Semantics, Standards, Science and Technology” is a concept that is predicated on the assumption that the semantic integration, frameworks and standards that support information exchange, and advances in science and technology can enable information-systems interoperability for many diverse users. This paper recommends technologies and approaches for enabling interoperability across a wide spectrum of political, geographical, and organizational levels, e.g. coalition, federal, state, tribal, regional, non government, and private. These recommendations represent steps toward the goal of the Semantic Web, where computers understand information on web sites through knowledge representations, agents, and ontologies. 相似文献
19.
Juan Xia He Michael Sawada Jeff Harris 《International journal of remote sensing》2016,37(20):4778-4798
This is the first systematic investigation into the assumptions of image fusion using regression Kriging (RK) – a geostatistical method – illustrated with Landsat MS (multispectral) and SPOT (Satellite Pour l’Observation de la Terre) panchromatic images. The efficiency of different linear regression and Kriging methods in the fusion process is examined by visual and quantitative indicators. Results indicate a trade-off between spectral fidelity and spatial detail preservation for the GLS (generalized least squares regression) and OLS (ordinary least squares regression) methods in the RK process: OLS methods preserve more spatial detail, while GLS methods retain more spectral information from the MS images but at a greater computational cost. Under either OK (ordinary Kriging) or UK (universal Kriging) with either OLS or GLS, the spherical variogram improves spatial details from the panchromatic image, while the exponential variogram maintains more spectral information from the MS image. Overall, RK-based fusion methods outperform conventional fusion approaches from both the spectral and spatial point of view. 相似文献
20.
Reasoning about software systems at the architectural level is key to effective software development, management, evolution and reuse. All too often, though, the lack of appropriate documentation leads to a situation where architectural design information has to be recovered directly from implemented software artifacts. This is a very demanding process, particularly when involving recovery of runtime abstractions (clients, servers, interaction protocols, etc.) that are typical to the design of distributed software systems. This paper presents an exploratory reverse engineering approach, called X-ray, to aid programmers in recovering architectural runtime information from a distributed system's existing software artifacts. X-ray comprises three domain-based static analysis techniques, namely component module classification, syntactic pattern matching, and structural reachability analysis. These complementary techniques can facilitate the task of identifying a distributed system's implemented executable components and their potential runtime interconnections. The component module classification technique automatically distinguishes source code modules according to the executables components they implement. The syntactic pattern matching technique in turn helps to recognise specific code fragments that may implement typical component interaction features. Finally, the structural reachability analysis technique aids in the association of those features to the code specific for each executable component. The paper describes and illustrates the main concepts underlying each technique, reports on their implementation as a suit of new and off-the-shelf tools, and, to give evidence of the utility of the approach, provides a detailed account of a successful application of the three techniques to help recover a static approximation of the runtime architecture for Field, a publicly-available distributed programming environment. 相似文献