CALA: A Web Analysis Algorithm Combined with Content Correlation Analvsis Method

Web hyperlink structure analysis algorithm plays a significant role in improving the precision of Web information retrieval. Current link algorithms employ iteration function to compute the Web resource weight. The major drawback of this approach is that every Web document has a fixed rank which is independent of Web queries. This paper proposes an improved algorithm that ranks the quality and the relevance of a page according to users' query dynamically. The experiments show that the current link analysis algorithm is improved.     

A Routing Algorithm with Candidate Shortest Path

An improved algorithm based on the next node routing principle is proposed in this paper.In this algorithm there is a column added to the classical routing table, in which the candidateshortest distance to the destination node is the entry. When a link fails, the new shortest path inthe nodes connected directly with the failure link can be found immediately (it is just thecandidate shortest path before failure). For all other nodes in which routing tables should bechanged, the required number of control messages and time for convergence are also less thanTajibnapis' algorithm and Predecessor algorithm. The message looping problem does not existin duplex loop networks and is radically improved in mesh networks. These statements areproved by the analysis and simulation in this paper. From the simulation results of a 30-nodemesh network, when one link goes down, the total number of control messages generatedduring convergence with this algorithm on the average is about 30% of Tajibnapis' algorithm.The iterations required is 50% of Tajibnapis' algorithm. The memory space required andcomputation complexity in nodes are almost the same as the two algorithms mentioned aboveand the algorithm implementation is as easy as well.     

Studies on algorithms for self-stabilizing communication protocols

In this paper the algorithms for self-stabilizing communication protocols are studied.First some concepts and a formal method for describing the proposed algorithms are described,then an improved algorithm for achieving global states is presented.The study shows that the improved algorithm can be applied to obtain the global states in the case of a loss of cooperation of the different processes in th protocol,which can be used as a recovery point that will be used by the following recovery procdure.Thus,the improved algorithm can be used to self-stabilize a communication protocol.Meanwhile,a recovery algorithm for selastabilizing communication protocols is presented.After a failure is detected,all processes can eventually know the error.The recovery algorithm uses the contextual information exchanged during the progress of the protocol and recorded on the stable memory.The proof of correctness and analysis of complexity for these algorithms have been made.The availability and efficiency of the algorithms have been verified by illustrating the example protocols.Finally,some conclusions and remarks are given.     

Research on an improved wireless network intrusion detection algorithm

Data mining technology is applied to the network intrusion detection, and precision of the detection will be improved by the superiority of data mining. This paper, first analyzes the method of wireless network intrusion detection, presents a wireless network intrusion detection algorithm based on association rule mining. The application of fuzzy association rules in the wireless network intrusion detection is mainly discussed; a comparative analysis with the classical algorithm Apriori is made by experiment. The result shows that the fuzzy rule mining algorithm is more convenient than Apriori algorithm.     

Hardness and methods to solve CLIQUE

The paper briefly reviews NP-hard optimization problems and their inapproximability.The hardness of solving CLIQUE problem is specifically discussed.A dynamic-programming algorithm and its improved version for CLIQUE are reviewed and some additional analysis is presented.The analysis implies that the improved algorithm.HEWN(hierarchical edge-weighted network),only provides a heuristic or useful method,but cannot be called a polynomial algorithm.     

A New Subdivision Algorithm for the Bernstein Polynomial Approach to Global Optimization

In this paper,an improved algorithm is proposed for unconstrained global optimization to tackle non-convex nonlinear multivariate polynomial programming problems.The proposed algorithm is based on the Bernstein polynomial approach.Novel features of the proposed algorithm are that it uses a new rule for the selection of the subdivision point,modified rules for the selection of the subdivision direction,and a new acceleration device to avoid some unnecessary subdivisions.The performance of the proposed algorithm is numerically tested on a collection of 16 test problems.The results of the tests show the proposed algorithm to be superior to the existing Bernstein algorithm in terms of the chosen performance metrics.     

Position Control of a Flexible Manipulator Using a New Nonlinear Self-Tuning PID Controller

In this paper, a new nonlinear self-tuning PID controller(NSPIDC) is proposed to control the joint position and link deflection of a flexible-link manipulator(FLM) while it is subjected to carry different payloads. Since, payload is a critical parameter of the FLM whose variation greatly influences the controller performance. The proposed controller guarantees stability under change in payload by attenuating the non-modeled higher order dynamics using a new nonlinear autoregressive moving average with exogenous-input(NARMAX) model of the FLM. The parameters of the FLM are identified on-line using recursive least square(RLS) algorithm and using minimum variance control(MVC) laws the control parameters are updated in real-time. This proposed NSPID controller has been implemented in real-time on an experimental set-up. The joint tracking and link deflection performances of the proposed adaptive controller are compared with that of a popular direct adaptive controller(DAC). From the obtained results, it is confirmed that the proposed controller exhibits improved performance over the DAC both in terms of accurate position tracking and quick damping of link deflections when subjected to variable payloads.     

Improved two-way satellite time and frequency transfer with Multi-GEO in BeiDou navigation system

Due to the limitation of Geostationary Earth Orbit(GEO)satellite resources,only very few TWSTFT links with parallel counterpart operating via diferent GEO satellites between two ground stations are available.There are 5 GEO satellites in BeiDou Navigation System,which enables an improved TWSTFT with Multi-GEO.Two algorithms are put forward to take the advantage of Multi-GEO links to improve the performance of time and frequency transfer respectively.The dynamic weight average algorithm based on a newly proposed dynamic time variance aiming at improving the performance of time transfer is shown to be able to reduce the dynamic time deviation of the two-way measurement result to 1/√N dynamic time deviation of the single link using N-GEO links,if each link has similar level of link noises.The algorithm of cancelling out the link noise Allan variances with 2-GEO links is expected to obtain the Allan variance of clock diference between two ground stations.The experiment results using 2-GEO links in BeiDou Navigation System show that the dynamic weight average algorithm can improve the dynamic time deviation of the two-way measurement to around 0.6 of that of the single link in an average concept.And the estimated Allan deviation of the clock diference using the algorithm for cancelling the noise Allan variances of both links can reach 7×10 12(τ0.65)for the averaging time 1–105s which is within the same order of magnitude as the estimated Allan deviation based on carrier Doppler measurement for the averaging time 10 s–104s,despite the noisy links with the Allan deviation follows 3×10 10(τ1).     

Innovating Web Page Classification Through Reducing Noise

This paper presents a new method that eliminates noise in Web page classification.It first describes the presentation of a Web page based on HTML tags.Then through a novel distance formula,it eliminates the noise in similarity measure.After carefully analyzing Web pages,we design an algorithm that can distinguish related hyperlinks from noisy ones,Web can utilize non-noisy hyperlinks to improve th performance of Web page classification (The AWN algorithm).For any page.we can classify it through the text and category of neighbor pages relted to the page.The experimental results show that our approach improved classification accuracy.     

Three Improvements on an Incremental Algorithm for Automatic Semantic Analysis

The formalism of attribute grammars is a powerful tool for specifying the static semantics of programming languages,and attribute evaluation provides an effective approach to automatic semantic analysis.The author previously proposed a time-optimal algorithm for incremental evaluation of ordered attribute grammars.In this paper,three improvements are suggested upon the algorithm so that it not only allows multiple subtree replacements,but also cancels three auxiliary tables required before,For experimental purposes,the improved algorithm has been implemented in Pascal on Motorola 68010     

一种改进的PageRank 算法

研究了现有的基于链接结构的PageRank算法。结合网页链接分析和网页内容相关性分析提出了一种改进的PageRank算法,从分析网页内容相关性的角度解决相关性需求,从网页链接分析的角度解决权威性需求,并且实验证明,改进的PageRank算法优于传统的PageRank算法的排序结果。     

基于网页链接和内容分析的改进PageRank算法

结合网页链接分析和网页内容相关性分析提出一种改进的PageRank算法EPR(Extended PageRank),从分析网页内容相似性的角度解决相关性需求,从网页链接分析的角度解决权威性需求。算法为扩展PageRank提供了广阔的空间,并且实验证明,通过选择合适的参数EPR算法可以获得优于传统PageRank算法的排序结果。     

基于Web链接分析的HITS算法研究与改进

垂直搜索引擎的主题搜索策略有基于内容评价的搜索策略和基于Web链接分析的搜索策略,其中HITS算法是一种经典的基于Web链接分析的搜索策略,其主要的缺点是容易发生主题漂移。为了最大程度地避免主题漂移,提出了一种结合网页文本分析和扩散速率改进的F．HITS算法。实验结果表明,这些改进不仅节省了系统的开销,并且提高了页面搜索的准确率。     

Web结构挖掘中基于熵的链接分析法

在Web结构挖掘中,传统的HITS（hyperlinkinducedtopics search）算法被广泛应用来寻找搜索引擎返回页面中的Auto-rity页面和Hub页面.但是在网站中除了有价值的页面内容外,还有很多与页面内容无关的链接,如广告、链接导航等.由于这些链接的存在,应用HITS算法时就会导致某些广告网页或无关网页获得较高的Authority值和Hub值.为了解决这个问题,在原有HITS算法的基础上,引入了香农信息熵的概念,提出了基于熵的网页链接分析方法来挖掘网页结构.该算法的核心思想是用信息熵来表示链接文本所隐含的知识.     

Demand-Driven Memory Leak Detection Based on Flow- and Context-Sensitive Pointer Analysis

We present a demand-driven approach to memory leak detection algorithm based on flow- and context-sensitive pointer analysis. The detection algorithm firstly assumes the presence of a memory leak at some program point and then runs a backward analysis to see if this assumption can be disproved. Our algorithm computes the memory abstraction of programs based on points-to graph resulting from flow- and context-sensitive pointer analysis. We have implemented the algorithm in the SUIF2 compiler infrastructure and used the implementation to analyze a set of C benchmark programs. The experimental results show that the approach has better precision with satisfied scalability as expected. This work is supported by the National Natural Science Foundation of China under Grant Nos. 60725206, 60673118, and 90612009, the National High-Tech Research and Development 863 Program of China under Grant No. 2006AA01Z429, the National Basic Research 973 Program of China under Grant No. 2005CB321802, the Program for New Century Excellent Talents in University under Grant No. NCET-04-0996, and the Hunan Natural Science Foundation under Grant No. 07JJ1011.     

Web信息检索中主题精选算法的研究与改进

搜索引擎是目前最主要的Web信息检索工具,然而它的效果还不能令人满意。基于Web链接结构的主题精选算法的链接分析迭代往往会收敛于链接图中与查询主题不太相关的紧密交织区域(TKC),从而导致主题偏移。笔者对经典主题精选算法HITS的分析表明该算法还有给不同的Web站点规定了不平等的影响权重以及不能满足用户多粒度的信息需求等缺点。文章在分析主题精选算法研究的基础上针对其不足提出了改进算法g-HITSc,实验表明该算法是合理和有效的。     

Summarizing Vocabularies in the Global Semantic Web

In the Semantic Web, vocabularies are defined and shared among knowledge workers to describe linked data for scientific, industrial or daily life usage. With the rapid growth of online vocabularies, there is an emergent need for approaches helping users understand vocabularies quickly. In this paper, we study the summarization of vocabularies to help users understand vocabularies. Vocabulary summarization is based on the structural analysis and pragmatics statistics in the global Semantic Web. Local Bipa...     

搜索引擎PageRank算法的改进

为了解决企业快速决策时信息检索的问题,提出一种改进的PageRank算法。在考虑网页产生时间因素的同时,通过锚文本与网页主题的相似度分析按权重分配网页各正向链接PageRank值,产生的PageRank值更贴合主题搜索引擎的要求,并保持算法的简洁性。实验结果证明该改进算法能有效减少主题漂移现象,恰当提升新网页PageRank值。     

基于网页链接分类的PageRank并行算法

针对串行PageRank算法在处理海量网页数据时效率低下的问题,提出一种基于网页链接分类的PageRank并行算法.首先,将网页按照网页所属网站分类,为来自不同站点的网页设置不同的权重;其次,利用Hadoop并行计算框架,结合MapReduce分而治之的特点,并行计算网页排名;最后,采用一种包含3层:数据层、预处理层、计算层的数据压缩方法,对并行算法进行优化.实验结果表明,与串行PageRank算法相比,所提算法在最好情况下结果准确率提高了12%,计算效率提高了33%.