ppxscal/embedding_network huggingface dataset:
SLA Automated Negotiation Manager for Computing Services
Authors: Halina Kaminski, Mark Perry
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

Success in today's marketing arena can often depend on companies embracing effective new technologies and integrating them into their business model. In the computing service supply industry, Service Level Agreements (SLAs) are commonly prepared and signed agreements between the service provider and its customers. SLAs should match business needs of both sides of the agreement as closely as possible. This paper focuses on at the steps and activities that the service provider can take to facilitate agreement. It proposes an automated way for creating SLA's from a set of Service Level Objectives (SLOs). The SLA should achieve business goals, including the maximization of customer satisfaction. To automate the preparation of effective SLAs each company should set SLOs that support business needs.
Annotation authoring in collaborative 3D virtual environments
Authors: Rieko Kadobayashi, Julian Lombardi, Mark P. McCahill, Howard Stearns, Katsumi Tanaka, Alan Kay
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

To be generally useful for collaborative research and learning, immersive virtual 3D spaces must include intuitive content creation and annotation tools. We describe some initial work to enhance one such environment (Croquet) for use in a broad range of collaborative applications. Annotations in virtual spaces may include features such as comments on objects in the environment, guided tours through the virtual space, and a history mechanism so that the evolution of objects or portions of the space can be replayed and examined. In general terms, an annotation is simply a relationship between one object and another and we examine several methods of displaying these relationships. To extend annotations across communities, the system architecture supports naming and packaging object and meta-information and integration of content into a shared digital repository. By distributing to users the power to create, edit, store, and retrieve objects and annotations, we promote development and re-use of meaningful content. Such systems can have great utility for the development of virtual environments for learning and research.
Collusion-Resistant Video Watermarking Based on Video Mosaicing
Authors: M. Koubaa, C. Ben Amar, H. Nicolas
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

With the rapid development of multimedia applications, and the fact that a large quantity of multimedia data is distributed via the internet network, the protection of video becomes a major problem. It is therefore necessary to protect them. This can be done using video watermarking methods. To be really efficient, the mark has to be resistant to malicious attacks. Methods developed for still images cannot be efficiently used for video. Effectively, if a mark is embedded in only one image of the video, a temporal filtering along the motion displacement can easily removed it without significant degradation of the video. It is therefore necessary to define specific techniques for video. In this context, we present in this paper a video watermarking method based on the use of video mosaicing. We show that the proposed method is resistant to temporal filtering attack.
Information-Flow Security for Interactive Programs
Authors: Kevin R. O'Neill, Michael R. Clarkson, Stephen Chong
Venue: Proceedings of the 19th IEEE workshop on Computer Security Foundations (2006)

Interactive programs allow users to engage in input and output throughout execution. The ubiquity of such programs motivates the development of models for reasoning about their information-flow security, yet no such models seem to exist for imperative programming languages. Further, existing language-based security conditions founded on noninteractive models permit insecure information flows in interactive imperative programs. This paper formulates new strategy-based information-flow security conditions for a simple imperative programming language that includes input and output operators. The semantics of the language enables a fine-grained approach to the resolution of nondeterministic choices. The security conditions leverage this approach to prohibit refinement attacks while still permitting observable nondeterminism. Extending the language with probabilistic choice yields a corresponding definition of probabilistic noninterference. A soundness theorem demonstrates the feasibility of statically enforcing the security conditions via a simple type system. These results constitute a step toward understanding and enforcing information-flow security in real-world programming languages, which include similar input and output operators
Optimal constrained graph exploration
Authors: Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar
Venue: ACM Transactions on Algorithms (TALG) (2006)

We address the problem of constrained exploration of an unknown graph G &equals; (V, E) from a given start node s with either a tethered robot or a robot with a fuel tank of limited capacity, the former being a tighter constraint. In both variations of the problem, the robot can only move along the edges of the graph, for example, it cannot jump between nonadjacent nodes. In the tethered robot case, if the tether (rope) has length l, then the robot must remain within distance l from the start node s. In the second variation, a fuel tank of limited capacity forces the robot to return to s after traversing C edges. The efficiency of algorithms for both variations of the problem is measured by the number of edges traversed during the exploration. We present an algorithm for a tethered robot that explores the graph in &Theta;(&verbar;E&verbar;) edge traversals. The problem of exploration using a robot with a limited fuel tank capacity can be solved with a simple reduction from the tethered robot case and also yields a &Theta;(&verbar;E&verbar;) algorithm. This improves on the previous best-known bound of O(&verbar;E&verbar; &plus; &verbar;V&verbar;log2&verbar;V&verbar;). Since the lower bound for the graph exploration problems is &ohm;(&verbar;E&verbar;), our algorithm is optimal within a constant factor.
Ratio and relative asymptotics of polynomials orthogonal with respect to varying Denisov-type measures
Authors: D. Barrios Rolanía, B. de la Calle Ysern, G. López Lagomasino
Venue: Journal of Approximation Theory (2006)

Let µ be a finite positive Borel measure with compact support consisting of an interval [c, d] ⊂ R plus a set of isolated points in R[c, d], such that µ' > 0 almost everywhere on [c, d]. Let {w2n}, n ∈ Z+, be a sequence of polynomials, deg w2n ≤ 2n, with real coefficients whose zeros lie outside the smallest interval containing the support of µ. We prove ratio and relative asymptotics of sequences of orthogonal polynomials with respect to varying measures of the form dµ/w2n. In particular, we obtain an analogue for varying measures of Denisov's extension of Rakhmanov's theorem on ratio asymptotics. These results on varying measures are applied to obtain ratio asymptotics for orthogonal polynomials with respect to fixed measures on the unit circle and for multi-orthogonal polynomials in which the measures involved are of the type described above.
Concurrency Control in Multi-Role Association
Authors: Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

A role shows a job function in an enterprise. In a rolebased access control model, a role is a set of access rights. A subject doing jobs is granted roles showing the jobs. In addition, objects have to be consistent in presence of multiple conflicting transactions. A transaction issued by a subject is associated with a subset of roles granted to the subject, which is named purpose. A method with a more significant purpose is performed before another method with a less significant purpose. We discuss which purpose is more significant than another purpose. We discuss general role-ordering (GRO) schedulers so that multiple conflicting transactions are serializable in the significant order of subjects and purposes. We evaluate the GRO scheduler compared with the traditional two-phase locking protocol.
Identifying State Transitions and their Functions in Source Code
Authors: Neil Walkinshaw, Kirill Bogdanov, Mike Holcombe
Venue: Proceedings of the Testing: Academic & Industrial Conference on Practice And Research Techniques (2006)

Finite state machine specifications form the basis for a number of rigorous state-based testing techniques and can help to understand program behaviour. Unfortunately they are rarely maintained during software development, which means that these benefits can rarely be fully exploited. This paper describes a technique that, given a set of states that are of interest to a developer, uses symbolic execution to reverse-engineer state transitions from source code. A particularly novel aspect of our approach is that, besides determining whether or not a state transition can take place, it also precisely identifies the path(s) through the source code that govern a transition. The technique has been implemented as a prototype, enabling a preliminary evaluation of our technique with respect to real software systems.
Cross-layer power management in wireless networks and consequences on system-level architecture
Authors: Bruno Bougard, Sofie Pollin, Antoine Dejonghe, Francky Catthoor, Wim Dehaene
Venue: Signal Processing (2006)

Low power consumption is imperative to enable the deployment of broadband wireless connectivity in portable devices such as PDA's or smart phones. Next to low power circuit and architecture design, system-level power management reveals to be a key technology for low power consumption. Recently, "lazy scheduling" has been proposed for system level power reduction. It has been shown to be very effective and complementary to more traditional shutdown-based approaches. So far, analysis has been carried out from the viewpoint of medium access control (MAC) and data link control (DLC) layers. Yet, effective power management in radio communication requires considering end-to-end cross-layer interactions. In this paper, we analyze the implication of lazy scheduling from the end-to-end perspective, considering the interaction with the transport layer. It is shown that a key tradeoff between queuing delay and physical layer energy drives the transport-level tradeoff between user throughput and system power. Conditions under which lazy scheduling is efficient are established. Further, it is shown that the user throughput vs. system power tradeoff can be controlled by adapting the lazy scheduling policy. Finally, important conclusions on effective system-level architecture and cross-layer power management are drawn.
Meta-data snapshotting: a simple mechanism for file system consistency
Authors: Livio B Soares, Orran Y Krieger, Dilma Da Silva
Venue: Proceedings of the international workshop on Storage network architecture and parallel I/Os (2003)

File system consistency frequently involves a choice between raw performance and integrity guarantees. A few software-based solutions for this problem have appeared and are currently being used on some commercial operating systems; these include log-structured file systems, journaling file systems, and soft updates. In this paper, we propose meta-data snapshotting as a low-cost, scalable, and simple mechanism that provides file system integrity. It allows the safe use of write-back caching by making successive snapshots of the meta-data using copy-on-write, and atomically committing the snapshot to stable storage without interrupting file system availability. In the presence of system failures, no file system checker or any other operation is necessary to mount the file system, therefore it greatly improves system availability. This paper describes meta-data snapshotting, and its incorporation into a file system available for the Linux and K42 operating systems. We show that meta-data snapshotting has low overhead: for a microbenchmark, and two macrobenchmarks, the measured overhead is of at most 4%, when compared to a completely asynchronous file system, with no consistency guarantees. Our experiments also show that it induces less overhead then a write-ahead journaling file system, and it scales much better when the number of clients and file system operations grows.Furthermore, this new technique can be easily extended to provide file system snapshotting (versioning) and transaction support for a collection of selected files or directories.
Standards: What Are They Good For?
Authors: Simone Santini
Venue: Computer (2006)

Standards might help the industry, but they could severely hamper research
Dominant Sets and Pairwise Clustering
Authors: Massimiliano Pavan Marcello Pelillo
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

We develop a new graph-theoretic approach for pairwise data clustering which is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set of vertices, a notion introduced here which generalizes that of a maximal complete subgraph to edge-weighted graphs. We establish a correspondence between dominant sets and the extrema of a quadratic form over the standard simplex, thereby allowing the use of straightforward and easily implementable continuous optimization techniques from evolutionary game theory. Numerical examples on various point-set and image segmentation problems confirm the potential of the proposed approach.
ActorNet: an actor platform for wireless sensor networks
Authors: YoungMin Kwon, Sameer Sundresh, Kirill Mechitov, Gul Agha
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We present actorNet, a mobile agent platform for wireless sensor networks (WSNs). WSNs are well-suited to multiagent systems: agent autonomy reduces the need for communication, saving precious energy. Mobile agents are also an intuitive technique for remotely reprogramming sensors deployed in the field. However, implementing agent programs directly on a WSN is complicated by the many limitations of sensor nodes, including limited memory, slow processors, low bandwidth and finite energy. ActorNet eases development by providing an abstract environment for lightweight concurrent object-oriented mobile code on WSNs. As such, it enables a wide range of new dynamic applications, including fully customizable queries and aggregation functions, in-network interactive debugging and high-level concurrent programming on the inherently parallel sensor network platform. Moreover, actorNet cleanly integrates all of these features into a fine-tuned, multi-threaded embedded Scheme interpreter that supports compact, maintainable programs---a significant advantage over primitive stack-based virtual machines.
ICAM: Integrated Cellular and Ad Hoc Multicast
Authors: Randeep Bhatia, Li (Erran) Li, Haiyun Luo, Ram Ramjee
Venue: IEEE Transactions on Mobile Computing (2006)

In third generation (3G) wireless data networks, multicast throughput decreases with the increase in multicast group size, since a conservative strategy for the base station is to use the lowest data rate of all the receivers so that the receiver with the worst downlink channel condition can decode the transmission correctly. This paper proposes ICAM, Integrated Cellular and Ad hoc Multicast, to increase 3G multicast throughput through opportunistic use of ad hoc relays. In ICAM, a 3G base station delivers packets to proxy mobile devices with better 3G channel quality. The proxy then forwards the packets to the receivers through an IEEE 802.11-based ad hoc network. In this paper, we first propose a localized greedy algorithm that discovers for each multicast receiver the proxy with the highest 3G downlink channel rate. We discover that due to capacity limitations and interference of the ad hoc relay network, maximizing the 3G downlink data rate of each multicast receiver's proxy does not lead to maximum throughput for the multicast group. We then show that the optimal ICAM problem is NP-hard, and derive a polynomial-time 4{\hbox{-}}\rm approximation algorithm for the construction of the multicast forest. This bound holds when the underlying wireless MAC supports broadcast or unicast, single rate or multiple rates (4(1+\epsilon) approximation scheme for the latter), and even when there are multiple simultaneous multicast sessions. Through both analysis and simulations, we show that our algorithms achieve throughput gains up to 840 percent for 3G downlink multicast with modest overhead on the 3G uplink.
Separable Routes to Human Memory Formation: Dissociating Task and Material Contributions in the Prefrontal Cortex
Authors: Gagan S. Wig, Michael B. Miller, Alan Kingstone, William M. Kelley
Venue: Journal of Cognitive Neuroscience (2004)

The present study used fMRI to investigate functional dissociations across frontal regions during incidental memory formation. Subjects were imaged while encoding materials with differential access to phonological codes (nonfamous faces and nameable famous faces) under task conditions that encouraged elaborate (deep) or superficial (shallow) encoding strategies. Results revealed a functional dissociation between dorsal posterior regions of the prefrontal cortex (BA 6/44) that were sensitive to material type (famous vs. nonfamous), irrespective of the encoding task, and ventral anterior regions of the prefrontal cortex (BA 45/47) that were uniquely sensitive to task demands (deep vs. shallow), regardless of material type. Further, subjects realized a memorial advantage to the extent that they recruited these dissociable frontal regions. These results demonstrate a posterior/anterior dichotomy in the frontal cortex that underlies separable code-based routes to human memory formation.
A Semantic Matchmaking Method of Web Services Based on SHOIN^+ (D)*
Authors: Hai Wang, Zengzhi Li
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Capability matchmaking is one of the key issue in the field of web services research community because it is the basis of doing service discovery and composition. Generally, the matchmaking of web services involves the so called IOPE matchmaking. The method used in matchmaking IO is very different from the one used in matchmaking of PE. And the semantics reflected by IO is also very different from PE. So they need to be treated in different way.The match-making of IO has got some good results but the PE is still lack of method to tract. In this paper we propose a method based on Description Logic to meet this problem.
Educating middle and high school students in space operations: the simulation approach
Authors: Mansooreh Mollaghasemi, Michael Georgiopoulos, Anne Donnelly, Dayana Cope, Martin Steele
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper describes a proposed pilot educational program to teach middle and high school students the space shuttle processing operations. This pilot program involves a partnership of two Universities (University of Central Florida and University of Florida), a small business (Productivity Apex), and three middle/high schools in the Florida area.Our proposed pilot program is an innovative approach designed to teach students about the complexities of space vehicle processing through a simulation environment. Through the many planned activities that we propose to achieve our goal, we will be able to introduce middle and high school students to aerospace operations, excite them about space education, and enthusiastically engage them in science and technology related projects. The ultimate objective of this effort is to motivate middle and high school students to pursue careers in Science, Technology, Engineering, and Math (STEM) fields.
Mathematical manipulatives as designed artifacts: the cognitive, affective, and technological dimensions
Authors: Michael Eisenberg, Julie DiBiase
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

Mathematical manipulatives---tangible objects with a pedagogical purpose---have become popular tools in mathematics education. But typically, the notion of a "manipulative" carries with it a number of additional assumptions: that these objects are designed for elementary (as opposed to advanced) mathematics instruction; that they have little in the way of emotional meaning for their users; and that they are relatively simple, "low-tech" objects. In this paper we challenge these assumptions. Drawing on our experiences in two related projects in educational computing, we suggest that manipulatives may be designed for advanced mathematical topics; that they may offer creative (and thus affectively important) opportunities for students; and that they may be designed in ways that accompany or incorporate computational media.
A secure and robust approach to scalable video authentication
Authors: Qibin Sun, Dajun He, Zhishou Zhang, Qi Tian
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In this paper, we present a secure and robust content authentication scheme for scalable video streaming. In our authentication scheme we consider three common video transcoding methods as acceptable content manipulations, when the streaming bit-rate needs to be reduced, namely frame resizing, frame dropping and multi-cycle coding. By employing error correction coding (ECC) in different ways, the proposed scheme is insensitive to those incidental distortions introduced during the transcoding (i.e., robust) while is still sensitive to other intentional distortions such as frame alterations and insertion (i.e., secure). One key feature in our scheme is that it achieves an end-to-end authentication independent of transcoding infrastructure and obtains a good compromise between system robustness and security.
A Learning Object on Computational Intelligence
Authors: Fabio A. P. Reis, Igor C. Felix, Silvio L. Stanzani, Ricardo J. G. B. Campello, Leandro N. de Castro, Hermes Senger, Marta C. Rosatelli
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper presents a Learning Object in the domain of Computational Intelligence that can be used in graduate and undergraduate courses. Additionally, it can be reused in other contexts and scenarios, such as a distance learning course on Artificial Intelligence.
Realistic internet traffic simulation through mixture modeling and a case study
Authors: Song Luo, Gerald A. Marin
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Internet background traffic modeling and simulation is the main challenge when constructing a test environment for network intrusion detection experiments. However, a realistic simulation of network traffic through analytical models is difficult, because the classic distributions are usually ineffective when applied to traffic-related random variables. A modeling and simulation approach using heavy-tailed mixture distributions is introduced in this paper. In the case study, this approach is used to build analytical models for random variables of several major Internet applications (FTP, HTTP, SMTP, POP3, SSH) of a campus network. Several statistical features of an NS2 simulation are compared against those of the traffic traces being simulated. The comparison indicates that the simulation is statistically similar to the real traffic.