ppxscal/embedding_network huggingface dataset:
Compiler-managed register file protection for energy-efficient soft error reduction
Authors: Jongeun Lee, Aviral Shrivastava
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

For embedded systems where neither energy nor reliability can be easily sacrificed, we present an energy efficient soft error protection scheme for register files (RF). Unlike previous approaches, our method explicitly optimizes for energy efficiency and exploits the fundamental tradeoff between reliability and energy. While even simple compiler-managed RF protection scheme is more energy efficient than hardware schemes, this work formulates and solves further compiler optimization problems to significantly enhance the energy efficiency of RF protection schemes by an additional 24%.
A Generative Probabilistic Model for Multi-label Classification
Authors: Hongning Wang, Minlie Huang, Xiaoyan Zhu
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Traditional discriminative classification method makes little attempt to reveal the probabilistic structure and the correlation within both input and output spaces. In the scenario of multi-label classification, most of the classifiers simply assume the predefined classes are independently distributed, which would definitely hinder the classification performance when there are intrinsic correlations between the classes. In this article, we propose a generative probabilistic model, the Correlated Labeling Model (CoL Model), to formulate the correlation between different classes. The CoL model is presented to capture the correlation between classes and the underlying structures via the latent random variables in a supervised manner. We develop a variational procedure to approximate the posterior distribution and employ the EM algorithm for the empirical Bayes parameter estimation. In our evaluations, the proposed model achieved promising results on various data sets.
Novel task migration framework on configurable heterogeneous MPSoC platforms
Authors: Hao Shen, Frédéric Pétrot
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Heterogeneous MPSoC architectures can provide higher performance and flexibility with less power consumption and lower cost than homogeneous ones. However, as processor instruction sets of general heterogeneous MPSoCs are not identical, tasks migration between two heterogeneous processors is not possible. To enable this function, we propose to build one specific heterogeneous MPSoC platform in which all heterogeneous processors are based on the same core instruction set for the operating system realization. Different extended instructions can be added for different processors to improve the system performance. Tasks can be migrated from one processor to another only if the target processor has all instructions which can meet the execution requirement of this task. This paper concentrates on the infrastructure that is necessary to support the scheduling and migration of tasks between the processors. By using the Motion-JPEG case study, we confirm that our task migration framework can achieve higher processor usage rate and more flexibility.
Robustness Analysis of M-ary Quantization Based Watermarking
Authors: Jun-Horng Chen
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This work addresses the issue on the robustness performance in M-ary quantization watermarking. If the encoded messages are arranged in the order of Gray Code such that adjacent messages differ at only one bit, this work demonstrates the robustness will be substantially improved in low DNR scenarios. Furthermore, the two-bit quantization watermarking can outperform the LUT approach which also provides the robustness improvement in the high-noisy environments.
Context-aware composition
Authors: Kent Lyons, Roy Want, David Munday, Jiasheng He, Shivani Sud, Barbara Rosario, Trevor Pering
Venue: Proceedings of the 10th workshop on Mobile Computing Systems and Applications (2009)

Context-Aware Composition is a technique to overcome the complexity of wireless discovery, device selection, and establishing connections to other computers in an environment where potentially tens or even hundreds of other computers may reside. In this paper, we present our work demonstrating the benefit of using context to facilitate the discovery process through sensing. We describe our sensor platform, the Context Card, and discuss how the Sensor Actuator API (SAAPI) is used to collect and distribute sensor data. We also show how context can be used to create multi-modal composition commands and provide a quantitative evaluation of a multimodal position sensing system to support context-aware composition.
Optimized maintenance design for manufacturing performance improvement using simulation
Authors: Ahad Ali, Xiaohui Chen, Ziming Yang, Jay Lee, Jun Ni
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This research presents optimized maintenance design using simulation to analyze the capability of auto part manufacturing production system. The integration of simulation and optimization is used to identify critical stations, an optimal system design and maintenance scheduling schemes and evaluates their effects on the overall system performance. Most emphasis is focused on the impact on system by individual station reliability and the fluctuation of maintenance availability. The proposed simulation and optimization for maintenance design is validated through real-life application. This simulation modeling and optimization could help for manufacturing performance improvement.
Accuracy and performance of graphics processors: A Quantum Monte Carlo application case study
Authors: Jeremy S. Meredith, Gonzalo Alvarez, Thomas A. Maier, Thomas C. Schulthess, Jeffrey S. Vetter
Venue: Parallel Computing (2009)

The tradeoffs of accuracy and performance are as yet an unsolved problem when dealing with Graphics Processing Units (GPUs) as a general-purpose computation device. Their high performance and low cost makes them a desirable target for scientific computation, and new language efforts help address the programming challenges of data parallel algorithms and memory management. But the original task of GPUs - real-time rendering - has traditionally kept accuracy as a secondary goal, and sacrifices have sometimes been made as a result. In fact, the widely deployed hardware is generally capable of only single precision arithmetic, and even this accuracy is not necessarily equivalent to that of a commodity CPU. In this paper, we investigate the accuracy and performance characteristics of GPUs, including results from a preproduction double precision-capable GPU. We then accelerate the full Quantum Monte Carlo simulation code DCA++, similarly investigating its tolerance to the precision of arithmetic delivered by GPUs. The results show that while DCA++ has some sensitivity to the arithmetic precision, the single-precision GPU results were comparable to single-precision CPU results. Acceleration of the code on a fully GPU-enabled cluster showed that any remaining inaccuracy in GPU precision was negligible; sufficient accuracy was retained for scientifically meaningful results while still showing significant speedups.
Shape symmetry analysis of breast tumors on ultrasound images
Authors: Wei Yang, Su Zhang, Yazhu Chen, Wenying Li, Yaqing Chen
Venue: Computers in Biology and Medicine (2009)

Shape characteristics of malignant and benign breast tumors are significantly different. In this paper, the reflective symmetry of breast tumor shapes on ultrasound images was investigated. A new reflective symmetry measure (RSML) derived from multiscale local area integral invariant was proposed to quantify the shape symmetry of breast tumor, which could be computed directly from the binary mask image without the shape parameterization in terms of arc length. The performance of several symmetry measures for differentiating malignant and benign breast tumors at varying scales was evaluated and compared by receiver operating characteristic (ROC) analysis. RSML with Gaussian kernel at scale 0.04 (related to the maximal diameter) achieved the highest area under the ROC curve (0.85) on the image data of 168 tumors (104 benign and 64 malignant). The experimental results showed that the reflective symmetry of breast tumor shape was capable of providing potential diagnostic information, which could be characterized quantitatively by RSML with the appropriate scale parameter.
A velocity--diffusion method for a Lotka--Volterra system with nonlinear cross and self-diffusion
Authors: G. Gambino, M. C. Lombardo, M. Sammartino
Venue: Applied Numerical Mathematics (2009)

The aim of this paper is to introduce a deterministic particle method for the solution of two strongly coupled reaction-diffusion equations. In these equations the diffusion is nonlinear because we consider the cross and self-diffusion effects. The reaction terms on which we focus are of the Lotka-Volterra type. Our treatment of the diffusion terms is a generalization of the idea, introduced in [P. Degond, F.-J. Mustieles, A deterministic approximation of diffusion equations using particles, SIAM J. Sci. Stat. Comput. 11 (1990) 293-310] for the linear diffusion, of interpreting Fick's law in a deterministic way as a prescription on the particle velocity. Time discretization is based on the Peaceman-Rachford operator splitting scheme. Numerical experiments show good agreement with the previously appeared results. We also observe travelling front solutions, the phenomenon of pattern formation and the possibility of survival for a dominated species due to a segregation effect.
E-learning and its prospects in education
Authors: Claudia Blezu, Emil M. Popa
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The term "E-learning" refers to the use of Internet technologies. He was coined in the late 1990s to describe the use of technology to deliver learning and training programs. The term "E-learning" is now used in the Framework to capture the general intent to support a broad range of electronic media (Internet, intranets, extranets, satellite broadcast, audio/video tape, interactive TV and CD-ROM) to make vocational learning more flexible for clients. Flexible learning expands choice on what, when, where and how people learn. It supports different styles of learning, including E-learning. Flexibility means anticipating, and responding to, the ever-changing needs and expectations of VET clients - enterprises learners and communities. E-learning is the unifying term to describe the fields of online learning, web-based training and technology-delivered instruction. Nothing is changing as fast as all the terms related to E-learning. In E-learning environments learners interact with learning materials, their instructors and other learners from various locations and often at various times using network technologies. E-learning is flexible learning using ITC resources, tools and applications, and focusing on interactions among teachers, learners and online environment. E-learning usually refers to structured and managed learning experiences, and may involve the use of Internet, CD-ROMs, software, other media and telecommunications.
Image Thresholding Using TRIBES, a Parameter-Free Particle Swarm Optimization Algorithm
Authors: Yann Cooren, Amir Nakib, Patrick Siarry
Venue: Learning and Intelligent Optimization: Second International Conference, LION 2007 II, Trento, Italy, December 8-12, 2007. Selected Papers (2008)

Finding the optimal threshold(s) for an image with a multimodal histogram is described in classical literature as a problem of fitting a sum of Gaussians to the histogram. The fitting problem has been shown experimentally to be a nonlinear minimization problem with local minima. In this paper, we propose to reduce the complexity of the method, by using a parameter-free particle swarm optimization algorithm, called TRIBES which avoids the initialization problem. It was proved efficient to solve nonlinear and continuous optimization problems. This algorithm is used as a "black-box" system and does not need any fitting, thus inducing time gain.
Sampling Eulerian orientations of triangular lattice graphs
Authors: Páidí Creed
Venue: Journal of Discrete Algorithms (2009)

We consider the problem of sampling from the uniform distribution on the set of Eulerian orientations of subgraphs of the triangular lattice. Although Mihail and Winkler (1989) showed that this can be achieved in polynomial time for any graph, the algorithm studied here is more natural in the context of planar Eulerian graphs. We analyse the mixing time of a Markov chain on the Eulerian orientations of a planar graph which moves between orientations by reversing the edges of directed faces. Using path coupling and the comparison method we obtain a polynomial upper bound on the mixing time of this chain for any solid subgraph of the triangular lattice. By considering the conductance of the chain we show that there exist non-solid subgraphs (subgraphs with holes) for which the chain will always take an exponential amount of time to converge. Finally, we show that the problem of counting Eulerian orientations remains #P-complete when restricted to planar graphs (Mihail and Winkler had already established this for general graphs).
Zero pre-shared secret key establishment in the presence of jammers
Authors: Tao Jin, Guevara Noubir, Bishal Thapa
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

We consider the problem of key establishment over a wireless radio channel in the presence of a communication jammer, initially introduced in [13]. The communicating nodes are not assumed to pre-share any secret. The established key can later be used by a conventional spread-spectrum communication system. We introduce new communication concepts called intractable forward-decoding and efficient backward-decoding. Decoding under our mechanism requires at most twice the computation cost of the conventional SS decoding and one packet worth of signal storage. We introduce techniques that apply a key schedule to packet spreading and develop a provably optimal key schedule to minimize the bit-despreading cost. We also use efficient FFT-based algorithms for packet detection. We evaluate our techniques and show that they are efficient both in terms of resiliency against jammers and computation. Finally, our technique has additional features such as the inability to detect packet transmission until the last few bits are being transmitted, and transmissions being destination-specific. To the best of our knowledge, this is the first solution that is optimal in terms of communication energy cost with very little storage and computation overhead.
Fuzzy reasoning used to detect apneic events in the sleep apnea-hypopnea syndrome
Authors: Diego Álvarez-Estévez, Vicente Moret-Bonillo
Venue: Expert Systems with Applications: An International Journal (2009)

The sleep apnea/hypopnea syndrome is a very common sleep disorder, characterised by disrupted breathing during sleep. Depending on the extent of the disruptions to sleep, these are classified as apneas or hypopneas. In order to locate these apneic events an analysis of respiratory signals recorded for an entire night's sleep is necessary. However, identifying and classifying apneic events is a complex task, given the error associated with the process for digitising signals, variability in expert criteria and the complexity of the signals themselves. This article describes a fuzzy-logic-based automated system for detecting apneic events and classifying them as apneas or hypopneas. The aim is to equip this system with mechanisms for dealing with imprecision and reasoning affected by uncertainty. The ultimate goal was to assist the physician in diagnosing the sleep apnea/hypopnea syndrome. Results in terms of locating events in the polysomnogram showed sensitivity and specificity of 0.87 and 0.89, respectively. A receiver operating curve index of 0.88 was obtained for the classification of events as apneas or hypopneas.
Comment on: "Extended Hough transform for linear feature detection"
Authors: Kuo-Liang Chung, Ting-Chin Chang, Yong-Huai Huang
Venue: Pattern Recognition (2009)

Recently Cha et al. presented an efficient extended Hough transform (EHT) method to detect lines, each line segment with desired length. Instead of performing the voting process twice for each edge pixel in the EHT method, this comment presents a simple modification such that each edge pixel in the edge map only needs to perform the voting processing once. This modification leads to 16% execution-time improvement ratio when compared to the EHT method, and it is very close to the theoretical execution-time improvement ratio, 14%.
Product Improvement by Selecting Appropriate Suppliers: A Case Study
Authors: S. Emre Alptekin, Gülfem Isiklar Alptekin
Venue: Proceedings of the 2009 International Conference on Information, Process, and Knowledge Management (2009)

Supplier selection and evaluation is considered as one of the most critical issues for the success of an organization, as its correctness is directly or indirectly related to the cost, quality and the customer satisfaction. This paper presents a methodology for the supplier selection process in respect to changing customer requirements. It is based on a genetic algorithm that is a search heuristic based on biological evolution. We aim at selecting the optimum supplier set that maximizes the quality, performance of delivery time and minimizes costs at the same time. The proposed management methodology is applied on a real world case in the textile chemicals industry. The results of the algorithm show that the proposed methodology could be used as a decision support system for producers with complex product configurations.
From sequence diagrams to Java-stairs aspects
Authors: Jon Oldevik, Øystein Haugen
Venue: Proceedings of the 8th ACM international conference on Aspect-oriented software development (2009)

Execution traces are naturally represented at the design level with UML sequence diagrams. During a system execution, trace-based aspects can be used to monitor behavioral patterns and protocols and may e.g. provide mitigation strategies for unwanted behavior. Trace-based and stateful aspects have evolved to handle such reoccurring interaction patterns at the implementation level. We define a STAIRS-inspired semantics for trace-based Java aspects, and a sequence diagram aspect notation with a mapping to a trace-based Java implementation. We use this to show that aspect composition is semantics preserving with respect to refinement under the given semantics.
An Irregular Search Window Reuse Scheme for MPEG-2 to H.264 Transcoding
Authors: Xiang-Hui Wei, Shen Li, Yang Song, Satoshi Goto
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Motion estimation (ME) is a computation-intensive module in video coding system. In MPEG-2 to H.264 transcoding, motion vector (MV) from MPEG-2 reused as search center in H.264 encoder is a simple but effective technique to simplify ME processing. However, directly applying MPEG-2 MV as search center will bring difficulties on application of data reuse method in hardware design, because the irregular overlapping of search windows between successive macro block (MB). In this paper, we propose a search window reuse scheme for transcoding, especially for HDTV application. By utilizing the similarity between neighboring MV, overlapping area of search windows can be regularized. Experiment results show that our method achieves average 93.1% search window reuse-rate in HDTV720p sequence with almost no video quality degradation. Compared to transcoding method without any data reuse scheme, bandwidth of the proposed method can be reduced to 40.6% of that.
A swarm-inspired resource distribution for SMT processors
Authors: Hongzhou Chen, Lingdi Ping, Xuezeng Pan, Kuijun Lu, Xiaoning Jiang
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

The performance in Simultaneous Multi-Threading (SMT) processors is mainly determined by the distribution of the common resources among the threads. However, the threads exhibit dynamically complicated behavior while they compete for resources at runtime. It is a challenge to meet the changing resource requirements of the threads. This work proposes a Swarm-inspired Resource Distribution (SRD) policy to address the dynamic optimization problem of resource distribution for SMT processors, which uses the runtime performance to guide the generating of trial distributions. A computational model is established by adaptation of swarm intelligence to direct the social exploitation and self exploration activities of the trial distributions in the dynamic optimization environment. Results from simulation show that, benefiting from the good cooperation between SRD's social exploitation on historical experience and self exploration of new solutions, SRD obtains satisfying improvements of both throughput and fairness performance, especially in complicated SMT environment.
A Novel Exponential Type Swarming of Foraging and Obstacle-Avoidance Behaviour Modelling and Simulating Research on Collective Motion in Multi-obstacle Environment
Authors: Zhi Bin Xue, Jian Chao Zeng
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

A novel Lagrangian "individual-based" isotropic continuous time exponential type swarming model with a family of attraction/repulsion function is proposed in this article. The stability of aggregating behavior of the swarm systems is verified by computer numerical imitation. Numerical simulation results further indicate that the individual members living in group during the course of coordinative motion can realize the collision-eluding obstacles and ensure mutual aggregating behaviour, the motion of each individual member is a combination of the inter-individual interactions and the interaction of the member with external environment. Better self-adaptability of surrounding environment and practicability are embodied out in the proposed model.
Taming subsystems: capabilities as universal resource access control in L4
Authors: Adam Lackorzynski, Alexander Warg
Venue: Proceedings of the Second Workshop on Isolation and Integration in Embedded Systems (2009)

The embedded and mobile computing market with its wide range of innovations is expected to remain growing in the foreseeable future. Recent developments in the embedded computing technology offer more performance thereby facilitating applications of unprecedented utility. Open systems, such as Linux, provide access to a huge software base. Nevertheless, these systems have to coexist with critical device infrastructure that insists on stringent timing and security properties. In this paper, we will present a capability-based software architecture, featuring enforceable security policies. The architecture aims to support current and future requirements of embedded computing systems, such as running versatile third-party applications on general purpose and open operating systems side by side with security sensitive programs.
Risk analysis in the 1980's
Authors: Jerome Lobel
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The application of scientific procedures to the study and evaluation of information and communications systems risks is still in its infancy. Hopefully, before the end of this decade we will see major breakthroughs both in improved techniques and greater utilization of Risk Analysis procedures by computer users. On the other hand Risk Analysis (also sometimes called Threat or Vulnerability Analysis) has real merit even by todays standards. The problem is that many organizations have still to be convinced as to its potential.