全文获取类型
收费全文 | 551篇 |
免费 | 45篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 10篇 |
综合类 | 1篇 |
化学工业 | 122篇 |
金属工艺 | 4篇 |
机械仪表 | 13篇 |
建筑科学 | 18篇 |
能源动力 | 19篇 |
轻工业 | 73篇 |
水利工程 | 5篇 |
石油天然气 | 1篇 |
无线电 | 57篇 |
一般工业技术 | 90篇 |
冶金工业 | 62篇 |
原子能技术 | 3篇 |
自动化技术 | 119篇 |
出版年
2023年 | 9篇 |
2022年 | 11篇 |
2021年 | 42篇 |
2020年 | 22篇 |
2019年 | 22篇 |
2018年 | 30篇 |
2017年 | 21篇 |
2016年 | 23篇 |
2015年 | 16篇 |
2014年 | 38篇 |
2013年 | 41篇 |
2012年 | 39篇 |
2011年 | 35篇 |
2010年 | 33篇 |
2009年 | 32篇 |
2008年 | 16篇 |
2007年 | 10篇 |
2006年 | 18篇 |
2005年 | 10篇 |
2004年 | 9篇 |
2003年 | 10篇 |
2002年 | 5篇 |
2001年 | 2篇 |
2000年 | 5篇 |
1999年 | 9篇 |
1998年 | 19篇 |
1997年 | 6篇 |
1996年 | 12篇 |
1995年 | 5篇 |
1994年 | 7篇 |
1993年 | 3篇 |
1992年 | 5篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 4篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1982年 | 3篇 |
1980年 | 3篇 |
1978年 | 1篇 |
1977年 | 4篇 |
1976年 | 1篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有597条查询结果,搜索用时 15 毫秒
1.
2.
Ginevra Salerno 《International journal for numerical methods in engineering》1992,35(7):1351-1395
Structures presenting kinematical inderterminacy are usually called mechanisms. This paper is entirely concerned with assemblies which reveal themselves to be mechanisms at a null value of the load. Among them a first distinction is made between infinitesimal and finite ones, the former being characterized by one or several directions of lower (but not zero) stiffness, whereas the latter show at least one finite admissible displacement for which none of the bars undergoes any elongation. Moreover, there exists the possibility to make a further distinction among the infinitesimal mechanisms, according to which is the order of the stiffness along the direction considered above. The way of evaluating this order is to perform a local analysis of the strain energy of the assembly, once the displacement field is parametrized in terms of a suitable parameter. By means of a finite element technique, this analysis can be easily performed through the numerical approach presented in this report. 相似文献
3.
Schilling D.L. Milstein L.B. Pickholtz R.L. Bruno F. Kanterakis E. Kullback M. Erceg V. Biederman W. Fishman D. Salerno D. 《Communications Magazine, IEEE》1991,29(11):86-93
Multipath propagation in a broadband CDMA environment is described. A propagation model for broadband spread-spectrum signals is presented. Experimental results relating to the sharing of the band by fixed service microwave users and mobile personal communications network (PCN) users are discussed. Field tests indicate that PCN systems can provide high-quality communications when sharing the spectrum with fixed-service microwave systems in suburban and urban areas 相似文献
4.
M Salerno 《Canadian Metallurgical Quarterly》1991,44(8):5292-5297
5.
Valeria Ciaffaglione Prof. Maria N. Modica Prof. Valeria Pittalà Prof. Giuseppe Romeo Prof. Loredana Salerno Dr. Sebastiano Intagliata 《ChemMedChem》2021,16(23):3496-3512
The development of potent antitumor agents with a low toxicological profile against healthy cells is still one of the greatest challenges facing medicinal chemistry. In this context, the “mutual prodrug” approach has emerged as a potential tool to overcome undesirable physicochemical features and mitigate the side effects of approved drugs. Among broad-spectrum chemotherapeutics available for clinical use today, 5-fluorouracil (5-FU) is one of the most representative, also included in the World Health Organization model list of essential medicines. Unfortunately, severe side effects and drug resistance phenomena are still the primary limits and drawbacks in its clinical use. This review describes the progress made over the last ten years in developing 5-FU-based mutual prodrugs to improve the therapeutic profile and achieve targeted delivery to cancer tissues. 相似文献
6.
Laura Francesca Pisani Gian Eugenio Tontini Carmine Gentile Beatrice Marinoni Isabella Teani Nicoletta Nandi Pasquale Creo Emanuele Asti Luigi Bonavina Maurizio Vecchi Luca Pastorelli 《International journal of molecular sciences》2021,22(11)
Interleukin (IL)-33 is a member of the interleukin (IL)-1 family of cytokines linked to the development of inflammatory conditions and cancer in the gastrointestinal tract. This study is designed to investigate whether IL-33 has a direct effect on human gastric epithelial cells (GES-1), the human gastric adenocarcinoma cell line (AGS), and the gastric carcinoma cell line (NCI-N87) by assessing its role in the regulation of cell proliferation, migration, cell cycle, and apoptosis. Cell cycle regulation was also determined in ex vivo gastric cancer samples obtained during endoscopy and surgical procedures. Cell lines and tissue samples underwent stimulation with rhIL-33. Proliferation was assessed by XTT and CFSE assays, migration by wound healing assay, and apoptosis by caspase 3/7 activity assay and annexin V assay. Cell cycle was analyzed by means of propidium iodine assay, and gene expression regulation was assessed by RT-PCR profiling. We found that IL-33 has an antiproliferative and proapoptotic effect on cancer cell lines, and it can stimulate proliferation and reduce apoptosis in normal epithelial cell lines. These effects were also confirmed by the analysis of cell cycle gene expression, which showed a reduced expression of pro-proliferative genes in cancer cells, particularly in genes involved in G0/G1 and G2/M checkpoints. These results were confirmed by gene expression analysis on bioptic and surgical specimens. The aforementioned results indicate that IL-33 may be involved in cell proliferation in an environment- and cell-type-dependent manner. 相似文献
7.
8.
Emanuele Viola 《Computational Complexity》2009,18(3):337-375
We prove new results on the circuit complexity of approximate majority, which is the problem of computing the majority of a given bit string whose fraction of 1’s is bounded away from 1/2 (by
a constant). We then apply these results to obtain new relationships between probabilistic time, BPTime (t), and alternating time, ∑O(1)Time (t). Our main results are the following:
相似文献
1. | We prove that depth-3 circuits with bottom fan-in (log n)/2 that compute approximate majority on n bits must have size at least 2n0.12^{n^{0.1}}. As a corollary we obtain that there is no black-box proof that BPTime (t) í ?2\subseteq \sum_2Time (o(t2)). This complements the (black-box) result that BPTime (t) í ?2\subseteq \sum_2Time (t2 · poly log t) (Sipser and Gács, STOC ’83; Lautemann, IPL ’83). |
2. | We prove that approximate majority is computable by uniform polynomial-size circuits of depth 3. Prior to our work, the only known polynomial-size depth-3 circuits for approximate majority were non-uniform (Ajtai, Ann. Pure Appl. Logic ’83). We also prove that BPTime (t) í ?3\subseteq \sum_3Time (t · poly log t). This complements our results in (1). |
3. | We prove new lower bounds for solving QSAT3 ? ?3\in \sum_3Time (n · poly log n) on probabilistic computational models. In particular, we prove that solving QSAT3 requires time n1+Ω(1) on Turing machines with a random-access input tape and a sequential-access work tape that is initialized with random bits. No nontrivial lower bound was previously known on this model (for a function computable in linear space). |
9.
Consideration was given to the discrete-time MAP/G/1/∞ queuing system where the arriving customer is taken to the server with a certain probability depending only of the processed
length of the customer in service and squeezes out its predecessor to the first place on the queue or, with the complementary
probability, occupies the first place on the queue (inversive probabilistic servicing discipline). For this system, the main
stationary operational characteristics were established. 相似文献
10.
In this paper, we address markerless full-body articulated human motion tracking from multi-view video sequences acquired in a studio environment. The tracking is formulated as a multi-dimensional non-linear optimisation and solved using particle swarm optimisation (PSO), a swarm-intelligence algorithm which has gained popularity in recent years due to its ability to solve difficult non-linear optimisation problems. We show that a small number of particles achieves accuracy levels comparable with several recent algorithms. PSO initialises automatically, does not need a sequence-specific motion model and recovers from temporary tracking divergence through the use of a powerful hierarchical search algorithm (HPSO). We compare experimentally HPSO with particle filter (PF), annealed particle filter (APF) and partitioned sampling annealed particle filter (PSAPF) using the computational framework provided by Balan et al. HPSO accuracy and consistency are better than PF and compare favourably with those of APF and PSAPF, outperforming it in sequences with sudden and fast motion. We also report an extensive experimental study of HPSO over ranges of values of its parameters. 相似文献