ppxscal/embedding_network huggingface dataset:
BLOMERS: Balanced Load Multi-Constrained Resource Scheduler
Authors: Edgar Magana, Masum Hasan, Joan Serrat
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

The process of resource management in local and wide-area distributed systems involves three main phases: resource discovery, resource scheduling and resource allocation. This paper presents a heuristic resource scheduler to cover the scheduling phase in large-scale distributed systems such as Grids. This approach is supported by BLOMERS (Balanced Load Multi-Constrain Resource Scheduler). Our heuristic scheduler implements a Genetic Algorithm (GA) in order to improve the scalability of the system, in largescale Grids the amount of resource is massive but their computational capacity is low. Therefore, selection of computational resources to allocate customers services becomes an NP-hard problem. The paper outlines a performance evaluation by means of experimental tests. The results highlight two aspects: The scheduling system is reliable in real large-scale Grids and BLOMERS heuristic scheduler offers better performance than common selection algorithms when the number of resource requests is increasing.
Bound on the cardinality of a covering of an arbitrary randomness test by frequency tests
Authors: K. Yu. Gorbunov
Venue: Problems of Information Transmission (2007)

We improve a well-known asymptotic bound on the number of monotonic selection rules for covering of an arbitrary randomness test by frequency tests. More precisely, we prove that, for any set S (arbitrary test) of binary sequences of sufficiently large length L, where ¿S¿ ¿ 2 L(1¿¿), for sufficiently small ¿ there exists a polynomial (in 1/¿) set of monotonic selection rules (frequency tests) which guarantee that, for each sequence t ¿ S, a subsequence can be selected such that the product of its length by the squared deviation of the fraction of zeros in it from 1/2 is of the order of at least 0.5 ln 2 L[¿/ln(1/¿)](1 ¿ 2 ln ln(1/¿)/ln(1/¿)).
Model-Driven Autonomic Architecture
Authors: Radu Calinescu
Venue: Proceedings of the Fourth International Conference on Autonomic Computing (2007)

We present a generic architecture for developing fully-fledged autonomic systems out of non-autonomic components, and investigate how the architecture can be implemented using existing technologies. The universal policy engine at the core of the architecture is configured by means of a model of the resources placed under its control, and uses a set of flexible policies for their management.
P3M: A Virtual Machine Approach to Massively Parallel Computing
Authors: Fabrizio Baiardi, Mehdi Jazayeri
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

While technology improvements in VLSI favor the building of massively parallel computers, the key obstacle to the widespread adoption of such computers is the lack of a methodology for developing software that achieves both portability and high performance. This paper presents a virtual machine intended to serve as the cornerstone of such a methodology. The PM virtual machine can be mapped efficiently to different physical machines and enables the development of software tools and applications that can be ported across different parallel machines.
Mining Frequent Trajectory Patterns for Activity Monitoring Using Radio Frequency Tag Arrays
Authors: Yunhao Liu, Lei Chen, Jian Pei, Qiuxia Chen, Yiyang Zhao
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications (2007)

Activity monitoring, a crucial task in many applications, is often conducted expensively using video cameras. Also, effectively monitoring a large field by analyzing images from multiple cameras remains a challenging problem. In this paper, we introduce a novel application of the recently developed RFID technology: using RF tag arrays for activity monitoring, where data mining techniques play a critical role. The RFID technology provides an economically attractive solution due to the low cost of RF tags and readers. Another novelty of this design is that the tracking objects do not need to attach any transmitters or receivers, such as tags or readers. By developing a practical fault-tolerant method, we offset the noise of RF tag data and mine frequent trajectory patterns as models of regular activities. Our empirical study using real RFID systems and data sets verifies the feasibility and the effectiveness of our design.
Invited Talk: Appliance Defined Ubiquitous Network
Authors: Haruhisa Ichikawa, Masashi Shimizu, Kazunori Akabane
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

Many devices are expected to be networked with wireless appliances such as radio frequency identification (RFID) tags and wireless sensors, and the number of networked wireless appliances will greatly exceed the number of PCs and mobile telephones . This may lead to an essential change in the network architecture. This paper proposes a new network architecture called the appliance defined ubiquitous network (ADUN), in which wireless appliances will be networked without network protocol standards. Wireless space information rather than an individual appliance signal is carried over the ADUN in the form of a stream with strong privacy/security control. It should be noted that this is different from the architectural principles of the Internet. We discuss a network-appliance interface that is sustainable over a long term, and show that the overhead of the ADUN will be within the scope of the broadband network in the near future.
Automatic Extraction of Femur Contours from Calibrated Fluoroscopic Images
Authors: Xiao Dong, Miguel A. Gonzalez Ballester, Guoyan Zheng
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

Automatic identification and extraction of bone contours from x-ray images is an essential first step task for further medical image analysis. In this paper we propose a 3D statistical model based framework for the proximal femur contour extraction from calibrated x-ray images. The automatic initialization is solved by an Estimation of Bayesian Network Algorithm to fit a multiple component geometrical model to the x-ray data. The contour extraction is accomplished by a non-rigid 2D/3D registration between a 3D statistical model and the x-ray images, in which bone contours are extracted by a graphical model based Bayesian inference. Preliminary experiments on clinical data sets verified its validity.
The Significance of Member Validation in Qualitative Analysis: Experiences from a Longitudinal Case Study
Authors: Bendik Bygstad, Bjorn Erik Munkvold
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This article explores the concept of member validation and its potential role in the process of constructing case descriptions and interpretations in qualitative research. Although generally approved as a required step in qualitative inquiry, the format, conduct, and purpose of this vary significantly according to different research perspectives. The paper discusses methodological and validity aspects of member validation, and illustrates these issues with experiences from member validation in a longitudinal, interpretive case study in an airline company. A definition of analytical abstraction as including three steps, referred to in the methodology literature as the "ladder of abstraction", is used as the basis for analyzing and discussing the nature of member validation in different stages of the case construction process. The paper provides two propositions: First, member validation may increase the validity of case studies, provided it is used systematically. The "ladder of abstraction" framework proved useful for conceptualizing this approach. Second, member validation plays distinctly different roles in constructing the case on the different levels of abstraction.
Adoption of Mobile Commerce Services by Individuals: A Meta-Analysis of the
Authors: Yousuf S. AlHinai, Sherah Kurnia, Robert B. Johnston
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

Using mobile commerce services, users can send/receive emails, download music/graphics/animations, play games, trade stocks, book tickets, find friends, conduct financial and banking transactions and so on. A distinguishing factor of m-commerce services is the ability to perform tasks anywhere, anytime. Given such uniqueness, it has been a huge success in terms of adoption by individuals in some markets like Japan, while, surprisingly, not as flourishing in others such as the USA and Australia.
On the Problem of Energy Efficiency of Multi-Hop vs One-Hop Routing in Wireless Sensor Networks
Authors: Szymon Fedor, Martin Collier
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

The hop distance strategy in Wireless Sensor Networks (WSNs) has a major impact on energy consumption of each sensor mote. Long-hop routing minimizes reception cost. However, a substantial power demand is incurred for long distance transmission. Since the transceiver is the major source of power consumption in the node, optimizing the routing for hop length can extend significantly the lifetime of the network. This paper explores when multi-hop routing is more energy efficient than direct transmission to the sink and the conditions for which the two-hop strategy is optimal. Experimental evidence is provided in to support of these conclusions. The tests showed that the superiority of the multi-hop scheme depends on the source-sink distance and reception cost. They also demonstrated that the two-hop strategy is most energy efficient when the relay is at the midpoint of the total transmission radius. Our results may be used in existing routing protocols to select optimal relays or to determine whether it is better to send packets directly to the base station or through intermediate nodes.
Flexible OS support and applications for trusted computing
Authors: Tal Garfinkel, Mendel Rosenblum, Dan Boneh
Venue: Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9 (2003)

Trusted computing (e.g. TCPA and Microsoft's Next-Generation Secure Computing Base) has been one of the most talked about and least understood technologies in the computing community over the past year. The capabilities trusted computing provides have the potential to radically improve the security and robustness of distributed systems. Unfortunately, the debate over its application to digital rights management has caused its significant other applications to be largely overlooked. In this paper we present a broader vision for trusted computing. We give an intuitive model for understanding the capabilities and limitations of the mechanisms provided by trusted computing. We describe a flexible OS architecture to support trusted computing. We present a range of practical applications that illustrate how trusted computing can be used to improve security and robustness in distributed systems.
Exploring the Conceptual Model of Digital Ecosystem
Authors: Hai Dong, Farookh Khadeer Hussain, Elizabeth Chang
Venue: Proceedings of the Second International Conference on Digital Telecommunications (2007)

Digital Ecosystem, as a neoteric terminology, has emerged along with the appearance of Business Ecosystem which is a form of naturally existing business network of small and medium enterprises. However, few researches have been found in the field of defining digital ecosystem. In this paper, by means of ontology technology as our research methodology, we propose to develop a conceptual model for digital ecosystem. By introducing an innovative ontological notation system, we create the hierarchical framework of digital ecosystem form up to down, based on the related theories form Digital Ecosystem and Business Intelligence Institute.
E-Bicycle Demonstration on the Tour De France
Authors: Amine Dhraief, Nicolas Montavont, Romain Kuntz, Manabu Tsukada
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

In this paper, we describe the E-bicycle demonstration held within the Tour De France. It was performed by the Nautilus6 working group in order to see the impact and usage of new IPv6 mobility protocols in the real life. We report our experience of settting an IPv6 mobile network demonstration where a E-car and two E-bicycles are communicating together while being in motion. The scenario involves network mobility managed by NEMO Basic support and optimized group communication via Xcast6. We finally put forward the results of the demonstration and give recommendations for future deployment.
Numerical techniques for fresnel diffraction in computational holography
Authors: John Tyler
Venue:  (2006)

Optical holography can produce very realistic virtual images due to its capability to properly convey the depth cues that we use to interpret three-dimensional objects. Computational holography is the use of digital representations plus computational methods to carry out the holographic operations of construction and reconstruction. The large computational requirements of holographic simulations prohibit present-day existence of real-time holographic displays comparable in size to traditional two-dimensional displays. Fourier-based approaches to calculate the Fresnel diffraction of light provide one of the most efficient algorithms for holographic computations because this permits the use of the fast Fourier transform (FFT). The limitations on sampling imposed by Fourier-based algorithms have been overcome by the development, in this research, of a fast shifted Fresnel transform. This fast shifted Fresnel transform was used to develop a tiling approach to hologram construction and reconstruction, which computes the Fresnel propagation of light between parallel planes having different resolutions. A new method for hologram construction is presented, named partitioned hologram computation, which applies the concepts of the shifted Fresnel transform and tiling.
The changing labyrinth of software pricing
Authors: Michael A. Cusumano
Venue: Communications of the ACM (2007)

Exploring the malleable revenue pathways among the different varieties of pricing strategies.
A Simple Calculus for Proteins and Cells
Authors: Cosimo Laneve, Fabien Tarissan
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

The use of process calculi to represent biological systems has led to the design of different calculi such as brane calculi [Luca Cardelli. Brane calculi. In CMSB, pages 257-278, 2004] and @k-calculus [Vincent Danos and Cosimo Laneve. Formal molecular biology. Theoritical Computer Science, 325(1):69-110, 2004]. Both have proved to be useful to model different types of biological systems. As an attempt to unify the two directions, we introduce the bio@k-calculus, a simple calculus for describing proteins and cells, in which bonds are represented by means of shared names and interactions are modelled at the domain level. Protein-protein interactions have to be at most binary and cell interactions have to fit with sort constraints. We define the semantics of bio@k-calculus, analyse its properties, and discuss its expressiveness by modelling two significant examples: a signalling pathway and a virus infection.
Efficient Shape Modeling: ⋮-Entropy, Adaptive Coding, and Boundary Curves -vs- Blum's Medial Axis
Authors: Kathryn Leonard
Venue: International Journal of Computer Vision (2007)

We propose efficiency of representation as a criterion for evaluating shape models, then apply this criterion to compare the boundary curve representation with the medial axis. We estimate the ⋮-entropy of two compact classes of curves. We then construct two adaptive encodings for non-compact classes of shapes, one using the boundary curve and the other using the medial axis, and determine precise conditions for when the medial axis is more efficient. Finally, we apply our results to databases of naturally occurring shapes, determining whether the boundary or medial axis is more efficient. Along the way we construct explicit near-optimal boundary-based approximations for compact classes of shapes, construct an explicit compression scheme for non-compact classes of shapes based on the medial axis, and derive some new results about the medial axis.
P2P-Leveraged Mobile Live Streaming
Authors: Jinfeng Zhang, Jianwei Niu, Rui He, Jianping Hu, Sun Limin
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Providing high rate streaming service over cellular data networks is a challenging work. In this paper, a mobile streaming broadcast system, called P2P-leveraged mobile live streaming system (P2PMLS), is proposed. In P2PMLS, the multiple network interfaces of mobile hosts are used. The mobile hosts form a peer-to-peer overlay networks through WiFi or Bluetooth. A part of the peers, called seed peers, receive streaming data from the server through cellular data networks and share the obtained data with other mobile hosts in the overlay network. The peer layer protocol is also proposed to manage the overlay network. Based on the design, a simple prototype is implementing. The performance of the design is compared with the cellular network streaming scheme in an analysis way. The results show that P2PMLS is superior to the cellular network streaming scheme.
CipherVOX: scalable low-complexity speaker verification
Authors: B. A. Fette
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Biometrics is gaining strong support for access control in the industry. It is not uncommon for individual users to be faced with a half-dozen or more passwords and personal identification numbers (PINs) controlling access to the systems required for them to do their job. The ubiquity of passwords actually relaxes system security since many users tend to use the same password across all applications, or collect the various passwords in a single location (perhaps a password protected spreadsheet, or a piece of paper in a desk drawer). The latter case is of extreme concern since security around the collection is much more easily compromised than that of the system. The use of biometrics not only recovers the ability to secure sensitive systems and data, but also does so in a user-friendly manner. In order to use biometrics successfully in server-based environments, several key concerns must be addressed. First, the authentication strategy must maintain acceptable levels of security. Second, the user community must accept the chosen biometric (unless there is a captive audience). The last major consideration is the scalability of the solution. In this paper we introduce CipherVOX, a speaker verification access control solution for server and standalone computing environments. We discuss the use of our polynomial-based classifier that combines high-accuracy and low-complexity via discriminative techniques, and give performance results for both a proprietary performance database and the standard YOHO database. We also review the challenges in designing for user acceptance, including the design of the speaker verification user interface, as well as the application programming interface (API).
Notes on the Roots of Ehrhart Polynomials
Authors: Christian Bey, Martin Henk, Jorg M. Wills
Venue: Discrete Computational Geometry (2007)

We determine lattice polytopes of smallest volume with a given number of interior lattice points. We show that the Ehrhart polynomials of those with one interior lattice point have largest roots with norm of order n2, where n is the dimension. This improves on the previously best known bound n and complements a recent result of Braun where it is shown that the norm of a root of a Ehrhart polynomial is at most of order n2. For the class of 0-symmetric lattice polytopes we present a conjecture on the smallest volume for a given number of interior lattice points and prove the conjecture for crosspolytopes. We further give a characterisation of the roots of Ehrhart polyomials in the three-dimensional case and we classify for n &#x2264; 4 all lattice polytopes whose roots of their Ehrhart polynomials have all real part -1/2. These polytopes belong to the class of reflexive polytopes.
An Electronic Student Observatory
Authors: P. G. Thomas
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Summary form only given. AESOP (An Electronic Student Observatory Project) is a collection of computer-based data collection tools for instruction and research in computer science education. Our educational environment is one in which 5000 students study independently at a distance, off-line, using software developed for an entry-level, distance education course in computing. Each student is allocated an academic tutor whose job is to support the student by answering queries and by commenting on and grading assignments. Students and tutors interact primarily through e-mail. The aim of the project is to observe these students unobtrusively, electronically, and automatically, and to record the observations in a manner that is useful for both instruction and research. The important objectives for the recorder are that it must create a transcript short enough to be sent via e-mail (by students who pay phone charges), readable both by humans and automated analysis tools, and replayable, so that the student's session can be reproduced on an observer's computer. These sometimes conflicting objectives have led to interesting implementation issues, which are discussed in the paper, which also gives a full description of the recorder and associated replayer.
Chaotic time series prediction for the game, Rock-Paper-Scissors
Authors: Franco Salvetti, Paolo Patelli, Simone Nicolo
Venue: Applied Soft Computing (2007)

Two players of Rock-Paper-Scissors are modeled as adaptive agents which use a reinforcement learning algorithm and exhibit chaotic behavior in terms of trajectories of probability in mixed strategies space. This paper demonstrates that an external super-agent can exploit the behavior of the other players to predict favorable moments to play against one of the other players the symbol suggested by a sub-optimal strategy. This third agent does not affect the learning process of the other two players, whose only goal is to beat each other. The choice of the best moment to play is based on a threshold associated with the Local Lyapunov Exponent or the Entropy, each computed by using the time series of symbols played by one of the other players. A method for automatically adapting such a threshold is presented and evaluated. The results show that these techniques can be used effectively by a super-agent in a game involving adaptive agents that exhibit collective chaotic behavior.
The effect of Internet general privacy concern on customer behavior
Authors: J. Alberto Castañeda, Francisco J. Montoro
Venue: Electronic Commerce Research (2007)

Privacy and its related variables are important determinants of customer behavior in the electronic market. This paper aims to examine the concern for customer privacy on the Internet, mainly with regard to disclosing personal information online. Furthermore, by establishing an experimental situation, we will analyze how this behavior is influenced by familiarity with the website sponsor, the level of control over the information the customer has and the sensitivity of the information requested. The results indicate that all the above-mentioned variables (except familiarity) have a significant impact on consumer online behavior.