全文获取类型
收费全文 | 331篇 |
免费 | 22篇 |
专业分类
电工技术 | 1篇 |
化学工业 | 106篇 |
金属工艺 | 3篇 |
机械仪表 | 5篇 |
建筑科学 | 12篇 |
能源动力 | 5篇 |
轻工业 | 45篇 |
水利工程 | 3篇 |
无线电 | 33篇 |
一般工业技术 | 50篇 |
冶金工业 | 8篇 |
自动化技术 | 82篇 |
出版年
2024年 | 1篇 |
2023年 | 10篇 |
2022年 | 29篇 |
2021年 | 23篇 |
2020年 | 28篇 |
2019年 | 11篇 |
2018年 | 15篇 |
2017年 | 13篇 |
2016年 | 15篇 |
2015年 | 10篇 |
2014年 | 14篇 |
2013年 | 28篇 |
2012年 | 17篇 |
2011年 | 38篇 |
2010年 | 14篇 |
2009年 | 8篇 |
2008年 | 14篇 |
2007年 | 16篇 |
2006年 | 3篇 |
2005年 | 8篇 |
2004年 | 2篇 |
2003年 | 9篇 |
2002年 | 4篇 |
2001年 | 5篇 |
2000年 | 1篇 |
1999年 | 2篇 |
1998年 | 4篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1981年 | 1篇 |
1979年 | 2篇 |
1968年 | 1篇 |
排序方式: 共有353条查询结果,搜索用时 15 毫秒
1.
In recent years, cubic regularization algorithms for unconstrained optimization have been defined as alternatives to trust-region and line search schemes. These regularization techniques are based on the strategy of computing an (approximate) global minimizer of a cubic overestimator of the objective function. In this work we focus on the adaptive regularization algorithm using cubics (ARC) proposed in Cartis et al. [Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results, Mathematical Programming A 127 (2011), pp. 245–295]. Our purpose is to design a modified version of ARC in order to improve the computational efficiency preserving global convergence properties. The basic idea is to suitably combine a Goldstein-type line search and a nonmonotone accepting criterion with the aim of advantageously exploiting the possible good descent properties of the trial step computed as (approximate) minimizer of the cubic model. Global convergence properties of the proposed nonmonotone ARC algorithm are proved. Numerical experiments are performed and the obtained results clearly show satisfactory performance of the new algorithm when compared to the basic ARC algorithm. 相似文献
2.
Antonio Negretti Albert Benseny Jordi Mompart Tommaso Calarco 《Quantum Information Processing》2013,12(3):1439-1467
We numerically investigate the performance of atomic transport in optical microtraps via the so called spatial adiabatic passage technique. Our analysis is carried out by means of optimal control methods, which enable us to determine suitable transport control pulses. We investigate the ultimate limits of the optimal control in speeding up the transport process in a triple well configuration for both a single atomic wave packet and a Bose-Einstein condensate within a regime of experimental parameters achievable with current optical technology. 相似文献
3.
Antonio Negretti Philipp Treutlein Tommaso Calarco 《Quantum Information Processing》2011,10(6):721-753
We review quantum information processing with cold neutral particles, that is, atoms or polar molecules. First, we analyze
the best suited degrees of freedom of these particles for storing quantum information, and then we discuss both single- and
two-qubit gate implementations. We focus our discussion mainly on collisional quantum gates, which are best suited for atom-chip-like
devices, as well as on gate proposals conceived for optical lattices. Additionally, we analyze schemes both for cold atoms
confined in optical cavities and hybrid approaches to entanglement generation, and we show how optimal control theory might
be a powerful tool to enhance the speed up of the gate operations as well as to achieve high fidelities required for fault
tolerant quantum computation. 相似文献
4.
Tommaso Bolognesi 《Information Processing Letters》2009,109(13):668-674
Based on the mobile automaton model, an algorithm is introduced that grows planar, tri-valent graphs by exhibiting a peculiar, twofold dynamics. In a first phase, graph growth appears to be pseudo-random and O(n) then it settles to a very regular behavior and rate. A pseudo-random mobile automaton is already known; the new automaton provides now a finite, but surprisingly long, pseudo-random, linear growth process. Applications of mobile automata to fundamental physics and quantum gravity have been recently suggested. 相似文献
5.
George KousiourisAuthor Vitae Tommaso CucinottaAuthor Vitae 《Journal of Systems and Software》2011,84(8):1270-1291
The aim of this paper is to study and predict the effect of a number of critical parameters on the performance of virtual machines (VMs). These parameters include allocation percentages, real-time scheduling decisions and co-placement of VMs when these are deployed concurrently on the same physical node, as dictated by the server consolidation trend and the recent advances in the Cloud computing systems. Different combinations of VM workload types are investigated in relation to the aforementioned factors in order to find the optimal allocation strategies. What is more, different levels of memory sharing are applied, based on the coupling of VMs to cores on a multi-core architecture. For all the aforementioned cases, the effect on the score of specific benchmarks running inside the VMs is measured. Finally, a black box method based on genetically optimized artificial neural networks is inserted in order to investigate the degradation prediction ability a priori of the execution and is compared to the linear regression method. 相似文献
6.
Azzurra Ragone Tommaso Di Noia Eugenio Di Sciascio Francesco M. Donini 《Autonomous Agents and Multi-Agent Systems》2008,16(3):249-270
We present a novel logic-based framework to automate multi-issue bilateral negotiation in e-commerce settings. The approach
exploits logic as communication language among agents, and optimization techniques in order to find Pareto-efficient agreements.
We introduce , a propositional logic extended with concrete domains, which allows one to model relations among issues (both numerical and
non-numerical ones) via logical entailment, differently from well-known approaches that describe issues as uncorrelated. Through
it is possible to represent buyer’s request, seller’s supply and their respective preferences as formulas endowed with a
formal semantics, e.g., “if I spend more than 30000 € for a sedan then I want more than a two-years warranty and a GPS system included”. We mix logic and utility theory in order to express preferences in a qualitative and quantitative way. We illustrate the
theoretical framework, the logical language, the one-shot negotiation protocol we adopt, and show we are able to compute Pareto-efficient
outcomes, using a mediator to solve an optimization problem. We prove the computational adequacy of our method by studying
the complexity of the problem of finding Pareto-efficient solutions in our setting. 相似文献
7.
The Multiprocessor Bandwidth Inheritance (M-BWI) protocol is an extension of the Bandwidth Inheritance (BWI) protocol for symmetric multiprocessor systems. Similar to Priority Inheritance, M-BWI lets a task that has locked a resource execute in the resource reservations of the blocked tasks, thus reducing their blocking time. The protocol is particularly suitable for open systems where different kinds of tasks dynamically arrive and leave, because it guarantees temporal isolation among independent subsets of tasks without requiring any information on their temporal parameters. Additionally, if the temporal parameters of the interacting tasks are known, it is possible to compute an upper bound to the interference suffered by a task due to other interacting tasks. Thus, it is possible to provide timing guarantees for a subset of interacting hard real-time tasks. Finally, the M-BWI protocol is neutral to the underlying scheduling policy: it can be implemented in global, clustered and semi-partitioned scheduling. After introducing the M-BWI protocol, in this paper we formally prove its isolation properties, and propose an algorithm to compute an upper bound to the interference suffered by a task. Then, we describe our implementation of the protocol for the?LITMUS RT real-time testbed, and measure its overhead. Finally, we compare M-BWI against FMLP and OMLP, two other protocols for resource sharing in multiprocessor systems. 相似文献
8.
Lara Alessandrini Leonardo Franz Marta Sbaraglia Tommaso Saccardo Filippo Cappello Alessandro Drigo Anna Chiara Frigo Gino Marioni 《International journal of molecular sciences》2022,23(14)
Programmed cell death ligand 1 (PD-L1) seems to rely on close relations between neoplastic and immune cells in the tumor microenvironment. Tumor to stroma ratio (TSR) has been associated with prognosis in different malignancies. The aims of this exploratory investigation were to analyze for the first time the: (i) association between TSR, PD-L1 expression and other clinical–pathological features in laryngeal squamous cell carcinoma (LSCC) biopsies and paired surgical specimens; (ii) prognostic and predictive role of TSR and PD-L1. TSR, PD-L1 expression (in terms of combined positive score [CPS]), and other clinical–pathological features were analyzed in biopsies and surgical specimens of 43 consecutive LSCC cases. A CPS < 1 evaluated on surgical specimens was associated with a low TSR (stroma rich) on both biopsies and surgical specimens (p = 0.0143 and p = 0.0063). Low TSR showed a significant negative prognostic value when evaluated on both biopsies and surgical specimens (HR = 8.808, p = 0.0003 and HR = 11.207, p = 0.0002). CPS ≥ 1 appeared to be a favorable prognostic factor (HR = 0.100, p = 0.0265). The association between bioptic and surgical specimen TSR and PD-L1 expression should be further investigated for a potential impact on targeted treatments, also with regard to immunotherapeutic protocols. 相似文献
9.
A highly efficient receiver for satellite‐based automatic identification system signal detection 下载免费PDF全文
Giulio Colavolpe Tommaso Foggi Alessandro Ugolini Juan Lizarraga Stefano Cioni Alberto Ginesi 《International Journal of Satellite Communications and Networking》2016,34(1):57-73
An innovative receiver architecture for the satellite‐based automatic identification system has been recently proposed. In this paper, we describe a few modifications that can be introduced on the algorithms for synchronization and detection, which provide an impressive performance improvement. The receiver architecture has been designed for an on‐board implementation, and a prototype has been implemented by the University of Parma and CGS S.p.A. Compagnia Generale per lo Spazio under the European Space Agency project FENICE (Flexible innovative AIS receiver prototype). A few modifications are also here described that could allow a further performance improvement in case of processing moved to ground‐based stations, based on a priori information there available. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
10.
K. Erik J. Olofsson Anton Soppelsa Tommaso Bolzonella Giuseppe Marchiori 《Control Engineering Practice》2013,21(7):917-929
Input–output datasets from two magnetic confinement fusion (MCF) experiments of the reversed-field pinch (RFP) type are examined. The RFP datasets, which are samples of the distributed magnetic field dynamics, are naturally divided into many smaller batches due to the pulsed-plasma operation of the experiments. The two RFP experiments considered are (i) EXTRAP T2R (T2R) with 64 inputs and 64 outputs and (ii) RFX-mod (RFX) with 192 inputs and 192 outputs. Both T2R and RFX are magnetohydrodynamically unstable and operates under magnetic feedback with optional dither injection. Using subspace system identification techniques and randomised cross-validation (CV) methods to minimise the generalisation error, state-space orders of the empirical systems are suggested. These system orders are compared to “stabilisation diagrams” commonly used in experimental modal analysis practice. The relation of the CV system order to the decay of the singular values from the subspace method is observed. Both (i) stable vacuum diffusion and (ii) unstable plasma response datasets are analysed. Apparent simulation and prediction errors are quantified for both cases using a deviation-accounted-for index. These results are purely data-driven. A simple approach towards exploitation of the subspace techniques for finite-element model refinement and data confrontation is presented. 相似文献