ppxscal/embedding_network huggingface dataset:
A quantitative analysis for decomposing visual signal of the gaze displacement
Authors: Xiaoxing Wang, Jesse Jin
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

When the head is unrestrained, the large amplitude gaze shifts are composed of coordinated eye and head movements. The position of the eyes at the onset of the gaze shift can alter the eye and head contributions to the movement. The movements of the eyes and head during the unrestrained-head gaze shift follow well-defined relationships. It is possible to predict the displacement of the eye and head components of the gaze shift, if the position of the target signal in the retina and the initial eye position in the orbit are known. In the present study we provide a quantitative analysis for decomposing the gaze displacement signal and propose a mathematical model to predict the displacement of the eye and head components of the gaze shift. We conclude that the displacements of the eye and the head components are determined by five factors: the current gaze displacement, the initial eye position, the upper limit of the range in which the eyes move freely without head contribution, the lower limit of the range in which the head moves only, and the maximal displacement of the visual target (maximal initial retinal error). The results of our proposed model are inline with data observed physiologically.
Counter Tree Diagrams for Design and Analysis of Fast Addition Algorithms
Authors: Jun Sakiyama, Takafumi Aoki, Tatsuo Higuchi
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

This paper presents a unified representation of fastaddition algorithms based on Counter Tree Diagrams(CTDs).By using CTDs, we can describe and analyzevarious adder architectures in a systematic way withoutusing specific knowledge about underlying arithmeticalgorithms.Examples of adder architectures thatcan be handled by CTDs include Redundant-Binary (R-B)adders, Signed-Digit (SD) adders, Positive-Digit(PD) or carry-save adders, parallel counters (e.g., 3-2counters and 4-2 counters) and networks of suchbasic adders/counters.This paper also discusses theCTD-based design and analysis of carry-propagation-freeadders using redundant number representation.
On the Structure of Syntenic Distance
Authors: David Liben-Nowell
Venue:  (1998)

This paper examines some of the rich structure of the syntenic distance measure of the evolutionary distance between genomes. This model, introduced by Ferretti, Nadeau, and Sankoff, abstracts away from the order of genes, and considers chromosomes as unordered sets of genes. The syntenic distance between two genomes is given by the minimum number of moves (fusing two chromosomes, fissioning one chromosome, or completing a reciprocal translocation between two chromosomes) required to transform one into the other. We consider previously unanalyzed approximation algorithm given by Ferretti et al, and prove that it is in fact a 2-approximation and that, further, it outperforms the algorithm presented by DasGupta et al on all instances. We prove a number of properties which give insight into the structure of optimal move sequences. We prove a monotonicity property for the syntenic distance, and give bounds on the number of moves required to solve the hardest instance of any given size. We then demonstrate that there exist instances in which any move sequence working solely within connected components is $2 \epsilon$ times longer than optimal, which indicates that all previously proposed approximation algorithms can be no better than 2-approximations.
Dependence-Cache Slicing: A Program Slicing Method Using Lightweight Dynamic Information
Authors: Tomonori Takada, Fumiaki Ohata, Katsuro Inoue
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

When we try to debug or to comprehend a large program, it is important to separate suspicious program portions from the overall source program. Program slicing is a promisingtechnique used to extract a program portion; however, such slicing sometimes raises difficulties. Static slicing sometimes produces a large portion of a source program, especially for programs with array and pointer variables, and dynamic slicing requires unacceptably large run-time over-head.In this paper, we propose a slicing method named "dependence-cache slicing", which uses both static and dynamic information. An algorithm has been implemented in our experimental slicing system, and execution data for several sample programs have been collected. The results show that dependence-cache slicing reduces a slice size by 30-90% from static slice size with an increased and affordable run-time overhead, even for programs using array variables. In the future, the dependence-cache slicing will become an important feature for effective debugging environments.
User Evaluations to Guide the Design of an Extended Personal Service Environment for Mobile Services
Authors: Margit C. M. Biemans, Herma Van Kranenburg, Marc M. Lankhorst
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

This paper describes ongoing research on designing and developing personalised mobile services. An iterative research approach on technology push and user pull is applied. The technology push strand uses a top down approach of designing a Personal Service Environment (PSE) for mobile services. The PSE is defined as an environment that assists a user in finding, adapting and using services that fulfil his needs, given his personal profile, his mobility and his context. The user-pull strand conducted user evaluations to gain insights into tailoring behaviour of end-users. In order to derive user-tailoring data for PSE design, a questionnaire on personalisation of cellular phones was conducted. When combining these two approaches, both useful and usable personalised mobile services can be developed.
An Experimental Comparison of Fault and Error Injection
Authors: M. Hiller J. Christmansso, M. Rimén.
Venue: Proceedings of the The Ninth International Symposium on Software Reliability Engineering (1998)

The complex interactions between faults, errors, failures and fault handling mechanisms can be studied via injection experiments. This paper presents an investigation of both fault and error injection techniques for emulating software faults. For evaluation, 1600 software faults and 5400 time-triggered errors were injected into an embedded real-time system. The cost-related results are: (i) the time required to create a fault set for fault injection was about 120 times longer than the time required to create an error set for time-triggered injection and (ii) the execution time for the time-triggered error injection experiments were four times shorther than for the fault injection experiments. However, the error injection would be only 1.3 times faster if another strategy for fault injection had been used. Furthermore, failure symptom related results are: (i) the test case had a greater influence than the fault type on the failure symptoms for fault injections, (ii) the error type had a greater influence on the failure symptom for time-triggered error injections than had the test case and (iii) the error type had a larger impact on the failure symptoms than the fault type.
Co-Planar Shape-Fitting Using the Rotating Squares Algorithm
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Rotating Squares is a method based upon the Marching Cubes algorithm of Lorensen and Cline, [4]. It is used as a method for storing a piece-wise linear approximation of a two-dimensional object, see [1]. Approximations to two distinct shapes can then be easily compared to find common boundary segments. However, it is also possible to use the algorithm to determine how to align the two shapes in a plane, such that they have the longest possible boundary segment in common. It is this issue that is addressed here-in. Examples are given in which, while finding alike boundary segments, the Rotating Squares algorithm does not provide an edge along which the two shapes can be aligned without intruding upon one another. We present a simple test that can be used to indicate any space-sharing violation. Since the motivation for this work arose in three dimensions we go on to give considerations necessary for lifting the algorithms to three dimensions. 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
A Logic for Expressions with Side Effects
Authors: Hans Boehm
Venue:  (1981)

This paper presents a simple programming logic LES, which is particularly well suited for reasoning about so-called expression languages, i.e. languages that incorporate imperative features into expressions rather than distinguishing between expressions and statements. An axiomatization of a simple programming language is presented using this formalism. It is shown that this axiomatization is relatively complete, roughly in the sense of [Coo 76].
Causativity
Authors: M. A Zarco
Venue:  (1998)

Our study falls under the broader framework called Transitivity Alternations, and above all, on the causative/inchoative alternation type. We will focus on a set of causative forms syntactically related and will establish differences across languages. Thus, our comparative study will apply to English, Italian and Spanish. 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
Analytical Tracking Along Streamlines in Temporally LinearRaviart-Thomas Velocity Fields
Authors: Thomas F. Russell, Richard W. Healy
Venue:  (2000)

Numerical simulators of ground-water flow and transport are frequently used to determine streamlines and to estimate travel times and pathways of contaminant movement. These items are often obtained by tracking conceptual water particles through the computational grid using model-calculated flow velocities. Such tracking is also an important component of the Lagrangian part of many methods for transport, in particular the Eulerian-Lagrangian localized adjoint method (ELLAM). We present a procedure for exact analytical particle tracking, given a lowest-order Raviart-Thomas velocity field v(x,y,t) on a rectangular spatial grid, with linear interpolation of v from the beginning to the end of a time step. Thus, on each cell, the x-component of v is bilinear in x and t and constant in y; the y-component is constant in x and bilinear in y and t; also, the spatial normal component is continuous across every cell edge at all times. Analytical tracking with this spatial discretization was considered previously by Pollock (Ground Water, 1988), assuming v constant in t, and by Lu (Water Resources Research, 1994), assuming dv/dt constant in x and y; these works did not treat the bilinearity covered here. Transience in v (Lu and this work) allows a particle to reverse its direction during a time step. The added effect of bilinearity (this work only) can be significant, especially when the velocity field varies in time due to changes in well pumping rates or variable recharge. These effects are discussed qualitatively and illustrated with several test problems that compare the accuracy of the tracking methods.
Client-Site Query Extensions
Authors: Tobias Mayr, Praveen Seshadri
Venue:  (1998)

We explore the execution of queries with client-site user-defined functions (UDFs). Many UDFs can only be executed at the client site, for reasons of scalability, security, confidentiality, or availability of resources. How should a query with client-site UDFs be executed? We demonstrate that the standard execution technique for server-site UDFs performs poorly. Instead, we adapt well-known distributed database algorithms and apply them to client-site UDFs. The resulting query execution techniques are implemented in the Cornell Predator database system, and we present performance results to demonstrate their effectiveness. We also reconsider the question of query optimization in the context of client-site UDFs. The known techniques for expensive UDFs are inadequate because they do not take the location of the UDF into account. We present an extension of traditional ''System-R'' optimizers that suitably optimize queries with client-site operations.
An Integrating Approach for Developing Distributed Software Systems Combining Formal Methods, Software Reuse, and the Experience Base
Authors: Raimund L. Feldmann, Birgit Geppert, Frank Röβler
Venue: Proceedings of the 5th International Conference on Engineering of Complex Computer Systems (1999)

The development of complex software systems is driven by many diverse and sometimes contradictory requirements such as correctness and maintainability of resulting products, development costs, and time-to-market. To alleviate these difficulties, we propose a development method for distributed systems that integrates different basic approaches. First, it combines the use of the formal description technique SDL with software reuse concepts.This results in the definition of a use-case driven, incremental development method with SDL-patterns as the main reusable artifacts. Experience with this approach has shown that there are several other factors of influence, such as the quality of reuse artifacts or the experience of the development team. Therefore, we further combined our SDL-pattern approach with an improvement methodology known from the area of experimental software engineering. In order to demonstrate the validity of this integrating approach, we sketch some representative out-comings of a case study.
Fault-Tolerant Graphs for Tori
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

Motivated by the design of fault-tolerant multiprocessor interconnection networks, this paper considers the following problem: Given a positive integer t and a graph H, construct a graph G from H by adding a minimum number A(t,H) of edges such that even after deleting any t edges from G the remaining graph contains H as a subgraph. We estimate A(t,H) for the torus, which is well-known as a very important interconnection network for multiprocessor systems.
Professional C#, 2 edition
Authors: Simon Robinson, Karli Watson, Jay Glynn
Venue:  (2002)

:This book is for C and C++ programmers looking to move their skill set into web development, Visual Basic programmers looking for a more powerful language and ASP developers who are interested in what C# has to offer. The only requirement is that you are an experienced developer, familiar with at least one other high level language used on Windows - either C++, VB or J++.
Effective Algorithms for the Synthesis Optimization of a Set of Irredundant Diagnostic Tests on the Basis of Genetic Algorithms in the Intelligent System
Authors: Anna E. Yankovskaya, Alex M. Bleikher
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

In the paper effective algorithms for the synthesis optimization of a set of irredundant diagnostic tests with genetic algorithms use to solve problems of large dimension is suggested. Effective algorithms are carried out in two stages. Initial stage involves the synthesis ofperspective populations on the basis of creating the irredundant partial implication matrix sectionalized by classification mechanisms; revealing certain kinds of regularities, which are used combined with genetic transformations for creating a set of irredundant diagnostic tests. In the second stage optimization of a set of already constructed irredundant diagnostic tests iscarried out on the basis of selecting pseudoobligatory genes (features) from a set of perspective chromosomes (a set of irredundant diagnostic tests) constructed at the first stage. The second stage is performed by one of two step-by-step algorithms. All the obligatory, pseudoobligatory, non-informative and little-informative genes are not used in genetic transformations. Effective algorithms for the synthesis optimization were realized in the intelligent recognizing system, which contains the procedures of selection of able-to-compete individuals from populations, decision making concerning the object under investigation on each able-to-compete individual chosen from populations at the second stage, and organizing of voting on a set of these individuals.
A comparative investigation in linear and non-linear fluid viscous dampers for seismic applications
Authors: M. D. Martinez-Rodrigo, M. L. Romero
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The main purpose of the present investigation is to numerically compare the performance of linear and non-linear fluid viscous dampers installed in a multistory structure for seismic energy dissipation. In this paper a steel moment resisting frame subjected to ground acceleration is being analysed. Its original performance is obtained trough a series of non linear time history analyses. Linear and non-linear viscous damping retrofitting is proposed and optimised using the same numerical procedure. A performance and a force index are developed in order to compare the system's behaviour in terms of the devices non-linearity. Finally, and optimum non-linear solution is presented where the structural performance and the forces in the dampers achieve a balanced stage.
PhotoShop Web Graphics F/X and Design
Authors: Laurie Ulrich
Venue:  (2002)

:Web Graphics with Photoshop f/x & Design teaches how to use Photoshop to create special graphics for the Web. Numerous real-world projects are provided in a step-by-step approach making them easy to follow. The accompanying CD-ROM provides Photoshop actions to automate special effects, third-party software (filters and Plug-In organizers) for use with Photoshop, a variety of images, and an interactive page of links to Photoshop resources on the Web. The book also teaches how to use Photoshop with all Adobe Web products, plus how to use Photoshop images with Macromedia Flash and Macromediás Dreamweaver Studio package.
Error-backpropagation in temporally encoded networks of spiking neurons
Authors: S. M. Bohte, J. A. L Poutre, Joost N. Kok
Venue:  (2000)

For a network of spiking neurons that encodes information in the timing of individual spike-times, we derive a supervised learning rule, \emph{SpikeProp}, akin to traditional error-backpropagation and show how to overcome the discontinuities introduced by thresholding. With this algorithm, we demonstrate how networks of spiking neurons with biologically reasonable action potentials can perform complex non-linear classification in fast temporal coding just as well as rate-coded networks. We perform experiments for the classical XOR-problem, when posed in a temporal setting, as well as for a number of other benchmark datasets. Comparing the (implicit) number of spiking neurons required for the encoding of the interpolated XOR problem, it is demonstrated that temporal coding requires significantly less neurons than instantaneous rate-coding.
Near Fine Grain Parallel Processing Using Static Scheduling on Single Chip Multiprocessors
Authors: Keiji Kimura, Hironori Kasahara
Venue: Proceedings of the 1999 International Workshop on Innovative Architecture (1999)

With the increase of the number of transistors integrated on a chip, efficient use of transistors and scalable improvement of effective performance of a processor are getting important problems. However, it has been thought that popular superscalar and VLIW would have difficulty to obtain scalable improvement of effective performance in future because of the limitation of instruction level parallelism. To cope with this problem, a single chip multiprocessor (SCM) approach with multi grain parallel processing inside a chip, which hierarchically exploits loop parallelism and coarse grain parallelism among subroutines, loops and basic blocks in addition to instruction level parallelism, is thought one of the most promising approaches. This paper evaluates effectiveness of the single chip multiprocessor architectures with a shared cache, global registers, distributed shared memory and/or local memory for near fine grain parallel processing as the first step of research on SCM architecture to support multi grain parallel processing. The evaluation shows OSCAR (Optimally Scheduled Advanced Multiprocessor) architecture having distributed shared memory and local memory in addition to centralized shared memory and attachment of global register gives us significant speed up such as 13.8% to 143.8% for four processors compared with shared cache architecture for applications which have been difficult to extract parallelism effectively.
An enumerative algorithm for the frequency assignment problem
Authors: Carlo Mannino, Antonio Sassano
Venue: Discrete Applied Mathematics (2003)

We present an algorithm to solve the frequency assignment problem for mobile cellular systems and radio and television broadcasting. Frequencies must be assigned to transmitters in order to meet interference requirements so that the overall signal/noise ratio is satisfactory. The basic scheme is an exact enumerative method provided with fixing criteria to reduce the size of the instances. Larger instances are solved by applying the algorithm to suitable subinstances, eventually extending the solutions found. We were able to solve large real-life instances arising in radio broadcasting and mobile cellular systems. Computational results outperform previous results reported in the literature.
Microsoft Internet Information Services (Iis) 6.0 Resource Kit
Venue:  (2003)

Deploy and support Internet Information Services (IIS) 6.0 with tools and technical information-straight from the Microsoft IIS product team. 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
Leveled Commitment Contracting among Myopic Individually Rational Agents
Authors: Martin R. Andersson, Tuomas W. Sandholm
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding, i.e., impossible to breach. Such contracts do not allow the agents to act efficiently upon future events. A leveled commitment protocol allows the agents to decommit from contracts by paying a monetary penalty to the contracting partner. The efficiency of such protocols depends heavily on how the penalties are decided.In this paper, different leveled commitment protocols and their parameterizations are empirically compared to each other and to several full commitment protocols. Many different aspects of contracting are studied, such associal welfare achieved, CPU-time usage, and amount of contracting and decommitting.If a global clock is used for increasing the decommitment penalties, infinite decommitment loops are prevented, while a local clock cannot guarantee this. Concerning solution quality, the leveled commitment protocols are significantly better than the full commitment protocols of the same type, but the differences between the different leveled commitment protocols are minor.