ppxscal/embedding_network huggingface dataset:
NEmESys: neural emotion eliciting system
Authors: Manfred Eckschlager, Regina Bernhaupt, Manfred Tscheligi
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This paper describes the development of a new model of agent emotion elicitation called Nemesys. It enhances interfaces with emotional and social information. Nemesys is based on an artificial neural network and is able to learn six basic emotional states. The elicitation of emotions is based on models drawn from the state of the art in modeling emotions in the field of psychology. Further the described framework includes the Five-Factor Model of Personality to represent different agent personalities.Nemesys (called after Nemesis, the Greek goddess of righteous anger) is designed to perform in various types of interfaces. The usage of Nemesys is presented with an application scenario employing a commercial 3D game-engine. Additionally a critical review of the current elicitation behavior of Nemesys is presented and discussed.
Teaching assembly language without using (as much) assembly language
Authors: Scott B. Hunter
Venue: Journal of Computing Sciences in Colleges (2005)

According to the MIT Jargon Dictionary, "C is often described, with a mixture of fondness and disdain varying according to the speaker, as 'a language that combines all the elegance and power of assembly language with all the readability and maintainability of assembly language. "' [E] This suggests that one should be able to use C, or something like it, to teach many (if not most) of the concepts covered in an assembly language course. This paper describes one such approach, using a limited version of Java. It describes how using such a language can ease the introduction of assembly language concepts due to the language being both more forgiving of, and more familiar to, the students. Assembly language concepts amenable to this approach are detailed, as are those that are not.
Mission-critical management of mobile sensors: or, how to guide a flock of sensors
Authors: Goce Trajcevski, Peter Scheuermann, Herve Brönnimann
Venue: Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004 (2004)

This work addresses the problem of optimizing the deployment of sensors in order to ensure the quality of the readings of the value of interest in a given (critical) geographic region. As usual, we assume that each sensor is capable of reading a particular physical phenomenon (e.g., concentration of toxic materials in the air) and transmitting it to a server or a peer. However, the key assumptions considered in this work are: 1. each sensor is capable of moving (where the motion may be remotely controlled); and 2. the spatial range for which the individual sensor's reading is guaranteed to be of a desired quality is limited. In scenarios like disaster management and homeland security, in case some of the sensors dispersed in a larger geographic area report a value higher than a certain threshold, one may want to ensure a quality of the readings for the affected region. This, in turn, implies that one may want to ensure that there are enough sensors there and, consequently, guide a subset of the rest of the sensors towards the affected region. In this paper we explore variants of the problem of optimizing the guidance of the mobile sensors towards the affected geographic region and we present algorithms for their solutions.
Seeing-Is-Believing: Using Camera Phones for Human-Verifiable Authentication
Authors: Jonathan M. McCune, Adrian Perrig, Michael K. Reiter
Venue: Proceedings of the 2005 IEEE Symposium on Security and Privacy (2005)

Current mechanisms for authenticating communication between devices that share no prior context are inconvenient for ordinary users, without the assistance of a trusted authority. We present and analyze Seeing-Is-Believing, a system that utilizes 2D barcodes and camera-phones to implement a visual channel for authentication and demonstrative identification of devices. We apply this visual channel to several problems in computer security, including authenticated key exchange between devices that share no prior context, establishment of a trusted path for configuration of a TCG-compliant computing platform, and secure device configuration in the context of a smart home.
Focusing software education on engineering
Authors: John C. Knight
Venue: ACM SIGSOFT Software Engineering Notes (2005)

The software crisis is still with us. In fact, it is worse than it has ever been, and we see evidence of the crisis regularly. All manner of applications from desktop systems to large-scale information systems are delivered late, exceed their projected budgets, and fail in various ways leading to inconvenience, loss of service, and loss of revenue. A recent study by the National Institute of Standards and Technology found that software errors cost the U.S. Economy about $59.5 billion annually [4] National Institute of Standards and Technology, The Economic Impacts of Inadequate Infrast].
Automatic generation and maintenance of correct spreadsheets
Authors: Martin Erwig, Robin Abraham, Irene Cooperstein, Steve Kollmansberger
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Existing spreadsheet systems allow users to change cells arbitrarily, which is a major source of spreadsheet errors. We propose a system that prevents errors in spreadsheets by restricting spreadsheet updates to only those that are logically and technically correct. The system is based on the concept of templates that describe the principal structure of the initial spreadsheet and all of its future versions. We have developed a program generator that translates a template into an initial spreadsheet together with customized update operations for changing cells and inserting/deleting rows and columns for this particular template.We have designed a type system for templates that ensures the following form of "spreadsheet maintenance safety": Update operations that are generated from a type-correct template are proved to transform the spreadsheet only according to the template and to never produce any omission, reference, or type errors.Finally, we have developed a prototype as an extension to Excel, which has been shown by a preliminary usability study to be well accepted by end users.
A Fast URL Lookup Engine for Content-Aware Multi-Gigabit Switches
Authors: Nen-Fu Huang, Rong-Tai Liu, Chih-Ho Chen, Ying-Tsun Chen, Li-Wen Huang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Cluster-based servers are one of the best solutions to build high-performance, scalable, and reliable Internet Web servers. A number of researches have been done about enabling the dispatcher in cluster-based web servers to route the users requests based on higher layer information, such as URLs. Hashing functions and tree structure are often used to achieve the goal of URL lookup, but they may cause the problem of collision and result in unacceptable performance. This paper presents a fast scalable URL lookup mechanism that uses Content Addressable Memory (CAM) as the basic hardware components. Our scheme not only supports exact matching of URL lookup, but also provides prefix-matching lookup ability so that it is very practically for URL Content-Filtering like systems. The proposed scheme takes constant time to lookup a URL and furnishes a rate of 100 million lookups per second. By applying the entry reuse concept, the expensive CAM space can be used in a more efficient way to store more URLs. With this fast URL lookup engine, the performance of content dispatchers or URL content filters can be greatly improved.
A Direct Method for Modeling Non-Rigid Motion with Thin Plate Spline
Authors: Jongwoo Lim, Ming-Hsuan Yang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Thin plate spline (TPS) transformations have been applied to non-rigid shape matching with impressive results. However, existing methods often use a sparse set of point correspondences which are established prior to shape matching. A straightforward approach to finding point correspondences and computing TPS parameters imposes expensive computations, thereby motivating us to develop an efficient solution. In this paper, we present a direct method for recovering non-rigid object motion from its appearance in which the point correspondences are simultaneously established while estimating TPS parameters. The motion parameters are estimated in a stiff-to-flexible approach and the principal appearance deformations are learned that can be utilized for motion analysis and recognition. Numerous experiments demonstrate the efficiency and efficacy of the proposed algorithm in modeling the motion details of non-rigid objects undergoing shape deformation and pose variation.
Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
Authors: Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
Venue: Journal of Computer and System Sciences (2005)

We study an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (a"i,w"i) for i=1,...,n and w"i>0, a segmentA(i,j) is a consecutive subsequence of A starting with index i and ending with index j. The width of A(i,j) is w(i,j)=@?"i"=
Tuning and testing scrolling interfaces that automatically zoom
Authors: Andy Cockburn, Joshua Savage, Andrew Wallace
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Speed dependent automatic zooming (SDAZ) is a promising refinement to scrolling in which documents are automatically zoomed-out as the scroll rate increases. By automatically zooming, the visual flow rate is reduced enabling rapid scrolling without motion blur. In order to aid SDAZ calibration we theoretically and empirically scrutinise human factors of the speed/zoom relationship. We then compare user performance with four alternative text-document scrolling systems, two of which employ automatic zooming. One of these systems, which we term 'DDAZ', is based on van Wijk and Nuij's recent and important theory that calculates optimal pan/zoom paths between known locations in 2D space. van Wijk and Nuij suggested that their theory could be applied to scrolling, but did not implement or test their formulaic suggestions. Participants in our evaluation (n=27) completed scrolling tasks most rapidly when using SDAZ, followed by DDAZ, normal scrollbars, and traditional rate-based scrolling. Workload assessments and preferences strongly favoured SDAZ. We finish by examining issues for consideration in commercial deployments.
Level-of-detail for cognitive real-time characters
Authors: Christoph Niederberger, Markus Gross
Venue: The Visual Computer: International Journal of Computer Graphics (2005)

We present a solution for the real-time simulation of artificial environments containing cognitive and hierarchically organized agents at constant rendering framerates. We introduce a level-of-detail concept to behavioral modeling, where agents populating the world can be both reactive and proactive. The disposable time per rendered frame for behavioral simulation is variable and determines the complexity of the presented behavior. A special scheduling algorithm distributes this time to the agents depending on their level-of-detail such that visible and nearby agents get more time than invisible or distant agents. This allows for smooth transitions between reactive and proactive behavior. The time available per agent influences the proactive behavior, which becomes more sophisticated because it can spend time anticipating future situations. Additionally, we exploit the use of hierarchies within groups of agents that allow for different levels of control. We show that our approach is well-suited for simulating environments with up to several hundred agents with reasonable response times and the behavior adapts to the current viewpoint.
MPTP -- Motivation, Implementation, First Experiments
Authors: Josef Urban
Venue: Journal of Automated Reasoning (2004)

We describe a number of new possibilities for current theorem provers that arise with the existence of large integral bodies of formalized mathematics. Then we describe the implementation of the MPTP system, which makes the largest existing corpus of formalized mathematics available to theorem provers. MPTP (Mizar Problems for Theorem Proving) is a system for translating the Mizar Mathematical Library (MML) into untyped first-order format suitable for automated theorem provers and for generating theorem-proving problems corresponding to MML. The first version generates about 30,000 problems from complete proofs of Mizar theorems and about 630,000 problems from the simple (one-step) justifications done by the Mizar checker. We describe the design and structure of the system, the main problems encountered in this kind of system, their solutions, current limitations, and planned extensions. We present results of first experiments with re-proving the MPTP problems with theorem provers. We also describe first implementation of the Mizar Proof Advisor (MPA) used for selecting suitable axioms from the large library for an arbitrary problem and, again, present first results of this combined MPA/ATP architecture on MPTP.
Research on Grid Resource Reliability Model Based on Promise
Authors: Li MaoSheng, Yang ShouBao, Fu QianFei, Yang Jin
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

To distinguish the reliabilities of different resources is difficult in the grid environment. For the first time the signaling game theory is applied to the research on grid resource reliability, and a grid resource reliability model based on promise is proposed in this paper. The analyses and the emulation results indicate that the resource provider should abandon the cheating motivation voluntarily. The resource demander could make right decision without other nodes' recommendations, the calculation andcommunication is reduced remarkably. This is a new solution to the problem of distinguishing resources reliabilities in the grid environment.
Optimizing Checkpoint Sizes in the C3 System
Authors: Daniel Marques, Greg Bronevetsky, Rohit Fernandes, Keshav Pingali, Paul Stodghil
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11 (2005)

The running times of many computational science applications are much longer than the mean-time-between-failures (MTBF) of current high-performance computing platforms. To run to completion, such applications must tolerate hardware failures. Checkpoint-and-restart (CPR) is the most commonly used scheme for accomplishing this - the state of the computation is saved periodically on stable storage, and when a hardware failure is detected, the computation is restarted from the most recently saved state. Most automatic CPR schemes in the literature can be classified as system-level checkpointing schemes because they take core-dump style snapshots of the computational state when all the processes are blocked at global barriers in the program. Unfortunately, a system that implements this style of checkpointing is tied to a particular platform amd cannot optimize the checkpointing process using application-specific knowledge. We are exploring an alternative called automatic applicationlevel checkpointing. In our approach, programs are transformed by a pre-processor so that they become self-checkpointing and self-restartable on any platform. In this paper, we evaluate a mechanism that utilizes application knowledge to minimize the amount of information saved in a checkpoint.
Free-form deformation with weighted T-spline
Authors: Wenhao Song, Xunnian Yang
Venue: The Visual Computer: International Journal of Computer Graphics (2005)

A new method of free-form deformation, w-TFFD, is proposed, for which an original shape is deformed using weighted T-spline volumes. We generalize T-splines to weighted T-spline volumes that also permit T-junctions. Weighted T-spline volumes are a natural generalization of NURBS volumes but permit more flexible control lattices. Thus, w-TFFD holds many virtues of traditional FFDs and is more adaptive to objects with arbitrary topology or complex shape. The lattices can be automatically generated and approximate the shape of the object arbitrarily close by octree subdivision.Besides constructing and deforming a multiresolution lattice, users can also sculpt specific local details to their required shape by modifying weights. A set of direct-acting tools that are similar to previously proposed techniques can be applied to w-TFFD.
Computational aspects of protein functionality: Conference Reviews
Authors: R. C. Paton, C.-H. Toh
Venue: Comparative and Functional Genomics (2004)

The purpose of this short article is to examine certain aspects of protein functionality with relation to some key organizing ideas. This is important from a computational viewpoint in order to take account of modelling both biological systems and knowledge of these systems. We look at some of the lexical dimensions of the function and how certain constructs can be related to underlying ideas. The pervasive computational metaphor is then discussed in relation to protein multifunctionality, and the specific case of von Willebrand factor as a &lsquo;smart&rsquo; multifunctional protein is briefly considered. Some diagrammatic techniques are then introduced to better articulate protein function. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Improved dense via yields of Cu/CVD low k CoralTM dual damascene metallization at post Cu cap etch wet clean
Authors: C. F. Tsang, C. K. Chang, Y. J. Su, H. Y. Li, L. Y. Wong, W. H. Li, M. L. Koh
Venue: Microelectronic Engineering (2004)

130 nm technology uses Cu/low k materials integration for the back-end-of-line (BEOL) process. The motivation of this work is to improve the electrical performance of Cu/CVD low k Coral(TM) dual damascene metallization through optimization of the Cu cap etch wet clean. Two types of wet clean chemicals (amine- and fluoride-based mixtures) were selected for the study, using either a conventional batch spray process or single wafer cleaning system. The single wafer cleaning system provides an efficient means of removing polymeric residues (especially the via sidewall and bottom) with the application of mega-sonic acoustic agitation. On the whole, we achieved excellent physical, electrical and burn-in reliability results for the interconnects processed from single wafer cleaning system with ST250(TM) at post Cu cap etch. The fabricated wafers achieved electrical yields >95% for the dense via chains before and after 500 h burn-in reliability tests.
Symbol Error Probability for Rectangular M-QAM OFDM Transmission over Rayleigh Fading Channels
Authors: Rainfield Y. Yen, Hong-Yu Liu
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

By using what we call the pre-averaging method, an exact closed form expression for the symbol error probability (SEP) is derived for arbitrary rectangular M-QAM signaling in OFDM systems over frequency-selective Rayleigh fading channels. In addition, the channel capacity for the QAM OFDM transmission over Rayleigh fading environment is obtained.
Nonexistence of [n, 5, d]q Codes Attaining the Griesmer Bound for q4 - 2q2 - 2q + 1 ≤ d ≤ q4 - 2q2 - q
Authors: E. J. Cheon, T. Kato, S. J. Kim
Venue: Designs, Codes and Cryptography (2005)

We prove that there does not exist a [q4+q3¿q2¿3q¿1, 5, q4¿2q2¿2q+1]q code over the finite field $$\mathbb{F}_q$$ for q¿ 5. Using this, we prove that there does not exist a [gq(5, d), 5, d]q code with q4 ¿2q2 ¿2q +1 ¿ d ¿ q4 ¿2q2 ¿q for q¿ 5, where gq(k,d) denotes the Griesmer bound.
The Lixto data extraction project: back and forth between theory and practice
Authors: Georg Gottlob, Christoph Koch, Robert Baumgartner, Marcus Herzog, Sergio Flesca
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

We present the Lixto project, which is both a research project in database theory and a commercial enterprise that develops Web data extraction (wrapping) and Web service definition software. We discuss the project's main motivations and ideas, in particular the use of a logic-based framework for wrapping. Then we present theoretical results on monadic datalog over trees and on Elog, its close relative which is used as the internal wrapper language in the Lixto system. These results include both a characterization of the expressive power and the complexity of these languages. We describe the visual wrapper specification process in Lixto and various practical aspects of wrapping. We discuss work on the complexity of query languages for trees that was inseminated by our theoretical study of logic-based languages for wrapping. Then we return to the practice of wrapping and the Lixto Transformation Server, which allows for streaming integration of data extracted from Web pages. This is a natural requirement in complex services based on Web wrapping. Finally, we discuss industrial applications of Lixto and point to open problems for future study.
Sensor Inter-Vehicle Communication for Safer Highways
Authors: Mimoza Durresi, Arjan Durresi, Leonard Barolli
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In this paper we present a sensor inter-vehicle communication protocol based on geographical routing. Sensors installed in cars continuously gather important information about: air bags, distance detection, mechanical and electronic parts, tire pressure, collision force, direction of impact and the car and its passengersý conditions. Our proposed protocol enables transmission of these information on point-to-point communications between cars in highway. The protocol is designed for highway travelers but can be used in any mobile ad-hoc network. The highway is divided in virtual cells, which moves as the vehicles moves. The cell members choose a center that will behave for a certain time interval as a Base Station. Every node has its geographical position given by Global Positioning System (GPS). When a source node has a message for a destination node, forwards it to its Cell Center. Then the message is forwarded through the other Cell Centers. The Cell Centers first verifies if the destination node belongs to their cell. Finally the destination Cell Center will send the message to the destination node. Our simulation results show that our proposed protocol improves the network utilization compared to existing inter-vehicles protocols. The protocol can be used to implement differentiated mobile services and message prioritization. Through simulation evaluations, we show that our protocol is very scalable and reduces the latency compared existing solutions.