A Model-Theoretic Property of Sharply Bounded Formulae,with some Applications

We define a property of substructures of models of arithmetic, that of being length-initial, and show that sharply bounded formulae are absolute between a model and its length-initial submodels. We use this to prove independence results for some weak fragments of bounded arithmetic by constructing appropriate models as length-initial submodels of some given model.     

2—连通Hamilton图的一个充分条件

证明了任意2-连通图G,对于其每一个顶点来说,与它距离为2的顶点集在G中的独立数为1,则G是Hamilton图。     

Identifying bioactive components in natural products through chromatographic fingerprint

Bioactive component identification is a crucial issue in search for new drug leads. We provide a new strategy to search for bioactive components based on Sure Independence Screening (SIS) and interval PLS (iPLS). The method, which is termed as SIS–iPLS, is not only able to find out the chief bioactive components, but also able to judge how many components should be there responsible for the total bioactivity. The method is totally “data-driven” with no need for prior knowledge about the unknown mixture analyzed, therefore especially suitable for effect-directed work like bioassay-guided fractionation. Two data sets, a synthetic mixture system of twelve components and a suite of Radix Puerariae Lobatae extracts samples, are used to test the identification ability of the SIS–iPLS method.     

论信托财产的人格性

信托财产是信托关系的基本要素,由于信托的特殊性,信托财产与传统民法的财产有很大区别,正确给信托财产定位,是信托业得以健康发展的核心问题。信托财产的特性在于其人格性,而这种人格性的赋予是以交易成本最小化为动因,尽管信托财产人格性设计对受益人的利益有偏袒,但从社会成本而言,其目的在于促使交易成本最小化,当然,对信托财产的人格性不能绝对化,由于利益平衡的需求,往往在特定情况下对信托财产予以人格否认。     

Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number

A set of vertices S in a graph G is independent if no neighbor of a vertex of S belongs to S. The independence number α is the maximum cardinality of an independent set of G. A series of best possible lower and upper bounds on α and some other common invariants of G are obtained by the system AGX 2, and proved either automatically or by hand. In the present paper, we report on such lower and upper bounds considering, as second invariant, minimum, average and maximum degree, diameter, radius, average distance, spread of eccentricities, chromatic number and matching number.     

A relative bound for independence

We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.     

Independence for full conditional probabilities: Structure,factorization, non-uniqueness,and Bayesian networks

This paper examines concepts of independence for full conditional probabilities; that is, for set-functions that encode conditional probabilities as primary objects, and that allow conditioning on events of probability zero. Full conditional probabilities have been used in economics, in philosophy, in statistics, in artificial intelligence. This paper characterizes the structure of full conditional probabilities under various concepts of independence; limitations of existing concepts are examined with respect to the theory of Bayesian networks. The concept of layer independence (factorization across layers) is introduced; this seems to be the first concept of independence for full conditional probabilities that satisfies the graphoid properties of Symmetry, Redundancy, Decomposition, Weak Union, and Contraction. A theory of Bayesian networks is proposed where full conditional probabilities are encoded using infinitesimals, with a brief discussion of hyperreal full conditional probabilities.     

An Ore-type condition for arbitrarily vertex decomposable graphs

Let G be a graph of order n and r, 1≤r≤n, a fixed integer. G is said to be r-vertex decomposable if for each sequence (n₁,…,n_r) of positive integers such that n₁+?+n_r=n there exists a partition (V₁,…,V_r) of the vertex set of G such that for each i∈{1,…,r}, V_i induces a connected subgraph of G on n_i vertices. G is called arbitrarily vertex decomposable if it is r-vertex decomposable for each r∈{1,…,n}.In this paper we show that if G is a connected graph on n vertices with the independence number at most ⌈n/2⌉ and such that the degree sum of any pair of non-adjacent vertices is at least n−3, then G is arbitrarily vertex decomposable or isomorphic to one of two exceptional graphs. We also exhibit the integers r for which the graphs verifying the above degree-sum condition are not r-vertex decomposable.     

A linear programming formulation for the maximum complete multipartite subgraph problem

Let G be a simple undirected graph with node set V(G) and edge set E(G). We call a subset independent if F is contained in the edge set of a complete multipartite (not necessarily induced) subgraph of G, F is dependent otherwise. In this paper we characterize the independents and the minimal dependents of G. We note that every minimal dependent of G has size two if and only if G is fan and prism-free. We give a 0-1 linear programming formulation of the following problem: find the maximum weight of a complete multipartite subgraph of G, where G has nonnegative edge weights. This formulation may have an exponential number of constraints with respect to |V(G)| but we show that the continuous relaxation of this 0-1 program can be solved in polynomial time.