全文获取类型
收费全文 | 2440篇 |
免费 | 548篇 |
国内免费 | 566篇 |
专业分类
电工技术 | 66篇 |
技术理论 | 1篇 |
综合类 | 339篇 |
化学工业 | 24篇 |
金属工艺 | 9篇 |
机械仪表 | 38篇 |
建筑科学 | 44篇 |
矿业工程 | 9篇 |
能源动力 | 14篇 |
轻工业 | 10篇 |
水利工程 | 13篇 |
石油天然气 | 3篇 |
武器工业 | 4篇 |
无线电 | 623篇 |
一般工业技术 | 126篇 |
冶金工业 | 38篇 |
原子能技术 | 1篇 |
自动化技术 | 2192篇 |
出版年
2024年 | 20篇 |
2023年 | 82篇 |
2022年 | 181篇 |
2021年 | 201篇 |
2020年 | 217篇 |
2019年 | 171篇 |
2018年 | 171篇 |
2017年 | 145篇 |
2016年 | 142篇 |
2015年 | 183篇 |
2014年 | 210篇 |
2013年 | 194篇 |
2012年 | 220篇 |
2011年 | 175篇 |
2010年 | 164篇 |
2009年 | 153篇 |
2008年 | 151篇 |
2007年 | 139篇 |
2006年 | 116篇 |
2005年 | 101篇 |
2004年 | 64篇 |
2003年 | 62篇 |
2002年 | 39篇 |
2001年 | 36篇 |
2000年 | 34篇 |
1999年 | 20篇 |
1998年 | 17篇 |
1997年 | 18篇 |
1996年 | 17篇 |
1995年 | 12篇 |
1994年 | 9篇 |
1993年 | 9篇 |
1992年 | 15篇 |
1991年 | 15篇 |
1990年 | 8篇 |
1989年 | 6篇 |
1988年 | 4篇 |
1987年 | 3篇 |
1985年 | 4篇 |
1983年 | 5篇 |
1982年 | 6篇 |
1981年 | 3篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1973年 | 1篇 |
1971年 | 1篇 |
1969年 | 1篇 |
1966年 | 2篇 |
1965年 | 1篇 |
1956年 | 1篇 |
排序方式: 共有3554条查询结果,搜索用时 16 毫秒
1.
Woong-Kee Loh 《计算机、材料和连续体(英文)》2021,66(2):1251-1267
Many database applications currently deal with objects in a metric space. Examples of such objects include unstructured multimedia objects and points of interest (POIs) in a road network. The M-tree is a dynamic index structure that facilitates an efficient search for objects in a metric space. Studies have been conducted on the bulk loading of large datasets in an M-tree. However, because previous algorithms involve excessive distance computations and disk accesses, they perform poorly in terms of their index construction and search capability. This study proposes two efficient M-tree bulk loading algorithms. Our algorithms minimize the number of distance computations and disk accesses using FastMap and a space-filling curve, thereby significantly improving the index construction and search performance. Our second algorithm is an extension of the first, and it incorporates a partitioning clustering technique and flexible node architecture to further improve the search performance. Through the use of various synthetic and real-world datasets, the experimental results demonstrated that our algorithms improved the index construction performance by up to three orders of magnitude and the search performance by up to 20.3 times over the previous algorithm. 相似文献
2.
Yuhang Wang Yanbin Sun Shen Su Zhihong Tian Mohan Li Jing Qiu Xianzhi Wang 《计算机、材料和连续体(英文)》2019,59(3):983-993
With the evolution of location-based services (LBS), a new type of LBS has already gain a lot of attention and implementation, we name this kind of LBS as the Device-Dependent LBS (DLBS). In DLBS, the service provider (SP) will not only send the information according to the user’s location, more significant, he also provides a service device which will be carried by the user. DLBS has been successfully practised in some of the large cities around the world, for example, the shared bicycle in Beijing and London. In this paper, we, for the first time, blow the whistle of the new location privacy challenges caused by DLBS, since the service device is enabled to perform the localization without the permission of the user. To conquer these threats, we design a service architecture along with a credit system between DLBS provider and the user. The credit system tie together the DLBS device usability with the curious behaviour upon user’s location privacy, DLBS provider has to sacrifice their revenue in order to gain extra location information of their device. We make the simulation of our proposed scheme and the result convince its effectiveness. 相似文献
3.
Pythagorean fuzzy sets (PFSs) were proposed by Yager in 2013 to treat imprecise and vague information in daily life more rigorously and efficiently with higher precision than intuitionistic fuzzy sets. In this paper, we construct new distance and similarity measures of PFSs based on the Hausdorff metric. We first develop a method to calculate a distance between PFSs based on the Hasudorff metric, along with proving several properties and theorems. We then consider a generalization of other distance measures, such as the Hamming distance, the Euclidean distance, and their normalized versions. On the basis of the proposed distances for PFSs, we give new similarity measures to compute the similarity degree of PFSs. Some examples related to pattern recognition and linguistic variables are used to validate the proposed distance and similarity measures. Finally, we apply the proposed methods to multicriteria decision-making by constructing a Pythagorean fuzzy Technique for Order Preference by Similarity to an Ideal Solution and then present a practical example to address an important issue related to social sector. Numerical results indicate that the proposed methods are reasonable and applicable and also that they are well suited in pattern recognition, linguistic variables, and multicriteria decision-making with PFSs. 相似文献
4.
With the popularity of sensor-rich mobile devices, mobile crowdsensing (MCS) has emerged as an effective method for data collection and processing. However, MCS platform usually need workers’ precise locations for optimal task execution and collect sensing data from workers, which raises severe concerns of privacy leakage. Trying to preserve workers’ location and sensing data from the untrusted MCS platform, a differentially private data aggregation method based on worker partition and location obfuscation (DP-DAWL method) is proposed in the paper. DP-DAWL method firstly use an improved K-means algorithm to divide workers into groups and assign different privacy budget to the group according to group size (the number of workers). Then each worker’s location is obfuscated and his/her sensing data is perturbed by adding Laplace noise before uploading to the platform. In the stage of data aggregation, DP-DAWL method adopts an improved Kalman filter algorithm to filter out the added noise (including both added noise of sensing data and the system noise in the sensing process). Through using optimal estimation of noisy aggregated sensing data, the platform can finally gain better utility of aggregated data while preserving workers’ privacy. Extensive experiments on the synthetic datasets demonstrate the effectiveness of the proposed method. 相似文献
5.
6.
随着大数据和云计算的技术的深入应用,人工智能时代的机器学习和深度学习更需要日益增长的数据,因此数据安全与隐私保护变得更加迫切。本文介绍人工智能的定义以及特征,探究数据安全和隐私保护现状,分析数据安全和隐私保护面临的诸多问题,并提出在人工智能时代对数据安全和隐私保护的措施。 相似文献
7.
In this paper, we offer a method aiming to minimize the role of distance metric used in clustering. It is well known that distance metrics used in clustering algorithms heavily influence the end results and also make the algorithms sensitive to imbalanced attribute/feature scales. To solve these problems, a new clustering algorithm using a per-attribute/feature ranking operating mechanism is proposed in this paper. Ranking is a rarely used discrete, nonlinear operator by other clustering algorithms. However, it also has unique advantages over the dominantly used continuous operators. The proposed algorithm is based on the ranks of the data samples in terms of their spatial separation and is able to provide a more objective clustering result compared with the alternative approaches. Numerical examples on benchmark datasets prove the validity and effectiveness of the proposed concept and principles. 相似文献
8.
传统的K-modes算法采用简单的属性匹配方式计算同一属性下不同属性值的距离,并且计算样本距离时令所有属性权重相等。在此基础上,综合考虑有序型分类数据中属性值的顺序关系、无序型分类数据中不同属性值之间的相似性以及各属性之间的关系等,提出一种更加适用于混合型分类数据的改进聚类算法,该算法对无序型分类数据和有序型分类数据采用不同的距离度量,并且用平均熵赋予相应的权重。实验结果表明,改进算法在人工数据集和真实数据集上均有比K-modes算法及其改进算法更好的聚类效果。 相似文献
9.
针对基于位置服务中连续查询情况下,用户自身属性信息很容易被攻击者获取,并通过关联获得用户位置隐私的情况,提出了一种利用粒子群聚类加速相似属性用户寻找,并由相似属性匿名实现用户位置泛化的隐私保护方法。该方法利用位置隐私保护中常用的可信中心服务器,通过对发送到中心服务器中的查询信息进行粒子群属性聚类,在聚类的过程中加速相似属性用户的寻找过程,由相似属性用户完成位置泛化,以此实现位置隐私保护。实验结果证明,这种基于粒子群属性聚类的隐私保护方法具有高于同类算法的隐私保护能力,以及更快的计算处理速度。 相似文献
10.
为了保证无线传感器网络(Wireless Sensor Networks,WSNs)中的源节点位置隐私安全,同时实现安全性能和网络能耗的均衡,提出了WSNs中规避攻击者的源节点位置隐私路由协议,该协议假设节点具有检测攻击者的能力,通过发出危险警告消息使路由路径上的节点采取路由改变策略,使攻击者无法回溯到源节点,延长了源节点保持位置隐私的安全时间。理论分析和仿真实验表明,该协议在消耗较少的通信开销的情况下保证了源节点位置的高度隐私。 相似文献