ppxscal/embedding_network huggingface dataset:
Highly-decoupled thread level redundancy
Authors: Michael Huang
Venue:  (2008)

Continued scaling of device dimensions and operating voltage reduces the critical charge and thus natural noise tolerance level of transistors. As a result, circuits can produce transient upsets that corrupt program execution and data. To prevent operational failure due to these errors, system-level techniques such as redundant execution will increasingly be required for fault detection and tolerance in future processors. The increasing prevalence of multi-core architectures makes coarse-grain thread level redundancy (TLR)&mdash;a redundant execution paradigm where duplicate copies of the same thread are executed concurrently either on the same processor or on separate processors&mdash;very attractive. In this dissertation, we introduce a highly decoupled thread level redundant (TLR) architecture that provides a very high level of error coverage without unduly impacting performance for both parallel and single threaded workloads. One of our main design goals is to support a large number of unverified instructions, so that long latencies in verification can easily be tolerated. Supporting a large slack between execution and verification also provides the flexibility required to execute the duplicate thread in a low-power mode to reduce the energy overhead of redundancy. Another important objective is to have comprehensive coverage that includes not only the computation logic but also the coherence and consistency logic in the memory subsystem. Hence, the redundant copy of the program needs to independently access the memory and the system needs to efficiently manage the non-determinism in parallel execution. Buffering a large number of unverified stores presents a microarchitectural challenge as the access latency of a naive store buffer increases significantly with size. We overcome this challenge by introducing a novel store buffering scheme where most of the slow buffer searches are filtered by the L1 cache, thus giving us the capacity without the performance overhead. To manage the non-determinism in parallel execution we propose novel memory access order tracking and enforcement algorithms that require simple, light-weight architectural support. The proposed architectural support to mitigate the challenges is entirely off the processor critical path and can easily be disabled when redundancy is not requested. The significant energy overhead associated with redundancy is a major drawback of conventional TLR architectures. The thesis extensively analyzes the energy overhead of several TLR designs. We propose a new architecture that provides TLR support at a considerably lower energy overhead compared to other designs by parallelizing the verification operation and executing them on a chip multiprocessor with support for frequency and voltage scaling. Finally, we show that the principle of highly decoupled TLR can be applied to mitigate bottlenecks in the uniprocessor pipeline by introducing an alternative memory disambiguation technique.
ReduCE: A Reduced Coulomb Energy Network Method for Approximate Classification
Authors: Nicola Fanizzi, Claudia D'Amato, Floriana Esposito
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

In order to overcome the limitations of purely deductive approaches to the tasks of classification and retrieval from ontologies, inductive (instance-based) methods have been proposed as efficient and noise-tolerant alternative. In this paper we propose an original method based on non-parametric learning: the Reduced Coulomb Energy (RCE) Network. The method requires a limited training effort but it turns out to be very effective during the classification phase. Casting retrieval as the problem of assessing the class-membership of individuals w.r.t. the query concepts, we propose an extension of a classification algorithm using RCE networks based on an entropic similarity measure for OWL. Experimentally we show that the performance of the resulting inductive classifier is comparable with the one of a standard reasoner and often more efficient than with other inductive approaches. Moreover, we show that new knowledge (not logically derivable) is induced and the likelihood of the answers may be provided.
Two new techniques integrated for energy-efficient TLB design
Authors: Yen-Jen Chang, Mao-Feng Lan
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

The translation lookaside buffer (TLB) is an essential component used to speed up the virtual-to-physical address translation. Due to frequent lookup, however, the power consumption of the TLB is usually considerable. This paper presents an energy-efficient TLB design for the embedded processors. In our design, we first propose a real-time filter scheme to facilitate the block buffering to eliminate the redundant TLB accesses without comparator delay. By modifying the address registers to be sensitive to the contents variation, the proposed real-time filter can distinguish the redundant TLB access as soon as the virtual address is generated. The second technique is a banking-like design, which aims to reduce the energy consumption per TLB access in case of block buffer miss. To alleviate the performance penalty introduced by the conventional banking technique, we develop two adaptive variants of the banked TLB. Both variants can achieve the high energy efficiency as the banked TLB while maintaining the low miss ratio as the nonbanked TLB. The experimental results show that by filtering out all the redundant TLB accesses and then minimizing the energy consumption per access, without any performance penalty our design can effectively improve the Energy* Delay product of the TLB, especially for the data TLB with poor locality.
Re-projective Pose Estimation of a Planar Prototype
Authors: Georg Pisinger, Georg Maier
Venue: Proceedings of the 4th International Conference on Computer Vision/Computer Graphics CollaborationTechniques (2009)

We present an approach for robust pose estimation of a planar prototype. In fact, there are many applications in computer graphics in which camera pose tracking from planar targets is necessary. Unlike many other approaches our method minimizes the Euclidean error to re-projected image points. There is a number of recent pose estimation methods, but all of these algorithms suffer from pose ambiguities. If we know the positions of some points on the plane we can describe the 3D position of the planar prototype as a solution of an optimization problem over two parameters. Based on this formulation we develop a new algorithm for pose estimation of a planar prototype. Its robustness is illustrated by simulations and experiments with real images.
The expected value models on Sugeno measure space
Authors: Minghu Ha, Hong Zhang, Witold Pedrycz, Hongjie Xing
Venue: International Journal of Approximate Reasoning (2009)

Uncertain programming is a theoretical tool to handle optimization problems under uncertain environment. The research reported so far is mainly concerned with probability, possibility, or credibility measure spaces. Up to now, uncertain programming realized in Sugeno measure space has not been investigated. The first type of uncertain programming considered in this study and referred to as an expected value model optimizes a given expected objective function subject to some expected constraints. We start with a concept of the Sugeno measure space. We revisit some main properties of the Sugeno measure and elaborate on the g"@l random variable and its characterization. Furthermore, the laws of the large numbers are discussed based on this space. In the sequel we introduce a Sugeno expected value model (SEVM). In order to construct an approximate solution to the complex SEVM, the ideas of a Sugeno random number generation and a Sugeno simulation are presented along with a hybrid approach.
A Variable Resolution Virtual Sensor in Social Behaviour Networks
Authors: Ping Jiang, Yonghong Peng, Quentin Mair, Mingwei Yuan
Venue: Proceeding of the 2005 conference on Self-Organization and Autonomic Informatics (I) (2005)

In today's hyper-competitive business environments virtual organisations are becoming highly dynamic and unpredictable. Individuals may want to work together across organisation boundaries but do not have much prior knowledge of others. The semantic web and its associated new standards appear very promising as candidates to support a new generation of virtual organisations. In this paper a behaviour based organisation, Social Behaviour Networks, is proposed. In order to sense the changes on the web this paper focuses on a virtual sensor for allocating tasks amongst agents based on the announcements of tasks and capabilities of agents in DAML (DARPA Agent Markup Language). Due to the autonomy of agents the announcements are often vague and in a very high dimensional space. The ontology can provide useful information for achieving variable-resolution sensing from an individual agent's perspective and reducing the dimensions of the virtual space. The variable-resolution virtual sensors are based on hierarchical clustering analysis to reveal the level of similarity of announcements in the web.
Guided learning via diagnostic feedback to question responses
Authors: Dominic Palmer-Brown, Chrisina Draganova, Sin Wee-Lee
Venue: ACM SIGCSE Bulletin (2009)

This work in progress investigates the potential of automatically generated diagnostic feedback for guided learning in formative assessments to enhance the students' understanding and interactive learning experience. A method that integrates an on-line Multiple Choice Questions (MCQs) system with a neural network based data analysis is developed.
Higher education provision for the hearing impaired and internet based education in anadolu university- ANAPOD
Authors: M. Cem Girgin, Hakan Senel
Venue: Proceedings of the 8th WSEAS international conference on Electronics, hardware, wireless and optical communication (2009)

Today, in every field of our lives, an efficient information access and mobility has become a prerequisite for the sustainability of all systems. Considering this fact, Internet technology has become the fastest and the most proper media to access the required information worldwide, from our daily questions to scientific researches. Within this rapid development, many Internet compatible applications have been specialized to ease information access and sharing. Increasing demand and applications for web based education services instead of traditional education methods are also one of the reflections of this rapid development. Internet based education models integrated with computer technologies provides the best and most efficient conclusions for mass education process. To meet the mentioned demands and needs, Anadolu University, has been providing higher education opportunities through distance education since 1982. ANAPOD project, which was initiated in November 2007 has been providing a new educational contend production model within University's distance education process. ANAPOD has been proven to be highly applicable to many disciplines. In the year of 2009 School for the Handicap decided to join to the ANAPOD project group for the higher demands of the hearing impaired students. In this paper, ANAPOD project and higher education provision for the hearing impaired students in Anadolu University will be discussed.
Numerical treatment of Powell--Eyring fluid flow using Method of Satisfaction of Asymptotic Boundary Conditions (MSABC)
Authors: Manisha Patel, M. G. Timol
Venue: Applied Numerical Mathematics (2009)

In this article we present a novel approach to the Method of Satisfaction of Asymptotic Boundary Condition (MSABC). Similarity equations for three-dimensional boundary layer flows of non-Newtonian power-law fluids are coupled non-linear ordinary differential equations. The two-dimensional flow is the best approximation of three-dimensional flow. The two-dimensional flow equations are numerically solved for Powell-Eyring fluid model, one of the non-Newtonian fluid models. Numerical results are generated for series of values of parameters in the above described method. The non-linear partial differential equations and their boundary conditions, describing the problem of fluid flow, are transformed into a system of ordinary differential equations using usual similarity transformation.
Information Security Fundamentals
Authors: Hill Associates
Venue:  (2007)

Security is on everyone s mind today. This program examines the key concepts of Information Security (InfoSec), including topics such as: developing security policy documents and guidelines; using administrative, physical, and technical tools to deal with confidentiality, integrity, and availability; risks and threats; firewalls, intrusion detection systems (IDS), and intrusion prevention systems (IPS); encryption and VPNs; and incident response. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Gabor feature constrained statistical model for efficient landmark localization and face recognition
Authors: Sanqiang Zhao, Yongsheng Gao, Baochang Zhang
Venue: Pattern Recognition Letters (2009)

Feature extraction and classification using Gabor wavelets have proven to be successful in computer vision and pattern recognition. Gabor feature-based Elastic Bunch Graph Matching (EBGM), which demonstrated excellent performance in the FERET evaluation test, has been considered as one of the best algorithms for face recognition due to its robustness against expression, illumination and pose variations. However, EBGM involves considerable computational complexity in its rigid and deformable matching process, preventing its use in many real-time applications. This paper presents a new Constrained Profile Model (CPM), in cooperation with Flexible Shape Model (FSM) to form an efficient localization framework. Through Gabor feature constrained local alignment, the proposed method not only avoids local minima in landmark localization, but also circumvents the exhaustive global optimization. Experiments on CAS-PEAL and FERET databases demonstrated the effectiveness and efficiency of the proposed method.
A replacement policy for a repairable system with its repairman having multiple vacations
Authors: Jishen Jia, Shaomin Wu
Venue: Computers and Industrial Engineering (2009)

This paper considers a replacement policy for a repairable system with a repairman, who can have multiple vacations. If the system fails and the repairman is on vacation, it will wait for repair until the repairman is available. Assuming that the system can not be repaired ''as good as new'' and a repair upon failure can be performed immediately with a probability of p, we optimise replacement policy using geometric processes. The explicit expression of the expected cost rate is derived, and the corresponding optimal policy can be determined analytically or numerically. Finally, a numerical example is given to illustrate the theoretical results of the model.
Undergraduate research in CS: a global perspective
Authors: Lawrence D'Antonio, Roger Boyle, Amruth Kumar, Logan Muller, Claudia Roda, Matti Tedre
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

This panel will consider the issues related to undergraduate research in computer science from a global perspective. Panelists from different countries and varied backgrounds will relate their experiences in conducting such research.
SOFSEM 2009: Theory and Practice of Computer Science 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mln, Czech ... Computer Science and General Issues), 1st edition
Authors: Mogens Nielsen, Antonin Kucera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma, Frank Valencia
Venue:  (2009)

This book constitutes the refereed proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2009, held in pindleruv Mln, Czech Republic, in January 2009. The 49 revised full papers, presented together with 9 invited contributions, were carefully reviewed and selected from 132 submissions. SOFSEM 2009 was organized around the following four tracks: Foundations of Computer Science; Theory and Practice of Software Services; Game Theoretic Aspects of E-commerce; and Techniques and Tools for Formal Verification.
Automatic Bayesian quantile regression curve fitting
Authors: Colin Chen, Keming Yu
Venue: Statistics and Computing (2009)

Quantile regression, including median regression, as a more completed statistical model than mean regression, is now well known with its wide spread applications. Bayesian inference on quantile regression or Bayesian quantile regression has attracted much interest recently. Most of the existing researches in Bayesian quantile regression focus on parametric quantile regression, though there are discussions on different ways of modeling the model error by a parametric distribution named asymmetric Laplace distribution or by a nonparametric alternative named scale mixture asymmetric Laplace distribution. This paper discusses Bayesian inference for nonparametric quantile regression. This general approach fits quantile regression curves using piecewise polynomial functions with an unknown number of knots at unknown locations, all treated as parameters to be inferred through reversible jump Markov chain Monte Carlo (RJMCMC) of Green (Biometrika 82:711---732, 1995). Instead of drawing samples from the posterior, we use regression quantiles to create Markov chains for the estimation of the quantile curves. We also use approximate Bayesian factor in the inference. This method extends the work in automatic Bayesian mean curve fitting to quantile regression. Numerical results show that this Bayesian quantile smoothing technique is competitive with quantile regression/smoothing splines of He and Ng (Comput. Stat. 14:315---337, 1999) and P-splines (penalized splines) of Eilers and de Menezes (Bioinformatics 21(7):1146---1153, 2005).
Assessing and managing mobile technostress
Authors: Jui-Chen Yu, Lung-Hsing Kuo, Li-Min Chen, Hung-Jen Yang, Hsieh-Hua Yang, Wen-Chen Hu
Venue: WSEAS TRANSACTIONS on COMMUNICATIONS (2009)

From time to time, new technology brings people impacts. Mobile information system provides new way for manipulating information in both directions, sending out and bringing in. Anywhere and anytime are both the characteristics of mobile technology that people could get rid of. The purpose of this study was to explore mobile technostress and bring up the discussion of assessing and managing. A balance theory was concluded and how to cope with mobile technostress was also discussed.
Interactive Authoring Support for Adaptive Educational Systems
Authors: Peter Brusilovsky, Sergey Sosnovsky, Michael Yudelson, Girish Chavan
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

A well-known challenge of adaptive educational systems is the need to develop intelligent content, which is very time and expertise consuming. In traditional approaches a teacher is kept at a distance from intelligent authoring. This paper advocates the involvement of teachers in creating intelligent content. We are presenting an approach to the development of intelligent content as well as an authoring tool for teachers that support our approach. This approach has two main stages: elicitation of concepts from content elements and the identification of a prerequisite/outcome structure for the course. The resulting sequence of adaptive activities reflects the author's view of the course's organization. The developed tool facilitates concept elicitation in two ways: it provides an author with an automatic indexing component and also allows her/him to edit the index using the domain ontology as an authoring map.
Sora: high performance software radio using general purpose multi-core processors
Authors: Kun Tan, Jiansong Zhang, Ji Fang, He Liu, Yusheng Ye, Shen Wang, Yongguang Zhang, Haitao Wu, Wei Wang, Geoffrey M. Voelker
Venue: Proceedings of the 6th USENIX symposium on Networked systems design and implementation (2009)

This paper presents Sora, a fully programmable software radio platform on commodity PC architectures. Sora combines the performance and fidelity of hardware SDR platforms with the programmability and flexibility of general-purpose processor (GPP) SDR platforms. Sora uses both hardware and software techniques to address the challenges of using PC architectures for high-speed SDR. The Sora hardware components consist of a radio front-end for reception and transmission, and a radio control board for high-throughput, low-latency data transfer between radio and host memories. Sora makes extensive use of features of contemporary processor architectures to accelerate wireless protocol processing and satisfy protocol timing requirements, including using dedicated CPU cores, large low-latency caches to store lookup tables, and SIMD processor extensions for highly efficient physical layer processing on GPPs. Using the Sora platform, we have developed a demonstration radio system called SoftWiFi. SoftWiFi seamlessly interoperates with commercial 802.11a/b/g NICs, and achieves equivalent performance as commercial NICs at each modulation.
Modeling biological reactivity: statecharts vs. Boolean logic
Authors: Naaman Kam, Irun R. Cohen, David Harel
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

Remarkable progress in various fields of biology is leading in the direction of a complete map of the building blocks of biological systems. There is broad agreement among researchers that 21st century biology will focus on attempting to understand how component parts collaborate to create a whole. It is also well agreed that this transition of biology from identifying the building blocks (analysis) to integrating the parts into a whole (synthesis) should rely on the language of mathematics. In a recent publication, we described the results of a first attempt at confronting the above challenge using the visual formalism of statecharts. We presented a detailed model for T cell activation using statecharts within the general framework of object-oriented modeling. In this work, we compare the statechart-based modeling approach to a Boolean formalism presented by Thomas & D'Ari. This comparison was done by taking a model for T cell activation and anergy, which was constructed by Kaufman et al. using such a Boolean formalism, and translating it into the language of statecharts. Comparing these two representations of the same phenomena allows us to assess the advantages and disadvantages of each modeling approach. We believe that the results of this work, together with the results of our previous modeling work on T cell activation, should encourage the use of visual formalisms such as statecharts for modeling complex biological systems. A full version of this paper appeared in the proceedings of the Second International Conference on Systems Biology, Pasadena, CA, USA, 2001 [9].
Virtual sandbox: adding groupware abilities to Scratch
Authors: Timo Göttel
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

This paper highlights shortcomings of programming environments designed for novices to be used as a collaborative tool in game design. It also addresses these issues in the context of the bad image of informatics today. This article focuses on the graphical programming environment Scratch, which is well received by pupils and teachers. We will present observations on group behavior using Scratch in two projects at schools. The pupils were between 12 and 18 years old and had to design games within a week. Finally, we will introduce a Scratch mock-up to support collaboration, whose features were derived from our observations.