Path selection in the growth of rivers.
Ontology highlight
ABSTRACT:
SUBMITTER: Cohen Y
PROVIDER: S-EPMC4655524 | biostudies-other | 2015 Nov
REPOSITORIES: biostudies-other
Similar Datasets
Project description:In this study, we address the problem of selecting the optimal end-to-end paths for link loss inference in order to improve the performance of network tomography applications, which infer the link loss rates from the path loss rates. Measuring the path loss rates using end-to-end probing packets may incur additional traffic overheads for networks, so it is important to select the minimum path set carefully while maximizing their performance. The usual approach is to select the maximum independent paths from the candidates simultaneously, while the other paths can be replaced by linear combinations of them. However, this approach ignores the fact that many paths always exist that do not lose any packets, and thus it is easy to determine that all of the links of these paths also have 0 loss rates. Not considering these good paths will inevitably lead to inefficiency and high probing costs. Thus, we propose an adaptive path selection method that selects paths sequentially based on the loss rates of previously selected paths. We also propose a theorem as well as a graph construction and decomposition approach to efficiently find the most valuable path during each round of selection. Our new method significantly outperforms the classical path selection method based on simulations in terms of the probing cost, number of accurate links determined, and the running speed.
| S-EPMC5049780 | biostudies-literature
Project description:Many phenotypic traits have a polygenic genetic basis, making it challenging to learn their genetic architectures and predict individual phenotypes. One promising avenue to resolve the genetic basis of complex traits is through evolve-and-resequence experiments, in which laboratory populations are exposed to some selective pressure and trait-contributing loci are identified by extreme frequency changes over the course of the experiment. However, small laboratory populations will experience substantial random genetic drift, and it is difficult to determine whether selection played a roll in a given allele frequency change. Predicting how much allele frequencies change under drift and selection had remained an open problem well into the 21st century, even those contributing to simple, monogenic traits. Recently, there have been efforts to apply the path integral, a method borrowed from physics, to solve this problem. So far, this approach has been limited to genic selection, and is therefore inadequate to capture the complexity of quantitative, highly polygenic traits that are commonly studied. Here we extend one of these path integral methods, the perturbation approximation, to selection scenarios that are of interest to quantitative genetics. In particular, we derive analytic expressions for the transition probability (i.e., the probability that an allele will change in frequency from x , to y in time t ) of an allele contributing to a trait subject to stabilizing selection, as well as that of an allele contributing to a trait rapidly adapting to a new phenotypic optimum. We use these expressions to characterize the use of allele frequency change to test for selection, as well as explore optimal design choices for evolve-and-resequence experiments to uncover the genetic architecture of polygenic traits under selection.
| S-EPMC11195211 | biostudies-literature
Project description:Abstract This paper embeds a technical progress function in a classical growth model and studies
| S-EPMC8985193 | biostudies-literature
Project description:Species diversity indices provide quantitative data for understanding the variations and trends in fish species diversity, as well as information on species richness and evenness. However, these diversity indices do not reflect differences in specific taxa, which can be of importance as key conservation targets, especially during the planning and construction of protected areas. In this study, simultaneously combining our improved traditional fish fauna analysis (TFFA) with the value of fish fauna presence (VFFP) methods, we studied fish diversity in the Salween and Irrawaddy basins. The results of the TFFA reflected the families (subfamilies) and genera that constitute the main body of fish diversity in the river basins. The results of the VFFP assessment showed which families (subfamilies) and genera were representative of certain characteristics in the basins. The VFFP scores of genera could be used as indicator indices and as priority taxa in the planning and construction of fish resource reserves. In this paper, we propose for the first time that the role and status of monotypic genera (genera comprising only a single species) in the conservation of fish diversity should not be ignored, and they should rather be a priority for protection.
| S-EPMC10825156 | biostudies-literature
Project description:With the implementation of urban central rail transit and old city reconstruction projects, construction vehicles frequently enter and depart the urban area. And because of its large volume and other characteristics, it increases the risk probability and severity of urban traffic accidents. This study takes the transportation path selection of construction vehicles as the breakthrough point, weighs the transportation efficiency and safety of construction vehicles, establishes a bi-objective optimization model, involving constraints such as height limit, weight limit, speed limit, direction limit and traffic limit and uses genetic algorithm to solve it. Finally, through case analysis, the user preference is adjusted to conduct functional test and description of the model. The results indicate that the model has the function of transportation vehicle path optimization. In the meantime, compared with the safest route, the time-consuming of the optimal route decreases by 16% and the risk increases by 7.4%, while the time-consuming of it increases by 5% and the risk decreases by 15.4% compared with the shortest route. Moreover, the corresponding coefficients of time-consuming and safety preference can reach about 0.65, and the relevant stakeholders have high acceptance of the route. Further improvement of construction vehicle management mechanism based on path optimization is one of the limited ways to effectively improve the current situation of construction vehicle management.
| S-EPMC9536627 | biostudies-literature
Project description:Parallel cascade selection molecular dynamics (PaCS-MD) is a rare-event sampling method that generates transition pathways between a reactant and product. To sample the transition pathways, PaCS-MD repeats short-time MD simulations from important configurations as conformational resampling cycles. In this study, PaCS-MD was extended to sample ligand binding pathways toward a target protein, which is referred to as LB-PaCS-MD. In a ligand-concentrated environment, where multiple ligand copies are randomly arranged around the target protein, LB-PaCS-MD allows for the frequent sampling of ligand binding pathways. To select the important configurations, we specified the center of mass (COM) distance between each ligand and the relevant binding site of the target protein, where snapshots generated by the short-time MD simulations were ranked by their COM distance values. From each cycle, snapshots with smaller COM distance values were selected as the important configurations to be resampled using the short-time MD simulations. By repeating conformational resampling cycles, the COM distance values gradually decreased and converged to constants, meaning that a set of ligand binding pathways toward the target protein was sampled by LB-PaCS-MD. To demonstrate relative efficiency, LB-PaCS-MD was applied to several proteins, and their ligand binding pathways were sampled more frequently than conventional MD simulations.
| S-EPMC8878848 | biostudies-literature
Project description:Under the wave of Industry 4.0, traditional pharmaceutical manufacturing enterprises are in urgent need of intelligent manufacturing transformation and upgrading, and exploring the optimal realization path of intelligent manufacturing transformation can help accelerate the transformation process of pharmaceutical manufacturing enterprises. This paper uses grounded theory research methods to conduct a multi-case study to summarize six influencing factors of the intelligent manufacturing transformation of Chinese pharmaceutical manufacturing enterprises; and then analyzes the correlation between the intelligent manufacturing influencing factors based on the DEMATEL method and the NK model, and identifies the key influencing factors according to this, and then draws the fitness landscape map of the intelligent manufacturing transformation, and finally arrives at the optimal path selection of the intelligent manufacturing transformation of pharmaceutical manufacturing enterprises. The study enriches and extends the research paradigm of intelligent manufacturing transformation, and provides lessons for pharmaceutical manufacturing enterprises to realize intelligent manufacturing transformation and upgrading.
| S-EPMC11344148 | biostudies-literature
Project description:Universal hitting sets (UHS) are sets of words that are unavoidable: every long enough sequence is hit by the set (i.e., it contains a word from the set). There is a tight relationship between UHS and minimizer schemes, where minimizer schemes with low density (i.e., efficient schemes) correspond to UHS of small size. Local schemes are a generalization of minimizer schemes that can be used as replacement for minimizer scheme with the possibility of being much more efficient. We establish the link between efficient local schemes and the minimum length of a string that must be hit by a UHS. We give bounds for the remaining path length of the Mykkeltveit UHS. In addition, we create a local scheme with the lowest known density that is only a log factor away from the theoretical lower bound.
| S-EPMC8066347 | biostudies-literature
Project description:Path testing is the basic approach of white box testing and the main approach to solve it by discovering the particular input data of the searching space to encompass the paths in the software under test. Due to the increasing software complexity, exhaustive testing is impossible and computationally not feasible. The ultimate challenge is to generate suitable test data that maximize the coverage; many approaches have been developed by researchers to accomplish path coverage. The paper suggested a hybrid method (NSA-GA) based on Negative Selection Algorithm (NSA) and Genetic Algorithm (GA) to generate an optimal test data avoiding replication to cover all possible paths. The proposed method modifies the generation of detectors in the generation phase of NSA using GA, as well as, develops a fitness function based on the paths' prioritization. Different benchmark programs with different data types have been used. The results show that the hybrid method improved the coverage percentage of the programs' paths, even for complicated paths and its ability to minimize the generated number of test data and enhance the efficiency even with the increased input range of different data types used. This method improves the effectiveness and efficiency of test data generation and maximizes search space area, increasing percentage of path coverage while preventing redundant data.
| S-EPMC7703959 | biostudies-literature