ppxscal/embedding_network huggingface dataset:
The use of virtual interface for inter-technology handoffs and multihoming in proxy mobile IPv6
Authors: Ryuji Wakikawa, Sawako Kiriyama, Sri Gundavelli
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Proxy Mobile IPv6 has been standardized by the IETF recently. It is a network-based mobility management protocol based on Mobile IPv6. There is significant interest from various standards bodies for its adoption in 4G networks as the key mobility management protocol. It is being seen as the protocol for achieving a common mobile core network, accommodating various access technologies such as Wi-MAX, 3GPP and 3GPP2 radio networks. One of the key aspects of the protocol is the support for inter-technology handoffs. The Proxy Mobile IPv6 network allows the mobile node to perform handoff between different access technologies and the network will ensure the terminal obtains the same address configuration as before. However there is no study on the required software function on the host for performing inter-technology handoffs and with the goal of session survivability across handoffs. This paper analyses from the mobile node &middot;s&middot; perspective on the potential approaches for achieving this and without requiring any changes to the host. It explores the use of Virtual Interface support available in Linux as one of the approaches and demonstrates that it is a simple host configuration and does not require any host stack changes. It also provides the results from the handoff experiments.
Space-Mediated Learning at the Locus of Action in a Heterogeneous Team of Mobile Workers
Authors: Daniel Chamberland-Tremblay, Sylvain Giroux, Claude Caron, Michel Berthiaume
Venue: Proceedings of the 2009 International Conference on Mobile, Hybrid, and On-line Learning (2009)

To perform, heterogeneous teams must build a common knowledge base that enables collaboration. This paper explores the opportunity to use shared physical space as the mediator par excellence for learning and information sharing among mobile workers of a heterogeneous team. This research focuses on indoor environments that condition the tasks to be performed. Building on the ideas of location-based services and smart spaces, the user is able to store information in the environment and retrieve it based on the immediate work context. We use an information push strategy to foster learning by non-experts at the onset of a task. Formal and informal collaboration tools are used to build the information base required by the system. The example of an extended team of caregivers working at the patient’s home is used to illustrate the learning process at the locus of action.
Research of the CAPTCHA application in platform based on AJAX
Authors: Dong Chen
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

Focusing on the tadditional test automation technique's lack in the AJAX Web application and based on the AJAX key techniques and asynchronous work mode, a special asynchronous test automation method for the AJAX Web application is analyzed and designed. The design of the structure frame of the center of the AJAX test automation technique and a pair of program defined functions access and wait are introduced in detail.
Factoring univariate polynomials over the rationals
Authors: Andy Novocin, Mark van Hoeij
Venue: ACM Communications in Computer Algebra (2009)

We present an algorithm for factoring a polynomial, f , in one variable with rational coefficients. Our algorithm is a variant of the Belabas [Belabas] version of the van Hoeij [van Hoeij] factoring algorithm. Our algorithm not only contains a practical speed-up over Belabas' but it also allows us to prove a new complexity result for factoring polynomials. The van Hoeij algorithm follows Zassenhaus' [Zass] approach by factoring f mod a prime number and Hensel Lifting the local factors. The practical speed-up in van Hoeij's algorithm comes from using the LLL [LLL] algorithm to solve the exponential recombination problem of decicing which combination of local factors form the true factors. However, the cost of LLL in van Hoeij's approach has been difficult to bound (in fact [van Hoeij] only proves termination and makes no attempt at finding a complexity). Belabas found a fine-tuning [Belabas] of van Hoeij's algorithm which nearly optimizes the practical running times, but still does not provide a good bound for the LLL costs. In [BHKS] both variants were shown to have polynomial complexity, but these bounds are still unsatisfactorily large and do little to illuminate the behavior of these algorithms. Our algorithm improves Belabas' approach in the following ways: We make a practical improvement which ensures that Hensel Lifting is always minimized. We include a decision making process which allows us to bound the total number of LLL switches in the algorithm by O(r3), where r is the number of local factors. This is independent of both degree and coefficient size of f.. In this poster we present an overview of the new algorithm and give a brief look at the style of our proofs. For the full details of the switch bound O(r3) see [Novocin]. Using the Floating-Point LLL [L2] and some minor changes we can show the LLL costs are O(r7). We are still writing down the details of a proof that the new total complexity of our algorithm is O(r7).
Bluetooth Enabled Mobile Phone Remote Control for PC
Authors: Mohammed A. Qadeer, Rahul Agrawal, Amit Singhal, Sarosh Umar
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

This work confers an application which makes possible to use a Bluetooth enabled mobile phone to remote control home appliances such electric fan, LEDs and stepper motor, connected to the personal computer. It can also be used to control other computer applications such as multimedia players and facilitates the user while giving presentation on slides. It is a client – server based application which makes use of powerful java technology to achieve its end. The program works on a variety of Bluetooth enabled mobile phone and is compatible with majority of Bluetooth stacks.
Using a Global Parameter for Gaussian Affinity Matrices in Spectral Clustering
Authors: Sandrine Mouysset, Joseph Noailles, Daniel Ruiz
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

Clustering aims to partition a data set by bringing together similar elements in subsets. Spectral clustering consists in selecting dominant eigenvectors of a matrix called affinity matrix in order to define a low-dimensional data space in which data points are easy to cluster. The key is to design a good affinity matrix. If we consider the usual Gaussian affinity matrix, it depends on a scaling parameter which is difficult to select. Our goal is to grasp the influence of this parameter and to propose an expression with a reasonable computational cost.
Multi-Relational Classification in Imbalanced Domains
Authors: Guangmei Xu, Hong Bao, Xianyu Meng
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

This paper discusses the problem of multi-relational classification on imbalanced datasets. To solve the class imbalance problem, a new multi-relational Naive Bayesian classifier named R-NB is proposed, the attribute filter criterion based on mutual information is upgraded to deal with multi-relational data directly and the basic sampling methods include under-sampling and over-sampling are adopted to eliminate or minimize rarity by altering the distribution of relational examples. Experiments show, with the help of attribute filter method, R-NB can get better results than those without that. And, experiments show that multi-relational classifiers with under-sampling methods can provide more accurate results than that with over-sampling methods considering the ROC curve.
Virtual View Synthesis from Uncalibrated Stereo Cameras
Authors: M. A. Akhloufi, V. Polotski, P. Cohen
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper presents a new approach to the synthesis of a novel view from two images captured by a non-calibrated stereo system. Here view synthesis employs epipolar constraints associated with a two cameras configuration. A fundamental matrix is used to obtain features in the synthesized view via reprojection of corresponding features in the source images. Unlike classical methods which are based on inferring three dimensional structure of the scene or use dense correspondence between the source images to produce the new synthesized image, this method requires only sparse correspondence between source image features. Perspective image warping techniques then render the remaining image points via interpolation. The approach permits interactive view synthesis in: immersive telepresence systems, realistic virtual worlds and overlay of objects at different positions on live video of dynamic scenes for augmented reality display systems. Method efficiency is illustrated with examples of synthetic and real scenes.
Isolating the polynomial roots with all zeros real
Authors: Muresan Alexe Calin
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

It is known that, if all the roots of a polynomial are real, they can be localizing, using a set of intervals, which contain the arithmetic average of the roots. The aim of this paper is to give an original method for evaluating and improving the 'polynomial minimum root separation' results, for the polynomials having all real roots. We use Hadamard inequality and new original inequalities. Also we make some considerations about the cost for isolate the polynomial roots. Our method is based on the construction of new intervals containing only one root of the polynomial.
A Second Order Central Scheme for Hamilton-Jacobi Equations on Triangular Grids
Authors: Peter Popov, Bojan Popov
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

In this paper, we describe a Godunov-type fully discrete scheme for Hamilton-Jacobi equations on triangular meshes. This scheme is an extension of the Lin-Tadmor and Kurganov-Tadmor fully discrete nonoscillatory central schemes to unstructured triangular meshes. In this new construction, we propose a new, "genuinely multidimensional", nonoscillatory reconstruction. The construction is simple, universal and deviates from the existing high-order extensions of the central and central-upwind schemes for Hamilton-Jacobi equations.
Service broker function in IMS architecture issues and considerations
Authors: Hui-Na Chua, Chor-Min Tan
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Though IMS is aimed to provide an open architecture environment for rapid service creation, it does not necessarily solve all the problems of service interactions and service provisioning. Service Brokering function as currently being studied by the 3GPP [1], is aimed to manage service capabilities interaction between any type of IMS application servers. However, the Service Broker definition in standards does not specify precisely the mechanism of how it achieves the service interaction management. Due to the definition is still not concrete, the Service Broker function is currently implemented in a proprietary manner. In this paper, we examine the evolution of Service Broker functionality proposed in standards and evaluate the existing Service Broker approaches that are proprietarily implemented. From architectural and interaction management aspects, we discuss the issues and considerations of Service Broker function.
Trading Off Cache Capacity for Low-Voltage Operation
Authors: Chris Wilkerson, Hongliang Gao, Alaa R. Alameldeen, Zeshan Chishti, Muhammad Khellah, Shih-Lien Lu
Venue: IEEE Micro (2009)

Two proposed techniques let microprocessors operate at low voltages despite high memory-cell failure rates. They identify and disable defective portions of the cache at two granularities: individual words or pairs of bits. Both techniques use the entire cache during high-voltage operation while sacrificing cache capacity during low-voltage operation to reduce the minimum voltage below 500 mV.
Heuristic Algorithm for Optimization of P2P-Based Public-Resource Computing Systems
Authors: Grzegorz Chmaj, Krzysztof Walkowiak
Venue: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology (2008)

In recent years network computing systems have been becoming important due to the increasing need for data processing and exchange. In this paper we focus on a public-resource computing system that uses Peer-to-Peer approach for data distribution. We assume that the considered system works on the top of an overlay network. We formulate an Integer Program optimization model of the system. Next an effective heuristic algorithm is developed to solve that model. Results of numerical experiments showing comparison of the heuristic against solutions provided by CPLEX solver are presented.
Phylogeny Inference Using a Multi-objective Evolutionary Algorithm with Indirect Representation
Authors: Md. Rafiul Hassan, M. Maruf Hossain, C. K. Karmakar, Michael Kirley
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

The inference of phylogenetic trees is one of the most important tasks in computational biology. In this paper, we propose an extension to multi-objective evolutionary algorithms to address this problem. Here, we adopt an enhanced indirect encoding for a tree using the corresponding Prüfer code represented in Newick format. The algorithm generates a range of non-dominated trees given alternative fitness measures such as statistical likelihood and maximum parsimony. A key feature of this approach is the preservation of the evolutionary hierarchy between species. Preliminary experimental results indicate that our model is capable of generating a set of optimized phylogenetic trees for given species data and the results are comparable with other techniques.
Non uniform noisy data training using wavelet neural network based on sampling theory
Authors: Ehsan Hossaini Asl, Mehdi Shahbazian, Karim Salahshoor
Venue: WSEAS TRANSACTIONS on SYSTEMS (2008)

Global convergence and overfitting are the main problem in neural network training. One of the new methods to overcome these problems is sampling theory that is applied in training of wavelet neural network. In this paper this new method is improved for training of wavelet neural network in non uniform and noisy data. The improvements include suggesting a method for finding the appropriate feedback matrix, addition of early stopping and wavelet thresholding to training procedure. Two experiments are conducted for one and two dimensional function. The results establish a satisfied performance of this algorithm in reduction of generalization error, reduction the complexity of wavelet neural network and mainly avoiding overfitting.
r-Learning services for elementary school students with a teaching assistant robot
Authors: Jeonghye Han, Dongho Kim
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

The r-Learning paradigm with educational robots is emerging as a part of e-Learning, which means using technology for learning. This study on using robots as a teaching assistant robot opened the possibility of r-Learning for English in classroom. We found that children like robot services for personal relationship in class and teachers prefer them related to their convenience to manage the lesson. Related robot services such as praising and cheering up or calling the roll are the effective way for motivating children to learn, enhancing the relationship between TIRO and children. We are going on conducting further field trials for new scenarios and services that motivate children and make them concentrate on class with teachers, pre-teachers, children, parents, robotic researchers, social scientists, etc.
Path-RO: a novel on-chip critical path delay measurement under process variations
Authors: Xiaoxiao Wang, Mohammad Tehranipoor, Ramyanshu Datta
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

As technology scales to 45nm and below, process variations will present significant impact on path delay. This trend makes the deviation between simulated path delay and actual path delay in a manufactured chip more significant. In this paper, we propose a new on-chip path delay measurement structure called path-based ring oscillator (Path-RO). The proposed method creates an oscillator from a targeted path for which it is used to measure path delay on-chip under the impact of process variations. To alleviate accuracy degradation caused by the architecture itself, a high-accuracy calibration process is presented. Through experimental results on Path-ROs inserted in ITC'99 b19 benchmark, we obtain path delay distribution under different process variations. The accuracy and efficiency of path delay measurement using Path-RO are also verified by comparing the results obtained from post-layout Hspice simulations.
Technological integration: evidence of processes of structuring in governmental organizations
Authors: Vassilis Meneklis, Christos Douligeris
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

In this paper we study the reciprocal interaction between a specific technological construct of contemporary times, namely Information Systems (IS) for e-Government and the way human agents conceive of this construct and employ it in their daily conduct. We build our analysis around case studies concerning two European e-Government research and development projects and try to unravel the subtle threads that form this interaction. It is our position that technology affects our every-day experiences not more than it is shaped by them through recurrent processes of structuring. Finally, we draw on concepts and ideas from past attempts to conceptualize technological artifacts, from our personal experiences and from Structuration Theory to define the concept of "technological integration".
Towards a Tele-assistance Service for the Cognitive Stimulation of Elders with Cognitive Decline
Authors: Alberto L. Morán, Victoria Meza-Kubo
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

Thanks to advances in science and technology, the life expectancy of human beings has increased steadily at a constant rate. Unfortunately, this had made evident the increasing incidence of age-related diseases, such as Alzheimer's disease (AD). Although there is no cure for AD, the literature reports that people who frequently participates in cognitive stimulation activities reduces the risk of presenting it or improves their cognitive abilities. Aging-in-place and telemedicine make possible the provision of medical services to elder adults in their homes, in order to reduce hospitalization costs and to increase patient comfort in their home. Aiming at understanding the processes that occur in cognitive stimulation, and how they could be supported through technology, we present a characterization of the activities performed during a stimulation session of people suffering from AD. We also present a preliminary set of design insights that designers and developers of tele-assistance services could consider for the development of such systems.
Fault diagnosis of turbine based on fuzzy cross entropy of vague sets
Authors: Jun Ye
Venue: Expert Systems with Applications: An International Journal (2009)

The fuzzy cross entropy of vague sets, so-called vague cross entropy, is introduced by analogy with the cross entropy of probability distributions. And then a new method of the fault diagnosis is proposed on the basis of the vague cross entropy and is applied to the fault diagnosis of turbine. The vague cross entropy between a testing sample and the knowledge of system faults is evaluated in the fault diagnosis of the turbine vibration. If the cross-entropy value is small, the testing sample is near to a type of fault knowledge. Then, the type of vibration fault is determined according to the minimum cross-entropy value. The fault-diagnosis example of the turbine demonstrates that the proposed method cannot only diagnose the main fault types of the turbine, it can also detect useful information for future trends and multi-fault analysis.
Chirp tuning of a dual-wavelength fiber Bragg grating by using a loop thin-wall section beam
Authors: Guiling Huang, Lifang Xue, Qida Zhao, Yinping Miao, Meng Jiang, Zhiguo Meng
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

In this paper, for the first time to our knowledge, we proposed and demonstrated a novel method to introduce large chirp to a dualwavelength fiber Bragg grating (FBG) realized by gluing the grating to the outer surface of a loop thin-wall section beam (LSB). The bandwidth of the grating can be tuned through changing the force while the fiber grating locates at different special positions. when the positional angle &theta; = 45 and the LSB applied an approximately 6 kg mass, the dual-wavelength FBG was turn into a chirp grating with about 3nm bandwidth. The experimental results are coincident with the theoretical analyses.
Duplex fitting of zero-level and offset surfaces
Authors: Shengjun Liu, Charlie C. L. Wang
Venue: Computer-Aided Design (2009)

Offset surfaces play an important role in various CAD/CAM applications. Given a set of oriented points, we propose a hierarchical method in this paper to fit both the zero-level surface and its offset surface with a single implicit function. The implicit function is formed by compactly supported radial basis functions (CSRBFs). Different from other existing methods in literature, our approach reconstructs an implicit function which interpolates or approximates both the zero-level surface and the offset surface of a given point set, simultaneously. Employing locally supported functions leads to an efficient computational procedure, while the coarse-to-fine hierarchy makes our approach insensitive to the density of scattered data and allows us to reconstruct large parts of missing data. The performance of our method is demonstrated by a number of examples and the application of adaptive slicing hollowed models in rapid prototyping.
A Security Architecture for Tactical Mobile Ad Hoc Networks
Authors: Hengjun Wang, Yadi Wang, Jihong Han
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Mobile Ad hoc Network (MANET) is self-organizing, infrastructureless, multi-hop network. The wireless and distributed nature of MANETs and the very bad security environment in battlefield bring a great challenge to securing tactical mobile ad hoc networks. Most schemes proposed recently focus on specific security areas, such as establishing trust infrastructure, securing routing protocols, or intrusion detection and response. Few of the previous work proposes security solutions from a system architectural view. In this paper, we propose security architecture for tactical mobile ad hoc networks, which is layered as network model, trust model and security operations. Three main security technologies applied in this architecture and relationships among them are analyzed in detail.
An overview of the Texas reconfigurable array computer
Authors: Matthew C. Sejnowski, Edwin T. Upchurch, Rajan N. Kapur, Daniel P. S. Charlu, G. Jack Lipovski
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

This paper presents an overview of TRAC and then discusses the system's suitability for some promising applications: Monte Carlo techniques, numerical solutions to linear systems, and data base applications.