11098583
Neighborhood unions and cyclability of graphs
A graph G is said to be cyclable if for each orientation G of G, there exists a set S of vertices such that reversing all the arcs of G with one end in S results in a hamiltonian digraph. Let G be a 3-connected graph of order n ≥ 36. In this paper, we show that if for any three independent vertices x1, x2 and x3, |N(x1) ∪ N(x2)| + |N(x2) ∪ N(x3)| + |N(x3) ∪ N(x1)| ≥ 2n+1, then G is cyclable.
2465876
Two sufficient conditions for dominating cycles
A cycle C of a graph G is dominating if each component of GnC is edgeless. In the paper, we will give two sufficient conditions for each longest cycle of a 3-connected graph to be a dominating cycle. 2005 Wiley Periodicals, Inc. J Graph Theory 49: 135–150, 2005
776929
Trees of extremal connectivity index
The connectivity index w"@a(G) of a graph G is the sum of the weights (d(u)d(v))^@a of all edges uv of G, where @a is a real number (@a 0), and d(u) denotes the degree of the vertex u. Let T be a tree with n vertices and k pendant vertices. In this paper, we give sharp lower and upper bounds for w"1(T). Also, for -1=<@a<0, we give a sharp lower bound and a upper bound for w"@a(T).
653966
Fan-Type Theorem for Long Cycles Containing a Specified Edge
In this paper, we prove that if G is 3-connected noncomplete graph of order n satisfying min{max{d(u),d(v)}:d(u,v)=2}=μ, then for each edge e, G has a cycle containing e of length at least min{n,2μ}, unless G is a spanning subgraph of Kμ + Kcn−μ or K3+(lKμ−2∪Ks), where n=l(μ−2)+s+3,1≤s≤μ−2.
20501265
Efficient symplectic Runge-Kutta methods
The present paper continues the research in [H.Y. Liu, G. Sun, Symplectic RK methods and symplectic PRK methods with real eigenvalues, J. Comput. Math. 22(5) (2004) 769-776] on symplectic Runge-Kutta (RK) methods with real eigenvalues. In a general setting, a new but simple proof of the main result in [H.Y. Liu, G. Sun, Symplectic RK methods and symplectic PRK methods with real eigenvalues, J. Comput. Math. 22(5) (2004) 769-776] is given that an s-stage, pth order such method must have that p=
9357291
A Balanced Ensemble Approach to Weighting Classifiers for Text Classification
This paper studies the problem of constructing an effective heterogeneous ensemble classifier for text classification. One major challenge of this problem is to formulate a good combination function, which combines the decisions of the individual classifiers in the ensemble. We show that the classification performance is affected by three weight components and they should be included in deriving an effective combination function. They are: (1) Global effectiveness, which measures the effectiveness of a member classifier in classifying a set of unseen documents; (2) Local effectiveness, which measures the effectiveness of a member classifier in classifying the particular domain of an unseen document; and (3) Decision confidence, which describes how confident a classifier is when making a decision when classifying a specific unseen document. We propose a new balanced combination function, called dynamic classifier weighting (DCW), that incorporates the aforementioned three components. The empirical study demonstrates that the new combination function is highly effective for text classification.
1363024
Java Program Verification via a JVM Deep Embedding in ACL2
In this paper, we show that one can “deep-embed” the Java bytecode language, a fairly complicated language with a rich semantics, into the first order logic of ACL2 by modeling a realistic JVM. We show that with proper support from a semi-automatic theorem prover in that logic, one can reason about the correctness of Java programs. This reasoning can be done in a direct and intuitive way without incurring the extra burden that has often been associated with hand proofs, or proofs that make use of less automated proof assistance. We present proofs for two simple Java programs as a showcase.
30873111
Autonomy Oriented Load Balancing in Proxy Cache Servers
Proxy cache servers are used to deal with the increasing demand for information on the Internet by caching the frequently referenced web objects. It is common to have more than one proxy cache servers being installed in one local network. The problem of load balancing then arises as organizations want to utilise the resources in the best way. This article proposes two methods to tackle the load balancing problem. The two methods are based on the notion of autonomy oriented computation where entities in the model are allowed to make local decisions and they only need to interact with local neighbors.
8347795
Symbolic Representation of Neural Networks
Neural networks often surpass decision trees in predicting pattern classifications, but their predictions cannot be explained. This algorithm's symbolic representations make each prediction explicit and understandable. Our approach to understanding a neural network uses symbolic rules to represent the network decision process. The algorithm, NeuroRule, extracts these rules from a neural network. The network can be interpreted by the rules which, in general, preserve network accuracy and explain the prediction process. We based NeuroRule on a standard three layer feed forward network. NeuroRule consists of four phases. First, it builds a weight decay backpropagation network so that weights reflect the importance of the network's connections. Second, it prunes the network to remove irrelevant connections and units while maintaining the network's predictive accuracy. Third, it discretizes the hidden unit activation values by clustering. Finally, it extracts rules from the network with discretized hidden unit activation values.