A linear programming approach for estimating the structure of a sparse linear genetic network from transcript profiling data

Background: A genetic network can be represented as a directed graph in which a node corresponds to a gene and a directed edge specifies the direction of influence of one gene on another. The reconstruction of such networks from transcript profiling data remains an important yet challenging endeavor. A transcript profile specifies the abundances of many genes in a biological sample of interest. Prevailing strategies for learning the structure of a genetic network from high-dimensional transcript profiling data assume sparsity and linearity. Many methods consider relatively small directed graphs, inferring graphs with up to a few hundred nodes. This work examines large undirected graphs representations of genetic networks, graphs with many thousands of nodes where an undirected edge between two nodes does not indicate the direction of influence, and the problem of estimating the structure of such a sparse linear genetic network (SLGN) from transcript profiling data. Results: The structure learning task is cast as a sparse linear regression problem which is then posed as a LASSO (l1-constrained fitting) problem and solved finally by formulating a Linear Program (LP). A bound on the Generalization Error of this approach is given in terms of the Leave-One-Out Error. The accuracy and utility of LP-SLGNs is assessed quantitatively and qualitatively using simulated and real data. The Dialogue for Reverse Engineering Assessments and Methods (DREAM) initiative provides gold standard data sets and evaluation metrics that enable and facilitate the comparison of algorithms for deducing the structure of networks. The structures of LP-SLGNs estimated from the INSILICO1, INSILICO2 and INSILICO3 simulated DREAM2 data sets are comparable to those proposed by the first and/or second ranked teams in the DREAM2 competition. The structures of LP-SLGNs estimated from two published Saccharomyces cerevisae cell cycle transcript profiling data sets capture known regulatory associations. In each S. cerevisiae LP-SLGN, the number of nodes with a particular degree follows an approximate power law suggesting that its degree distributions is similar to that observed in real-world networks. Inspection of these LP-SLGNs suggests biological hypotheses amenable to experimental verification. Conclusion: A statistically robust and computationally efficient LP-based method for estimating the topology of a large sparse undirected graph from high-dimensional data yields representations of genetic networks that are biologically plausible and useful abstractions of the structures of real genetic networks. Analysis of the statistical and topological properties of learned LP-SLGNs may have practical value; for example, genes with high random walk betweenness, a measure of the centrality of a node in a graph, are good candidates for intervention studies and hence integrated computational – experimental investigations designed to infer more realistic and sophisticated probabilistic directed graphical model representations of genetic networks. The LP-based solutions of the sparse linear regression problem described here may provide a method for learning the structure of transcription factor networks from transcript profiling and transcription factor binding motif data.

The process of technological innovations in small enterprises: the Indian way

This paper probes how two small foundries in Belgaum, Karnataka State, India, have achieved technological innovations successfully based on their technological capability and customer needs, enabling them to sail through the competitive environment. This study brought out that technically qualified entrepreneurs of both the foundries have carried out technological innovations, mainly due to their self-motivation and self-efforts. Changing product designs, as desired or directed by the customers, cost reduction, quality improvement and import substitution through reverse engineering are the characteristics of these technological innovations. These incremental innovations have enabled the entrepreneurs of the two foundries to enhance competitiveness, grow in the domestic market and penetrate the international market and grow in size over time.

The process of technological innovations in small enterprises: the Indian way

This paper probes how two small foundries in Belgaum, Karnataka State, India, have achieved technological innovations successfully based on their technological capability and customer needs, enabling them to sail through the competitive environment. This study brought out that technically qualified entrepreneurs of both the foundries have carried out technological innovations, mainly due to their self-motivation and self-efforts. Changing product designs, as desired or directed by the customers, cost reduction, quality improvement and import substitution through reverse engineering are the characteristics of these technological innovations. These incremental innovations have enabled the entrepreneurs of the two foundries to enhance competitiveness, grow in the domestic market and penetrate the international market and grow in size over time.

Forming Networks of Strategic Agents with Desired Topologies

Many networks such as social networks and organizational networks in global companies consist of self-interested agents. The topology of these networks often plays a crucial role in important tasks such as information diffusion and information extraction. Consequently, growing a stable network having a certain topology is of interest. Motivated by this, we study the following important problem: given a certain desired network topology, under what conditions would best response (link addition/deletion) strategies played by self-interested agents lead to formation of a stable network having that topology. We study this interesting reverse engineering problem by proposing a natural model of recursive network formation and a utility model that captures many key features. Based on this model, we analyze relevant network topologies and derive a set of sufficient conditions under which these topologies emerge as pairwise stable networks, wherein no node wants to delete any of its links and no two nodes would want to create a link between them.

Sufficient conditions for formation of a network topology by self-interested agents

Networks such as organizational network of a global company play an important role in a variety of knowledge management and information diffusion tasks. The nodes in these networks correspond to individuals who are self-interested. The topology of these networks often plays a crucial role in deciding the ease and speed with which certain tasks can be accomplished using these networks. Consequently, growing a stable network having a certain topology is of interest. Motivated by this, we study the following important problem: given a certain desired network topology, under what conditions would best response (link addition/deletion) strategies played by self-interested agents lead to formation of a pairwise stable network with only that topology. We study this interesting reverse engineering problem by proposing a natural model of recursive network formation. In this model, nodes enter the network sequentially and the utility of a node captures principal determinants of network formation, namely (1) benefits from immediate neighbors, (2) costs of maintaining links with immediate neighbors, (3) benefits from indirect neighbors, (4) bridging benefits, and (5) network entry fee. Based on this model, we analyze relevant network topologies such as star graph, complete graph, bipartite Turan graph, and multiple stars with interconnected centers, and derive a set of sufficient conditions under which these topologies emerge as pairwise stable networks. We also study the social welfare properties of the above topologies.

Using Relationships for Matching Textual Domain Models with Existing Code

We address the task of mapping a given textual domain model (e.g., an industry-standard reference model) for a given domain (e.g., ERP), with the source code of an independently developed application in the same domain. This has applications in improving the understandability of an existing application, migrating it to a more flexible architecture, or integrating it with other related applications. We use the vector-space model to abstractly represent domain model elements as well as source-code artifacts. The key novelty in our approach is to leverage the relationships between source-code artifacts in a principled way to improve the mapping process. We describe experiments wherein we apply our approach to the task of matching two real, open-source applications to corresponding industry-standard domain models. We demonstrate the overall usefulness of our approach, as well as the role of our propagation techniques in improving the precision and recall of the mapping task.

A Jacobian-Based Algorithm for Planning Attitude Maneuvers Using Forward and Reverse Rotations

Algorithms for planning quasistatic attitude maneuvers based on the Jacobian of the forward kinematic mapping of fully-reversed (FR) sequences of rotations are proposed in this paper. An FR sequence of rotations is a series of finite rotations that consists of initial rotations about the axes of a body-fixed coordinate frame and subsequent rotations that undo these initial rotations. Unlike the Jacobian of conventional systems such as a robot manipulator, the Jacobian of the system manipulated through FR rotations is a null matrix at the identity, which leads to a total breakdown of the traditional Jacobian formulation. Therefore, the Jacobian algorithm is reformulated and implemented so as to synthesize an FR sequence for a desired rotational displacement. The Jacobian-based algorithm presented in this paper identifies particular six-rotation FR sequences that synthesize desired orientations. We developed the single-step and the multiple-step Jacobian methods to accomplish a given task using six-rotation FR sequences. The single-step Jacobian method identifies a specific FR sequence for a given desired orientation and the multiple-step Jacobian algorithm synthesizes physically feasible FR rotations on an optimal path. A comparison with existing algorithms verifies the fast convergence ability of the Jacobian-based algorithm. Unlike closed-form solutions to the inverse kinematics problem, the Jacobian-based algorithm determines the most efficient FR sequence that yields a desired rotational displacement through a simple and inexpensive numerical calculation. The procedure presented here is useful for those motion planning problems wherein the Jacobian is singular or null.

Reverse Channel Training For Reciprocal Mimo Systems With Spatial Multiplexing

This paper investigates the problem of designing reverse channel training sequences for a TDD-MIMO spatial-multiplexing system. Assuming perfect channel state information at the receiver and spatial multiplexing at the transmitter with equal power allocation to them dominant modes of the estimated channel, the pilot is designed to ensure an stimate of the channel which improves the forward link capacity. Using perturbation techniques, a lower bound on the forward link capacity is derived with respect to which the training sequence is optimized. Thus, the reverse channel training sequence makes use of the channel knowledge at the receiver. The performance of orthogonal training sequence with MMSE estimation at the transmitter and the proposed training sequence are compared. Simulation results show a significant improvement in performance.

Large-scale structures in turbulent and reverse-transitional sink flow boundary layers

Aspects of large-scale organized structures in sink flow turbulent and reverse-transitional boundary layers are studied experimentally using hot-wire anemometry. Each of the present sink flow boundary layers is in a state of 'perfect equilibrium' or 'exact self-preservation' in the sense of Townsend (The Structure of Turbulent Shear Flow, 1st and 2nd edns, 1956, 1976, Cambridge University Press) and Rotta (Progr. Aeronaut. Sci., vol. 2, 1962, pp. 1-220) and conforms to the notion of 'pure wall-flow' (Coles, J. Aerosp. Sci., vol. 24, 1957, pp. 495-506), at least for the turbulent cases. It is found that the characteristic inclination angle of the structure undergoes a systematic decrease with the increase in strength of the streamwise favourable pressure gradient. Detectable wall-normal extent of the structure is found to be typically half of the boundary layer thickness. Streamwise extent of the structure shows marked increase as the favourable pressure gradient is made progressively severe. Proposals for the typical eddy forms in sink flow turbulent and reverse-transitional flows are presented, and the possibility of structural self-organization (i.e. individual hairpin vortices forming streamwise coherent hairpin packets) in these flows is also discussed. It is further indicated that these structural ideas may be used to explain, from a structural viewpoint, the phenomenon of soft relaminarization or reverse transition of turbulent boundary layers when subjected to strong streamwise favourable pressure gradients. Taylor's 'frozen turbulence' hypothesis is experimentally shown to be valid for flows in the present study even though large streamwise accelerations are involved, the flow being even reverse transitional in some cases. Possible conditions, which are required to be satisfied for the safe use of Taylor's hypothesis in pressure-gradient-driven flows, are also outlined. Measured convection velocities are found to be fairly close to the local mean velocities (typically 90% or more) suggesting that the structure gets convected downstream almost along with the mean flow.

Simulation of precipitation reactions in reverse micelles

Precipitation involving mixing of two sets of reverse micellar solutions-containing a reactant and precipitant respectively-has been analyzed. Particle formation in such systems has been simulated by a Monte Carlo (MC) scheme (Li, Y.; Park, C. W. Langmuir 1999, 15, 952), which however is very restrictive in its approach. We have simulated particle formation by developing a general Monte Carlo scheme, using the interval of quiescence technique (IQ). It uses Poisson distribution with realistic, low micellar occupancies of reactants, Brownian collision of micelles with coalescence efficiency, fission of dimers with binomial redispersion of solutes, finite nucleation rate of particles with critical number of molecules, and instantaneous particle growth. With the incorporation of these features, the previous work becomes a special case of our simulation. The present scheme was then used to predict experimental data on two systems. The first is the experimental results of Lianos and Thomas (Chem. Phys. Lett. 1986, 125, 299, J. Colloid Interface Sci. 1987, 117, 505) on formation of CdS nanoparticles. They reported the number of molecules in a particle as a function of micellar size and reactant concentrations, which have been predicted very well. The second is on the formation of Fe(OH)(3) nanoparticles, reported by Li and Park. Our simulation in this case provides a better prediction of the experimental particle size range than the prediction of the authors. The present simulation scheme is general and can be applied to explain nanoparticle formation in other systems.

Applications of reverse saturable absorbers in laser science

A variety of applications exist for reverse saturable absorbers (RSAs) in the area of optical pulse processing and computing. An RSA can be used as power limiter/pulse smoother and energy limiter/pulse shortner of laser pulses. A combination of RSA and saturable absorber (SA) can be used for mode locking and pulse shaping between high power laser amplifiers in oscillator amplifier chain. Also, an RSA can be used for the construction of a molecular spatial light modulator (SLM) which acts as an input/output device in optical computers. A detailed review of the theoretical studies of these processes is presented. Current efforts to find RSAs at desired wavelength for testing these theoretical predictions are also discussed.

Modeling of precipitation in reverse micellar systems

A model of the precipitation process in reverse micelles has been developed to calculate the size of fine particles obtained therein. While the method shares several features of particle nucleation and growth common to precipitation in large systems, complexities arise in describing the processes of nucleation, due to the extremely small size of a micelle and of particle growth caused by fusion among the micelles. Occupancy of micelles by solubilized molecules is governed by Poisson statistics, implying most of them are empty and cannot nucleate of its own. The model therefore specifies the minimum number of solubilized molecules required to form a nucleus which is used to calculate the homogeneous nucleation rate. Simultaneously, interaction between micelles is assumed to occur by Brownian collision and instantaneous fusion. Analysis of time scales of various events shows growth of particles to be very fast compared to other phenomena occurring. This implies that nonempty micelles either are supersaturated or contain a single precipitated particle and allows application of deterministic population balance equations to describe the evolution of the system with time. The model successfully predicts the experimental measurements of Kandori ct al.(3) on the size of precipitated CaCO3 particles, obtained by carbonation of reverse micelles containing aqueous Ca(OH)(2) solution.

Reverse flotation of silica from Kudremukh iron ore .1. Selection of cationic reagents

Four types of cationic collectors were tested and evaluated for their performance in the reverse flotation of silica from the spiral preconcentrate of Kudremukh iron ore. A stagewise flotation was conducted by adding the reagent in three stages. Starch was used to depress hematite. Silica flotation was found to be very sensitive to the amount of cationic reagent added. The performance of the reagents was evaluated based on the percentage of silica and iron in the concentrate and percent recovery of iron obtained in the concentrate. Tests of significance, namely, t-test and F-test were performed to select the best two reagents for further investigations.