ppxscal/embedding_network huggingface dataset:
Formulating context-dependent similarity functions
Authors: Gang Wu, Edward Y. Chang, Navneet Panda
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Tasks of information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be formulated in a context-dependent (also application-, data-, and user-dependent) way. In this paper, we present a novel method, which learns a distance function by capturing the nonlinear relationships among contextual information provided by the application, data, or user. We show that through a process called the "kernel trick," such nonlinear relationships can be learned efficiently in a projected space. In addition to using the kernel trick, we propose two algorithms to further enhance efficiency and effectiveness of function learning. For efficiency, we propose a SMO-like solver to achieve O(N2) learning performance. For effectiveness, we propose using unsupervised learning in an innovative way to address the challenge of lack of labeled data (contextual information). Theoretically, we substantiate that our method is both sound and optimal. Empirically, we demonstrate that our method is effective and useful.
Velocity driven haptic rendering
Authors: Pavel Kolčárek, Jiří Sochor
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

This paper presents a compact method for improving haptic rendering in virtual environments using Level Of Detail (LOD) with force feedback. We have introduced a velocity driven LOD, a new concept in using LOD in haptics. The aim of this approach differs from using LOD techniques in graphics. Our method simplifies the model according to the speed of the user's fingertip. The users fly quickly through the scene and get a rough overview of it. As they slow down, they obtain more and more details. We have enhanced this basic idea by smooth switching between two successive LODs and by mechanisms leading to a more natural perception of dynamically changing surfaces.
Hierarchical Supervisory Control and Plant Monitoring Applied to Industrial Furnaces Incorporating a priori Knowledge
Authors: B. Vinsonneau, D. P. Goodall, K. J. Burnham
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

The paper proposes a novel model-based hierarchical supervisory control and plant monitoring system. Key to the new approach is a model of a furnace which takes into account the physical nonlinear behaviour within each zone at the local level, the inter-zone behaviour at the intermediate level and overall plant performance monitoring at the higher level. Through the use of a priori knowledge in the development of the model(s) the paper stresses the fact that optimum plant performance, hence profitability at the higher level, can only be achieved through a thorough understanding of the issues at the lower and intermediate level. In particular, the paper proposes a new predictive supervisory control strategy which is able to proactively administer set points at the intermediate level to ensure that the exit temperature at the final stage is achieved.
The íJini Proxy Architecture for Impromptu Mobile Services
Authors: Choonhwa Lee, Sumi Helal, David Nordstedt
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

Wireless hotspots and broadband coverage are permeating the globe giving rise to interesting spontaneous networking scenarios. The discovery and delivery of the most relevant and suitable services in a spontaneous network is a problem of paramount importance. In this paper, we propose an architecture that can support context-aware service discovery and delivery for resource-constrained mobile devices. At the heart of the architecture is the ..Jini proxy which mediates the discovery and delivery processes. Its delivery subsystem provides thin-client based adaptation for fat service delivery that does not fit into thin client devices. To demonstrate its effectiveness, we developed a proof-of-concept prototype, focusing first on J2ME smartphones.
Guidelines for Appropriate Use of Simulated Data for Bio-Authentication Research
Authors: Yan Ma, Michael Schuckers, Bojan Cukic
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

In this paper, we outline a framework for appropriate and proper usage of simulated data for biometric authentication research. Currently, there are no formal guide-lines concerning the use of simulated data in the biometric authentication literature. Some have suggested the usage of simulated or synthetic data while others have advised against it. Our position is that there is a place for simulation data in biometrics research but that such implementations need to meet certain requirements. To that end we describe conditions under which it is reasonable to use such data, as well as criteria for evaluating the appropriateness of a data generation methodology. This criteria is that models for generation of artificial data should be flexible, consistent and parsimonious. Along with justifying these criteria, we illustrate how simulated data might be used to evaluate a classifier.
Structural Decomposition and Statistical Description of Farsi/Arabic Handwritten Numeric Characters
Authors: Saeed Mozaffari, Karim Faez, Majid Ziaratban
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

A Statistical method embedded with statistical features is proposed for Farsi/Arabic handwritten zip code recognition in this paper. The numeral is first smoothed and the skeleton is obtained. A set of feature points are then detected and the skeleton is decomposed into primitives. A primitive code includes the information of each primitive and a global code is derived from the primitive codes to describe the topological structure of the skeleton. By using the average and variance of X and Y changes in each primitive, the Direction and curvature of the skeleton can be statistically described. Since the global codes have different lengths, we applied PCA algorithm to normalize their lengths. Thanks to statistically description of the skeleton, we can use the nearest neighbor classifier for recognition. According to experimental results, classification rate of 94.44% is obtained for numerals on the test sets gathered from various people with different educational background and different ages. Our database includes 480 samples per digit. We used 280 samples of each digit for training and the rest (200) for test.
Roughness of amorphous/crystalline interface in pre-amorphization implantation: Molecular dynamic simulation and modeling
Authors: Min Yu, Rong Wang, Huihui Ji, Ru Huang, Xing Zhang, Yangyuan Wang, Jinyu Zhang, Hideki Oka
Venue: Microelectronic Engineering (2005)

Pre-amorphization implantation has been applied as a shallow junction technology. Roughness at amorphous/crystalline (a/c) interface should be controlled to improve junction characteristics. To understand and model a/c interface roughness, molecular dynamic method is applied in simulating pre-amorphization implantation. A method to reproduce roughness at a/c interface by molecular dynamic simulation is presented. A model of interface roughness is presented. Si and Ge implantation from 2-20keV at a dose of 1x10^1^5cm^-^2 is simulated. The depth of a/c interface is reproduced. Experimental results of a/c interface roughness are successfully simulated. The interface roughness is well reproduced and interpreted by the model presented.
Clustering Algorithms for Bank Customer Segmentation
Authors: Danuta Zakrzewska, Jan Murlewski
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Market segmentation is one of the most important area of knowledge-based marketing. In banks, it is really a challenging task, as data bases are large and multidimensional. In the paper we consider cluster analysis, which is the methodology, the most often applied in this area. We compare clustering algorithms in cases of high dimensionality with noise. We discuss using three algorithms: density based DBSCAN, kmeans and based on it two-phase clustering process. We compare algorithms concerning their effectiveness and scalability. Some experiments with exemplary bank data sets are presented.
Shortest-Path Kernels on Graphs
Authors: Karsten M. Borgwardt, Hans-Peter Kriegel
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available by defining a kernel function on instances of graphs. Graph kernels based on walks, subtrees and cycles in graphs have been proposed so far. As a general problem, these kernels are either computationally expensive or limited in their expressiveness. We try to overcome this problem by defining expressive graph kernels which are based on paths. As the computation of all paths and longest paths in a graph is NP-hard, we propose graph kernels based on shortest paths. These kernels are computable in polynomial time, retain expressivity and are still positive definite. In experiments on classification of graph models of proteins, our shortest-path kernels show significantly higher classificationaccuracy than walk-based kernels.
Japanese Conceptions of Privacy: An Intercultural Perspective
Authors: Makoto Nakada, Takanori Tamura
Venue: Ethics and Information Technology (2005)

This paper deals with intercultural aspects of privacy, particularly with regard to important differences between Japanese and the Western views. This paper is based on our discussions with Rafael Capurro --- a dialogue now represented by two separate but closely interrelated articles. The companion paper is broadly focused on the cultural and historical backgrounds of the concepts of privacy and individualism in "Western" worlds; our main theme focuses on different concepts of privacy in Japan and their sources in related aspects of Japanese culture. The interrelationship between our two papers is apparent in our taking up identical or similar topics in each paper. Reading our two papers in conjunction with each other will bring about deeper and broader insights into the diverse values and worldviews of Japan and Western cultures that underlie concepts of privacy that at a surface level appear to be similar
Data access optimization on grid systems
Authors: Laszlo Csaba Lorincz, Tamas Kozsik, Attila Ulbert, Zoltan Horvath
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

The execution of data intensive grid applications still raises several questions regarding job scheduling, data migration and replication. The optimization techniques applied by these services significantly determine how fast a job can be executed and how early the user can get the execution results. In this paper we present strategies for scheduling the execution of data intensive applications. We deem that by taking into account the way applications access their data, the grid middleware can achieve lower response times and earlier execution results. Therefore, we (1) monitor the execution of jobs and gather the necessary resource access information, (2) analyze the compiled information and generate a description of the behavior of the job, and (3) use the generated behavior description to implement optimized scheduling algorithms. This technique can be extremely useful in the case of parameter-sweep applications.
A Neural Network Aided Adaptive Second-Order Gaussian Filter for Tracking Maneuvering Targets
Authors: Nasser Sadati, Damoun Langary
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

The adaptive capability of filters is known to be increased by incorporating a neural network into the filtering procedure. In this paper, an adaptive algorithm for tracking maneuvering targets based on neural networks is proposed. This algorithm is implemented with two filters based on the current statistical model and a multilayer feedforward neural network. The two filters track the same maneuvering target in parallel and the neural network automatically considers all the state information of the two filters and adaptively adjusts the process variance of one of them to achieve better performance in different target maneuver tracking. Simulations results show that the proposed adaptive algorithm tracks maneuvering targets very well with higher precision over a wide range of maneuvers.
Study of Server Processing Load Evaluations in Ubiquitous Communication Environments
Authors: Minoru Matsumoto, Tadashi Itoh
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

This paper evaluates the influence of communication characteristics on server processing load. In Jirture ubiquitous communication environments, terminal-initiated communications will become more popularized than human-initiated communications like current internet communications. The tiny terminal having a short-range wireless communication method like a sensor node is expected to report the presence data involved in a daily life to the server. However, if these terminals become popularized, the sewer must process a lot of presence data compared with current internet communications. Therefore, from the viewpoint of network scalability, we performed hardware simulations to evaluate the influence of communication characteristics on server processing load and clarified its critical factor.
Constraint-Defined Manifolds: a Legacy Code Approach to Low-Dimensional Computation
Authors: C. William Gear, Ioannis G. Kevrekidis
Venue: Journal of Scientific Computing (2005)

If the dynamics of an evolutionary differential equation system possess a low-dimensional, attracting, slow manifold, there are many advantages to using this manifold to perform computations for long term dynamics, locating features such as stationary points, limit cycles, or bifurcations. Approximating the slow manifold, however, may be computationally as challenging as the original problem. If the system is defined by a legacy simulation code or a microscopic simulator, it may be impossible to perform the manipulations needed to directly approximate the slow manifold. In this paper we demonstrate that with the knowledge only of a set of "slow" variables that can be used to parameterize the slow manifold, we can conveniently compute, using a legacy simulator, on a nearby manifold. Forward and reverse integration, as well as the location of fixed points are illustrated for a discretization of the Chafee-Infante PDE for parameter values for which an Inertial Manifold is known to exist, and can be used to validate the computational results
Classifying Requirements: Towards a More Rigorous Analysis of Natural-Language Specifications
Authors: Allen P. Nikora
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

Requirements play a pivotal role in planning, selection, development, testing and operation of NASA's missions. Starting from mission objectives, requirements are successively decomposed into finer detail and ultimately allocated to individual components. This decomposition process is sometimes referred to as "requirements flowdown" between successive levels. The correctness of this decomposition is obviously critical to mission success: if a higher level requirement is improperly decomposed into lower level requirements, the subsequent development from that stage onwards will be jeopardized. A task to determine how to improve the rigor of requirements flowdown analyses has recently been completed. Since requirements continue to be written in natural language, the task focused on examining only natural language specifications for a JPL space mission system. One particular aspect of flow-down analysis examined was classifying requirements by type — subsetting a collection of requirements in this fashion may significantly reduce the effort required to analyze a flowdown by restricting the number of requirements analyzed at any one time, and may increase the accuracy of the flowdown analysis. The application of natural language processing techniques and machine learning techniques has resulted in classifiers that perform well in distinguishing between temporal and non-temporal requirements written in natural language. Such a capability could reduce the effort required to analyze requirements of a given type. Current plans call for extending this capability to improving automated tracing of related requirements and checking a set of related requirements for consistency.
Firm Real-Time System Scheduling Based on a Novel QoS Constraint
Authors: Donglin Liu Xiaobo Sharon Hu
Venue: IEEE Transactions on Computers (2006)

Many real-time systems have firm real-time requirements which allow occasional deadline violations but discard any jobs that are not finished by their deadlines. To measure the performance of such a system, a quality of service (QoS) metric is needed. Examples of often used QoS metrics for firm real-time systems are average deadline miss rates and (m,k){\hbox{-}}firm constraints. However, for certain applications, these metrics may not be adequate measures of system performance. This paper introduces a novel QoS constraint for firm real-time systems. The new QoS constraint generalizes existing firm real-time constraints. Furthermore, using networked control system as an example, we show that this constraint can be directly related to the control system's performance. We then present three different scheduling approaches with respect to this QoS constraint. Experimental results are provided to show the effectiveness of these approaches.
Public RFID Service Platform Based on ASP Model
Authors: Jie Wu, Dong Wang, Huanye Sheng
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Radio Frequency Identification (RFID) is expected to be widely used in the future, as it can be embedded into everyday items as RFID tags. Using RFID technology, enterprises can share real-time data about products with trade partners over the Internet. Application Service Provider (ASP) provides services for clients in a central managing way by Internet. Users who subscribe the ASP service do not need to pay much attention about the deployment, integration, access, training, management, and support of applications, because all these are done by ASP. According to the difficulties of lacking of funds and expertise for implementing RFID and complicated RFID system construction the enterprises encountered, we focus on a solution to integrate RFID system with enterprise application system based on ASP model.
Agent Technology and Scientific Workflow Management in an E-Science Environment
Authors: Zhiming Zhao, Adam Belloum, Peter Sloot, Bob Hertzberger
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

In e-Science environments, scientific workflow management systems (SWMS) hide the integration details among Grid resources and allow scientists to prototype an experimental computing system at a high level of abstraction. However, the development of an effective SWMS requires profound knowledge on both application domains and the network programming, and is often time consuming. Agent technologies provide suitable solutions to decompose the control intelligence of flow execution and to encapsulate distributed e-Science resources. The work presented in this paper is conducted in the context of the Dutch Virtual Laboratory for e-Science (VL-e) project. Agent technologies are proposed to realise generic workflow support.
Design of Randomized Multichannel Packet Storage for High Performance Routers
Authors: Sailesh Kumar, Patrick Crowley, Jonathan Turner
Venue: Proceedings of the 13th Symposium on High Performance Interconnects (2005)

High performance routers require substantial amounts of memory to store packets awaiting transmission, requiring the use of dedicated memory devices with the density and capacity to provide the required storage economically. The memory bandwidth required for packet storage subsystems often exceeds the bandwidth of individual memory devices, making it necessary to implement packet storage using multiple memory channels. This raises the question of how to design multichannel storage systems that make effective use of the available memory and memory bandwidth, while forwarding packets at link rate in the presence of arbitrary packet retrieval patterns. A recent series of papers has demonstrated an architecture that uses on-chip SRAM to buffer packets going to/from a multi-channel storage system, while maintaining high performance in the presence worst-case traffic patterns. Unfortunately, the amount of on-chip storage required grows as the product of the number of channels and the number of separate queues served by the packet storage system. This makes it too expensive to use in systems with large numbers of queues. We show how to design a practical randomized packet storage system that can sustain high performance using an amount of on-chip storage that is independent of the number of queues.
Exponential Stability of Nonlinear Singularly Perturbed Differential Equations
Authors: G. Grammel
Venue: SIAM Journal on Control and Optimization (2005)

Nonlinear singularly perturbed differential equations with two natural time scales are under consideration. It is shown that the exponential stability of both the boundary layer systems and the reduced system imply the exponential stability of the fully coupled system for small perturbation parameters. The asymptotic behavior of gain and decay rates is investigated. Moreover, it turns out that the achieved exponential stability is robust with respect to multivalued regular perturbations and small delays. The method of proof does not rely on (converse) Lyapunov theorems but on an appropriate version of Tychonov's theorem and manages without the smoothness of the vector fields involved.
Online Chinese Character Recognition System with Handwritten Pinyin Input
Authors: Yong GE, Feng-Jun GUO, Li-Xin ZHEN, Qing-Shan CHEN
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

We have developed a novel online Chinese handwriting recognition system that can recognize a Chinese character either by its handwritten script or by its handwritten Pinyin syllable. The new system is particularly useful when the user forgets how to write the desired character or when the desired character is too complex to be written conveniently. To assure the accuracy and robustness, several classifiers with different characteristics are integrated. The experimental results show that we have achieved an accuracy of 92.5% for 6763-class freely-written Chinese characters and 87.1% for 412-class unconstrained-style Pinyin syllables.
Transient Behavior of the Encoding/Decoding Circuits of Error Correcting Codes
Authors: Jien-Chung Lo, Yu-Lun Wan, Eiji Fujiwara
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

In this paper, we present an in-depth analysis of transient behavior, mainly glitches, in the parallel encoding and decoding circuits of error correcting codes. First, we found that the probability of a given number of glitches that may accumulate in the encoding/decoding circuit exhibits a Gaussianlike distribution. An estimation methodology was developed so the transient behavior of an ECC for very long word length can be predicted. We confirm that the principle of minimum-equal-weight construction of H-matrix is the best design strategy. Two potential solutions are proposed and examined to reduce the accumulation of glitches. Finally, we present the calculation methods and provide examples of odd-weight-column SEC-DED codes for up to 1024 information bits.