ppxscal/embedding_network huggingface dataset:
Feature-Level Fusion in Personal Identification
Authors: Yongsheng Gao, Michael Maggs
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

The existing studies of multi-modal and multi-view personal identification focused on combining the outputs of multiple classifiers at the decision level. In this study, we investigated the fusion at the feature level to combine multiple views and modals in personal identification. A new similarity measure is proposed, which integrates multiple 2-D view features representing a visual identity of a 3-D object seen from different viewpoints and from different sensors. The robustness to non-rigid distortions is achieved by the proximity correspondence manner in the similarity computation. The feasibility and capability of the proposed technique for personal identification were evaluated on multiple view human faces and palmprints. This research demonstrates that the feature-level fusion provides a new way to combine multiple modals and views for personal identification.
Towards an Intrusion Detection System for Pervasive Computing Environments
Authors: Pradeep Kannadiga, Mohammad Zulkernine, Sheikh I. Ahamed
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

A pervasive computing environment consists of numerous casually accessible, frequently mobile, embedded, handheld devices capable of sensing the environment around it and reacting intelligently to simplify user activities. These devices are distributed everywhere at office, homes, stores, classroom, and are often connected to ad-hoc network and the internet providing access from anywhere and anytime. Access control mechanisms can sometimes fail to provide complete security to these pervasive computing devices as witnessed in infrastructure based networks. The addition of pervasive computing devices to infrastructure based networks makes the problem of intrusion detection even harder. In this paper, the challenges and characteristics of intrusion detection in pervasive computing devices are discussed along with a mobile agents-based solution for both for a network environment made up of infrastructure based network and pervasive computing devices.
Using service brokers for accessing backend servers for web applications
Authors: Huamin Chen, Prasant Mohapatra
Venue: Journal of Network and Computer Applications (2005)

Web service infrastructures usually are comprised of front-end Web servers that accept requests and process them, and backend servers that manage data and services. Current Web servers use various API sets to access backend services. This model does not support service differentiation, overload control, caching of contents generated by backend servers. We have proposed a framework for using service brokers to facilitate these features. Service brokers are software agents that are the access points to backend services in Web servers. Unlike the current API-based scheme where accesses to backend services are through stateless and isolated APIs, in service broker framework, they are undertaken by passing messages to service brokers who gather all the requests and intelligently process them. We have prototyped this framework and validated its function in providing request clustering and service differentiation in accessing backend services. In addition, the performance in terms of the processing time is enhanced by this approach.
A new fast-path mechanism for mutual exclusion
Authors: James H. Anderson, Yong-Jik Kim
Venue: Distributed Computing (2001)

Several years ago, Yang and Anderson presented all N-process algorithm for mutual exclusion under read/write atomicity that has Θ(log N) time complexity, where "time" is measured by counting remote memory references. In this algorithm, instances of a two-process mutual exclusion algorithm are embedded within a binary arbitration tree. In the two-process algorithm that was used, all busy-waiting is done by "local spinning." Performance studies presented by Yang and Anderson showed that their N-process algorithm exhibits scalable performance under heavy contention. One drawback of using an arbitration tree, however, is that each process is required to perform Θ(log N) remote memory operations even when there is no contention. To remedy this problem, Yang and Anderson presented a variant of their algorithm that includes a "fast-path" mechanism that allows the arbitration tree to be bypassed in the absence of contention. This algorithm has the desirable property that contention-free time complexity is O(1). Unfortunately, the fast-path mechanism that was used caused time complexity under contention to rise to Θ(N) in the worst case. To this day, the problem of designing a read/write mutual exclusion algorithm with O(1) time complexity in the absence of contention and O(log N) time complexity under contention has remained open. In this paper, we close this problem by presenting a fast-path mechanism that achieves these time complexity bounds when used in conjunction with Yang and Anderson's arbitration-tree algorithm.
RIGEL: a graphics language preprocessor and assembler to automate the design of graphics displays
Authors: Beverly S. Rice, Constance E. Ritter
Venue: ACM SIGDA Newsletter (1979)

The Raster-scan Intelligent Graphics Engineering Language (RIGEL) is a high-level command language which greatly simplifies the task of programming real-time color graphic displays. The RIGEL language is must easier to learn than a conventional subroutine graphics package, is nearly free-format, and is easy to maintain. In addition, it enables the user to define his own symbol library, and incorporates a mechanism for decreasing picture-generation overhead, which is very important in real-time applications.The RIGEL language works as an extension to the ANSI-standard FORTRAN language, which is a language familiar to most engineers and supported on most computers. A preprocessor translates the graphics commands to FORTRAN statements, and an assembler produces Ramtek object code from the compiled FORTRAN source. This object code is transmitted to the display processor, which generates the display on the monitor.
Exploiting adaptable passive behaviour to influence natural dynamics applied to legged robots
Authors: Björn Verrelst, Ronald Van Ham, Bram Vanderborght, Jimmy Vermeulen, Dirk Lefeber, Frank Daerden
Venue: Robotica (2005)

This paper reports on the use of a particular actuator in the field of legged robots. The proposed actuator, the Pleated Pneumatic Artificial Muscle, has some interesting characteristics which makes it suitable for machines which move by means of legs. An important issue is the actuator's adaptable passive behaviour which allows the stiffness of a joint that is actuated by two antagonistically coupled muscles, to be varied online. The natural frequency of the system can thus be changed in order to reduce control efforts and energy consumption. The idea of changing this natural frequency in combination with trajectory control will be implemented on a two-dimensional leg model. It will be shown that an appropriate choice of compliance can strongly reduce the amount of needed control activity and energy consumption while tracking a given trajectory.
On the Existence of Positive Solutions for Hemivariational Inequalities Driven by the p-Laplacian
Authors: Michael Filippakis, Leszek Gasiński, Nikolaos S. Papageorgiou
Venue: Journal of Global Optimization (2005)

We study nonlinear elliptic problems driven by the p-Laplacian and with a nonsmooth locally Lipschitz potential (hemivariational inequality). We do not assume that the nonsmooth potential satisfies the Ambrosetti--Rabinowitz condition. Using a variational approach based on the nonsmooth critical point theory, we establish the existence of at least one smooth positive solution.
Web2Talkshow: transforming web content into TV-program-like content based on the creation of dialogue
Authors: Akiyo Nadamoto, Masaki Hayashi, Katsumi Tanaka
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We propose a new browsing system called "Web2Talkshow". It transforms declarative-based web content into humorous dialog-based TV-program-like content that is presented through cartoon animation and synthesized speech. The system does this based on keywords in the original web content. Web2Talkshow enable users to get desired web content easily, pleasantly, and in a user-friendly way while being able to continue working on other tasks. Thus, using it will be much like watching TV.
Software engineering for large-scale multi-agent systems - SELMAS'05
Authors: Alessandro Garcia, Ricardo Choren, Carlos Lucena, Alexander Romanovsky, Tom Holvoet, Paolo Giorgini
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Software is becoming present in every aspect of our lives, pushing us inevitably towards a world of distributed, context-aware computing systems. SELMAS'05, "Software Everywhere - Context-Aware Agents", builds on the success of precedent SELMAS workshops, but with a special emphasis on the impact of the agent technology in the development of large context-aware systems. SELMAS has a track record of bringing together researchers and practitioners with a variety of perspectives in order to engage in lively discussion and debate.
Integrated process management: from planning to work execution
Authors: Ali Bahrami
Venue: Proceedings of the IEEE EEE05 international workshop on Business services networks (2005)

Project management tools are used to manage projects from time as well as from resource leveling perspectives. Workflow management systems guide users through processes by driving the processes based on formal process definitions also called workflow types. This paper describes integrated process management system that will integrate project management, business process modeling, simulation and workflow technologies in order to support scheduled workflow execution. The target will be achieved by utilizing a tool for modeling work processes which can semi automatically generate workflow processes based on scheduling tool and then exported it to workflow engine via web services using XML process definition language (XPDL). Addition of simulation capability allows testing workflows before deployment.
Adaptive prosthesis &ndash; a new concept in prosthetic knee control
Authors: Saeed Zahedi, Andrew Sykes, Stephen Lang, Ian Cullington
Venue: Robotica (2005)

The aim of the project has been to provide a prosthesis which is capable of adapting to different modes of locomotion whilst optimising the hip power available to the user.The prosthesis provides stance control ranging from minimal resistance to a yielding lock, capable of detecting level walking, ramp descent, stair descent, standing and instances of stumble. The stance resistance is set to preprogrammed levels for each mode, which matches the user's level of control.10 amputees participated during the early development trails of the Adaptive Prosthesis for project validation. 7 used the limb for over 3 months and 3 for over 2 years. Early feedback indicated enhanced control and increased comfort and safety during ambulation and manoeuvring various terrains. Minor modification to increase reliability of cabling was also made.
Using Particles to Track Varying Numbers of Interacting People
Authors: Kevin Smith, Daniel Gatica-Perez, Jean-Marc Odobez
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

In this paper, we present a Bayesian framework for the fully automatic tracking of a variable number of interacting targets using a fixed camera. This framework uses a joint multi-object state-space formulation and a trans-dimensional Markov Chain Monte Carlo (MCMC) particle filter to recursively estimate the multi-object configuration and efficiently search the state-space. We alsodefine a global observation model comprised of color and binary measurements capable of discriminating between different numbers of objects in the scene. We present results which show that our method is capable of tracking varying numbers of people through several challenging real-world tracking situations such as full/partial occlusion andentering/leaving the scene.
Age Process, Workload Process, Sojourn Times, and Waiting Times in a Discrete Time SM[K]/PH[K]/1/FCFS Queue
Authors: Qi-Ming He
Venue: Queueing Systems: Theory and Applications (2005)

In this paper, we study a discrete time queueing system with multiple types of customers and a first-come-first-served (FCFS) service discipline. Customers arrive according to a semi-Markov arrival process and the service times of individual customers have PH-distributions. A GI/M/1 type Markov chain for a generalized age process of batches of customers is introduced. The steady state distribution of the GI/M/1 type Markov chain is found explicitly and, consequently, the steady state distributions of the age of the batch in service, the total workload in the system, waiting times, and sojourn times of different batches and different types of customers are obtained. We show that the generalized age process and a generalized total workload process have the same steady state distribution. We prove that the waiting times and sojourn times have PH-distributions and find matrix representations of those PH-distributions. When the arrival process is a Markov arrival process with marked transitions, we construct a QBD process for the age process and the total workload process. The steady state distributions of the waiting times and the sojourn times, both at the batch level and the customer level, are obtained from the steady state distribution of the QBD process. A number of numerical examples are presented to gain insight into the waiting processes of different types of customers.
Distributed Storage Layout Schemes
Authors: Peter Sobe
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 16 - Volume 17 (2005)

When distributing data across several nodes, two different approaches exist. The first one consists in distribution of the data object itself, e.g. in striping. The second approach is aggregation of local storages, whereby each data object is assigned to a home storage node. From the viewpoint of fault-tolerant data layouts, these schemes seem to be similar. In both cases the addition of parity, e.g. RAID level 3, level 5 or Reed-Solomon codes provide tolerance against node failures. A closer look shows differences in reachable access rates, needed number of messages and recovery cost. In this paper we compare both approaches and provide a method for self reconfiguration. The transformation from a parity grouping layout to a striping layout is shown to be feasible for stepwise and concurrent operation during data access.
Optimal approximations of the frequency moments of data streams
Authors: Piotr Indyk, David Woodruff
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We give a 1-pass Õ(m1-2⁄k)-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this resolves the main problem left open by Alon et al in 1996 [1]. Our algorithm also works for streams with deletions and thus gives an Õ(m 1-2⁄p) space algorithm for the Lp difference problem for any p > 2. This essentially matches the known Ω(m1-2⁄p-o(1)) lower bound of [12, 2]. Finally the update time of our algorithms is Õ(1).
An Unified Fault Model and Test Generation Procedure for Interconnect Opens and Bridges
Authors: Gang Chen, Sudhakar Reddy, Irith Pomeranz, Janusz Rajski, Piet Engelke, Bernd Becker
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

An unified gate-level fault model for interconnect opens and bridges is proposed. Defects are modeled as constrained multiple line stuck-at faults. A novel feature of the proposed fault model is its flexibility to accommodate increasing levels of accuracy. Additionally the model does not require accurate device level circuit models to achieve desired accuracy. Efficient methods for fault simulation and test generation are discussed and experimental results on benchmark circuits and industrial designs are presented. The experimental results presented show that the tests generated using simpler versions of the proposed fault model achieve higher defect coverage than the tests using two currently popular methods to derive high defect coverage tests.
Studying the effectiveness of MOVE: a contextually optimized in-vehicle navigation system
Authors: Joonhwan Lee, Jodi Forlizzi, Scott E. Hudson
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

In-vehicle navigation has changed substantially in recent years, due to the advent of computer generated maps and directions. However, these maps are still problematic, due to a mismatch between the complexity of the maps and the attentional demands of driving. In response to this problem, we are developing the MOVE (Maps Optimized for Vehicular Environments) system. This system will provide situationally appropriate map information by presenting information that uses appropriate amounts of the driver's attention. In this paper, we describe our findings of studies to help shape the design of the MOVE system, including studies on map reading and in-vehicle navigation, and studies on the effectiveness of a variety of contextually optimized route map visualizations in a simulated driving context.Results show that contextually optimized displays designed for the MOVE system should significantly reduce perceptual load in the context of driving. In our laboratory experiment there was a six-fold decrease in the total map display fixation time and nearly threefold decrease in the number of glances needed to interpret the contextually optimized display compared to a static display.
Pedagogical praxis: using technology to build professional communities of practice
Authors: David Williamson Shaffer
Venue: ACM SIGGROUP Bulletin (2003)

Over the past decade and a half, work in the field of education on communities of practice [20] and/or communities of learners [2] has focused on how individual development takes place within the larger context of the norms and activities of a community. Recognizing this, educators working within the sociocultural tradition have focused on documenting the practices of extant communities [12; 18--20; 35] and/or on ways in which the "community of practice" of the classroom can be improved [2; 25]. Broadly speaking, this work looks at how the traditional intellectual disciplines (such as math, science, and history) are mobilized in the context of real-world practices, or how importing more authentic practices into school settings can develop disciplinary understanding more effectively.
The Tango: A Tangible Tangoreceptive Whole-Hand Human Interface
Authors: Dinesh K. Pai, Eric W. VanDerLoo, Subarna Sadhukhan
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

We describe the Tango, a new passive haptic interface for whole-hand interaction with 3D objects. The Tango is shaped like a ball and can be grasped comfortably in one hand. Its pressure sensitive skin meadures the contact pressures exerted by the user's hand, and accelerometers within the device measure its motion and attitude. This information can be used for novel modes of interaction with three dimensional objects. We describe the design of the device, and the software for interpreting the sensor data for user interaction. Accompanying this paper, there will be a demonstration of the device at the hands-On Demo seesion of the conference.
Dual-Pipeline Heterogeneous ASIP Design
Authors: Swarnalatha Radhakrishnan, Hui Guo, Sri Parameswaran
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

In this paper we demonstrate the feasibility of a dual pipeline Application Specific Instruction Set Processor. We take a C program and create a target instruction set by compiling to a basic instruction set, from which some instructions are merged, while others discarded. Based on the target instruction set, parallelism of the application program is analyzed and two unique instruction sets are generated for a heterogeneous dual-pipeline processor. The dual pipe processor is created by making two unique ASIPs (VHDL descriptions) utilizing the ASIP-Meister Tool Suite, and fusing the two VHDL descriptions to construct a dual pipeline processor. Our results show that in comparison to the single pipeline Application Specific Instruction Set Processor, the performance improves by 27.6% and switching activity reduces by 6.1% for a number of benchmarks. These improvements come at the cost of increased area which for benchmarks considered is 16.7% on average.
Verifiable composition of access control and application features
Authors: Eunjee Song, Raghu Reddy, Robert France, Indrakshi Ray, Geri Georg, Roger Alexander
Venue: Proceedings of the tenth ACM symposium on Access control models and technologies (2005)

Access control features are often spread across and tangled with other functionality in a design. This makes modifying and replacing these features in a design difficult. Aspect-oriented modeling (AOM) techniques can be used to support separation of access control concerns from other application design concerns. Using an AOM approach, access control features are described by aspect models and other application features are described by a primary model. Composition of aspect and primary models yields a design model in which access control features are integrated with other application features. In this paper, we present, through an example, an AOM approach that supports verifiable composition of behaviors described in access control aspect models and primary models. Given an aspect model, a primary model, and a specified property, the composition technique produces proof obligations as the behavioral descriptions in the aspect and primary models are composed. One has to discharge the proof obligations to establish that the composed model has the specified property.
Planning, building and operating the information security and assurance laboratory
Authors: Herbert J. Mattord, Michael E. Whitman
Venue: Proceedings of the 1st annual conference on Information security curriculum development (2004)

With increasing interest by students and faculty in Information Security (InfoSec) Curriculum, and increasing demand for information security professionals from industry, many institutions are beginning the task of creating an information security program. Within these programs of study, it is important that the faculty and administrators planning the facilities and curriculum for InfoSec labs understand the unique demands of this endeavor. This paper provides an overview of some current practices.
3-D reconstruction and visualization of a rat brain
Authors: Clifford Manzanillo
Venue: Journal of Computing Sciences in Colleges (2005)

The department of Biomedical Sciences at the University of Rhode Island is in the process of conducting experiments on the effect of lead poisoning on neural development, using rats as specimen. The degree of neural development can be deduced by observation of images of histological slices of the brain (after the animal has been killed). The objective of this project is to compute 3D reconstruction of a rat's brain from a stack of images of histological slices of that brain, and to allow the researchers to visualize that brain under different viewpoints.