ppxscal/embedding_network huggingface dataset:
Censor chair: exploring censorship and social presence through psychophysiological sensing
Authors: Eric Aley, Trina Cooper, Ross Graeber, Andruid Kerne, Kyle Overby, Zachary O. Toups
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this paper, we describe Censor Chair, an art installation that creates a shared experience addressing forms of censorship including self-censorship, censorship of a group upon an individual, visual and auditory censorship in digital media, and censorship in society. We are taking a playful position in considering relationships between censorship and sensors that monitor physiology. Censor Chair makes use of a galvanic skin response (GSR) sensor, live video feeds, and a barcode reader to drive the presentation of a digital media library.
A novel framework for athlete training based on interactive motion editing and silhouette analysis
Authors: Shihong Xia, Xianjie Qiu, Zhaoqi Wang
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

There are mainly two Hi-Tech methods for athlete training. One method is based on virtual reality, where the athlete can learn and improve performance mainly through using virtual equipments to interact with the virtual environment. Another method is based on video analysis, where improvements can be made by comparing the videos of the trainees with those of excellent trainers. In this paper, we present a novel framework for athlete training, which can circumvent difficulties the current methods faced in practical applications. For retargeting the example motion to personalized virtual athlete, the coach interactively sets motion constraints with his experience based on motion warping and motion verification techniques. The display of the simulated motion is adjusted semi-automatically to create the reference virtual video with the same viewpoint as the real one. The moment invariants of both virtual and real athlete's silhouette are computed, and motion analysis result is presented subsequently. This method is more suitable for gymnastic athlete training because of without virtual equipment and more instructive having the same viewpoint in video analysis. Finally, an application of the proposed techniques to trampoline training is implemented.
A Fingerprint Matching Algorithm Based On Delaunay Triangulation Net
Authors: Ning Liu, Yilong Yin, Hongwei Zhang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Fingerprint matching is a key issue in research of an automatic fingerprint identification system. On the basis of Delaunay triangulation (DT) in computational geometry, we proposed a fingerprint matching algorithm based on DT net in this paper. It uses DT in fingerprint matching, and then develops a matching algorithm based on DT net to find reference minutiae pairs (RMPs). Using DT on the topological structure of minutiae set, a DT net is formed with minutiae as vertexes. From the nets of the input minutiae set and template minutiae set, select out a certain pairs of minutiae which have similar structures as RMPs for aligning, and matching is carried out based on point pattern. The experiment is conducted on FVC2002, and the result indicates the validity of our algorithm.
(6,3)-MDS Codes over an Alphabet of Size 4
Authors: T. L. Alderson
Venue: Designs, Codes and Cryptography (2006)

An (n,k)q-MDS code C over an alphabet $\cal A$ (of size q) is a collection of qk n---tuples over $\cal A$ such that no two words of C agree in as many as k coordinate positions. It follows that n ¿ q+k¿1. By elementary combinatorial means we show that every (6,3)4-MDS code, linear or not, turns out to be a linear (6,3)4-MDS code or else a code equivalent to a linear code with these parameters. It follows that every (5,3)4-MDS code over $\cal A$ must also be equivalent to linear.
A New Proof of Bartholdi's Theorem
Authors: Hirobumi Mizuno, Iwao Sato
Venue: Journal of Algebraic Combinatorics: An International Journal (2005)

We give a new proof of Bartholdi's theorem for the Bartholdi zeta function of a graph.
Pixel-Aligned Warping for Multiprojector Tiled Displays
Authors: Mark Hereld, Rick L. Stevens
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

Multiprojector tiled displays offer a scalable path to high-resolution display systems, often in a large format. Such displays have been employed in a range of applications from scientific visualization to collaborative virtual environments. Images projected onto these systems have always looked less sharp than expected owing to the image warping required to achieve geometrical alignment of the partial images to form the seamless whole. Similar degradation of image quality accompanies keystone correction techniques and image warping onto nonplanar surfaces used in single projector applications. In this paper we discuss the underlying cause of the degradation of apparent image resolution, and we introduce a new class of warping techniques, called pixel-aligned warping, that tend to preserve image sharpness at the expense of strict adherence to underlying geometrical constraints that define the desired warp. We demonstrate how such techniques can be used to significantly improve the apparent sharpness of the final image.
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
Authors: Yongpei Guan, Shabbir Ahmed, George L. Nemhauser, Andrew J. Miller
Venue: Mathematical Programming: Series A and B (2006)

This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated lot-sizing problem under uncertainty. We show that the classical (&#x2113;,S) inequalities for the deterministic lot-sizing polytope are also valid for the stochastic lot-sizing polytope. We then extend the (&#x2113;,S) inequalities to a general class of valid inequalities, called the ** inequalities, and we establish necessary and sufficient conditions which guarantee that the ** inequalities are facet-defining. A separation heuristic for ** inequalities is developed and incorporated into a branch-and-cut algorithm. A computational study verifies the usefulness of the ** inequalities as cuts.
Passive and active orthoses for upper extremity movement training after stroke
Authors: Robert Joseph Sanchez,  Jr.
Venue:  (2005)

The increasing prevalence of stroke coupled with the cost of rehabilitation is creating a need for technology that allows stroke patients to retrain arm movement with minimal help from therapists. Initial attempts to meet this need have focused on robotic devices that actively assist in arm movement. Although initial results are promising, this work can be criticized from both ends of the range of possible design complexity. From the lower end, the technology can be criticized for being too sophisticated: it may be possible to automate therapy with non-robotic devices that do not require powered actuation but still provide assistance to arm movement. On the upper end of design complexity, the developed devices may be criticized for not being sophisticated enough: they have limited ranges of motion and force. The goal of this dissertation is to develop and evaluate technology that expands the performance of robotic therapy devices at both ends of the design complexity spectrum. The first device developed is an instrumented version of a passive upper extremity gravity-balancing orthosis named Wilmington Robotic Exoskeleton (WREX). We named the new device Training-WREX (T-WREX), which functions as a three-dimensional input device to a simple virtual reality environment that allows severely weakened stroke subjects to practice simulated functional movements. In a pilot study with nine chronic hemiparetic subjects, we found that the subjects could significantly improve their movement ability while wearing the device, making functional movement practice possible. In a subsequent eight-week pilot study with five chronic hemiparetic subjects, we found that regular practice with the T-WREX system can improve unassisted movement ability. These results indicate that motor therapy following stroke can be automated with a non-powered device that is simpler and safer than current robotic approaches. The second device is a pneumatically actuated version of T-WREX named Pneumatic-WREX (Pneu-WREX). Pneu-WREX will be a tool in the development of advanced, interactive, sensory motor training techniques. Pneu-WREX can assist arm movement across an estimated 70% of the arms workspace, is capable of generating up to 15 lbs of assistive force, and counterbalances the arm for all positions within the workspace.
Predicting Software Escalations with Maximum ROI
Authors: Charles X. Ling, Shengli Sheng, Tilmann Bruckhaus, Nazim H. Madhavji
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Enterprise software venders often have to release software products before all reported defects are corrected, and a small number of these reported defects will be escalated by customers whose businesses are seriously impacted. Escalated defects must be quickly resolved at a high cost by the software vendors. The total costs can be even greater, including loss of reputation, satisfaction, loyalty, and repeat revenue. In this paper, we develop an Escalation Prediction (EP) system to mine historic defect report data and predict the escalation risk of current defect reports for maximum ROI (Return On Investment). More specifically, we first describe a simple and general framework to convert the maximum ROI problem to cost-sensitive learning. We then apply and compare several best-known cost-sensitive learning approaches for EP. The EP system has produced promising results, and has been deployed in the product group of an enterprise software vendor. Conclusions drawn from this study also provide guidelines for mining imbalanced datasets and cost-sensitive learning.
PGMLISH or r u there?
Authors: Henry Nussbacher
Venue: ACM SIGUCCS Newsletter (1980)

Campus computing is unique in one aspect that the "real world" tends often to down-play and more often to ignore. That is, inter-terminal communication plays a vital part in student programming and computing. While waiting for a job to run or just sitting reading an output, it is possible for your tranquility to be interrupted by a message beeping to life on your screen, asking, "Hi, who r u?" 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
Energy-Efficient Scheme for Multiprocessor-Based Router Linecards
Authors: Malcolm Mandviwalla, Nian-Feng Tzeng
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

In support of continuously increasing line rates and various Internet services, multiprocessor-based linecards have appeared in next-generation routers, significantly improving performance. However, this improvement has come at the expense of increased energy consumption, which tends to not only raise the operational and cooling costs, but also lower the reliability of the router. In this article, we present a simple and yet effective Dynamic Voltage Scaling (DVS)-orientedscheme for energy-efficient operations of multiprocessor-based linecards. We prove that for a given task and a timing constraint, those processors in a linecard consume less energy when operating at the same voltage than operating at different voltages. Additionally, we derive the optimal configuration for minimal energy consumption in multiprocessor-based linecards and also show how it can be extended for general-purpose multiprocessor systems.
Access control management in a distributed environment supporting dynamic collaboration
Authors: Basit Shafiq, Elisa Bertino, Arif Ghafoor
Venue: Proceedings of the 2005 workshop on Digital identity management (2005)

Ensuring secure and authorized access to remote services and information resources in a dynamic collaborative environment is a challenging task. Two major issues that need to be addressed in this regard are: specification of access control requirements and trust management. Specification of access control requirements for dynamic collaboration is challenging mainly because of the limited or lack of knowledge about remote users' identities and affiliations. The access control policies and constraints defining users' authorization over remote resources and services need to be specified in terms of the attributes and properties of the users. Moreover, the criteria for validating the attributes of the users should also be specified as part of access control requirements. Trust management, in the context of dynamic collaboration, involves validation of user's attributes for secure interaction and prevention of unauthorized disclosure of policies and attributes. The paper discusses these issues in detail and presents a framework for access control and trust management in a distributed collaborative environment.
A modal logic formalism for efficient knowledge representation and reasoning
Authors: Jens Happe
Venue:  (2005)

Modal and modal-like logics have become the focus of renewed attention in the field of knowledge representation and automated reasoning. They provide a good middle-ground between expressiveness and complexity, which makes them suitable candidates for representation of ontologies on the Semantic Web. Expressive modal logics are well-known to be decidable but intractable. This problem has been addressed mostly by optimizations to improve the efficiency of reasoners on top of existing formalisms and algorithms, which have largely been unchanged since the days of Kripke. This work addresses the problem of intractability by providing an improved definition of models. Rather than on a per-world basis as in Kripke models, truth assignments are specified over set of worlds addressed by labels with variables. The set of worlds represented by a label is the set of all its ground instances. This allows satisfying models to be stored in a more compact form. We prove that our representation of models and formulas preserves the satisfiability of formulas. Our model-finding algorithm can be understood as an extension of nogood reasoning for propositional logic, whereas the nogoods are parametrized by labels, i.e. sets of worlds in which they apply. Nogoods ensure termination of the algorithm. The search strategy is general enough to accommodate tableau-style or DPLL-style branching. The algorithm is specified in sufficient detail so as to make it readily implementable, although we do not actually provide an implementation. For simplicity, we describe our theory only on the modal logic K. An adaptation to multimodal logics, the description logic ALC , Quantified Boolean Formulas, and Propositional Dynamic Logic is straightforward; we also outline how the approach extends to logics with global axioms, such as reflexivity, transitivity, symmetry etc. We also outline the connection with recent advances of tableau- and DPLL-style methods in first-order logic.
Scheduling and switching architecture for virtual synchronous frame (vsf)
Authors: Hyong S. Kim
Venue:  (2004)

Two major services are offered in today's telecommunication networks: TDM (voice, video, and private leased line) and Packet (Internet). The existing TDM and IP network architectures have limitations in providing the specific Quality of Service (QoS) guarantees for those two services in a scalable integrated fashion. Furthermore, at the current high network speeds, it is expensive to build switching systems to realize the required network services. We identify two issues that have to be addressed to realize high-speed core networks with end-to-end QoS in scalable architecture. The first issue is the complexity and high cost of providing QoS for different traffic types (TDM and packet traffic). The second issue is the scalability of the switching system to operate and support the QoS guarantees at the high speed. In this thesis, we present a novel core network architecture, the Virtual Synchronous Frame (VSF) network that can provide end-to-end bandwidth and delay guarantees for TDM traffic and best effort service for packet traffic in a unified and scalable fashion. We present two different VSF network architectures with different bandwidth allocation granularities for the real time traffic flows. We then propose the specific VSF switch architectures complete with the fabric schedulers and the output port schedulers that provide these end-to-end bandwidth and delay guarantees. The proposed architectures are scalable and posses low complexity. We also provide the framework for the respective connection admission tests, which assure that the offered guarantees are maintained for new flows admitted to the network.
Documentation: a growing need ... a new tool
Authors: Marcia A. Metcalfe
Venue: ACM SIGSIM Simulation Digest (1979)

The Software Design and Documentation Language (SDDL) has proven to be an effective, automated documentation tool. This paper presents the purpose, timing, and components of documentation. SDDL is introduced and related to the different timing scenarios; its capability to provide reasonable documentation is discussed and demonstrated by the use of several examples.
Real-Time Scheduling of Sporadic Task Systems When the Number of Distinct Task Types Is Small
Authors: Sanjoy Baruah, Nathan Fisher
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

In some real-time application systems, there are only a few distinct kinds of tasks, each of which may be instantiated several times during runtime. The scheduling of such sporadic task systems is considered here upon both a single processor, and on multiprocessor platforms under the partitioned paradigm of multiprocessor scheduling. Algorithms that have run-time poly-nomial in the number of tasks in the system are presented and proved correct.
Viable opto-electronic HPC interconnect fabrics
Authors: Ronald Luijten, Cyriel Minkenberg, Roe Hemenway, Michael Sauer, Richard Grzybowski
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

We address the problem of how to exploit optics for ultrascale High Performance Computing interconnect fabrics. We show that for high port counts these fabrics require multistage topologies regardless of whether electronic or optical switch components are used. Also, per stage electronic buffers remain indispensable for maintaining throughput, lossless-ness and packet sequence. Although the notion of true all-optical packet switching is not yet viable, we show that appropriate use of optical switching technology offers power and scaling advantages that can be leveraged economically, and propose a hybrid opto-electronic HPC interconnect fabric architecture that combines the strength of electronics in processing and storing information with the strength of optics in switching and transporting high bandwidths. Using Semiconductor Optical Amplifier technology, we are building a prototype demonstrator switch that we believe solves all the technical challenges. Having reached this threshold now enables commercialization of this technology, which we are currently pursuing.
Additional APL generators: geometric, PORDER and WEIBULL
Authors: David G. Halmstad
Venue: ACM SIGSIM Simulation Digest (1976)

The following are some additional generator routines to supplement those published by Robert E. Wheeler. The first is the (usual?) straight-forward routine for the geometric distribution. The second is for the generation of the highest (or lowest) variates in ordered samples (from the uniform distribution). When one has the inverse of the distribution function being used, this routine is rather useful. A self-explanatory demonstration of the use of the PORDER generator is shown in conjunction with the use of WEIBULL distribution generator.
Implementation of an On-Chip Bus Bridge between Heterogeneous Buses with Different Clock Frequencies
Authors: Sangik Choi, Shinwook Kang
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

Recently, embedded systems design focuses on low-power dissipation and system-on-chip. Thus, ARM processor and AHB came to be popular in embedded systems. Whereas the bus has many advantages for high-performance modules, it has limitations on interfacing with low-speed devices. Therefore, a bridge is necessary between them. Although AHB-to-APB bridge is a standard in AMBA system, it is not useful because of the fixed interfacing speed. Moreover, it is difficult that the existing IP cores for the peripheral controllers are reused with APB. In this paper, we suggest more general and flexible bridge than the existing one for SoC.
Assessment of Enterprise Information Security - The Importance of Prioritization
Authors: Erik Johansson, Pontus Johnson
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

Assessing the level of information security in an enterprise is a serious challenge for many organizations. This paper considers the prioritization of the field of enterprise information security. The paper thus considers how we may know what parts of information security are important for a company to address and what parts are not. Two methods for prioritization are used. The results demonstrate to what extent different standards committees, guideline authors and expert groups differ in their opinions on what the important issues are in enterprise information security. The ISO/IEC 17799, the NIST SP 800-26, the ISF standards committees, the CMU/SEI OCTAVE framework authors and an expert panel at the Swedish Information Processing Society (DFS) are considered. The differences in prioritization have important consequences on enterprise information security assessments. The effects on the information security assessment results in a European energy company are presented in the paper.
Using an Iterated Prisoner's Dilemma with Exit Option to Study Alliance Behavior: Results of a Tournament and Simulation
Authors: Steven E. Phelan, Richard J. Arend, Darryl A. Seale
Venue: Computational Mathematical Organization Theory (2005)

Nearly half of all strategic alliances fail (Park and Russo, 1996; Dyer et al., 2001), often because of opportunistic behavior by one party or the other. We use a tournament and simulation to study strategies in an iterated prisoner's dilemma game with exit option to shed light on how a firm should react to an opportunistic partner. Our results indicate that a firm should give an alliance partner a second chance following an opportunistic act but that subsequent behavior should be contingent on the value of the next best opportunity outside the alliance. Firms should be more forgiving if the potential benefits from the alliance exceed other opportunities. The strategies were also found to be robust across a wide range of game lengths. The implications of these results for alliance strategies are discussed.