ppxscal/embedding_network huggingface dataset:
Alternative Schemes for Dynamic Secure VPN Deployment in UMTS
Authors: Christos Xenakis, Lazaros Merakos
Venue: Wireless Personal Communications: An International Journal (2006)

Three alternative schemes for secure Virtual Private Network (VPN) deployment over the Universal Mobile Telecommunication System (UMTS) are proposed and analyzed. The proposed schemes enable a mobile node to voluntarily establish an IPsec-based secure channel to a private network. The alternative schemes differ in the location where the IPsec functionality is placed within the UMTS network architecture (mobile node, access network, and UMTS network border), depending on the employed security model, and whether data in transit are ever in clear-text, or available to be tapped by outsiders. The provided levels of privacy in the deployed VPN schemes, as well as the employed authentication models are examined. An analysis in terms of cost, complexity, and performance overhead that each method imposes to the underlying network architecture, as well as to the mobile devices is presented. The level of system reliability and scalability in granting security services is presented. The VPN management, usability, and trusted relations, as well as their behavior when a mobile user moves are analyzed. The use of special applications that require access to encapsulated data traffic is explored. Finally, an overall comparison of the proposed schemes from the security and operation point of view summarizes their relative performance.
Analysis of Movement and Mobility of Wireless Network Users
Authors: Jeremy Shaffer, Daniel P. Siewiorek, Asim Smailagic
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

This paper describes a system developed for determining locations of devices on 802.11 wireless networks. Data representing 18,000 computers registered on Carnegie Mellon's Wireless Andrew is presented from traces taken in 2003 and 2005. Developers make many assumptions when creating applications for wearable and pervasive computers. The data collected by Locator@CMU provides a clearer understanding of large-scale wireless networks and their usage for implementing services and programs. Among the findings, we examine the mobility of a user as defined by percentage of time spent at their home site and favorite sites. Our results show that only a small number of wireless users exhibit high mobility and our data suggests that typical mobile users utilize the network only in a handful of sites. These basic patterns have remained steady over the past two years.
A Framework for Semi-Supervised Learning Based on Subjective and Objective Clustering Criteria
Authors: M. Halkidi, D. Gunopulos, N. Kumar, M. Vazirgiannis, C. Domeniconi
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In this paper, we propose a semi-supervised framework for learning a weighted Euclidean subspace, where the best clustering can be achieved. Our approach capitalizes on user-constraints and the quality of intermediate clustering results in terms of its structural properties. It uses the clustering algorithm and the validity measure as parameters.
Generalized skewing for functions with continuous and nominal attributes
Authors: Soumya Ray, David Page
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

This paper extends previous work on skewing, an approach to problematic functions in decision tree induction. The previous algorithms were applicable only to functions of binary variables. In this paper, we extend skewing to directly handle functions of continuous and nominal variables. We present experiments with randomly generated functions and a number of real world datasets to evaluate the algorithm's accuracy. Our results indicate that our algorithm almost always outperforms an Information Gain-based decision tree learner.
Qualitative Mapping, Inner Product Transformation of Qualitative Criterion, Artificial Neuron and Pattern Recognition
Authors: Jiali Feng, Qihuang Mao, Guanglin Xu, Jingjuan Feng
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

The Qualitative Mapping(QM) model for judging a property p(o) whose true value varies according to the qualitative criterion [ \alpha,\beta], t p (x,[ \alpha,\beta]) is presented in this paper. The inner product transformation of qualitative criterion w_[ \alpha,\beta] and the relation between w_[ \alpha,\beta] and artificial neuron is discussed. By the the intercept form of artificial neuron, we proof that an AN is just a boundary of a Qualitative Mapping, and if a neighborhood is closed by a group of artificial neurons induced by a group inner product transformations, then the qualitative mapping whose criterion is the closed neighborhood is equivalent to the artificial networks which consists of the group of them..
Comparative Evaluation on Concept Approximation Approaches
Authors: Jitender Deogun, Liying Jiang
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Formal Concept Analysis (FCA) is a method for deriving conceptual structures out of data that are represented as objects with features. FCA discovers dependencies within the data based on the relation among objects and features. However, not every pair of objects and features defines a concept. Concept approximation is to find the best or closest concept(s) to approximate a pair of objects and features. Concept approximation is significant in that under the circumstances that we can not find a concept, using concept approximation will give the best or most possible solution. In this paper, we evaluate three approaches through experiments in the application of document retrieval. We provide analysis of these approaches and give our concluding remarks.
QoS and Fault-Tolerant Based Distributed Dynamic Channel Allocation Protocol for Cellular Networks
Authors: Azzedine Boukerche, Kaouther Abrougui, Tingxue Huang
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Earlier studies on dynamic channel allocation protocols based upon the mutual exclusion paradigms have shown promising results. Though, very little data have been reported on how to integrate the quality of service (QoS) and fault tolerant components within these schemes. These two components are vital to the success of the deployment of future generation of wireless networks. Mobile users are not expected to have their connections cut off because of a base station or a link failure and require QoS guarantees on their connections. In this paper, we present an efficient QoS and fault tolerant based protocol for dynamic channel allocation using the mutal exclusion paradigm. Its main feature is its ability to tolerate the base station failure, mobile host failure and communication link failure, as well as reducing the connection dropping rate. QoS provisions are guaranteed in our protocol. We present our QoS and Fault-Tolerant protocol, and report on its performance eavluation using an extensive set of simulation experiments.
Optimized run-time race detection and atomicity checking using partial discovered types
Authors: Rahul Agarwal, Amit Sasturkar, Liqiang Wang, Scott D. Stoller
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. Two common kinds of concurrency errors are data races and atomicity violations (informally, atomicity means that executing methods concurrently is equivalent to executing them serially). Several static and dynamic (run-time) analysis techniques exist to detect potential races and atomicity violations. Run-time checking may miss errors in unexecuted code and incurs significant run-time overhead. On the other hand, run-time checking generally produces fewer false alarms than static analysis; this is a significant practical advantage, since diagnosing all of the warnings from static analysis of large codebases may be prohibitively expensive.This paper explores the use of static analysis to significantly decrease the overhead of run-time checking. Our approach is based on a type system for analyzing data races and atomicity. A type discovery algorithm is used to obtain types for as much of the program as possible (complete type inference for this type system is NP-hard, and parts of the program might be untypable). Warnings from the typechecker are used to identify parts of the program from which run-time checking can safely be omitted. The approach is completely automatic, scalable to very large programs, and significantly reduces the overhead of run-time checking for data races and atomicity violations.
Understanding mobile work in a distributed information space: implications for the design of ubicomp technology
Authors: Víctor M. González, Mónica E. Tentori, Elisa B. Morán, Jesús Favela, Ana I. Martínez
Venue: Proceedings of the 2005 Latin American conference on Human-computer interaction (2005)

Moving beyond the focus on interactions at the desktop computer, this paper introduces a model providing conceptual tools to understand mobile work in distributed information spaces. The model serves to describe the fundamental interactive relationships between mobile and fixed people and artifacts physically distributed in a space. Our model emerges as a result of empirical ethnographic investigations of medical work conducted to ground the design of ubiquitous computing technology. The model is used here in the analysis of data collected during a detailed observation and shadowing of four medical workers. This analysis resulted on a set of design implications that we present here together with relevant findings about the nature of the kind of mobile work experienced at hospital medical settings. We argue that modeling and characterization efforts such as the one presented here are necessary to build the theoretical foundations required for the development of ubiquitous computing.
A Superlinearly Convergent SSLE Algorithm for Optimization Problems with Linear Complementarity Constraints
Authors: Jian-Ling Li, Jin-Bao Jian
Venue: Journal of Global Optimization (2005)

In this paper we study a special kind of optimization problems with linear complementarity constraints. First, by a generalized complementarity function and perturbed technique, the discussed problem is transformed into a family of general nonlinear optimization problems containing parameters. And then, using a special penalty function as a merit function, we establish a sequential systems of linear equations (SSLE) algorithm. Three systems of equations solved at each iteration have the same coefficients. Under some suitable conditions, the algorithm is proved to possess not only global convergence, but also strong and superlinear convergence. At the end of the paper, some preliminary numerical experiments are reported.
On the influence of the variable ordering for algorithmic learning using OBDDs
Authors: Matthias Krause, Petr Savický, Ingo Wegener
Venue: Information and Computation (2005)

OBDDs with a fixed variable ordering are used successfully as data structure in experiments with learning heuristics based on examples. In this paper, it is shown that, for some functions, it is necessary to develop an algorithm to learn also a good OBDD variable ordering. There are functions with the following properties. They have OBDDs of linear size for optimal variable orderings. But for all but a small fraction of all variable orderings one needs large size to represent a list of randomly chosen examples. These properties are shown for simple functions like the multiplexer and the inner product.
Air-bridge interconnection and bondpad process for non-planar compound semiconductor devices
Authors: Gwenn Ulliac, Sophie Garidel, Jean-Pierre Vilcot, Pascal Tilmant
Venue: Microelectronic Engineering (2005)

We present a versatile metallic air-bridge process that can be used either for high relief compound semiconductor devices or interconnections schemes. Our technology uses conventional contact photolithography and does not require dry-etching techniques allowing a fast fabrication time, reliable production and cost effectiveness. It is based on the use of only one photoresist and one electroplating step.
Ubiquitous-Learning System for the Japanese Polite Expressions
Authors: Chengjiu Yin, Hiroaki Ogata, Yoneo Yano
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

In recent years, with the popular use of the cell phone and mobile terminals such as smart PDA (personal digital assistant) which can communicate in mobile terminal wirelessly, and also with the growing of home internet appliances and the commodity of RFID tags, it will be possible to realize the intelligence exchange with surrounding matters. Under this situation, the information from Internet is being transported easily; moreover, the realization of cordless navigating GPS based on satellites may use RFID tags and GPS to locate. To support the foreigners to learn Japanese polite expressions, we had implemented a PDA-based language learning supporting system of Japanese polite expressions learning, named Japanese polite expressions learning assisting system (JAPELAS) [14]. Base on the JAPELAS, we will develop a new system named Ubiquitous-Learning System for the Japanese Polite Expressions (ULSJPE), which study on solving the problem about how to use system effectively.
A mortar mimetic finite difference method on non-matching grids
Authors: Markus Berndt, Konstantin Lipnikov, Mikhail Shashkov, Mary F. Wheeler, Ivan Yotov
Venue: Numerische Mathematik (2005)

We consider mimetic finite difference approximations to second order elliptic problems on non-matching multiblock grids. Mortar finite elements are employed on the non-matching interfaces to impose weak flux continuity. Optimal convergence and, in certain cases, superconvergence is established for both the scalar variable and its flux. The theory is confirmed by computational results.
An Approach to Formally Modeling the Component-based E-commerce System
Authors: Xianli Jin, Huadong Ma
Venue: Proceedings of the IEEE International Workshop (2005)

Component-based development technique is often used to develop various complex software systems, especially in e-commerce system, due to its flexibility and efficiency. But such a system must provide a mechanism with which developers can easily manipulate the underlying structures to meet the application requirements, in particular in the real time and safety properties. This paper proposes a new method for formally modeling the component-based ecommerce system using hierarchical timed automata, which use hierarchical structures to organize the design schemes in different levels of an e-commerce system. In addition, we analyze the modeling process of a micro-payment system as a case. Compared with previous works, our approach can formally model the e-commerce system in a hierarchical and uniform framework.
ITC is Cool
Authors: Robert C. Aitken
Venue: IEEE Design Test (2005)

ITC is cool. How can this be, you ask? This is the International Test Conference's 36th year, which makes it a middle-aged conference; and, as anyone who has ever been middle-aged knows, being cool at this time of life is a serious challenge. ITC doesn't try to be cool, at least not in the way that, say, Macworld does. ITC tries instead to be interesting, innovative, and informative. All three of these qualities are vital for a successful conference.
Improving memory hierarchy performance by store-load renaming and locality-guided parallelization
Authors: Lu Peng
Venue:  (2005)

Memory hierarchy performance has been a dominant factor for processors' performance. The problem has been exacerbating because of the increasing performance gap between processors and memory hierarchy. Data communications among producer and consumer instructions in a program can go through fast speed registers with minimum delay. However, the number of registers is usually limited to save all intermediate data. In the case of not enough registers, a program writes the data into memory hierarchy and reads the data out whenever it is ready. The data communications through memory hierarchy incur extra delays that further degrade processor performance. Our observation is that we can represent these data communications in instruction syntax correlation format instead of memory address. Specifically, store-load and load-load syntax correlations can be represented in the form of base register ID plus the displacement value. Using this decoding information and taking advantage of spatial locality among memory references, we proposed a new memory layer, signature buffer, with novel addressing memory mechanism to avoid long delay of address calculation and cache memory accessing. Performance evaluations based on an Alpha 21264-like pipeline using SPEC2000 benchmarks show that an IPC (Instruction-Per-Cycle) improvement of 12&ndash;17% is possible using a small 8-entry signature buffer. The memory behavior of programs is complicated when they run on processors with multithreads sharing one cache. First, the memory reference sequence among multiple threads can be either constructive or disruptive. The memory behavior is constructive when multiple threads share the data that were brought into the shared cache by one or another. In other words, memory reference locality exhibited in the original single thread may be transformed and/or further enhanced among multiple threads. The memory behavior is disruptive when multiple threads have rather distinctive working sets and compete with the limited memory hierarchy resources. Second, the memory usage or footprint may increase among multiple threads based on the fact that certain data structures or local variables may be replicated to improve parallelism. The increase of memory footprint alters the reference behavior and demands larger caches to hold the working set. In this dissertation, we demonstrate a methodology for memory behavior analysis for emerging multimedia, artificial intelligence and database applications running on multithreaded processors and show their memory behavior results.
Mining Software Repositories for Model-Driven Development
Authors: Yuefeng Zhang, Dhaval Sheth
Venue: IEEE Software (2006)

Software developers traditionally use data repositories for record keeping. A statistical process control method for mining software repositories with uncertainty in a model-driven development environment creates a new, active use for these repositoriespredicting and planning various aspects of model-driven development projects.
Design and Evaluation of a Parallel Edge Server Invocation Protocol for Transactional Applications over the Web
Authors: Paolo Romano, Francesco Quaglia, Bruno Ciciani
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

Parallel invocation of edge servers within a Web infrastructure has been shown to provide benefits, in terms of system responsiveness, for both content delivery applications and non-transactional Web services. This is achieved thanks to the exploitation of path-diversity proper of multi-hop networks over the Internet, which typically reduces the likelihood of client perceived link congestion. In this work we address parallel invocation of geographically spread edge servers in the context of transactional Web-based applications. Actually, parallel invocation protocols are not trivial for this type of applications, since we need to deal with a set of issues not present in classical content delivery applications, such as (i) non-idempotent business logic and (ii) increase of the workload on the data centers. In this paper we propose a simple and lightweight parallel invocation protocol for distributed transactions over the Web, which addresses all those issues in a scalable manner by requiring no form of coordination among (geographically spread) edge servers. The results of a simulation study are also reported to show the advantages from our protocol in terms of user-perceived system responsiveness.
Optimal Online Algorithms for Multidimensional Packing Problems
Authors: Leah Epstein, Rob van Stee
Venue: SIAM Journal on Computing (2005)

We solve an open problem in the literature by providing an online algorithm for multidimensional bin packing that uses only bounded space. To achieve this, we introduce a new technique for classifying the items to be packed. We show that our algorithm is optimal among bounded space algorithms for any dimension $d>1$. Its asymptotic performance ratio is $(\Pi_{\infty})^d$, where $\Pi_{\infty}\approx1.691$ is the asymptotic performance ratio of the one-dimensional algorithm \harm. A modified version of this algorithm for the case where all items are hypercubes is also shown to be optimal. Its asymptotic performance ratio is sublinear in $d$.Furthermore, we extend the techniques used in these algorithms to give optimal algorithms for online bounded space variable-sized packing and resource augmented packing.
Prototypes and Paratypes: Designing Mobile and Ubiquitous Computing Applications
Authors: Gregory D. Abowd, Gillian R. Hayes, Giovanni Iachello, Julie A. Kientz, Shwetak N. Patel, Molly M. Stevens, Khai N. Truong
Venue: IEEE Pervasive Computing (2005)

User-centered design has long made use of physical, contextual, and functional prototyping techniques. Combining these techniques to generate compound prototypes and situated experience prototypes, or "paratypes," can be particularly useful for mobile and ubiquitous computing applications prior to full-scale development and deployment efforts.This article is part of a special issue on rapid prototyping.
Reliable and Efficient Communication Model of Migrating Instance to Enable Self-organization of Dynamic Alliance
Authors: Zhaoxia Lu, Guangzhou Zeng, Gongping Yang
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Migrating workflow is an effective resolution to solve the problems of incomplete specification of business process and frequent changes of environment in workflow management community. Communication mechanism between different instances is one of the most important components to enable effective negotiation and cooperation in an autonomous alliance. However, existing communication schemes are not suitable for the dynamic and prompt selforganization of migrating instance alliance. In this paper, a reliable asynchronous communication model based on existing forwarding proxy and mailbox methods is provided to deal with such problems. The model captures the primary features on configuration and task execution of migrating workflow and balances between reliability and performance of the system. A series of algorithms are also presented to support reliable and asynchronous communication, efficient location tracking and timely proxy update. Moreover, original simulations show that the model can ensure reliable inter-instances communication, and keep overheads at reasonably low.
New d-separation identification results for learning continuous latent variable models
Authors: Ricardo Silva, Richard Scheines
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Learning the structure of graphical models is an important task, but one of considerable difficulty when latent variables are involved. Because conditional independences using hidden variables cannot be directly observed, one has to rely on alternative methods to identify the d-separations that define the graphical structure. This paper describes new distribution-free techniques for identifying d-separations in continuous latent variable models when non-linear dependencies are allowed among hidden variables.