A hybrid multi-criteria decision-making model for firms competence evaluation

In this paper, we present a hybrid multi-criteria decision-making (MCDM) model to evaluate the competence of the firms. According to the competence-based theory reveals that firm competencies are recognized from exclusive and unique capabilities that each firm enjoy in marketplace and are tightly intertwined within different business functions throughout the company. Therefore, competence in the firm is a composite of various attributes. Among them many intangible and tangible attributes are difficult to measure. In order to overcome the issue, we invite fuzzy set theory into the measurement of performance. In this paper first we calculate the weight of each criterion through adaptive analytic hierarchy process (AHP) approach (A³) method, and then we appraise the performance of firms via linguistic variables which are expressed as trapezoidal fuzzy numbers. In the next step we transform these fuzzy numbers into interval data by means of α-cut. Then considering different values for α we rank the firms through TOPSIS method with interval data. Since there are different ranks for different α values, we apply linear assignment method to obtain final rank for alternatives.     

On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation

Block sorting in the Burrows-Wheeler transformation is to sort all of the n circular shifts of a string of length n lexicographically. We introduce a notion called the width of a sequence of n strings of length n and show that the values of widths are very different between the two types of sequences of strings; (1) a sequence of n randomly generated strings of length n, and (2) the sequence of n circular shifts of a randomly generated string of length n.     

Univariate marginal distribution algorithm dynamics for a class of parametric functions with unitation constraints

In this paper, we introduce a mathematical model for analyzing the dynamics of the univariate marginal distribution algorithm (UMDA) for a class of parametric functions with isolated global optima. We prove a number of results that are used to model the evolution of UMDA probability distributions for this class of functions. We show that a theoretical analysis can assess the effect of the function parameters on the convergence and rate of convergence of UMDA. We also introduce for the first time a long string limit analysis of UMDA. Finally, we relate the results to ongoing research on the application of the estimation of distribution algorithms for problems with unitation constraints.     

Flash memory efficient LTL model checking

As the capacity and speed of flash memories in form of solid state disks grow, they are becoming a practical alternative for standard magnetic drives. Currently, most solid-state disks are based on NAND technology and much faster than magnetic disks in random reads, while in random writes they are generally not.So far, large-scale LTL model checking algorithms have been designed to employ external memory optimized for magnetic disks. We propose algorithms optimized for flash memory access. In contrast to approaches relying on the delayed detection of duplicate states, in this work, we design and exploit appropriate hash functions to re-invent immediate duplicate detection.For flash memory efficient on-the-fly LTL model checking, which aims at finding any counter-example to the specified LTL property, we study hash functions adapted to the two-level hierarchy of RAM and flash memory. For flash memory efficient off-line LTL model checking, which aims at generating a minimal counterexample and scans the entire state space at least once, we analyze the effect of outsourcing a memory-based perfect hash function from RAM to flash memory.Since the characteristics of flash memories are different to magnetic hard disks, the existing I/O complexity model is no longer sufficient. Therefore, we provide an extended model for the computation of the I/O complexity adapted to flash memories that has a better fit to the observed behavior of our algorithms.     

Decision support for Cybersecurity risk planning

Security countermeasures help ensure the confidentiality, availability, and integrity of information systems by preventing or mitigating asset losses from Cybersecurity attacks. Due to uncertainty, the financial impact of threats attacking assets is often difficult to measure quantitatively, and thus it is difficult to prescribe which countermeasures to employ. In this research, we describe a decision support system for calculating the uncertain risk faced by an organization under cyber attack as a function of uncertain threat rates, countermeasure costs, and impacts on its assets. The system uses a genetic algorithm to search for the best combination of countermeasures, allowing the user to determine the preferred tradeoff between the cost of the portfolio and resulting risk. Data collected from manufacturing firms provide an example of results under realistic input conditions.     

The use of genetic algorithms for assessment of high voltage fields

There are several numerical methods for calculation of electric fields but they need some sort of experience and trial and error to get the correct solution. A genetic algorithm (GA) based approach is used to eliminate the need for the experience and to save time and effort spent in the trial and error. Two enhancement techniques, namely, Refreshment Method and No-Twins Method, are used with the GA operators to improve the performance of the GA in assessment of high voltage fields. The performance of these two enhancement techniques has been studied for computing the electrostatic field in high voltage applications.     

Genetic adaptive state estimation

A genetic algorithm (GA) uses the principles of evolution, natural selection, and genetics to offer a method for parallel search of complex spaces. This paper describes a GA that can perform on-line adaptive state estimation for linear and nonlinear systems. First, it shows how to construct a genetic adaptive state estimator where a GA evolves the model in a state estimator in real time so that the state estimation error is driven to zero. Next, several examples are used to illustrate the operation and performance of the genetic adaptive state estimator. Its performance is compared to that of the conventional adaptive Luenberger observer for two linear system examples. Next, a genetic adaptive state estimator is used to predict when surge and stall occur in a nonlinear jet engine. Our main conclusion is that the genetic adaptive state estimator has the potential to offer higher performance estimators for nonlinear systems over current methods.     

基于矢量模型的语音线性预测研究

研究语音参数线性预测的并行处理问题。通过把语音源序列的相邻样本分组能够构成一个均方差平稳的语音向量自回归序列,在Hilbert空间中运用正交投影原理导出具有高度并行处理能力的一预测编码策略,由此可推出参数线性预测的并行处理自适应算法。同传统格型算法相比,这种算法的计算复杂度及存贮量有明显改善。最后通过仿真运算检测了算法的性能。     

Effective on-line algorithms for reliable due date quotation and large-scale scheduling

We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job’s arrival time, a due date must be quoted for the job, and the job must complete processing before its quoted due date. The objective is to minimize the sum (or average) of quoted due dates, or equivalently, the average quoted lead time. In this paper, we propose on-line heuristics for this problem and characterize the conditions under which these heuristics are asymptotically optimal. Computational testing further demonstrates the relative effectiveness of these heuristics under various conditions. Both authors made equal contributions to this paper and are listed in alphabetical order.     

Towards the next generation of artificial neural networks for civil engineering

The purpose of this paper is to stimulate interest within the civil engineering research community for developing the next generation of applied artificial neural networks. In particular, it identifies what the next generation of these devices needs to achieve, and provides direction in terms of how their development may proceed. An analysis of the current situation indicates that progress in the development of artificial neural network applications has largely stagnated. Suggestions are made for advancing the field to the next level of sophistication and application, using genetic algorithms and related techniques. It is shown that this approach will require the design of some very sophisticated genetic coding mechanisms in order to develop the required higher-order network structures, and will utilize development mechanisms observed in nature such as growth, self-organization, and multi-stage objective functions. The capabilities of such an approach and the way in which they can be achieved are explored with reference to the problems of: (a) determining truck attributes from the strain envelopes they induce in structural members when crossing a bridge, and; (b) developing a decision support system for dynamic control of industrialized manufacturing of houses.