全文获取类型
收费全文 | 6905篇 |
免费 | 1403篇 |
国内免费 | 711篇 |
专业分类
电工技术 | 1125篇 |
综合类 | 601篇 |
化学工业 | 862篇 |
金属工艺 | 89篇 |
机械仪表 | 424篇 |
建筑科学 | 133篇 |
矿业工程 | 97篇 |
能源动力 | 82篇 |
轻工业 | 290篇 |
水利工程 | 58篇 |
石油天然气 | 97篇 |
武器工业 | 60篇 |
无线电 | 1139篇 |
一般工业技术 | 811篇 |
冶金工业 | 64篇 |
原子能技术 | 11篇 |
自动化技术 | 3076篇 |
出版年
2024年 | 64篇 |
2023年 | 183篇 |
2022年 | 268篇 |
2021年 | 329篇 |
2020年 | 319篇 |
2019年 | 359篇 |
2018年 | 305篇 |
2017年 | 358篇 |
2016年 | 343篇 |
2015年 | 363篇 |
2014年 | 479篇 |
2013年 | 526篇 |
2012年 | 528篇 |
2011年 | 593篇 |
2010年 | 475篇 |
2009年 | 516篇 |
2008年 | 481篇 |
2007年 | 463篇 |
2006年 | 384篇 |
2005年 | 310篇 |
2004年 | 246篇 |
2003年 | 203篇 |
2002年 | 151篇 |
2001年 | 122篇 |
2000年 | 107篇 |
1999年 | 66篇 |
1998年 | 59篇 |
1997年 | 63篇 |
1996年 | 48篇 |
1995年 | 43篇 |
1994年 | 43篇 |
1993年 | 45篇 |
1992年 | 31篇 |
1991年 | 26篇 |
1990年 | 16篇 |
1989年 | 23篇 |
1988年 | 13篇 |
1987年 | 13篇 |
1986年 | 5篇 |
1985年 | 9篇 |
1984年 | 13篇 |
1983年 | 7篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1951年 | 1篇 |
排序方式: 共有9019条查询结果,搜索用时 15 毫秒
1.
Small object detection is challenging and far from satisfactory. Most general object detectors suffer from two critical issues with small objects: (1) Feature extractor based on classification network cannot express the characteristics of small objects reasonably due to insufficient appearance information of targets and a large amount of background interference around them. (2) The detector requires a much higher location accuracy for small objects than for general objects. This paper proposes an effective and efficient small object detector YOLSO to address the above problems. For feature representation, we analyze the drawbacks in previous backbones and present a Half-Space Shortcut(HSSC) module to build a background-aware backbone. Furthermore, a coarse-to-fine Feature Pyramid Enhancement(FPE) module is introduced for layer-wise aggregation at a granular level to enhance the semantic discriminability. For loss function, we propose an exponential L1 loss to promote the convergence of regression, and a focal IOU loss to focus on prime samples with high classification confidence and high IOU. Both of them significantly improves the location accuracy of small objects. The proposed YOLSO sets state-of-the-art results on two typical small object datasets, MOCOD and VeDAI, at a speed of over 200 FPS. In the meantime, it also outperforms the baseline YOLOv3 by a wide margin on the common COCO dataset. 相似文献
2.
Tumor cell aggregation is critical for cell survival following the loss of extracellular matrix attachment and dissemination. However, the underlying mechanotransduction of clustering solitary tumor cells is poorly understood, especially in non-small cell lung cancers (NSCLC). Here, we examined whether cell surface protrusions played an important role in facilitating the physical contact between floating cells detached from a substrate. We employed poly-2-hydroxyethyl methacrylate-based 3D culture methods to mimic in vivo tumor cell cluster formation. The suprastructural analysis of human NSCLC A549 cell spheroids showed that finger-like protrusions clung together via the actin cytoskeleton. Time-lapse holotomography demonstrated that the finger-like protrusions of free-floating cells in 3D culture displayed exploratory coalescence. Global gene expression analysis demonstrated that the genes in the organic hydroxyl transport were particularly enriched in the A549 cell spheroids. Particularly, the knockdown of the water channel aquaporin 3 gene (AQP3) impaired multicellular aggregate formation in 3D culture through the rearrangement of the actomyosin cytoskeleton. Moreover, the cells with reduced levels of AQP3 decreased their transmigration. Overall, these data indicate that cell detachment-upregulated AQP3 contributes to cell surface protrusions through actomyosin cytoskeleton remodeling, causing the aggressive aggregation of free-floating cells dependent on the property of the substratum and collective metastasis. 相似文献
3.
Bokyung Kim Young Ho Ko Massimiliano Runfola Simona Rapposelli Gabriella Ortore Grazia Chiellini Jin Hae Kim 《International journal of molecular sciences》2021,22(7)
Thyromimetics, whose physicochemical characteristics are analog to thyroid hormones (THs) and their derivatives, are promising candidates as novel therapeutics for neurodegenerative and metabolic pathologies. In particular, sobetirome (GC-1), one of the initial halogen-free thyromimetics, and newly synthesized IS25 and TG68, with optimized ADME-Tox profile, have recently attracted attention owing to their superior therapeutic benefits, selectivity, and enhanced permeability. Here, we further explored the functional capabilities of these thyromimetics to inhibit transthyretin (TTR) amyloidosis. TTR is a homotetrameric transporter protein for THs, yet it is also responsible for severe amyloid fibril formation, which is facilitated by tetramer dissociation into non-native monomers. By combining nuclear magnetic resonance (NMR) spectroscopy, computational simulation, and biochemical assays, we found that GC-1 and newly designed diphenyl-methane-based thyromimetics, namely IS25 and TG68, are TTR stabilizers and efficient suppressors of TTR aggregation. Based on these observations, we propose the novel potential of thyromimetics as a multi-functional therapeutic molecule for TTR-related pathologies, including neurodegenerative diseases. 相似文献
4.
Some picture fuzzy Bonferroni mean operators with their application to multicriteria decision making
In this paper, we extend the Bonferroni mean (BM) operator with the picture fuzzy numbers (PFNs) to propose novel picture fuzzy aggregation operators and demonstrate their application to multicriteria decision making (MCDM). On the basis of the algebraic operational rules of PFNs and BM, we introduce some aggregation operators: the picture fuzzy Bonferroni mean, the picture fuzzy normalized weighted Bonferroni mean, and the picture fuzzy ordered weighted Bonferroni mean. Then, a new picture fuzzy MCDM method is proposed with the help of the proposed operators. Lastly, a practical application of proposed model is given to verify the developed model and related results of the proposed model is compared with the results of the existing models to indicate its applicability. 相似文献
5.
Hai Huang Haichao An Haibo Ma Shenyan Chen 《International journal for numerical methods in engineering》2019,117(3):291-315
This work presents an engineering method for optimizing structures made of bars, beams, plates, or a combination of those components. Corresponding problems involve both continuous (size) and discrete (topology) variables. Using a branched multipoint approximate function, which involves such mixed variables, a series of sequential approximate problems are constructed to make the primal problem explicit. To solve the approximate problems, genetic algorithm (GA) is utilized to optimize discrete variables, and when calculating individual fitness values in GA, a second-level approximate problem only involving retained continuous variables is built to optimize continuous variables. The solution to the second-level approximate problem can be easily obtained with dual methods. Structural analyses are only needed before improving the branched approximate functions in the iteration cycles. The method aims at optimal design of discrete structures consisting of bars, beams, plates, or other components. Numerical examples are given to illustrate its effectiveness, including frame topology optimization, layout optimization of stiffeners modeled with beams or shells, concurrent layout optimization of beam and shell components, and an application in a microsatellite structure. Optimization results show that the number of structural analyses is dramatically decreased when compared with pure GA while even comparable to pure sizing optimization. 相似文献
6.
从生产安全运行的管理要求;电压压降和电流的限制及信号的衰减;网络运行时间的要求;系统设计的影响;备用能力的考虑等各个方面,结合上海赛科聚苯乙烯项目的具体设计,分析隔爆条件下FF现场总线的H1网段负载能力的设计,以供大家探讨。 相似文献
7.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a
given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred
to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional
(resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional
(resp., unidirectional) topology is k-edge connected.
The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied
by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18],
which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19],
which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.
In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity,
and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity
and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for
distributed implementation.
A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless
(Adhoc-Now 2003).
Research performed in part while visiting the Max-Plank-Institut fur Informatik.
Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting
researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University
of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.
Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor
since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and
Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990.
His research interests include optical networks and wireless networks. 相似文献
8.
Ratnabali Biswas Kaushik Chowdhury Dharma P. Agrawal 《International Journal of Wireless Information Networks》2006,13(4):303-315
Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes. 相似文献
9.
Communicating with sensors has long been limited either to wired connections or to proprietary wireless communication protocols. Using a ubiquitous and inexpensive wireless communication technology to create Sensor Area Networks (SANs) will accelerate the extensive deployment of sensor technology. Bluetooth, an emerging, worldwide standard for inexpensive, local wireless communication is a viable choice for SANs because of its inherent support for some of the important requirements – low power, small form factor, low cost and sufficient communication range. In this paper we outline an approach, centered on the Bluetooth technology, to support a sensor network composed of fixed wireless sensors for health monitoring of highways, bridges and other civil infrastructures. We present a topology formation scheme that not only takes into account the traffic generated by different sensors but also the associated link strengths, buffer capacities and energy availability. The algorithm makes no particular assumptions as to the placement of nodes, and not all nodes need to be in radio proximity of each other. The output is a tree shaped scatternet rooted at the sensor hub (data logger) that is balanced in terms of traffic carried on each of the links. We also analyze the scheduling, routing and healing aspects of the resulting sensor-net topology. 相似文献
10.
The multihop optical network is the most appropriate solution to satisfy the increasing applications of Internet services. This paper extends the regular Kautz graph to one with multiple layers in order to produce more architectural variations. The connectivity between adjacent layers utilizes the systematic connection patterns of a regular Kautz graph. A routing algorithm based on its property is presented. Optical passive star (OPS) couplers are adopted to implement our new topologies. Three scheduling criteria that can solve the contention problem in the intermediate nodes are evaluated and compared in terms of their capability to improve the accessibility. 相似文献