Discriminative learning of Bayesian networks via factorized conditional log-likelihood

We propose an efficient and parameter-free scoring criterion, the factorized conditional log-likelihood (ˆfCLL), for learning Bayesian network classifiers. The proposed score is an approximation of the conditional log-likelihood criterion. The approximation is devised in order to guarantee decomposability over the network structure, as well as efficient estimation of the optimal parameters, achieving the same time and space complexity as the traditional log-likelihood scoring criterion. The resulting criterion has an information-theoretic interpretation based on interaction information, which exhibits its discriminative nature. To evaluate the performance of the proposed criterion, we present an empirical comparison with state-of-the-art classifiers. Results on a large suite of benchmark data sets from the UCI repository show that ˆfCLL-trained classifiers achieve at least as good accuracy as the best compared classifiers, using significantly less computational resources.

Circuit layout through an analogy with neural networks

Standard-cell design methodology is an important technique in semicustom-VLSI design. It lends itself to the easy automation of the crucial layout part, and many algorithms have been proposed in recent literature for the efficient placement of standard cells. While many studies have identified the Kerninghan-Lin bipartitioning method as being superior to most others, it must be admitted that the behaviour of the method is erratic, and that it is strongly dependent on the initial partition. This paper proposes a novel algorithm for overcoming some of the deficiencies of the Kernighan-Lin method. The approach is based on an analogy of the placement problem with neural networks, and, by the use of some of the organizing principles of these nets, an attempt is made to improve the behavior of the bipartitioning scheme. The results have been encouraging, and the approach seems to be promising for other NP-complete problems in circuit layout.

Quality-of-Transmission-Aware Manycasting Over Optical Burst-Switched Networks

Many next-generation distributed applications, such as grid computing, require a single source to communicate with a group of destinations. Traditionally, such applications are implemented using multicast communication. A typical multicast session requires creating the shortest-path tree to a fixed number of destinations. The fundamental issue in multicasting data to a fixed set of destinations is receiver blocking. If one of the destinations is not reachable, the entire multicast request (say, grid task request) may fail. Manycasting is a generalized variation of multicasting that provides the freedom to choose the best subset of destinations from a larger set of candidate destinations. We propose an impairment-aware algorithm to provide manycasting service in the optical layer, specifically OBS. We compare the performance of our proposed manycasting algorithm with traditional multicasting and multicast with over provisioning. Our results show a significant improvement in the blocking probability by implementing optical-layer manycasting.

Direct versus kinetic exchange in multiband models for organic ferromagnetism

Multiband Hubbard and Pariser-Parr-Pople calculations have been carried out on mixed donor-acceptor (DA) stacks with doubly degenerate acceptor orbitals and nondegenerate donor orbitals at two-thirds filling. Model exact results for 2, 3, and 4 DA units show that McConnell's prediction of high-spin ground states in these systems is, in general, incorrect. The larger phase space available for the low-spin states leads to their kinetic stabilization in preference to high-spin states. However, for large electron-correlation strengths, the direct exchange dominates over the kinetic exchange resulting in a high-spin ground state

Identification of collagenolytic MMP networks as potential biomarkers in progressive chronic periodontitis subjects and MMP-8 null allele model

Chronic periodontitis results from a complex aetiology, including the formation of a subgingival biofilm and the elicitation of the host s immune and inflammatory response. The hallmark of chronic periodontitis is alveolar bone loss and soft periodontal tissue destruction. Evidence supports that periodontitis progresses in dynamic states of exacerbation and remission or quiescence. The major clinical approach to identify disease progression is the tolerance method, based on sequential probing. Collagen degradation is one of the key events in periodontal destructive lesions. Matrix metalloproteinase (MMP)-8 and MMP-13 are the primary collagenolytic MMPs that are associated with the severity of periodontal inflammation and disease, either by a direct breakdown of the collagenised matrix or by the processing of non-matrix bioactive substrates. Despite the numerous host mediators that have been proposed as potential biomarkers for chronic periodontitis, they reflect inflammation rather than the loss of periodontal attachment. The aim of the present study was to determine the key molecular MMP-8 and -13 interactions in gingival crevicular fluid (GCF) and gingival tissue from progressive periodontitis lesions and MMP-8 null allele mouse model. In study (I), GCF and gingival biopsies from active and inactive sites of chronic periodontitis patients, which were determined clinically by the tolerance method, and healthy GCF were analysed for MMP-13 and tissue inhibitor of matrix metalloproteinases (TIMP)-1. Chronic periodontitis was characterised by increased MMP-13 levels and the active sites showed a tendency of decreased TIMP-1 levels associated with increments of MMP-13 and total protein concentration compared to inactive sites. In study (II), we investigated whether MMP-13 activity was associated with TIMP-1, bone collagen breakdown through ICTP levels, as well as the activation rate of MMP-9 in destructive lesions. The active sites demonstrated increased GCF ICTP levels as well as lowered TIMP-1 detection along with elevated MMP-13 activity. MMP-9 activation rate was enhanced by MMP-13 in diseased gingival tissue. In study (III), we analysed the potential association between the levels, molecular forms, isoenzyme distribution and degree of activation of MMP-8, MMP-14, MPO and the inhibitor TIMP-1 in GCF from periodontitis progressive patients at baseline and after periodontal therapy. A positive correlation was found for MPO/MMP-8 and their levels associated with progression episodes and treatment response. Because MMP-8 is activated by hypochlorous acid in vitro, our results suggested an interaction between the MPO oxidative pathway and MMP-8 activation in GCF. Finally, in study (IV), on the basis of the previous finding that MMP-8-deficient mice showed impaired neutrophil responses and severe alveolar bone loss, we aimed to characterise the detection patterns of LIX/CXCL5, SDF-1/CXCL12 and RANKL in P. gingivalis-induced experimental periodontitis and in the MMP-8-/- murine model. The detection of neutrophil-chemoattractant LIX/CXCL5 was restricted to the oral-periodontal interface and its levels were reduced in infected MMP-8 null mice vs. wild type mice, whereas the detection of SDF-1/CXCL12 and RANKL in periodontal tissues increased in experimentally-induced periodontitis, irrespectively from the genotype. Accordingly, MMP-8 might regulate LIX/CXCL5 levels by undetermined mechanisms, and SDF-1/CXCL12 and RANKL might promote the development and/or progression of periodontitis.

Algorithms for Exact Structure Discovery in Bayesian Networks

Bayesian networks are compact, flexible, and interpretable representations of a joint distribution. When the network structure is unknown but there are observational data at hand, one can try to learn the network structure. This is called structure discovery. This thesis contributes to two areas of structure discovery in Bayesian networks: space--time tradeoffs and learning ancestor relations. The fastest exact algorithms for structure discovery in Bayesian networks are based on dynamic programming and use excessive amounts of space. Motivated by the space usage, several schemes for trading space against time are presented. These schemes are presented in a general setting for a class of computational problems called permutation problems; structure discovery in Bayesian networks is seen as a challenging variant of the permutation problems. The main contribution in the area of the space--time tradeoffs is the partial order approach, in which the standard dynamic programming algorithm is extended to run over partial orders. In particular, a certain family of partial orders called parallel bucket orders is considered. A partial order scheme that provably yields an optimal space--time tradeoff within parallel bucket orders is presented. Also practical issues concerning parallel bucket orders are discussed. Learning ancestor relations, that is, directed paths between nodes, is motivated by the need for robust summaries of the network structures when there are unobserved nodes at work. Ancestor relations are nonmodular features and hence learning them is more difficult than modular features. A dynamic programming algorithm is presented for computing posterior probabilities of ancestor relations exactly. Empirical tests suggest that ancestor relations can be learned from observational data almost as accurately as arcs even in the presence of unobserved nodes.

Mechanical and swelling properties of HTPB-based copolyurethane networks

Copolyurethanes of hydroxy terminated polybutadiene (HTPB) and ISRO–Polyol (ISPO), an indigenously developed castor-oil based polyol, have been prepared using toluene diiso-cyanate and hexamethylenediisocyanate. The mechanical strength and swelling characteristics of the copolyurethanes cured with trimethylol propane and triethanolamine have been studied to evolve improved solid propellant binders. By varying the ratios of the two hydroxy pre-polymers, chain extenders, and crosslinkers, copolyurethanes having a wide range of tensile strength and elongation could be obtained. Many of these systems are desirable for their use as propellant binders. The results have been explained in terms of the measured crosslink densities and other swelling properties. © 1993 John Wiley & Sons, Inc.

Stabilization of α-nickel hydoxide in the presence of organic additives: chemical route to bulk synthesis

Organic molecules such as glucose or lactose mediate the synthesis and stabilize alpha-nickel hydroxide in a simple precipitation reaction, while, in the absence of these additives, beta-nickel hydroxide is formed. The additives are not incorporated in the product phase.

A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks

Our study concerns an important current problem, that of diffusion of information in social networks. This problem has received significant attention from the Internet research community in the recent times, driven by many potential applications such as viral marketing and sales promotions. In this paper, we focus on the target set selection problem, which involves discovering a small subset of influential players in a given social network, to perform a certain task of information diffusion. The target set selection problem manifests in two forms: 1) top-k nodes problem and 2) lambda-coverage problem. In the top-k nodes problem, we are required to find a set of k key nodes that would maximize the number of nodes being influenced in the network. The lambda-coverage problem is concerned with finding a set of k key nodes having minimal size that can influence a given percentage lambda of the nodes in the entire network. We propose a new way of solving these problems using the concept of Shapley value which is a well known solution concept in cooperative game theory. Our approach leads to algorithms which we call the ShaPley value-based Influential Nodes (SPINs) algorithms for solving the top-k nodes problem and the lambda-coverage problem. We compare the performance of the proposed SPIN algorithms with well known algorithms in the literature. Through extensive experimentation on four synthetically generated random graphs and six real-world data sets (Celegans, Jazz, NIPS coauthorship data set, Netscience data set, High-Energy Physics data set, and Political Books data set), we show that the proposed SPIN approach is more powerful and computationally efficient. Note to Practitioners-In recent times, social networks have received a high level of attention due to their proven ability in improving the performance of web search, recommendations in collaborative filtering systems, spreading a technology in the market using viral marketing techniques, etc. It is well known that the interpersonal relationships (or ties or links) between individuals cause change or improvement in the social system because the decisions made by individuals are influenced heavily by the behavior of their neighbors. An interesting and key problem in social networks is to discover the most influential nodes in the social network which can influence other nodes in the social network in a strong and deep way. This problem is called the target set selection problem and has two variants: 1) the top-k nodes problem, where we are required to identify a set of k influential nodes that maximize the number of nodes being influenced in the network and 2) the lambda-coverage problem which involves finding a set of influential nodes having minimum size that can influence a given percentage lambda of the nodes in the entire network. There are many existing algorithms in the literature for solving these problems. In this paper, we propose a new algorithm which is based on a novel interpretation of information diffusion in a social network as a cooperative game. Using this analogy, we develop an algorithm based on the Shapley value of the underlying cooperative game. The proposed algorithm outperforms the existing algorithms in terms of generality or computational complexity or both. Our results are validated through extensive experimentation on both synthetically generated and real-world data sets.

Surface tension of some binary organic solutions of alkylbenzenes and 1-alkanols

The surface tensions of binary mixtures of 1-alkanols (Cl-Cd with benzene, toluene, or xylene were measured. The results were correlated with the activity coefficients calculated through the group contribution method such as UNIFAC, with the maximum deviation from the experimental results less that 5%. The coefficients of the correlation are correlated with the chain length.

Algorithms for Routing and Centralized Scheduling in IEEE 802.16 Mesh Networks

IEEE 802.16 standards for Wireless Metropolitan Area Networks (WMANs) include a mesh mode of operation for improving the coverage and throughput of the network. In this paper, we consider the problem of routing and centralized scheduling for such networks. We first fix the routing, which reduces the network to a tree. We then present a finite horizon dynamic programming framework. Using it we obtain various scheduling algorithms depending upon the cost function. Next we consider simpler suboptimal algorithms and compare their performances.

Mobile Base Stations Placement and Energy Aware Routing in Wireless Sensor Networks

Increasing network lifetime is important in wireless sensor/ad-hoc networks. In this paper, we are concerned with algorithms to increase network lifetime and amount of data delivered during the lifetime by deploying multiple mobile base stations in the sensor network field. Specifically, we allow multiple mobile base stations to be deployed along the periphery of the sensor network field and develop algorithms to dynamically choose the locations of these base stations so as to improve network lifetime. We propose energy efficient low-complexity algorithms to determine the locations of the base stations; they include i) Top-K-max algorithm, ii) maximizing the minimum residual energy (Max-Min-RE) algorithm, and iii) minimizing the residual energy difference (MinDiff-RE) algorithm. We show that the proposed base stations placement algorithms provide increased network lifetimes and amount of data delivered during the network lifetime compared to single base station scenario as well as multiple static base stations scenario, and close to those obtained by solving an integer linear program (ILP) to determine the locations of the mobile base stations. We also investigate the lifetime gain when an energy aware routing protocol is employed along with multiple base stations.

Efficient and Fair Scheduling of Uplink and Downlink in IEEE 802.16 OFDMA Networks

We develop new scheduling algorithms for the IEEE 802.16d OFDMA/TDD based broadband wireless access system, in which radio resources of both time and frequency slots are dynamically shared by all users. Our objective is to provide a fair and efficient allocation to all the users to satisfy their quality of service.

A non-cooperative game-theoretic approach to channel assignment in multi-channel multi-radio wireless networks

Channel assignment in multi-channel multi-radio wireless networks poses a significant challenge due to scarcity of number of channels available in the wireless spectrum. Further, additional care has to be taken to consider the interference characteristics of the nodes in the network especially when nodes are in different collision domains. This work views the problem of channel assignment in multi-channel multi-radio networks with multiple collision domains as a non-cooperative game where the objective of the players is to maximize their individual utility by minimizing its interference. Necessary and sufficient conditions are derived for the channel assignment to be a Nash Equilibrium (NE) and efficiency of the NE is analyzed by deriving the lower bound of the price of anarchy of this game. A new fairness measure in multiple collision domain context is proposed and necessary and sufficient conditions for NE outcomes to be fair are derived. The equilibrium conditions are then applied to solve the channel assignment problem by proposing three algorithms, based on perfect/imperfect information, which rely on explicit communication between the players for arriving at an NE. A no-regret learning algorithm known as Freund and Schapire Informed algorithm, which has an additional advantage of low overhead in terms of information exchange, is proposed and its convergence to the stabilizing outcomes is studied. New performance metrics are proposed and extensive simulations are done using Matlab to obtain a thorough understanding of the performance of these algorithms on various topologies with respect to these metrics. It was observed that the algorithms proposed were able to achieve good convergence to NE resulting in efficient channel assignment strategies.