ppxscal/embedding_network huggingface dataset:
Remote usability evaluations using the internet
Authors: Ron Perkins
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

Remote evaluation methods are a means to detect usability issues without bringing users into a laboratory. This peper presents a brief survey of remote evaluation methods and discusses some benefits and challenges among the methods. The goal of this paper is to evaluate remote evaluation methods according to the point in a design cycle that thay are most useful, the type of data they can yield, and the degree that a method can detect and shed light on usability issues. The most important measure of a method is Its ability to identify usability issues in a given design. When compared to laboratory evaluations, some remote methods show promise in highly correlated task times and task completion rates on the same application. Two basic questions are: what kind of usability issues can you expect to find with various methods and how can you best use each one?
The distribution of delays of dispersed messages in an M/M/1 queue
Authors: E. Altman, A. Jean-Marie
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

We analyze the distribution of the delay of messages in an infinite capacity M/M/1 queue. A message is composed of n packets, and the arrival of the packets to the queue is Poisson. Our calculations are based on recursive schemes. We obtain explicit expressions for the Laplace-Stieltjes transform (LST) of the delays, which enables to obtain exact expressions for the moments of the delay in a complexity smaller than the one obtained by using recursive schemes. We repeat the above calculations for the case that messages are dispersed, i.e. packets from several sources arrive to an M/M/1 queue and are served according to the FIFO discipline. Hence, several packets of other messages may arrive between consecutive packets of a given message.
Geometric and Photometric Registration for Real-Time Augmented Reality
Authors: Masayuki Kanbara, Naokazu Yokoya
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

This paper proposes an augmented reality system with correct representation of shading and shadow. To realize a seamless augmented reality system, we need to resolve some problems. Especially, the geometric and photometric registration problems are important. These problems require the position of light sources and user's viewpoint. The proposed system resolves the problems using a 3D marker which combines a 2D square marker and a mirror ball. The 2D marker and the ball are used to estimate the relationship between the real and virtual worlds and the positions of light sources in the real world, respectively.
The effect of selected parameters on ship collision results by dynamic FE simulations
Authors: Krzysztof Wisniewski, Przemyslaw Kolakowski
Venue: Finite Elements in Analysis and Design (2003)

The purpose of the paper is to study the effect of selected design parameters on crashworthiness of the struck ship. The dynamic collision process is simulated by the ABAQUS/Explicit code, and two problems are analysed: (1) a plate struck by a cone, and (2) a collision of two ships.The first problem, of a plate struck by a rigid cone, has a preliminary character and validates our FE modelling; a similar crushing force is obtained as in Amdahl and Kavlie (DNV-MIT Workshop on Mechanics of Ship Collision and Grounding, DNV Høvik, Oslo, September) and Simonsen (ISESO Report No. I108.02.02.052.004, Department of Naval Architecture and Offshore Engineering, Technical University of Denmark, April), despite the differences in methods of analysis applied. The current computations go further than the cited papers, and assess the dependence of results on the material model of the plate (including failure), the contact within the plate interior, and the mass of the striking cone.The second problem is of practical interest, as it concerns a collision of a double hull crude oil carrier ship and a container vessel with a bulbous bow. The progress of deformation in time is monitored including large plastic strains as well as contact between the ships, which allows to model crushing and tearing. The effect of the following parameters is assessed: the material model of the struck ship, the friction coefficient for the contact between the vessels, the initial velocity of the striking ship, the motion of the struck ship, and the mass scaling option used to accelerate computations.The included results present the deformed struck objects, and also the crushing force and various types of energy vs. penetration of the striking body. Conclusions are formulated regarding the numerical method used, the striking ship velocity data and the material model for the struck ship.
Atomic Broadcast in Asynchronous Crash-Recovery Distributed Systems
Authors: L. Rodrigues, M. Raynal
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Atomic Broadcast is a fundamental problem of distributed systems: it states that messages must be delivered in the same order to their destination processes. This paper describes a solution to this problem in asynchronous distributed systems in which processes can crash and recover.Chandra and Toueg have designed a Consensus-based solution to Atomic Broadcast problem for asynchronous distributed systems where crashed processes do not recover. Although our solution is based on different algorithmic principles, it follows the same approach: it transforms any Consensus protocol suited to the crash-recovery model into an Atomic Broadcast protocol suited to the same model. We show that Atomic Broadcast can be implemented without requiring any additional log operations in excess of those required by the Consensus. The paper also discusses how additional log operations can improve the protocol in terms of faster recovery and better throughput.
Efficient Distributed Control Protocols for WDM All-Optical Networks
Authors: Yousong Mei, Chunming Qiao
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

Path Multiplexing (PM) and Link Multiplexing (LM) are two approaches for establishing connections (or lightpaths) in optical networks. This paper describes distributed control protocols for establishing lightpaths in WDM networks using LM and PM. We propose and evaluate the performance of two classes of protocols, namely Source Initiated Reservation (SIR) and Destination Initiated Reservation (DIR). It is found that DIR protocols generally perform better than SIR protocols. However, the impacts of DIR protocols on the performance of a network using LM and PM are different.
LEAH: an introduction to behavioral abstraction and co-simulation using Perl and Verilog
Authors: B. Gelinas, K. Dorman, E. Mednick
Venue: Proceedings of the 1996 IEEE International Verilog HDL Conference (IVC '96) (1996)

The paper introduces LEAH, (L2 Emulation Apparatus at a High level), which is a Perl based abstraction of multiprocessor Intel Pentium Pro Processor systems, including processors, memory and I/O subsystems. LEAH is connected to a Verilog simulation through a Unix socket and PLI. Using Perl as its programming base, LEAH abstracts behavior at a high level. Multiple scripts based on the rich facilities of Perl are executed by abstract processors in a multitasking environment. Internal events, such as a cache miss, trigger the use of the Unix socket interface to a Pentium Pro bus interface in the Verilog simulator.
Excel XP
Authors: Claudio Sanchez
Venue:  (2002)

:This is an extensive look at the Excel application found in the Office XP suite. Lessons for creating spreadsheets from the simple to the sophisticated are included, covering basic features, advanced tools, functions, graphics, and spreadsheet management. The book also highlights the new features of this version of Excel.Author Biography: Claudio S&aacute;nchez is an industrial engineer and the author of 10 proyectos con Excel explicados, Gu&iacute;a visual Excel 2000, La biblia de Excel 2000, and T&eacute;cnicas avanzadas con Excel 2000.
Multiresolution Image Morphing in Wavelet Domain
Venue: Proceedings of the International Conference on Information Visualisation (2000)

This paper presents a new view synthesis technique using the 2D discrete wavelet-based view morphing. The view morphing is completely based on pairwise images without the camera calibration and the depth information of images. First, the Fundamental Matrix related to any pair of images is estimated. Then, with the fundamental matrix, the pair of image planes is rectified to be parallel and their corresponding points lie on the same scanline, which gives an opportunity to generate new views with linear interpolating techniques. The pre-warped images are then decomposed into hierarchical structure with wavelet transform. Corresponding coefficients between two decomposed images are therefore linearly interpolated to form the multiresolution representation of an intermediate view. Quantization techniques [10,11] can be embedded here to compress the coefficients to reduce the morphing complexity. Finally, when displaying, compressed images are decoded and inverse wavelet transformed. A post-warping procedure is employed to transform the interpolated views to its desired position.
Implementational Issues in GCLA: Compiling Control
Authors: Martin Aronsson
Venue:  (1993)

The paper describes the basic implementation of GCLA II''s control level. The basis of the implementation is a compiling scheme for transforming inference rules and strategies operating on the object level to an interpreter in Prolog, where the inference rules of the control level are coded inline. This is possible since the operational semantics of the control level is deterministic, i.e. the choice of inference rule to apply on a control level goal is determined solely by the parts of the goal. To handle dynamic clauses, a context list, accessible through some new C-functions linked together with the Prolog system. GCLA I and GCLA II are described shortly, followed by a discussion of a Horn clause representation of inference rules versus functions coding inference rules. Then the transformation of inference rules and strategies is described followed by some examples.
An Algorithm for the Newton Resultant
Authors: John Canny, Paul Pedersen
Venue:  (1993)

Given a system of $n+1$ generic Laurent polynomials, for $i \,=\, 1, \ldots, n+1$, $$\eqlabel(\InputSystem) f_i(\x) \quad = \quad \sum_{q\in \A_i} c_{iq} \,x^q; \qquad q \,=\, (q_1,\ldots,q_n); \qquad \x^q \,=\, x_1^{q_1}x_2^{q_2}\cdots x_n^{q_n}; \eqno(\InputSystem) $$ with (finite) support sets $\A_i \subset L$, where $L$ is some affine lattice isomorphic to $\Z^n$; we consider algorithms for the {\it Newton resultant} $R(f_1,f_2, \ldots, f_{n+1})$. This is the unique (up to sign) irreducible polynomial with coefficients in $\Z$ and monomials in the $c_{iq}$ which determines whether or not system~(\InputSystem) has common roots in the {\it algebraic torus} $(\C-\{0\})^n$. The resultant depends only on the {\it Newton polytopes} $N_i \,:=\, conv(\A_i) \subset \R^n$ of the sets $\A_i$. Our terminology emphasizes the dependence on the combinatorics of the Newton polytopes. The algebraic torus is the natural setting for us because we are interested in the properties of systems of polynomials which are invariant under symmetries of the affine lattice $L$, and translation by $q\in L$ corresponds to multiplication by $x^q$ at the level of polynomials. Since $x^q$ may have negative exponents, we restrict to points none of whose coordinates are zero.
Multilingual Text Categorisation for Global Knowledge Discovery Using Fuzzy Techniques
Authors: Rowena Chau, Chung-Hsing Yeh
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

Enabling navigation among a network of interrelated concepts associating conceptually relevant multilingual documents constitutes the fundamental support to global knowledge discovery. To achieve this, a concept-based approach towards multilingual text categorisation using fuzzy techniques is proposed. First, a language-independent concept space for representing documents regardless of languages is generated using a fuzzy multilingual keyword clustering algorithm based on fuzzy c-means. Second, a fuzzy multilingual text classifier that categorises multilingual documents by concepts is developed using the fuzzy k-nearest neighbour classification technique. Referring to the multilingual text categorisation result as a Yahoo-like directory, concept navigation among the whole multilingual documentcollection is facilitated.
A Note on Wavelet Bases for Two-Dimensional Surfaces
Authors: Stephen A. Vavasis
Venue:  (1990)

Recent work by Beylkin, Coifman and Rokhlin has demonstrated that integral equations for functions of IR can be solved rapidly by expressing the integrands in a wavelet basis. Boundary element methods for solving partial differential equations in three dimension rely on integral equations for functions defined on surfaces embedded in IR3. Accordingly, it is of interest to extend the wavelet work to functions defined on surfaces. In this report, we define a basis of piecewise constant functions on surfaces in IR3 with properties akin to a wavelet basis. The basis we define is not useful for numerical computation because piecewise constant functions have poor approximation properties, but this work suggests an approach to define smoother wavelet bases for surfaces.
A Novel Approach to Implementing On-Chip Synchronous Detection for CMOS Optical Detector Systems
Authors: G. N. Lu, P. Pittet, G. Sou, G. Carrillo, A. El Mourabit
Venue: Analog Integrated Circuits and Signal Processing (2003)

A phase-switching approach suppresses the need to employ a precise multiplier for synchronous demodulation. An improved solution for implementing on-chip synchronous detection consists of using a switched-phase amplifier, which combines pre-amplification and phase-switching operations. This enables circuit simplification, voltage lowering, and power and surface savings. A detector-associated circuit realising pre-amplification and synchronous demodulation is proposed. It includes a transimpedance amplifier, a switched-phase amplifier and a low-pass filter. All these building blocks are designed to operate under a minimum supply of 2 V, using a double-poly, 0.8-&mu;m CMOS process. The designed circuit is to be integrated with a CMOS optical detector for portable applications. System-level simulations (including the detector model) are performed to validate the system operation, and to estimate performances. The sensitivity of the system in terms of minimum detectable optical signal (which is synchronously modulated) is evaluated to be 2.2 10&minus;14 W/mm2 in normal measuring conditions.
Partial and semipartial geometries: an update
Authors: Frank De Clerck
Venue: Discrete Mathematics (2003)

The Handbook of Incidence Geometry (Handbook of Incidence Geometry, Buildings and Foundations, North-Holland, Amsterdam, 1995) appeared in 1995. In Chapter 12, On some rank two geometries, an almost complete overview was given on the status of the theory on partial and semipartial geometries. Now, 5 years later, it is maybe a good time to give an update of this status. Indeed a lot of things have happened during these years. Moreover we take the opportunity to give complete parameter lists of all known examples of partial and semipartial geometries known so far.
Online replication of shared variables
Authors: A. S. Poulakidas, A. K. Singh
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

A linearizable implementation of read/write shared variables in a general distributed system is provided. The proposed system adapts the distribution of the replicas to the pattern of read/write requests, and uses distributed hierarchical indexing to locate replicas.
Progressive Partition Miner: An Efficient Algorithm for Mining General Temporal Association Rules
Authors: Chang-Hung Lee Ming-Syan Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

In this paper, we explore a new problem of mining general temporal association rules in publication databases. In essence, a publication database is a set of transactions where each transaction T is a set of items of which each item contains an individual exhibition period. The current model of association rule mining is not able to handle the publication database due to the following fundamental problems, i.e., 1) lack of consideration of the exhibition period of each individual item and 2) lack of an equitable support counting basis for each item. To remedy this, we propose an innovative algorithm Progressive-Partition-Miner (abbreviated as PPM) to discover general temporal association rules in a publication database. The basic idea of PPM is to first partition the publication database in light of exhibition periods of items and then progressively accumulate the occurrence count of each candidate 2\hbox{-}{\rm{itemset}} based on the intrinsic partitioning characteristics. Algorithm PPM is also designed to employ a filtering threshold in each partition to early prune out those cumulatively infrequent 2\hbox{-}{\rm{itemsets}}. The feature that the number of candidate 2\hbox{-}{\rm{itemsets}} generated by PPM is very close to the number of frequent 2\hbox{-}{\rm{itemsets}} allows us to employ the scan reduction technique to effectively reduce the number of database scans. Explicitly, the execution time of PPM is, in orders of magnitude, smaller than those required by other competitive schemes that are directly extended from existing methods. The correctness of PPM is proven and some of its theoretical properties are derived. Sensitivity analysis of various parameters is conducted to provide many insights into Algorithm PPM.
An industrial application for the JACK environment
Authors: Cinzia Bernardeschi, Stefania Gnesi
Venue:  (1995)

JACK is a new environment integrating a set of formal verification tools, supported by a graphical interface offering facilities to use these tools separately or in combination. The environment proposes several functionalities for the design, analysis and verification of concurrent systems specified using formal methods. In this paper we outline an experience on formal specification of a real railway interlocking system using JACK. Then we verify, by using JACK''s checking capabilities, the correctness of the specification with respect to safety requirements. Our experience shows that the JACK environment can be applied successfully in the verification of real safety critical systems. TEL:: +39-50-593489 EMAIL:: gnesi@iei.pi.cnr.it
Programs as Proofs
Authors: Robert L. Constable
Venue:  (1982)

Programs are like constructive proofs of their specifications. This analogy is a precise equivalence for certain classes of programs. The connection between formal logic and programs is a foundation for programming methodology superior to that usually adopted. Moreover, this equivalence suggests programming languages which are far richer than all others currently in use. These claims are established in this paper introducing parts of the PL/CV programming logics as a source of precision and examples. Key Words and Phrases: Algorithmic logic, automated logic, axiomatic semantics, constructive mathematics, program correctness, PL/CV, programming logic, programming methodology, realizability, while rule.
An architecture for a verilog hardware accelerator
Authors: C. Burns
Venue: Proceedings of the 1996 IEEE International Verilog HDL Conference (IVC '96) (1996)

An architecture of a verilog hardware accelerator is presented. In addition to logic simulation using discrete event simulation in hardware, other aspects of the verilog language, including behavioral simulation, module path delays, and timing checks are addressed in the context of a hardware accelerator.
A Dynamic Shadow Approach for Mobile Agents to Survive Crash Failures
Authors: Simon Pears, Jie Xu, Cornelia Boldyreff
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

Fault tolerance schemes for mobile agents to survive agent server crash failures are complex since developers normally have no control over remote agent servers. Some solutions inject a replica into stable storage upon its arrival at an agent server. However in the event of an agent server crash the replica is unavailable until the agent server recovers. This paper presents a failure model and a revised exception handling framework for mobile agent systems. An exception handler design is presented for mobile agents to survive agent server crash failures. A replica mobile agent operates at the agent server visited prior to its master's current location. If a master crashes its replica is available as a replacement. Experimentalevaluation is performed and performance results are used to suggest some useful design guidelines.
Normalizable, Integrable, and Linearizable Saddle Points for Complex Quadratic Systems in \Bbb C2
Authors: C. Christopher, P. Mardešić, C. Rousseau
Venue: Journal of Dynamical and Control Systems (2003)

In this paper, we consider complex differential systems in the neighborhood of a singular point with eigenvalues in the ratio 1 : &minus;&lambda; with &lambda; &epsi; \Bbb R+*. We address the questions of orbital normalizability, normalizability (i.e., convergence of the normalizing transformation), integrability (i.e., orbital linearizability), and linearizability of the system. As for the experimental part of our study, we specialize to quadratic systems and study the values of &lambda; for which these notions are distinct. For this purpose we give several tools for demonstrating normalizability, integrability, and linearizability.Our main interest is the global organization of the strata of those systems for which the normalizing transformations converge, or for which we have integrable or linearizable saddles as &lambda; and the other parameters of the system vary. Many of the results are valid in the larger context of polynomial or analytic vector fields. We explain several features of the bifurcation diagram, namely, the existence of a continuous skeleton of integrable (linearizable) systems with sequences of holes filled with orbitally normalizable (normalizable) systems and strata finishing at a particular value of &lambda;. In particular, we introduce the Ecalle-Voronin invariants of analytic classifcation of a saddle point or the Martinet-Ramis invariants for a saddle-node and illustrate their role as organizing centers of the bifurcation diagram.
Effects of multimedial technology on student/machine communication
Authors: Giovanna Gazzaniga, AnnaRosa Scarafiotti
Venue:  (1997)

Aim of this work is to show which new, really effective, stimuli the use of multimedia educational systems can bring in the teaching/learning process. By comparing some different, widely experimented, computer uses in education, we shall emphasize what are the true novelties that multimedial technology can offer to education, besides the most appealing ones, coming from the possibility to use colours, sounds, graphics, also animated, and so on. Indeed these last mentioned features could sometimes hide the absence of any educational project. In particular we shall take into consideration the improvements on the student/machine communication process, made possible by educational multimedia systems. EMAIL:: ian@microian.ian.pv.cnr.it