ppxscal/embedding_network huggingface dataset:
Estimating the latent time of fault detection in finite automaton tested in real time
Authors: R. Goot, I. Levin
Venue: Automation and Remote Control (2008)

The notions of potential and real latent times of fault detection in finite automata were introduced. The potential latent time is the minimal theoretical time of automaton fault detection, the real time is defined as the time of fault manifestation at a certain point. A method for determination of the statistical characteristics of both times for the automaton tested in the course of its real operation was proposed. It is based on selection of the trajectories of the Markov chain describing behavior of the operable and faulty automata. Additionally, a method for determination of the upper bound of the mean latent time in the case of limited information about the automaton characteristics was proposed.
Vulnerability Analysis for X86 Executables Using Genetic Algorithm and Fuzzing
Authors: Guang-Hong Liu, Gang Wu, Zheng Tao, Jian-Mei Shuai, Zhuo-Chun Tang
Venue: Proceedings of the 2008 Third International Conference on Convergence and Hybrid Information Technology - Volume 02 (2008)

Fuzzing was successfully used to discover security bugs in popular programs, though released without source code. It becomes a major tool in security analysis, but needs large input space, ineffective. This paper presents a new method for the identification of vulnerabilities in executable program called GAFuzzing (Genetic Algorithm Fuzzing), which combines static and dynamic analysis to extend random Fuzzing. First, it uses static analysis to obtain the structural behavior, interface and interest region of code, then formally describes test requirement. Second, it uses genetic algorithm to intelligently direct test data generation and improve the testing objective. Unlike many software testing tools, our implementation analyzes the executables without source code directly. Our evaluation shows that GAFuzzing is superior to random Fuzzing for vulnerabilty analysis.
Conjoint analysis for luxury brand outlet malls in Korea with consideration of customer lifetime value
Authors: Gyeongmu Kim, Angela Kim, So Young Sohn
Venue: Expert Systems with Applications: An International Journal (2009)

As Asian economies have grown rapidly, Asia has become a new leading market of the luxury goods industry. This paper used conjoint analysis (CA) for the optimal design of a luxury brand outlet mall to maximize the customer lifetime value (CLV). This approach complements a simple CA by considering CLV. The proposed approach is then applied to designing a suburban luxury brand outlet mall in Korea, a new concept to Korea. The results indicate that the optimal design for the outlet mall is the medieval European-style mall, with the linkage to Natural Tourism, which consists of the restaurants with delicious food and the stores with similar ratio between masstige and luxury brands.
Modeling on triangulations with geodesic curves
Authors: Dimas Mart&#x00ed;nez Morera, Paulo Cezar Carvalho, Luiz Velho
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

This paper discusses the problem of modeling on triangulated surfaces with geodesic curves. In the first part of the paper we define a new class of curves, called geodesic B&#x00e9;zier curves, that are suitable for modeling on manifold triangulations. As a natural generalization of B&#x00e9;zier curves, the new curves are as smooth as possible. In the second part we discuss the construction of C 0 and C 1 piecewise B&#x00e9;zier splines. We also describe how to perform editing operations, such as trimming, using these curves. Special care is taken to achieve interactive rates for modeling tasks. The third part is devoted to the definition and study of convex sets on triangulated surfaces. We derive the convex hull property of geodesic B&#x00e9;zier curves.
New robust and efficient ant colony algorithms: Using new interpretation of local updating process
Authors: Hossein Miar Naimi, Nima Taherinejad
Venue: Expert Systems with Applications: An International Journal (2009)

Two new efficient and robust ant colony algorithms are proposed. These algorithms contain two new and reasonable local updating rules that make them more efficient and robust. While going forward from start point to end point of a tour, the ants' freedom to make local changes on links is gradually restricted. This idea is implemented in two different forms, leaving two new algorithms, KCC-Ants and ELU-Ants. To evaluate the new algorithms, we run them along with the old one on the standard TSP library, where in almost all of the cases the proposed algorithms had better solutions and even for some problem samples found the optimal solution.
Interference aware cooperative routing for wireless ad hoc networks
Authors: Hasan Mahmood, Cristina Comaniciu
Venue: Ad Hoc Networks (2009)

In this paper, we propose a cooperative approach for routing in wireless ad hoc networks. Our solution improves the interference distribution in the network, with an immediate positive impact on the throughput performance and energy efficiency. In determining new routes, we consider not only the cost associated with the current route, but also the potential interference impact of the route on the neighboring nodes. We use this cooperative approach to determine routes for CDMA ad hoc networks, which are known to be severely limited in performance by the near-far effect. Our simulation results using cooperative routing show an improvement in throughput of up to 60% compared to the classic minimum energy routing approach. This improvement is achieved at the expense of only a slight increase in the average energy per bit transmission for an end-to-end path.
Development and implementation of a web-based system to study children with malnutrition
Authors: Sharifah-Mastura Syed-Mohamad
Venue: Computer Methods and Programs in Biomedicine (2009)

Objectives: To develop and implement a collective web-based system to monitor child growth in order to study children with malnutrition. Method: The system was developed using prototyping system development methodology. The implementation was carried out using open-source technologies that include Apache Web Server, PHP scripting, and MySQL database management system. There were four datasets collected by the system: demographic data, measurement data, parent data, and food program data. The system was designed to be used by two groups of users, the clinics and the researchers. Results: The Growth Monitor System was successfully developed and used for the study, ''Geoinformation System (GIS) and Remote Sensing in Mapping of Children with Malnutrition.'' Data collection was implemented in public clinics from two districts in the state of Kelantan, Malaysia. Conclusions: The development of an integrated web-based system, Growth Monitor, for the study of children with malnutrition has been achieved. This system can be expanded to new partners who are involved in the study of children with malnutrition in other parts of Malaysia as well as other countries.
Developing a Concurrent Service Orchestration Engine Based on Event-Driven Architecture
Authors: Wei Chen, Jun Wei, Guoquan Wu, Xiaoqiang Qiao
Venue: Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems: (2008)

WS-BPEL (BPEL for short) represents the de-factor standard for the Web services composition. Service orchestration engines, also named BPEL engines, are in charge of executing and managing the workflow specified in BPEL. As a kind of server application, high performance under massive concurrency is necessary to design a scalable BPEL engine, and it is a challenging problem to implement a correct and highly concurrent BPEL engine. We propose an approach based on event-driven architecture to design BPEL engine and introduce the FSM (finite state machines) to describe the semantics of the BPEL process. We also test our BPEL engine and prove the improvement in capability of handling the massive concurrency comparing to the one based on the thread-based concurrent paradigm.
Computational Intelligence techniques for Web personalization
Authors: G. Castellano A. M. Fanelli M. A. Torsello
Venue: Web Intelligence and Agent Systems (2008)

Computational Intelligence (CI) paradigms reveal to be potential tools to face under the Web uncertainty. In particular, CI techniques may be properly exploited to handle Web usage data and develop Web-based applications tailored on users preferences. The main rationale behind this success is the synergy resulting from CI components, such as fuzzy logic, neural networks and genetic algorithms. In fact, rather than being competitive, each of these computing paradigms provides complementary reasoning and searching methods that allow the use of domain knowledge and empirical data to solve complex problems. This paper focuses on the major Computational Intelligent combinations applied in the context of Web personalization, by providing different examples of intelligent systems which have been designed to provide Web users with the information they search, without expecting them to ask for it explicitly. In particular, this paper emphasizes the suitability of hybrid schemes deriving from the profitable combination of different CI methodologies for the development of effective Web personalization systems.
Colour classification of rubberwood boards for fingerjoint manufacturing using a SOM neural network and image processing
Authors: W. Kurdthongmee
Venue: Computers and Electronics in Agriculture (2008)

In order to produce a high quality rubberwood fingerjoint with highly uniform colour, wood boards of naturally different shades and colours are required to be elaborately classified and grouped. Within each group, wood boards of comparable shade and colour are then cut and joined to form a highly uniform shade and colour fingerjoint of the required dimensions. Currently, many manufacturers in Thailand still rely heavily on a manual classification process by an expert. In this paper, an automatic approach based on a combination of an image processing technique and an artificial neural network is presented. The Kohonen self organizing map (SOM) is selected and used for training with modified histogram data from the hue colour component of the rubberwood boards' images. The outcome SOM is then used to classify an unknown colour rubberwood board with a novel colour group identification algorithm. The overall approach has proved effective in classifying the unknown colour of boards with as high as 95% accuracy without human intervention. In many cases, the approach provides invaluable information to guide an operator to easily classify the remaining 5%.
Adapting Commit Protocols for Large-Scale and Dynamic Distributed Applications
Authors: Pawel Jurczyk, Li Xiong
Venue: Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems: (2008)

The continued advances in distributed data intensive applications have formed an increasing demand for distributed commit protocols that are adaptive to large scale and dynamic nature of the applications to guarantee data consistency and integrity. Well known two-phase commit protocol and three-phase commit protocol and their variants do not provide scalability and flexibility desired for a wide range of applications with potentially different requirements on consistency and efficiency. In this paper, we present an adaptation of three-phase commit protocol for dynamic and scalable distributed systems. The protocol is not only resistant to dynamic network and node failures but also provides good scalability. Most importantly, it offers a set of adjustable parameters for a desired level of consistency at lowest cost depending on specific requirements of different applications.
Promoting tolerance for delay tolerant network research
Authors: Jon Crowcroft, Eiko Yoneki, Pan Hui, Tristan Henderson
Venue: ACM SIGCOMM Computer Communication Review (2008)

So what is all this DTN research about anyway? Sceptics ask: "Why are there no DTN applications?", or "Why is DTN performance so miserable?" This article attempts to address some of these complaints. We present suggestions of expectations for applications, and metrics for performance, which suggest a more tolerant view of research in the area.
Progress in the dual simplex algorithm for solving large scale LP problems: techniques for a fast and stable implementation
Authors: Achim Koberstein
Venue: Computational Optimization and Applications (2008)

During the last fifteen years the dual simplex method has become a strong contender in solving large scale LP problems. However, the lack of descriptions of important implementation details in the research literature has led to a great performance gap between open-source research codes and commercial LP-systems. In this paper we present the mathematical algorithms, computational techniques and implementation details, which are the key factors for our dual simplex code to close this gap. We describe how to exploit hyper-sparsity in the dual simplex algorithm. Furthermore, we give a conceptual integration of Harris' ratio test, bound flipping and cost shifting techniques and describe a sophisticated and efficient implementation. We also address important issues of the implementation of dual steepest edge pricing. Finally we show on a large set of practical large scale LP problems, that our dual simplex code outperforms the best existing open-source and research codes and is competitive to the leading commercial LP-systems on our most difficult test problems.
An Analysis of Entries in the First TAC Market Design Competition
Authors: Jinzhong Niu, Kai Cai, Peter McBurney, Simon Parsons
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 (2008)

This paper presents an analysis of entries in the first TAC Market Design Competition final that compares the entries across several scenarios. The analysis complements previous work analyzing the 2007 competition, demonstrating some vulnerabilities of entries that placed highly in the competition. The paper also suggests a simple strategy that would have performed well.
On the topological repeatability of experiments with wireless multihop networks
Authors: Wolfgang Kiess, Andreas Tarp, Martin Mauve
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

Repeatability has most often been neglected in experiments with wireless multihop networks. In this paper, we propose to consider repeatability in a coarse-grained fashion on a topological level. For this, a metric for comparing the similarity of topologies in static and mobile setups is presented and used to examine the level of repeatability achievable in such experiments. This metric is able to classify experiments according to the presence or absence of interference and to changes in the behavior of mobile nodes. It can be used to identify experimental runs where application layer performance is influenced by topological effects.
A performance evaluation of a coverage compensation based algorithm for wireless sensor networks
Authors: Xin Fei, Azzedine Boukerche
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

Recent years, coverage has been widely investigated as one of the fundamental quality measurements of wireless sensor networks. In order to maintaining the coverage while saving energy of networks, algorithms have been developed to keep a minimum cover set of sensors working and turn off the redundant sensors. Generally, centralized algorithms can give a better result than distributed algorithms in terms of the number of active sensors. However, the heavy computation requirements and message overhead for collecting geographical location data keep centralized algorithms out of most distributed scenarios. In this article, Based on the idea of coverage compensation a distributed node partition algorithm for random deployments is presented to generate a minimum cover set by using the optimal node distributions created by the centralized algorithms such as GA. A Genetic Algorithm for coverage is proposed too to demonstrate how an optimal coverage node distribution created by GA can be used in a distributed scenario. Ours works are simulated on JGAP and NS2. The simulation result shows that our partition algorithm based on coverage compensation can achieve the same performance as OCOPS in terms of coverage and number of active sensors while using less control messages.
Perception-based filtering for MMOGs
Authors: Souad El Merhebi, Jean-Christophe Hoelt, Patrice Torguet, Jean-Pierre Jessel
Venue: International Journal of Computer Games Technology (2008)

Online games have exploded in the last few years. These games face several problems linked to scalability and interactivity. In fact, online games should provide a quick feedback of users' interactions as well as a coherent view of the shared world. However, the search for enhanced scalability dramatically increases message exchange. Such an increase consumes processing power and bandwidth, and thus limits interactivity, consistency, and scalability. To reduce the rate of message exchange, distributed virtual environment systems use filtering techniques such as interest management that filters messages according to users' interests in the world. These interests are influenced by perceptual facts which we study in this paper in order to build upon them a perception-based filtering technique. This technique satisfies users' needs by precisely providing an exact filtering which is more efficient than other techniques.
Design Methodology for Throughput Optimum Architectures of Hash Algorithms of the MD4-class
Authors: Yong Ki Lee, Herwin Chan, Ingrid Verbauwhede
Venue: Journal of Signal Processing Systems (2008)

In this paper we propose an architecture design methodology to optimize the throughput of MD4-based hash algorithms. The proposed methodology includes an iteration bound analysis of hash algorithms, which is the theoretical delay limit, and Data Flow Graph transformations to achieve the iteration bound. We applied the methodology to some MD4-based hash algorithms such as SHA1, MD5 and RIPEMD-160. Since SHA1 is the algorithm which requires all the techniques we show, we also synthesized the transformed SHA1 algorithm in a 0.18 μm CMOS technology in order to verify its correctness and its achievement of high throughput. To the best of our knowledge, the proposed SHA1 architecture is the first to achieve the theoretical throughput optimum beating all previously published results. Though we demonstrate a limited number of examples, this design methodology can be applied to any other MD4-based hash algorithm.
Current issues in high performance computing I/O architectures and systems
Authors: Steve C. Chiu
Venue: The Journal of Supercomputing (2008)

The abundance of parallel and distributed computing platforms, such as MPP, SMP, and the Beowulf clusters, to name just a few, has added many more possibilities and challenges to high performance computing (HPC), parallel I/O, mass data storage, scalable architectures, and large-scale simulations, which traditionally belong to the realm of custom-tailored parallel systems. The intent of this special issue is to discuss problems and solutions, to identify new issues, and to help shape future research directions in these areas. From these perspectives, this special issue addresses the problems encountered at the hardware, architectural, and application levels, while providing conceptual as well as empirical treatments to the current issues in high performance computing, and the I/O architectures and systems utilized therein.
Hybrid approach using case-based reasoning and rule-based reasoning for domain independent clinical decision support in ICU
Authors: K. Ashwin Kumar, Yashwardhan Singh, Sudip Sanyal
Venue: Expert Systems with Applications: An International Journal (2009)

This paper presents a hybrid approach of case-based reasoning and rule-based reasoning, as an alternative to the purely rule-based method, to build a clinical decision support system for ICU. This enables the system to tackle problems like high complexity, low experienced new staff and changing medical conditions. The purely rule-based method has its limitations since it requires explicit knowledge of the details of each domain of ICU, such as cardiac domain hence takes years to build knowledge base. Case-based reasoning uses knowledge in the form of specific cases to solve a new problem, and the solution is based on the similarities between the new problem and the available cases. This paper presents a case-based reasoning and rule-based reasoning based model which can provide clinical decision support for all domains of ICU unlike rule-based inference models which are highly domain knowledge specific. Experiments with real ICU data as well as simulated data clearly demonstrate the efficacy of the proposed method.
Research on two different mathematical theories on control
Authors: Qing-E Wu, Tuo Wang, Xue-Min Pang, Yong-Xuan Huang, Ji-Sheng Li
Venue: Journal of Computational and Applied Mathematics (2008)

With a brand-new theory, this paper not only provides the differences of attributes in concept, formula expression and function type between fuzzy rough sets and probability statistics, but also introduces their differences in algorithms on target control for better solving the control problem. Some new definitions and theorems concerning fuzzy rough sets and probability statistics are given, but this paper mainly makes a comparison of two control algorithms for the target tracking. The simulation results show that the comprehensive performance of the fuzzy rough sets algorithm is better than that of the probability statistics algorithm, but its control effect is not as good as that of the latter on multisensor target control. Finally, some problems concerning the combination of fuzzy rough sets and the probability statistics phenomenon to be solved and development trends are discussed. By these investigations, we can choose the optimal control algorithms for accomplishing better target control.
Validation of a Rapid Thermal Processing model in steady-state
Authors: P. O. Logerais, D. Chapron, J. Garnier, A. Bouteville
Venue: Microelectronic Engineering (2008)

Rapid Thermal Processing (RTP) is widely used in advanced semiconductor manufacturing. The present work deals with the heat transfer from infrared lamps to the silicon wafer in a commercial RTP equipment. Both numerical and experimental approaches are considered. For numerical purposes, the RTP system is modelled in two (2D) and three dimensions (3D). Calculations are performed in steady-state. The computational fluid dynamics method (CFD) is used for solving the mass and heat conservation equations. The radiative heat transfer equation is solved with the Monte Carlo method. In order to validate these models, measurements of the wafer temperature are realized for five electric power values supplied to the infrared lamps. The experimental wafer temperature profiles are in good agreement with the numerically calculated ones. Moreover, a confrontation between the experimental temperature of the infrared lamp filaments evaluated from the Ohm law and the one used in the numerical calculations shows a good agreement with the 3D model. The slight difference observed with the 2D model is explained. So the numerical simulations are fully validated. Two relations are established in order to predict the power which has to be applied to infrared lamps to obtain the required wafer temperature.