ppxscal/embedding_network huggingface dataset:
An Efficient Multi-Server Password Authenticated Key Agreement Scheme Using Smart Cards with Access Control
Authors: Chin-Chen Chang, Jui-Yi Kuo
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Due to the rapid development of science and techniques, people can remotely access computers over the networks. Thus, user authentication and key agreement become more and more important to ensure the legality of the user and the security of later communications, respectively. Because the number of servers providing the facilities for the user is usually more than one, the concept of multi-server protocols is introduced. On the Internet, each server usually provides various services, and each service provided by the server may not be accessed by the user. Hence, access control is required in the multi-service environment. In 2004, Juang proposed a multi-server authentication scheme with key agreement. However, access control is not taken into account in Juangýs proposed scheme, so we propose an efficient multiserver password authenticated key agreement scheme with access control in this article.
An empirical study of crosstalk in VDSM technologies
Authors: Shahin Nazarian, Massoud Pedram, Emre Tuncer
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

We perform a detailed study of various crosstalk scenarios in VDSM technologies by using a distributed model of the crosstalk site and make a number of key observations about the crosstalk effects in VLSI circuits. As example of these observations, we report that the combination of one crosstalk event at some site and another crosstalk event at a different site in the transitive fan-out of the first site may cause a slowdown or speedup of the circuit by an amount that can significantly exceed the sum of crosstalk effects caused by each site in isolation. As another example, we report that the common assumption that zero skew between the input transitions of aggressor and victim lines causes the worst case crosstalk effect is not always valid, and therefore, optimization or test based on such an assumption may be invalid. We also demonstrate the non-monotone behavior of the crosstalk effect with respect to the skew between the input transition of aggressor and victim lines. This work provides a first step toward the development of a new framework for timing analysis and test development in the presence of crosstalk events.
X-warehouse: building query pattern-driven data
Authors: Ji Zhang, Wei Wang, Han Liu, Sheng Zhang
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

In this paper, we propose an approach to materialize XML data warehouses based on the frequent query patterns discovered from historical queries issued by users. The schemas of integrated XML documents in the warehouse are built using these frequent query patterns represented as Frequent Query Pattern Trees (FreqQPTs). Using hierarchical clustering technique, FreqQPTs are clustered and merged to produce a specified number of integrated XML documents for actual data feeding. Maintenance issue of the data warehouse is also treated in this paper.
Segmentation of a Piece-Wise Planar Scene from Perspective Images
Authors: Allen Y. Yang, Shankar Rao, Andrew Wagner, Yi Ma
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We study and compare two novel embedding methods for segmenting feature points of piece-wise planar structures from two (uncalibrated) perspective images. We show that a set of different homographies can be embedded in different ways to a higher-dimensional real or complex space, so that each homography corresponds to either a complex bilinear form or a real quadratic form. Each embedding reveals different algebraic properties and relations of homographies. We give a closed-form segmentation solution for each case by utilizing these properties based on subspace-segmentation methods. These theoretical results show that one can intrinsically segment a piece-wise planar scene from 2-D images without explicitly performing any 3-D reconstruction. The resulting segmentation may make subsequent 3-D reconstruction much better-conditioned. We demonstrate the proposed methods with some convincing experimental results.
A Quality-of-Service Architecture for Future Grid Computing Applications
Authors: Lars-Olof Burchard, Barry Linnert, Felix Heine, Matthias Hovestadt, Odej Kao, Axel Keller
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

The Next Generation Grid applications will demand Grid middleware for a flexible negotiation mechanism supporting various ways of Quality-of-Service (QoS) guarantees. In this context, a QoS guarantee covers simultaneous allocations of various kinds of different resources, such as processor runtime, storage capacity, or network bandwidth, which are specified in the form of Service Level Agreements (SLA). Currently, a gap exists between the capabilities of Grid middleware and the underlying resource management systems concerning their support for QoS and SLA negotiation. In this paper we present an approach which closes this gap. Introducing the architecture of the Virtual Resource Manager, we highlight its main QoS management features like run-time responsibility, co-allocation, and fault tolerance.
Affection for cohabitant toy dolls: Research Articles
Authors: Naoko Matsumoto, Akifumi Tokosumi, Yoko Hirai
Venue: Computer Animation and Virtual Worlds (2004)

In an unprecedented phenomenon characterizing a new kind of relationship between humans and artifacts, a craze within middle-aged people for a toy doll is analyzed. In this paper, we deal with a talking toy doll. Specifically, 51 fan letters and 271 web site postings spontaneously sent to the toy company are analyzed in terms of their communicative functions and affective-cognitive contents. The results indicate that (a) the doll is simultaneously seen as both an artifact and a cohabitant (b) the doll owners attribute positive feelings in terms of both mental and physical states to the doll, (c) the doll owners believe that the utterances of the doll facilitate interaction with family members and with friends, and that (d) affections are evoked through owner actions toward the artifact. Based on these results, we propose a cognitive model of cognitive activity with artifacts. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Mastering Master Mind logically
Authors: Peter Koppstein
Venue: Issue 88 (April 1984) (1984)

Some readers of the recent note by Ehud Shapiro on "Playing Master Mind Logically" (SIGART 85, July 1983) may reasonably have concluded that Prolog was a suitable language for a "generate and test" strategy, as the author stated, but that perhaps there was something intrinsic to Prolog that made anything much more subtle unwieldy. The present note at any rate shows how a more "logical" strategy incorporating that previously described may readily be implemented without compromising the elegance and simplicity of Ehud Shapiro's original problem. A related approach, using templates as generators, is also described.
Roland VS Recorder Power!
Authors: Catherine Karayanis
Venue:  (2005)

Coverage includes- Chris "Hook" Skelnik has been playing drums for over 20 years. He has played hundreds of live gigs throughout the Midwest, and his drumming can be heard on various independent releases. He has been a Roland VS user since 1999, and uses various VS workstations at C4 Studios, his small project studio, specializing in solo artists, small band projects, and on-location recording. Skelnik is also an administrator and moderator for VSPlanet.com, the world's largest online community for VS users. He has written various technical documents and FAQs related to the VS workstations, and is the Editor of the VSPlanet Newsletter. Vince Gibbs has been a home recording enthusiast since purchasing his first multi-track recorder in 1983. He has developed training curricula for such companies as DirecTV, Cricket Wireless, and AOL to name a few. He has performed throughout Asia with top-40 bands as a singer, drummer, and bass player and has released his own independent CDs. Gibbs' passion is music, home recording and getting the best out of the gear he owns. He can also be found helping VS users at VSPlanet, the largest online community of VS users. Karl Frick has been an electronics aficionado since the early 1960s, and has been a part-time working musician since 1970. He started tinkering with multi-track recording in 1974, bouncing tracks back and forth between two stereo reel-to-reel decks. He worked as a musician, engineer, and equipment technician at a 24-track facility from 1978 to 1984. During a stint as a design engineer, Frick was awarded a patent for an electronic bell-playing system that was installed in dozens of churches and other facilities worldwide from 1988 to 1995. He loves to play bass guitar and Hammond organ, and has performed in bands that have opened for such diverse artists as B.B. King, John Hammond, and America. Targeted towards beginner to intermediate hard disk recorder users and enthusiasts looking for tips and information on Roland's successful and popular VS Recorder series. Offers comprehensive and in-depth coverage of how to record, edit, mix, and master audio recordings using the various models of the Roland VS hard disk recorder. Written by professional users who work with the Roland VS Recorder and provide users with all of the background and usage information they need to become proficient with the VS Recorder. Covers the history, theory, working methods, performance and usage tips, and additional peripherals to help the user get the most out of his or her Roland VS Recorder. Part of the successful Power! series of titles.
Parallel Polynomial Root Extraction on A Ring of Processors
Authors: Hamid Sarbazi-Azad
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16 (2005)

In this paper, a parallel algorithm for computing the roots of a given polynomial of degree n on a ring of processors is proposed. The algorithm implements Durand-Kerner's method and consists of two phases: initialization, and iteration. In the initialization phase all the necessary preparation steps are realized to start the parallel computation. It includes register initialization and initial approximation of roots requiring 3n-2 communications, 2 exponentiation, one multiplications, 6 divisions, and 4n-3 additions. In the iteration phase, these initial approximated roots are corrected repeatedly and converge to their accurate values. The iteration phase is composed of some iteration steps, each consisting of 3n communications, 4n+3 additions, 3n+1 multiplications, and one division.
Hughes Trainable Text Skimmer: description of the TTS system as used for MUC-3
Authors: Charles P. Dolan, Thomas V. Cuda, Seth R. Goldman, Alan M. Nakamura
Venue: Proceedings of the 3rd conference on Message understanding (1991)

The objective of the Hughes Trainable Text Skimmer (TTS) Project is to create text skimming software that: (1) can be easily re-configured for new applications, (2) improves its performance with use, and (3) is fast enough to process megabytes of text per day. The TTS-MUC3 system is our first full scale prototype.
infer: A Bayesian Inference Approach towards Energy Efficient Data Collection in Dense Sensor Networks
Authors: Gregory Hartl, Baochun Li
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

In this paper, we propose a novel approach for efficiently sensing a remote field using wireless sensor networks. Our approach, the infer algorithm, is fully distributed, has low overhead and saves considerable energy compared to using just the data aggregation communication paradigm. This is accomplished by using a distributed algorithm to put nodes into sleep mode for a given period of time, thereby trading off energy usage for the accuracy of the data received at the sink. Bayesian inference is used to infer the missing data from the nodes that were not active during each sensing epoch. As opposed to other methods that have been considered, such as wavelet compression and distributed source coding, our algorithm has lower overhead in terms of both inter-node communication and computational complexity. Our simulations show that on average our algorithm produces energy savings of 59% while still maintaining data that is accurate to within 7.9%. We also show how the parameters of the algorithm may be tuned to optimize network lifetime for a desired level of data accuracy.
Letters
Authors: Jim Maurer
Venue: Queue (2005)

The Queue interview with Pat Selinger (April 2005) was very interesting and a great review of major developments in database technology. I recognize how much computer science has advanced in the past 30 years, but when I read her answer about what areas she thinks need more research, I could not take from my mind that image of Captain Picard saying, &ldquo;Computer, investigate all cross-references of this incident in the last 200 years and narrow the search to relevant information.&rdquo; I really hope to ask the same kinds of questions to my computer in 2035. Of course, that will require a lot of investigation, research, and some changes in the way we develop and work with computers.
knowCube: a visual and interactive support for multicriteria decision making
Authors: Hans L. Trinkaus, Thomas Hanne
Venue: Computers and Operations Research (2005)

In this paper, we present a novel multicriteria decision support system (MCDSS), called knowCube, consisting of components for knowledge organization, generation, and navigation. Knowledge organization rests upon a database for managing qualitative and quantitative criteria, together with add-on information. Knowledge generation serves filling the database via, e.g. identification, optimization, classification or simulation. For "finding needles in haycocks", the knowledge navigation component supports graphical database retrieval and interactive, goal-oriented problem solving. Navigation "helpers" are, for instance, cascading criteria aggregations, modifiable metrics, ergonomic interfaces, and customizable visualizations. Examples from real-life projects, e.g. in industrial engineering and in the life sciences, illustrate the application of our MCDSS.
A Review Of Artificial Intelligence In Simulation
Authors: Costas Tsatsoulis
Venue: ACM SIGART Bulletin (1990)

The recent surge of interest in Expert Systems and Artificial Intelligence (AI) has led many simulation researchers to point out the similarities between AI and simulation methodologies, and to commence efforts to combine the two, thus improving both. This survey will discuss the current state-of-the-art of applying AI to simulation, and will present a detailed picture of research completed and in-progress.
Modeling epidemic information dissemination on mobile devices with finite buffers
Authors: Christoph Lindemann, Oliver P. Waldhorst
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Epidemic algorithms have recently been proposed as an effective solution for disseminating information in large-scale peer-to-peer (P2P) systems and in mobile ad hoc networks (MANET). In this paper, we present a modeling approach for steady-state analysis of epidemic dissemination of information in MANET. As major contribution, the introduced approach explicitly represents the spread of multiple data items, finite buffer capacity at mobile devices and a least recently used buffer replacement scheme. Using the introduced modeling approach, we analyze seven degrees of separation (7DS) as one well-known approach for implementing P2P data sharing in a MANET using epidemic dissemination of information. A validation of results derived from the analytical model against simulation shows excellent agreement. Quantitative performance curves derived from the analytical model yield several insights for optimizing the system design of 7DS.
Finding Glass
Authors: Kenton McHenry, Jean Ponce, David Forsyth
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

This paper addresses the problem of finding glass objects in images. Visual cues obtained by combining the systematic distortions in background texture occurring at the boundaries of transparent objects with the strong highlights typical of glass surfaces are used to train a hierarchy of classifiers, identify glass edges, and find consistent support regions for these edges. Qualitative and quantitative experiments involving a number of different classifiers and real images are presented.
Fault Tolerant Data Flow Modeling Using the Generic Modeling Environment
Authors: Mark L. McKelvin Jr., Jonathan Sprinkle, Claudio Pinello, Alberto Sangiovanni-Vincentelli
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Designing embedded software for safety-critical, real-time feedback control applications is a complex and error prone task. Fault tolerance is an important aspect of safety. In general, fault tolerance is achieved by duplicating hardware components, a solution that is often more expensive than needed. In applications such as automotive electronics, a subset of the functionalities has to be guaranteed while others are not crucial to the safety of the operation of the vehicle. In this case, we must make sure that this subset is operational under the potential faults of the architecture. A model of computation called Fault-Tolerant Data Flow (FTDF) was recently introduced to describe at the highest level of abstraction of the design the fault tolerance requirements on the functionality of the system. Then, the problem of implementing the system efficiently on a platform consists of finding a mapping of the FTDF model on the components of the platform. A complete design flow for this kind of application requires a user-friendly graphical interface to capture the functionality of the systems with the FTDF model, algorithms for choosing an architecture optimally, (possibly automatic) code generation for the parts of the system to be implemented in software and verification tools. In this paper, we use the Generic Modeling Environment (GME) developed at Vanderbilt University to design a graphical design capture system and to provide the infrastructure for automatic code generation. The design flow is embedded into the Metropolis environment developed at the University of California at Berkeley to provide the necessary verification and analysis framework
Multispace information visualization framework for the intercomparison of data sets retrieved from web services
Authors: Masahiko Itoh, Yuzuru Tanaka
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We introduce a new visualization framework for the intercomparison of more than one data set retrieved from Web services. In our framework, we use more than one visualization space simultaneously, each of which visualizes a single data set retrieved from the Web service. For this purpose, we provide a new 3D component for accessing Web services, and provide a 3D space component, in which data set retrieved from the Web service is visualized. Moreover, our framework provides users with various operations applicable to these space components, i.e., union, intersection, set-difference, cross-product, selection, projection, and joins.
FPGA Implementation of a Pipelined On-Line Backpropagation
Authors: Rafael Gadea Gironés, Ricardo Colom Palero, Joaquín Cerdá Boluda, Angel Sebastia Cortés
Venue: Journal of VLSI Signal Processing Systems (2005)

The paper describes the implementation of a systolic array for a multilayer perceptron with a hardware-friendly learning algorithm. A pipelined modification of the on-line backpropagation algorithm is shown and explained. It better exploits the parallelism because both the forward and backward phases can be performed simultaneously. The neural network performance for the proposed modification is discussed and compared with the standard so-called on-line backpropagation algorithm in typical databases and with the various precisions required. Although the preliminary results are positive, subsequent theoretical analysis and further experiments with different training sets will be necessary. For this reason our VLSI systolic architecture--together with the combination of FPGA reconfiguration properties and a design flow based on generic VHDL--can create a reusable, flexible, and fast method of designing a complete ANN on a single FPGA and can permit very fast hardware verifications for our trials of the Pipeline On-line Backpropagation algorithm and the standard algorithms.
Reconstruction of Attacks against Cryptographic Protocols
Authors: Xavier Allamigeon, Bruno Blanchet
Venue: Proceedings of the 18th IEEE workshop on Computer Security Foundations (2005)

We study an automatic technique for the verification of cryptographic protocols based on a Horn clause model of the protocol. This technique yields proofs valid for an unbounded number of sessions of the protocol. However, up to now, it gave no definite information when the proof failed. In this paper, we present an algorithm for reconstructing an attack against the protocol when the desired security property does not hold. We have proved soundness, termination, as well as a partial completeness result for our algorithm. We have also implemented it in the automatic protocol verifier ProVerif. As an extreme example, we could reconstruct an attack involving 200 parallel sessions against the f²¿¿g²¿¿ protocol [21].
Hash-based labeling techniques for storage scaling
Authors: D. Yao, Cyrus Shahabi, Per-&#x00c5;ke Larson
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2005)

Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of data objects across multiple storage devices of a storage pool, our optimization objective is to redistribute a minimum number of objects after scaling the pool. In addition, a uniform distribution, and hence a balanced load, should be ensured after redistribution. Moreover, the redistributed objects should be retrieved efficiently during the normal mode of operation: in one I/O access and with low complexity computation. To achieve this, we propose an algorithm called random disk labeling (RDL), based on double hashing, where storage can be added or removed without any increase in complexity. We compare RDL with other proposed techniques and demonstrate its effectiveness through experimentation.