ppxscal/embedding_network huggingface dataset:
Body Tracking in HumanWalk from Monocular Video Sequences
Authors: Frederic Jean, Robert Bergevin, Alexandra Branzan Albu
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

This paper proposes a method to automatically track human body parts in the context of gait modelisation and recognition. The proposed approach is based on a five points human model (head, hands, and feet) where the points are detected and tracked independently. Tracking is fully automatic (no manual initialization of the five points) since it will be used in a real-time surveillance system. Feet are detected in each frame by first finding the space between the legs in the human silhouette. The issue of feet self-occlusion is handled using optical flow and motion correspondence. Skin color segmentation is used to find hands in each frame and tracking is achieved by using a bounding box overlap algorithm. The head is defined as the mass center of a region of the upper silhouette.
Designing, Developing, and Implementing a Document Repository
Authors: Joshua S. Simon, Liza Weissler
Venue: Proceedings of the 17th USENIX conference on System administration (2003)

Our company had grown large enough and complex enough to require a centralized repository for its documentation. Various internal groups produced all sorts of documentation; regions and districts produced documentation for and about clients, including proposals for work and the results of work performed. Often the documentation produced did not take advantage of previously-produced work.The Repository project intended to centralize all documentation in a single "one-stop shop" for creating, updating, storing, and searching documents, to provide various information about every document so documentation authors and information gatherers could search for and use or reuse existing similar documentation as appropriate. It also was intended to be minimally intrusive for both the authors and the users of the documentation. This allowed the company to enforce a common look-and-feel for all documents within a certain type and for consistency in content as well. Other goals included the ability to update content in exactly one location and have that change propagated throughout all relevant documentation.The user interface had to be simple enough for nontechnical people (managers, sales staff, administrative assistants, and so on) to be able to use it to add, edit, and search for documents meeting their variable criteria, and yet complex enough to be meaningful in terms of the results. Because of the high costs of solving this problem correctly, we decided to take a low-key internal approach to the project instead.
Using RoleOf Relationship in Design Pattern Instantiation
Authors: Chengwan He, Keqing He, Fei He, Feng Yao, Jin Liu
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

The scattering of pattern logic(the attributes and methods of pattern role) is the most typical problem on design pattern instantiation, that is, pattern logic scatters across multiple business classes, which causes problems, such as, debasing the reusability of pattern logic, losing the instantiation information of pattern (traceability and overlapping problem) etc. To resolve these problems in design level, an approach to design pattern instantiation based on RoleOf relationship is proposed. It treats role as the independent modeling element and introduces RoleOf relationship between business class and role, which makes the business logic and the pattern logic completely separated, thus improves its reusability. Through the extension of UML, the meta-model and semantics of RoleOf relationship, and stereotypes and tagged values used for identify pattern information are provided, it resolves the traceability and overlapping problem. Finally, the implementation method of RoleOf relationship is discussed through an example.
SCREEN, PHONE, AND VOICE USER INTERFACES
Authors: Richard Halstead-Nussloch, Mary Jacobson, Chan Chuongvan
Venue: ACM SIGCHI Bulletin (1991)

Office principles often have multiple ways to complete typical tasks. For example, scheduling can be done on a paper calendar, electronically, by phone store-and-forward, etc. Each of the ways has unique user-interface characteristics and limitations, as well as a set of economic costs and benefits. We recently completed a study where 18 users compared traditional screen-based, phone-based, and voice-activated interfaces to calendar facilities. The voice-activated and phone-based user interfaces showed the highest level of usability among the comparison set, showing significantly smaller times to complete tasks and assistance requirements than screen-based facilities. With respect to preference 75% percent of the users prefered using a voice-activated or phone-based system for the typical calendaring task of signing out of the office, while only 5% stated a preference for a screen-based system.
Optimal conditions to ensure the stability of periodic solutions of first order difference equations lying between lower and upper solutions
Authors: Alberto Cabada, Victoria Otero-Espinar, Dolores R. Vivero
Venue: Journal of Computational and Applied Mathematics (2005)

This paper is devoted to the study of the stability of the solutions of the first order implicit difference periodic equation Δu(i)=f(i,u(i + 1)); i ∈ {0,..., N - 1}, u(0)=u(N). We prove that if there exist α≤β a pair of lower and upper solutions respectively of this problem together with a suitable condition on the function f and it has at most two solutions in the sector [α,β], then one of such solutions is asymptotically stable.Moreover, it is proved the optimality of the given results, both in the conditions imposed on f and in the number of the periodic solutions.
Trajectory formation based on the minimum commanded torque change model using the Euler&ndash;Poisson equation
Authors: Yuichi Kaneko, Eri Nakano, Rieko Osu, Yasuhiro Wada, Mitsuo Kawato
Venue: Systems and Computers in Japan (2005)

A minimum commanded torque change criterion based on the optimization principle is proposed as a model that accounts for human voluntary motion. It is shown that the trajectory of human arm motion can be well reproduced by the model. In the point-to-point movement, the calculation of the torque based on the minimum commanded torque change criterion requires a highly nonlinear calculation, and it is difficult to determine the optimal trajectory. As solution methods, a Newton-like method and a steepest descent method have been proposed. However, an optimal solution cannot be obtained by these methods, for several reasons. This paper proposes a method in which the trajectory of the joint angle is analytically represented by a system of orthogonal polynomials, and the coefficients of the orthogonal polynomials are estimated by a linear iterative calculation so that the parameters satisfy the Euler&ndash;Poisson equation, as a necessary condition for the optimal solution. As a result of numerical experiments, it is shown that a solution satisfying the Euler&ndash;Poisson equation with high numerical accuracy is obtained in a short time, regardless of the parameters such as those of the boundary conditions. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(2): 92&ndash;103, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20014
Education and training in computer simulation: a way to nested simulation
Authors: Ivan Krivy, Eugene Kindler
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This paper deals first with the results of training students in computer simulation at the Computer Science Department of the University of Ostrava during the last 15 years. Education and training in computer simulation are based on an obligatory course of SIMULA taking two semesters. The special attention is paid to implementing nested (especially reflective) simulation models of production and logistic systems for enterprises and institutions outside educational system.
Efficient transmission of MPEG-2 video bit streams over HIPERLAN&#x002F;2: Research Articles
Authors: Ji Wang, M. J. Ikram, Ashfaq Khokhar
Venue: Wireless Communications Mobile Computing (2005)

This paper studies the transmission of MPEG-2 video bit streams over HIPERLAN&#x002F;2 based wireless local area networks (WLANs). HIPERLAN&#x002F;2, a WLAN standard introduced by ETSI (the European Telecommunications Standards Institute), is well known for its ability to operate under different physical (PHY) modes (modulation schemes) and adaptively switch its modes within a single transmission session. Each physical mode has certain throughput and error resilience associated with it. The presence of multiple physical modes can be exploited to achieve Quality of Service (QoS) guarantees for application parameters such as throughput, bit error rate (BER), jitter etc. In this paper, we first study the relationship of different PHY modes with BER and throughput. Based on this study, different content based marking algorithms are presented and analyzed that partitions the input video bitstream into multiple segments, where each segment is deemed suitable for transmission over HIPERLAN&#x002F;2 operating under a specific PHY mode. We show that for a given video bit stream, the use of multiple PHY modes chosen based on the characteristics of underlying video data yields superior throughput and better picture quality in terms of pixel signal to noise ratio (PSNR). From the power consumption point of view, the marking algorithms can achieve desired throughput or PSNR with lower signal to interference ratio (SIR) levels thus saving battery power and extending the overall battery life. Copyright &copy; 2004 John Wiley & Sons, Ltd.
New and improved: Linda in Java
Authors: George C. Wells
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

This paper discusses the current resurgence of interest in the Linda coordination language for parallel and distributed programming. Particularly in the Java field, there have been a number of developments over the past few years. These developments are summarised together with the advantages of using Linda for programming concurrent systems. Some problems with the basic Linda approach are also discussed and a novel solution to these is presented.
Strategies for Systems Analysis: Groundwork for Process Tailoring
Authors: David W. Bustard, Frank Keenan
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

In principle, the most efficient way to develop software is to use a process that is carefully tailored to the problem situation. It is not clear, however, how that should be achieved in practice and if indeed the potential gains can be realised as anticipated. This paper attempts to highlight some of the issues involved. In doing so, it assumes that tailoring means selecting or assembling a development process from a ýtoolkitý of available strategies and individual techniques. As a first step towards producing such a toolkit, the paper discusses four ways to tackle systems analysis and considers the circumstances in which each is appropriate.
High-Visibility Debug-By-Design for FPGA Platforms
Authors: Peter Bellows
Venue: The Journal of Supercomputing (2005)

The true measure of a general-purpose FPGA platform is user design productivity, not just raw hardware performance. User productivity is a function of several interdependent components of the design environment: system firmware, simulation models, debugging support, device drivers, APIs and so forth. The careful, coordinated design of these components determines the level of debugging visibility and, ultimately, the ease of development for the end user. This paper examines the innovative aspects of the development of the SLAAC FPGA platforms and programming environment. Several novel techniques are presented, including circuit designs for transparent clock stepping and host access to on-board memories; device driver strategies and a "register compiler" to ease the design and testing of the hardware-software interface; and a co-simulation approach for advanced debugging of firmware, device drivers and user applications.
A Public Key Cryptosystem Based On A Subgroup Membership Problem
Authors: Juan Manuel Gonzalez Nieto, Colin Boyd, Ed Dawson
Venue: Designs, Codes and Cryptography (2005)

We present a novel public key encryption scheme semantically secure in the standard model under the intractability assumption of a subgroup membership problem related to the factorization problem.
Parallel worlds: immersion in location-based experiences
Authors: Josephine Reid, Erik Geelhoed, Richard Hull, Kirsten Cater, Ben Clayton
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This paper analyses the stages and circumstances for immersion based on quantitative and qualitative feedback from 700 people who took part in a three week long public trial of a location-based audio drama. Ratings of enjoyment, immersion and how much history came alive all scored highly and people often spent up to an hour in the experience. A model of immersion as a cycle of transient states triggered by events in the overall experience is defined. This model can be used to design for immersion in future experiences.
VLSI CAD tool protection by birthmarking design solutions
Authors: Lin Yuan, Gang Qu, Ankur Srivastava
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Many techniques have been proposed in the past for the protection of VLSI design IPs (intellectual property). CAD tools and algorithms are intensively used in all phases of modern VLSI designs; however, little has been done to protect them. Basically, given a problem Ρ and a solution Σ, we want to be able to determine whether Σ is obtained by a particular tool or algorithm.We propose two techniques that intentionally leave some trace or birthmark, which refers to certain easy detectable properties, in the design solutions to facilitate CAD tool tracing and protection. The pre-processing technique provides the ideal protection at the cost of losing control of solution's quality. The post-processing technique balances the level of protection and design quality.We conduct a case study on how to protect a timing-driven gate duplication algorithm. Experimental results on a large set of MCNC benchmarks confirm that the pre-processing technique results in a significant reduction (about 48%) of the optimization power of the tool, while the post-processing technique has almost no penalty (less than 2%) on the tool's performance.
METEOR: metadata and instance extraction from object referral lists on the web
Authors: Hasan Davulcu, Srinivas Vadrevu, Saravanakumar Nagarajan, Fatih Gelgi
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

The Web has established itself as the largest public data repository ever available. Even though the vast majority of information on the Web is formatted to be easily readable by the human eye, "meaningful information" is still largely inaccessible for the computer applications. In this paper we present the METEOR system which utilizes various presentation and linkage regularities from referral lists of various sorts to automatically separate and extract metadata and instance information. Experimental results for the university domain with 12 computer science department Web sites, comprising 361 individual faculty and course home pages indicate that the performance of the metadata and instance extraction averages 85%, 88% F-measure respectively. METEOR achieves this performance without any domain specific engineering requirement.
802.11 "decrypted"
Authors: Adrian Stephens
Venue: ACM SIGCOMM Computer Communication Review (2005)

This short paper introduces wireless IEEE 802 standards and activities with a focus on explaining the purpose of the many 802.11 amendments.
Graphical models for graph matching: Approximate models and optimal algorithms
Authors: Terry Caelli, Tiberio Caetano
Venue: Pattern Recognition Letters (2005)

Comparing scene, pattern or object models to structures in images or determining the correspondence between two point sets are examples of attributed graph matching. In this paper we show how such problems can be posed as one of inference over hidden Markov random fields. We review some well known inference methods studied over past decades and show how the Junction Tree framework from Graphical Models leads to algorithms that outperform traditional relaxation-based ones.
A conceptual process framework for IT-supported international outsourcing of software production
Authors: Anicet Yalaho, Nazmun Nahar, Timo Käkölä, Chunling Wu
Venue: Proceedings of the IEEE EEE05 international workshop on Business services networks (2005)

This paper examines and analyses how the information technology (IT) - supported international outsourcing of software production (IT-SIOSP) can be executed effectively. To address this research question, we present the results of an in-depth literature review in the areas of outsourcing, international outsourcing, information technology, and international software production. The review reveals that the literature provides no holistic, systematic, and detailed enough framework to guide the effective execution of the IT-SIOSP. As a result, companies attempting to leverage IT-SIOSP may end up spending high amounts of time and money to explore how to execute numerous tasks involved with the various phases of the complex international outsourcing process and still fail. This paper presents a conceptual framework for IT-SIOSP. In addition to the primary research question, the framework addresses four subquestions. (1) What are the phases of the IT-SIOSP and how these phases are executed? (2) What are the major activities in each phase of the IT-SIOSP and how these activities are managed? (3) What are the performance measures and expected outcomes of each phase? (4) Which IT tools best support the phases in general and each phase in particular? This paper contributes in terms of both theory and practice. At the theoretical level, the framework can be used as a basis for further research. At the practical level, the framework helps managers and other stakeholders to understand, improve, systematize and execute the IT-SIOSP more effectively and efficiently.
Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices
Authors: Peter Keevash, Benny Sudakov
Venue: SIAM Journal on Discrete Mathematics (2005)

A set system is L-intersecting if any pairwise intersection size lies in L, where L is some set of $s$ nonnegative integers. The celebrated Frankl--Ray-Chaudhuri--Wilson theorems give tight bounds on the size of an L-intersecting set system on a ground set of size n. Such a system contains at most $\binom{n}{s}$ sets if it is uniform and at most $\sum_{i=0}^s \binom{n}{i}$ sets if it is nonuniform. They also prove modular versions of these results.We consider the following extension of these problems. Call the set systems $\mathcal{A}_1,\ldots,\mathcal{A}_k$ {\em $L$-cross-intersecting} if for every pair of distinct sets A,B with $A \in \mathcal{A}_i$ and $B \in \mathcal{A}_j$ for some $i \neq j$ the intersection size $|A \cap B|$ lies in $L$. For any k and for n > n0(s) we give tight bounds on the maximum of $\sum_{i=1}^k |\mathcal{A}_i|$. It is at most $\max\, \{k\binom{n}{s}, \binom{n}{\lfloor n/2 \rfloor}\}$ if the systems are uniform and at most $ \max\, \{k \sum_{i=0}^s \binom{n}{i} , (k-1) \sum_{i=0}^{s-1} \binom{n}{i} + 2^n\}$ if they are nonuniform. We also obtain modular versions of these results. Our proofs use tools from linear algebra together with some combinatorial ideas. A key ingredient is a tight lower bound for the rank of the inclusion matrix of a set system. The s*-inclusion matrix of a set system $\mathcal{A}$ on [n] is a matrix M with rows indexed by $\mathcal{A}$ and columns by the subsets of [n] of size at most s, where if $A \in \mathcal{A}$ and $B \subset [n]$ with $|B| \leq s$, we define MAB to be 1 if $B \subset A$ and 0 otherwise. Our bound generalizes the well-known result that if $|\mathcal{A}| M has full rank $|\mathcal{A}|$. In a combinatorial setting this fact was proved by Frankl and Pach in the study of null t-designs; it can also be viewed as determining the minimum distance of the Reed--Muller codes.
1.1 V Low-Power Σ Δ Modulator for 14-bit, 16 KHz A/D Conversion Using a New Low-Voltage Class-AB Op-amp
Authors: F. Muñoz, A. P. Vegaleal, R. G. Carvajal, A. Torralba, J. Tombs, J. Ramírez-Angulo
Venue: Analog Integrated Circuits and Signal Processing (2005)

This paper presents the implementation of a second order ¿ ¿ modulator for a 1.1 V supply voltage. A new class-AB CMOS operational amplifier has been designed in order to achieve high-resolution under very-low-voltage operation. The modulator has been implemented using a 0.35 ¿ m CMOS technology with 0.65 V transistor threshold voltage. Experimental results show 14 bits of resolution over 16 kHz nyquist rate with an oversampling ratio of 160.
Scan Test Strategy for Asynchronous-Synchronous Interfaces
Authors: Octavian Petre, Hans G. Kerkhoff
Venue: Journal of Electronic Testing: Theory and Applications (2004)

In the coming years, the well-known synchronous design style will not be able to keep pace with the increase speed and capabilities of integration of advanced processes. New design paradigms, like core reuse of the already designed synchronous modules and asynchronous designs, are considered in order to cope with the ever increasing complexity. The future SoCs will contain multiple synchronous and asynchronous cores. Asynchronous design will become more and more common among digital designers, while synchronous-asynchronous interactions will emerge as a key issue in the future SoC designs.This paper will present test strategies for 2-phase asynchronous-synchronous interfaces and vice versa. It will be shown how test vectors can be automatically generated using commercially available ATPG tools. The generated ATPG vectors will be able to test all stuck-at-faults within the asynchronous-synchronous interfaces.
Digital cell macro-model with regular substrate template and EKV based MOSFET model
Authors: Yulei Weng, Alex Doboli
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

This paper presents substrate noise macro-models for standard digital cells, like INV, NAND and BUFFER. The macro-models are based on a scalable substrate network template and a compact MOSFET model equivalent to EKV model. Our models and simulator predicted the substrate voltage, injection currents, and output voltage of each primary digital cell. Proposed models are close to device physics and valid for different processing technology and input transition. They are more accurate as compared to macro-models generated from curve fitting. Our macro-model accuracy is within 5-10% from SPICE simulation with MOSFET level49 models, and at least 4 times faster. This model can be used to predict spatially and temporally the occurrence of substrate noise peaks in a digital design.
A Stemming Algorithm for the Farsi Language
Authors: Kazem Taghva, Russell Beckley, Mohammad Sadeh
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In this paper, we report on the design and implementation of a stemmer for the Farsi language. The results of our evaluation on a small Farsi document collection shows a significant improvement in precision/recall over not stemming.