ppxscal/embedding_network huggingface dataset:
Trellis-based parallel stereo matching
Authors: Yuns Oh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

We present a center-referenced basis for discrete representation of stereo correspondence that includes new occlusion nodes. This basis improves the inclusion of constraints and the parallelism of the final algorithm. Disparity estimation is formulated in a MAP context and natural constraints are incorporated, resulting in an optimal path problem in a sparsely connected trellis. Like other dynamic programming methods, the computational complexity is low at O(MN/sup 2/) for M/spl times/N pixel images. However, this method is better suited to parallel solution, scaling up to O(MN) processors. Experimental results confirm the performance of this method.
Implementation of fixed DSP functions using the reduced coefficient multiplier
Authors: R. H. Turner
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Distributed arithmetic (DA) has been successfully applied to the design of area efficient multipliers on FPGAs for DSP applications. Whilst DA is efficient in applications where the coefficients are fixed, there is little option for applications with a limited range of coefficient values. This paper describes a technique for developing area efficient multipliers for a range of DSP applications that fall into this category. This is accomplished by employing multiplexers at no extra cost to increase the functionality of existing fixed coefficient multipliers. The technique has been applied to a DCT FPGA implementation where an area decrease of up to 50% and a speed increase of 33% was achieved over the conventional route.
A Secure MANET Routing Protocol with Resilience against Byzantine Behaviours of Malicious or Selfish Nodes
Authors: Claude Crepeau, Carlton R. Davis, Muthucumaru Maheswaran
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Secure routing in mobile ad hoc networks (MANETs) has emerged as a important MANET research area. MANETs, by virtue of the fact that they are wireless networks, are more vulnerable to intrusion by malicious agents than wired networks. In wired networks, appropriate physical security measures, such as restriction of physical access to network infrastructures, can be used to attenuate the risk of intrusions. Physical security measures are less effective however in limiting access to wireless network media. Consequently, MANETs are much more susceptible to infiltration by malicious agents. Authentication mechanisms can help to prevent unauthorized access to MANETs. However, considering the high likelihood that nodes with proper authentication credentials can be taken over by malicious entities, there are needs for security protocols which allow MANET nodes to operate in potential adversarial environments. In this paper, we present a secure on-demand MANET routing protocol, we named Robust Source Routing (RSR). In addition to providing data origin authentication services and integrity checks, RSR is able to mitigate against intelligent malicious agents which selectively drop or modify packets they agreed to forward. Simulation studies confirm that RSR is capable of maintaining high delivery ratio even when a majority of the MANET nodes are malicious.
SUEZ: a distributed safe execution environment for system administration trials
Authors: Doo San Sim, V. N. Venkatakrishnan
Venue: Proceedings of the 20th conference on Large Installation System Administration (2006)

In this paper, we address the problem of safely and conveniently performing "trial" experiments in system administration tasks. System administrators often perform such trial executions that involve installing new software or experimenting with features of existing software. Often such trials require testing of software that run on multiple hosts. For instance, experimenting with a typical client-server application requires understanding the effect of the actions of the client program on the server. We propose a distributed safe execution environment (DSEE) where such tasks can be performed safely and conveniently. A DSEE performs one-way isolation of the tasks run inside it: the effects of the client and the server are prevented from escaping outside the DSEE, and therefore are prevented from interfering with the processes running outside the DSEE. At the end of the trial execution, a DSEE allows clear inspection of the effects of running the task on all the hosts that are involved in the task execution. Also, a DSEE allows the changes to the "committed," in which case the actions become visible outside the DSEE. Otherwise, they can be "aborted" without affecting the system in any way. A DSEE is an ideal platform through which a system administrator can perform such trials without the fear of damaging the system in any manner. In this paper, we present the design and implementation of a tool called SUEZ that allows a system administrator to create and use distributed safe execution environments. We have experimented with several client-server applications using our tool. By performing these trials in a DSEE, we have found configuration vulnerabilities in our trials that involve some commonly used client-server applications.
A java reference model of transacted memory for smart cards
Authors: Erik Poll, Pieter Hartel, Eduard de Jong
Venue: Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference - Volume 5 (2002)

Transacted Memory offers persistence, undoability and auditing. We present a Java/JML Reference Model of the Transacted Memory system on the basis of our earlier separate Z model and C implementation. We conclude that Java/JML combines the advantages of a high level specification in the JML part (based on our Z model), with a detailed implementation in the Java part (based on our C implementation).
Analysis of Caching and Replication Strategies for Web Applications
Authors: Swaminathan Sivasubramanian, Guillaume Pierre, Maarten van Steen, Gustavo Alonso
Venue: IEEE Internet Computing (2007)

Developers often use replication and caching mechanisms to enhance Web application performance. The authors present a qualitative and quantitative analysis of state-of-the art replication and caching techniques used to host Web applications. Their analysis shows that selecting the best mechanism depends heavily on data workload and requires a careful review of the application's characteristics. They also propose a technique for Web practitioners to compare different mechanisms' performance on their own.
Personal reflections on PSI in engineering mechanics [personalised system of instruction]
Authors: D. R. Haws
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

There seems to be little argument that students need to be encouraged toward educational self-directedness. Yet self-direction must be based on past learning success and present learning readiness. There is at least a potential conflict here: students needs to assume responsibility for their own education, directing it to topics of their own choosing, but their learning most also at least occasionally be directed along a hierarchical path of sequentially dependent learning objectives (which path may not be so obvious to the uninitiated). The personalized system of instruction (PSI) seems to enable both of these not-always-compatible goals. PSI allows the instructor to specify not only content but absolute mastery of that content At the same time, PSI allows the student to control the tempo of mastery. This paper is a qualitative discussion of the evolving PSI instructional design used to reach courses in engineering mechanics and structural analysis over a period of six semesters at the University of Southern Mississippi, and at Boise State University in the US. 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
An Efficient and Secured Internet Key Exchange Protocol Design
Authors: Ming-Yang Su, Jia-Feng Chang
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

IPSec provides encryption and authentication on data packets protecting them from being eavesdropped or falsified. Prior to performing IPSec functions, shared session keys must be safely and secretly established between the two communication parties, usually two security gateways. Internet Key Exchange (IKE) protocol is the most common mechanism for two security gateways to exchange key materials. However, the original IKE is too flexible, complex, and vulnerable to DoS attack. Several enhanced IKE versions have been proposed to replace the original one. In this paper, we propose a new IKE version and analyze it extensively. The latest and most related version proposed in 2004 is used to compare with our version. Simulation results have shown that our protocol is more efficient and DoS resistant than the other, in addition to possessing more security merits.
Adapting publish-subscribe routing to traffic demands
Authors: Matteo Migliavacca, Gianpaolo Cugola
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

Most of currently available content-based publish-subscribe systems that were designed to operate in large scale, wired scenarios, build their routing infrastructure as a set of brokers connected in an acyclic network. The topology of such network is critical for the performance of the system. Depending on the traffic profile, the same topology may provide good performance or be very inefficient. Starting from this consideration, in this paper we first analyze this issue in detail, then we describe a distributed algorithm to address it, by adapting the topology of a content-based publish-subscribe routing network to the application demand.
Probabilistic model-building genetic algorithms
Authors: Martin Pelikan
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

Probabilistic model-building algorithms (PMBGAs) replace traditional variation of genetic and evolutionary algorithms by (1) building a probabilistic model of promising solutions and (2) sampling the built model to generate new candidate solutions. PMBGAs are also known as estimation of distribution algorithms (EDAs) and iterated density-estimation algorithms (IDEAs). Replacing traditional crossover and mutation operators by building and sampling a probabilistic model of promising solutions enables the use of machine learning techniques for automatic discovery of problem regularities and exploitation of these regularities for effective exploration of the search space. Using machine learning in optimization enables the design of optimization techniques that can automatically adapt to the given problem. There are many successful applications of PMBGAs, for example, Ising spin glasses in 2D and 3D, graph partitioning, MAXSAT, feature subset selection, forest management, groundwater remediation design, telecommunication network design, antenna design, and scheduling. The tutorial Probabilistic Model-Building GAs will provide a gentle introduction to PMBGAs with an overview of major research directions in this area. Strengths and weaknesses of different PMBGAs will be discussed and suggestions will be provided to help practitioners to choose the best PMBGA for their problem.
The design of a cryptographic security architecture
Authors: Peter Gutmann
Venue: Proceedings of the 8th conference on USENIX Security Symposium - Volume 8 (1999)

Traditional security toolkits have concentrated mostly on defining a programming interface (API) and left the internals up to individual implementors. This paper presents a design for a portable, flexible security architecture based on traditional computer security models involving a security kernel which controls access to security-relevant objects and attributes based on a configurable security policy. Layered on top of the kernel are various objects which abstract core functionality such as encryption and digital signature capabilities, certificate management, and secure sessions and data enveloping (email encryption) in a manner which allows them to be easily moved into cryptographic devices such as smart cards and crypto accelerators for extra performance or security. The versatility of the design has been proven through its use in implementations ranging from from 16-bit microcontrollers through to supercomputers, as well as a number of unusual areas such as security modules in ATM's.
System Architecture of an Autonomic Element
Authors: M. Muztaba Fuad, Michael J. Oudshoorn
Venue: Proceedings of the Fourth IEEE International Workshop on Engineering of Autonomic and Autonomous Systems (2007)

An autonomic element is the fundamental building block of any autonomic system. Although different aspects of autonomic computing are explored in isolation, the structural operation of an autonomic element has not been completely modeled. The standard definition for an autonomic element does not provide an architectural blueprint and several proprietary designs have been proposed that are not interoperable with each other. This paper presents an engineering perspective of building a domain independent autonomic element. We believe that architectural choices have a profound effect on the capabilities of any autonomic system and affect many of the design decisions during its implementation. Therefore, it is important to have a well defined model of the basic building block to develop autonomic systems. The architectural design presented is self regulating and uses standard object oriented primitives to make it easy to develop and implement.
A system for real-time watercolour rendering
Authors: J. Burgess, G. Wyvill, S. A. King
Venue: Proceedings of the Computer Graphics International 2005 (2005)

We present a system for the real-time rendering of scenes to produce images like watercolour paintings. Our system uses a hybrid of object space rendering techniques and image plane post processing to attain extremely good results very quickly. We achieve this through graphics processing unit (GPU) programming, hardware accelerated shadow volumes, and the use of noise for various different tasks. We manage to circumvent problems found in both previous image space and object space methods by combining the two.
Constructing a Temporal Relation Tagged Corpus of Chinese Based on Dependency Structure Analysis
Authors: Yuchang Cheng, Masayuki Asahara, Yuji Matsumoto
Venue: Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (2007)

This paper describes an annotation guideline for a temporal relation tagged corpus. Our goal is to construct a machine learnable model that automatically analyzes temporal events and relations between events. Since analyzing all combinations of events is inefficient, we examine use of dependency structure analysis to efficiently recognize meaningful temporal relations. We survey a small tagged data set to investigate the coverage of our method. Although the coverage of our methods is about 49%, we find that the dependency structure appears useful for reducing manual efforts in constructing a tagged corpus with temporal relations.
The personal node (PN)
Authors: Gregory G. Finn, Joe Touch
Venue: Proceedings of the Workshop on Embedded Systems on Workshop on Embedded Systems (1999)

A Personal Node (PN) is a small, wallet-sized device that integrates people into the Internet. A PN incorporates wireless communication, limited user I/O, and local environmental telemetry to catalyze the coordination of other smart space (SS) and network devices for the user's benefit. By themselves SSs are not aware of the people in them and people are not be aware of what is in a SS. The PN allows the SS to interact continuously with a person, and a person to interact continuously with the space, mediating the interaction with the help of other devices throughout the system. A PN is an individual's networking focal point. As the user roams about, a PN persistently maintains user presence on the internetwork. This represents the final and missing link in SSs, bringing the user in as a system resource and participant.
Duration Calculus for Analysis of Fault Trees with Time Dependencies
Authors: Pawel Gluchowski
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

The paper deals with a problem of a description and analysis of fault trees with time dependencies, constructed for real-time systems to show possible ways leading to a hazard. Both the description and analysis are made with the duration temporal logic formalism - Duration Calculus (DC). It is the first time, when fault trees, containing the temporal gates, proposed by Magott and Skrobanek, got formally described with the DC logic (preserving all their properties for each gate type and for the whole structure) and became possible to be formally deductively analyzed (the latter part still need same work though).
Legendre fluids: a unified framework for analytic reduced space modeling and rendering of participating media
Authors: Mohit Gupta, Srinivasa G. Narasimhan
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

In this paper, we present a unified framework for reduced space modeling and rendering of dynamic and non-homogenous participating media, like snow, smoke, dust and fog. The key idea is to represent the 3D spatial variation of the density, velocity and intensity fields of the media using the same analytic basis. In many situations, natural effects such as mist, outdoor smoke and dust are smooth (low frequency) phenomena, and can be compactly represented by a small number of coefficients of a Legendre polynomial basis. We derive analytic expressions for the derivative and integral operators in the Legendre coefficient space, as well as the triple product integrals of Legendre polynomials. These mathematical results allow us to solve both the Navier-Stokes equations for fluid flow and light transport equations for single scattering efficiently in the reduced Legendre space. Since our technique does not depend on volume grid resolution, we can achieve computational speedups as compared to spatial domain methods while having low memory and pre-computation requirements as compared to data-driven approaches. Also, analytic definition of derivatives and integral operators in the Legendre domain avoids the approximation errors inherent in spatial domain finite difference methods. We demonstrate many interesting visual effects resulting from particles immersed in fluids as well as volumetric scattering in non-homogenous and dynamic participating media, such as fog and mist.
An exploration of the resource theory in the internet environment
Authors: Bob Branch
Venue:  (2007)

In the competitive world of Internet-based marketing an organization is often required to implement some form of Personalization and Customization as part of its Customer Relationship Management efforts in order to gain a competitive advantage within its industry and establish long term relationships with its customer base. This goal is often accomplished by developing a method to organize and analyze consumer demographic and psychographic data, in an effort to discover trends in the purchasing behaviors of specific customer audience segments. The knowledge gathered from analysis of this type could then be converted into the decision support component of the organization's online marketing efforts. Therefore, the primary purpose of this research study was to utilize an Internet Consumer Purchasing Behavior survey to determine if a universal set of business rules could be established, modeled upon the principles of the Resource Theory (1993). These business rules could then assist marketers in providing personalized content to online consumers, based upon their ability to fulfill various pre-defined demographic categories.
The need for self-managed access nodes in grid environments.
Authors: Ramon Nou, Ferran Julia, Jordi Torres
Venue: Proceedings of the Fourth IEEE International Workshop on Engineering of Autonomic and Autonomous Systems (2007)

The Grid is constantly growing and it is being used by more and more applications. In this scenario the entry node is an important component in the whole architecture and will become a contention point. In this paper we will demonstrate that the use of a self-managed layer on the entry node of a grid is necessary. A self-managed system can allow more jobs to be accepted and finished correctly. Since it's not acceptable for a grid middleware layer to lose jobs, we would normally need to prioritize the finishing/acceptance of jobs over the response time or the throughput. A prototype of, what could be considered an autonomous system, is presented and tested over an installation of Globus Toolkit (GT4) and shows that we can greatly improve the performance of the original middleware by a factor of 30%. In this paper GT is used as an example but it could be added to any grid middleware.
Pipelined implementation of a real time programmable encoder for low density parity check code on a reconfigurable instruction cell architecture
Authors: Zahid Khan, Tughrul Arslan
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This paper presents pipelined implementation of a real time programmable irregular Low Density Parity Check (LDPC) Encoder as specified in the IEEE P802.16E/D7 standard. The encoder is programmable for frame sizes from 576 to 2304 and for five different code rates. H matrix is efficiently generated and stored for a particular frame size and code rate. The encoder is implemented on Reconfigurable Instruction Cell Architecture which has recently emerged as an ultra low power, high performance, ANSI-C programmable embedded core. Different general and architecture specific optimization techniques are applied to enhance the throughput. With the architecture, a throughput from 10 to 19 Mbps has been achieved. The maximum throughput achieved with pipelining/ multi-core is 78 Mbps.