ppxscal/embedding_network huggingface dataset:
Service-oriented Mobile Calculus Technology in M-Business interoperability between Customer and e-Shop
Authors: Memon Abdul Ghafoor, Jianwei Yin, Jinxiang Dong, Maree Mujeeb-u-Rehman
Venue: Proceedings of the IEEE International Workshop (2005)

The use of web source as a communication channel drives requirements for next generation advanced e- Business, such as fast e-access and e-customer support capabilities. Recently mobile technologies advances, there is increasing demand for mobile customer to connect to existing organizations. In this paper we discuss the intermediate role of \pi-calculus technology in between different inter-connected organizations. \pi- calculus technology play important role in sharing products required by many organizational platforms. It also provides an ideal implementation platform, furnishing tools that help streamline complex applications. Our framework facilitates Mobile Agent application development system, providing key features for distributed organizations interfaces communication system. This work provides a formal approach of HO\pi-calculus where Mobile Agents are specified. The specification part of our system (emphasizing mobility) was carried out by the use of the HO\pi-calculus and for the part of execution (the migration of agents). Our Mobile Agent surfing product from interconnected organizations; we prove that this preserves and reflects process behavior, meets essential requirements of mobile calculus processes. It also enabling mobile access, automated trading, simplicity and adaptability for realization as a distributed transaction-based paradigm for e-shopping based on intelligent agent interface.
Analysis on Spatial and Temporal Features of Gait Kinematics
Authors: Wan Noorshahida Mohd Isa
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

Gait kinematics features, which concerns its geometry, can be represented using its spatial and temporal characteristics; namely moments of silhouette and angular displacements of limb. Limb angular displacements data are manual labeled hip angle, knee angle, and ankle angle data and silhouette moments data are simple centralized moments of binary image data. This paper presents an analysis on spatial and temporal features of gait kinematics. A standard approach of using PCA (Principal Component Analysis) and CA (Canonical Analysis) algorithms are used for the analysis. To ensure an invariant analysis due to differences in walking speed, a cycle extraction procedure, which consists of interpolation and resampling is performed beforehand. Results from this paper can suggest that angular displacements data can be a better feature representation in comparison to the simple silhouette moments data.
Dynamic Clustering Using Support Vector Learning with Particle Swarm Optimization
Authors: Jiann-IIorng Lin, Ting-Yu Cheng
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

This paper presents a new approach to the support vector learning for dynamic clustering based on particle swarm optimization. Support vector clustering requires solving a constrained quadratic optimization problem. This problem often involves a matrix with an extremely large number of entries, which make of-the-shelf optimization packages unsuitable. Several methods have been used to decompose the problem, of which many require numeric packages for solving the smaller subproblems. This paper gives an overvieur of the support vector clustering algorithm. Particle swarm optimization is discussed as an alternative method for solving a support vector clustering's quadratic programming problem. Experimental results illustrate the convergence properties of the algorithms.
A Pipelined Switched-Current Chaotic System for the High-Speed Truly Random Number Generation in Crypto Processor
Authors: Tong Zhou, Mingyan Yu, Yizheng Ye
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

This paper proposes a chaotic system as a truly random number generator that can be fully integrated in a crypto processor. The chaotic system is composed of four pipelined switched-current circuits based on a simple piecewise-linear one-dimensional map. The optimum parameters of the map are analyzed to avoid certain circuits being locked at the parasitic stable points. As a necessary building block in a crypto processor, a hardware SHA-1 module is utilized to post-process the original bits generated by the chaotic system. The whole design is realized in TSMC 0.25 µm CMOS mixed signal process, and the randomness has been proved by simulations. The analog part of the design is clocked at 10 MHz and the digital part at 143 MHz. The ultimate truly random output bit rate is 200 Mbit/s.
Evaluation of Three Wearable Computer Pointing Devices for Selection Tasks
Authors: Joanne E. Zucco, Bruce H. Thomas, Karen Grimmer
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

This paper presents the results of an experiment comparing three commercially available pointing devices (a trackball, gyroscopic mouse and Twiddler2 mouse) performing selection tasks for use with wearable computers. The study involved 30 participants performing selection tasks with the pointing devices while wearing a wearable computer on their back and using a head-mounted display. The error rate and time to complete the selection of the circular targets was measured. When examining the results, the gyroscopic mouse showed the fastest mean time for selecting the targets, while the trackball performed with the lowest error rate.
Interference-aware routing and bandwidth allocation for QoS provisioning in multihop wireless networks: Research Articles
Authors: Jian Tang, Guoliang Xue, Christopher Chandler
Venue: Wireless Communications Mobile Computing (2005)

In this paper, we study the bandwidth guaranteed routing and timeslot allocation (BANDRA) in TDMA-based multihop wireless networks with dynamic traffic. We formally model BANDRA as an optimization problem and present an integer linear programming (ILP) formulation to provide optimal solutions. This problem turns out to be a hard problem because of the impact of interference. Therefore, we propose a two-step scheme, i.e., seeking a path for routing first and then allocating bandwidth along the found path. We present two routing algorithms to compute interference-optimal cost-bounded paths. In addition, we present an optimal bandwidth allocation algorithm to allocate timeslots along the found paths for connection requests with unit bandwidth requirements. For the general case where the bandwidth requirement is larger than one, we present an effective heuristic algorithm. Our simulation results show that the average difference between solutions given by our efficient scheme and optimal ones in terms of call-blocking ratio is only 7&percnt;. Compared with the shortest path routing, our interference-aware routing algorithms combined with our bandwidth allocation algorithm always reduce call-blocking ratios. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Generic model abstraction from examples
Authors: Yakov Keselman
Venue:  (2005)

The representational gap between traditional, low-level image features and generic models has largely been unaddressed by the object recognition community. Instead, the gap has been artificially eliminated by either bringing the image closer to the models, using simple scenes containing idealized, textureless objects, or by bringing the models closer to the images, using 3-D CAD model templates or 2-D appearance model templates. In this thesis, we attempt to bridge the representational gap for the domain of model acquisition. Specifically, we address the problem of automatically acquiring a generic 2-D view-based class model from a set of images, each containing an exemplar object belonging to that class. We introduce a novel graph-theoretical formulation of the problem, in which we search for the lowest common abstraction among a set of lattices, each representing the space of all possible region groupings in a region adjacency graph representation of an input image. The problem is intractable, and we present a number of approximation algorithms to yield an efficient solution. We demonstrate the approach on real imagery.
A compositional logic for control flow and its application in foundational proof-carrying code
Authors: Andrew W. Appel
Venue:  (2005)

Proof-Carrying Code (PCC) is a static mechanism that mechanically verifies type safety of machine-language programs. But the problem in conventional PCC is, who will verify the verifier (the type checker) itself? The Foundational Proof-Carrying Code (FPCC) project at Princeton verifies the soundness of the type checker from the smallest possible set of axioms&mdash;logic plus machine semantics. One challenge in the verification is that machine code, unlike high-level languages, contains unstructured control flow (due to arbitrary jumps). A piece of machine code can contain multiple entry points that jump instructions might jump to, and multiple exit points. Traditional Hoare logic and its variants either verify the partial correctness of programs with only one entry and one exit, or need the whole program to verify jump instructions, which is not modular. The major contribution of this dissertation is a program logic, Lc , which modularly verifies properties of machine-code fragments. Unlike previous program logics, the basic reasoning units in Lc are multiple-entry and multiple-exit code fragments. Lc provides composition rules to combine code fragments and to eliminate intermediate entries/exits in the combined fragment. Lc is not only useful for reasoning about properties of machine code with unstructured control flow, but also useful for deriving rules for common control-flow structures such as while-loops, repeat-until-loops, among others. We also present a semantics for Lc and prove that Lc is both sound and complete. As an application to the FPCC project, I have implemented Lc on top of the SPARC machine language and used Lc 's rules to verify the soundness of the instruction rules of a full-fledged low-level typed assembly language&mdash;LTAL. This demonstrates Lc 's applicability of verifying properties of machine-language programs.
Timing analysis considering spatial power/ground level variation
Authors: M. Hashimoto, J. Yamaguchi, H. Onodera
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

Spatial power/ground level variation causes power/ground level mismatch between driver and receiver, and the mismatch affects gate propagation delay. This work proposes a timing analysis method based on a concept called "PG level equalization" which is compatible with conventional STA frameworks. We equalize the power/ground levels of driver and receiver. The charging/discharging current variation due to equalization is compensated by replacing output load. We present an implementation method of the proposed concept, and demonstrate that the proposed method works well for multiple-input gates and RC load models.
High Performance Linear Algebra Operations on Reconfigurable Systems
Authors: Ling Zhuo, Viktor K. Prasanna
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

Field-Programmable Gate Arrays (FPGAs) have become an attractive option for scientific computing. Several vendors have developed high performance reconfigurable systems which employ FPGAs for application acceleration. In this paper, we propose a BLAS (Basic Linear Algebra Subprograms) library for state-of-the-art reconfigurable systems. We study three data-intensive operations: dot product, matrix-vector multiply and dense matrix multiply. The first two operations are I/O bound, and our designs efficiently utilize the available memory bandwidth in the systems. As these operations require accumulation of sequentially delivered floating-point values, we develop a high performance reduction circuit. This circuit uses only one floating-point adder and buffers of moderate size. For matrix multiply operation, we propose a design which employs a linear array of FPGAs. This design exploits the memory hierarchy in the reconfigurable systems, and has very low memory bandwidth requirements. To illustrate our ideas, we have implemented our designs for Level 2 and Level 3 BLAS on Cray XD1.
A tissue-conductive acoustic sensor applied in speech recognition for privacy
Authors: Panikos Heracleous, Yoshitaka Nakajima, Hiroshi Saruwatari, Kiyohiro Shikano
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

In this paper, we present the Non-Audible Murmur (NAM) microphones focusing on their applications in automatic speech recognition. A NAM microphone is a special acoustic sensor attached behind the talker's ear and able to capture very quietly uttered speech (non-audible murmur) through body tissue. Previously, we reported experimental results for non-audible murmur recognition using a Stethoscope microphone in a clean environment. In this paper, we also present a more advanced NAM microphone, the so-called Silicon NAM microphone. Using a small amount of training data and adaptation approaches, we achieved a 93.9% word accuracy for a 20k vocabulary dictation task. Therefore, in situations when privacy in human-machine communication is preferable, NAM microphone can be very effectively applied for automatic recognition of speech inaudible to other listeners near the talker. Because of the nature of non-audible murmur (e.g., privacy) investigation of the behavior of NAM microphones in noisy environments is of high importance. To do this, we also conducted experiments in real and simulated noisy environments. Although, using simulated noisy data the NAM microphones show high robustness against noise, in real environments the recognition performance decreases markedly due to the effect of the Lombard reflex. In this paper, we also report experimental results showing the negative impact effect of the Lombard reflex on non-audible murmur recognition. In addition to a dictation task, we also report a keyword-spotting system based on non-audible murmur with very promising results.
A Robust and Secure Media Signature Scheme for JPEG Images
Authors: Qibin Sun, Shih-Fu Chang
Venue: Journal of VLSI Signal Processing Systems (2005)

In [1---3], we have briefly introduced a robust and secure digital signature solution for multimedia content authentication, by integrating content feature extraction, error correction coding (ECC), watermarking and cryptographic signature into one unified framework. In this paper, we first study the difference between two types of distortions, namely incidental distortions which come from the defined acceptable content manipulations such as lossy compression, and intentional distortions which come from real attacks such as content copy-paste. We then introduce a new JPEG-compliant solution under our proposed framework but with different ECC and watermarking methods. Finally system performance evaluation and analysis will be given to further demonstrate the practicability of our method.
A Thorough Experimental Study of Datasets for Frequent Itemsets
Authors: Frederic Flouvat, Fabien De Marchi, Jean-Marc Petit
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to understand the influence of datasets on the algorithms behavior. Being able to explain why certain algorithms are likely to perform very well or very poorly on some datasets is still an open question. In this setting, we describe a thorough experimental study of datasets with respect to frequent itemsets. We study the distribution of frequent itemsets with respect to itemsets size together with the distribution of three concise representations: frequent closed, frequent free and frequent essential itemsets. For each of them, we also study the distribution of their positive and negative borders whenever possible. From this analysis, we exhibit a new characterization of datasets and some invariants allowing to better predict the behavior of well known algorithms. The main perspective of this work is to devise adaptive algorithms with respect to dataset characteristics.
A Gateway Replication Scheme for Improving the Reliability of Mobile-to-Grid Services
Authors: Tran Minh, Yong-Hyuk Moon, Chan-Hyun Youn, Jeong-Je Cho, Sang-Jin Jeong
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Recently, the necessity of interconnection between mobile devices and static Grid has grown up. Since the intermittent connection of mobile device is unpredictable, we need a special architecture for providing reliable Grid services such as E-health services. In this paper, we introduce a new Mobile-to-Grid Gateway Replication (MGR) architecture for improving the reliability of Grid services provided to mobile device. In MGR architecture we integrate Mobile-to-Grid Gateway and Grid Policy Quorum Based Resource Management (PQRM) [5] in to one compact system. We also proposed a Cost-Constraints replication algorithm for calculating the optimal number of replication gateways dependent on users' budget and requirements. The performance of proposed architecture is measured by using numerical experiments and simulation results.
Text input disambiguation supported on a hierarchical user model
Authors: Carlos Bento, Nuno Gil
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

Mobile phones are used for various tasks that go far from voice communication. A popular use is for composition of short messages (SMSs), but other applications are also available like email, agenda, contact, and note management. All these uses have in common the need for text input on a small keyboard with ambiguity problems.Various techniques are currently used for input disambiguation, with variable results in terms of usability and efficiency. Some techniques achieve good performance with messages composed by words from a dictionary but poorly when a significant number of words are not in memory.In this paper we present a solution for text disambiguation supported on a general model for disambiguation plus a user model generated from previous messages sent by the user. We present results obtained with this approach and discuss future improvements.
Guaranteed Real-Time Services over Standard Switched Ethernet
Authors: Xing Fan, Magnus Jonsson
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

In this paper, we contribute with an approach to support guaranteed real-time services over standard switched Ethernet without additional hardware or software modification of the switch and the underlying standard. In our proposal, the traffic differentiation mechanism introduced by the IEEE 802.1D/Q standard and the standard hardware-implemented First Come First Served (FCFS) priority queuing are used in the switch and the source nodes. We have derived a feasibility analysis algorithm that can be used to ensure that the real-time requirements can be met. The algorithm also gives, as a sub-result, the needed buffer space in the end nodes and the switch. Moreover, our feasibility analysis supports variablesized frames and switches with different bit-rates ports. The simulation analysis verifies our feasibility analysis.
Semi-automatic modifications of video object trajectories for video compositing applications
Authors: Henri Nicolas, Franck Denoual
Venue: Signal Processing (2005)

This paper proposes a new approach allowing efficient and semi-automatic object-based manipulation for video editing or post-production application, such as the modification of the trajectories of video objects in a natural scene. For that purpose, an image is seen as a superposition of video object plane (VOP) on an original image or a mosaic view of a fixed background. The method is based on the definition of an editing scenario which contains all the information required to create the edited sequence. A warping model is used to represent the location and the modification of the video object in the 2-D scene. such an application is by nature semi-automatic since the operator has to specify the modifications that he wants to perform on the original sequence. The proposed method has been designed in order to reduce as much as possible the human workload by using the notion of key VOP and by calibrating in depth the fixed background area. Experimental results show that a high level of realism can be obtained on edited images in which the original trajectories of non-rigid video objects have been strongly modified.
Investigating graphical user interface usability on task sequence and display structure dependencies
Authors: One-Jang Jeng
Venue:  (2004)

Designing Graphical User Interfaces (GUI) requires the consideration of task sequence requirements (sequence of operations arising from task structures and application constraints) and display structure (layout of the elements of the interface) relationships. The basic purpose was to understand the usability differences of the interfaces through efficiency, motor performance, and search performance. Thirty-two subjects performed experiments in four groups. The experiments differed in display structure and compatibility of task sequences. Subject mouse actions, mouse coordinates and eye positions were recorded. The derived measures, click efficiency, mouse traversal and eye visits to different areas of interest (namely the tool, object, and goal), were analyzed in a repeated measures factorial design with compatibility and display structure as the between subjects factors and phase of learning as the within subject factor. A significant interaction between compatibility and phase of learning (p < .01) was observed. Mouse traversal per unit time increased significantly (p < .05) across phases of learning. The phase of learning affected the number of eye visits for all groups. Compatibility had a significant ((p < .005) effect on the average processing time during search. The results establish that the compatibility of task sequence requirement with the display structure affecting the performance of subjects and hence the usability of the interface was thus obtained. However, through learning, subject performance showed considerable improvement and the effects of task sequence and display structure diminished at final stages of user learning. Based on this evidence, a systemic structural activity approach was used to develop a model of human performance on the eye movement and mouse action data. This structural model of human performance is defined as an algorithm and can be used for estimating complexity of task performance. In this study only the assumptions for development of the model and the formulation of the model are explained as an application of the results of the study. The study hence served a dual purpose in the long run: understanding the compatibility of the task sequence with the interface display structure as well as establishing eye and mouse movements as a viable tool to study task performance at human computer interfaces.