ppxscal/embedding_network huggingface dataset:
Selforganizing memory: active learning of landmarks used for navigation
Authors: Holk Cruse, David H&#x00fc;bner
Venue: Biological Cybernetics (2008)

We propose a memory architecture that is suited to solve a specific task, namely homing, that is finding a not directly visible home place by using visually accessible landmarks. We show that an agent equipped with such a memory structure can autonomously learn the situation and can later use its memory to accomplish homing behaviour. The architecture is based on neuronal structures and grows in a self-organized way depending on experience. The basic architecture consists of three parts, (i) a pre-processor, (ii) a simple, one-layered feed-forward network, called distributor net, and (iii) a full recurrently connected net for representing the situation models to be stored. Apart from Hebbian learning and a local version of the delta-rule, explorative learning is applied that is not based on passive detection of correlations, but is actively searching for interesting hypotheses. Hypotheses are spontaneously introduced and are verified or falsified depending on how well the network representing the hypothesis approaches an internal error of zero. The stability of this approach is successfully tested by removal of one landmark or shifting the position of one or several landmarks showing results comparable to those found in biological experiments. Furthermore, we applied noise in two ways. The trained network was either due to sensory noise or to noise applied to the bias weights describing the memory content. Finally, we tested to what extent learning of the weights is affected by noisy input given to the sensor data. The architecture proposed is discussed to have some at least superficial similarity to the mushroom bodies of insects.
The StarCAVE, a third-generation CAVE and virtual reality OptIPortal
Authors: Thomas A. DeFanti, Gregory Dawe, Daniel J. Sandin, Jurgen P. Schulze, Peter Otto, Javier Girado, Falko Kuester, Larry Smarr, Ramesh Rao
Venue: Future Generation Computer Systems (2009)

A room-sized, walk-in virtual reality (VR) display is to a typical computer screen what a supercomputer is to a laptop computer. It is a vastly more complex system to design, house, optimize, make usable, and maintain. 17 years of designing and implementing room-sized ''CAVE'' VR systems have led to significant new advances in visual and audio fidelity. CAVEs are a challenge to construct because their hundreds of constituent components are mostly adapted off-the-shelf technologies that were designed for other uses. The integration of these components and the building of certain critical custom parts like screens involve years of research and development for each new generation of CAVEs. The difficult issues and compromises achieved and deemed acceptable are of keen interest to the relatively small community of VR experimentalists, but also may be enlightening to a broader group of computer scientists not familiar with the barriers to implementing virtual reality and the technical reasons these barriers exist. The StarCAVE, a 3rd-generation CAVE, is a 5-wall plus floor projected virtual reality room, operating at a combined resolution of ~68 million pixels, ~34 million pixels per eye, distributed over 15 rear-projected wall screens and 2 down-projected floor screens. The StarCAVE offers 20/40 vision in a fully horizontally enclosed space with a diameter of 3 m and height of 3.5 m. Its 15 wall screens are newly developed 1.3 mx2 m non-depolarizing high-contrast rear-projection screens, stacked three high, with the bottom and top trapezoidal screens tilted inward by 15^@? to increase immersion, while reducing stereo ghosting. The non-depolarizing, wear-resistant floor screens are lit from overhead. Digital audio sonification is achieved using surround speakers and wave field synthesis, while user interaction is provided via a wand and multi-camera, wireless tracking system.
Longitudinal Study on Web Accessibility Compliance of Government Websites in Korea
Authors: Joonho Hyun, Junki Moon, Kyungsoon Hong
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

The purpose of this paper investigates the status of web accessibility compliance of government websites in Korea. In order to look into the status of these, we used the "Annual web accessibility research" which was conducted by Korea Agency for Digital Opportunity and promotion (KADO) since 2005. Also, this paper introduces Korea web accessibility activities, such as relational laws, policies and guidelines. The result shows that compliance of web accessibility standards have increased by an annual, especially central government and provincial-level government.
Some Results on List Total Colorings of Planar Graphs
Authors: Jianfeng Hou, Guizhen Liu, Jianliang Wu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Let G be a planar graph with maximum degree Δ. In this paper, it is proved that if Δ ¿ 9, then G is total-(Δ + 2)-choosable. Some results on list total coloring of G without cycles of specific lengths are given.
A Manipulable Vision-Based 3D Input Device for Space Curves
Authors: Vincenzo Caglioti, Alessandro Giusti, Lorenzo Mureddu, Pierluigi Taddei
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

This paper presents a novel and user friendly input device for 3D curves. The system is based on a piece of flexible wire and a single off-the-shelf photo camera: the user bends the wire to the desired 3D shape; then, an ad-hoc technique for 3D reconstruction is used to recover its 3D shape (a space curve) from a single image.The result is a simple, unusual input device with many potential applications, ranging from games to 3D modeling. For untrained users, this is a much more intuitive input technique than alternative methods. A disadvantage is that changes to the wire's shape are not reflected in real time on the recovered representation.We give a detailed description of the system's structure, briefly recall the reconstruction technique, and describe a prototype in which the input device is seamlessly integrated in the popular Blender 3D modeling software. We finally show simple example applications in which the shape of the wire is used to define the trajectory of moving objects, to deform a 3D object, and to animate a 3D character.
Minimal representation of type-hierarchies
Authors: Richard Elling Moe
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

We discuss the interpretation and representation of type-hierarchies in the form of bounded complete partial orders, with typing-functions. Within the framework of representation theory we present a technique for cheap representation which is optimal under certain conditions.
The One-Card Binary Loader for the IBM 701
Authors: Floyd E. Johnston
Venue: IEEE Annals of the History of Computing (1983)

Next we publish a description of, and the code for, FEJ 015, a much-used binary loading program, together with an anecdote by FEJ's author, Floyd E. Johnston. 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
Surveying model based testing approaches characterization attributes
Authors: Arilo Claudio Dias Neto, Guilherme Horta Travassos
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

In this paper, we describe the planning, execution, and initial results analysis of a survey accomplished with Model Based Testing researchers and practitioners. This survey has two purposes: observing (1) which attributes could be adequate to characterize Model-based Testing Approaches and (2) what is the relevance of them when selecting MBT approaches for software projects. An initial list of attributes with their relevance has been identified. These results compose a body of knowledge regarding Model-based Testing Approaches intended to support software engineers in using MBT approaches in software projects.
Highly Regular Right-to-Left Algorithms for Scalar Multiplication
Authors: Marc Joye
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

This papers introduces several binary scalar multiplication algorithms with applications to cryptography. Remarkably, the proposed algorithms regularly repeat the same pattern when evaluating a scalar multiplication in an (additively written) abelian group. Furthermore, they are generic and feature the following properties: no dummy operation is involved; no precomputation nor prior recoding is needed; a small number of temporary registers / code memory is required; the scalar is processed right-to-left. As a result, they are particularly well fitted for implementing cryptosystems in constrained devices, in an efficient yet secure way.
Identification and Extraction of Evoked Potentials Based on Borel Spectral Measure for Less Trial Mixtures
Authors: Daifeng Zha
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

A new method for identifying the independent components of an alpha-stable random vector for under-determined mixtures is proposed. The method is based on an estimate of the discrete Borel measure for the characteristic function of an alpha-stable random vector. Simulations demonstrate that the proposed method can identify the basis vectors of evoked potentials in the so-called under-determined case of more sources than mixtures.
The Pairing of Contracts and Session Types
Authors: Cosimo Laneve, Luca Padovani
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

We pair session types and contracts using two encodings. The encoding of session types accommodates width and depth subtyping, two properties that partially hold in contracts. The encoding of contracts accommodates complex synchronization patterns, since session types own a simple control protocol. The encodings allow one to use the two formalisms interchangeably, within the context of dyadic interactions.
Parallel Path-Relinking Method for the Flow Shop Scheduling Problem
Authors: Wojciech Bożejko, Mieczysław Wodecki
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

The matter of using scheduling algorithms in parallel computing environments is discussed in the paper. A parallel path-relinking approach based on scatter search metaheuristics is proposed for the flow shop problem with C max and C sum criteria. Obtained results are very promising: the superlinear speedup is observed for some versions of the parallel algorithm.
Irl (in real life): breaking down the binary of online versus offline social interaction
Authors: Radhika Gajjala
Venue:  (2006)

IRL (In Real Life): Breaking Down The Binary Of Online Versus Offline Social Interaction examines the framework of "real versus virtual" that is often applied to studies of online social activity. This framework is often employed as a default in new media research, influencing a number of areas including the ongoing debate among scholars about whether or not the word "community" can be justly applied to a virtual group. The difficulty lies in the fact that few researchers have examined the framework in a critical context, in particular in the context of our larger narrative of the history of mass media technologies. This research begins with a detailed discussion of the real/virtual binary as a theoretical construct, in order to see if the idea of a sharp separation between online and offline activity is supportable. Having broken down the binary construct, this work turns to a case study of an online community known as "the Bronze," which existed from 1997 to 2001. By utilizing interviews and archival information, the case study examines the ways in which Internet users combine online and offline social activity seamlessly, the ways Internet forums can become integrated into daily activity rather than exist as exotic oases away from normal routines, and concludes with examples of the community organizing to deal with unwanted behavior, and also with a discussion of what the risk of deception in an online space means for the legitimacy of online social interaction.
An Improved Model for a Microcomputer Component-The 6520 PIA
Authors: Donald Hanson
Venue: IEEE Micro (1981)

A student's or designer's ability to predict the outcome a process is only as good as the model for that process.
Social accessibility: achieving accessibility through collaborative metadata authoring
Authors: Hironobu Takagi, Shinya Kawanaka, Masatomo Kobayashi, Takashi Itoh, Chieko Asakawa
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

Web content is under the control of site owners, and therefore the site owners have the responsibility to make their content accessible. This is a basic assumption of Web accessibility. Users who want access to inaccessible content must ask the site owners for help. However, the process is slow and too often the need is mooted before the content becomes accessible. Social Accessibility is an approach to drastically reduce the burden on site owners and to shorten the time to provide accessible Web content by allowing volunteers worldwide to - renovate' any webpage on the Internet. Users encountering Web access problems anywhere at any time will be able to immediately report the problems to a social computing service. Volunteers can be quickly notified, and they can easily respond by creating and publishing the requested accessibility metadata--also helping any other users who encounter the same problems. Site owners can learn about the methods for future accessibility renovations based on the volunteers' external metadata. There are two key technologies to enable this process, the external metadata that allows volunteers to annotate existing Web content, and the social computing service that supports the collaborative renovations. In this paper, we will first review previous approaches, and then propose the Social Accessibility approach. The scenario, implementation, and results of a pilot service are introduced, followed by discussion of future directions.
Handling of Complex Numbers in the $C^H$ Programming Language
Authors: Harry H. Cheng
Venue: Scientific Programming (1993)

The handling of complex numbers in the $C^H$ programming language will be described in this paper. Complex is a built-in data type in $C^H$. The I/O, arithmetic and relational operations, and built-in mathematical functions are defined for both regular complex numbers and complex metanumbers of ComplexZero, Complexlnf, and ComplexNaN. Due to polymorphism, the syntax of complex arithmetic and relational operations and built-in mathematical functions are the same as those for real numbers. Besides polymorphism, the built-in mathematical functions are implemented with a variable number of arguments that greatly simplify computations of different branches of multiple-valued complex functions. The valid lvalues related to complex numbers are defined. Rationales for the design of complex features in $C^H$ are discussed from language design, implementation, and application points of views. Sample $C^H$ programs show that a computer language that does not distinguish the sign of zeros in complex numbers can also handle the branch cuts of multiple-valued complex functions effectively so long as it is appropriately designed and implemented.
Application of Petri Nets on the Execution of IMS Learning Design Documents
Authors: Juan C. Vidal, Manuel Lama, Eduardo Sánchez, Alberto Bugarín
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

In this work we present a Petri net-based approach for modelling the dynamic behavior of units of learning which are level A compliant with the IMS LD specification. The objective is to provide a formal and explicit representation of IMS LD operational semantics. The Petri net models defined are directly interpretable by Petri net engines thus decoupling units of learning behavior from their implementation and allowing consistency checking of the learning flow.
A Comparison of Methods for Learning of Highly Non-separable Problems
Authors: Marek Grochowski, Włodzisław Duch
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

Learning in cases that are almost linearly separable is easy, but for highly non-separable problems all standard machine learning methods fail. Many strategies to build adaptive systems are based on the "divide-and-conquer" principle. Constructive neural network architectures with novel training methods allow to overcome some drawbacks of standard backpropagation MLP networks. They are able to handle complex multidimensional problems in reasonable time, creating models with small number of neurons. In this paper a comparison of our new constructive c3sep algorithm based on k-separability idea with several sequential constructive learning methods is reported. Tests have been performed on parity function, 3 artificial Monks problems, and a few benchmark problems. Simple and accurate solutions have been discovered using c3sep algorithm even in highly non-separable cases.
Learning and Classification of Malware Behavior
Authors: Konrad Rieck, Thorsten Holz, Carsten Willems, Patrick Düssel, Pavel Laskov
Venue: Proceedings of the 5th international conference on Detection of Intrusions and Malware, and Vulnerability Assessment (2008)

Malicious software in form of Internet worms, computer viruses, and Trojan horses poses a major threat to the security of networked systems. The diversity and amount of its variants severely undermine the effectiveness of classical signature-based detection. Yet variants of malware families share typical behavioral patterns reflecting its origin and purpose. We aim to exploit these shared patterns for classification of malware and propose a method for learning and discrimination of malware behavior. Our method proceeds in three stages: (a) behavior of collected malware is monitored in a sandbox environment, (b) based on a corpus of malware labeled by an anti-virus scanner a malware behavior classifier is trained using learning techniques and (c) discriminative features of the behavior models are ranked for explanation of classification decisions. Experiments with different heterogeneous test data collected over several months using honeypots demonstrate the effectiveness of our method, especially in detecting novel instances of malware families previously not recognized by commercial anti-virus software.
From Local Search to Global Behavior: Ad Hoc Network Example
Authors: Osher Yadgar
Venue: Proceedings of the 11th international workshop on Cooperative Information Agents XI (2007)

We introduce the Consensual N-Player Prisoner's Dilemma as a large-scale dilemma. We then present a framework for cooperative consensus formation in large-scale MAS under the N-Person Prisoner's Dilemma. Forming consensus is performed by demonstrating the applicability of a low-complexity physics-oriented approach to a large-scale ad hoc network problem. The framework is based on modeling cooperative MAS by a physics percolation theory. According to the model, agent-systems inherit physical properties, and therefore the evolution of the computational systems is similar to the evolution of physical systems. Specifically, we focus on the percolation theory, the emergence of self-organized criticality, and the exploitation of phase transitions. We provide a detailed low-ordered algorithm to be used by a single agent and implement this algorithm in our simulations. Via these approaches we demonstrate effective message delivery in a large-scale ad hoc network that consists of thousands of agents.
MyPlace Locator: Flexible Sharing of Location Information
Authors: Mark Assad, David J. Carmichael, Judy Kay, Bob Kummerfeld
Venue: Proceedings of the 11th international conference on User Modeling (2007)

As location information plays such an important role in pervasive and context-aware computing, location modelling can be cast as a particularly important user modelling problem. Moreover, given the potential sensitivity of personal information about location, it is critical to ensure adequate user control over the use of the location user modelling information. This paper describes MyPlace Locator, a system for modelling people's location, based upon a range of pervasive sensors. A critical feature, the focus of this paper, is the user model control: users can determine the granularity in space and time of the location information released from their model. Users can do this on the level of a single user or a group of users. We describe the interface and report its qualitative evaluation.
The effect of structural degradation on the dynamic behaviour of buildings
Authors: Tudor Sireteanu
Venue: Proceedings of the 9th WSEAS International Conference on Acoustics & Music: Theory & Applications (2008)

The paper is an analysis of buildings behavior during strong earthquakes, considering the modifications of the structural dynamic characteristics due to strong earthquake - generated damages. The study is focused on the difference in a building behavior, function of the mode the structure is situated relative to the seismic ground motion from the spectral point of view: below resonance or above resonance. Experimental and simulation results are presented for simplified mechanical models of building structures with stiffness degradation. As a convenient measure of the effect of duration and severity of the building seismic loads, the total energy dissipated through hysteresis is considered.
Moment-Based Pattern Representation Using Shape and Grayscale Features
Authors: Mikhail Lange, Sergey Ganebnykh, Andrey Lange
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

A moment-based approach is developed to constructing tree-structured descriptions of patterns given by region-based shapes with grayscale attributes. The proposed representation is approximately invariant with respect to the pattern rotation, translation, scale, and level of brightness. The tree-like structure of the pattern representations provides their independent encoding into prefix code words. Due to this fact, a pattern recognition procedure amounts to decoding a code word of the pattern by the nearest code word from a tree of the code words of selected templates. Efficient application of the pattern representation technique is illustrated by experimental results on signature and hand gesture recognition.
Multichannel and Multimodality Person Identification
Authors: Ming Liu, Yanxiang Chen, Xi Zhou, Xiaodan Zhuang, Mark Hasegawa-Johnson, Thomas Huang
Venue: Multimodal Technologies for Perception of Humans: International Evaluation Workshops CLEAR 2007 and RT 2007, Baltimore, MD, USA, May 8-11, 2007, Revised Selected Papers (2008)

Person's identity is a very important high level information for video analysis and retrieval. Along the growth of multimedia data, the recording is not only multimodality and also multichannel(microphone array, camera array). In this paper, we describe a multimodal person identification system of UIUC team for CLEAR 2007 evaluation. The audio only system is based on a new proposed model --- Chain of Gaussian Mixtures. The visual only system is a face recognition module based on nearest neighbor classifier at appearance space. Final system fuses 7 channel microphone recordings and 4 camera recordings at decision level. The experimental results indicate the effectiviness of speaker modeling methods and the fusion scheme.