Searcharxiv⌕ Search

arXiv subjects

Yi Wei

Publications and source records attributed to Yi Wei.

88 records · Page 5Linked to original sources

The influence of initial solutions to exact solutions of the (2+1)-dimensional generalized Nizhnik-Novikov-Veselov equations

The (2+1)-dimensional generalized Nizhnik-Novikov-Veselov equations (GNNVEs) are investigated in order to search the influence of initial solution to exact solutions. The GNNVEs are converted into the combined equations of differently two bilinear forms by means of the homogeneous balance of undetermined coefficients method. Accordingly, the two class of exact N-soliton solutions and three wave solutions are obtained respectively by using the Hirota direct method combined with the simplified version of Hereman and the three wave method. The proposed method is also a standard and computable method, which can be generalized to deal with some nonlinear partial differential equations (NLPDEs).

math-ph↗

Statistical model of evolution of brain parcellation

We study the distribution of brain and cortical area sizes [parcellation units (PUs)] obtained for three species: mouse, macaque, and human. We find that the distribution of PU sizes is close to lognormal. We analyze the mathematical model of evolution of brain parcellation based on iterative fragmentation and specialization. In this model, each existing PU has a probability to be split that depends on PU size only. This model shows that the same evolutionary process may have led to brain parcellation in these three species. Our model suggests that region-to-region (macro) connectivity is given by the outer product form. We show that most experimental data on non-vanishing macaque cortex macroconnectivity (62% for area V1) can be explained by the outer product power-law form suggested by our model. We propose a multiplicative Hebbian learning rule for the macroconnectome that could yield the correct scaling of connection strengths between areas. We thus propose a universal evolutionary model that may have contributed to both brain parcellation and mesoscopic level connectivity in mammals.

q-bio.NC↗

An Exactly Solvable Model of Random Site-Specific Recombinations

Cre-lox and other systems are used as genetic tools to control site-specific recombination (SSR) events in genomic DNA. If multiple recombination sites are organized in a compact cluster within the same genome, a series of random recombination events may generate substantial cell specific genomic diversity. This diversity is used, for example, to distinguish neurons in the brain of the same multicellular mosaic organism, within the brainbow approach to neuronal connectome. In this paper we study an exactly solvable statistical model for SSR operating on a cluster of recombination sites. We consider two types of recombination events: inversions and excisions. Both of these events are available in the Cre-lox system. We derive three properties of the sequences generated by multiple recombination events. First, we describe the set of sequences that can in principle be generated by multiple inversions operating on the given initial sequence. We call this description the ergodicity theorem. On the basis of this description we calculate the number of sequences that can be generated from an initial sequence. This number of sequences is experimentally testable. Second, we demonstrate that after a large number of random inversions every sequence that can be generated is generated with equal probability. Lastly, we derive the equations for the probability to find a sequence as a function of time in the limit when excisions are much less frequent than inversions, such as in shufflon sequences.

q-bio.QM↗

Automated Fixing of Programs with Contracts

This paper describes AutoFix, an automatic debugging technique that can fix faults in general-purpose software. To provide high-quality fix suggestions and to enable automation of the whole debugging process, AutoFix relies on the presence of simple specification elements in the form of contracts (such as pre- and postconditions). Using contracts enhances the precision of dynamic analysis techniques for fault detection and localization, and for validating fixes. The only required user input to the AutoFix supporting tool is then a faulty program annotated with contracts; the tool produces a collection of validated fixes for the fault ranked according to an estimate of their suitability. In an extensive experimental evaluation, we applied AutoFix to over 200 faults in four code bases of different maturity and quality (of implementation and of contracts). AutoFix successfully fixed 42% of the faults, producing, in the majority of cases, corrections of quality comparable to those competent programmers would write; the used computational resources were modest, with an average time per fix below 20 minutes on commodity hardware. These figures compare favorably to the state of the art in automated program fixing, and demonstrate that the AutoFix approach is successfully applicable to reduce the debugging burden in real-world scenarios.

cs.SE↗

Optimizing weights of protein energy function to improve ab initio protein structure prediction

Predicting protein 3D structure from amino acid sequence remains as a challenge in the field of computational biology. If protein structure homologues are not found, one has to construct 3D structural conformations from the very beginning by the so-called ab initio approach, using some empirical energy functions. A successful algorithm in this category, Rosetta, creates an ensemble of decoy conformations by assembling selected best short fragments of known protein structures and then recognizes the native state as the highly populated one with a very low energy. Typically, an energy function is a combination of a variety of terms characterizing different structural features, say hydrophobic interactions, van der Waals force, hydrogen bonding, etc. It is critical for an energy function to be capable to distinguish native-like conformations from non-native ones and to drive most initial conformations assembled from fragments to a native-like one in a conformation search process. In this paper we propose a linear programming algorithm to optimize weighting of a total of 14 energy terms used in Rosetta. We reverse the Monte Carlo process of Rosetta to approach native-like conformations to a process generating from the native state an ensemble of initial conformations most relevant to the native state. Intuitively, an ideal weighting scheme would result in a large "basin of attraction" of the native structure, which leads to an objective function for the linear programming. We have examined the proposal on several benchmark proteins, and the experimental results suggest that the optimized weights enlarge the attraction basin of the native state and improve the quality of the predicted native states as well. In addition, a comparison of optimal weighting schema for proteins of different classes indicates that in different protein classes energy terms may have different effects.

physics.bio-ph↗

What Good Are Strong Specifications?

Experience with lightweight formal methods suggests that programmers are willing to write specification if it brings tangible benefits to their usual development activities. This paper considers stronger specifications and studies whether they can be deployed as an incremental practice that brings additional benefits without being unacceptably expensive. We introduce a methodology that extends Design by Contract to write strong specifications of functional properties in the form of preconditions, postconditions, and invariants. The methodology aims at being palatable to developers who are not fluent in formal techniques but are comfortable with writing simple specifications. We evaluate the cost and the benefits of using strong specifications by applying the methodology to testing data structure implementations written in Eiffel and C#. In our extensive experiments, testing against strong specifications detects twice as many bugs as standard contracts, with a reasonable overhead in terms of annotation burden and run-time performance while testing. In the wide spectrum of formal techniques for software quality, testing against strong specifications lies in a "sweet spot" with a favorable benefit to effort ratio.

cs.SE↗

The Search for the Laws of Automatic Random Testing

Can one estimate the number of remaining faults in a software system? A credible estimation technique would be immensely useful to project managers as well as customers. It would also be of theoretical interest, as a general law of software engineering. We investigate possible answers in the context of automated random testing, a method that is increasingly accepted as an effective way to discover faults. Our experimental results, derived from best-fit analysis of a variety of mathematical functions, based on a large number of automated tests of library code equipped with automated oracles in the form of contracts, suggest a poly-logarithmic law. Although further confirmation remains necessary on different code bases and testing techniques, we argue that understanding the laws of testing may bring significant benefits for estimating the number of detectable faults and comparing different projects and practices.

cs.SE↗

Eigenvalue spectra of asymmetric random matrices for multi-component neural networks

This paper focuses on large neural networks whose synaptic connectivity matrices are randomly chosen from certain random matrix ensembles. The dynamics of these networks can be characterized by the eigenvalue spectra of their connectivity matrices. In reality, neurons in a network do not necessarily behave in a similar way, but may belong to several different categories. The first study of the spectra of two-component neural networks was carried out by Rajan and Abbott. In their model, neurons are either 'excitatory' or 'inhibitory', and strengths of synapses from different types of neurons have Gaussian distributions with different means and variances. A surprising finding by Rajan and Abbott is that the eigenvalue spectra of these types of random synaptic matrices do not depend on the mean values of their elements. In this paper we prove that this is true even for a much more general type of random neural network, where there is a finite number of types of neurons, and their synaptic strengths have correlated distributions. Furthermore, using the diagrammatic techniques, we calculate the explicit formula for the spectra of synaptic matrices of multi-component neural networks.

cond-mat.dis-nn↗

Long-term memory stabilized by noise-induced rehearsal

Cortical networks can maintain memories for decades despite the short lifetime of synaptic strength. Can a neural network store long-lasting memories in unstable synapses? Here, we study the effects of random noise on the stability of memory stored in synapses of an attractor neural network. The model includes ongoing spike timing dependent plasticity (STDP). We show that certain classes of STDP rules can lead to the stabilization of memory patterns stored in the network. The stabilization results from rehearsals induced by noise. We show that unstructured neural noise, after passing through the recurrent network weights, carries the imprint of all memory patterns in temporal correlations. Under certain conditions, STDP combined with these correlations, can lead to reinforcement of all existing patterns, even those that are never explicitly visited. Thus, unstructured neural noise can stabilize the existing structure of synaptic connectivity. Our findings may provide the functional reason for highly irregular spiking displayed by cortical neurons and provide justification for models of system memory consolidation. Therefore, we propose that irregular neural activity is the feature that helps cortical networks maintain stable connections.

q-bio.NC↗

Code-based Automated Program Fixing

Many programmers, when they encounter an error, would like to have the benefit of automatic fix suggestions---as long as they are, most of the time, adequate. Initial research in this direction has generally limited itself to specific areas, such as data structure classes with carefully designed interfaces, and relied on simple approaches. To provide high-quality fix suggestions in a broad area of applicability, the present work relies on the presence of contracts in the code, and on the availability of dynamic analysis to gather evidence on the values taken by expressions derived from the program text. The ideas have been built into the AutoFix-E2 automatic fix generator. Applications of AutoFix-E2 to general-purpose software, such as a library to manipulate documents, show that the approach provides an improvement over previous techniques, in particular purely model-based approaches.

cs.SE↗

Stateful Testing: Finding More Errors in Code and Contracts

Automated random testing has shown to be an effective approach to finding faults but still faces a major unsolved issue: how to generate test inputs diverse enough to find many faults and find them quickly. Stateful testing, the automated testing technique introduced in this article, generates new test cases that improve an existing test suite. The generated test cases are designed to violate the dynamically inferred contracts (invariants) characterizing the existing test suite. As a consequence, they are in a good position to detect new errors, and also to improve the accuracy of the inferred contracts by discovering those that are unsound. Experiments on 13 data structure classes totalling over 28,000 lines of code demonstrate the effectiveness of stateful testing in improving over the results of long sessions of random testing: stateful testing found 68.4% new errors and improved the accuracy of automatically inferred contracts to over 99%, with just a 7% time overhead.

cs.SE↗

Aneka Cloud Application Platform and Its Integration with Windows Azure

Aneka is an Application Platform-as-a-Service (Aneka PaaS) for Cloud Computing. It acts as a framework for building customized applications and deploying them on either public or private Clouds. One of the key features of Aneka is its support for provisioning resources on different public Cloud providers such as Amazon EC2, Windows Azure and GoGrid. In this chapter, we will present Aneka platform and its integration with one of the public Cloud infrastructures, Windows Azure, which enables the usage of Windows Azure Compute Service as a resource provider of Aneka PaaS. The integration of the two platforms will allow users to leverage the power of Windows Azure Platform for Aneka Cloud Computing, employing a large number of compute instances to run their applications in parallel. Furthermore, customers of the Windows Azure platform can benefit from the integration with Aneka PaaS by embracing the advanced features of Aneka in terms of multiple programming models, scheduling and management services, application execution services, accounting and pricing services and dynamic provisioning services. Finally, in addition to the Windows Azure Platform we will illustrate in this chapter the integration of Aneka PaaS with other public Cloud platforms such as Amazon EC2 and GoGrid, and virtual machine management platforms such as Xen Server. The new support of provisioning resources on Windows Azure once again proves the adaptability, extensibility and flexibility of Aneka.

cs.DC↗

Bosonic color-flavor transformation for the special unitary group

We extend Zirnbauer's color-flavor transformation in the bosonic sector to the color group SU(N_c). Because the flavor group U(N_b, N_b) is non-compact, the algebraic method by which the original color-flavor transformation was derived leads to a useful result only for 2N_b \le N_c. Using the character expansion method, we obtain a different form of the transformation in the extended range N_b \le N_c. This result can also be used for the color group U(N_c). The integrals to which the transformation can be applied are of relevance for the recently proposed boson-induced lattice gauge theory.

hep-lat↗

Comment on the hadronic decay of excited heavy quarkonia

We make comments on ref.[Z.Phys. C73, 541 (1997)], and provide partial wave analysis to the decays of excited heavy S-wave $1^-$ quarkonia into the basic $1^-$ quarkonia state plus $ππ$. It is revealed that there exist contributions of D-wave transition in $ψ'\longrightarrow J/ψππ$, $Υ(2S)\longrightarrow Υ(1S) ππ$ and $Υ(3S)\longrightarrow Υ(1S) ππ$ by using the data-fitting results in ref.[Z.Phys C73, 541 (1997)]. A possible experimental method to measure the D-wave directly is discussed.

hep-ph↗