ppxscal/embedding_network huggingface dataset:
A novel color region homogenization and its application in improving skin detection accuracy
Authors: Mohammad Ali Akbari, Masayuki Nakajima
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Pixel based color classification is a primary process in some advanced intelligent user interfaces. It is especially applied for the human skin detection purpose and consequently in the more effective interactions through the face or hands gesture. The extracted areas by the skin classifier are usually scattered and not homogenous based on the nature of the images and the process. It is while in some applications like facial perception we will need more accurate and smoother skin region extraction.There are few methods applied in some previous skin detection researches but there is no special evaluation or judgment particularly on this topic. Here in this work it is tried to introduce a simple and effective method for region homogenization after a pixel based color classification based on distances in both color and spatial domains. Its higher accuracy is shown in compare of three other methods and then discussed about.
GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets
Authors: Karam Gouda, Mohammed J. Zaki
Venue: Data Mining and Knowledge Discovery (2005)

We present GenMax, a backtrack search based algorithm for mining maximal frequent itemsets. GenMax uses a number of optimizations to prune the search space. It uses a novel technique called progressive focusing to perform maximality checking, and diffset propagation to perform fast frequency computation. Systematic experimental comparison with previous work indicates that different methods have varying strengths and weaknesses based on dataset characteristics. We found GenMax to be a highly efficient method to mine the exact set of maximal patterns.
Use of Framelets for Efficient Transmitter-Receiviver rendezvous in Wireless Sensor Networks
Authors: Andre Barroso, Utz Roedig, Cormac J. Sreeman
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

A basic problem introduced by the use of radio duty cycles asand energy saving technique is the need to establish rendezvousbetween transmitter and recevier. Since communication can only take place when the receiver's radio is active, the transmission of frames needs to somehow overlap with this active period. This paper investigates the use of framelets - small fixed sized frames - to achieve trasnmitter-receiverrendezvous.The benefits of applying framelets is assessedanalytically and an implementation of the concept fro the DSYS25 sensor platform is presented and evaluated. The results show that subtantial energy savings can be achieved with framelets as well as an increase in communicationthrougput.
Adapting two-class support vector classification methods to many class problems
Authors: Simon I. Hill, Arnaud Doucet
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

A geometric construction is presented which is shown to be an effective tool for understanding and implementing multi-category support vector classification. It is demonstrated how this construction can be used to extend many other existing two-class kernel-based classification methodologies in a straightforward way while still preserving attractive properties of individual algorithms. Reducing training times through incorporating the results of pairwise classification is also discussed and experimental results presented.
An Anonymous On-Demand Position-Based Routing in Mobile Ad Hoc Networks
Authors: Sk. Md. Mizanur Rahman, Masahiro Mambo, Atsuo Inomata, Eiji Okamoto
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

Due to the infrastructure-less, dynamic and broadcast nature of radio transmissions, communications in mobile ad hoc networks (MANETs) are susceptible to malicious traffic analysis. After traffic analysis, an attacker determines a target node and conducts an intensive attack against it, called target-oriented attack. The traffic analysis and the target-oriented attacks are known as quite severe problems in MANETs, including position-based routing protocols, with respect to the degradation of both throughput and security of the routing. Also position information of routing nodes is very sensitive data in MANETs where even nodes not knowing either other establish a network temporarily. Therefore we propose a new position-based routing protocol which keeps routing nodes anonymous, thereby preventing possible traffic analysis. To this end, a time variant Temporary Identifier Temp ID is computed from time and position of a node and used for keeping the node anonymous. Only the position of a destination node is required for the route discovery, and Temp ID is used for establishing the route for sending data: a receiver hand shake scheme is designed for determining the next hop on-demand with use of the Temp ID. We evaluate the level of anonymity and performance of our scheme. The analysis shows that the proposed scheme ensures the anonymity of both route and nodes and the robustness against the target-oriented attack and several others. Also our scheme is applicable to networks with any density of nodes.
Hierarchical parallel markov models for interactive social agents
Authors: Ian Horswill
Venue:  (2005)

In this report I present hierarchical parallel Markov models for the creation of interactive social agents for video games and entertainment. The approach extends existing, popular character technologies for social, communicative interaction. First, adding the knowledge of temporal interaction structure enables natural language interaction on a time scale much longer than current chatterbot technologies. Second, adding support for hierarchical interaction decomposition, where an interaction is represented as a collection of smaller, simpler elements, simplifies the authoring of complex engagement. Third, adding support for the concurrent engagement of these elements enables engagement in interleaved, naturalistic communication. The resulting decomposition supports redundancy of representation, graceful performance degradation through the simultaneous engagement of behaviors on different levels of abstraction, and the stochastic approximation mechanism increases robustness in the face of noise and ambiguity. In this report, I present the details of hierarchical parallel Markov models, I examine two entertainment agents that use this technique, and explain the implementational details of how such an approach can be used in the development of future systems.
Denial-of-Service Resistant Multicast Authentication Protocol with Prediction Hashing and One-way Key Chain
Authors: Seonho Choi
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Requirements that need to be met by multicast authentication schemes are packet authenticity, packet loss robustness, loss model independence, and denial of service (DoS) resistance. We develop an efficient multicast authentication scheme for real-time streaming applications that is resistant to denial-of-service attacks while consuming much less resources (CPU and buffer) at receivers compared to previously proposed schemes. This scheme utilizes prediction hashing (PH) and oneway key chain (OKC) techniques based on erasure codes and distillation codes. PH and OKC techniques enable the receiver to significantly reduce the CPU overhead and buffer requirements compared to other block-based solution approaches. Analysis conducted indicates that this new scheme consumes much less CPU time and buffer space than one of the recently proposed denial-ofservice (DoS) resistant multicast authentication schemes, pollution resistant authenticated block streams (PRABS) [10], by a factor of more than 5 for buffer requirement and 3 for CPU requirement.
Image Completion from Low-Level Learning
Authors: Bin Zhu, H. D. Li
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

We present a learning-based approach to complete the missing parts of an image. Besides the conventional adopted image continuity and coherency heuristics, learnt image patches are used to better regularize the completion result. Through the learning process from a collection of commonly encountered natural images, we built a synthetic world consisting of scenes and their corresponding images. We further model the inter-patch relationships with a Markov Network. A belief propagation scheme is then used to choose and update a latent scene structure based on a maximal posterior probability estimation of the given image. The above operation usually converges within a few iterations. The obtained image is visually realistic.
P2Proxy: Peer-to-Peer Proxy Caching Scheme for VOD Service
Authors: Geun Jeong Lee, Chi Kyu Choi, Chang Yeol Choi, Hwang Kyu Choi
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

In this paper, we propose a new scalable proxy caching scheme, called P2Proxy, for efficient multimedia streaming service in P2P environment. The proposed P2Proxy scheme is composed of a group of clients that requests the same media stream in a server. Each client in the group stores a different part of the stream through a regular channel into its local buffer starting at the beginning of the request until the client buffer becomes full. A client receives the request stream from other clients as long as the parts of the stream are available in the client group. The only missing parts of the stream which are not in the client group are received directly from the server through the other patching channel. All clients in the group share the parts of the media stream. Our simulation results show that the proposed P2Proxy scheme outperforms the existing scheme with respect to the server bandwidth requirement for varying request interval and client buffer size.
Case Studies: The Potential Teaching Instruments for Software Engineering Education
Authors: Vasudeva Varma, Kirti Garg
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

The current approaches to the Software Engineering Education fall short to fulfill the industry demand for quality software engineering. A constant need to create and imbibe more effective learning environments is growing in order to manage this demand. This paper discusses the learning disabilities possessed by both the conventional and the non-conventional approaches for teaching Software Engineering. We propose that case studies can be used as effective teaching mediums and a case study centric learning environment can address these learning disabilities. A case study approach can help the students to gain and retain realistic exposure to concepts of Software Engineering as they are applied in the real world, and the students of today can be groomed as excellent professionals who have experienced the intricacies and complexities of the real world as well as tried their hands to manage these complexities.
A security scripting course
Authors: Rick Austin, Rich Schlesinger, Ben Setzer
Venue: Proceedings of the 2nd annual conference on Information security curriculum development (2005)

This article discusses a work in progress; the design of a course taken by students early in an undergraduate degree focusing on security and assurance. The course follows a general introductory course in basic computer system concepts and an object-oriented programming course. The course discussed here covers basic command line scripting and script programming in Perl. This course will also introduce concepts of secure programming.
Traffic Measurement and Analysis of TUNET
Authors: Jun Zhang, Jiahai Yang, Changqing An, Jilong Wang
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

Traffic measurement and analysis, as one of the important methods of understanding and characterizing network, can provide significant support for network management. After a brief introduction of a novel NP (Network Processor)-based architecture of traffic measurement, the paper presents the detailed analysis results of the traffic collected from the Gigabit link connecting Tsinghua University campus network (in short, TUNET) to its upstream ISP, China Education and Research NETwork (in short, CERNET). Then, the paper comprehensively analyzes the traffic from multi-dimension viewpoints, including temporal distribution, packet length distribution, port-based distribution, protocol-based distribution, and TopN statistics. Such analysis not only provides support for the study of user behavior, but also enriches traffic measurement technology
Should Illinois-Scan Based Architectures be Centralized or Distributed?
Authors: Ahmad Al-Yamani, Narendra Devta-Prasanna, Arun Gunda
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

This paper presents analysis of the trade off between hardware overhead, runtime, and test data volume when implementing Systematic Scan Reconfiguration using centralized and distributed architectures of the Segmented Addressable Scan, which is an Illinois-Scan based architecture. The results show that the centralized scheme offers better data volume compression, similar ATPG runtime results and lower hardware overhead. The cost with the centralized scheme is in the routing congestion.
Real-time cloth simulation for garment CAD
Authors: Napaporn Metaaphanon, Pizzanu Kanongchaiyos
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

For decades, Computer Graphics has played an important role in many kinds of design works, especially, industrial design of solid objects. However, most available methods can not work well for soft and deformable object like cloth. The quality of works mostly depends on the efficiency of hardware as same as the cloth and garment pattern modeling methods. In this research, real time cloth modeling for costume design and making is proposed using mass-spring model and cellular structure space model. For representing realistic cloth, mass-spring model is parameterized under Newton laws, while cellular structured space model is defined for keeping the structure of each garment pattern. Then, the pattern is scaled to fit the input user's body size and clothed on user's virtual body. Furthermore, this pattern can be printed out as a set of ready-to-cut patterns. Proposed 3D modeling for costume design can reduce material cost and computational time for pattern making, and also enable dress remaking and refitting process in real time.
A challenge for reusing multiplayer online games without modifying binaries
Authors: Yugo Kaneda, Hitomi Takahashi, Masato Saito, Hiroto Aida, Hideyuki Tokuda
Venue: Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games (2005)

In this paper, we advocate the problem of reusing Multiplayer Online Game (MOG) in Client-Server (C/S) architecture. The problem is that MOG services cannot continue to be provided because of high maintenance cost for operating game servers. Additionally, it is caused by the decreasing service users who getting tired of the game and game providers who have faced difficulties in collecting charge of the game service. It is important that every user can play MOGs at any time whether game servers of game providers run them or not.We describe a challenging method for solving the problem. Our solution provides a middleware which is inserted under the game applications to switch network architecture from C/S to Peer-to-Peer (P2P). By exploiting this method, the network architecture of MOGs can be easily changed from C/S to P2P under some restrictions without modifying binaries.
Randomized Pseudo-random Function Tree Walking Algorithm for Secure Radio-Frequency Identification
Authors: Leonid Bolotnyy, Gabriel Robins
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

Privacy and security are two main concerns in Radio Frequency Identification (RFID) systems. We first extend the analysis of the Randomized Tree Walking Algorithm for RFID tag collision avoidance, which is secure against passive adversaries. Then, we devise a new Randomized Pseudo-Random Function (PRF) Tree Walking Algorithm, which is secure against active eavesdroppers and allows for the efficient interrogation of many tags. Our algorithm accommodates the addition and removal of tags from the system, and dynamically adapts to security and privacy policy changes.
Utility Accrual Real-Time Scheduling under Variable Cost Functions
Authors: Haisang Wu, Umut Balli, Binoy Ravindran, E. Douglas Jensen
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

We present a real-time scheduling algorithm called VCUA, for tasks whose execution times are functions of their starting times. We model such variable execution times with variable cost functions (or VCFs). The algorithm considers application activities that are subject to time/utility function time constraints, VCFs, and the scheduling objective of assuring that the maximum interval between any two consecutive successful completion of jobs of a task must not exceed a specified bound, and maximizing the system¿s total utility. We establish that VCUA achieves optimal timeliness during under-loads, and identify the conditions under which timeliness assurances hold. Our simulation experiments illustrate VCUA¿s effectiveness and superiority.
Research and Implementation of Role-Based RBAC Administration Model
Authors: QIU Jiong, MA Chen-hua, Yin Jian-wei, Dong Jin-xiang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

RBACAM, a role-based administrative model of RBAC, is proposed in this paper. It simplifies the description of role hierarchies with the definition of role identity code and role derivative information pair group. The concept of role administration domain and role enhanced administration domain is introduced to realize decentralized administration of RBAC. Each role has responsibility for role administration in its own administration domain and enhanced administration domain. A series of conflict checking rules to maintain consistency and the administration of authorization constraints are provided in the model. Administrative algorithms of role hierarchies, userrole assignments, permission-role assignments and authorization constraints are also described. RBACAM can be applied in the context of the RBAC96 model without introducing additional entities and relations. The main advantage of RBACAM is its simplicity, completeness and practicability.
Minimization of Randomized Unit Test Cases
Authors: Yong Lei, James H. Andrews
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

We describe a framework for randomized unit testing, and give empirical evidence that generating unit test cases randomly and then minimizing the failing test cases results in significant benefits. Randomized generation of unit test cases (sequences of method calls) has been shown to allow high coverage and to be highly effective. However, failing test cases, if found, are often very long sequences of method calls. We show that Zeller and Hildebrandt's test case minimization algorithm significantly reduces the length of these sequences. We study the resulting benefits qualitatively and quantitatively, via a case study on found open-source data structures and an experiment on lab-built data structures.
Pedestrian Tracking with Shoe-Mounted Inertial Sensors
Authors: Eric Foxlin
Venue: IEEE Computer Graphics and Applications (2005)

One of the main obstacles to the real-world deployment of location-sensitive wearable computing, including mixed reality, is that current position-tracking technologies require an instrumented, marked, or premapped environment, which is impractical in many applications. This article presents a pedestrian inertial navigation device called NavShoe, which can work in arbitrary unprepared indoor/outdoor environments. It consists of a miniature low-power inertial/magnetometer package tucked into the shoelaces of one foot, wirelessly coupled to a PDA that runs software to fuse inertial, geomagnetic, and optional GPS measurements to derive an optimal navigation pose solution. Novel algorithms are presented to accurately calibrate the compass for compensation of hard-iron and soft-iron distortions, and then align it to true north using GPS transfer alignment. Options are discussed for alternative aiding sensors indoors such as computer vision, map-correlation, and local landmark sensors. Finally, an approach is discussed to use the foot-mounted precision attitude reference as an alignment source for precision 6-DOF trackers of head-mounted and handheld implements such as augmented reality displays.
Face Recognition from Video by Matching Image Sets
Authors: Tat-Jun Chin, James U, Konrad Schindler, David Suter
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

As opposed to still-image based paradigms, video-based face recognition involves identifying a person from a video input. In video-based approaches, face detection and tracking are performed together with recognition, as usually the background is included in the video and the person could be moving or being captured unknowingly. By detecting and raster-scanning a face sub-image to be a vector, we can concatenate all extracted vectors to form an image set, thus allowing the application of face recognition algorithms based on matching image sets. It has been reported that linear subspace-based methods for face recognition using image sets achieve good recognition results. The challenge that remains is to update the linear subspace representation and perform recognition on-the-fly so that the recognition-from-videoobjective is not defeated. Here, we demonstrate how this can be achieved by using a well-studied incremental SVD updating procedure. We then present our online face recognition-from-video framework and the recognition results obtained.
On Distributed Fault-Tolerant Detection in Wireless Sensor Networks
Authors: Xuanwen Luo, Ming Dong
Venue: IEEE Transactions on Computers (2006)

In this paper, we consider two important problems for distributed fault-tolerant detection in wireless sensor networks: 1) how to address both the noise-related measurement error and sensor fault simultaneously in fault-tolerant detection and 2) how to choose a proper neighborhood size n for a sensor node in fault correction such that the energy could be conserved. We propose a fault-tolerant detection scheme that explicitly introduces the sensor fault probability into the optimal event detection process. We mathematically show that the optimal detection error decreases exponentially with the increase of the neighborhood size. Experiments with both Bayesian and Neyman-Pearson approaches in simulated sensor networks demonstrate that the proposed algorithm is able to achieve better detection and better balance between detection accuracy and energy usage. Our work makes it possible to perform energy-efficient fault-tolerant detection in a wireless sensor network.