In this investigation different algorithms for InterCriteria relations calculation are proposed. The algorithms are investigated by exploring the influence of genetic parameters on algorithm performance during the mod...
详细信息
In this investigation different algorithms for InterCriteria relations calculation are proposed. The algorithms are investigated by exploring the influence of genetic parameters on algorithm performance during the model parameter identification of E. coli fermentation process. Four different algorithms performing InterCriteria analysis (ICrA), namely μ-biased, balanced, ν-biased and unbiased, are applied. Proposed ICrA algorithms are compared based on real experimental data set of an E. coli MC4110 fed-batch fermentation process. The obtained results show that for considered here case study the most reliable algorithm is the μ-biased one.
Currently, intense work is underway to develop memristor crossbar arrays for high density, nonvolatile memory applications. However, another capability of memristor crossbars - natural dot-product operation for vector...
详细信息
Currently, intense work is underway to develop memristor crossbar arrays for high density, nonvolatile memory applications. However, another capability of memristor crossbars - natural dot-product operation for vectors and matrices - holds even greater potential for next-generation computing, including accelerators, neuromorphic computing, and heterogeneous computing. In this paper, we present a dot-product engine (DPE) based on memristor crossbars optimized for dense matrix computation, which is dominated in most machine learning algorithms. We explored multiple methods to enhance DPE's dot-product computing accuracy. Moreover, instead of training crossbars, we try to directly use existing software-trained weight matrices on DPEs so no heroic effort is needed to innovate learning algorithms for new hardware. Our results show that computations utilizing DPEs can achieve 1000 ~ 10000 times better speed-efficiency product comparing to a state-of-art ASIC [1]. And machine learning algorithm utilizing DPEs can easily achieve software-level accuracy on testing. Both experimental demonstrations and data-calibrated circuit simulations are presented to demonstrate the realistic implementation of a memristor crossbar DPE.
By the Lyapunov function method, this paper studies the design of the state feedback stabilizing controller for fractional order nonlinear lower triangular systems, and presents a number of new results. Using introduc...
详细信息
By the Lyapunov function method, this paper studies the design of the state feedback stabilizing controller for fractional order nonlinear lower triangular systems, and presents a number of new results. Using introducing appropriate transformations of coordinates, the problem of controller design is converted into the problem of finding some parameters. Based on the Lyapunov function method and some properties of Caputo fractional derivative, the state feedback stabilizing controller makes the closed-loop system asymptotically stable. A simulation example is given to demonstrate the effectiveness of the proposed design procedure.
In this paper, Genetic algorithm (GA) based on Building Block (BB) identification is applied to optimal design of Interior Permanent Magnet Synchronous Motor (IPMSM). BBs on IPMSM design variables are identified using...
详细信息
ISBN:
(纸本)9781509010332
In this paper, Genetic algorithm (GA) based on Building Block (BB) identification is applied to optimal design of Interior Permanent Magnet Synchronous Motor (IPMSM). BBs on IPMSM design variables are identified using the proposed algorithm based on nonlinearity check by perturbation. Consequently, BB information regarding the design of IPMSM is proposed and the performance of the proposed algorithm is verified by comparing it with GA which does not consider BB.
Recent advances in autonomous driving require more and more highly realistic reference data, even for difficult situations such as low light and bad weather. We present a new stereo and optical flow dataset to complem...
详细信息
Recent advances in autonomous driving require more and more highly realistic reference data, even for difficult situations such as low light and bad weather. We present a new stereo and optical flow dataset to complement existing benchmarks. It was specifically designed to be representative for urban autonomous driving, including realistic, systematically varied radiometric and geometric challenges which were previously unavailable. The accuracy of the ground truth is evaluated based on Monte Carlo simulations yielding full, per-pixel distributions. Interquartile ranges are used as uncertainty measure to create binary masks for arbitrary accuracy thresholds and show that we achieved uncertainties better than those reported for comparable outdoor benchmarks. Binary masks for all dynamically moving regions are supplied with estimated stereo and flow values. An initial public benchmark dataset of 55 manually selected sequences between 19 and 100 frames long are made available in a dedicated website featuring interactive tools for database search, visualization, comparison and benchmarking.
In the delivery of end-to-end services, Network Functions (NFs) are frequently utilized. Traditionally, these NFs are implemented on middle-boxes. Since physical middle-boxes are hardware-based, expensive and hard to ...
详细信息
ISBN:
(纸本)9781509039371
In the delivery of end-to-end services, Network Functions (NFs) are frequently utilized. Traditionally, these NFs are implemented on middle-boxes. Since physical middle-boxes are hardware-based, expensive and hard to maintain and upgrade, they are replaced by Virtual Network Functions (VNFs) following the trend of Network Function Virtualization (NFV). Nowadays services are implemented by the ordered combination of a set of VNFs that are deployed in appropriate place within the network. The problems brought by NFV are: How to construct the VNFs chain and How the VNFs chain is allocated to Substrate Network (SN). In this paper, a Modified Topological Sort algorithm (MTSA) is proposed to solve the two problems simultaneous and two node selection strategies (Embedding Node Selection Strategy (ENSS) and Virtual Node Selection Strategy (VNSS)) based on resource evaluation are raised to further improve the efficiency. Simulation experiments show that the proposed method significantly decreases the backtracking steps which guarantee a reasonable runtime.
There are several algorithms and methods that could be applied to perform the character recognition stage of an automatic number plate recognition system; however, the constraints of having a high recognition rate and...
详细信息
There are several algorithms and methods that could be applied to perform the character recognition stage of an automatic number plate recognition system; however, the constraints of having a high recognition rate and real-time processing should be taken into consideration. In this paper four algorithms applied to Qatari number plates are presented and compared. The proposed algorithms are based on feature extraction (vector crossing, zoning, combined zoning and vector crossing) and template matching techniques. All four proposed algorithms have been implemented and tested using MATLAB. A total of 2790 Qatari binary character images were used to test the algorithms. Template matching based algorithm showed the highest recognition rate of 99.5% with an average time of 1.95 ms per character.
Under the domain of barrier coverage, Best Coverage Path can be calculated using computational geometric algorithms. The sensing field may have randomly distributed sensors that can provide a cover to a single point b...
详细信息
ISBN:
(纸本)9781509006700
Under the domain of barrier coverage, Best Coverage Path can be calculated using computational geometric algorithms. The sensing field may have randomly distributed sensors that can provide a cover to a single point by multiple numbers of sensors resulting into a k-coverage scenario where k is the constant number of sensors available to cover any single point on the field. In real environment we have obstacles that hinders path and obstruct line of sight. Obstacles can be simulated as geometrical shapes say line segment causing absolute opaqueness to the line of sight and blockage of path. In this paper we have proposed an approach of computing a k-covered Best coverage path between a pair of location on a two dimensional field in presence of line segment obstacles. An algorithm is proposed to find a path covered by a constant number of sensors in polynomial time. Then a java application based on proposed algorithm has been designed and some observations are being made.
Graph-mining is a class of data-mining problems where programs involve the processing of data modeled as graphs. These applications often exhibit irregular and data-dependent communication patterns, hampering parallel...
详细信息
Graph-mining is a class of data-mining problems where programs involve the processing of data modeled as graphs. These applications often exhibit irregular and data-dependent communication patterns, hampering parallelization opportunities on distributed architectures. Many tools and frameworks were created for the scalable processing of graphs but their comparison is non-trivial on distributed architectures as there is no efficiency metrics with respect to distributed resource usage. Considering an in-house use-case, program trace analysis for parallelization optimizations, we study the benefits and limits of a graph-processing framework for a tangible application. The algorithm was implemented using GraphLab and executed on a humble 7-node commodity cluster with input instances up to 40 million vertices and 50 million edges. We propose in this paper an in-depth analysis of the GraphLab system to evaluate its performance and scalability in the context of program trace analysis. The analysis is driven both by traditional and domain-specific metrics and contributes to a better understanding of the system behavior.
Modeling of biotechnological systems is an important research area. The most challenging approach is to build non-linear state space models for these systems. In this work the parameters of a bacterial growth bioproce...
详细信息
Modeling of biotechnological systems is an important research area. The most challenging approach is to build non-linear state space models for these systems. In this work the parameters of a bacterial growth bioprocess are estimated using prediction error method. Prediction error methods are widely used in parameter estimation both for linear and nonlinear models and consist in minimization of the distance between measured and modeled data in a suitable norm. Because these problems are solved using numerical algorithms that are time consuming, in this paper a parallel particle swarm optimization technique is used in order to numerically solve the minimization problem. The algorithm is implemented on a multicore processor and the performances of this approach are presented by numerical simulations.
暂无评论