ppxscal/embedding_network huggingface dataset:
Datapath error detection using hybrid detection approach for high-performance microprocessors
Authors: Yung-Yuan Chen, Kuen-Long Leu, Kun-Chun Chang
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Error detection plays an important role in fault-tolerant computer systems. Two primary parameters concerned for error detection are the coverage and latency. In this paper, a new, hybrid error-detection approach offering a very high coverage with zero detection latency is proposed to protect the data paths of high-performance microprocessors. The feature of zero detection latency is essential to real-time error recovery. The hybrid error-detection approach is to combine the duplication with comparison, triple modular redundancy (TMR) and self-checking mechanisms to construct a formal framework, which allows the error-detection schemes of varying hardware complexity and performance to be incorporated. An experimental 32-bit VLIW core was employed to demonstrate the concept of hybrid detection approach. The hardware implementations in VHDL and simulated fault injection experiments were performed to measure the interesting design metrics, such as hardware overhead, performance degradation and error-detection coverage.
The AMTEx approach in the medical document indexing and retrieval application
Authors: Angelos Hliaoutakis, Kaliope Zervanou, Euripides G. M. Petrakis
Venue: Data Knowledge Engineering (2009)

AMTEx is a medical document indexing method, specifically designed for the automatic indexing of documents in large medical collections, such as MEDLINE, the premier bibliographic database of the US National Library of Medicine (NLM). AMTEx combines MeSH, the terminological thesaurus resource of NLM, with a well-established method for extraction of terminology, the C/NC-value method. The performance evaluation of two AMTEx configurations is measured against the current state-of-the-art, the MetaMap Transfer (MMTx) method in four experiments, using two types of corpora: a subset of MEDLINE (PMC) full document corpus and a subset of MEDLINE (OHSUMED) abstracts, for each of the indexing and retrieval tasks, respectively. The experimental results demonstrate that AMTEx performs better in indexing in 20-50% of the processing time compared to MMTx, while for the retrieval task, AMTEx performs better in the full text (PMC) corpus.
The single-finger keyboard layout problem
Authors: Mauro Dell'Amico, José Carlos Díaz Díaz, Manuel Iori, Roberto Montanari
Venue: Computers and Operations Research (2009)

The problem of designing new keyboard layouts able to improve the typing speed of an average message has been widely considered in the literature of the Ergonomics domain. Empirical tests with users and simple optimization criteria have been used to propose new solutions. On the contrary, very few papers in Operations Research have addressed this optimization problem. In this paper we firstly resume the most relevant problems in keyboard design, enlightening the related Ergonomics aspects. Then we concentrate on keyboards that must be used with a single finger or stylus, like that of portable data assistant, smartphones and other small devices. We show that the underlying optimization problem is a generalization of the well-known quadratic assignment problem (QAP). We recall some of the most effective metaheuristic algorithms for QAP and we propose some non-trivial extensions to the keyboard design problem. We compare the new algorithms through computational experiments with instances obtained from word lists of the English, French, Italian and Spanish languages. We provide on the web benchmark instances for each language and the best solutions we obtained.
Multiresponse optimization of dispatch rules for public bus services
Authors: Shao-Wei Lam, Loon-Ching Tang, Thong-Ngee Goh, Tony Halim
Venue: Computers and Industrial Engineering (2009)

A multiple response optimization approach based on an integrated simulation model and a service reliability measure is proposed for optimizing the dispatch rules of public bus services. The simulation model is based on two novel Markov models for modeling passenger loads and headway fluctuations. In consideration of the importance of passenger loads for bus services of high frequency, a service reliability measure based on the odds of seeing a full bus plying the route is designed. Such a simulation based multiresponse optimization approach can easily consider sampling variations and is scalable to deal with a larger public bus transit system with other objectives, such as minimizing the cost of operations. Practical data collection, analysis and estimation procedures for the load and headway distributions are also presented. A case study based on an actual public bus route in Singapore is used to demonstrate the usefulness of such an integrated simulation framework.
The Simulation of Natural Scenery Based on ObjectARX
Authors: Yun-ping Han, Pei-sheng Liu
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

The simulation of natural scenery is a very important branch of Computer Graphics and has a broad application fields. The traditional Euclidian theory is used in describing the regular-shaped objects. However, the fractal theory is adapted to describe the irregular-shaped objects. This paper mainly introduces how to simulate various kinds of natural scenery to the life in the nature by combining the free surface modeling technology of the traditional Euclidian theory with the Iteration Function System (IFS) of the fractal theory. Firstly, it introduced how to use the free surface (B-spline surface) modeling technology to generate three-dimensional terrains. Secondly, it introduced the algorithms and the implement processes of three-dimensional fractal trees using the Iteration Function System. Finally, it realized a generally practical application of three-dimensional terrain with some three-dimensional trees. This paper mainly used the programming interface language-ObjectARX of AutoCAD and Visual C++ to implement the simulation of natural scenery. The simulative effect is quite reality to the natural scenery, and it has certain validity and practicability to use ObjectARX to simulate the natural scenery.
Eavesdropping of Two-Way Coherent-State Quantum Cryptography via Gaussian Quantum Cloning Machines
Authors: Stefano Pirandola, Stefano Mancini, Seth Lloyd, Samuel L. Braunstein
Venue: Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies (2009)

We consider one of the quantum key distribution protocols recently introduced in Ref. [Pirandola et al., Nature Phys. 4, 726 (2008)]. This protocol consists of a two-way quantum communication between Alice and Bob, where Alice encodes secret information via a random phase-space displacement of a coherent state. In particular, we study its security against a specific class of individual attacks which are based on combinations of Gaussian quantum cloning machines.
Proactive temperature balancing for low cost thermal management in MPSoCs
Authors: Ayse Kivilcim Coskun, Tajana Simunic Rosing, Kenny C. Gross
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Designing thermal management strategies that reduce the impact of hot spots and on-die temperature variations at low performance cost is a very significant challenge for multiprocessor system-on-chips (MPSoCs). In this work, we present a proactive MPSoC thermal management approach, which predicts the future temperature and adjusts the job allocation on the MPSoC to minimize the impact of thermal hot spots and temperature variations without degrading performance. In addition, we implement and compare several reactive and proactive management strategies, and demonstrate that our proactive temperature-aware MPSoC job allocation technique is able to dramatically reduce the adverse effects of temperature at very low performance cost. We show experimental results using a simulator as well as an implementation on an UltraSPARC T1 system.
Defining and Executing P Systems with Structured Data in K
Authors: Traian ŞErbănuţă, Gheorghe Ştefănescu, Grigore Roşu
Venue: Membrane Computing: 9th International Workshop, WMC 2008, Edinburgh, UK, July 28-31, 2008, Revised Selected and Invited Papers (2009)

K is a rewrite-based framework proposed for giving formal executable semantics to programming languages and/or calculi. K departs from other rewrite-based frameworks in two respects: (1) it assumes multisets and lists as builtin, the former modeling parallel features, while the latter sequential ones; and (2) the parallel application of rewriting rules is extended from non-overlapping rules to rules which may overlap, but on parts which are not changed by these rules (may overlap on "read only" parts). This paper shows how P systems and variants can be defined as K (rewrite) systems. This is the first representation of P systems into a rewrite-based framework that captures the behavior (reaction steps) of the original P system step-for-step. In addition to providing a formal executable semantic framework for P systems, the embedding of P systems as K systems also serves as a basis for experimenting with and developing new extensions of P systems, e.g., with structured data. A Maude-based application for executing P systems defined in K has been implemented and experimented with; initial results show computational advantages of using structured objects in P systems.
Syntactic and Semantic Labeling of Hierarchically Organized Document Image Components of Indian Scripts
Authors: Gaurav Harit, Ritu Garg, Santanu Chaudhury
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In this paper we describe our document image analysis system which performs segmentation, content characterization as well as semantic labeling of components. Segmentation is done using white spaces and gives the segmented components arranged in a hierarchy. Semantic labeling is done using domain knowledge which is specified where possible in the form of a document model applicable to a class of documents. The novelty of the system lies in the suite of methods it employs which are capable of handling documents in Indian scripts. We have obtained promising results for semantic segmentation of over 30 categories of documents in Indian scripts.
Use of Content Tags in Managing Advertisements for Online Videos
Authors: Chia-Hsin Huang, H. T. Kung, Chia-Yung Su
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

We consider the problem of managing advertisements (or ads for short) for ad-hoc online videos, such as those generated by end users. We propose a novel ad selection approach based on video tags. We first compute intrinsic values of individual videotags to each ad, called ad-specific weights of tags. The computed weight of a tag indicates the relevance of the tag to a given ad. Then based on the tag weights, we select the ad which is the most relevant to the current video which a user is viewing.Using lab experiments, we show that our tag-based approach is able to select relevant ads. For example, experiments show that 58% of the selected ads are among the top 5 most relevant ads in a pool of 64 candidate ads.
Technical Patterns for Long Term Trusted Archiving
Authors: Jan Porekar, Svetlana aljic, Toma Klobucar, Aljoa Jerman- Blaic
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

An increasingly large number of digital documents, need to be preserved by organizations. Business documents such as various contracts may be of great business value, may only exit in digital form and may need to be preserved for longer periods of times that may span over decades or even centuries. The preservation process should take care of both the integrity and authenticity of digital documents, providing proofs of document authenticity. Solutions providing these security properties do exist in the market. In this paper we look into long term archiving best practices and capture them on a more abstract, generic level, providing a set of core long term archiving security patterns.
Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams
Authors: Min Wan, Gianfranco Ciardo
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

We propose a new type of canonical decision diagrams, which allows a more efficient symbolic state-space generation for general asynchronous systems by allowing on-the-fly extension of the possible state variable domains. After implementing both breadth-first and saturation-based state-space generation with this new data structure in our tool ${\rm S\kern-.11em\raise.39ex\hbox{\sc m}\kern-.22em A\kern-.21em\raise.39ex\hbox{\sc r}\kern-.16emT}$, we are able to exhibit substantial efficiency improvements with respect to traditional "static" decision diagrams. Since our previous works demonstrated that saturation outperforms breadth-first approaches, saturation with this new structure is now arguably the state-of-the-art algorithm for symbolic state-space generation of asynchronous systems.
Exploring Prime Numbers on Your PC and the Internet, Revised edition
Authors: Enoch Haga
Venue:  (2007)

A general introduction to prime numbers with an emphasis on original research into number theory via recreational math. Step by step algorithms are given so that readers may adapt the complete programs included into whatever programming language they wish to use for their own exploration. The book includes directions to prime number sites on the Internet.
On-line learning performance and computer anxiety measure for unemployed adult novices using a grey relation entropy method
Authors: Jyh-Rong Chou, Hung-Cheng Tsai
Venue: Information Processing and Management: an International Journal (2009)

On-line learning is an asynchronous computer-based learning mode that allows learners to learn anytime and anywhere in their own environment using information and communication technology. It can be considered as a way to bridge the digital gap. How a computer novice performs in such virtual and asynchronous learning environments is an interesting issue in human-computer interaction research. This paper presents the results of a study to investigate on-line learning performance and computer anxiety for unemployed adult novices. In this study, we propose a novel idea that integrates the concept of Shannon entropy into a grey relational analysis model. The proposed method was used to measure human information behavior in relation to on-line learning performance and computer anxiety. A total of 115 unemployed adults voluntarily participated in the experimental study. All experimental subjects were divided into groups according to individual differences in gender, age ranges, educational levels, and learning performances. Taking advantage of the grey relation entropy operation, we derived the perceptive correlations among different classified groups in terms of the accessibility of on-line learning and computer anxiety scales, respectively. Through the empirical study, certain on-line learning characteristics were also identified.
The Study of Optimizing Model Based on Data Cluster of Information Fusion of Multiple Parameters
Authors: Jie Sun, Tie-jun Zhang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In complex process of industrial production, it need deal with a large number of data, multiple dimensions, and generate complex data. If the neural network control indirect used, it is easy that lead to some shortcomings, such as inaccurate results and training stage of neural network lack convergence and so forth. In response to these circumstances, the integration model of data optimize processing algorithms is put forward, which is the survival of the fittest each other of dynamic K-means improve cluster algorithm and fuzzy c mean value clustering. Through two clusters to process complex data, in order that obtain accurate cluster quantity and membership. Finally through the simulation of the coal mining product data, the results proof the validity of the model.
A new construction of switched reluctance motor improving magnetic field energy and torque production
Authors: Durmus Uygun, Caner Aküner, Mehmet Yumurtaci
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

This paper is performed to develop a new 8-6 pole switched reluctance motor (SRM) in order to improve the magnetic field energy and torque production; and describes the differences of standart 8/6-pole SRM and that newly developed SRM in dynamic characteristics such as magnetic field energy and torque production. Finite element analysis (FEA) was used to obtain the nonlinear magnetisation data for application to the modelling. As known; finite element method (FEM) has been a powerful tool to solve many complex problems in electromagnetics. For the optimum design of switched reluctance motors, this paper presents the methods and results, which are calculated by the finite element analysis. Thus; it has been possible to determine the effects of different construction methods and motor specifications on the performance. The comparison of the dynamic output performance for each motor provides the basis for the discussion on the relationship of output performance of switched reluctance motor to its physical size [2], construction and excitation method. In this paper; by using FEM, we are going to develop a model of SR motor that is different from the ones developed before, and try to explain the running discriminations between the developed and the known SRMs.
Discrete lot sizing and scheduling using product decomposition into attributes
Authors: C. Gicquel, N. Miègeville, M. Minoux, Y. Dallery
Venue: Computers and Operations Research (2009)

A production planning problem, known as the discrete lot sizing and scheduling problem with sequence-dependent changeover costs, is considered. We propose a new way of modelling the production system based on the use of a multi-attribute product structure encountered in many industrial situations. The basic idea is to describe the products as combinations of physical attributes and to exploit this description to reduce the size of the mixed-integer program to be solved. The results of our computational experiments show the practical usefulness of the proposed formulation which leads to significantly improved efficiency in the solution process.
Brief paper: An adaptive optimization scheme with satisfactory transient performance
Authors: Elias B. Kosmatopoulos
Venue: Automatica (Journal of IFAC) (2009)

Adaptive optimization (AO) schemes based on stochastic approximation principles such as the Random Directions Kiefer-Wolfowitz (RDKW), the Simultaneous Perturbation Stochastic Approximation (SPSA) and the Adaptive Fine-Tuning (AFT) algorithms possess the serious disadvantage of not guaranteeing satisfactory transient behavior due to their requirement for using random or random-like perturbations of the parameter vector. The use of random or random-like perturbations may lead to particularly large values of the objective function, which may result to severe poor performance or stability problems when these methods are applied to closed-loop controller optimization applications. In this paper, we introduce and analyze a new algorithm for alleviating this problem. Mathematical analysis establishes satisfactory transient performance and convergence of the proposed scheme under a general set of assumptions. Application of the proposed scheme to the adaptive optimization of a large-scale, complex control system demonstrates the efficiency of the proposed scheme.
Optimal monitoring in multi-channel multi-radio wireless mesh networks
Authors: Dong-Hoon Shin, Saurabh Bagchi
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh routers in WMNs typically use multiple wireless channels to enhance the spatial-reuse of frequency bands, often with multiple radios per node. Due to the cooperative nature of WMNs, they are susceptible to many attacks that cannot be defeated by using traditional cryptographic mechanisms of authentication or encryption alone. A solution approach commonly used for defending against such attacks is behavior-based detection in which some nodes overhear communication in their neighborhood to determine if the behavior by a neighbor is legitimate. It has been proposed to use specialized monitoring nodes deployed strategically throughout the network for performing such detection. The problem that arises is where to deploy these monitoring nodes, how to minimize their number, and which channels to tune their radios to, such that the maximum part of the network can be covered. This problem has been solved for single channel networks by a greedy approximation algorithm since the exact solution is NP-hard. The greedy algorithm achieves the best performance, in terms of the worst case, possible among all polynomial-time algorithms provided that P!=NP. In this paper, we solve the problem for multi-channel multi-radio WMNs. The intuitive extension of the greedy algorithm destroys the property of best performance. Instead, we formulate the problem as an integer linear program, solve its linear program relaxation, and then use two rounding techniques that we develop by adapting existing rounding schemes. We thereby present two approximation algorithms. The first, computationally-light algorithm, called probabilistic rounding algorithm gives an expected best performance in the worst case. The second, called deterministic rounding algorithm achieves the best worst-case performance in a deterministic manner. To evaluate how the three algorithms perform in practice, we simulate them in random networks and scale-free networks.
Flexible multi-mode embedded floating-point unit for field programmable gate arrays
Authors: Yee Jern Chong, Sri Parameswaran
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

Performance of Field Programmable Gate Arrays (FPGAs) used for floating-point applications is poor due to the complexity of floating-point arithmetic. Implementing floating-point units on FPGAs consume a large amount of resources. This makes FPGAs less attractive for use in floating-point intensive applications. Therefore, there is a need for embedded floating-point units (FPUs) in FPGAs. However, if unutilized, embedded FPUs waste space on the FPGA die. To overcome this issue, we propose a flexible multi-mode embedded FPU for FPGAs that can be configured to perform a wide range of operations. The floating-point adder and multiplier in our embedded FPU can each be configured to perform one double-precision operation or two single-precision operations in parallel. To increase flexibility further, access to the large integer multiplier, adder and shifters in the FPU is provided. Benchmark circuits were implemented on both a standard Xilinx Virtex-II FPGA and on our FPGA with embedded FPU blocks. The results using our embedded FPUs showed a mean area improvement of 5.2 times and a mean delay improvement of 5.8 times for the double-precision benchmarks, and a mean area improvement of 4.4 times and a mean delay improvement of 4.2 times for the single-precision benchmarks.