ppxscal/embedding_network huggingface dataset:
Design and analysis of a replicated server architecture for supporting IP-Host mobility
Authors: Jason P. Jue, Dipak Ghosal
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1998)

Mobility support in IP networks requires servers to forward packets to mobile hosts and to maintain information pertaining to a mobile host's location in the network. In the mobile Internet Protocol (mobile-IP), location and packet forwarding functions are provided by servers referred to as home agents. These home agents may become the bottleneck when there are a large number of mobile hosts in the network. In this paper, we consider the design and analysis of a replicated server architecture in which multiple home agents are used to provide mobility support. In order to minimize the delay across the home agents, one of the key aspects is the design of load balancing schemes in which a home agent may transfer the control of a mobile host to another home agent in the same network. The methods for triggering the transfer and the policy for selecting the next home agent define various load balancing schemes which have different performance characteristics. In this paper, we design a protocol that forms the building block for implementing such load balancing schemes, and we then study the performance characteristics of random, round-robin, and join the shortest queue (JSQ) selection policies, and timer-, counter- and threshold-based transfer policies.
Towards Quantization Index Modulation Strategies on Content-Based Watermarking Schemes
Authors: P. Martins, P. Carvalho
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

A content-based watermarking strategy relying on an affine invariant embedding domain obtained from affine in- variant interest points and a watermark insertion via quan- tization index modulation is analyzed, namely the effects on the performance of the whole watermarking scheme carried out by the presence or absence of interpolation operations during the design of the invariant domain.
Issues and Tactics when Adopting Pair Programming: A Longitudinal Case Study
Authors: Jari Vanhanen, Casper Lassenius, Mika V. Mantyla
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

We present experiences from a two-year study of adopting pair programming (PP) in a Finnish software product company. When adopting PP, the company used five tactics: the creation of simple PP guidelines, the use of a PP champion, making the use of PP voluntary, creating a positive atmosphere for PP, and instituting a separate PP room. By the end of the study the feelings of PP considerably surpassed developers' preconceptions of PP, and even the feelings of solo programming. Issues identified in the infrastructure for PP were solved through the adoption of the PP room. In the end of the study, a majority of the developers thought that PP should be utilized more than the reached ca. 10% of development effort. Unresolved issues in resourcing PP probably hindered reaching the desired level for the use of PP.
Wildcard Search in Structured Peer-to-Peer Networks
Authors: Yuh-Jzer Joung, Li-Wei Yang
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

We address wildcard search in structured peer-to-peer (P2P) networks, which, to our knowledge, has not yet been explored in the literature. We begin by presenting an approach based on some well-known techniques in information retrieval (IR), and discuss why it is not appropriate in a distributed environment. We then present a simple and novel technique to index objects for wildcard search in a fully decentralized manner, along with some search strategies to retrieve objects. Our index scheme, as opposed to a traditional IR approach, can achieve quite balanced loads, avoid hop-spots and single point of failure, reduce storage and maintenance costs, and offer some ranking mechanisms for matching objects. We use the CD records collected in FreeDB (http://freedb.org) as experimental dataset to evaluate our scheme. The results confirm that our index scheme is very effective in balancing the load. Moreover, search efficiency depends on the information given in a query: the more the information, the higher the performance.
Automatic Modeling of Complex Functions with Clonal Selection-Based Gene Expression Programming
Authors: Zhaohui Gan, Zhenkun Yang, Gaobin Li, Min Jiang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Gene Expression Programming (GEP) is a powerful evolutionary algorithm derived from Genetic Algorithm and Genetic Programming for system modeling and knowledge discovery. However, when dealing with complex problems, GEP shows quite slow convergence speed, it also probably encounters premature convergence. This paper proposed a Clonal Selection-based Gene Expression Programming (CS-GEP), which combines the advantages of Clonal Selection Algorithm (CSA) and GEP, overcoming some drawbacks of GEP. CS-GEP is applied into function modeling experiments, the results show that CS-GEP has faster convergence speed and higher modeling precision than that of GEP.
A local boosting algorithm for solving classification problems
Authors: Chun-Xia Zhang, Jiang-She Zhang
Venue: Computational Statistics Data Analysis (2008)

Based on the boosting-by-resampling version of Adaboost, a local boosting algorithm for dealing with classification tasks is proposed in this paper. Its main idea is that in each iteration, a local error is calculated for every training instance and a function of this local error is utilized to update the probability that the instance is selected to be part of next classifier's training set. When classifying a novel instance, the similarity information between it and each training instance is taken into account. Meanwhile, a parameter is introduced into the process of updating the probabilities assigned to training instances so that the algorithm can be more accurate than Adaboost. The experimental results on synthetic and several benchmark real-world data sets available from the UCI repository show that the proposed method improves the prediction accuracy and the robustness to classification noise of Adaboost. Furthermore, the diversity-accuracy patterns of the ensemble classifiers are investigated by kappa-error diagrams.
An Experimental Study on Fast Handovers for Mobile IPv6
Authors: Hancheng Lu, Xiaolei Tie, Peilin Hong
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

The handover procedures in Mobile IPv6 (MIPv6) often affect the quality of particular services such as delay-sensitive applications and loss-sensitive applications. Fast Handovers for MIPv6 (FMIPv6) protocol, where operation can be classified into the predictive mode and the reactive mode, is proposed to alleviate the unacceptable effect. In this paper, we implement FMIPv6 in a real test-bed environment and study its performance in terms of handover latency and packet loss. Especially, effects of the anticipation time are carefully considered. Predictive fast handover generally outperforms reactive fast handover, but it requires a sufficient anticipation time to complete necessary operations before the current network is broken. In our test-bed, cross-layer interactions between the link layer and the network layer are introduced to achieve successful predictive fast handover with an optimal anticipation time. We also tackle the implementation of link layer triggers which are critical to the performance of fast handovers.
Quickmig: automatic schema matching for data migration projects
Authors: Christian Drumm, Matthias Schmitt, Hong-Hai Do, Erhard Rahm
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

A common task in many database applications is the migration of legacy data from multiple sources into a new one. This requires identifying semantically related elements of the source and target systems and the creation of mapping expressions to transform instances of those elements from the source format to the target format. Currently, data migration is typically done manually, a tedious and timeconsuming process, which is difficult to scale to a high number of data sources. In this paper, we describe QuickMig, a new semi-automatic approach to determining semantic correspondences between schema elements for data migration applications. QuickMig advances the state of the art with a set of new techniques exploiting sample instances, domain ontologies, and reuse of existing mappings to detect not only element correspondences but also their mapping expressions. QuickMig further includes new mechanisms to effectively incorporate domain knowledge of users into the matching process. The results from a comprehensive evaluation using real-world schemas and data indicate the high quality and practicability of the overall approach.
A Replication and Cache based Distributed Metadata Management System for Data Grid
Authors: Ke Shi
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Metadata management is a key technique of data grid. This paper presents a replication and cache based metadata management system (RCMMS) to improve metadata management of Global Distributed Storage System (GDSS). Storage Service Provider (SSP) of GDSS has dedicated buffer to cache metadata. The design, implementation and evaluation of RCMMS are discussed in this paper. RCMMS provides efficient algorithms to manage highly dynamic metadata replicas. The evaluation demonstrates that replica plus cache metadata management system outperforms existing metadata management system of GDSS.
Mining the data from a hyperheuristic approach using associative classification
Authors: Fadi Thabtah, Peter Cowling
Venue: Expert Systems with Applications: An International Journal (2008)

Associative classification is a promising classification approach that utilises association rule mining to construct accurate classification models. In this paper, we investigate the potential of associative classifiers as well as other traditional classifiers such as decision trees and rule inducers in solutions (data sets) produced by a general-purpose optimisation heuristic called the hyperheuristic for a personnel scheduling problem. The hyperheuristic requires us to decide which of several simpler search neighbourhoods to apply at each step while constructing a solutions. After experimenting 16 different solution generated by a hyperheuristic called Peckish using different classification approaches, the results indicated that associative classification approach is the most applicable approach to such kind of problems with reference to accuracy. Particularly, associative classification algorithms such as CBA, MCAR and MMAC were able to predict the selection of low-level heuristics from the data sets more accurately than C4.5, RIPPER and PART algorithms, respectively.
From entry to access: how shareability comes about
Authors: Eva Hornecker, Paul Marshall, Yvonne Rogers
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

Shareability is a design principle that refers to how a system, interface, or device engages a group of collocated, co-present users in shared interactions around the same content (or the same object). This is broken down in terms of a set of components that facilitate or constrain the way an interface (or product) is made shareable. Central are the notions of access points and entry points. Entry points invite and entice people into engagement, providing an advance overview, minimal barriers, and a honeypot effect that draws observers into the activity. Access points enable users to join a group's activity, allowing perceptual and manipulative access and fluidity of sharing. We show how these terms can be useful for informing analysis and empirical research.
Design of Rough Fuzzy-PI Control to the Rectifier
Authors: Yue-dou Qi
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

In this paper, we study the application of fuzzy set theory, genetic algorithms and rough set theory techniques to the control of the rectifier. A fuzzy adaptive control scheme with the aid of rough set theory via genetic algorithms (GAs) finding the center parameters in place of the classical control is proposed. On the one hand, genetic algorithm gets optimal parameters of an accurate domain model, which tunes the scaling factors of fuzzy adaptive control but is hardly established in a non-liner system. On the other hand, fuzzy adaptive control deals with the dynamics and complexity of responses from rectifier of a HVDC system in the operation points, by adjusting its control parameters with the aid of rough tuner adaptively. Our study includes a
Distributed subchannel and rate assignment for multi-carrier multi-cell networks
Authors: Jui Teng Wang
Venue: Wireless Personal Communications: An International Journal (2007)

A distributed subchannel and rate assignment (DSRA) algorithm, which integrates the subchannel allocation and the rate assignment to minimize the number of subchannels needed for meeting the rate requirements, is proposed for the multi-carrier multi-cell networks. The DSRA algorithm need not measure the channel gains and executes the distributed power control to allocate the subchannel and transmission rate. One can decrease the number of subchannels used in the DSRA algorithm by increasing the number of iterations.
Resilient Extended True-Copy Token Scheme for a Distributed Database System
Authors: T. Minoura
Venue: IEEE Transactions on Software Engineering (1982)

A new resiliency scheme for a distributed database system with replicated data is presented. One salient feature of the scheme is that it does not employ a log subsystem; hence, it can be used for a highly reliable system that must tolerate a total crash of a site. In addition, the scheme supports system partitioning without any consistency problem. The new scheme is based on a precise treatment of logical data; in particular, a precise definition of resilient system operation is given in terms of logical data.
Uncertain Linguistic Hybrid Geometric Mean Operator
Authors: Gui-Wu Wei, Wen-De Yi
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

With respect to multiple attribute group decision making problem with uncertain linguistic information, in which the attribute weights and expert weights take the form of real numbers, and the attribute preference values take the form of uncertain linguistic variables, an uncertain linguistic aggregation operator called uncertain linguistic hybrid geometric mean (ULHGM) operator is proposed. An approach to multiple attribute group decision making (MAGDM) with uncertain linguistic information is developed based on the ULWGM and the ULHGM operators. Finally, an illustrative example is given to verify the developed approach and to demonstrate its practicality and effectiveness.
Workshop Report: Software Testing and Test Documentation
Authors: E. Miller
Venue: Computer (1979)

The workshop's general and session chairmen offer their summaries of the challenges to the software testing communityidentified at the December meeting.
Visual Symphonies: Setting Intricate Images to Music
Authors: Frances Titsworth
Venue: IEEE Computer Graphics and Applications (2007)

Although he began his career as a composer of modern concert music, Dennis Miller became interested in using electronic music as a medium and eventually extended his art into a mixed medium of sound and image. This article describes Miller's work and process.
Letters: Further result on asymptotic stability criterion of neural networks with time-varying delays
Authors: Tao Li, Lei Guo, Changyin Sun
Venue: Neurocomputing (2007)

In this paper, the global asymptotic stability problem is dealt with for a class of neural networks (NNs) with time-varying delays. The activation functions are assumed to be neither monotonic, nor differentiable, nor bounded. By constructing an augmented Lyapunov functional which contains an integral term of neuron state vector, an improved delay-dependent stability criterion for delay NNs is established in terms of linear matrix inequalities (LMIs). It is shown that the obtained criterion can provide less conservative results than some existing ones. Numerical examples are given to demonstrate the applicability of the proposed approach.
A circuit framework for robust manifold learning
Authors: Jens Nilsson, Fredrik Andersson
Venue: Neurocomputing (2007)

Manifold learning and nonlinear dimensionality reduction addresses the problem of detecting possibly nonlinear structure in high-dimensional data and constructing lower-dimensional configurations representative of this structure. A popular example is the Isomap algorithm which uses local information to approximate geodesic distances and adopts multidimensional scaling to produce lower-dimensional representations. Isomap is accurate on a global scale in contrast to many competing methods which approximate locally. However, a drawback of the Isomap algorithm is that it is topologically instable, that is, incorrectly chosen algorithm parameters or perturbations of data may drastically change the resulting configurations. We propose new methods for more robust approximation of the geodesic distances using a viewpoint of electric circuits. In this way, we achieve both the stability of local methods and the global approximation property of global methods, while compromising with local accuracy. This is demonstrated by a study of the performance of the proposed and competing methods on different data sets.
Seamless handover support over heterogeneous networks using FMIPv6 with definitive L2 triggers
Authors: Yong-Sung Kim, Dong-Hee Kwon, Young-Joo Suh
Venue: Wireless Personal Communications: An International Journal (2007)

Various wireless communication systems have been developed and will be integrated into an IP-based network to offer end users the Internet access anytime and anywhere. In heterogeneous multi-access networks, one of main issues is to manage nodes' mobility with session continuity and minimal handover latency. In order to support the mobility of mobile nodes, MIPv6 has been proposed by IETF. Even though MIPv6 provides a solution to handling nodes' mobility in IPv6 networks, there is a significant problem due to its inability to support a seamless handover caused by long latency and high packet losses during a handover. FMIPv6 has been proposed to reduce MIPv6 handover latency by using an address pre- configuration method with the aid of L2 triggers. Current research defines a general L2 trigger model for seamless handover operation, but it does not address the exact timing and definitive criteria of L2 triggers which causes a significant effect on the handover performance of FMIPv6. This paper considers the available timing and accurate criteria of L2 triggers. With the definitive L2 triggers, we present a practical handover scenario to integrate L2 and L3 layers for low handover latency and low number of packet losses during a handover. We also study the impact of definitive L2 triggers on the handover performance of the FMIPv6 protocol in real testbeds and prove that the FMIPv6 protocol performs its handover operation prior to the L2 handover and obtains a seamless handover.
Scatter Search for Constrained Layout Optimization Problem
Authors: Yi-shou Wang, Yan-jun Shi, Hong-fei Teng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

We explore the meta-heuristic approach called scatter search for the constrained layout optimization. The scatter search framework is flexible and allows the development of alternative implementations for different problems. We empirically study the coordinate transformation-based diversification method and the reference set update method on the basis of two dissimilarities. We present two approaches using a scatter search framework. One only uses the gradient descent algorithm as the improvement method, so-called basic scatter search. The other, so- called hybrid scatter search, adopts gradient descent and Nelder Mead simplex algorithm to improve the trial solution generated at two different stages. We attempt to determine the efficiency and efficacy of two variants of scatter search. Case studies show that the experimental results are either superior or comparable to the best known published results. The results also show that the hybrid scatter search is better than the basic scatter search for the constrained layout optimization problems.
An ITIL-based IT Service Management Model for Chinese Universities
Authors: Wang Zhen, Zhang Xin-yu
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Considering the exigency of establishing an IT service management model that accords with the characteristics of universities, this paper has developed the organization model, the process model and the technology model of campus IT service management based on the ITIL theory and the realities of Chinese universities.
Your destiny: dynamic interactive installation for digital Gesamtkunstwerk: (total work of art)
Authors: Jieun Kwon, Yuncheol Baek
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

The emergence of digital Gesamtkunstwerk as a movement has been precipitated by an interactive installation. The goal of this paper is to research technology and to implement real-time interactive media with applied our project "Your Destiny." In this paper we will discuss the possibilities and advantages of using the background subtraction algorithm to create a dynamic interactive installation and points of issue that there are limitations and considerations to create a digital total work of art.
Impact of data sources on citation counts and rankings of LIS faculty: Web of science versus scopus and google scholar
Authors: Lokman I. Meho, Kiduk Yang
Venue: Journal of the American Society for Information Science and Technology (2007)

The Institute for Scientific Information's (ISI, now Thomson Scientific, Philadelphia, PA) citation databases have been used for decades as a starting point and often as the only tools for locating citations and&sol;or conducting citation analyses. The ISI databases (or Web of Science [WoS]), however, may no longer be sufficient because new databases and tools that allow citation searching are now available. Using citations to the work of 25 library and information science (LIS) faculty members as a case study, the authors examine the effects of using Scopus and Google Scholar (GS) on the citation counts and rankings of scholars as measured by WoS. Overall, more than 10,000 citing and purportedly citing documents were examined. Results show that Scopus significantly alters the relative ranking of those scholars that appear in the middle of the rankings and that GS stands out in its coverage of conference proceedings as well as international, non-English language journals. The use of Scopus and GS, in addition to WoS, helps reveal a more accurate and comprehensive picture of the scholarly impact of authors. The WoS data took about 100 hours of collecting and processing time, Scopus consumed 200 hours, and GS a grueling 3,000 hours. &copy; 2007 Wiley Periodicals, Inc.