ppxscal/embedding_network huggingface dataset:
Load balancing in large-scale RFID systems
Authors: Qunfeng Dong, Ashutosh Shukla, Vivek Shrivastava, Dheeraj Agrawal, Suman Banerjee, Koushik Kar
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

A radio frequency identifier (RFID) system consists of inexpensive, uniquely-identifiable tags that are mounted on physical objects, and readers that track these tags (and hence these physical objects) through RF communication. For many performance measures in large-scale RFID systems, the set of tags to be monitored needs to be properly balanced among all readers. In this paper we, therefore, address this load balancing problem for readers - how should a given set of tags be assigned to readers such that the cost for monitoring tags across the different readers is balanced, while guaranteeing that each tag is monitored by at least one reader. We first present centralized solutions to two different variants of this load balancing problem: (i) min-max cost assignment (MCA), and (ii) min-max tag count assignment (MTA). We show that MCA, the generalized variant of the load balancing problem, is NP-hard and hence present a 2-approximation algorithm for it. We next present an optimal centralized solution for MTA, an important specialized variant of the problem. Subsequently, we present a localized distributed algorithm that is probabilistic in nature and closely matches the performance of the centralized algorithms. Finally we present detailed simulation results that illustrate the performance of the localized distributed approach, how it compares with the centralized optimal and near-optimal solutions, and how it adapts the solution with changes in tag distribution and reader topology. Our results demonstrate that our schemes achieve very good performance even in highly dynamic large-scale RFID systems.
Realizing business value of agile IT applications: antecedents in the supply chain networks
Authors: Pankaj Setia, Vallabh Sambamurthy, David J. Closs
Venue: Information Technology and Management (2008)

This research develops a framework for organizational value creation from agile IT applications. Based on the four themes in the business value research--business process perspective, complementarities, application level of analysis, and extent of use--three antecedents (organizational fit, process assimilation, and network adoption) are identified as pre-requisites for realizing the value of agile supply chain applications. Advanced planning and scheduling (APS) systems are used as examples, and two case studies for their implementation in the electronics and consumer goods industry are reported to support the propositions. The theories of diffusion of innovation, complementarities, network externalities, and technology structuration are applied to develop the propositions for fit, assimilation, and network effects. Information sharing and industry clockspeed are identified as the moderating factors in the proposed model. The framework has both managerial and research relevance. The research guides managers regarding ways to more fully realize the value of agile applications and forms a basis for future research on the business value of IT applications.
Gene selection using hybrid particle swarm optimization and genetic algorithm
Authors: Shutao Li, Xixian Wu, Mingkui Tan
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2008)

Selecting high discriminative genes from gene expression data has become an important research. Not only can this improve the performance of cancer classification, but it can also cut down the cost of medical diagnoses when a large number of noisy, redundant genes are filtered. In this paper, a hybrid Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) method is used for gene selection, and Support Vector Machine (SVM) is adopted as the classifier. The proposed approach is tested on three benchmark gene expression datasets: Leukemia, Colon and breast cancer data. Experimental results show that the proposed method can reduce the dimensionality of the dataset, and confirm the most informative gene subset and improve classification accuracy.
Web-based dynamic learning through lexical chaining: a step forward towards knowledge-driven education
Authors: Arash Shaban-Nejad, Volker Haarslev
Venue: Proceedings of the 13th annual conference on Innovation and technology in computer science education (2008)

In this paper we report on our experience using a linguistic technique, called lexical chaining, in assisting the dynamic hierarchical learning of sequentially accessible information for both human and software agents.
Fast Accurate Tests for Multi-Carrier Transceiver Specifications: EVM and Noise
Authors: Rajarajan Senguttuvan, Soumendu Bhattacharya, Abhijit Chatterjee
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

Production testing of digitally modulated transceivers such as those based on orthogonal frequency division multiplexing (OFDM) has become challenging, particularly in the context of measuring specifications such as error-vector-magnitude (EVM) which require the use of precision test equipment with digital modulation capability and low noise floor. Moreover, test time is an issue due to the need to transmit and receive a large number of data bits for accurate test measurement. In this paper, a multi-tone based test method is presented for accurately measuring the EVM and noise specifications of a wireless device. We present the theory behind the proposed approach along with simulation results. The proposed test method is low-cost, and has the potential to significantly reduce EVM test time under production test conditions.
A Middleware for Developing and Deploying Scalable Remote Mining Services
Authors: Leonid Glimcher, Gagan Agrawal
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

In this paper, we consider the problem of developing service-oriented implementations of data-intensive applications that process data on remote servers. While the existing grid and web-service frameworks allow interoperab ility and flexible resource utilization, achieving efficiency and scalability remains a critical challenge. Similarly,the existing grid and web-service frameworks do not provide transparency in accessing and processing data from grid-based data servers.We present design and evaluation of a system that supports a high-level interface for developing data mining and scient ific data processing grid-services and targets data residing on SRB servers. Results of our evaluation using two data mining and one scientific data processing applications show two important observations. First, each of applications we evaluated demonstrated good scalability with respect to dataset size, as well as changing numbers of both data host and compute nodes. Second, there is only a small overhead associated wit hdeploying our middleware-based applications using MPICH-G2 and Globus. This overhead varied between 14% and 22%and is primarily because of a larger memory footprint. Thus, overall, our work shows that it is feasible to develop and deploy scalable and efficient grid-services that process data from remote servers.
Approximating k-hop minimum spanning trees in Euclidean metrics
Authors: Sören Laue, Domagoj Matijević
Venue: Information Processing Letters (2008)

In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r@?S. We are interested in computing a rooted spanning tree of minimum cost such that the longest root-leaf path in the tree has at most k edges. We present a polynomial-time approximation scheme for the plane. Our algorithm is based on Arora's et al. [S. Arora, P. Raghavan, S. Rao, Approximation schemes for Euclidean k-medians and related problems, in: STOC'98: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, ACM Press, New York, NY, USA, 1998, pp. 106-113] techniques for the Euclidean k-median problem.
Curry-style type isomorphisms and game semantics
Authors: Joachim De lataillade
Venue: Mathematical Structures in Computer Science (2008)

Curry-style system F, that is, system F with no explicit types in terms, may be viewed as a core presentation of polymorphism from the point of view of programming languages. This paper gives a characterisation of type isomorphisms for this language using a game model, whose intuitions come from both the syntax and the game semantics universe. The model is composed of an untyped part to interpret terms, a notion of arena to interpret types and a typed part to express the fact that an untyped strategy σ plays on an arena A. By analysing isomorphisms in the model, we prove that the equational system corresponding to type isomorphisms for Curry-style system F is the extension of the equational system for Church-style isomorphisms with a new, non-trivial equation: ∀X.A<private-char><inline-graphic mime-subtype="gif" xlink="S0960129508006828_char1"/></private-char>A[∀Y.Y/X] if X appears only positively in A.
Probabilistic Spectrum Based Azimuth Estimation with a Binaural Robotic Bat Head
Authors: Filips Schillebeeckx, Jonas Reijniers, Herbert Peremans
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

A small size in-air sonar system is described that performs binaural spectrum based localization. We show that,for a given receiver configuration, a signature of the target's azimuth can be extracted by combining the head related transfer function of the individual receivers. The posterior probability density function of the target's azimuth is calculated by comparing a binaural spectrum measurement with a set of binaural azimuth templates. We propose a Bayesian framework to combine multiple measurements,in particular measurements collected from different viewpoints and/or measurements collected with altered receiver configurations. We show that combining consecutive measurements from multiple viewpoints increases the reliability of the azimuth estimate, even at larger target elevations. An example of the combination of estimate results using two different receiver configurations is presented, showing the potential for actively reducing estimate ambiguities. Furthermore, we show how the antenna features of the artificial pinna shapes can increase bearing estimation performance.
Magnetostatic field calculations associated with thick solenoids in the presence of iron using a power series expansion and the complete elliptic integrals
Authors: Vasos Pavlika
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

The effect of iron on the uniformity of the field produced by an axisymmetric thick solenoid is considered. Using a power series expansion of the vector potential in the radial and axial coordinates the potential is found and from this the magnetic induction B is derived. The solution to the vector potential and field components is also achieved using the complete Elliptic Integrals of Legendre of the first and second kind respectively with numerical results using both methods of solution computed.
Contourlet based lossy image coder with edge preserving
Authors: Osslan Osiris Vergara Villegas, Raúl Pinto Elías
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

In this paper we present a lossy image coder based in multiscale and directional contourlet transform which allows edge preserving in decompressed images. The preserving task is made by capture the edge points of an image using a robust and efficient edge detector known as Smallest Univalue Segment Assimilating Nucleus (SUSAN). The resulting edges coordinates are used as a priori knowledge of the positions of points which are mapped to the correspondent position in the transformed domain by exploit the contourlet parent-child relationship. The contourlet points are coded and finally the image is decompressed to measure the quality. The use of contourlet transform allows us to take advantage of the directional and multiscale representation of edges which is showed in the good edge preserving results obtained.
Democratic and Anti-Democratic Regulators of the Internet: A Framework
Authors: Michael L. Best, Keegan W. Wade
Venue: The Information Society (2007)

We employ Lessig's framework of regulation to conceptualize the relationship between the Internet and democracy. Lessig defines four classes of regulators, forces that control and define systems such as the Internet. They are markets, architectures, norms, and laws. We propose that a "democratic regulator" is a force that serves to enhance civil or political liberties. And we argue by example that there are democratic (and, indeed, anti-democratic) regulators that control aspects of cyberspace. Expressing the democratic effects of the Internet in this manner may prove useful for future comparisons across existing Internet and democracy theories, especially in the realm of quantitative analyses.
Energy harvesting photodiodes with integrated 2D diffractive storage capacitance
Authors: Nathaniel J. Guilar, Erin G. Fong, Travis Kleeburg, Diego R. Yankelevich, Rajeevan Amirtharajah
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Integrating photodiodes with logic and exploiting on-die interconnect capacitance for energy storage can enable new, low-cost energy harvesting wireless systems. To further explore the tradeoffs between optical efficiency and capacitive energy storage for integrated photodiodes, an array of photovoltaics with various diffractive storage capacitors was designed in TSMC's 90nm CMOS technology. Transient effects from interfacing the photodiodes with switching regulators were examined. A quantitative comparison between 90nm and 0.35μm CMOS logic processes for energy harvesting capabilities was carried out. Measurements show an increase in power generation for the newer CMOS technology, however at the cost of reduced output voltage.
A Distributed and Autonomic Virtual Network Mapping Framework
Authors: Ines Houidi, Wajdi Louati, Djamal Zeghlache
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

This paper addresses the challenge of assigning virtual networks, through network virtualisation, to the underlying physical network in a distributed and efficient manner. The paper reports on an implementation and evaluation of adistributed and autonomic framework with algorithms responsible for mapping virtual nodes and links to the physical resources. A Virtual Network (VN) Mapping Protocolis proposed for exchange of messages between autonomic substrate nodes. Results of the implementation and a performance evaluation of the distributed and autonomic VN mapping using a Multi-agent approach are provided.
Elements of Argumentation
Authors: Philippe Besnard, Anthony Hunter
Venue:  (2008)

Logic-based formalizations of argumentation, which assume a set of formulae and then lay out arguments and counterarguments that can be obtained from these formulae, have been refined in recent years in an attempt to capture more closely real-world practical argumentation. In Elements of Argumentation, Philippe Besnard and Anthony Hunter introduce techniques for formalizing deductive argumentation in artificial intelligence, emphasizing emerging formalizations for practical argumentation. Besnard and Hunter discuss how arguments can be constructed, how key intrinsic and extrinsic factors can be identified, and how these analyses can be harnessed for formalizing argumentation for use in real-world problem analysis and decision making. The book focuses on a monological approach to argumentation, in which there is a set of possibly conflicting pieces of information (each represented by a formula) that has been collated by an agent or a pool of agents. The role of argumentation is to construct a collection of arguments and counterarguments pertaining to some particular claim of interest to be used for analysis or presentation. Elements of Argumentation is the first book to elucidate and formalize key elements of deductive argumentation. It will be a valuable reference for researchers in computer science and artificial intelligence and of interest to scholars in such fields as logic, philosophy, linguistics, and cognitive science.
After the humans are gone Douglas Engelbart Keynote Address, North American Computers and Philosophy Conference Rensselaer Polytechnic Institute, August, 2006
Authors: Eric Dietrich
Venue: Journal of Experimental Theoretical Artificial Intelligence (2007)

Artificial intelligence has long suffered the slings and arrows of humanists arguing in various ways that AI is dangerous to humanity. I argue the opposite: it is humanity that is dangerous, and replacing us by intelligent machines or agents would vastly improve the entire world. My argument beings with two observations. First, humans are extremely dangerous to all the other life on the planet. Second, humans are dangerous to all the other humans. Viewed objectively, getting rid of humans would be a good thing. Yet, it seems obvious that the good for which humans are responsible outweighs humans' negative effects. But what if we could replace humans with beings just as good, or better than we, yet with fewer negative effects? AI provides just this opportunity. I then consider one potent objection to this proposal. Because of their special epistemic status as engineered intelligences, the machines will lack the ability to be awed and inspired by their world. Lacking connections of wonder and inspiration to their world, they will lack the impetus necessary to create art and science. While their world might be better morally than ours, something of incalculable beauty will be lost if we turn Earth over to them. I show that this objection doesn't work.
Reduction of the codimension for degenerate submanifolds
Authors: Jean-Pierre Ezin, Mouhamadou Hassirou, Joel Tossa
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

We give in this paper sufficient conditions for r- lightlike submanifolds M of dimension m, which is not totally geodesic in an (m + n)-dimensional semi-Riemannian manifold of constant curvature c to admit a reduction of codimension. We consider proper r-lightlike, coisotrope and totally lightlike submanifolds, generalizing thus previous results on isotropic submanifolds [1] as well as in the Riemannian case developed in [2, 5, 10].
Personalizable Service Discovery in Pervasive Systems
Authors: Korbinian Frank, Vincenzo Suraci, Jelena Mitic
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

Today, telecom providers are facing changing challenges. To stay ahead in the competition and provide market leading offerings, carriers need to enable a global ecosystem of third party independent application developers to deliver converged services. This is the aim of leveraging a open standards-based service delivery platform. To identify and to cope with those challenges is the main target of the EU funded project IST DAIDALOS II. And a central point to satisfy the changing user needs is the provision of a well working, user friendly and personalized service discovery. This paper describes our work in the project on a middleware in a framework for pervasive service usage. We have designed an architecture for it, that enables full transparency to the user, grants high compatibility and extendability by a modular and pluggable conception and allows for interoperability with most known service discovery protocols. Our Multi-Protocol Service Discovery and the Four Phases Service Filtering concept enabling personalization should allow for the best possible results in service discovery.
Embedding Architectural Practices into Extreme Programming
Authors: Amir Azim Sharifloo, Amir S. Saffarian, Fereidoon Shams
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Today, agile methods become a popular approach to develop software systems. They try to satisfy customer, respond to changes, release in less time and achieve suitable profits for developers. XP is one of the most popular agile methods which is currently being used and different kinds of research have been accomplished about its various aspects such as pair programming. In spite of all benefits known of XP, it does not involve architectural techniques yet. As it is mentioned in many technical reports, the way to achieve high quality of system is to consider its architecture as an important matter in the development process. This paper introduces two practices in order to empower XP's development process toward improving system's architecture. The main characteristic of proposed solution is that it is derived from values and practices of XP in order to be compatible with XP process model and to keep its agility intact.
An Advanced Save-Energy Mechanism of Ad hoc Networks
Authors: Feng Zhenxin, Li Layuan
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

This article improves on the energy-consuming equation and nodes’ energy states in the old energy model of Ad hoc networks, which concerned of the nodes’ energy consumption in listening and idle period, and enhances the comprehensive of solving energy problem in this area. In the communication range of a node, where include the nodes could reach the nodes’ signal, setting the highest energy-state node as an Agent will reduce the number of Agent in old save-energy model, and for improving the surviving time of the net, we added a new conception: edge-agent. The experiment indicates that the new energy-saving model cut down the idle nodes` energy consumption, declines the probability for nodes becoming agent-nodes, and increase the whole net’s surviving time and the stability of communication because of using edge-agents.
Considering a user's mobility and query patterns in location-based services
Authors: Sang-Won Kang, Joon-Min Gil, SangKeun Lee
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

In mobile computing environments, a user's mobility and query patterns are multiform. To support an adequate service to the user within quick period, it is important to consider the user's various interests. As the development of the mobile device, the work of client-side has been getting more and more without continuous connection between client and server. However, the minimized communication costs are needed to keep a consistency with server. This paper uses a sematic prefetching scheme with the aim of decreasing the communication cost, and depicts various cache replacement policies. Moreover, considering a client's description parameters (access time, frequency, locality), a range query and a nearest neighbor query are dynamically performed according to user patterns. Our experiment results show that the proposed preference priority replacement policy outperforms other policies, and has the better performance when adjusting the ratio of query type (range and nearest neighbor queries) with respect to mobility (high, low) and query patterns (various, similar).
A Logic Specification and Implementation Approach for Object Oriented Database Security
Authors: Xianjun Ni
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

This paper is to investigate the implementation of security mechanism in object oriented database system. Formal methods play an essential role in computer security due to its powerful expressiveness and concise syntax and semantics. In this paper, both issues of specification and implementation in database security environment will be considered; and the database security is achieved through the development of an efficient implementation of the specification without compromising its originality and expressiveness.