全文获取类型
收费全文 | 1377篇 |
免费 | 71篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 14篇 |
综合类 | 1篇 |
化学工业 | 262篇 |
金属工艺 | 9篇 |
机械仪表 | 10篇 |
建筑科学 | 59篇 |
矿业工程 | 3篇 |
能源动力 | 63篇 |
轻工业 | 254篇 |
水利工程 | 16篇 |
石油天然气 | 3篇 |
无线电 | 148篇 |
一般工业技术 | 141篇 |
冶金工业 | 40篇 |
原子能技术 | 1篇 |
自动化技术 | 427篇 |
出版年
2024年 | 3篇 |
2023年 | 15篇 |
2022年 | 42篇 |
2021年 | 53篇 |
2020年 | 20篇 |
2019年 | 35篇 |
2018年 | 44篇 |
2017年 | 38篇 |
2016年 | 63篇 |
2015年 | 44篇 |
2014年 | 77篇 |
2013年 | 111篇 |
2012年 | 100篇 |
2011年 | 105篇 |
2010年 | 84篇 |
2009年 | 94篇 |
2008年 | 100篇 |
2007年 | 94篇 |
2006年 | 76篇 |
2005年 | 48篇 |
2004年 | 43篇 |
2003年 | 30篇 |
2002年 | 24篇 |
2001年 | 15篇 |
2000年 | 10篇 |
1999年 | 11篇 |
1998年 | 20篇 |
1997年 | 5篇 |
1996年 | 7篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 8篇 |
1992年 | 8篇 |
1991年 | 3篇 |
1990年 | 3篇 |
1988年 | 2篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1979年 | 2篇 |
排序方式: 共有1451条查询结果,搜索用时 15 毫秒
101.
Ugur Dogrusoz Konstantinos G. Kakoulis Ioannis G. Tollis 《Information Sciences》2007,177(12):2459-2472
When visualizing graphs, it is essential to communicate the meaning of each graph object via text or graphical labels. Automatic placement of labels in a graph is an NP-Hard problem, for which efficient heuristic solutions have been recently developed. In this paper, we describe a general framework for modeling, drawing, editing, and automatic placement of labels respecting user constraints. In addition, we present the interface and the basic engine of the Graph Editor Toolkit - a family of portable graph visualization libraries designed for integration into graphical user interface application programs. This toolkit produces a high quality automated placement of labels in a graph using our framework. A brief survey of automatic label placement algorithms is also presented. Finally we describe extensions to certain existing automatic label placement algorithms, allowing their integration into this visualization tool. 相似文献
102.
Ioannis Tomkos Anna Tzanakaki Prasad Kulkarni George Markidis Carmen Mas Machuca 《电信纪事》2007,62(5-6):567-583
In transparent optical networks, the optical signal accumulates the effects of all physical impairments present along the path it traverses. The conventional selection of signal paths based on e.g. shortest path routing without considering the signal quality and its association with the physical impairments does not always provide the optimum solution in terms of network performance such as blocking and resource utilization. This paper proposes an impairment constraint based routing algorithm to achieve an optimal combination of physical and networking performance taking into account all physical linear impairments including noise, chromatic and polarization mode dispersion, crosstalk and filter concatenation effects in an integrated approach. The performance of a typical metropolitan area network is examined and the improvement achieved when using the proposed approach compared to the conventional shortest path routing is demonstrated. 相似文献
103.
Controlled Drug Release and Chemotherapy Response in a Novel Acoustofluidic 3D Tumor Platform 下载免费PDF全文
Ioannis K. Zervantonakis Costas D. Arvanitis 《Small (Weinheim an der Bergstrasse, Germany)》2016,12(19):2616-2626
Overcoming transport barriers to delivery of therapeutic agents in tumors remains a major challenge. Focused ultrasound (FUS), in combination with modern nanomedicine drug formulations, offers the ability to maximize drug transport to tumor tissue while minimizing toxicity to normal tissue. This potential remains unfulfilled due to the limitations of current approaches in accurately assessing and quantifying how FUS modulates drug transport in solid tumors. A novel acoustofluidic platform is developed by integrating a physiologically relevant 3D microfluidic device and a FUS system with a closed‐loop controller to study drug transport and assess the response of cancer cells to chemotherapy in real time using live cell microscopy. FUS‐induced heating triggers local release of the chemotherapeutic agent doxorubicin from a liposomal carrier and results in higher cellular drug uptake in the FUS focal region. This differential drug uptake induces locally confined DNA damage and glioblastoma cell death in the 3D environment. The capabilities of acoustofluidics for accurate control of drug release and monitoring of localized cell response are demonstrated in a 3D in vitro tumor mode. This has important implications for developing novel strategies to deliver therapeutic agents directly to the tumor tissue while sparing healthy tissue. 相似文献
104.
Ioannis Caragiannis 《Algorithmica》2013,66(3):512-540
We present three new coordination mechanisms for scheduling n selfish jobs on m unrelated machines. A coordination mechanism aims to mitigate the impact of selfishness of jobs on the efficiency of schedules by defining a local scheduling policy on each machine. The scheduling policies induce a game among the jobs and each job prefers to be scheduled on a machine so that its completion time is minimum given the assignments of the other jobs. We consider the maximum completion time among all jobs as the measure of the efficiency of schedules. The approximation ratio of a coordination mechanism quantifies the efficiency of pure Nash equilibria (price of anarchy) of the induced game. Our mechanisms are deterministic, local, and preemptive in the sense that the scheduling policy does not necessarily process the jobs in an uninterrupted way and may introduce some idle time. Our first coordination mechanism has approximation ratio Θ(logm) and always guarantees that the induced game has pure Nash equilibria to which the system converges in at most n rounds. This result improves a bound of O(log2 m) due to Azar, Jain, and Mirrokni and, similarly to their mechanism, our mechanism uses a global ordering of the jobs according to their distinct IDs. Next we study the intriguing scenario where jobs are anonymous, i.e., they have no IDs. In this case, coordination mechanisms can only distinguish between jobs that have different load characteristics. Our second mechanism handles anonymous jobs and has approximation ratio $O(\frac{\log m}{\log\log m})$ although the game induced is not a potential game and, hence, the existence of pure Nash equilibria is not guaranteed by potential function arguments. However, it provides evidence that the known lower bounds for non-preemptive coordination mechanisms could be beaten using preemptive scheduling policies. Our third coordination mechanism also handles anonymous jobs and has a nice “cost-revealing” potential function. We use this potential function in order, not only to prove the existence of equilibria, but also to upper-bound the price of stability of the induced game by O(logm) and the price of anarchy by O(log2 m). Our third coordination mechanism is the first that handles anonymous jobs and simultaneously guarantees that the induced game is a potential game and has bounded price of anarchy. In order to obtain the above bounds, our coordination mechanisms use m as a parameter. Slight variations of these mechanisms in which this information is not necessary achieve approximation ratios of O(m ? ), for any constant ?>0. 相似文献
105.
Konstantinos Ioannidis Georgios Ch. Sirakoulis Ioannis Andreadis 《Applied Artificial Intelligence》2013,27(8):721-745
A Cellular Automaton-based technique suitable for solving the path planning problem in a distributed robot team is outlined. Real-time path planning is a challenging task that has many applications in the fields of artificial intelligence, moving robots, virtual reality, and agent behavior simulation. The problem refers to finding a collision-free path for autonomous robots between two specified positions in a configuration area. The complexity of the problem increases in systems of multiple robots. More specifically, some distance should be covered by each robot in an unknown environment, avoiding obstacles found on its route to the destination. On the other hand, all robots must adjust their actions in order to keep their initial team formation immutable. Two different formations were tested in order to study the efficiency and the flexibility of the proposed method. Using different formations, the proposed technique could find applications to image processing tasks, swarm intelligence, etc. Furthermore, the presented Cellular Automaton (CA) method was implemented and tested in a real system using three autonomous mobile minirobots called E-pucks. Experimental results indicate that accurate collision-free paths could be created with low computational cost. Additionally, cooperation tasks could be achieved using minimal hardware resources, even in systems with low-cost robots. 相似文献
106.
This paper uses various tests from statistics and dynamical systems theory to support stochastic models to explain the behaviour of the federal funds rate. In particular, a fractional Brownian motion is supported by the power spectrum of the series, the structure function test and the Hurst test. A coloured noise model is supported by the signal differentiation test and the space-time separation test. Evidence against the turbulent behaviour hypothesis is also provided. 相似文献
107.
Kyriaki Kelektsoglou Evangelos T. Karageorgos Ioannis Kosmadakis 《International journal of remote sensing》2013,34(4):1214-1233
Aerosol optical depths (AODs) and single scattering albedos (SSAs) were derived from in situ aircraft measurements of scattering and absorption coefficients at 550 nm. These values were compared to the AODs and SSAs derived from the sun photometer (CIMEL) data of the Aerosol Robotic Network (AERONET) site, in Thessaloniki, Greece, between 18 and 21 July 2006. The aircraft-obtained AODs were lower than the corresponding columnar values. However, aircraft SSAs were found to be in good agreement with the columnar values retrieved from the CIMEL. Aircraft aerosol size distributions measured by means of an optical particle counter (OPC) were also in good agreement with the respective distributions derived from the AERONET site. Filter samples were collected on board the aircraft at different altitudes, to provide detailed information on the chemical composition of tropospheric aerosol. The concentrations of identified chemical species were used to calculate particle refractive indices (RIs) for comparison with the AERONET calculated values. 相似文献
108.
Nuno M. Garrido Ioannis G. Economou António J. Queimada Miguel Jorge Eugénia A. Macedo 《American Institute of Chemical Engineers》2012,58(6):1929-1938
In recent years molecular simulation has emerged as a useful tool to predict physical properties of complex chemical systems. A methodology to estimate the n‐hexane/water and 1‐octanol/water partition coefficients of environmentally relevant solutes, namely substituted alkyl‐aromatic molecules, chlorobenzenes, polychlorinated biphenyls (PCBs) and polychlorinated diphenyl ethers (PCDEs) using molecular simulation is elucidated here. The partition coefficients are calculated based on the absolute solvation Gibbs energies in each phase which are estimated from molecular dynamics simulations employing the thermodynamic integration approach. Very encouraging results, with average absolute deviations of 0.4 log P units are presented. Consequently, this molecular‐based approach with a strong physical background can provide reliable prediction of the partition coefficients in different solvent pairs without the a priori knowledge of experimental data. © 2011 American Institute of Chemical Engineers AIChE J, 58: 1929–1938, 2012 相似文献
109.
Katerina Philippou Christos N. Christou Vlad Socoliuc Ladislau Vekas Eugenia Tanasă Marinela Miclau Ioannis Pashalidis Theodora Krasia-Christoforou 《应用聚合物科学杂志》2021,138(15):50212
Magnetoactive electrospun fibrous membranes consisting of polyvinylpyrrolidone (PVP), chitosan (CS) and pre-fabricated, double-layer oleic acid-coated magnetite nanoparticles (OA.OA.Fe3O4) were fabricated and evaluated as new adsorbent materials for the removal and recovery of uranium (U(VI)) from aqueous solutions. The adsorption has been investigated by batch-type experiments and the solid material has been characterized by X-ray diffraction spectroscopy (XRD), Fourier-transform infrared spectroscopy (FTIR), scanning electron microscopy (SEM), transmission electron microscopy/energy dispersive X-ray analysis (TEM/EDX) and vibration sample magnetometry (VSM) measurements prior and after uranium adsorption. The experimental adsorption data were found to be well fitted with the Langmuir isotherm and the pseudo-second order kinetic model. The results indicate that PVP/CS/OA.OA.Fe3O4 fibrous adsorbents exhibit good adsorption properties towards U(VI) in aqueous solutions, achieving a qmax value of 0.77 mol kg−1 (183.3 mg g−1) at pH 6.0. The experiments regarding the regeneration and reuse of the magnetoactive adsorbents were carried out using Na2CO3, at pH ~11. After four cycles, the percentage relative adsorption remained stable (~100%) whereas the desorption percentage decreased from 31.9% to 21.0%. Generally, the presented results demonstrate that the incorporation of the Fe3O4 NPs has a positive effect on the adsorption efficiency of U(VI) from aquatic environments. 相似文献
110.
Florina M. Ciorba Ioannis Riakiotakis Theodore Andronikos George Papakonstantinou Anthony T. Chronopoulos 《Journal of Parallel and Distributed Computing》2008
Existing dynamic self-scheduling algorithms, used to schedule independent tasks on heterogeneous clusters, cannot handle tasks with dependencies because they lack the support for internode communication. To compensate for this deficiency we introduce a synchronization mechanism that provides inter-processor communication, thus, enabling self-scheduling algorithms to handle efficiently nested loops with dependencies. We also present a weighting mechanism that significantly improves the performance of dynamic self-scheduling algorithms. These algorithms divide the total number of tasks into chunks and assign them to processors. The weighting mechanism adapts the chunk sizes to the computing power and current run-queue state of the processors. The synchronization and weighting mechanisms are orthogonal, in the sense that they can simultaneously be applied to loops with dependencies. Thus, they broaden the application spectrum of dynamic self-scheduling algorithms and improve their performance. Extensive testing confirms the efficiency of the synchronization and weighting mechanisms and the significant improvement of the synchronized–weighted versions of the algorithms over the synchronized-only versions. 相似文献