期刊文献+
共找到1,895篇文章
< 1 2 95 >
每页显示 20 50 100
Searching scheme in P2P system based on semantic overlay network 被引量:2
1
作者 霍英 陈志刚 《Journal of Southeast University(English Edition)》 EI CAS 2006年第3期330-333,共4页
In consideration of the limitation of super-peer overlay network, the semantic information was introduced into the super-peers' organization. A novel P2P (peer-to-peer) searching model, SSP2P, was put forward. The ... In consideration of the limitation of super-peer overlay network, the semantic information was introduced into the super-peers' organization. A novel P2P (peer-to-peer) searching model, SSP2P, was put forward. The peers in the model were organized in a natural area autonomy system (AAS) based on the smallworld theory. A super-peer was selected in each AAS based on power law; and all the super-peers formed different super-peer semantic networks. Thus, a hierarchical super-peer overlay network was formed. The results show that the model reduces the communication cost and enhances the search efficiency while ensuring the system expansibility. It proves that the introduction of semantic information in the construction of a super-peer overlay is favorable to P2P system capability. 展开更多
关键词 PEER-TO-PEER searching SEMANTIC SUPER-PEER small world
下载PDF
Semantic overlay network for searching taxonomy-based data sources 被引量:1
2
作者 乔百友 王国仁 谢可心 《Journal of Southeast University(English Edition)》 EI CAS 2007年第3期322-326,共5页
Distributed data sources which employ taxonomy hierarchy to describe the contents of their objects are considered, and a super-peer-based semantic overlay network (SSON) is proposed for sharing and searching their d... Distributed data sources which employ taxonomy hierarchy to describe the contents of their objects are considered, and a super-peer-based semantic overlay network (SSON) is proposed for sharing and searching their data objects. In SSON, peers are dynamically clustered into many semantic clusters based on the semantics of their data objects and organized in the semantic clusters into a semantic overlay network. Each semantic cluster consists of a super-peer and more peers, and is only responsible for answering queries in its semantic subspace. A query is first routed to the appropriate semantic clusters by an efficient searching algorithm, and then it is forwarded to the specific peers that hold the relevant data objects. Experimental results indicate that SSON has good scalability and achieves a competitive trade-off between search efficiency and costs. 展开更多
关键词 peer to peer (P2P) taxonomy hierarchy semantic searching
下载PDF
Parameter optimization of gravity density inversion based on correlation searching and the golden section algorithm 被引量:1
3
作者 孙鲁平 刘展 首皓 《Applied Geophysics》 SCIE CSCD 2012年第2期131-138,233,共9页
For density inversion of gravity anomaly data, once the inversion method is determined, the main factors affecting the inversion result are the inversion parameters and subdivision scheme. A set of reasonable inversio... For density inversion of gravity anomaly data, once the inversion method is determined, the main factors affecting the inversion result are the inversion parameters and subdivision scheme. A set of reasonable inversion parameters and subdivision scheme can, not only improve the inversion process efficiency, but also ensure inversion result accuracy. The gravity inversion method based on correlation searching and the golden section algorithm is an effective potential field inversion method. It can be used to invert 2D and 3D physical properties with potential data observed on flat or rough surfaces. In this paper, we introduce in detail the density inversion principles based on correlation searching and the golden section algorithm. Considering that the gold section algorithm is not globally optimized. we present a heuristic method to ensure the inversion result is globally optimized. With a series of model tests, we systematically compare and analyze the inversion result efficiency and accuracy with different parameters. Based on the model test results, we conclude the selection principles for each inversion parameter with which the inversion accuracy can be obviously improved. 展开更多
关键词 Density inversion correlation searching golden section algorithm inversion parameter optimization
下载PDF
Compact Scanning Tunneling Microscope with Large Scale Searching Capability for Mmultidisciplinary Applications
4
作者 孟文杰 王琦 +2 位作者 张晶 侯玉斌 陆轻铀 《Chinese Journal of Chemical Physics》 SCIE CAS CSCD 2016年第5期523-526,I0001,共5页
We present the design and performance of a home-built scanning tunneling microscope (STM), which is compact (66 mm tall and 25 mm in diameter), yet equipped with a 3D atomic precision piezoelectric motor in which ... We present the design and performance of a home-built scanning tunneling microscope (STM), which is compact (66 mm tall and 25 mm in diameter), yet equipped with a 3D atomic precision piezoelectric motor in which the Z coarse approach relies on a high simplic-ity friction-type walker (of our own invention) driven by an axially cut piezoelectric tube. The walker is vertically inserted in a piezoelectric scanner tube (PST) with its brim laying at on the PST end as the inertial slider (driven by the PST) for the XZ (sample plane) motion. The STM is designed to be capable of searching rare microscopic targets (defects, dopants, boundaries, nano-devices, etc.) in a macroscopic sample area (square millimeters) under extreme conditions (low temperatures, strong magnetic elds, etc.) in which it ts. It gives good atomic resolution images after scanning a highly oriented pyrolytic graphite sample in air at room temperature. 展开更多
关键词 Scanning tunneling microscope Large scale searching Air STM Electrochemical STM
下载PDF
WFRFT modulation recognition based on HOC and optimal order searching algorithm 被引量:6
5
作者 LIANG Yuan DA Xinyu +3 位作者 WU Jialiang XU Ruiyang ZHANG Zhe LIU Hujun 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2018年第3期462-470,共9页
A hybrid carrier(HC) scheme based on weighted-type fractional Fourier transform(WFRFT) has been proposed recently.While most of the works focus on HC scheme's inherent characteristics, little attention is paid to... A hybrid carrier(HC) scheme based on weighted-type fractional Fourier transform(WFRFT) has been proposed recently.While most of the works focus on HC scheme's inherent characteristics, little attention is paid to the WFRFT modulation recognition.In this paper, a new theory is provided to recognize the WFRFT modulation based on higher order cumulants(HOC). First, it is deduced that the optimal WFRFT received order can be obtained through the minimization of 4 th-order cumulants, C_(42). Then, a combinatorial searching algorithm is designed to minimize C_(42).Finally, simulation results show that the designed scheme has a high recognition rate and the combinatorial searching algorithm is effective and reliable. 展开更多
关键词 weighted-type fractional Fourier transform(WFRFT) modulation recognition higher order cumulants(HOC) combinatorial searching algorithm
下载PDF
Routing Protocol Based on Grover’s Searching Algorithm for Mobile Ad-hoc Networks 被引量:3
6
作者 孟利民 宋文波 《China Communications》 SCIE CSCD 2013年第3期145-156,共12页
In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated wit... In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated with traditional routing protocols in MANETs, such as poor anti-fading performance and slow convergence rate, for basic Dynamic Source Routing (DSR), we propose a new routing model based on Grover's searching algorithm. With this new routing model, each node maintains a node vector function, and all the nodes can obtain a node probability vector using Grover's algorithm, and then select an optimal routing according to node probability. Simulation results show that compared with DSR, this new routing protocol can effectively extend the network lifetime, as well as reduce the network delay and the number of routing hops. It can also significantly improve the anti-jamming capability of the network. 展开更多
关键词 Grover's channel fading additive bit error rate searching algorithm noise network delay
下载PDF
Artificial Searching Swarm Algorithm and Its Performance Analysis 被引量:3
7
作者 Tanggong Chen Wang Guo Zhijian Gao 《Applied Mathematics》 2012年第10期1435-1441,共7页
Artificial Searching Swarm Algorithm (ASSA) is a new optimization algorithm. ASSA simulates the soldiers to search an enemy’s important goal, and transforms the process of solving optimization problem into the proces... Artificial Searching Swarm Algorithm (ASSA) is a new optimization algorithm. ASSA simulates the soldiers to search an enemy’s important goal, and transforms the process of solving optimization problem into the process of searching optimal goal by searching swarm with set rules. This work selects complicated and highn dimension functions to deeply analyse the performance for unconstrained and constrained optimization problems and the results produced by ASSA, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Artificial Fish-Swarm Algorithm (AFSA) have been compared. The main factors which influence the performance of ASSA are also discussed. The results demonstrate the effectiveness of the proposed ASSA optimization algorithm. 展开更多
关键词 Artificial searching SWARM ALGORITHM BIONIC Intelligent OPTIMIZATION ALGORITHM OPTIMIZATION Evolutionary Computation SWARM INTELLIGENCE
下载PDF
Fuzzy neural and chaotic searching hybrid algorithm and its application in electric customers’s credit risk evaluation 被引量:2
8
作者 李翔 刘广迎 乞建勋 《Journal of Central South University of Technology》 EI 2007年第1期140-143,共4页
To evaluate the credit risk of customers in power market precisely, the new chaotic searching and fuzzy neural network (FNN) hybrid algorithm were proposed. By combining with the chaotic searching, the learning abilit... To evaluate the credit risk of customers in power market precisely, the new chaotic searching and fuzzy neural network (FNN) hybrid algorithm were proposed. By combining with the chaotic searching, the learning ability of the FNN was markedly enhanced. Customers’ actual credit flaw data of power supply enterprises were collected to carry on the real evaluation, which can be treated as example for the model. The result shows that the proposed method surpasses the traditional statistical models in regard to the precision of forecasting and has a practical value. Compared with the results of ordinary FNN and ANN, the precision of the proposed algorithm can be enhanced by 2.2% and 4.5%, respectively. 展开更多
关键词 power supply enterprise credit-risk fuzzy neural network chaotic searching
下载PDF
Fast Iterative Closest Point-Simultaneous Localization and Mapping(ICP-SLAM)with Rough Alignment and Narrowing-Scale Nearby Searching 被引量:2
9
作者 梁滨 张金艺 唐笛恺 《Journal of Donghua University(English Edition)》 EI CAS 2017年第4期583-590,共8页
Two deficiencies in traditional iterative closest pointsimultaneous localization and mapping( ICP-SLAM) usually result in poor real-time performance. On one hand, relative position between current scan frame and globa... Two deficiencies in traditional iterative closest pointsimultaneous localization and mapping( ICP-SLAM) usually result in poor real-time performance. On one hand, relative position between current scan frame and global map cannot be previously known. As a result, ICP algorithm will take much amount of iterations to reach convergence. On the other hand,establishment of correspondence is done by global searching, which requires enormous computational time. To overcome the two problems,a fast ICP-SLAM with rough alignment and narrowing-scale nearby searching is proposed. As for the decrease of iterative times,rough alignment based on initial pose matrix is proposed. In detail,initial pose matrix is obtained by micro-electro-mechanical system( MEMS) magnetometer and global landmarks. Then rough alignment will be applied between current scan frame and global map at the beginning of ICP algorithm with initial pose matrix. As for accelerating the establishment of correspondence, narrowingscale nearby searching with dynamic threshold is proposed,where match-points are found within a progressively constrictive range.Compared to traditional ICP-SLAM,the experimental results show that the amount of iteration for ICP algorithm to reach convergence reduces to 92. 34% and ICP algorithm runtime reduces to 98. 86% on average. In addition,computational cost is kept in a stable level due to the eliminating of the accumulation of computational consumption. Moreover,great improvement can also been achieved in SLAM quality and robustness. 展开更多
关键词 rough alignment initial pose matrix nearby searching dynamic threshold real-time performance
下载PDF
A New Codebook Design Scheme for Fast Beam Searching in Millimeter-Wave Communications 被引量:1
10
作者 ZOU Weixia GUO Chao +2 位作者 DU Guanglong WANG Zhenyu GAO Ying 《China Communications》 SCIE CSCD 2014年第6期12-22,共11页
To overcome imperfection of exhaustive based beam searching scheme in IEEE 802.15.3c and IEEE 802.11 ad and accelerate the beam training process, combined with the fast beam searching algorithm previously proposed, th... To overcome imperfection of exhaustive based beam searching scheme in IEEE 802.15.3c and IEEE 802.11 ad and accelerate the beam training process, combined with the fast beam searching algorithm previously proposed, this paper proposed a beam codebook design scheme for phased array to not only satisfy the fast beam searching algorithm's demand, but also make good use of the advantage of the searching algorithm. The simulation results prove that the proposed scheme not only performs well on flexibility and searching time complexity, but also has high success ratio. 展开更多
关键词 wireless communication 60GHz phased array BEAM-FORMING beam searching beam codebook design
下载PDF
Grover quantum searching algorithm based on weighted targets 被引量:1
11
作者 Li Panchi Li Shiyong 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2008年第2期363-369,共7页
The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal... The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal. To solve this problem, a Grover searching algorithm based on weighted targets is proposed. First, each target is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the targets are represented as quantum superposition states. Second, the novel Grover searching algorithm based on the quantum superposition of the weighted targets is constructed. Using this algorithm, the probability of getting each target can be approximated to the corresponding weight coefficient, which shows the flexibility of this algorithm. Finally, the validity of the algorithm is proved by a simple searching example. 展开更多
关键词 Grover algorithm targets weighting quantum searching quantum computing.
下载PDF
Quantum Image Searching Based on Probability Distributions 被引量:3
12
作者 Fei Yan Abdullah M. Iliyasu +4 位作者 Chastine Fatichah Martin L. Tangel Janet P. Betancourt Fangyan Dong Kaoru Hirota 《Journal of Quantum Information Science》 2012年第3期55-60,共6页
A quantum image searching method is proposed based on the probability distributions of the readouts from the quantum measurements. It is achieved by using low computational resources which are only a single Hadamard g... A quantum image searching method is proposed based on the probability distributions of the readouts from the quantum measurements. It is achieved by using low computational resources which are only a single Hadamard gate combined with m + 1 quantum measurement operations. To validate the proposed method, a simulation experiment is used where the image with the highest similarity value of 0.93 to the particular test image is retrieved as the search result from 4 × 4 binary image database. The proposal provides a basic step for designing a search engine on quantum computing devices where the image in the database is retrieved based on its similarity to the test image. 展开更多
关键词 QUANTUM COMPUTATION IMAGE Processing QUANTUM IMAGE QUANTUM CIRCUIT IMAGE searching PROBABILITY Distribution
下载PDF
Optimal shape space and searching in the active shape model
13
作者 何良华 邹采荣 +1 位作者 赵力 胡蝶 《Journal of Southeast University(English Edition)》 EI CAS 2005年第3期263-267,共5页
A novel idea,called the optimal shape subspace (OSS) is first proposed for optimizing active shape model (ASM) search.It is constructed from the principal shape subspace and the principal shape variance subspace.I... A novel idea,called the optimal shape subspace (OSS) is first proposed for optimizing active shape model (ASM) search.It is constructed from the principal shape subspace and the principal shape variance subspace.It allows the reconstructed shape to vary more than that reconstructed in the standard ASM shape space,hence it is more expressive in representing shapes in real life.Then a cost function is developed,based on a study on the search process.An optimal searching method using the feedback information provided by the evaluation cost is proposed to improve the performance of ASM alignment.Experimental results show that the proposed OSS can offer the maximum shape variation with reserving the principal information and a unique local optimal shape is acquired after optimal searching.The combination of OSS and optimal searching can improve the ASM performance greatly. 展开更多
关键词 active shape model shape subspace search subspace principal component analysis
下载PDF
Geometric Approximation Searching Algorithm for Spatial Straightness Error Evaluation 被引量:1
14
作者 Jishun Li Xianqing Lei +1 位作者 Yujun Xue Weimin Pan 《Modern Instrumentation》 2013年第1期1-6,共6页
Considering the characteristics of spatial straightness error, this paper puts forward a kind of evaluation method of spatial straightness error using Geometric Approximation Searching Algorithm (GASA). According to t... Considering the characteristics of spatial straightness error, this paper puts forward a kind of evaluation method of spatial straightness error using Geometric Approximation Searching Algorithm (GASA). According to the minimum condition principle of form error evaluation, the mathematic model and optimization objective of the GASA are given. The algorithm avoids the optimization and linearization, and can be fulfilled in three steps. First construct two parallel quadrates based on the preset two reference points of the spatial line respectively;second construct centerlines by connecting one quadrate each vertices to another quadrate each vertices;after that, calculate the distances between measured points and the constructed centerlines. The minimum zone straightness error is obtained by repeating comparing and reconstructing quadrates. The principle and steps of the algorithm to evaluate spatial straightness error is described in detail, and the mathematical formula and program flowchart are given also. Results show that this algorithm can evaluate spatial straightness error more effectively and exactly. 展开更多
关键词 ERROR Evaluation Spatial STRAIGHTNESS GEOMETRIC APPROXIMATION searching Algorithm Minimum ZONE
下载PDF
AUTOMATIC SEARCHING OF CONTROL POINT IN NOAA AVHRR IMAGE
15
作者 Shu Ning Shi Huaxiang 《Geo-Spatial Information Science》 1999年第1期26-29,67,共5页
This paper discusses the approaches for automatical searching of control points in the NOAA AVHRR image on the basis of data rearrangement in the form of latitude and longitude grid. The vegetation index transformatio... This paper discusses the approaches for automatical searching of control points in the NOAA AVHRR image on the basis of data rearrangement in the form of latitude and longitude grid. The vegetation index transformation and multi-level matching strategies have been proven effective and successful as the experiments show while the control point database is established. 展开更多
关键词 control point database automatical searching grid IMAGE VEGETATION index transformation MULTI-LEVEL matching NOAA AVHRR IMAGE
下载PDF
Target-Searching on Percolation
16
作者 YANG Shi-Jie 《Communications in Theoretical Physics》 SCIE CAS CSCD 2005年第3X期431-434,共4页
We study target-searching processes on a percolation, on which a hunter tracks a target by smelling odors it emits. The odor intensity is supposed to be inversely proportional to the distance it propagates. The Monte ... We study target-searching processes on a percolation, on which a hunter tracks a target by smelling odors it emits. The odor intensity is supposed to be inversely proportional to the distance it propagates. The Monte Carlo simulation is performed on a 2-dimensional bond-percolation above the threshold. Having no idea of the location of the target, the hunter determines its moves only by random attempts in each direction. For lager percolation connectivity p (>~) 0.90, it reveals a scaling law for the searching time versus the distance to the position of the target. The scaling exponent is dependent on the sensitivity of the hunter. For smaller p, the scaling law is broken and the probability of finding out the target significantly reduces. The hunter seems trapped in the cluster of the percolation and can hardly reach the goal. 展开更多
关键词 PERCOLATION searching scaling law
下载PDF
Preparation of GHZ States via Grover's Quantum Searching Algorithm
17
作者 ZENG Hao-Sheng KUANG Le-Man 《Chinese Physics Letters》 SCIE CAS CSCD 2000年第6期410-412,共3页
We propose an approach to prepare GHZ(Greenberger,Horne,Zeilinger)states of an arbitrary multi-particle system in terms of Grover's fast quantum searching algorithm.The approach can be used to produce other entang... We propose an approach to prepare GHZ(Greenberger,Horne,Zeilinger)states of an arbitrary multi-particle system in terms of Grover's fast quantum searching algorithm.The approach can be used to produce other entangled states with variou degrees of entanglement. 展开更多
关键词 STATES ARBITRARY searching
下载PDF
Complementary method to locate atomic coordinates by combined searching method of structure-sensitive indexes based on bond valence method
18
作者 宋振 刘小浪 +2 位作者 何丽珠 夏志国 刘泉林 《Chinese Physics B》 SCIE EI CAS CSCD 2015年第10期344-348,共5页
Bond valence method illustrates the relation between valence and length of a particular bond type. This theory has been used to predict structure information, but the effect is very limited. In this paper, two indexes... Bond valence method illustrates the relation between valence and length of a particular bond type. This theory has been used to predict structure information, but the effect is very limited. In this paper, two indexes, i.e., global instability index(GII) and bond strain index(BSI), are adopted as a judgment of a search-match program for prediction. The results show that with GII and BSI combined as judgment, the predicted atom positions are very close to real ones. The mechanism and validity of this searching program are also discussed. The GII & BSI distribution contour map reveals that the predicted function is a reflection of exponential feature of bond valence formula. This combined searching method may be integrated with other structure-determination method, and may be helpful in refining and testifying light atom positions. 展开更多
关键词 bond valence method atomic coordinate prediction combined searching
下载PDF
A NEW SYSTEM DYNAMIC EXTREMUM SELF-SEARCHING METHOD BASED ON CORRELATION ANALYSIS
19
作者 李嘉 刘文江 +1 位作者 胡军 袁廷奇 《Journal of Pharmaceutical Analysis》 SCIE CAS 2003年第2期143-146,共4页
Objective To propose a new dynamic extremum self searching method, which can be used in industrial processes extremum optimum control systems, to overcome the disadvantages of traditional method. Methods This algor... Objective To propose a new dynamic extremum self searching method, which can be used in industrial processes extremum optimum control systems, to overcome the disadvantages of traditional method. Methods This algorithm is based on correlation analysis. A pseudo random binary signal m sequence u(t) is added as probe signal in system input, construct cross correlation function between system input and output, the next step hunting direction is judged by the differential sign. Results Compared with traditional algorithm such as step forward hunting method, the iterative efficient, hunting precision and anti interference ability of the correlation analysis method is obvious over the traditional algorithm. The computer simulation experimental given illustrate these viewpoints. Conclusion The correlation analysis method can settle the optimum state point of device operating process. It has the advantage of easy condition , simple calculate process. 展开更多
关键词 dynamic extremum self searching correlation analysis pseudo random signal
下载PDF
Searching Images of Kengtung: An Old Walled City Town
20
作者 Khin Htay 《Journal of Environmental Science and Engineering(B)》 2019年第2期61-79,共19页
Geopolitically Kengtung region was located in a most strategic place in Myanmar. It shares borders with China on the north and Thailand on the east. Kengtung is a place which forms a significant historical site in the... Geopolitically Kengtung region was located in a most strategic place in Myanmar. It shares borders with China on the north and Thailand on the east. Kengtung is a place which forms a significant historical site in the easternmost part of Myanmar. From the geopolitical point of view, the region was located in a most strategic place. Its situation forced to safeguard the region. The town lies on a critical point of Myanmar’s defences. The restriction of exacting money as a yearly tribute did not concern for Kengtung. The tradition of paying homage was appeased to the King. The ruling Sawbwa which achieved the valuable return presents of the Burmese King. Kengtung came in the first class, and was the most important of the Myanmar’s possessions east of the Thanlwin River. Its position may be roughly judged by the tribute paid to the King and the contigent it was bound to supply to the royal army. Therefore, Kengtung was very important for the security of Myanmar’s eastern frontier during the Konbaung period. It was like a small Union within an Empire together with multinational races of Myanmar. A good deed of past events blanket over the town till today. 展开更多
关键词 GLORY and greatness of the past searching historical IMAGES walled CITY TOWN OUTPOST TOWN critical point.
下载PDF
上一页 1 2 95 下一页 到第
使用帮助 返回顶部