A study on flowshop scheduling problem combining Taguchi experimental design and genetic algorithm

As genetic algorithm parameters vary depending on different problem types when applying genetic algorithm to reach global optimum, appropriate design value selection has significant impact on the efficiency of genetic algorithm. However, most users adjust parameters manually based on the reference values of previous literature. Such trial-and-error method is time-consuming, ineffective, and often it could not locate the optimal combination. Therefore, in flowshop scheduling problems, this research anticipates to complete optimal parameter combination design in genetic algorithm using Taguchi experimental design. According to the research results, different ways of producing initial solution have significant influence on this research topic. Consequently, confirmation experiment is conducted using the optimal parameter combination obtained from the research results. It is found that the predicted value of signal-to-noise ratio (S/N ratio) and its actual value exists deviation of 0.238%, indicating repetitiveness and robustness of the obtained parameter combination. Hence, this research method can effectively reduce time spent on parameter design using genetic algorithm and increase efficiency of algorithm.     

Design space exploration of reliable networked embedded systems

In this paper, a new methodology is presented for topology optimization of networked embedded systems as they occur in automotive and avionic systems as well as wireless sensor networks. By introducing a model which is (1) suitable for heterogeneous networks with different communication bandwidths, (2) modeling of routing restrictions, and (3) flexible binding of tasks onto processors, current design issues of networked embedded systems can be investigated. On the basis of this model, the presented methodology firstly allocates the required resources which can be communication links as well as computational nodes and secondly binds the functionality onto the nodes and the data dependencies onto the links such that no routing restrictions will be violated or capacities on communication links will be exceeded. Due to the often error-prone communication in networks, we allow for routing each data dependency over multiple routes in the networks. With this strategy, our methodology is able to increase the reliability of the entire system. This reliability analysis is based on Binary Decision Diagrams (BDDs) and is integrated in our multi-objective design space exploration. By applying Evolutionary Algorithms, we are able to consider multiple objectives simultaneously during the optimization process and allow for a subsequent unbiased decision making. An experimental evaluation as well as a demonstration of a case study from the field of automotive electronics will show the applicability of the presented approach.     

The language of quarterly reports as an indicator of change in the company’s financial status

This paper adopts a multi-methodological approach to information systems research in order to produce new information through data mining. This approach is particularly suitable for mining material that consists of both qualitative and quantitative information. The contents of quarterly reports from three telecommunications companies were compared. The study focused on the years 2000–2001, a period of economic decline for many IT companies. The central quantitative data, reflected by seven financial ratios, were visualised using self-organising maps. The qualitative data, consisting of the textual contents of the reports, were visualised using collocational networks; these showed the relationships between the central concepts in the texts. As the visualisations of the contents were compared, certain patterns could be found. The results seemed to suggest that changes in the networks indicated future changes in the self-organising maps. In the cases studied, a change in the textual data usually indicated a change in the financial data in the following quarter. This may be a consequence of the fact that the texts reflected the plans and future expectations of management, whereas the financial ratios reflected the current financial situation of the company.     

An objective comparison of the cost effectiveness of three testing methods

Branch testing is a well established method for exercising software. JJ-path testing, whilst employed by some practitioners, is less popular, and the testing of JJ-pairs finds few adherents. In this paper an objective, practical study of the cost-effectiveness of these three testing methods is reported. The effectiveness of each method is assessed, in the presence of infeasible paths, not only on its ability to cover the specific structural element of code that it targets, but also on its ability to cover the structural elements targeted by the other two methods – the collateral coverage it achieves. The assessment is based on the results derived from experiments in which each of the three methods is applied to 35 units of program code.     

Forming consensus in the networks of knowledge

Information granules, such as e.g., fuzzy sets, capture essential knowledge about data and the key dependencies between them. Quite commonly, we may envision that information granules (fuzzy sets) have become a result of fuzzy clustering and therefore could be succinctly represented in the form of some fuzzy partition matrices. Interestingly, the same data set could be represented from various standpoints and this multifaceted view yields a collection of different partition matrices being reflective of the higher-order granular knowledge about the data. The levels of specificity of the clusters the data are organized into could be quite different—the larger the number of clusters, the more detailed insight into the structure of data becomes available. Given the granularity of the resulting constructs (rather than plain data themselves), one could view a collection of partition matrices as a certain type of a network of knowledge. Considering a variety of sources of knowledge encountered across the network, we are interested in forming consensus between them. In a nutshell, this leads to the construction of certain fuzzy partition matrices which “reconcile” the knowledge captured by the individual partition matrices. Given that the granularity of the sources of knowledge under consideration could vary quite substantially, we develop a unified optimization perspective by introducing fuzzy proximity matrices that are induced by the corresponding partition matrices. In the sequel, the optimization is realized on a basis of these proximity matrices. We offer a detailed algorithm and illustrate its performance using a series of numeric experiments.     

Automatic generation of explanations: AGE

Explaining how engineering devices work is important to students, engineers, and operators. In general, machine generated explanations have been produced from a particular perspective. This paper introduces a system called automatic generation of explanations (AGE) capable of generating causal, behavioral, and functional explanations of physical devices in natural language. AGE explanations can involve different user selected state variables at different abstraction levels. AGE uses a library of engineering components as building blocks. Each component is associated with a qualitative model, information about the meaning of state variables and their possible values, information about substances, and information about the different functions each component can perform. AGE uses: (i) a compositional modeling approach to construct large qualitative models, (ii) causal analysis to build a causal dependency graph, (iii) a novel qualitative simulation approach to efficiently obtain the system's behavior on large systems, and (iv) decomposition analysis to automatically divide large devices into smaller subsystems. AGE effectiveness is demonstrated with different devices that range from a simple water tank to an industrial chemical plant.     

A two-pass approach for handling out-of-vocabulary words in a large vocabulary recognition task

This paper addresses the problem of recognizing a vocabulary of over 50,000 city names in a telephone access spoken dialogue system. We adopt a two-stage framework in which only major cities are represented in the first stage lexicon. We rely on an unknown word model encoded as a phone loop to detect OOV city names (referred to as ‘rare city’ names). We use SpeM, a tool that can extract words and word-initial cohorts from phone graphs from a large fallback lexicon, to provide an N-best list of promising city name hypotheses on the basis of the phone graph corresponding to the OOV. This N-best list is then inserted into the second stage lexicon for a subsequent recognition pass.Experiments were conducted on a set of spontaneous telephone-quality utterances; each containing one rare city name. It appeared that SpeM was able to include nearly 75% of the correct city names in an N-best hypothesis list of 3000 city names. With the names found by SpeM to extend the lexicon of the second stage recognizer, a word accuracy of 77.3% could be obtained. The best one-stage system yielded a word accuracy of 72.6%. The absolute number of correctly recognized rare city names almost doubled, from 62 for the best one-stage system to 102 for the best two-stage system. However, even the best two-stage system recognized only about one-third of the rare city names retrieved by SpeM. The paper discusses ways for improving the overall performance in the context of an application.     

Mean value analysis of closed queueing networks with Erlang service time distributions

The classical mean value analysis approach is extended to single class closed queueing networks containing Erlang service time distributions and FCFS scheduling disciplines. A new formula for the mean residence time of jobs is derived. Each iteration provides self-checks for validity, and is repeated whenever invalid results are detected. On the average, the solutions obtained vary by less than five percent from their respective simulation results.