ppxscal/embedding_network huggingface dataset:
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Venue: Applications, Technologies, Architectures, and Protocols for Computer Communication (2006)

It is my pleasure to welcome you to Pisa for the 2006 edition of the ACM SIGCOMM conference. In keeping with our tradition, the conference will open with a keynote speech by the latest winner of the SIGCOMM Award, an honor that this year goes to Domenico Ferrari.Organizing a conference of the size and reputation of SIGCOMM is always a challenge, and it would not have been possible without the help of many people and organizations, all of which I would like to thank. It is my pleasure to start with the Università di Pisa, which not only provided a huge help with logistics, equipment, administrative resources, and even some funding on it's own, but also let me and the Local Organization Chair, Giovanni Stea, spend a large amount of our time working on the organization of SIGCOMM 2006.In addition to the work of many individuals, this year we were extremely lucky, as we could rely on generous help from a number of companies and institutions. Our Gold Supporters are Cisco Systems and the National Science Foundation, who both provided funding for the Student Travel Grants. (Travel Grants also were made possible by the new SIGCOMM-sponsored Geodiversity Travel Grants program.) Silver Supporters are Microsoft Research, Intel, and Alcatel, who partly supported various social events. Last but not least, we have a large number of Bronze Supporters: AT&T, Digium, Google, HP, IIJ, Nokia, Tiscali and the Università di Pisa.I am of course indebted to the other people involved in the event in various roles, who also invested many, many days on their tasks: Tom Anderson, Kenjiro Cho, Marco Conti, Jaudelice C. de Oliveira, Christophe Diot, Chris Edmondson-Yurkanan, Serge Fdida, Gianluca Iannaccone, Brad Karp, Laurent Mathy, Nick McKeown, Fran Spinola, Joe Touch, and Ellen Zegura. The team worked in close cooperation over a period of almost a year, exchanging thousands of emails (diligently archived for the benefit of next year's committee).For several of us, this was our first experience with this kind of work, and that made the task even more challenging. We would not have succeeded without help from the SIG officers, Jennifer Rexford and Tilman Wolf, and last year's General Chair, Roch Guerin, who was a precious resource for us in explaining how the process was run in the past.
Sonic panoramas: experiments with interactive landscape image sonification
Authors: Eric Kabisch, Falko Kuester, Simon Penny
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

This paper describes research into the sonification of large-scale landscape imagery. Techniques for image sonification are coupled with users' physical navigation of the image data and a visual representation of the correspondence between the image and sound. One application of this research, an interactive art installation titled Sonic Panoramas, is discussed. Through the use of vision-based motion tracking, immersive projection, image analysis and real-time spatialized sound, a multi-modal representation of landscape image data is deployed.
Reservation storage policy for AS/RS at air cargo terminals
Authors: Chulung Lee, Huei Chuen Huang, Paul Goldsman, Bin Liu, Zhiyong Xu
Venue: Proceedings of the 37th conference on Winter simulation (2005)

At air cargo terminals, the operations of an automatic storage and retrieval system (AS/RS) have certain special characteristics that both cargo arrival rates and storage duration are stochastic, and the probability distributions can only come from the empirical data. According to such particularities, this paper proposes a class-based reservation storage policy for AS/RS at air cargo terminals and an analytical model is developed. Two classes are investigated and a certain storage spaces are reserved for one priority class in such a way that the one-way travel time of S/R machine is minimized. The optimal reservation space is obtained by numerical searching. A simulation model is developed and the simulation results validate the optimal solution from the analytical model.
SOA-Aware Authorization Control
Authors: Christian Emig, Heiko Schandua, Sebastian Abeck
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

The question how to handle authorization of digital identities in a service-oriented architecture (SOA) remains an open issue. In this paper we present a design pattern for the integration of legacy systems with SOA using out-of-the-box (unmodified) application servers and discuss how the architecture has to be extended by an Identity Management (IdM) infrastructure. We claim that the IdM infrastructure itself must be designed in a service-oriented way to fit into the overall SOA approach. We introduce a possibility how to decouple the policy enforcement point from the application server and propose an architectural design pattern to seamlessly integrate the SOA's business-related functionality and the IdM infrastructure. An implementation case study illustrates how to apply the invocation pattern for secured web services.
Event-driven, hybrid particle-in-cell simulation: a new paradigm for multi-scale plasma modeling
Authors: Y. A. Omelchenko, H. Karimabadi
Venue: Journal of Computational Physics (2006)

Particle-in-cell models have become standard computational tools for studying complex nonlinear phenomena in space and laboratory plasmas. These simulations are normally very compute-intensive since they require time integration of strongly coupled equations governing the field and particle dynamics. As a result, despite a significant progress in hardware technology, particle-in-cell codes are rarely used to simulate long-time evolution of large-scale systems with strongly varying temporal and spatial scales. We propose an alternative paradigm to time stepping, which is traditionally used for time integration of such systems. This new approach is based on explicit discrete-event simulation technology. It offers distinct advantages over synchronous time stepping: (i) updates of individual macro-particles and discrete field elements are performed asynchronously, (ii) local time increments are determined and self-adaptively adjusted in time through scheduling and execution of physically meaningful local updates ("events"). The event-driven time advance is accurate, free of the global Courant condition, stable, parallelizable, extendable to multiple dimensions and well suited for nonuniform spatial meshes. We demonstrate the new method on a one-dimensional hybrid particle-in-cell model with applications to several plasma discontinuities, including a high-Mach-number fast magnetosonic shock and the associated plasma turbulence.
Congestion tolls as utility alignment between agent and system optimum
Authors: Ana L. C. Bazzan, Robert Junges
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

In multi-agent systems, greedly agents can harm the performance of the overall system. This is the case of traffic commuting scenarios: drivers repete their actions trying to adapt to daily changes. In this domain, there are several proposals to achieve the traffic network equilibrium. Recently, the focus has shifted to information provision in several forms as a way to balance the load. Most of these works make strong assumptions such as the traffic authority and/or drivers having perfect information. In reality, the information the central control provides to drivers contains estimation errors. The goal of this paper is to propose a socially efficient load balance by internalizing social costs caused by agents' actions. Two issues are addressed: the model of information provision accounts for information imperfectness, and the equilibrium which emerges out of drivers route choices is close to the system optimum due to mechanisms of road pricing. The model can then be used for traffic authorities to simulate the effects of information provision and toll charging.
A stochastic on-line model for shipment date quoting with on-time delivery guarantees
Authors: Yunpeng Pan, Leyuan Shi
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The paper introduces a new model for shipment date quoting with potential applications in E-commerce. First, a customer sends to the vendor a request for an item advertised at a certain price on the company's web site. Upon receiving the request, the vendor immediately quotes the customer a no-later-than shipment date for the requested item, taking into account the amount of time to produce the item and any outstanding order previously placed but not yet fulfilled. If the quoted date is deemed acceptable, the customer subsequently places an order for the item; otherwise, the customer rejects the quote and looks for an alternative vendor (the deal is thus lost). The back-end of the quoting system is a single server production system. We propose heuristics that account for the intricate combinatorics of the server scheduling problem, as well as the uncertainty in customer demand and customer behavior.
Agent Based Multi-attribute Negotiation for Large-Scale Construction Project Supply Chain Coordination
Authors: Xiaolong Xue, Yaowu Wang, Qiping Shen
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

This research designs a multi-agent based multi-attribute negotiation framework for large-scale construction projecs (LCP) supply chain coordination (SCC) through adopting the agent technology and regarding supply chain as a typical multi-agent system. Since different members in the supply chain have different preferences on the decision attributes (such as cost, time, quality, safety and environment), a multi-attribute negotiation mechanism is established by constructing the multi-attribute negotiation model, describing the negotiation process, and designing negotiation protocol. Finally, a prototype system is developed and tested on a hypothetical LCP. The experiment indicates that the negotiation mechanism can solve problems in LCP supply chain and provides a solution to LCP SCC.
Lost in Translation: Theory and Practice in Cryptography
Authors: Kenneth G. Paterson, Arnold K. L. Yau
Venue: IEEE Security and Privacy (2006)

When two cultures clash, an air passenger may be wished a good "fright," or one may end up regretting his karaoke performance after a sake too many. For theoreticians and practioners in information security, however, their lack of mutual understanding may lead to more serious consequences.
Classifying Multimedia Resources Using Social Relationships
Authors: Stefan Foll, Jens Pontow, David Linner, Ilja Radusch
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

The complexity of managing multimedia data within extensive social networks is constantly increasing. In particular, the mass of shared user generated content and strong multimedia diversity lead to a vast amount of heterogeneous and unstructured information. To preserve accuracy, availability, and personalization of content provided to users, we introduce a framework realizing content classification and management based on metadata such as social relationships. The framework enables the easy development of multimedia authoring systems focused on flexible multimedia creation, distributed user collaboration, and convenient content retrieval. Finally, we describe "Online Community Life (OCL)", a ubiquitous blogging portal for the distribution of multimedia content along virtual communities.
A New Formulation for Shape from Shading for Non-Lambertian Surfaces
Authors: Abdelrehim H. Ahmed, Aly A. Farag
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Lambert's model for diffuse reflection is a main assumption in most of shape from shading (SFS) literature. Even with this simplified model, the SFS is still a difficult problem. Nevertheless, Lambert's model has been proven to be an inaccurate approximation of the diffuse component of the surface reflectance. In this paper, we propose a new solution of the SFS problem based on a more comprehensive diffuse reflectance model: the Oren and Nayar model. In this work, we slightly modify this more realistic model in order to take into account the attenuation of the illumination due to distance. Using the modified non-Lambertian reflectance, we design a new explicit Partial Differential Equation (PDE) and then solve it using Lax-Friedrichs Sweeping method. Our experiments on synthetic data show that the proposed modeling gives a unique solution without any information about the height at the singular points of the surface. Additional results for real data are presented to show the efficiency of the proposed method . To the best of our knowledge, this is the first non-Lambertian SFS formulation that eliminates the concave/convex ambiguity which is a well known problem in SFS.
Time-locked Perceptual Fading Induced by Visual Transients
Authors: Ryota Kanai, Yukiyasu Kamitani
Venue: Journal of Cognitive Neuroscience (2003)

After prolonged fixation, a stationary object placed in the peripheral visual field fades and disappears from our visual awareness, especially at low luminance contrast (the Troxler effect). Here, we report that similar fading can be triggered by visual transients, such as additional visual stimuli flashed near the object, apparent motion, or a brief removal of the object itself (blinking). The fading occurs even without prolonged adaptation and is time-locked to the presentation of the visual transients. Experiments show that the effect of a flashed object decreased monotonically as a function of the distance from the target object. Consistent with this result, when apparent motion, consisting of a sequence of flashes was presented between stationary disks, these target disks perceptually disappeared as if erased by the moving object. Blinking the target disk, instead of flashing an additional visual object, turned out to be sufficient to induce the fading. The effect of blinking peaked around a blink duration of 80 msec. Our findings reveal a unique mechanism that controls the visibility of visual objects in a spatially selective and time-locked manner in response to transient visual inputs. Possible mechanisms underlying this phenomenon will be discussed.
Analysis of a multi-server retrial queue with search of customers from the orbit
Authors: Srinivas R. Chakravarthy, A. Krishnamoorthy, V. C. Joshua
Venue: Performance Evaluation (2006)

We consider a multi-server retrial queueing model in which customers arrive according to a Markovian arrival process (MAP). An arriving customer finding a free server enters into service immediately; otherwise the customer enters into an orbit of infinite size. An orbiting customer competes for service by sending out signals at random times until a free server is captured. The inter-retrial times are exponentially distributed with intensity depending on the number of customers in the orbit. Upon completion of a service, with a certain probability the server searches for an orbiting customer. Assuming the search time to be negligible, and the service and retrial times to be exponentially distributed, we perform the steady state analysis of the model using direct truncation and matrix-geometric approximation. Efficient algorithms for computing various steady state performance measures and illustrative numerical examples are presented.
GPLAG: detection of software plagiarism by program dependence graph analysis
Authors: Chao Liu, Chen Chen, Jiawei Han, Philip S. Yu
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Along with the blossom of open source projects comes the convenience for software plagiarism. A company, if less self-disciplined, may be tempted to plagiarize some open source projects for its own products. Although current plagiarism detection tools appear sufficient for academic use, they are nevertheless short for fighting against serious plagiarists. For example, disguises like statement reordering and code insertion can effectively confuse these tools. In this paper, we develop a new plagiarism detection tool, called GPLAG, which detects plagiarism by mining program dependence graphs (PDGs). A PDG is a graphic representation of the data and control dependencies within a procedure. Because PDGs are nearly invariant during plagiarism, GPLAG is more effective than state-of-the-art tools for plagiarism detection. In order to make GPLAG scalable to large programs, a statistical lossy filter is proposed to prune the plagiarism search space. Experiment study shows that GPLAG is both effective and efficient: It detects plagiarism that easily slips over existing tools, and it usually takes a few seconds to find (simulated) plagiarism in programs having thousands of lines of code.
Generalized methods for algorithm development on optical systems
Authors: A. Al-Ayyoub, A. Awwad, K. Day, M. Ould-Khaoua
Venue: The Journal of Supercomputing (2006)

A number of recent studies have revealed that the Optical Transpose Interconnection Systems (or OTIS) are promising candidates for future high-performance parallel computers. In this paper, we present and evaluate two general methods for algorithm development on the OTIS. The proposed methods are general in the sense that no specific factor network or problem domain is assumed. The proposed methods allow efficient mapping of a wide class of algorithms into the OTIS. These methods are based on grids and pipelines as popular structures that support a vast body of parallel applications including linear algebra, divide-and-conquer type of algorithms, sorting, and FFT computation. Timing models for measuring the performance of the proposed methods are also provided. Through these models, the performance of various algorithms on the OTIS are evaluated and compared with their counterparts on conventional electronic interconnection systems. This study confirms the viability of the OTIS as an attractive alternative for large-scale parallel architectures. Finally, we show how the proposed methods can be used to design parallel algorithms for linear algebra on the OTIS.
MPEG-4: one multimedia standard to unite all
Authors: K. Karpouzis, A. Raouzaiou, P. Tzouveli, S. Iaonnou, S. Kollias
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

A wide variety of multimedia coding and representation standards have emerged during the past years, in the quest to establish a common denominator for both the research community and the related industry to incorporate results and algorithms in commercial products. MPEG-4 aims to improve where past standards proved ineffective or isolated and integrate different modalities to supply different forms of material, suitable for diverse applications and devices. In this paper, we describe the general concepts that MPEG-4 builds upon and how they are related to multi-user interactive environments and gaming.
Polymorphism and separation in hoare type theory
Authors: Aleksandar Nanevski, Greg Morrisett, Lars Birkedal
Venue: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming (2006)

In previous work, we proposed a Hoare Type Theory (HTT) which combines effectful higher-order functions, dependent types and Hoare Logic specifications into a unified framework. However, the framework did not support polymorphism, and ailed to provide a modular treatment of state in specifications. In this paper, we address these shortcomings by showing that the addition of polymorphism alone is sufficient for capturing modular state specifications in the style of Separation Logic. Furthermore, we argue that polymorphism is an essential ingredient of the extension, as the treatment of higher-order functions requires operations not encodable via the spatial connectives of Separation Logic.
A Multimedia-Specific Approach to WS-Agreement
Authors: Wilfried Jouve, Julien Lancia, Charles Consel, Calton Pu
Venue: Proceedings of the European Conference on Web Services (2006)

WS-Agreement offers a general language and protocol to establish agreements between two parties. In principle, this generality enables a wide variety of domains to be covered. Yet, agreement terms need to be developed for each domain, to allow specific requirements to be expressed. When addressing a domain, one can either invent new agreement terms, or leverage on existing approaches. This paper proposes to extend the WS-Agreement framework to address multimedia content negotiation. This work relies on an existing protocol for multimedia negotiation, widely used in networking and telecommunications, named Session Description Protocol. This protocol is used as a framework to cover a variety of media (audio, video, images...). Besides building on a well-proven technology, our approach naturally allows the interfacing between the Web Services realm and the networkingtelecommunications realm, creating a host of new usage opportunities. Our work is illustrated by two case studies: image/audio downloading and audio/video streaming.
Image reconstruction from a complete set of similarity invariants extracted from complex moments
Authors: F. Ghorbel, S. Derrode, R. Mezhoud, T. Bannour, S. Dhahbi
Venue: Pattern Recognition Letters (2006)

Various types of moments have been used to recognize image patterns in a number of applications. However, only few works have paid attention to the completeness property of the invariant descriptor set, which is of fundamental importance from the theoretical as well as the practical points of views. This paper proposes a systematic method to extract a complete set of similarity invariants (translation, rotation and scale), by means of some linear combinations of complex moments. The problem of image reconstruction from a finite set of its moment invariants is then examined by exploiting the link between the discrete Fourier transform of an image and its complex moments. Experimental results are presented that confirm theoretical properties as well as numerical effectiveness of the method.
E-learning: Biometrics as a Security Factor
Authors: Kornelije Rabuzin, Miroslav Baca, Mario Sajko
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

Nowadays a new form of learning, so called elearning is being introduced. The motives for this kind of learning are better time use, decrease of educational costs, more effective learning and learning management from the user's side. This form of distance learning is supported by information- communication technology (ICT) and fast computer networks. Biometrics is on the other side becoming a principal method of identification and verification in a "networked society". In order to implement absolute security by using biometric features, it is necessary to combine several different biometric traits. There is no ideal biometric feature, nor is it possible to achieve by means of currently available biometric features and available technology. Since the research about the issue of security and privacy in e-learning is still hardly concerned, the objective of this paper is to describe some possibilities of using biometric features and solutions in the field of elearning systems.