ppxscal/embedding_network huggingface dataset:
Design & evaluation of engine assembly line layouts
Authors: Soheil Mardani, Pouyan Jalili
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

IPCO is power train supplier for IranKhodro which is the largest car manufacturing company in the Middle East. Recently has done a lot of effort to optimize energy consumption, decrease environment pollution and use alternative fuel in the world. Thus IPCO started research, design and production gas fuel engine instead of petrol one for automobiles in C and D class. Following market research the annual target rate settled 200,000 engines. To design the layout in limited area (3800 m2) & also analyze specification of the production & material handling equipment, considering all of the constraint, resources and facilities, simulation model get developed in Enterprise Dynamics. The length of conveyors, cycle time of equipments, optimized number of required pallets & etc. get specified for 2 types of F shape & L shape of layout. Initial inspection shows that the optimum annual production rate will be 185000 units which is less than target.
Two-Quadrant CMOS Plug-in Divider
Authors: Kuo-Jen Lin
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

A two-quadrant CMOS current-mode plug-in divider using a compact 1/x device is presented. The mismatch errors of 1/x device cancel part of mismatch errors of the proposed divider. The simulation results indicate that the plug-in divider is feasible by the proposed approximation method. The adjustable 1/x device could be applied in difference ranges.
The role of the user at standard oil company (Indiana) in the development of large-scale business systems
Authors: James E. Jackson
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

Over the past 15 years Standard Oil (Indiana) has been involved in the development and implementation of a number of major computer-based business systems. Concurrent with this, Standard management has organized the users of these systems into a structure that provides for their effective participation in the development process. This structure, which consists of user management, user representatives, and the end user, recognizes that each of these groups has specific roles to play during the system development project life cycle. This paper will examine these user groups and their respective roles. The emphasis will be on identifying the key areas of user involvement that are necessary for the successful development and implementation of large-scale business systems.
An 8.69 Mvertices/s 278 Mpixels/s tile-based 3D graphics SoC HW/SW development for consumer electronics
Authors: Liang-Bi Chen, Ruei-Ting Gu, Wei-Sheng Huang, Chien-Chou Wang, Wen-Chi Shiue, Tsung-Yu Ho, Yun-Nan Chang, Shen-Fu Hsiao, Chung-Nan Lee, Ing-Jer Huang
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

This paper presents an 8.69 Mvertices/s, 278 Mpixels/s, 15.7 mm2 tiled-based 3D graphics SoC HW/SW supporting OpenGL ES 1.0 running at 139 MHz. The SoC also includes embedded circuitry to monitor run time characteristics, detect bus protocol error/inefficiency, and capture bus traces at various abstraction levels with compression ratio up to 98%.
Oversampling and reconstruction functions with compact support
Authors: A. G. García, M. A. Hernández-Medina, G. Pérez-Villalón
Venue: Journal of Computational and Applied Mathematics (2009)

Assume that a sequence of samples of a filtered version of a function in a shift-invariant space is given. This paper deals with the existence of a sampling formula involving these samples and having reconstruction functions with compact support. This is done in the light of the generalized sampling theory by using the oversampling technique. A necessary and sufficient condition is given in terms of the Smith canonical form of a polynomial matrix. Finally, we prove that the aforesaid oversampled formulas provide nice approximation schemes with respect to the uniform norm.
Robust synchronization for asynchronous multi-user chaos-based DS-CDMA
Authors: Georges Kaddoum, Daniel Roviras, Pascal Chargé, Danièle Fournier-Prunaret
Venue: Signal Processing (2009)

In this paper we propose two systems for achieving synchronization in asynchronous multi-user chaos-based DS-CDMA. For the first system, synchronization process is realized thanks to a binary code used as an additive pilot sequence to the spreaded signal. Gold sequences are used as pilot signals for the different users to accomplish the synchronization. For the second synchronization system, the synchronization is made through a binary code used as a multiplicative pilot signal for the spreaded data sequence. These synchronization processes are evaluated under the assumption of an additive white Gaussian noise channel together with multi-user interferences. In this paper we will focus on the initial synchronization phase (code acquisition) and we assume that the system can achieve correctly the code tracking after this first synchronization phase. The code acquisition for the two systems is evaluated in terms of the probability of detection and probability of false alarm.
Agreeing on Institutional Goals for Multi-agent Societies
Authors: Dorian Gaertner, Juan Antonio Rodríguez-Aguilar, Francesca Toni
Venue: Coordination, Organizations, Institutions and Norms in Agent Systems IV: COIN 2008 International Workshops, COIN@AAMAS 2008, Estoril, Portugal, May 12, 2008. COIN@AAAI 2008, Chicago, USA, July 14, 2008. Revised Selected Papers (2009)

We present an argumentation-based approach to the problem of finding a set of institutional goals for multi-agent systems. The behaviour of the autonomous agents we consider in this paper is goal-directed, driven by either individual or common goals. When multiple agents want to set up a collaboration framework (for themselves or others to use), they do so by forming an institution (or organisation). The goals of such institution must be agreed upon by the agents setting up the framework before it can be executed.We propose to use argumentation, and in particular assumption-based argumentation, to facilitate the negotiation of institutional goals. We first describe a centralised approach and then provide the rationale for and detail our preliminary efforts at de-centralising the problem. We propose to employ the argumentation system CaSAPI as a tool to reason about the collaborative goals of the institution. Our approach mitigates concerns about performance bottlenecks and vulnerability of the system while providing, to some extent, privacy to the individual members of the institution.
Survival prediction using gene expression data: A review and comparison
Authors: Wessel N. van Wieringen, David Kun, Regina Hampel, Anne-Laure Boulesteix
Venue: Computational Statistics Data Analysis (2009)

Knowledge of transcription of the human genome might greatly enhance our understanding of cancer. In particular, gene expression may be used to predict the survival of cancer patients. Microarray data are characterized by their high-dimensionality: the number of covariates (p~1000) greatly exceeds the number of samples (n~100), which is a considerable challenge in the context of survival prediction. An inventory of methods that have been used to model survival using gene expression is given. These methods are critically reviewed and compared in a qualitative way. Next, these methods are applied to three real-life data sets for a quantitative comparison. The choice of the evaluation measure of predictive performance is crucial for the selection of the best method. Depending on the evaluation measure, either the L"2-penalized Cox regression or the random forest ensemble method yields the best survival time prediction using the considered gene expression data sets. Consensus on the best evaluation measure of predictive performance is needed.
On the Scheme of Rapid Acquisition of Long PN Code in DSSS Signals
Authors: Minghao Tian, Yongxin Feng, Fang Liu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In a direct sequence spread spectrum (DSSS) communication system with long period pseudorandom (PN) code, the acquisition speed of the pseudorandom code will impact the overall performance of the receiving system seriously. A rapid acquisition method of long PN code is proposed, which is based on excellent correlation characteristics of PN code. In this method, the local PN code sequence is extended, folded and averaged, and the DS signal sequence is averaged, then the two result vectors are computed to generate observation vector. The preliminary acquisition of the signal is judged through the threshold of the observation vector. Moreover, the precise acquisition of the signal is completed through removing average and extension. Theoretical analysis and numerical results show that the acquisition method can effectively improve the acquisition speed of the pseudorandom code when searching large-scale codes.
On-Line Estimation of Biomass Concentration Based on ANN and Fuzzy C-Means Clustering
Authors: Guohai Liu, Haixia Xu, Dawei Zhou, Congli Mei
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

A multiple-model modeling method has been proposed for soft-sensing in a complex non-linear biochemical process for years. In this study, a multi-fuzzy-neural network model (MFNN), which is combined by multiple-model modeling method based on neural network and fuzzy c-means clustering algorithm (FCM), is presented to estimate the biomass concentration in fermentation process. Low dimensional sample data is achieved through principal component analysis (PCA).FCM is used for the analysis of the distribution of principal data and grouping them into overlapping clusters with different membership degrees. Then, a soft-sensing model is developed using multi- fuzzy-neural network to fit the different hierarchic property of the process. The biomass concentration is estimated by computing the sum of outputs of local models weighed by the corresponding degrees of membership. The model is applied to an erythromycin fermentation process, and case studies show that the approach has better performance compared to the conventional global model.
Consensus fingerprint matching with genetically optimised approach
Authors: W. Sheng, G. Howells, M. C. Fairhurst, F. Deravi, K. Harmer
Venue: Pattern Recognition (2009)

Fingerprint matching has been approached using various criteria based on different extracted features. However, robust and accurate fingerprint matching is still a challenging problem. In this paper, we propose an improved integrated method which operates by first suggesting a consensus matching function, which combines different matching criteria based on heterogeneous features. We then devise a genetically guided approach to optimise the consensus matching function for simultaneous fingerprint alignment and verification. Since different features usually offer complementary information about the matching task, the consensus function is expected to improve the reliability of fingerprint matching. A related motivation for proposing such a function is to build a robust criterion that can perform well over a variety of different fingerprint matching instances. Additionally, by employing the global search functionality of a genetic algorithm along with a local matching operation for population initialisation, we aim to identify the optimal or near optimal global alignment between two fingerprints. The proposed algorithm is evaluated by means of a series of experiments conducted on public domain collections of fingerprint images and compared with previous work. Experimental results show that the consensus function can lead to a substantial improvement in performance while the local matching operation helps to identify promising initial alignment configurations, thereby speeding up the verification process. The resulting algorithm is more accurate than several other proposed methods which have been implemented for comparison.
An affective model of user experience for interactive art
Authors: Stephen W. Gilroy, Marc Cavazza, Rémi Chaignon, Satu-Marja Mäkelä, Markus Niranen, Elisabeth André, Thurid Vogt, Jérôme Urbain, Hartmut Seichter, Mark Billinghurst, Maurice Benayoun
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

The development of Affective Interface technologies makes it possible to envision a new generation of Digital Arts and Entertainment applications, in which interaction will be based directly on the analysis of user experience. In this paper, we describe an approach to the development of Multimodal Affective Interfaces that supports real-time analysis of user experience as part of an Augmented Reality Art installation. The system relies on a PAD dimensional model of emotion to support the fusion of affective modalities, each input modality being represented as a PAD vector. A further advantage of the PAD model is that it can support a representation of affective responses that relate to aesthetic impressions.
Combining Multiple Experts for Classifying Shot Changes in Video Sequences
Authors: Y. Yusoff, J. Kittler, W. Christmas
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper presents a shot cut detection technique using a combination of multiple experts. The experts themselves are stand-alone methods to detect shot cuts. We propose a combination method that gives significantly better results compared to these experts on their own. We achieve this by exploiting the complementarity of expert knowledge, i.e. the fact that the various experts calculate different features of the video sequences.
Modeling Hysteresis in Piezo Actuator Based on Neural Networks
Authors: Xuefeng Yang, Wei Li, Yuqiao Wang, Guo Ye
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Hysteresis and nonlinearity of piezo actuator are the major factors affecting the motion accuracy in controlling a micro system. The prediction accuracy of classical Preisach model could be improved only by mass experiments for measuring hysteresis. A model based on BP neural networks was proposed to improve the prediction accuracy. Because the stoke of piezo actuator have relation to historical extrema inputs, the input of the model are current exciting voltage, historical voltage at nearest turning point and its corresponding stroke and the output is piezo actuator's stroke. Results of simulation and experiments show that the proposed hysteresis model can exactly describe and predict the hysteresis of piezo actuator compare with traditional bilinear interpolation and has the better generalization ability.
Integrating tactile and force feedback for highly dynamic tasks: Technological, experimental and epistemological aspects
Authors: Armen Khatchatourov, Julien Castet, Jean-Loup Florens, Annie Luciani, Charles Lenay
Venue: Interacting with Computers (2009)

For hand-object interaction in real situations the interplay between the local tactile interaction and force interaction seems to be very important. In current haptic interfaces, however, two different trends are present: force feedback devices which offer a permanent invariable grip and a resultant force, and tactile devices, which offer variable local patterns, often used for texture rendering. The purpose of the present work is to combine the two types of devices in a coherent manner. In the new device presented here, the tactile stimulation is obtained from strictly the same interaction loop, and obeys to the same physical model, as the force feedback, providing the information on the spatial distribution of forces circulating between the object and the fingertip. An experiment on following sharp edges of virtual object comparing the force feedback alone and different tactile augmentations is presented and discussed, alone with some open epistemological issues.
A comparison of tools for teaching formal software verification
Authors: Ingo Feinerer, Gernot Salzer
Venue: Formal Aspects of Computing (2009)

We compare four tools regarding their suitability for teaching formal software verification, namely the Frege Program Prover, the Key system, Perfect Developer, and the Prototype Verification System (PVS). We evaluate them on a suite of small programs, which are typical of courses dealing with Hoare-style verification, weakest preconditions, or dynamic logic. Finally we report our experiences with using Perfect Developer in class.
Exploring Partitions Based on Search Space Smoothing for Heterogeneous Multiprocessor System
Authors: Kang Zhao, Jinian Bian, Sheqin Dong, Yang Song, Satoshi Goto
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Programming the multiprocessor system-on-chip (MPSoC) requires partitioning the sequential reference programs onto multiple processors running in parallel. However, designers still need to partition the code manually due to the lack of automated partition techniques. To settle this issue, this paper proposes a partition exploration algorithm based on the search space smoothing techniques, and implements the proposed method using a commercial extensible processor (Xtensa LX2 processor from Tensilica Inc.). We have verified the feasibility of the algorithm by implementing the MPEG2 benchmark on the Xtensa-based two-processor system. The final experimental results indicate a performance improvement of at least 1.6× compared to the single-processor system.
It's not easy being green: understanding home computer power management
Authors: Marshini Chetty, A.J. Bernheim Brush, Brian R. Meyers, Paul Johns
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Although domestic computer use is increasing, most efforts to reduce energy use through improved power management have focused on computers in the workplace. We studied 20 households to understand how people use power management strategies on their home computers. We saw computers in the home, particularly desktop computers, are left on much more than they are actively used suggesting opportunities for economic and energy savings. However, for most of our participants, the economic incentives were too minor to motivate them to turn off devices when not in use, especially given other frustrations such as long boot up times. We suggest research directions for home computer power management that could help users be more green without having to dramatically change their home computing habits.
A Temporal Logic for Stochastic Multi-Agent Systems
Authors: Wojciech Jamroga
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

Typical analysis of Markovian models of processes refers only to the expected utility that can be obtained by the process. On the other hand, modal logic offers a systematic method of characterizing processes by combining various modal operators. A multivalued temporal logic for Markov chains and Markov decision processes has been recently proposed in [1]. Here, we discuss how it can be extended to the multi-agent case. We relate the resulting logic to existing (two-valued) logics of strategic ability, and present fixpoint characterizations for some natural combinations of strategic and temporal operators.
Sponsored ad-based similarity: an approach to mining collective advertiser intelligence
Authors: Jessica Staddon
Venue: Proceedings of the 2nd International Workshop on Data Mining and Audience Intelligence for Advertising (2008)

We present a method for mining the intelligence of advertisers to detect product similarities and generate accurate recommendations. In contrast to conventional recommendation algorithms, our approach is completely automated and relies solely on publicly available data, namely, the linking of advertisements with Web content. We present a general framework for leveraging linked advertisements to detect object similarity, and provide experimental evidence that the approach yields useful product recommendations.
Web Security Testing Cookbook: Systematic Techniques to Find Problems Fast, 1st edition
Authors: Paco Hope, Ben Walther
Venue:  (2008)

Among the tests you perform on web applications, security testing is perhaps the most important, yet it's often the most neglected. The recipes in the Web Security Testing Cookbook demonstrate how developers and testers can check for the most common web security issues, while conducting unit tests, regression tests, or exploratory tests. Unlike ad hoc security assessments, these recipes are repeatable, concise, and systematic-perfect for integrating into your regular test suite. Recipes cover the basics from observing messages between clients and servers to multi-phase tests that script the login and execution of web application features. By the end of the book, you'll be able to build tests pinpointed at Ajax functions, as well as large multi-step tests for the usual suspects: cross-site scripting and injection attacks. This book helps you: Obtain, install, and configure useful-and free-security testing tools Understand how your application communicates with users, so you can better simulate attacks in your tests Choose from many different methods that simulate common attacks such as SQL injection, cross-site scripting, and manipulating hidden form fields Make your tests repeatable by using the scripts and examples in the recipes as starting points for automated tests Don't live in dread of the midnight phone call telling you that your site has been hacked. With Web Security Testing Cookbook and the free tools used in the book's examples, you can incorporate security coverage into your test suite, and sleep in peace.
A list-processing-oriented data flow machine architecture
Authors: Makoto Amamiya, Ryuzo Hasegawa, Osamu Nakamura, Hirohide Mikami
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

This paper analyzes some issues concerning list processing under a data flow control environment from the viewpoint of parallelism and also presents a new type of list-processing-oriented data flow machine, based on an association memory and logic-in-memory. The mechanism of partial execution in each function is shown by example to be effective in exploiting the parallelism in list processing. The lenient cons mechanism is shown to exploit maximally parallelism among activated functions.