ppxscal/embedding_network huggingface dataset:
ePaper Project: Virtual Exploration
Authors: Inbal Rief, Shahar Hesse
Venue: Proceedings of the 10th International Symposium on Smart Graphics (2009)

We describe a design process of envisioning the ePaper (a future newspaper appliance) through the use of two animated scenarios, each featuring different usage and personal preferences. The animations have triggered a creative discussion at Deutsche Telekom business functions on the ePaper's value as a future device.
SoC platform design for bio-sensor signal processing
Authors: Wonjoon Choi, Jongsung Kim, Moonsu Jang, Jongsik Park, Yongju Jang, Seongsoo Lee, Jaekyung Wee, Seok Lee, Dockha Woo
Venue: Proceedings of the 8th WSEAS international conference on Microelectronics, nanoelectronics, optoelectronics (2009)

Most of bio sensors which have been studied recently are based on CMOS process. There are many kinds of method for detecting sensor signal. In this paper, we proposed SoC platform for biosensor signal processing. Proposed platform has attempted to establish basis bio-sensor signal platform for adopt variable algorithm. The proposed SoC platform consists of programmable MCU(Microprocessor Control Unit) and external ROM and RAM. The proposed architecture was modeled VerilogHDL and was verified through simulations.
The Performance of Two Deformable Shape Models in the Context of the Face Recognition
Authors: Adam Schmidt, Andrzej Kasinski
Venue: Proceedings of the International Conference on Computer Vision and Graphics: Revised Papers (2008)

In this paper we compare the performance of face recognition systems based on two deformable shape models and on three classification approaches. Face contours have been extracted by using two methods: the Active Shapes and the Bayesian Tangent Shapes. The Normal Bayes Classifiers and the Minimum Distance Classifiers (based on the Euclidean and Mahalanobis metrics) have been designed and then compared w.r.t. the face recognition efficiency. The influence of the parameters of the shape extraction algorithms on the efficiency of classifiers has been investigated. The proposed classifiers have been tested both in the controlled conditions and as a part of the automatic face recognition system.
Cellular automata-based authentication for low-cost RFID systems
Authors: S. Tripathy, S. Nandi
Venue: International Journal of Communication Networks and Distributed Systems (2009)

Radio frequency identification (RFID) tags can be affixed with every item to identify the objects without any visual or physical contact. At the same time, the use of the tags can have serious implications on new risks to security and privacy. Also, it is difficult to implement the cryptographic mechanisms into low-cost RFID tags. In this paper, we propose a cellular automata-based authentication mechanism suitable for low-cost RFID systems.
Foundations of near sets
Authors: James F. Peters, Piotr Wasilewski
Venue: Information Sciences: an International Journal (2009)

This paper introduces an approach to the foundations of information science considered in the context of near sets. Perceptual information systems (or, more concisely, perceptual systems) provide stepping stones leading to nearness relations, near sets and a framework for classifying perceptual objects. This work has been motivated by an interest in finding a solution to the problem of how one goes about discovering affinities between perceptual granules such as images. Near set theory provides a formal basis for observation, comparison and classification of perceptual granules. This is made clear in this article by considering various nearness relations that define coverings of sets of perceptual objects that are near each other. In the near set approach, every perceptual granule is a set of objects that have their origin in the physical world. Objects that have, in some degree, affinities are considered perceptually near each other, i.e., objects with similar descriptions. This article includes a comparison of near sets with other approaches to approximate knowledge representation and a sample application in image analysis. The main contribution of this article is the introduction of a formal foundation for near sets and a demonstration that the family of near sets is a Gratzer slash lattice.
The distribution of the root degree of a random permutation
Authors: B&#x00e9;la Bollob&#x00e1;s, Boris Pittel
Venue: Combinatorica (2009)

Given a permutation &#x03c9; of {1, &#x2026;, n}, let R(&#x03c9;) be the root degree of &#x03c9;, i.e. the smallest (prime) integer r such that there is a permutation &#x03c3; with &#x03c9; = &#x03c3; r . We show that, for &#x03c9; chosen uniformly at random, R(&#x03c9;) = (lnlnn &#x2212; 3lnlnln n + O p (1))&#x2212;1 lnn, and find the limiting distribution of the remainder term.
Simple tangible language elements for young children
Authors: Andrew Cyrus Smith
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

We propose simple tangible language elements for very young children to use when constructing programmes. The equivalent Turtle Talk instructions are given for comparison. Two examples of the tangible language code are shown to illustrate alternative methods of solving a given challenge.
FlexSync: An aspect-oriented approach to Java synchronization
Authors: Charles Zhang
Venue: Proceedings of the 2009 IEEE 31st International Conference on Software Engineering (2009)

Designers of concurrent programs are faced with many choices of synchronization mechanisms, among which clear functional trade-offs exist. Making synchronization customizable is highly desirable as different deployment scenarios of the same program often prioritize synchronization choices differently. Unfortunately, such customizations cannot be accomplished in the conventional non-modular implementation of synchronization. To enable customizability, we present FlexSync, an aspect oriented synchronization library, to enable the modular reasoning and the declarative specification of synchronization. Complex Java systems can simultaneously work with multiple synchronization mechanisms without any code changes. The FlexSync load-time weaver performs deployment time optimizations and ensures these synchronization mechanisms consistently interact with each other and with the core system. We evaluated FlexSync on commercially used complex Java systems and observed significant speedups as a result of the deployment-specific customization.
Iris Matching by Local Extremum Points of Multiscale Taylor Expansion
Authors: Algirdas Bastys, Justas Kranauskas, Rokas Masiulis
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

Random distribution of features in iris image texture allows to perform iris-based personal authentication with high confidence. We propose to use the most significant local extremum points of the first two Taylor expansion coefficients as descriptors of the iris texture. A measure of similarity that is robust to moderate inaccuracies in iris segmentation is presented for the proposed features. We provide experimental results of verification quality for four commonly used iris data-sets. Strong and weak aspects of the proposed approach are also discussed.
Active learning for directed exploration of complex systems
Authors: Michael C. Burl, Esther Wang
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

Physics-based simulation codes are widely used in science and engineering to model complex systems that would be infeasible to study otherwise. Such codes provide the highest-fidelity representation of system behavior, but are often so slow to run that insight into the system is limited. For example, conducting an exhaustive sweep over a d-dimensional input parameter space with k-steps along each dimension requires kd simulation trials (translating into kd CPU-days for one of our current simulations). An alternative is directed exploration in which the next simulation trials are cleverly chosen at each step. Given the results of previous trials, supervised learning techniques (SVM, KDE, GP) are applied to build up simplified predictive models of system behavior. These models are then used within an active learning framework to identify the most valuable trials to run next. Several active learning strategies are examined including a recently-proposed information-theoretic approach. Performance is evaluated on a set of thirteen synthetic oracles, which serve as surrogates for the more expensive simulations and enable the experiments to be replicated by other researchers.
Classification of software behaviors for failure detection: a discriminative pattern mining approach
Authors: David Lo, Hong Cheng, Jiawei Han, Siau-Cheng Khoo, Chengnian Sun
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Software is a ubiquitous component of our daily life. We often depend on the correct working of software systems. Due to the difficulty and complexity of software systems, bugs and anomalies are prevalent. Bugs have caused billions of dollars loss, in addition to privacy and security threats. In this work, we address software reliability issues by proposing a novel method to classify software behaviors based on past history or runs. With the technique, it is possible to generalize past known errors and mistakes to capture failures and anomalies. Our technique first mines a set of discriminative features capturing repetitive series of events from program execution traces. It then performs feature selection to select the best features for classification. These features are then used to train a classifier to detect failures. Experiments and case studies on traces of several benchmark software systems and a real-life concurrency bug from MySQL server show the utility of the technique in capturing failures and anomalies. On average, our pattern-based classification technique outperforms the baseline approach by 24.68% in accuracy.
Electronic and Electrical Servicing - Level 3, Second Edition: Consumer and Commercial Electronics, 2nd edition
Authors: Ian Sinclair, John Dunton
Venue:  (2007)

Electronic and Electrical Servicing - Level 3 follows on from the Level 2 book and covers the more advanced electronics and electrical principles required by service engineers servicing home entertainment equipment such as TVs, CD and DVD machines, as well as commercial equipment including PCs.All the core units of the Level 3 Progression Award in Electrical and Electronics Servicing (Consumer/Commercial Electronics) from City & Guilds (C&G 6958) are covered. The book also offers a fully up-to-date course text for the City & Guilds 1687 NVQ at Level 3.The book contains numerous worked examples to help students grasp the principles. Each chapter ends with review questions, for which answers are provided at the end of the book, so that students can check their learning.Units covered:Unit 1 - Electronic principlesUnit 2 - Test and measurementUnit 3 - Analogue electronicsUnit 4 - Digital electronicsIan Sinclair has been an author of market-leading books for electronic servicing courses for over 20 years, helping many thousands of students through their college course and NVQs into successful careers. Now with a new co-author, John Dunton, the new edition has been brought fully up-to-date to reflect the most recent technical advances and developments within the service engineering industry, in particular with regard to television and PC servicing and technology.Level 2 book:Electronic and Electrical Servicing, ISBN 978-0-7506-6988-7, covers the 5 core units at Level 2, plus the option units Radio and television systems technology (Unit 6) and PC technology (Unit 8). * Complete coverage of the core units of the 6958 PA Level 3 syllabus* Level 2 book also available* A new edition of a title which has been the market leading electronic servicing text for over 20 years
Fostering collaborative knowledge building by the effective provision of knowledge about the discussion process
Authors: Santi Caballe, Fatos Xhafa
Venue: International Journal of Business Intelligence and Data Mining (2009)

This paper reports on an experience of using an innovative CSCL tool to support real, collaborative learning by discussion. We base the success of online collaborative discussion on two crucial aspects: first, by providing an adequate dialogue structure and move types that promote meaningful contributions and achieve more effective interaction; second, by extracting relevant knowledge in order to provide learners and tutors with efficient awareness, feedback, and monitoring as regards learners' performance and collaboration. The ultimate goal is to achieve a more effective support and assessment of the discussion process. A real virtual learning environment based on asynchronous discussion is employed to validate the approach.
A Qualitative Representation Model about Trajectories in 2-D
Authors: J. V. Álvarez-Bravo, J. C. Peris-Broch, M. T. Escrig-Monferrer, J. J. Álvarez-Sánchez, F. J. González-Cabrera
Venue: Proceeding of the 2006 conference on Artificial Intelligence Research and Development (2006)

Description of trajectories has been dealt in quantitative terms by means of mathematical formulas. Human beings do not use formulas to describe the trajectories of objects in movement, for instance, for shooting or catching a ball. Common sense reasoning about the physical world has been commonly solved by qualitative models. However, no qualitative model about trajectories of objects in movement has been developed up to our knowledge. In this paper, a qualitative representation model about kinematic properties of a system consisted of several objects moving uniformly (constant speed) in a 2D space has been developed. This representation is based on a geometric description of the most relevant kinematical aspects through the relation between the trajectories of two moving objects.
Equivalence of Fuzzy-rough Modus Ponens and Fuzzy-rough Modus Tollens
Authors: Masahiro Inuiguchi, Salvatore Greco, Roman Słowiński
Venue: Proceeding of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005 (2005)

We have proposed a fuzzy rough set approach to induce gradual decision rules from decision tables without using any fuzzy logical connective. In this paper, we discuss the equivalence between fuzzy-rough modus ponens and fuzzy-rough modus tollens obtained from the induced gradual decision rules. We show the necessary and sufficient conditions for fuzzy-rough modus ponens and fuzzy-rough modus tollens to be equivalent.
The law of ultrasonic energy conversion in thermosonic flip chip bonding interfaces
Authors: Li Junhui, Wang Ruishan, He Hu, Wang Fuliang, Han Lei, Zhong Jue
Venue: Microelectronic Engineering (2009)

In this paper, the vibration characteristics during the flip chip (FC) bonding process were observed by using a laser Doppler vibrometer (LDV), and the atom diffusion features in vertical section of the FC bonding interfaces were inspected by using a high resolution transmission electron microscope (HRTEM). Results show that the vibration velocity of a die was about 500mm/s during the traditional FC bonding process, and that of a substrate was only about 180mm/s. It led to the difference of atom diffusion in the FC interfaces. For the given variables, the thickness of atom diffusion at an up-interface (i.e. Au/Al interface) of the FC bonding was about 500nm where was an inter-metallic compound (i.e. AuAl"2), and that of atom diffusion at a down-interface (i.e. Au/Ag interface) was about 200nm. Furthermore, the law of ultrasonic energy conversion was found that the ratio of the up-interface to the down-interface in the FC bonding was statistically about 2.21:1. According to this principle, different bonding processes are suggested to improve the performance of two interfaces. The experimental evaluation confirms the effectiveness of the suggested processes on minimizing the inter-metallic compound layer and equilibrating the thickness of atom diffusion at two interfaces.
Two novel prolog assignments
Authors: Jonathan Mohr
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

This paper describes two simple but novel Prolog assignments. The first extends the family tree example featured in many Prolog textbooks to the problem of tracing the line of succession to the throne of the British royal family. The solution uses a first-child/next-sibling representation of the royal family tree, since the birth order of a royal's children is significant when determining the order of succession. The second is a simple game that combines features of chess and rock-paper-scissors. The game board is a directed graph, rather than a simple grid.
Model-based clustering of array CGH data
Authors: Sohrab P. Shah, K-John Cheung, Nathalie A. Johnson, Guillaume Alain, Randy D. Gascoyne, Douglas E. Horsman, Raymond T. Ng, Kevin P. Murphy
Venue: Bioinformatics (2009)

Motivation: Analysis of array comparative genomic hybridization (aCGH) data for recurrent DNA copy number alterations from a cohort of patients can yield distinct sets of molecular signatures or profiles. This can be due to the presence of heterogeneous cancer subtypes within a supposedly homogeneous population. Results: We propose a novel statistical method for automatically detecting such subtypes or clusters. Our approach is model based: each cluster is defined in terms of a sparse profile, which contains the locations of unusually frequent alterations. The profile is represented as a hidden Markov model. Samples are assigned to clusters based on their similarity to the cluster's profile. We simultaneously infer the cluster assignments and the cluster profiles using an expectation maximization-like algorithm. We show, using a realistic simulation study, that our method is significantly more accurate than standard clustering techniques. We then apply our method to two clinical datasets. In particular, we examine previously reported aCGH data from a cohort of 106 follicular lymphoma patients, and discover clusters that are known to correspond to clinically relevant subgroups. In addition, we examine a cohort of 92 diffuse large B-cell lymphoma patients, and discover previously unreported clusters of biological interest which have inspired followup clinical research on an independent cohort. Availability: Software and synthetic datasets are available at http://www.cs.ubc.ca/~sshah/acgh as part of the CNA-HMMer package. Contact: sshah@bccrc.ca Supplementary information:Supplementary data are available at Bioinformatics online.
Pixelwise Local Binary Pattern Models of Faces Using Kernel Density Estimation
Authors: Timo Ahonen, Matti Pietikäinen
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

Local Binary Pattern (LBP) histograms have attained much attention in face image analysis. They have been successfully used in face detection, recognition, verification, facial expression recognition etc. The models for face description have been based on LBP histograms computed within small image blocks. In this work we propose a novel, spatially more precise model, based on kernel density estimation of local LBP distributions. In the experiments we show that this model produces significantly better performance in the face verification task than the earlier models. Furthermore, we show that the use of weighted information fusion from individual pixels based on a linear support vector machine provides with further improvements in performance.
What were they thinking?
Authors: Roy P. Pargas, Samuel Bryfczynski
Venue: ACM SIGCSE Bulletin (2009)

This paper describes GraphPad, a web-based software tool designed not only to help an instructor of a CS2 or CS7 (data structures) course deliver content and assess student performance, but also to provide an instructor with the unique ability to observe and understand how students solve problems by replaying the students' solutions. GraphPad works with Tablet PCs or PCs with attached WACOM tablets. We describe how GraphPad enables an instructor to: establish a temporary network with the instructor's Tablet as server and the students' Tablets as clients, broadcast instructions and collect student Ink responses, evaluate student submissions and distribute evaluations with a single button-click, use student submissions as examples to guide lecture, and save student submissions in a database. The saved submissions may be replayed and reviewed individually, tagged for errors, and analyzed statistically. We are currently using GraphPad almost daily in a data structures course. A long term goal is to analyze data collected by GraphPad to help understand the thought process of computer science students for the purpose of identifying students at risk early in order to provide intervention assistance.
An Ontology of Situations, Interactions, Processes and Affordances to Support the Design of Intelligent Learning Environments
Authors: Fabio N. Akhras
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

In this paper we discuss the use of an ontology of situations, interactions, processes and affordances in the design of intelligent learning environments. Due to its broad scope, the ontology allows to provide an integrated view of the several aspects involved in the design of these systems. It also allows to address issues related to the connections between the context of learning and what is learned, between knowledge and activity, and between the process and the product of learning, which have been addressed by recent research on education.
A device independent router model: from measurements to simulations
Authors: Sonia Fahmy, Ness B. Shroff
Venue:  (2008)

Simulation, emulation, and wide-area testbeds exhibit different tradeoffs with respect to fidelity, scalability, and manageability. Network security and network planning/dimensioning experiments introduce additional requirements compared to traditional networking and distributed system experiments. For example, high capacity attack or multimedia flows can push packet forwarding devices to the limit and expose unexpected behaviors. Many popular simulation and emulation tools use high-level models of forwarding behavior in switches and routers, and give little guidance on setting model parameters such as buffer sizes. Thus, a myriad of papers report results that are highly sensitive to the forwarding model or buffer size used.In this work, we first motivate the need for better models by performing an extensive comparison between simulation and emulation environments for the same Denial of Service (DoS) attack experiment. Our results reveal that there are drastic differences between emulated and simulated results and between various emulation testbeds. We then argue that measurement-based models for routers and other forwarding devices are crucial. We devise such a model and validate it with measurements from three types of Cisco routers and one Juniper router, under varying traffic conditions. The structure of our model is device-independent, but requires device-specific parameters. The compactness of the parameter tables and simplicity of the model make it versatile for high-fidelity simulations that preserve simulation scalability. We construct a black box profiler to infer parameter tables within a few hours. Our results indicate that our model can approximate different types of routers. Additionally, the results indicate that queue characteristics vary dramatically among the devices we measure, and that backplane contention must be modeled.