全文获取类型
收费全文 | 3512篇 |
免费 | 245篇 |
国内免费 | 7篇 |
专业分类
电工技术 | 38篇 |
综合类 | 6篇 |
化学工业 | 921篇 |
金属工艺 | 60篇 |
机械仪表 | 113篇 |
建筑科学 | 175篇 |
矿业工程 | 15篇 |
能源动力 | 140篇 |
轻工业 | 683篇 |
水利工程 | 30篇 |
石油天然气 | 12篇 |
无线电 | 202篇 |
一般工业技术 | 510篇 |
冶金工业 | 144篇 |
原子能技术 | 23篇 |
自动化技术 | 692篇 |
出版年
2024年 | 7篇 |
2023年 | 39篇 |
2022年 | 112篇 |
2021年 | 143篇 |
2020年 | 118篇 |
2019年 | 128篇 |
2018年 | 157篇 |
2017年 | 134篇 |
2016年 | 168篇 |
2015年 | 130篇 |
2014年 | 176篇 |
2013年 | 281篇 |
2012年 | 245篇 |
2011年 | 282篇 |
2010年 | 197篇 |
2009年 | 209篇 |
2008年 | 169篇 |
2007年 | 157篇 |
2006年 | 131篇 |
2005年 | 114篇 |
2004年 | 101篇 |
2003年 | 75篇 |
2002年 | 69篇 |
2001年 | 46篇 |
2000年 | 38篇 |
1999年 | 31篇 |
1998年 | 43篇 |
1997年 | 24篇 |
1996年 | 34篇 |
1995年 | 29篇 |
1994年 | 15篇 |
1993年 | 19篇 |
1992年 | 17篇 |
1991年 | 13篇 |
1990年 | 9篇 |
1989年 | 12篇 |
1988年 | 9篇 |
1987年 | 7篇 |
1986年 | 9篇 |
1985年 | 12篇 |
1984年 | 6篇 |
1983年 | 6篇 |
1982年 | 7篇 |
1981年 | 8篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1977年 | 7篇 |
1976年 | 3篇 |
1975年 | 4篇 |
1973年 | 2篇 |
排序方式: 共有3764条查询结果,搜索用时 15 毫秒
81.
Dan Lin Prathima Rao Elisa Bertino Ninghui Li Jorge Lobo 《International Journal of Information Security》2010,9(4):253-273
Policy integration and inter-operation is often a crucial requirement when parties with different access control policies
need to participate in collaborative applications and coalitions. Such requirement is even more difficult to address for dynamic
large-scale collaborations, in which the number of access control policies to analyze and compare can be quite large. An important
step in policy integration and inter-operation is to analyze the similarity of policies. Policy similarity can sometimes also
be a pre-condition for establishing a collaboration, in that a party may enter a collaboration with another party only if
the policies enforced by the other party match or are very close to its own policies. Existing approaches to the problem of
analyzing and comparing access control policies are very limited, in that they only deal with some special cases. By recognizing
that a suitable approach to the policy analysis and comparison requires combining different approaches, we propose in this
paper a comprehensive environment—EXAM. The environment supports various types of analysis query, which we categorize in the
paper. A key component of such environment, on which we focus in the paper, is the policy analyzer able to perform several
types of analysis. Specifically, our policy analyzer combines the advantages of existing MTBDD-based and SAT-solver-based
techniques. Our experimental results, also reported in the paper, demonstrate the efficiency of our analyzer. 相似文献
82.
Manuel Silva Jorge Júlvez Cristian Mahulea C. Renato Vázquez 《Discrete Event Dynamic Systems》2011,21(4):427-497
As a preliminary overview, this work provides first a broad tutorial on the fluidization of discrete event dynamic models,
an efficient technique for dealing with the classical state explosion problem. Even if named as continuous or fluid, the relaxed models obtained are frequently hybrid in a technical sense. Thus,
there is plenty of room for using discrete, hybrid and continuous model techniques for logical verification, performance evaluation
and control studies. Moreover, the possibilities for transferring concepts and techniques from one modeling paradigm to others
are very significant, so there is much space for synergy. As a central modeling paradigm for parallel and synchronized discrete
event systems, Petri nets (PNs) are then considered in much more detail. In this sense, this paper is somewhat complementary
to David and Alla (2010). Our presentation of fluid views or approximations of PNs has sometimes a flavor of a survey, but also introduces some new
ideas or techniques. Among the aspects that distinguish the adopted approach are: the focus on the relationships between discrete and continuous PN models, both for untimed, i.e., fully non-deterministic abstractions, and timed versions; the use of structure theory of (discrete) PNs, algebraic and graph based concepts and results; and the bridge to Automatic Control Theory. After discussing
observability and controllability issues, the most technical part in this work, the paper concludes with some remarks and
possible directions for future research. 相似文献
83.
Bruno R. de Araújo Tiago Guerreiro Manuel J. Fonseca Joaquim A. Jorge João M. Pereira Monica Bordegoni Francesco Ferrise Mario Covarrubias Michele Antolini 《Journal of Real-Time Image Processing》2010,5(2):73-90
Currently, the design of aesthetic products is a process that requires a set of activities where digital models and physical
mockups play a key role. Typically, these are modified (and built) several times before reaching the desired design, increasing
the development time and, consequently, the final product cost. In this paper, we present an innovative design environment
for computer-aided design (CAD) surface analysis. Our system relies on a direct visuo-haptic display system, which enables
users to visualize models using a stereoscopic view, and allows the evaluation of sectional curves using touch. Profile curves
are rendered using an haptic device that deforms a plastic strip, thanks to a set of actuators, to reproduce the curvature
of the shape co-located with the virtual model. By touching the strip, users are able to evaluate shape characteristics, such
as curvature or discontinuities (rendered using sound), and to assess the surface quality. We believe that future computer-aided
systems (CAS)/CAD systems based on our approach will contribute in improving the design process at industrial level. Moreover,
these will allow companies to reduce the product development time by reducing the number of physical mockups necessary for
the product design evaluation and by increasing the quality of the final product, allowing a wider exploration and comparative
evaluation of alternatives in the given time. 相似文献
84.
Jorge Cortés Author vitae 《Automatica》2009,45(12):2754-2762
This paper proposes a simple, distributed algorithm that achieves global stabilization of formations for relative sensing networks in arbitrary dimensions with fixed topology. Assuming the network runs an initialization procedure to equally orient all agent reference frames, convergence to the desired formation shape is guaranteed even in partially asynchronous settings. We characterize the algorithm robustness against several sources of errors: link failures, measurement errors, and frame initialization errors. The technical approach combines algebraic graph theory, multidimensional scaling, and distributed linear iterations. 相似文献
85.
Jorge Navarro-Ortiz Pablo Ameigeiras Juan J. Ramos-Munoz Juan M. Lopez-Soler 《Computer Communications》2009,32(11):1281-1297
In this paper we present a solution for the IEEE 802.11e HCCA (Hybrid coordination function Controlled Channel Access) mechanism which aims both at supporting strict real-time traffic requirements and, simultaneously, at handling TCP applications efficiently. Our proposal combines a packet scheduler and a dynamic resource allocation algorithm. The scheduling discipline is based on the Monolithic Shaper-Scheduler, which is a modification of a General Processor Sharing (GPS) related scheduler. It supports minimum-bandwidth and delay guarantees and, at the same time, it achieves the optimal latency of all the GPS-related schedulers. In addition, our innovative resource allocation procedure, called the territory method, aims at prioritizing real time services and at improving the performance of TCP applications. For this purpose, it splits the wireless channel capacity (in terms of transmission opportunities) into different territories for the different types of traffic, taking into account the end-to-end network dynamics. In order to give support to the desired applications, we consider the following traffic classes: conversational, streaming, interactive and best-effort. The so called territories shrink or expand depending on the current quality experienced by the corresponding traffic class. We evaluated the performance of our solution through extensive simulations in a heterogeneous wired-cum-wireless scenario under different traffic conditions. Additionally, we compare our proposal to other HCCA scheduling algorithms, the HCCA reference scheduler and Fair Hybrid Coordination Function (FHCF). The results show that the combination of the MSS and the territory method obtains higher system capacity for VoIP traffic (up to 32 users) in the simulated scenario, compared to FHCF and the HCCA reference scheduler (13 users). In addition, the MSS with the territory method also improves the throughput of TCP sources (one FTP application achieves between 6.1 Mbps without VoIP traffic and 2.1 Mbps with 20 VoIP users) compared to the reference scheduler (at most 388 kbps) and FHCF (with a maximum FTP throughput of 4.8 Mbps). 相似文献
86.
Nina P.G. Salau Gustavo Alberto Neumann Jorge O. Trierweiler Argimiro R. Secchi 《Journal of Process Control》2009,19(3):530-538
In an industrial gas-phase polyethylene reactor, the safe operating range of temperature is rather narrow. Even within this temperature range, temperature excursions must be avoided because they can result in low catalyst productivity and significant changes in product properties. If the manipulated variable for temperature control saturates (i.e., the cooling water valve position is completely open), then the reactor operates without a feedback temperature controller, leading to oscillatory behavior and limit cycles. In this work, it has been demonstrated that the saturation in the manipulated variable and the complex non-linear dynamic behavior are removed when auxiliary manipulated variables, obtained by bifurcation analysis, are used in a multivariable control strategy for the reactor temperature control. Two control structures are proposed and compared considering their impact in the reactor production and polymer melt index. In the first control structure, the designed PID controller for the reactor temperature is considered and a switching strategy with a PI controller for the auxiliary manipulated variables is included. In the second control structure, the designed PID controller for the reactor temperature is also used, however, a MPC controller for the auxiliary manipulated variables is considered. The results suggest that the use of gain-scheduling strategy in the PID temperature controller with a MPC controller for the auxiliary manipulated variables avoids the saturation of the manipulated variable and, hence, the undesired non-linear dynamic behavior, reducing the production loss and improving the product quality. 相似文献
87.
Using new scheduling heuristics based on resource consumption information for increasing throughput on rule‐based spam filtering systems
下载免费PDF全文
![点击此处可从《Software》网站下载免费的PDF全文](/ch/ext_images/free.gif)
David Ruano‐Ordás Jorge Fdez‐Glez Florentino Fdez‐Riverola José Ramón Méndez 《Software》2016,46(8):1035-1051
The large increase of spam deliveries since the first half of 2013 entailed hard to solve troubles in spam filters. In order to adequately fight spam, the throughput of spam filtering platforms should be necessarily increased. In this context, and taking into consideration the widespread utilization of rule‐based filtering frameworks in the spam filtering domain, this work proposes three novel scheduling strategies for optimizing the time needed to classify new incoming e‐mails through an intelligent management of computational resources depending on the Central Processing Unit (CPU) usage and Input/Output (I/O) delays. In order to demonstrate the suitability of our approaches, we include in our experiments a comparative study in contrast to other successful heuristics previously published in the scientific literature. Results achieved demonstrated that one of our alternative heuristics allows time savings of up to 10% in message filtering, while keeping the same classification accuracy. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
88.
89.
Israel Becerra Rafael Murrieta-Cid Raul Monroy Seth Hutchinson Jean-Paul Laumond 《Autonomous Robots》2016,40(2):395-423
In this paper, we address the problem of determining whether a mobile robot, called the pursuer, is able to maintain strong mutual visibility (a visibility notion between regions over a convex partition of the environment) of an antagonist agent, called the evader. We frame the problem as a non cooperative game. We consider the case in which the pursuer and the evader move at bounded speed, traveling in a known polygonal environment with or without holes, and in which there are no restrictions as to the distance that might separate the agents. Unlike our previous efforts (Murrieta-Cid et al. in Int J Robot Res 26:233–253, 2007), we give special attention to the combinatorial problem that arises when searching for a solution through visiting several locations in an environment with obstacles. In this paper we take a step further, namely, we assume an antagonistic evader who moves continuously and unpredictably, but with a constraint over its set of admissible motion policies, as the evader moves in the shortest-path roadmap, also called the reduced visibility graph (RVG). The pursuer does not know which among the possible paths over the RVG the evader will choose, but the pursuer is free to move within all the environment. We provide a constructive method to solve the decision problem of determining whether or not the pursuer is able to maintain strong mutual visibility of the evader. This method is based on an algorithm that computes the safe areas (areas that keep evader surveillance) at all times. We prove decidability of this problem, and provide a complexity measure to this evader surveillance game; both contributions hold for any general polygonal environment that might or not contain holes. All our algorithms have been implemented and we show simulation results. 相似文献
90.
Carlos?Alberto?Martínez-Angeles Haicheng?Wu Inês?DutraEmail author Vítor?Santos?Costa Jorge?Buenabad-Chávez 《International journal of parallel programming》2016,44(3):663-685
Relational learning algorithms mine complex databases for interesting patterns. Usually, the search space of patterns grows very quickly with the increase in data size, making it impractical to solve important problems. In this work we present the design of a relational learning system, that takes advantage of graphics processing units (GPUs) to perform the most time consuming function of the learner, rule coverage. To evaluate performance, we use four applications: a widely used relational learning benchmark for predicting carcinogenesis in rodents, an application in chemo-informatics, an application in opinion mining, and an application in mining health record data. We compare results using a single and multiple CPUs in a multicore host and using the GPU version. Results show that the GPU version of the learner is up to eight times faster than the best CPU version. 相似文献