Search

To solve the problem of intelligent connected vehicles being prone to traffic accidents due to environmental weather conditions, a cellular automata traffic flow model integrating multi-source information was proposed. The neural networks were utilized to fuse multi-source information flows and high-precision map data in cloud environments and to achieve dynamic map updates and provide more accurate path planning for autonomous vehicles for effectively avoiding traffic accidents. Based on the multi-source information model, a two-lane traffic flow cellular automata model was constructed and compared with the manual driving model to demonstrate the superiority of the proposed model in terms of safety distance model, following rules and lane changing rules. The simulation was completed by MATLAB. The results show that the proposed model can increase traffic flow and reduce congestion time with achieving stable state in relatively short period of time, and the road traffic rate can be improved by 27%. [ABSTRACT FROM AUTHOR]

This study builds a large database from an extensive survey of existing bond strengths between ultrahigh-performance concrete (UHPC) and normal-strength concrete (NC), with total 563 specimens being collected. To make up for some factors not included in the existing tests, an additional 38 specimens were tested with the improved slant shear method to enrich the database. The four governing factors for the interface strength were identified from the test results of the total 563+38 specimens: compressive strengths of UHPC and NC materials, interface roughness, normal stress level, and casting sequence. It is highlighted that this work discusses the effect of casting sequence. To obtain an accurate prediction formula, an artificial neural network (ANN) model is constructed, where the effect of casting sequence was firstly introduced. Based on the trained ANN model, an explicit formula is presented that significantly minimizes the prediction error. A modified shear-friction formula is also proposed for the UHPC–NC interface shear strength. Compared with other calculation models for concrete interface strength, this proposed formula with multiple parameters has a better accuracy. [ABSTRACT FROM AUTHOR]

This paper addresses the distributed formation containment control problem of Euler–Lagrangian systems(ELSs) with unknown control directions by two layers, namely, time-varying formation for the leaders and containment formation control for the followers. We first estimate the desired states and velocities for the leaders and the followers in finite time. Second, novel adaptive neutral networks are used to compensate the model uncertainties. Third, using the Nussbaum gain technique, the proposed control laws can guarantee the ultimate convergence of error signals to zero and that all of the signals in the closed-loop system are bounded. Finally, simulation examples are given to demonstrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Transcriptional regulation is crucial for all biological processes and well investigated at the molecular level for a wide range of organisms. However, it is quite unclear how innovations, such as the activity of a novel regulatory element, evolve. In the case of transcription factor (TF) binding, both a novel TF and a novel-binding site would need to evolve concertedly. Since promiscuous functions have recently been identified as important intermediate steps in creating novel specific functions in many areas such as enzyme evolution and protein–protein interactions, we ask here how promiscuous binding of TFs to TF-binding sites (TFBSs) affects the robustness and evolvability of this tightly regulated system. Specifically, we investigate the binding behavior of several hundred TFs from different species at unprecedented breadth. Our results illustrate multiple aspects of TF-binding interactions, ranging from correlations between the strength of the interaction bond and specificity, to preferences regarding TFBS nucleotide composition in relation to both domains and binding specificity. We identified a subset of high A/T binding motifs. Motifs in this subset had many functionally neutral one-error mutants, and were bound by multiple different binding domains. Our results indicate that, especially for some TF–TFBS associations, low binding specificity confers high degrees of evolvability, that is that few mutations facilitate rapid changes in transcriptional regulation, in particular for large and old TF families. In this study we identify binding motifs exhibiting behavior indicating high evolutionary potential for innovations in transcriptional regulation. [ABSTRACT FROM AUTHOR]

Abstract With the development of Web service technology, more and more enterprises choose to publish their own services on the Internet. However, with the increasing demands of users, it is difficult for a single service to meet the complex user requirements. To address this challenge, multiple services can be integrated by leveraging the service-oriented architecture (SOA) to generate a value-added service, referred to a service composition, where the component services are loosely coupled. However, due to the dynamic running environment, the performance of each component service (including reliability) may fluctuate. This will introduce cascading effects, which could cause the entire service system to fail. Since component services run in a dynamic environment, the parameters used to conduct reliability prediction are difficult to obtain. Therefore, online reliability prediction that ensures the runtime quality poses a grand challenge. This paper analyzes the historical response time series and throughput time series of component services, and predicts the reliability in the near future. To guarantee the stable and continuous operation of a service system, we proposed an online reliability time series prediction method by combining a Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM). The proposed approach, referred to as CL-ROP, is able to predict the reliability of a service system in the near future. We conducted a series of experiments over real service data and compared with other competitive approaches to demonstrate the effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]

Background: Wright's metaphor of the fitness landscape has shaped and conditioned our view of the adaptation of populations for almost a century. Since its inception, and including criticism raised by Wright himself, the concept has been surrounded by controversy. Among others, the debate stems from the intrinsic difficulty to capture important features of the space of genotypes, such as its high dimensionality or the existence of abundant ridges, in a visually appealing two-dimensional picture. Two additional currently widespread observations come to further constrain the applicability of the original metaphor: the very skewed distribution of phenotype sizes (which may actively prevent, due to entropic effects, the achievement of fitness maxima), and functional promiscuity (i.e. the existence of secondary functions which entail partial adaptation to environments never encountered before by the population). Results: Here we revise some of the shortcomings of the fitness landscape metaphor and propose a new "scape" formed by interconnected layers, each layer containing the phenotypes viable in a given environment. Different phenotypes within a layer are accessible through mutations with selective value, while neutral mutations cause displacements of populations within a phenotype. A different environment is represented as a separated layer, where phenotypes may have new fitness values, other phenotypes may be viable, and the same genotype may yield a different phenotype, representing genotypic promiscuity. This scenario explicitly includes the many-to-many structure of the genotype-to-phenotype map. A number of empirical observations regarding the adaptation of populations in the light of adaptive multiscapes are reviewed. Conclusions: Several shortcomings of Wright's visualization of fitness landscapes can be overcome through adaptive multiscapes. Relevant aspects of population adaptation, such as neutral drift, functional promiscuity or environment-dependent fitness, as well as entropic trapping and the concomitant impossibility to reach fitness peaks are visualized at once. Adaptive multiscapes should aid in the qualitative understanding of the multiple pathways involved in evolutionary dynamics. [ABSTRACT FROM AUTHOR]

A neutral network is a subgraph of a Hamming graph, and its principal eigenvalue determines its robustness: the ability of a population evolving on it to withstand errors. Here we consider the most robust small neutral networks: the graphs that interpolate pointwise between hypercube graphs of consecutive dimension (the point, line, line and point in the square, square, square and point in the cube, and so on). We prove that the principal eigenvalue of the adjacency matrix of these graphs is bounded by the logarithm of the number of vertices, and we conjecture an analogous result for Hamming graphs of alphabet size greater than two. [ABSTRACT FROM AUTHOR]

Abstract: Although the basic mechanics of evolution have been understood since Darwin, debate continues over whether macroevolutionary phenomena are driven by the fitness structure of genotype space or by ecological interaction. In this paper we propose a simple model capturing key features of fitness-landscape and ecological models of evolution. Our model describes evolutionary dynamics in a high-dimensional, structured genotype space with interspecies interaction. We find promising qualitative similarity with the empirical facts about macroevolution, including broadly distributed extinction sizes and realistic exploration of the genotype space. The abstraction of our model permits numerous applications beyond macroevolution, including protein and RNA evolution. [Copyright &y& Elsevier]

The bond strength between ultra-high-performance concrete (UHPC) and normal-strength concrete (NC) plays an important role in governing the composite specimens' overall behaviors. Unfortunately, there are still no widely accepted formulas targeting UHPC–NC interfacial strength, either in their specifications or in research papers. To this end, this study constructs an experimental database, consisting of 563 and 338 specimens for splitting and slant shear tests, respectively. Moreover, an additional 35 specimens for "improved" slant shear tests were performed, which could circumvent concrete crushing and trigger interfacial debonding. Additionally, for the first time in our tests, the effect of casting sequence on UHPC–NC bond strength was identified. Based on the database, an artificial neural network (ANN) model is proposed with the following inputs: namely, the normal stress perpendicular to the interface, the interface roughness, and the compressive strengths of the UHPC and NC materials. Based on the ANN analyses, the explicit expression of UHPC–NC bond strength is proposed, which significantly lowers the prediction error. To be fully compatible with the specifications, the conventional shear-friction formula is modified. By splitting the total force into adhesion and friction forces, the modified formula additionally takes the casting sequence into account. Although sacrificing accuracy to some extent compared to the ANN model, the modified formula relies on a solid physical basis and its accuracy is enhanced significantly compared to the existing formulas in specifications or research papers. [ABSTRACT FROM AUTHOR]

In evolution, the effects of a single deleterious mutation can sometimes be compensated for by a second mutation which recovers the original phenotype. Such epistatic interactions have implications for the structure of genome space—namely, that networks of genomes encoding the same phenotype may not be connected by single mutational moves. We use the folding of RNA sequences into secondary structures as a model genotype–phenotype map and explore the neutral spaces corresponding to networks of genotypes with the same phenotype. In most of these networks, we find that it is not possible to connect all genotypes to one another by single point mutations. Instead, a network for a phenotypic structure with n bonds typically fragments into at least 2n neutral components, often of similar size. While components of the same network generate the same phenotype, they show important variations in their properties, most strikingly in their evolvability and mutational robustness. This heterogeneity implies contingency in the evolutionary process. [ABSTRACT FROM AUTHOR]

Abstract: Robustness, the insensitivity of some of a biological system''s functionalities to a set of distinct conditions, is intimately linked to fitness. Recent studies suggest that it may also play a vital role in enabling the evolution of species. Increasing robustness, so is proposed, can lead to the emergence of evolvability if evolution proceeds over a neutral network that extends far throughout the fitness landscape. Here, we show that the design principles used to achieve robustness dramatically influence whether robustness leads to evolvability. In simulation experiments, we find that purely redundant systems have remarkably low evolvability while degenerate, i.e. partially redundant, systems tend to be orders of magnitude more evolvable. Surprisingly, the magnitude of observed variation in evolvability can neither be explained by differences in the size nor the topology of the neutral networks. This suggests that degeneracy, a ubiquitous characteristic in biological systems, may be an important enabler of natural evolution. More generally, our study provides valuable new clues about the origin of innovations in complex adaptive systems. [Copyright &y& Elsevier]

Abstract: We analyze here the evolutionary consequences of selection with delay in a population genetics context. In the classical works on evolutionary dynamics, an individual produces off-springs in direct proportion to its fitness, a process in which mutations may occur. In the present scenario of delayed selection, individuals that acquire deleterious mutations can still reproduce unharmed for several generations. During this time delay, the damage passed on to off-springs can potentially be repaired by subsequent compensatory mutations. In the absence of such a repair, the individual becomes sterile. Here we study the population-genetic effects of such a time delay by means of both numerical simulations and theoretical modeling. The results show that delayed selection lowers the extinction threshold, endangering the survival of the population. Surprisingly, however, no traces of this delay effect are encountered in the sequence diversity of the population. These conclusions suggest that delayed selection is hard to detect in genetic data and thus could be a wide-spread but rarely detected phenomenon. [Copyright &y& Elsevier]

Abstract: In this paper, the problem on an unique equilibrium solution of the bidirectional associative memory neural networks with distributed time-varying delays is investigated via Lyapunov stability theory. By using topological degree theory and M-matrix theory, several sufficient conditions ensuring the existence, uniqueness and global asymptotic stability of equilibrium solution are derived. An illustrative example is given to demonstrate the effectiveness of the obtained results. [Copyright &y& Elsevier]

After an ancestral population splits into two allopatric populations, different mutations may fix in each. When pairs of mutations are brought together in a hybrid offspring, epistasis may cause reduced fitness. Such pairs are known as Bateson–Dobzhansky–Muller (BDM) incompatibilities. A well-known model of BDM incompatibility due to Orr suggests that the fitness load on hybrids should initially accelerate, and continue to increase as the number of potentially incompatible substitutions increases (the “snowball effect”). In the gene networks model, which violates a key assumption of Orr's model (independence of fixation probabilities), the snowball effect often does not occur. Instead, we describe three possible dynamics in a constant environment: (1) Stabilizing selection can constrain two allopatric populations to remain near-perfectly compatible. (2) Despite constancy of environment, punctuated evolution may obtain; populations may experience rare adaptations asynchronously, permitting incompatibility. (3) Despite stabilizing selection, developmental system drift may permit genetic change, allowing two populations to drift in and out of compatibility. We reinterpret Orr's model in terms of genetic distance. We extend Orr's model to the finite loci case, which can limit incompatibility. Finally, we suggest that neutral evolution of gene regulation in nature, to the point of speciation, is a distinct possibility. [ABSTRACT FROM AUTHOR]

Undoubtedly, viruses represent a major threat faced by human and veterinary medicines and by agronomy. The rapid evolution of viruses enables them to escape from natural immunities and from state-of-the-art antiviral treatments, with new viruses periodically emerging with deadly consequences. Viruses have also become powerful and are increasingly used tools in the field of experimental evolution. A growing body of evidence points that the evolution of viruses is mainly determined by key features such as their compacted genomes, enormous population sizes, and short generation times. In addition, RNA viruses also present large selection coefficients, antagonistic epistasis, and high mutation rates. Most of this knowledge comes from studies that have used either bacteriophages or animal viruses in cell cultures as experimental systems. However, plant viruses provide almost identical advantages for evolutionary studies and, in addition, offer an invaluable tool for studying the interplay between viruses and pluricellular hosts. Without seeking to be exhaustive, here we summarize some peculiarities of plant viruses and review recent experiments that have explored important questions on evolution, such as the role of deleterious mutation and neutrality, the effect of different transmission modes in the evolution of virulence, and the heterogeneous selective constraints imposed by multiple hosts.Heredity (2008) 100, 478–483; doi:10.1038/sj.hdy.6801088; published online 6 February 2008 [ABSTRACT FROM AUTHOR]

Abstract: and have studied a simple model of the evolution of a network of N genes, in order to explain the observed phenomenon that systems evolve to be robust. These authors primarily considered the case and used simulations to reach their conclusions. Here we investigate this model in more detail, considering systems of different sizes with and without recombination, and with selection for convergence instead of to a specified limit. For the simpler evolutionary model lacking recombination, we analyze the system as a neutral network. This allows us to describe the equilibrium distribution networks within genotype space. Our results show that, given a sufficiently large population size, the qualitative observation that systems evolve to be robust, is itself robust, as it does not depend on the details of the model. In simple terms, robust systems have more viable offspring, so the evolution of robustness is merely selection for increased fecundity, an observation that is well known in the theory of neutral networks. [Copyright &y& Elsevier]

It is often assumed that the efficiency of selection for mutational robustness would be proportional to mutation rate and population size, thus being inefficient in small populations. However, Krakauer and Plotkin (2002) hypothesized that selection in small populations would favor robustness mechanisms, such as redundancy, that mask the effect of deleterious mutations. In large populations, by contrast, selection is more effective at removing deleterious mutants and fitness would be improved by eliminating mechanisms that mask the effect of deleterious mutations and thus impede their removal. Here, we test whether these predictions are supported in experiments with evolving populations of digital organisms. Digital organisms are self-replicating programs that inhabit a virtual world inside a computer. Like their organic counterparts, digital organisms mutate, compete, evolve, and adapt by natural selection to their environment. In this study, 160 populations evolved at different combinations of mutation rate and population size. After 104 generations, we measured the mutational robustness of the most abundant genotype in each population. Mutational robustness tended to increase with mutation rate and to decline with population size, although the dependence with population size was in part mediated by a negative relationship between fitness and robustness. These results are independent of whether genomes were constrained to their original length or allowed to change in size. [ABSTRACT FROM AUTHOR]

Abstract: We investigate the evolutionary dynamics of a finite population of RNA sequences replicating on a neutral network. Despite the lack of differential fitness between viable sequences, we observe typical properties of adaptive evolution, such as increase of mean fitness over time and punctuated-equilibrium transitions, after initial mutation–selection balance has been reached. We find that a product of population size and mutation rate of approximately 30 or larger is sufficient to generate selection pressure for mutational robustness, even if the population size is orders of magnitude smaller than the neutral network on which the population resides. Our results show that quasispecies effects and neutral drift can occur concurrently, and that the relative importance of each is determined by the product of population size and mutation rate. [Copyright &y& Elsevier]

Firms involved in international logistics must develop a system of service attributes that give them a way to be profitable and to satisfy customers' needs at the same time. How customers trade-off these various attributes in forming satisfaction with competing international logistics providers has not been explored well in the literature. This study explores the ocean freight shipping sector to identify the system of attributes that maximizes customers' satisfaction. Data were collected from shipping managers in Singapore using personal interviews to identify the chief concerns in choosing and evaluating ocean freight services. The data were then examined using neural networks and decision trees, among other approaches to identify the system of attributes that is connected with customer satisfaction. The results illustrate the power of these methods in understanding how industrial customers with global operations process attributes to derive satisfaction. Implications are discussed. [ABSTRACT FROM AUTHOR]

Abstract: We are developing a system to predict the arrival of interplanetary (IP) shocks at the Earth. These events are routinely detected by the Electron, Proton, and Alpha Monitor (EPAM) instrument aboard NASA’s ACE spacecraft, which is positioned at Lagrange Point 1 (L1). In this work, we use historical EPAM data to train an IP shock forecasting algorithm. Our approach centers on the observation that these shocks are often preceded by identifiable signatures in the energetic particle intensity data. Using EPAM data, we trained an artificial neural network to predict the time remaining until the shock arrival. After training this algorithm on 37 events, it was able to forecast the arrival time for 19 previously unseen events. The average uncertainty in the prediction 24h in advance was 8.9h, while the uncertainty improved to 4.6h when the event was 12h away. This system is accessible online, where it provides predictions of shock arrival times using real-time EPAM data. [Copyright &y& Elsevier]

In this paper, we explore various adaptive factors that can influence the emergence of a communication system that benefits the receiver of signals (the hearer) but not the emitter (the speaker). Using computer simulations of a population of interacting agents whose behaviour is determined by a neural network, we show that a stable communication system does not emerge in groups of unrelated individuals because of its altruistic character. None the less, another set of simulations shows that the emergence of a language that confers an advantage only to hearers, not to speakers, is possible under at least three conditions: (1) if the hearer and the speaker tend to share the same genes, as predicted by kin selection theory; (2) if the population is ‘docile’ and the communication system is culturally transmitted together with other adaptive behaviours, as predicted by Simon’s docility theory; and (3) if the linguistic system is used not only for social communication, but also for talking to oneself, in particular as an aid to memory. [ABSTRACT FROM AUTHOR]

Abstract: For LHC, the hadronic calorimetry of the ATLAS detector is performed by Tilecal, a scintillating tile calorimeter. For calibration purposes, a fraction of the Tilecal modules is placed in particle beam lines. Despite beam high quality, experimental beam contamination is observed and this masks the actual performance of the calorimeter. For optimizing the calibration task, an online neural particle classifier was developed for Tilecal. Envisaging a neural trigger for incoming particles, a neural process runs integrated to the data acquisition task and performs online training for particle identification. The neural classification performance is evaluated by correlating the neural response to classical methodology, confirming an ability for outsider identification at levels as high as 99.3%. [Copyright &y& Elsevier]

Abstract: We discuss several popular statistical learning methods used in high-energy- and astro-physics analysis. After a short motivation for statistical learning we present the most popular algorithms and discuss several examples from current research in particle- and astro-physics. The statistical learning methods are compared with each other and with standard methods for the respective application. [Copyright &y& Elsevier]

Abstract: The paper is devoted to the problem of time series enhancement, which is based on the analysis of local regularity. The model construction using this analysis does not require any a priori assumption on the structure of the noise and the functional relationship between original signal and noise. The signal itself may be nowhere differentiable with rapidly varying local regularity, what is overcome with the help of the new technique of increasing the local Hölder regularity of the signal under research. A new signal with prescribed regularity is constructed using the genetic algorithm. This approach is applied to enhancement of time series in the paleoclimatology, solar physics, dendrochronology, meteorology and hydrology. [Copyright &y& Elsevier]

Genetic assimilation occurs when an acquired trait loses dependency on its environmental trigger and becomes an inherited trait. According to the standard quantitative genetic model for genetic assimilation, the trait is determined by the contributions of multiple genes. Trait expression occurs at a lower threshold with the trigger. Selection for the trait in the presence of the trigger increases the frequency of the trait-determining alleles. Eventually these alleles become frequent enough to breach the higher threshold for expression in the absence of the trigger. This loss of dependence on the trigger signifies genetic assimilation. Here I show that genetic assimilation can occur in the absence of selection for the trait in an evolutionary simulation of a gene network model. This contradicts the prediction of the standard quantitative genetic model, but is consistent with an explanation in terms of the canalization heuristic. [ABSTRACT FROM AUTHOR]

The work aimed to determine the effectiveness of the treatment of wastewater generated by the meat industry in a hybrid system combining biological methods of activated sludge (in an SBR reactor) and reverse osmosis. The tests carried out on the wastewater from the meat processing plant Uni-Lang in Wrzosowa showed that the biological treatment resulted in sufficient removal of contaminants from the wastewater, which consequently could be discharged into receiving water. In order to make it possible for the wastewater to be reused in the production cycle, it was additionally treated with reverse osmosis. The research was described mathematically by the program MATLAB using artificial neural networks. The program enables a prediction of the results for the treatment of wastewater over a range of tested values. [Copyright &y& Elsevier]

We examine the applicability of Principal Component Analysis (PCA) and Artificial Neural Network (ANN) methods of data analysis to biosignature detection. These techniques show promise in classifying and simplifying the representation of patterns of amino acids resulting from biological and non-biological syntheses. PCA correctly identifies glycine and alanine as the amino acids contributing the most information to the task of discriminating biotic and abiotic samples. Trained ANNs correctly classify between 86.1 and 99.5% of a large set of amino acid samples as biotic or abiotic. These and similar techniques are important in the design of automated data analysis systems for robotic missions to distant planetary bodies. Both techniques are robust with respect to noisy and incomplete data. Analysis of the performance of PCA and ANNs also lends insight into the localization of useful information within a particular data set, a feature that may be exploited in the selection of experiments for efficient mission design. [Copyright &y& Elsevier]

This paper discusses how the use of redundant representations influences the performance of genetic and evolutionary algorithms. Representations are redundant if the number of genotypes exceeds the number of phenotypes. A distinction is made between synonymously and non-synonymously redundant representations. Representations are synonymously redundant if the genotypes that represent the same phenotype are very similar to each other. Non-synonymously redundant representations do not allow genetic operators to work properly and result in a lower performance of evolutionary search. When using synonymously redundant representations, the performance of selectorecombinative genetic algorithms (GAs) depends on the modification of the initial supply. We have developed theoretical models for synonymously redundant representations that show the necessary population size to solve a problem and the number of generations goes with O(2[sup kr]/r), where kr is the order of redundancy and r is the number of genotypic building blocks (BB) that represent the optimal phenotypic BB. As a result, uniformly redundant representations do not change the behavior of GAs. Only by increasing r, which means overrepresenting the optimal solution, does GA performance increase. Therefore, non-uniformly redundant representations can only be used advantageously if a-priori information exists regarding the optimal solution. The validity of the proposed theoretical concepts is illustrated for the binary trivial voting mapping and the real-valued link-biased encoding. Our empirical investigations show that the developed population sizing and time to convergence models allow an accurate prediction of the empirical results. [ABSTRACT FROM AUTHOR]

Of all the issues discussed at Alife VII: Looking Forward, Looking Backward, the issue of whether it was possible to create an artificial life system that exhibits open-ended evolution of novelty is by far the biggest. Of the 14 open problems settled on as a result of debate at the conference, some 6 are directly, or indirectly related to this issue. Most people equate open-ended evolution with complexity growth, although a priori these seem to be different things. In this paper I report on experiments to measure the complexity of Tierran organisms, and show the results for a size-neutral run of Tierra. In this run, no increase in organismal complexity was observed, although organism size did increase through the run. This result is discussed, offering some signposts on path to solving the issue of open ended evolution. [ABSTRACT FROM AUTHOR]

Linear feature extraction is crucial for special objects in semantic segmentation networks, such as slot marking and lanes. The objects with linear characteristics have global contextual information dependency. It is very difficult to capture the complete information of these objects in semantic segmentation tasks. To improve the linear feature extraction ability of the semantic segmentation network, we propose introducing the dilated convolution with vertical and horizontal kernels (DVH) into the task of feature extraction in semantic segmentation networks. Meanwhile, we figure out the outcome if we put the different vertical and horizontal kernels on different places in the semantic segmentation networks. Our networks are trained on the basis of the SS dataset, the TuSimple lane dataset and the Massachusetts Roads dataset. These datasets consist of slot marking, lanes, and road images. The research results show that our method improves the accuracy of the slot marking segmentation of the SS dataset by 2%. Compared with other state-of-the-art methods, our UnetDVH-Linear (v1) obtains better accuracy on the TuSimple Benchmark Lane Detection Challenge with a value of 97.53%. To prove the generalization of our models, road segmentation experiments were performed on aerial images. Without data argumentation, the segmentation accuracy of our model on the Massachusetts roads dataset is 95.3%. Moreover, our models perform better than other models when training with the same loss function and experimental settings. The experiment result shows that the dilated convolution with vertical and horizontal kernels will enhance the neural network on linear feature extraction. [ABSTRACT FROM AUTHOR]