33661341
Cycles of each length in tournaments
Let G = (V,A) be a digraph of order n. Digraph G is said to be arc-k-cyclic if each arc of G is contained in a cycle of length k (3 ≤ k ≤ n). An arc e of G is said to be pancyclic if e is contained in cycles of all lengths m, 3 ≤ m ≤ n. Digraph G is said to be arc-pancyclic if each arc of G is pancyclic. The main results of this paper are that (1) except for a certain family of counterexamples, every arc-3-cyclic tournament is arc-pancyclic; (2) at most one arc of an arc-3-cyclic tournament is not pancyclic.
44526903
Hamiltonicity, neighborhood intersections and the partially square graphs
Abstract Let G be a graph. The partially square graph G ∗ of G is a graph obtained from G by adding edges uv satisfying the conditions uv∉E(G), and there is some w∈N(u)∩N(v), such that N(w)⊆N(u)∪N(v)∪{u,v}. A non-negative rational sequence (a 1 ,a 2 ,…,a k+1 ) is called an LTW-sequence if the following conditions are satisfied: (1) a 1 ⩽1; (2) for arbitrary i 1 ,i 2 ,…,i h ∈{2,3,…,k+1},∑ j=1 h i j ⩽k+1 implies ∑ j=1 h (a i j −1)⩽1 . In this paper, we will use the technique of the vertex insertion on l -connected ( l=k,k−1 or k+1,k⩾2 ) graphs to provide a unified proof for G to be hamiltonian, traceable, 1 -hamiltonian or hamiltonian-connected, the sufficient conditions are expressed by weighted sums of the neighborhood intersections in G of independent sets in G ∗ , where the weights are LTW-sequences.
1394886
An approach for optimizing binding lifetime with mobile IPv6
In this paper an analytical model is presented in order to provide useful insight into the performance behaviour of mobile IPv6 in the context of a binding lifetime setting. By using this model, the optimal binding lifetime can be estimated in terms of a user mobility, traffic workload, and network structure. An algorithm for dynamically setting the binding lifetime in mobile IPv6 networks is proposed based on the analytical model. The numerical results of the system simulation are also demonstrated.
26994753
Efficient Scheduling for Reducing Load in the IMS Presence Service
18318137
Automatically Detecting Boolean Operations Supported by Search Engines, Towards Search Engine Query Language Discovery
Each Web search engine provides query language through which it can communicate with its users and retrieve corresponding results to user queries. Supporting Boolean operations is a major characteristic of the query language. In this paper, we propose a novel, fully automatic, query probing based approach to identify what Boolean operations that are supported by a search engines and their corresponding syntaxes. Experiments show high effectiveness and efficiency. Along with this, we also provide a Web application called SE-BOSS (Search Engine Boolean Operation Scanning System) for interested users.
9838468
A Semi-supervised SVM for Manifold Learning
Many classification tasks benefit from integrating manifold learning with semi-supervised learning. By formulating the learning task in a semi-supervised manner, we propose a novel objective function that combines the manifold consistency of whole dataset with the hinge loss of class label prediction. This formulation results in a SVM-alike task operating on the kernel derived from the graph Laplacian, and is capable of capturing the intrinsic manifold structure of the whole dataset and maximizing the margin separating labelled examples. Results on face and handwritten digit recognition tasks show significant performance gain. The performance gain is particularly impressive when only a small training set is available, which is often the true scenario of many real-world problems
957553
A highly scalable and effective method for metasearch
A metasearch engine is a system that supports unified access to multiple local search engines. Database selection is one of the main challenges in building a large-scale metasearch engine. The problem is to efficiently and accurately determine a small number of potentially useful local search engines to invoke for each user query. In order to enable accurate selection, metadata that reflect the contents of each search engine need to be collected and used. This article proposes a highly scalable and accurate database selection method. This method has several novel features. First, the metadata for representing the contents of all search engines are organized into a single integrated representative. Such a representative yields both computational efficiency and storage efficiency. Second, the new selection method is based on a theory for ranking search engines optimally. Experimental results indicate that this new method is very effective. An operational prototype system has been built based on the proposed approach.