全文获取类型
收费全文 | 94篇 |
免费 | 5篇 |
国内免费 | 8篇 |
专业分类
电工技术 | 9篇 |
综合类 | 7篇 |
化学工业 | 13篇 |
机械仪表 | 2篇 |
建筑科学 | 4篇 |
矿业工程 | 4篇 |
能源动力 | 3篇 |
轻工业 | 7篇 |
水利工程 | 1篇 |
石油天然气 | 4篇 |
无线电 | 8篇 |
一般工业技术 | 4篇 |
冶金工业 | 3篇 |
原子能技术 | 3篇 |
自动化技术 | 35篇 |
出版年
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 8篇 |
2020年 | 3篇 |
2019年 | 5篇 |
2018年 | 8篇 |
2017年 | 3篇 |
2016年 | 5篇 |
2015年 | 8篇 |
2014年 | 3篇 |
2013年 | 5篇 |
2012年 | 7篇 |
2011年 | 5篇 |
2010年 | 2篇 |
2009年 | 3篇 |
2008年 | 1篇 |
2007年 | 3篇 |
2006年 | 3篇 |
2005年 | 3篇 |
2004年 | 3篇 |
2003年 | 7篇 |
2001年 | 2篇 |
1997年 | 6篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1980年 | 1篇 |
排序方式: 共有107条查询结果,搜索用时 31 毫秒
1.
为满足不同规格晶体探测器对分割校准晶体条响应事件位置数据的需求,开发了一种以禁忌搜索算法为核心,结合UDP数据帧、二维高斯模型及光导折射率的位置信息分割校准方法。实验结果表明,本方法在溢出率为5%时,峰谷比可达1218,空间分辨率达17 mm,晶体条响应位置识别准确度高达99%,滤除了引发伪峰的噪声,避免了过分割问题。在面对多种规格晶体阵列的位置谱时,本方法能依照阵列规格将晶体条区域的响应自动校准编号并输出晶体位置查找表,实现响应事件的精确校准。 相似文献
2.
Gu Min Gu Yanhui Luo Weilan Xu Guandong Yang Zhenglu Zhou Junsheng Qu Weiguang 《Neural computing & applications》2021,33(11):6009-6025
Neural Computing and Applications - Semantic understanding is an essential research issue for many applications, such as social network analysis, collective intelligence and content computing,... 相似文献
3.
Li Xiaoxue Cao Yanan Li Qian Shang Yanmin Li Yangxi Liu Yanbing Xu Guandong 《World Wide Web》2021,24(1):85-103
World Wide Web - User identity linkage is a task of recognizing the identities of the same user across different social networks (SN). Previous works tackle this problem via estimating the pairwise... 相似文献
4.
In Web search, with the aid of related query recommendation, Web users can revise their initial queries in several serial rounds in pursuit of finding needed Web pages. In this paper, we address the Web search problem on aggregating search results of related queries to improve the retrieval quality. Given an initial query and the suggested related queries, our search system concurrently processes their search result lists from an existing search engine and then forms a single list aggregated by all the retrieved lists. We specifically propose a generic rank aggregation framework which consists of three steps. First we build a so-called Win/Loss graph of Web pages according to a competition rule, and then apply the random walk mechanism on the Win/Loss graph. Last we sort these Web pages by their ranks using a PageRank-like rank mechanism. The proposed framework considers not only the number of wins that an item won in competitions, but also the quality of its competitor items in calculating the ranking of Web page items. Experimental results show that our search system can clearly improve the retrieval quality in a parallel manner over the traditional search strategy that serially returns result lists. Moreover, we also provide empirical evidences as to demonstrate how different rank aggregation methods affect the retrieval quality. 相似文献
5.
Jaree Thongkam Guandong Xu Yanchun Zhang Fuchun Huang 《Expert systems with applications》2009,36(10):12200-12209
Due to the difficulties of outlier and skewed data, the prediction of breast cancer survivability has presented many challenges in the field of data mining and pattern precognition, especially in medical research. To solve these problems, we have proposed a hybrid approach to generating higher quality data sets in the creation of improved breast cancer survival prediction models. This approach comprises two main steps: (1) utilization of an outlier filtering approach based on C-Support Vector Classification (C-SVC) to identify and eliminate outlier instances; and (2) application of an over-sampling approach using over-sampling with replacement to increase the number of instances in the minority class. In order to assess the capability and effectiveness of the proposed approach, several measurement methods including basic performance (e.g., accuracy, sensitivity, and specificity), Area Under the receiver operating characteristic Curve (AUC) and F-measure were utilized. Moreover, a 10-fold cross-validation method was used to reduce the bias and variance of the results of breast cancer survivability prediction models. Results have indicated that the proposed approach leads to improving the performance of breast cancer survivability prediction models by up to 28.34% due to the improved training data space. 相似文献
6.
Zhiyuan Zhang Yun Liu Guandong Xu Guixun Luo 《Journal of Intelligent Information Systems》2016,47(2):233-246
Recommender Systems (RS) have been comprehensively analyzed in the past decade, Matrix Factorization (MF)-based Collaborative Filtering (CF) method has been proved to be an useful model to improve the performance of recommendation. Factors that inferred from item rating patterns shows the vectors which are useful for MF to characterize both items and users. A recommendation can concluded from good correspondence between item and user factors. A basic MF model starts with an object function, which is consisted of the squared error between original training matrix and predicted matrix as well as the regularization term (regularization parameters). To learn the predicted matrix, recommender systems minimize the squared error which has been regularized. However, two important details have been ignored: (1) the predicted matrix will be more and more accuracy as the iterations carried out, then a fix value of regularization parameters may not be the most suitable choice. (2) the final distribution trend of ratings of predicted matrix is not similar with the original training matrix. Therefore, we propose a Dynamic-MF algorithm and fine tuning method which is quite general to overcome the mentioned detail problems. Some other information, such as social relations, etc, can be easily incorporated into this method (model). The experimental analysis on two large datasets demonstrates that our approaches outperform the basic MF-based method. 相似文献
7.
通过现场的实例,说明镜面式露点仪及阻容式露点仪由于试验方法的不同,会在SF6气体存在某些杂质的情况下,使测得的露点值相差很大,从而导致由露点换算出来的SF6气体微水含最结果也相差很大.由此引发了对试验方法、监督指标、设备的安全运行等问题的讨论,并提出了一些建议. 相似文献
8.
Guandong Liang Guoxun Sun Jianqiang Bi Weili Wang Xiangning Yang Yonghan Li 《Ceramics International》2021,47(2):2058-2067
Uniformly dispersed boron nitride nanosheets (BNNSs) reinforced silicon nitride (Si3N4) composites were prepared by surface modification assisted flocculation combined with SPS sintering. In order to improve the dispersibility of the BNNSs in the composites, the liquid phase stripped BNNSs are surface functionalized by a two-step covalently modification. The amino-modified BNNSs (NH2-BNNSs) and Si3N4 powders have opposite surface potential, mixed evenly by electrostatic interaction during flocculation. The results showed that mechanical properties of Si3N4 composites were obviously enhanced by adding NH2-BNNSs. The fracture toughness and bending strength of Si3N4 composites added 0.75 wt% NH2-BNNSs were increased by 34% and 28%, respectively, compared with monolithic Si3N4. Toughening mechanisms are synergistic action of the torn, pull-out or bridging of BNNSs and crack deflection mechanisms with microstructural analyzes. The dielectric properties of the Si3N4 ceramics are also improved after the addition of NH2-BNNSs. 相似文献
9.
Yanhui Gu Zhenglu Yang Guandong Xu Miyuki Nakano Masashi Toyoda Masaru Kitsuregawa 《World Wide Web》2014,17(4):595-626
Measuring the semantic similarity between sentences is an essential issue for many applications, such as text summarization, Web page retrieval, question-answer model, image extraction, and so forth. A few studies have explored on this issue by several techniques, e.g., knowledge-based strategies, corpus-based strategies, hybrid strategies, etc. Most of these studies focus on how to improve the effectiveness of the problem. In this paper, we address the efficiency issue, i.e., for a given sentence collection, how to efficiently discover the top-k semantic similar sentences to a query. The previous methods cannot handle the big data efficiently, i.e., applying such strategies directly is time consuming because every candidate sentence needs to be tested. In this paper, we propose efficient strategies to tackle such problem based on a general framework. The basic idea is that for each similarity, we build a corresponding index in the preprocessing. Traversing these indices in the querying process can avoid to test many candidates, so as to improve the efficiency. Moreover, an optimal aggregation algorithm is introduced to assemble these similarities. Our framework is general enough that many similarity metrics can be incorporated, as will be discussed in the paper. We conduct extensive experimental evaluation on three real datasets to evaluate the efficiency of our proposal. In addition, we illustrate the trade-off between the effectiveness and efficiency. The experimental results demonstrate that the performance of our proposal outperforms the state-of-the-art techniques on efficiency while keeping the same high precision as them. 相似文献
10.