全文获取类型
收费全文 | 18232篇 |
免费 | 3276篇 |
国内免费 | 2138篇 |
专业分类
电工技术 | 3976篇 |
综合类 | 1849篇 |
化学工业 | 262篇 |
金属工艺 | 79篇 |
机械仪表 | 793篇 |
建筑科学 | 365篇 |
矿业工程 | 160篇 |
能源动力 | 504篇 |
轻工业 | 92篇 |
水利工程 | 337篇 |
石油天然气 | 129篇 |
武器工业 | 128篇 |
无线电 | 2916篇 |
一般工业技术 | 680篇 |
冶金工业 | 368篇 |
原子能技术 | 70篇 |
自动化技术 | 10938篇 |
出版年
2024年 | 52篇 |
2023年 | 319篇 |
2022年 | 543篇 |
2021年 | 628篇 |
2020年 | 686篇 |
2019年 | 608篇 |
2018年 | 543篇 |
2017年 | 726篇 |
2016年 | 748篇 |
2015年 | 893篇 |
2014年 | 1249篇 |
2013年 | 1161篇 |
2012年 | 1364篇 |
2011年 | 1378篇 |
2010年 | 1194篇 |
2009年 | 1226篇 |
2008年 | 1408篇 |
2007年 | 1465篇 |
2006年 | 1174篇 |
2005年 | 1195篇 |
2004年 | 1036篇 |
2003年 | 836篇 |
2002年 | 697篇 |
2001年 | 569篇 |
2000年 | 408篇 |
1999年 | 334篇 |
1998年 | 236篇 |
1997年 | 174篇 |
1996年 | 155篇 |
1995年 | 147篇 |
1994年 | 116篇 |
1993年 | 75篇 |
1992年 | 55篇 |
1991年 | 44篇 |
1990年 | 24篇 |
1989年 | 17篇 |
1988年 | 19篇 |
1987年 | 15篇 |
1986年 | 17篇 |
1985年 | 16篇 |
1984年 | 9篇 |
1983年 | 11篇 |
1982年 | 10篇 |
1981年 | 7篇 |
1980年 | 10篇 |
1979年 | 13篇 |
1978年 | 6篇 |
1976年 | 7篇 |
1975年 | 6篇 |
1972年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
Retrieving 3D shapes with 2D images has become a popular research area nowadays, and a great deal of work has been devoted to reducing the discrepancy between 3D shapes and 2D images to improve retrieval performance. However, most approaches ignore the semantic information and decision boundaries of the two domains, and cannot achieve both domain alignment and category alignment in one module. In this paper, a novel Collaborative Distribution Alignment (CDA) model is developed to address the above existing challenges. Specifically, we first adopt a dual-stream CNN, following a similarity guided constraint module, to generate discriminative embeddings for input 2D images and 3D shapes (described as multiple views). Subsequently, we explicitly introduce a joint domain-class alignment module to dynamically learn a class-discriminative and domain-agnostic feature space, which can narrow the distance between 2D image and 3D shape instances of the same underlying category, while pushing apart the instances from different categories. Furthermore, we apply a decision boundary refinement module to avoid generating class-ambiguity embeddings by dynamically adjusting inconsistencies between two discriminators. Extensive experiments and evaluations on two challenging benchmarks, MI3DOR and MI3DOR-2, demonstrate the superiority of the proposed CDA method for 2D image-based 3D shape retrieval task. 相似文献
2.
Farzaneh Khorasani Morteza Mohammadi Zanjireh Mahdi Bahaghighat Qin Xin 《计算机系统科学与工程》2022,40(3):1085-1098
With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance which can be directly affected by the selection in the primary clusters. Lack of attention to this crucial issue has consequences such as creating empty clusters and decreasing the convergence time. Besides, the selection of appropriate initial seeds can reduce the cluster’s inconsistency. In this paper, we present a new method to determine the initial seeds of the k-mean algorithm to improve the accuracy and decrease the number of iterations of the algorithm. For this purpose, a new method is proposed considering the average distance between objects to determine the initial seeds. Our method attempts to provide a proper tradeoff between the accuracy and speed of the clustering algorithm. The experimental results showed that our proposed approach outperforms the Chithra with 1.7% and 2.1% in terms of clustering accuracy for Wine and Abalone detection data, respectively. Furthermore, achieved results indicate that comparing with the Reverse Nearest Neighbor (RNN) search approach, the proposed method has a higher convergence speed. 相似文献
3.
Edge Computing is one of the radically evolving systems through generations as it is able to effectively meet the data saving standards of consumers, providers and the workers. Requisition for Edge Computing based items have been increasing tremendously. Apart from the advantages it holds, there remain lots of objections and restrictions, which hinders it from accomplishing the need of consumers all around the world. Some of the limitations are constraints on computing and hardware, functions and accessibility, remote administration and connectivity. There is also a backlog in security due to its inability to create a trust between devices involved in encryption and decryption. This is because security of data greatly depends upon faster encryption and decryption in order to transfer it. In addition, its devices are considerably exposed to side channel attacks, including Power Analysis attacks that are capable of overturning the process. Constrained space and the ability of it is one of the most challenging tasks. To prevail over from this issue we are proposing a Cryptographic Lightweight Encryption Algorithm with Dimensionality Reduction in Edge Computing. The t-Distributed Stochastic Neighbor Embedding is one of the efficient dimensionality reduction technique that greatly decreases the size of the non-linear data. The three dimensional image data obtained from the system, which are connected with it, are dimensionally reduced, and then lightweight encryption algorithm is employed. Hence, the security backlog can be solved effectively using this method. 相似文献
4.
This paper presents a control design for the one‐phase Stefan problem under actuator delay via a backstepping method. The Stefan problem represents a liquid‐solid phase change phenomenon which describes the time evolution of a material's temperature profile and the interface position. The actuator delay is modeled by a first‐order hyperbolic partial differential equation (PDE), resulting in a cascaded transport‐diffusion PDE system defined on a time‐varying spatial domain described by an ordinary differential equation (ODE). Two nonlinear backstepping transformations are utilized for the control design. The setpoint restriction is given to guarantee a physical constraint on the proposed controller for the melting process. This constraint ensures the exponential convergence of the moving interface to a setpoint and the exponential stability of the temperature equilibrium profile and the delayed controller in the norm. Furthermore, robustness analysis with respect to the delay mismatch between the plant and the controller is studied, which provides analogous results to the exact compensation by restricting the control gain. 相似文献
5.
Search results of spatio-temporal data are often displayed on a map, but when the number of matching search results is large, it can be time-consuming to individually examine all results, even when using methods such as filtered search to narrow the content focus. This suggests the need to aggregate results via a clustering method. However, standard unsupervised clustering algorithms like -means (i) ignore relevance scores that can help with the extraction of highly relevant clusters, and (ii) do not necessarily optimize search results for purposes of visual presentation. In this article, we address both deficiencies by framing the clustering problem for search-driven user interfaces in a novel optimization framework that (i) aims to maximize the relevance of aggregated content according to cluster-based extensions of standard information retrieval metrics and (ii) defines clusters via constraints that naturally reflect interface-driven desiderata of spatial, temporal, and keyword coherence that do not require complex ad-hoc distance metric specifications as in -means. After comparatively benchmarking algorithmic variants of our proposed approach – RadiCAL – in offline experiments, we undertake a user study with 24 subjects to evaluate whether RadiCAL improves human performance on visual search tasks in comparison to -means clustering and a filtered search baseline. Our results show that (a) our binary partitioning search (BPS) variant of RadiCAL is fast, near-optimal, and extracts higher-relevance clusters than -means, and (b) clusters optimized via RadiCAL result in faster search task completion with higher accuracy while requiring a minimum workload leading to high effectiveness, efficiency, and user satisfaction among alternatives. 相似文献
6.
针对实体产业对科技资源的服务需求,以服务效应作为资源文本分类标准,提出一种基于多元神经网络融合的分布式资源空间文本分类模型。设计了包含词嵌入层、卷积层、双向门控循环单元层、注意力机制层和softmax层的多元神经网络通路;在此基础上采用基于需求—效应—资源分类策略,完成了从定性科技资源需求到定量资源服务效应求解,再到定性科技资源输出的映射变换,重点解决了分布式科技资源局部和全局语义特征形式多样、文本长距离依赖特征显著、重要资源信息难以准确识别的问题,进而从分布式科技资源空间中快速准确地获取效应知识,提升实体产业产品研发效率和创新能力;通过万方专利科技资源数据集验证了所提方法的可行性和有效性,为更加全面地挖掘资源文本特征和按需服务实体产业提供了一种新的思路和手段。 相似文献
7.
8.
Parallel Multipopulation Differential Evolutionary Particle Swarm Optimization for Voltage and Reactive Power Control 下载免费PDF全文
This paper presents parallel multipopulation differential evolutionary particle swarm optimization (DEEPSO) for voltage and reactive power control (VQC). The problem can be formulated as a mixed integer nonlinear optimization problem and various evolutionary computation techniques have been applied to the problem including PSO, differential evolution (DE), and DEEPSO. Since VQC is one of the online controls, speed‐up of computation is required. Moreover, there is still room for improvement in solution quality. This paper applies parallel multipopulation DEEPSO in order to speed up the calculation and improve solution quality. The proposed method is applied to IEEE 30, 57, and 118 bus systems. The results indicate that the proposed method can realize fast computation and minimize more active power losses than the conventional evolutionary computation techniques. 相似文献
9.
在计算机系统运行以及研究环节中,会存在大量的规模效应,此类状况难以避免,要想有效解决此类问题,就需要利用分布式的处理方式,开展对文件系统的分析。文章对分布式多维联机分析过程(MOLAP)的数据模型进行了分析,从维编码的算法、映射归约(MapReduce)算法的实现、分析维的遍历算法等方面作深入探讨。 相似文献
10.