全文获取类型
收费全文 | 973篇 |
免费 | 83篇 |
国内免费 | 2篇 |
学科分类
工业技术 | 1058篇 |
出版年
2024年 | 3篇 |
2023年 | 16篇 |
2022年 | 41篇 |
2021年 | 67篇 |
2020年 | 46篇 |
2019年 | 32篇 |
2018年 | 33篇 |
2017年 | 39篇 |
2016年 | 46篇 |
2015年 | 34篇 |
2014年 | 45篇 |
2013年 | 68篇 |
2012年 | 65篇 |
2011年 | 76篇 |
2010年 | 52篇 |
2009年 | 52篇 |
2008年 | 51篇 |
2007年 | 26篇 |
2006年 | 42篇 |
2005年 | 27篇 |
2004年 | 19篇 |
2003年 | 21篇 |
2002年 | 23篇 |
2001年 | 16篇 |
2000年 | 7篇 |
1999年 | 15篇 |
1998年 | 14篇 |
1997年 | 9篇 |
1996年 | 13篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 6篇 |
1992年 | 9篇 |
1991年 | 3篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 5篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有1058条查询结果,搜索用时 15 毫秒
1.
Masetti F. Gabriagues J.-M. Guittard O. Jacob J.-B. 《Lightwave Technology, Journal of》1995,13(11):2142-2151
In future broadband communication networks the interest for purely photonic switches is due to the bandwidth mismatch between optical transmission networks and electronic switching nodes. Photonic ATM switching fabrics mainly based on wavelength-switching stages are therefore being studied, to implement high capacity switches with also concentration, multiplexing and demultiplexing functions, using state-of-the-art photonic technology. The architecture of an ATM photonic access concentrator is described in this paper, illustrating the design and implementation of its basic subsystems, the traffic concentrator and the cell multiplexer. The design guidelines are outlined in detail referring to an example, where 128 user lines at 622 Mb/s are given access to 4 outlets at 2.488 Gb/s. The corresponding implementation, based on the systematic use of cell wavelength encoding, makes use either of well-known photonic components, such as Fabry-Perot filters, fiber delay lines, splitters and combiners, either of recently developed devices, like high-speed optical gates and tunable filters and lasers. Finally, the system feasibility is demonstrated presenting the results obtained on a reduced size and speed experimental setup of the cell multiplexer 相似文献
2.
3.
Jan Paca Eva Klapkova Martin Halecky Kim Jones Carlos Riccardo Soccol 《Clean Technologies and Environmental Policy》2007,9(1):69-74
The removal of a mixture of painting solvents from waste air using a biofiltration process was evaluated in this project.
The pollutants removed included hydrophobic (aromatic hydrocarbons) and hydrophilic (water soluble ketones and esters) compounds.
A trickle bed reactor with a defined immobilized mixed culture on polyethylene Pall rings was utilized in this biodegradation
study. The removal efficiencies (RE) of the individual groups of pollutants during loading experiments were determined. An
increase of the aromatic hydrocarbons loading resulted in a drop of their REAROM with no effect on the RE value of ketones. The overloading of ketones caused a rapid drop in REAROM and a small drop in REKET. To achieve a restoration of the biocatalyst degradation properties after the increase in loading, an addition of phosphate
to the aqueous medium was implemented which successfully restored the removal efficiency. 相似文献
4.
5.
Silk fibers and membranes were acylated with octadecenylsuccinic anhydride (ODSA) at 75°C for different times. Swelling [N,N‐dimethylformamide (DMF) and dimethyl sulfoxide (DMSO)] and nonswelling (xylene) solvent media were used for the reaction. Silk membranes that reacted in DMF or DMSO displayed faster reaction kinetics and attained higher weight‐gain values than fibers. The effect of the solvent on the reaction yield was in the following order: DMSO > DMF ? xylene. The Fourier transform infrared spectra of acylated silk samples showed the characteristic absorption bands of the anhydride at 2990, 2852, 1780–1700, and 1170 cm?1. The intensity of the latter band, which increased linearly with the weight gain, was used as a marker for evaluating the reaction kinetics of the samples acylated in the nonswelling medium. The moisture regain and water retention of silk fibers acylated with ODSA decreased significantly, regardless of the solvent system used. Accordingly, the water repellency increased. Acylation induced an increase in the thermal stability of the silk fibers and membranes. Fine particles adhering to the surfaces of the silk fibers acylated in xylene were detected by scanning electron microscopy. © 2003 Wiley Periodicals, Inc. J Appl Polym Sci 89: 324–332, 2003 相似文献
6.
Automated formal verification of security protocols has been mostly focused on analyzing high-level abstract models which, however, are significantly different from real protocol implementations written in programming languages. Recently, some researchers have started investigating techniques that bring automated formal proofs closer to real implementations. This paper surveys these attempts, focusing on approaches that target the application code that implements protocol logic, rather than the libraries that implement cryptography. According to these approaches, libraries are assumed to correctly implement some models. The aim is to derive formal proofs that, under this assumption, give assurance about the application code that implements the protocol logic. The two main approaches of model extraction and code generation are presented, along with the main techniques adopted for each approach. 相似文献
7.
Chiara Damiani Dario Pescini Riccardo Colombo Sara Molinari Lilia Alberghina Marco Vanoni Giancarlo Mauri 《Natural computing》2014,13(3):321-331
Constraint-based modeling is largely used in computational studies of metabolism. We propose here a novel approach that aims to identify ensembles of flux distributions that comply with one or more target phenotype(s). The methodology has been tested on a small-scale model of yeast energy metabolism. The target phenotypes describe the differential pattern of ethanol production and O2 consumption observed in “Crabtree-positive” and “Crabtree-negative” yeasts in changing environment (i.e., when the upper limit of glucose uptake is varied). The ensembles were obtained either by selection among sampled flux distributions or by means of a search heuristic (genetic algorithm). The former approach provided indication about the probability to observe a given phenotype, but the resulting ensembles could not be unambiguously partitioned into “Crabtree-positive” and “Crabtree-negative” clusters. On the contrary well-separated clusters were obtained with the latter method. The cluster analysis further allowed identification of distinct groups within each target phenotype. The method may thus prove useful in characterizing the design principles underlying metabolic plasticity arising from evolving physio-pathological or developmental constraints. 相似文献
8.
Mollie B. Schear Arianna Neal Jadah S. Clarke Andrew P. Saab Carl B. Giller Riccardo Casalini Matthew Laskoski 《应用聚合物科学杂志》2021,138(12):50053
The preparation of highly aromatic elastomers from a bisphenol A-based divinyl-terminated resin and polymerization with various aromatic silane containing compounds utilizing a room temperature hydrosilylation reaction is demonstrated. The polymers exhibit high thermal and oxidative stability with 5% weight losses around 430 and 350°C and char yields ranging from 35% to 40%. The thermosets maintained their elastomeric properties with good hardness and mechanical properties as measured by elongation measurements. The toughness of the thermosets was not improved with the inclusion of aromatic moieties but the hardness did appear to increase with the addition of more aromatic groups. 相似文献
9.
Fabio Poiesi Riccardo Mazzon Andrea Cavallaro 《Computer Vision and Image Understanding》2013,117(10):1257-1272
We propose a generic online multi-target track-before-detect (MT-TBD) that is applicable on confidence maps used as observations. The proposed tracker is based on particle filtering and automatically initializes tracks. The main novelty is the inclusion of the target ID in the particle state, enabling the algorithm to deal with unknown and large number of targets. To overcome the problem of mixing IDs of targets close to each other, we propose a probabilistic model of target birth and death based on a Markov Random Field (MRF) applied to the particle IDs. Each particle ID is managed using the information carried by neighboring particles. The assignment of the IDs to the targets is performed using Mean-Shift clustering and supported by a Gaussian Mixture Model. We also show that the computational complexity of MT-TBD is proportional only to the number of particles. To compare our method with recent state-of-the-art works, we include a postprocessing stage suited for multi-person tracking. We validate the method on real-world and crowded scenarios, and demonstrate its robustness in scenes presenting different perspective views and targets very close to each other. 相似文献
10.
In this paper we consider the p-ary transitive reduction (TR
p
) problem where p>0 is an integer; for p=2 this problem arises in inferring a sparsest possible (biological) signal transduction network consistent with a set of
experimental observations with a goal to minimize false positive inferences even if risking false negatives. Special cases
of TR
p
have been investigated before in different contexts; the best previous results are as follows:
In this paper, our contributions are as follows:
R. Albert’s research was partly supported by a Sloan Research Fellowship in Science and Technology.
B. DasGupta’s research was partly supported by NSF grants DBI-0543365, IIS-0612044 and IIS-0346973.
E. Sontag’s research was partly supported by NSF grants EIA 0205116 and DMS-0504557. 相似文献
(1) | The minimum equivalent digraph problem, that correspond to a special case of TR1 with no critical edges, is known to be MAX-SNP-hard, admits a polynomial time algorithm with an approximation ratio of 1.617+ε for any constant ε>0 (Chiu and Liu in Sci. Sin. 4:1396–1400, 1965) and can be solved in linear time for directed acyclic graphs (Aho et al. in SIAM J. Comput. 1(2):131–137, 1972). |
(2) | A 2-approximation algorithm exists for TR1 (Frederickson and JàJà in SIAM J. Comput. 10(2):270–283, 1981; Khuller et al. in 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 937–938, 1999). |
• | We observe that TR p , for any integer p>0, can be solved in linear time for directed acyclic graphs using the ideas in Aho et al. (SIAM J. Comput. 1(2):131–137, 1972). |
• | We provide a 1.78-approximation for TR1 that improves the 2-approximation mentioned in (2) above. |
• | We provide a 2+o(1)-approximation for TR p on general graphs for any fixed prime p>1. |