ppxscal/embedding_network huggingface dataset:
CNP-based Implementation of Service-oriented Workflow Mapping in SHGWMS
Authors: Lei Cao, Minglu Li, Jian Cao, Joshua Huang
Venue: World Wide Web (2008)

ShanghaiGrid has a complex service-oriented infrastructure. Workflow management is emerging as one of the most important part of it. Because the grid environment is very dynamic and the services are shared among many users, it is impossible to optimize the workflow from the point of view of execution ahead of time. In fact, one may want to make decisions about the execution locations and the access to a particular data set as late as possible. In this paper, we propose a method of using Contract Net Protocol(CNP) to implement service-oriented workflow mapping in ShanghaiGrid workflow management system(SHGWMS). Three types of workflow in SHGWMS are denoted as Abstract workflow(AW), Concrete workflow(CW) and Executable workflow(EW). Belief-Desire-Intention(BDI) agent technology in SHGWMS helps the system meet challenges from the grid context. CNP provides a very proper negotiation model for agents. The problem of workflow mapping has been transferred to the problem of multi-agent negotiation with the help of CNP model in SHGWMS. We also propose AW2CW mapping algorithm and CW2EW mapping algorithm to accomplish service-oriented workflow mapping.
A New Scheme for Distributed Density Estimation based Privacy-Preserving Clustering
Authors: Chunhua Su, Feng Bao, Jianying Zhou, Tsuyoshi Takagi, Kouichi Sakurai
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

The sensitive information leakage and security risk is a problem from which both individual and enterprise suffer in massive data collection and the information retrieval by the distrusted parties. In this paper, we focus on the privacy issue of data clustering and point out some security risks in the existing data mining algorithms. Associated with cryptographic techniques, we initiate an application of random data perturbation (RDP) which has been widely used for preserving the privacy of individual records in statistical database for the distributed data clustering scheme. Our scheme applies linear transformation of Gaussian distribution perturbed data and general additional data perturbation (GADP) schemes to preserve the privacy for distributed kernel density estimation with the help of any trusted third party. We also show that our scheme is more secure against the random matrix-based filtering attack which is based on analysis of the distribution of the eigenvalues by using two RDP methods.
A presentation model for multimedia summaries of behavior
Authors: Martin Molina, Victor Flores
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

Presentation models are used by intelligent user interfaces to automatically construct adapted presentations according to particular communication goals. This paper describes the characteristics of a presentation model that was designed to automatically produce multimedia presentations about the summarized behavior of dynamic systems. The presentation model is part of the MSB application (Multimedia Summarizer of Behavior). MSB was developed for the problem of management of dynamic systems where different types of users (operators, decision-makers, other institutions, etc.) need to be informed about the evolution of the system, especially during critical situations. The paper describes the details of the presentation model based on a hierarchical planner together with graphical resources. The paper also describes an application in the field of hydrology for which the model was developed.
A Time Slot Count in Window Method Suitable for Long-Term Regularity-Based User Classification for Mobile Internet
Authors: Toshihiko Yamakami
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

The mobile Internet proliferates and penetrates all aspects of daily life. It is crucial to codify methodologies to fit mobile-specific demands, e.g. regularity. Subscription-based mobile services require the analysis of regularity to capture and retain easy-come, easy-go users.The author proposes a method called the "time slot count in window'' method (TCW-method) to efficiently capture regular users, while relaxing the explicit splits among time slots with visits. The author shows the case study result from 2001-2002 commercial service logs. A case study conducted in 2001-2002 with commercial news service subscribers shows that the relaxation in the proposed method loses 2-3 % in the recall rate of regularity, but still obtained 88-91% recall rate. Considering the trade-off with the on-the-fly nature of coping with limited storage capacity, the author considers this method to be very promising for the mobile Internet.
Grid Differentiated Services: A Reinforcement Learning Approach
Authors: Julien Perez, Cécile Germain-Renaud, Balazs Kégl, Charles Loomis
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Large scale production grids are a major case for autonomic computing. Following the classical definition of Kephart, an autonomic computing system should optimize its own behavior in accordance with high level guidance from humans. This central tenet of this paper is that the combination of utility functions and reinforcement learning (RL) can provide a general and efficient method for dynamically allocating grid resources in order to optimize the satisfaction of both end-users and participating institutions. The flexibility of an RL-based system allows to model the state of the grid,the jobs to be scheduled, and the high-level objectives of the various actors on the grid. RL-based scheduling can seamlessly adapt its decisions to changes in the distributions ofinter-arrival time, QoS requirements, and resource availability. Moreover, it requires minimal prior knowledge about thetarget environment, including user requests and infrastructure. Our experimental results, both on a synthetic workloadand a real trace, show that RL is not only a realistic alternative to empirical scheduler design, but is able to outperform them.
PeerCast: Churn-resilient end system multicast on heterogeneous overlay networks
Authors: Jianjun Zhang, Ling Liu, Lakshmish Ramaswamy, Calton Pu
Venue: Journal of Network and Computer Applications (2008)

The lack of wide deployment of IP multicast in the Internet has prompted researchers to propose end system multicast or application-level multicast as an alternate approach. However, end system multicast, by its very nature, suffers from several performance limitations, including, high communication overheads due to duplicate data transfers over same physical links, uneven load distribution caused by widely varying resource availabilities at nodes, and highly failure-prone nature of end-hosts. This paper presents a self-configuring, efficient and churn-resilient end-system multicast system called PeerCast. Three unique features distinguish PeerCast from existing approaches to application-level multicasting. First, with the aim of exploiting network proximity of end-system nodes for efficient multicast subscription management and fast information dissemination, we propose a novel Internet-landmark signature technique to cluster the end-hosts of the overlay network. Second, we propose a capacity aware overlay construction technique to balance the multicast workload among heterogeneous end-system nodes. Third, we develop a dynamic passive replication scheme to provide reliable end system multicast services in an inherently dynamic environment of unreliable peers. We also present a set of experiments showing the feasibility and the effectiveness of the proposed mechanisms and techniques.
Scalable landmark recognition using EXTENT
Authors: Arun Qamra, Edward Y. Chang
Venue: Multimedia Tools and Applications (2008)

We have proposed the EXTENT system for automated photograph annotation using image content and context analysis. A key component of EXTENT is a Landmark recognition system called LandMarker. In this paper, we present the architecture of LandMarker. The content of a query photograph is analyzed and compared against a database of sample landmark images, to recognize any landmarks it contains. An algorithm is presented for comparing a query image with a sample image. Context information may be used to assist landmark recognition. Also, we show how LandMarker deals with scalability to allow recognition of a large number of landmarks. We have implemented a prototype of the system, and present empirical results on a large dataset.
Effective formation of interface controlled Y2O3 thin film on Si(100) in a metal-(ferroelectric)-insulator-semiconductor structure
Authors: Kwang-Ho Kwon, Chang Ki Lee, Jun-Kyu Yang, Sun Gyu Choi, Ho Jung Chang, Hyeongtag Jeon, Hyung-Ho Park
Venue: Microelectronic Engineering (2008)

Yttrium was deposited on the chemical oxide of Si and annealed under vacuum to control the interface for the formation of Y"2O"3 as an insulating barrier to construct a metal-ferroelectric-insulator-semiconductor structure. Two different pre-annealing temperatures of 600 and 700^oC were chosen to investigate the effect of the interface state formed after the pre-annealing step on the successive formation of Y"2O"3 insulator and Nd"2Ti"2O"7 (NTO) ferroelectric layer through annealing under an oxygen atmosphere at 800^oC. Pre-anneal treatments of Y-metal/chemical-SiO"2/Si at 600 and 700^oC induced a formation of Y"2O"3 and Y-silicate, respectively. The difference in the pre-anneal temperature induced almost no change in the electrical properties of the Y"2O"3/interface/Si system, but degraded properties were observed in the NTO/Y"2O"3/interface/Si system pre-annealed at 600^oC when compared with the sample pre-annealed at 700^oC. C-V characteristics of the NTO/Y"2O"3/Si structured system showed a clockwise direction of hysteresis, and this gap could be used as a memory window for a ferroelectric-gate. A smaller hysteric gap and electrical breakdown values were observed in the NTO/Y"2O"3/Si system pre-annealed at 600^oC, and this was due to an unintentional distribution of the applied field from the presence of an interfacial layer containing Y-silicate and SiO"2 phases.
A New Approach for Discovering and Quantifying Hierarchical Structure of Complex Networks
Authors: Suyong Eum, Shin'ichi Arakawa, Masayuki Murata
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

Biological robustness has been understood in many different ways. One of them is based on analysis of topological structures such as modularity, and hierarchy. While modularity has been studied in various areas intensively, only a few methods have been proposed to study hierarchical structure of networks. In this paper we propose a new algorithm to discover and quantify hierarchical structure of complex networks. This new algorithm identifies nodes on the top layer of hierarchical structure based on betweenness calculation among links, and groups the rest of nodes according to the distance from nodes on the top layer in order to locate them in different layers. The rearranged structure is quantified to represent the strength of hierarchy structure. In addition, we show the difference between hierarchy and modularity that have been regarded as similar properties.
Verified Software: Theories, Tools, Experiments
Authors: Sir Tony Hoare
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

The ideal of verified software has long been the goal of research in Computer Science. This paper argues that the time is ripe to embark on a Grand Challenge project to construct a program verifier, based on a sound and complete theory of programming, and evaluated by experimental application to a representative sample of useful computer software.
Modeling a dynamically varying mixed sediment bed with erosion, deposition, bioturbation, consolidation, and armoring
Authors: Lawrence P. Sanford
Venue: Computers Geosciences (2008)

Erosion and deposition of bottom sediments reflect a continual, dynamic adjustment between the fluid forces applied to a sediment bed and the condition of the bed itself. Erosion of fine and mixed sediment beds depends on their composition, their vertical structure, their disturbance/recovery history, and the biota that inhabit them. This paper presents a new one-dimensional (1D), multi-layer sediment bed model for simulating erosion and deposition of fine and mixed sediments subject to consolidation, armoring, and bioturbation. The distinguishing characteristics of this model are a greatly simplified first-order relaxation treatment for consolidation, a mud erosion formulation that adapts to both Type I and II erosion behavior and is based directly on observations, a continuous deposition formulation for mud that can mimic exclusive erosion and deposition behavior, and straightforward inclusion of bioturbation effects. Very good agreement with two laboratory data sets on consolidation effects is achieved by adjusting only the first-order consolidation rate r"c. Full model simulations of three idealized cases based on upper Chesapeake Bay, USA observations are presented. In the mud only case, fluid stresses match mud critical stresses at maximum erosion. A consolidation lag results in higher suspended sediment concentrations after erosional events. Erosion occurs only during accelerating currents and deposition does not occur until just before slack water. In the mixed mud and sand case without bioturbation, distinct layers of high and low sand content form and mud suspension is strongly limited by sand armoring. In the mixed mud and sand case with bioturbation, suspended mud concentrations are greater than or equal to either of the other cases. Low surface critical stresses are mixed down into the bed, constrained by the tendency to return towards equilibrium. Sand layers and the potential for armoring of the bed develop briefly, but mix rapidly. This model offers a relatively simple and robust tool for simulating the complex interactions that can affect muddy and mixed sediment bed erodibility.
Efficient minimum cost matching using quadrangle inequality
Authors: A. Aggarwal, A. Bar-Noy
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors present efficient algorithms for finding a minimum cost perfect matching, and for solving the transportation problem in bipartite graphs, G = (Red union Blue, Red * Blue), where mod Red mod = n, mod Blue mod = m, n
Advanced collective communication in aspen
Authors: Qasim Ali, Vijay S. Pai, Samuel P. Midkiff
Venue: Proceedings of the 22nd annual international conference on Supercomputing (2008)

Aspen is a programming language that relies on high-level messaging to support communication among different program tasks executing in parallel. Unlike MPI, the computational logic of Aspen tasks is specified and developed independently of the global communication structure of the program. A root module specifies the communication structure of the program. The semantics and generality of these specifications enable novel forms of collective communication, including asynchronous and concurrent collective operations and reduction type operations with subsets of the participants being receivers of the reduced data, and with receivers that do not provide data to the reduction. This paper describes efficient implementations of these and other collective communication operations in Aspen. We demonstrate the ease-of-use of these features using several code examples and quantify their performance impact through both microbenchmarks and a quantum chemistry code used in rubber chemistry. Aspen's performance is competitive with, or slightly better than, the performance of MPI implementations for both the chemistry application and the microbenchmarks.
Combined terminal and network measurement system for bottleneck localization
Authors: Pekka H. J. Perälä, Marko Jurvansuu, Jarmo Prokkola
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

When a user experiences a poor quality of service (QoS) in a converged network environment, the operators or ISPs need to locate the bottleneck, i.e. to localize which part of the end-to-end (E2E) network path causes the degradation. We present a novel multipoint measurement system that gathers performance information not only from links in the network path, but also from the end devices. In wireless domain, this enables to separate the radio access network and fixed network segments. The measurement method is also applicable to pure fixed line networks. The system is able to perform one-way measurements and even break the E2E delay into one-way link-to-link components, which gives clear benefit over traditional round-trip time (RTT) measurements. The system was verified with laboratory 3G/HSPA (High Speed Packet Access) measurements that revealed a performance bottleneck in the studied 3G network. We also show measurement results in a live Wi-Fi city area network.
Energy-efficient search for finite-lifetime resources in sensor networks with time-constrained queries
Authors: Christopher R. Mann, Rusty O. Baldwin, Jeffrey P. Kharoufeh, Barry E. Mullins
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

We examine the performance of a random-walk search algorithm for wireless sensor networks when resources are subject to limited lifetimes and queries are constrained by application-specific deadlines. Specifically, via the time-to-live and transmission range parameters, we estimate the appropriate number of resource copies that must be created within the network to minimize the total node arrival rate (the energy-centric approach) or to ensure the total proportion of queries failures does not exceed a specified threshold (the failure-centric approach). The effect of node transmission range on network performance is also investigated. We compare the results of our network simulations to our queueing-based analytic node model and find that there is an inverse relationship between transmission range and the time-to-live value required to minimize the total node arrival rate.
Towards cinematic internet video-on-demand
Authors: Bin Cheng, Lex Stein, Hai Jin, Zheng Zhang
Venue: ACM SIGOPS Operating Systems Review (2008)

Video-on-demand (VoD) is increasingly popular with Internet users. It gives users greater choice and more control than live streaming or file downloading. Systems such as MSN Video and YouTube deliver content at low bitrates. This may suit short clips, but great films and 5-minute bloopers are as different as symphonies and jingles. For cinema, poor quality and high jitter are less acceptable. Combining user control with high bitrate is compelling, but technically challenging. VoD is expensive due to the load it places on video source servers. Many researchers have proposed using peer-to-peer (P2P) techniques to shift load from sources to peers (peer-assistance), yet none have implemented and deployed a system with the first purpose of openly and systematically evaluating this approach. To fill this void, we have built and deployed GridCast1. GridCast doubles the bitrates of current popular internet VoD systems, provides a full set of VCR2 operations, and employs peer-assistance to improve scalability and continuity. GridCast has been live on CERNET3 since May of 2006. In peak months, GridCast has served videos to approximately 23,000 users. From the beginning, we have gathered information to understand GridCast and improve its algorithms. This paper introduces and evaluates GridCast. In May of 2007, we deployed multivideo caching, a major change to the caching algorithms. This paper analyzes scalability and continuity before and after this change. Our results contain several surprises and underline the importance of deployment to validate simulation results. We discuss what improvements can be developed beyond multivideo caching.
Rewriting Interpolants
Authors: Christopher Lynch, Yuefeng Tang
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

We give a method of constructing an interpolant for linear equality, and inequality constraints over the rational numbers. Our method is based on efficient rewriting techniques, and does not require the use of combination methods. The interpolant is constructed in such a way that it reflects the structure of the rewrite proof.
Cost-Efficient Worst-Case Execution Time Analysis in Industrial Practice
Authors: Jan Staschulat, Jörn C. Braam, Rolf Ernst, Thomas Rambow, Rainer Schlör Rainer Busch
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

To guarantee real-time behavior of an embedded application, a schedulability analysis can be used. Such ananalysis requires the worst case execution time (WCET) of the application. While several academic approaches to conservatively bound the WCET have been proposed in the last decade, common practice in industry remains simulation and software tests. One reason is that industrial requirements are not sufficiently addressed by academic approaches. In this paper we identify important industrial requirements for WCET-analysis tools. Then, we describe the methodolgy of a previously developed WCET-analysis approach and revise important aspects of its methodology and its implementation to address key industrial requirements. In a large-scale case study the WCET-analysis tool is applied to a safety-critical automotive control application to evaluate the applicability of the tool. Furthermore, the faced challenges and the re-targenting costs for a new processor are discussed.
Multicast capacity for hybrid wireless networks
Authors: XuFei Mao, Xiang-Yang Li, ShaoJie Tang
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless nodes are randomly deployed in a square region and all nodes have the uniform transmission range r and uniform interference range R>r. We further assume that each ordinary wireless node can transmit/receive at W bits/second over a common wireless channel. In addition, there are m additional base stations (neither source nodes nor receiver nodes) placed regularly in this square region and connected by a high-bandwidth wired network. For each ordinary node v, we randomly pick k-1 nodes from the other n-1 ordinary nodes as the receivers of the multicast session at node v. The aggregated multicast capacity is defined as the total data rate of all multicast sessions in this hybrid network. We derive asymptotic upper bounds and lower bounds on multicast capacity of the hybrid wireless networks. The total multicast capacity is O(√n /√log n · √m/k · W) when k = O(n / log n), k = O(m), k / √m → ∞ and m = o(a2 / r2); the total multicast capacity is Θ(√n / √log n · W / √k) when k = O(n/log n), k = Ω(m) and m/k → O. When k = O(n/log n) and k = O(√m), the upper bound for minimum multicast capacity is at most O(r·n/a · √m · W/k) and is at least Ω(W) respectively. When k =Ωα(n/log n), the multicast capacity is Θ(W).