ppxscal/embedding_network huggingface dataset:
Distributed collaborative key agreement and authentication protocols for dynamic peer groups
Authors: Patrick P. C. Lee, John C. S. Lui, David K. Y. Yau
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

We consider several distributed collaborative key agreement and authentication protocols for dynamic peer groups. There are several important characteristics which make this problem different from traditional secure group communication. They are: 1) distributed nature in which there is no centralized key server; 2) collaborative nature in which the group key is contributory (i.e., each group member will collaboratively contribute its part to the global group key); and 3) dynamic nature in which existing members may leave the group while new members may join. Instead of performing individual rekeying operations, i.e., recomputing the group key after every join or leave request, we discuss an interval-based approach of rekeying. We consider three interval-based distributed rekeying algorithms, or interval-based algorithms for short, for updating the group key: 1) the Rebuild algorithm; 2) the Batch algorithm; and 3) the Queue-batch algorithm. Performance of these three interval-based algorithms under different settings, such as different join and leave probabilities, is analyzed. We show that the interval-based algorithms significantly outperform the individual rekeying approach and that the Queue-batch algorithm performs the best among the three interval-based algorithms. More importantly, the Queue-batch algorithm can substantially reduce the computation and communication workload in a highly dynamic environment. We further enhance the interval-based algorithms in two aspects: authentication and implementation. Authentication focuses on the security improvement, while implementation realizes the interval-based algorithms in real network settings. Our work provides a fundamental understanding about establishing a group key via a distributed and collaborative approach for a dynamic peer group.
Project mole or burrowing from within for fun & profit
Authors: Robert E. D. Woolsey
Venue: Issue 20 (February 1976) (1976)

For some years now it has been the custom of the operations research and the management science societies to invite me for comic relief---that is, I talk about applications. I realize this is a new idea, but I keep hoping it will catch on. I teach at the Colorado School of Mines, and since we are not a university, we do not have to pretend to educate anyone. Our job is to turn out a product for which there is some demand. This also is a new idea in American education which I hope will catch on.
Material handling resource utilization simulation study for stamping plant
Authors: Edward J. Williams, Onur M. Ulgen, Sheldon Bailiff, Ravindra Lote
Venue: Proceedings of the 38th conference on Winter simulation (2006)

This paper describes the application of dynamic simulation to evaluate material handling resource utilization for a stamping plant in the automotive industry. The other objective of this study was evaluation of throughput relative to press schedules, shift patterns, the number of material handling resources (i.e. fork truck and tugger train drivers), and storage inventory levels. This dynamic simulation study enabled plant managers to balance the driver utilization with respect to time and to accommodate typical press schedules to achieve desired throughput levels.
Partial evaluation of lazy functional logic programs: Thesis
Authors: Pascual Julián Iranzo
Venue: AI Communications (2003)

This paper abstracts the contents of a PhD dissertation entitled &ldquo;Partial Evaluation of Lazy Functional Logic Programs&rdquo; which has been defended at the Technical University of Valencia, promoted by Prof. Mar&iacute;a Alpuente. Partial evaluation is an automatic program transformation technique that aims the specialization of programs, with regard to parts of their input, while preserving program semantics. Partial evaluation has been first applied to functional logic languages in [6] where it is shown that the correctness of the transformation is dependent of the narrowing strategy used by the specialization algorithm. This thesis studies how to solve the problems arisen when lazy narrowing (a valuable strategy for Functional Logic Programming) is used as the basic operational mechanism during the partial evaluation process. Also, we develop some methods that improve the efficiency of the specialization.
An extensible, lightweight architecture for adaptive J2EE applications
Authors: Ian Gorton, Yan Liu, Nihar Trivedi
Venue: Proceedings of the 6th international workshop on Software engineering and middleware (2006)

Server applications with adaptive behaviors can adapt their functionality in response to environmental changes, and significantly reduce the on-going costs of system deployment and administration. However, developing adaptive server applications is challenging due to the complexity of server technologies and highly dynamic application environments. This paper presents an architecture framework, known as the Adaptive Server Framework (ASF). ASF provides a clear separation between the implementation of adaptive behaviors and the server application business logic. This means a server application can be cost effectively extended with programmable adaptive features through the definition and implementation of control components defined in ASF. Furthermore, ASF is a lightweight architecture in that it incurs low CPU overhead and memory usage. We demonstrate the effectiveness of ASF through a case study, in which a server application dynamically determines the resolution and quality to scale an image based on the load of the server and network connection speed. The experimental evaluation demonstrates the performance gains possible by adaptive behaviors and the low overhead introduced by ASF.
Legitimacy and the virtualization of dispute resolution
Authors: Laurens Mommers
Venue: Artificial Intelligence and Law (2005)

For any type of institutionalized dispute resolution, legitimacy is a crucial characteristic, as legitimate dispute resolution promotes, for instance, general trust in state institutions and participation in economic activity. A lack of legitimacy will prevent the acceptance of dispute resolution, and thereby its use. Although many textbook definitions limit the meaning of legitimacy to legality, in its every-day use legitimacy is in fact a much broader concept. It encompasses different criteria relating to the nature of dispute resolution: is a form of dispute resolution properly embedded in a reliable institutional environment?, and: are its outcomes properly underpinned? Virtualization concerns the ways in which information and communication technologies affect administration, communication, accessibility and assessment. As an example of virtualization in dispute resolution, a scenario about on-line feedback is scrutinized. This scenario comprises the implementation of a feedback system to enable participants in an instance of dispute resolution to comment on various aspects of the dispute resolving process.
Improved solutions for some minimal-network test problems
Authors: W. M. Boyce, J. B. Seery, J. Breyer
Venue: Issue 16 (April 1974) (1974)

In a recent SIGMAP newsletter [1] J. Soukup and W. F. Chow proposed forty-six test problems for the "Problem fo Steiner": finding the shortest network which connects a given set of points. All of the problems were planar, and except for one 62-point set (#11), the number of points per problem ranged from 3 to 20. Soukup and Chow also provided for each problem the length of the shortest network known to them, and they asserted the optimality of 24 of their solutions, including all eleven of the three-and four-point problems.
Java Persistence with Hibernate
Authors: Christian Bauer, Gavin King
Venue:  (2006)

Persistence -- the ability of data to outlive an instance of a program -- is central to modern applications. Hibernate, the most popular Java persistence tool, provides automatic and transparent object/relational mapping so it's a snap to work with SQL databases in Java applications. Hibernate conforms to the new EJB 3.0 and Java Persistence 1.0 standards. Java Persistence with Hibernate explores Hibernate by developing an application that ties together hundreds of individual examples. You'll immediately dig into the rich programming model of Hibernate 3.2 and Java Persistence, working through queries, fetching strategies, caching, transactions, conversations, and more. You'll also appreciate the well-illustrated discussion of best practices in database design, object/relational mapping, and optimization techniques. In this revised edition of Manning's bestselling Hibernate in Action, authors Christian Bauer and Gavin King -- the founder of the Hibernate project -- cover Hibernate 3.2 in detail along with the EJB 3.0 and Java Persistence 1.0 standards.
Signatures versus histograms: Definitions, distances and algorithms
Authors: Francesc Serratosa, Alberto Sanfeliu
Venue: Pattern Recognition (2006)

The aim of this paper is to present a new method to compare histograms. The main advantage is that there is an important time-complexity reduction with respect to the methods presented before. This reduction is statistically and analytically demonstrated in the paper. The distances between histograms that we presented are defined on a structure called signature, which is a lossless representation of histograms. Moreover, the type of the elements of the sets that the histograms represent are ordinal, nominal and modulo. We show that the computational cost of these distances is O(z^') for the ordinal and nominal types and O(z^'^2) for the modulo one, z^' being the number of non-empty bins of the histograms. The computational cost of the algorithms presented in the literature depends on the number of bins of the histograms. In most of the applications, the obtained histograms are sparse; then considering only the non-empty bins drastically decreases the time consumption of the comparison. The distances and algorithms presented in this paper are experimentally validated on the comparison of images obtained from public databases and positioning of mobile robots through the recognition of indoor scenes (captured in a learning stage).
OpenVPN: Building and Integrating Virtual Private Networks
Authors: M Feilner
Venue:  (2006)

This book is a comprehensive guide to using OpenVPN for building both secure VPNs. The book is written in a very friendly style that makes this complex topic easy and a joy to read. It first covers basic VPN concepts, then moves to introduce basic OpenVPN configurations, before covering advanced uses of OpenVPN. This book is for both experienced and new OpenVPN users.
Finite difference approximations of first derivatives for two-dimensional grid singularities
Authors: Herwig A. Grogger
Venue: Journal of Computational Physics (2006)

Explicit finite difference approximations of first derivatives are developed for two-dimensional three-way and five-way grid singularities. The schemes for three-way singularities also apply for six-way singularities. The development objectives are such that the finite difference schemes are non-dissipative and compatible with regular difference approximations for convection dominated phenomena. Special emphasis is given to the directional dependency of numerical phase speeds and stability limits for explicit time integration. For that purpose, free coefficients are used to minimize the isotropy error of the numerical phase velocity. It is shown that numerical phase speeds and stability limits are almost isotropic. Hence, employment of the proposed schemes is nearly independent of the local orientation of the differencing stencil. The time step limits are greater than those of regular finite differences, indicating that the overall time step of a computation is not reduced by employing the proposed schemes. The developed schemes for three-way singularities are of second, fourth and sixth order of accuracy, whereas the five-way difference approximations are second and fourth order accurate, respectively.The spectral characteristics, the formal order of accuracy and the stability limits of the proposed schemes imply that they can favorably be used in combination with regular difference approximations of the same order of accuracy on block-structured grids.
Directional features in online handwriting recognition
Authors: Claus Bahlmann
Venue: Pattern Recognition (2006)

The selection of valuable features is crucial in pattern recognition. In this paper we deal with the issue that part of features originate from directional instead of common linear data. Both for directional and linear data a theory for a statistical modeling exists. However, none of these theories gives an integrated solution to problems, where linear and directional variables are to be combined in a single, multivariate probability density function. We describe a general approach for a unified statistical modeling, given the constraint that variances of the circular variables are small. The method is practically evaluated in the context of our online handwriting recognition system frog on hand and the so-called tangent slope angle feature. Recognition results are compared with two alternative modeling approaches. The proposed solution gives significant improvements in recognition accuracy, computational speed and memory requirements.
CCSP CSVPN Exam Cram 2 (Exam Cram 642-511)
Authors: David Minutella
Venue:  (2003)

The Exam Cram method of study focuses on exactly what you need to get certified now.In this book you'll learn how to: Develop a solid foundation of VPN technologies and apply them to Cisco's VPN hardware and software platforms Identify the components, performance, and features of Cisco VPN hardware appliances Initialize and configure the Cisco VPN 3000 Concentrator for remote access utilizing preshared keys for authentication Configure Cisco VPN 3000 Concentrator for remote access using digital certificates Understand and enable the advanced features of the Cisco VPN 3000 Concentrator Administer and monitor the Cisco VPN 3000 Concentrator Enable the Cisco VPN 3000 Concentrator's firewall policy feature to interact with popular firewall clients Identify the features and benefits of the Cisco VPN 3002 Hardware Client Initialize and configure the Cisco VPN 3002 Hardware Client Recognize the features and functionality of the Cisco VPN Unity Software Client Install, configure, and monitor the Cisco VPN Unity Software Client
A difficult small integer program
Authors: Harvey M. Salkin, Susumu Morito
Venue: Issue 20 (February 1976) (1976)

An apparently difficult, yet small, integer program has been tested on what we believe to be is a most efficient computer system containing a group theoretic algorithm. Although a good solution was produced, the code did not converge in at most thirty seconds of UNIVAC 1108 time, and thus the integer program can serve as a principal test problem. The model represents a real world chemical blending situation and was received from E. I. DuPont DeNemours & Co., Inc.
Coloring octrees
Authors: Udo Adamy, Michael Hoffmann, József Solymosi, Miloš Stojaković
Venue: Theoretical Computer Science (2006)

An octree is a recursive partition of the unit cube, such that in each step a cube is subdivided into eight smaller cubes. Those cubes that are not further subdivided are the leaves of the octree. We consider the problem of coloring the leaves of an octree using as few colors as possible such that no two of them get the same color if they share a facet. It turns out that the number of colors needed depends on a parameter that we call unbalancedness. Roughly speaking, this parameter measures how much adjacent cubes differ in size. For most values of this parameter we give tight bounds on the minimum number of colors, and extend the results to higher dimensions.
Centralization and decentralization of decision-making in transportation networks
Authors: M. R. PINOCHET
Venue: Issue 20 (February 1976) (1976)

The research reported in this paper is part of the author's Ph. D. thesis at The Institute of Mathematical Statistics and Operations Research, The Technical University of Denmark under the direction of Professor Arne Jensen.
Feature representation and discrimination based on Gaussian mixture model probability densities-Practices and algorithms
Authors: Pekka Paalanen, Joni-Kristian Kamarainen, Jarmo Ilonen, Heikki Kälviäinen
Venue: Pattern Recognition (2006)

This study promotes the use of statistical methods in specific classification tasks since statistical methods have certain advantages which advocate their use in pattern recognition. One central problem in statistical methods is estimation of class conditional probability density functions based on examples in a training set. In this study maximum likelihood estimation methods for Gaussian mixture models are reviewed and discussed from a practical point of view. In addition, good practices for utilizing probability densities in feature classification and selection are discussed for Bayesian and, more importantly, for non-Bayesian tasks. As a result, the use of confidence information in the classification is proposed and a method for confidence estimation is presented. The propositions are tested experimentally.
Classification by evolutionary ensembles
Authors: Xiao Wang, Han Wang
Venue: Pattern Recognition (2006)

This paper is about building an ensemble of classifiers each of which is trained based on a particular weighting over the training examples (a weighting is a set of weights associated with the examples). The task concerns search in a tremendous weighting space. In this view we propose to incorporate a genetic algorithm (GA). It performs a wide yet efficient search for appropriate weightings (chromosomes). The difference from a traditional GA is that all the weightings throughout evolution will be exploited to form the final ensemble, not just the best weighting. Our algorithm is tested on the UCI benchmark data sets and used to design a face detection system. Robust and consistently accurate classification is experienced. Comparative results with two other algorithms, i.e. AdaBoost and Bagging, are also given.
SCJP Sun Certified Programmer for Java 6 Practice Exams (Exam 310-065), 1 edition
Authors: Katherine Sierra, Bert Bates
Venue:  (2010)

Rigorous practice for the number-one certification for Java programmers--from the co-developers of the examCo-written by bestselling Java certification authors and the co-developers of the SCJP exam, this book features four complete practice exams, totaling more than 800 questions, covering all of the topics on the latest revision to the Sun Certified Programmer for Java exam.No other book provides the same level of up-to-date coverage of all the official exam item types and formats, including new test items being released in 2009. In-depth explanations of both the correct and incorrect answers are included.
Engineering efficient metric indexes
Authors: Kimmo Fredriksson
Venue: Pattern Recognition Letters (2007)

We give efficient algorithms and index data structures for range search in general metric spaces. We give a simple methods to make almost any existing algorithm memory adaptive, improving the search the more memory is available. For vector spaces and metric space of strings we show how several distances can be computed in bit-parallelly, in sequential computer, and use the result to improve the search performance. This method works especially well with approximate range queries. The experimental results show that we can obtain order of magnitude improvements over the existing methods.
A Flexible Gaze Detection Method Using Single PTZ Camera
Authors: Masakazu Morimoto, Kensaku Fujii
Venue: IEICE - Transactions on Information and Systems (2007)

In this paper, we propose a flexible gaze detection method using single PTZ (Pan-Tilt-Zoom) camera. In this method, a PTZ camera traces user's face and measures position of their viewing point, so they do not need to fix their head in front of camera. Furthermore, to realize accurate gaze detection, we employ elliptical iris template matching. To reduce calculation amount of iris template matching, we get rough gaze direction by simple method on ahead to decide ellipse shape. In this paper, we also adapt to variation of facial orientations, which will affect to detect viewing position and gaze direction. After several experiments, we examine accuracy of gaze detection and head tracking ability of this system.
IBM System Storage San Volume Controller
Venue:  (2006)

This IBM Redbooks publication is an updated, detailed technical guide to the IBM System Storage SAN Volume Controller (SVC), a virtualization appliance solution that maps virtualized volumes visible to hosts and applications to physical volumes on storage devices. Each server within the SAN has its own set of virtual storage addresses, which are mapped to physical addresses. If the physical addresses change, the server continues running using the same virtual addresses it had before. This means that volumes or storage can be added or moved while the server is still running. IBM's virtualization technology improves management of information at the block level in a network, enabling applications and servers to share storage devices on a network. This book covers the following areas: - Storage virtualization high-level overview - Architecture of the SVC - Implementing and configuring the SVC - Using virtualization and advanced copy services functions - Migrating existing storage to the SVC The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The when, why and why not of the BETA programming language
Authors: Bent Bruun Kristensen, Ole Lehrmann Madsen, Birger Møller-Pedersen
Venue: Proceedings of the third ACM SIGPLAN conference on History of programming languages (2007)

This paper tells the story of the development of BETA: a programming language with just one abstraction mechanism, instead of one abstraction mechanism for each kind of program element (classes, types, procedures, functions, etc.). The paper explains how this single abstraction mechanism, the pattern, came about and how it was designed to be so powerful that it covered the other mechanisms. In addition to describing the technical challenge of capturing all programming elements with just one abstraction mechanism, the paper also explains how the language was based upon a modeling approach, so that it could be used for analysis, design and implementation. It also illustrates how this modeling approach guided and settled the design of specific language concepts. The paper compares the BETA programming language with other languages and explains how such a minimal language can still support modeling, even though it does not have some of the language mechanisms found in other object-oriented languages. Finally, the paper tries to convey the organization, working conditions and social life around the BETA project, which turned out to be a lifelong activity for Kristen Nygaard, the authors of this paper, and many others.
Inside discrete-event simulation software: how it works and why it matters
Authors: Thomas J. Schriber, Daniel T. Brunner
Venue: Proceedings of the 38th conference on Winter simulation (2006)

This paper provides simulation practitioners and consumers with a grounding in how discrete-event simulation software works. Topics include discrete-event systems; entities, resources, control elements and operations; simulation runs; entity states; entity lists; and entity-list management. The implementation of these generic ideas in AutoMod, SLX, and Extend is described. The paper concludes with several examples of "why it matters" for modelers to know how their simulation software works, including coverage of SIMAN (Arena), ProModel, and GPSS/H as well as the other three tools.