ppxscal/embedding_network huggingface dataset:
Application specific reconfigurable architecture design methodology
Authors: Sethuraman Panchanathan
Venue:  (2005)

This research work proposes a new methodology to derive reconfigurable heterogeneous hierarchical routing architecture by exploiting the computation characteristics of the target application domain. High-throughput technologies have led to an exponential growth in the amount of data generated in the fields of geophysics, biosciences, signal processing, video compression and computational fluid dynamics over the past several years. This data explosion is forcing scientists to search for innovative computational designs to meet the growing demands. There is evidence that reconfigurable systems can deliver 10X to 100X or greater improvement in computational efficiency for many computationally intensive problems by tailoring hardware allocations to match the needs of applications. This significant speed advantage is due to the highly parallel nature of FPGA (Field Programmable Gate Array) hardware. Fortunately, many problems in those application domains are inherently parallel, and benefit from concurrent computing models. However, FPGAs suffer from the drawbacks of being application agnostic and hence incur penalties of loss of clock cycles in redundant reconfigurations, generic routing and poor memory architectures which impact speed, power and silicon area. All these factors have led us into exploring the application specific reconfigurable architecture design space. Research methodology involves: (a) control flow graph generation through LANCE compiler, (b) mapping of pure data dependent computations within the control flow structures into LUTs, (c) packing LUT based netlists into processing elements, (d) forming hierarchy of clusters, (e) deriving switching and wiring requirements and finalizing the routing architecture. Applications are then mapped on the processing elements based on the architecture constraints; placed and routed using existing placement and routing algorithms. This methodology proposes to provide optimum interconnection pathways, by allocating just enough switching and wiring resources by profiling the computational characteristics of the application. Only necessary and sufficient FPGA circuitry are synthesized for each task and every gate processes useful information in each clock cycle, therefore increased circuit-packing density can be achieved. Tools implemented as part of the methodology will permit seamless algorithm design at a high level of abstraction and execution at a high level of efficiency in hardware, synthesizing layers of parallel execution structures all the way to the gate level.
Objective-Optimal Algorithms for Long-Term Web Prefetching
Authors: Bin Wu Ajay D. Kshemkalyani
Venue: IEEE Transactions on Computers (2006)

Web prefetching is based on Web caching and attempts to reduce user-perceived latency. Unlike on-demand caching, Web prefetching fetches objects and stores them in advance, hoping that the prefetched objects are likely to be accessed in the near future and such accesses would be satisfied from the caches rather than by retrieving the objects from the Web server. This paper reviews the popular prefetching algorithms based on Popularity, Good Fetch, APL characteristic, and Lifetime, and then makes the following contributions: 1) The paper proposes a family of linear-time prefetching algorithms, Objective-Greedy prefetching, wherein each algorithm greedily prefetches those Web objects that most significantly improve the performance as per the targeted metric. 2) The Hit rate-Greedy and Bandwidth-Greedy algorithms are shown to be optimal for their respective objective metrics. A linear-time optimal prefetching algorithm that maximizes the H/B metric as the performance measure is proposed. 3) The paper shows the results of a performance analysis via simulations, comparing the proposed algorithms with the existing algorithms in terms of the respective objectives—the hit rate, bandwidth, and the H/B metrics. The proposed prefetching algorithms are seen to provide better objective-based performance than any existing algorithms. Further, H/B-Greedy performs almost as well as H/B-Optimal.
Intelligent Document Processing
Authors: Floriana Esposito, Stefano Ferilli, Teresa M. A. Basile, Nicola Di Mauro
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Digital repositories raise the need for an effective and efficient retrieval of the stored material. In this paper we propose the intensive application of intelligent techniques to the steps of document layout analysis, document image classification and understanding on digital documents. Specifically, the complex interrelation existing among layout components, that are fundamental to assign them the proper semantic role, suggest the exploitation of first-order representations in some learning steps. Results obtained in a prototypical system for scientific conference management prove that the proposed approach can be beneficial both for the layout recognition and for the selection of interesting components of the document, from which extracting the text for categorizing the document according to its topic.
Application-aware resource scheduling
Authors: Stan Zdonik
Venue:  (2005)

The proliferation of the Internet and World Wide Web, the development of wireless networks, the availability of asymmetric high-bandwidth links to the home, and the recent emergence of small-scale computing devices have fueled the development of applications with wide and varied data needs. The data-intensive environments in which these applications exist are characterized by very high data rates, the scale and variety of autonomous data sources, and the diverse needs of users and applications. Often, the resources (CPU, memory, bandwidth, etc.) in these environments are constrained and data management plays an important role in providing fast responsive systems through the effective scheduling of resources. Databases have long benefited from the use of application-level knowledge to make decisions. Often, this application-level awareness comes from a priori knowledge of user interests. In these new networked environments there is evidence that more responsive systems can be delivered if users provide either some general indication of their interest or even better, a detailed query. We call this specification of user interest a &ldquo;profile&rdquo;. This dissertation focuses on two applications domains. In the first application domain, the process of synchronizing a database to improve the freshness of copies is studied. In the second application domain, we study the timely processing of large volumes of continuous high-rate data streams in the context of the Aurora stream processing engine. In both cases, profiles show promise in improving resource scheduling to provide effective data management.
MPIIMGEN - a code transformer that parallelizes image processing codes to run on a cluster of workstations
Authors: U. V. Vinod, P. K. Baruah
Venue: Proceedings of the 2004 IEEE International Conference on Cluster Computing (2004)

An enormous body of image and video processing software has been written for conventional (sequential) desktop computers. These implement a wide range of operations, such as convolution, histogram equalization and template matching. These applications usually have a tremendous potential for parallelism. However a significant barrier in exploiting such parallelism is the difficulty of writing parallel software. In this work, the design and implementation of MPIIMGEN -- a code transformer that automatically transforms these sequential image processing codes into parallel codes that are capable of running on a cluster of workstations is presented. This tool uses a pattern driven approach to parallelize the sequential codes.
A practical generalization of Fourier-based learning
Authors: Adam Drake, Dan Ventura
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

This paper presents a search algorithm for finding functions that are highly correlated with an arbitrary set of data. The functions found by the search can be used to approximate the unknown function that generated the data. A special case of this approach is a method for learning Fourier representations. Empirical results demonstrate that on typical real-world problems the most highly correlated functions can be found very quickly, while combinations of these functions provide good approximations of the unknown function.
Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications
Authors: Bing Yang, Mei Yang, Jianping Wang, S. Q. Zheng
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

In real networks, disjoint paths are needed for providing protection against single link/node failure. When disjoint paths cannot be found, an alternative solution is to find paths with the minimum shared links/nodes. In the literature, there is little work addressing this problem. In this paper, defining vulnerability as the number of times a link/node is shared among different paths, we consider the problems of finding k paths with minimum edge/node vulnerability. We study three problems and propose polynomial algorithms to solve these problems. The work presented in this paper can be directly applied to a number of network applications such as reliable unicast/multicast communications, reliable client-server communications, protection for the dual-homing architecture, etc.
Distributed Construction of a Fault-Tolerant Network from a Tree
Authors: Michael K. Reiter, Asad Samar, Chenxi Wang
Venue: Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (2005)

We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (an expander graph) among themselves in a distributed and scalable way. The tree overlayed with this logical expander is a useful structure for distributed applications that require the intrinsic "treeness" from the topology but cannot afford any obstruction in communication due to failures. At the core of our construction is a novel distributed mechanism that samples nodes uniformly at random from the tree. In the event of node joins, node departures or node failures, the expander maintains its own fault tolerance and permits the reformation of the tree. We present simulation results to quantify the convergence of our algorithm to a fault tolerant network having both good vertex connectivity and expansion properties.
Comparative Study of Two Projective-Invariant Digital Watermarking Methods Using Cross-Ratios and Line Intersections
Authors: Natapon Pantuwong, Nopporn Chotikakamthorn
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Recently, based on a set of four coplanar points, a projective-invariant digital watermarking has been developed. A combination of line intersection and the cross-ratio relationship of collinear points is used to calculate watermarking embedding locations. The four coplanar points used to derive embedding locations can be obtained from either the image corners or the feature points extracted from the image content. It is shown in this paper that based on the same principle, an alternative algorithm for calculating the watermark embedding locations improves computational efficiency. The proposed method heavily uses the cross-ratio relationship of collinear points, while minimizing the use of line intersection in obtaining embedding locations. This is in contrast with the original method, where embedding locations are mainly obtained from intersections of line pairs. Both analytical and experimental results are provided to demonstrate the improvement.
Source versus Object Code Extraction for Recovering Software Architecture
Authors: Ahmed E. Hassan, Zhen Ming Jiang, Richard C. Holt
Venue: Proceedings of the 12th Working Conference on Reverse Engineering (2005)

The architecture of many large software systems is rarely documented and if documented it is usually out of date. To support developers maintaining and evolving these systems, an up to date view of the architecture could be recovered from the system's implementation. Source code or object code extractors may be used to recover the architecture. In this paper, we explore using two types of extractors (source code and object code extractors) to recover the architecture of several large open source systems. We then investigate the differences between the results produced by these extractors to gain a better understanding of the benefits and limitations of each type of extractor. Our experimental results show that both types of extractors have their benefitsand limitations. For example, an object code extractor is easier to implement while a source code extractor recovers more dependencies that exist in the source code as seen by developers.
How artificial ontogenies can retard evolution
Authors: Shivakumar Viswanathan, Jordan Pollack
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Recently there has been much interest in the role of indirect genetic encodings; as a means to achieve increased evolvability. From this perspective, artificial ontogenies have largely been seen as a vehicle to relate the indirect encodings to complex phenotypes. However, the introduction of a development phase does not come without other consequences. We show that the conjunction of the latent ontogenic structure and the common practice of only evaluating the final phenotype obtained from development can have a net retarding effect on evolution. Using a formal model of development, we show that this effect arises primarily due to the relation between the ontogenic structure to the fitness function, which in turn impacts the properties being evaluated and selected for during evolution. This effect is empirically demonstrated with a toy search problem using LOGO-turtle based embryogenic processes.
Matching Commercial Clips from TV Streams Using a Unique, Robust and Compact Signature
Authors: Yijun Li, Jesse S. Jin, Xiaofang Zhou
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

One of critical challenges in automatic recognition of TV commercials is to generate a unique, robust and compact signature. Uniqueness indicates the ability to identify the similarity among the commercial video clips which may have slight content variation. Robustness means the ability to match commercial video clips containing the same content but probably with different digitalization/encoding, some noise data, and/or transmission and recording distortion. Efficiency is about the capability of effectively matching commercial video sequences with a low computation cost and storage overhead. In this paper, we present a binary signature based method, which meets all the three criteria above, by combining the techniques of ordinal and color measurements. Experimental results on a real large commercial video database show that our novel approach delivers a significantly better performance comparing to the existing methods.
Approximate ambient occlusion for trees
Authors: Kyle Hegeman, Simon Premože Michael Ashikhmin, George Drettakis
Venue: Proceedings of the 2006 symposium on Interactive 3D graphics and games (2006)

Natural scenes contain large amounts of geometry, such as hundreds of thousands or even millions of tree leaves and grass blades. Subtle lighting effects present in such environments usually include a significant amount of occlusion effects and lighting variation. These effects are important for realistic renderings of such natural environments; however, plausible lighting and full global illumination computation come at prohibitive costs especially for interactive viewing. As a solution to this problem, we present a simple approximation to integrated visibility over a hemisphere (ambient occlusion) that allows interactive rendering of complex and dynamic scenes. Based on a set of simple assumptions, we show that our method allows the rendering of plausible variation in lighting at modest additional computation and little or no precomputation, for complex and dynamic scenes.
Cages: constructions and new upper bounds
Authors: Gabriela Araujo-Pardo, Juan Jose Montellano-Ballesteros
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

In this paper some constructions of graphs are presented. These constructions give us the known upper bounds for (k, g)-cages when g \varepsilon {5, 6, 7, 8} and new upper bounds when g \varepsilon {11, 12} (see [1]). Besides, these constructions improve the bounds for g = 5, and for g \varepsilon {7, 11} with k -1 = 2\alpha.
Analyzing Goal Semantics for Rights, Permissions, and Obligations
Authors: Travis D. Breaux, Annie I. Anton
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Software requirements, rights, permissions, obligations, and operations of policy enforcing systems are often misaligned. Our goal is to develop tools and techniques that help requirements engineers and policy makers bring policies and system requirements into better alignment. Goals from requirements engineering are useful for distilling natural language policy statements into structured descriptions of these interactions; however, they are limited in that they are not easy to compare with one another despite sharing common semantic features. In this paper, we describe a process called semantic parameterization that we use to derive semantic models from goals mined from privacy policy documents. We present example semantic models that enable comparing policy statements and present a template method for generating natural language policy statements (and ultimately requirements) from unique semantic models. The semantic models are described by a context-free grammar called KTL that has been validated within the context of the most frequently expressed goals in over 100 Internet privacy policy documents. KTL is supported by a policy analysis tool that supports queries and policy statement generation.
Mitigation and traceback countermeasures for dos attacks
Authors: Basheer Nayef Al-Duwairi
Venue:  (2005)

Denial of service (DoS) attacks impose an imminent threat to the availability of Internet services. The alarming increase of such attacks coupled with the emergence of sophisticated DoS attack techniques, call for efficient defense mechanisms to counter these attacks. Although there has been ongoing research in this area&mdash;focusing on DoS prevention, mitigation, and traceback&mdash;the existing countermeasures lack in several qualitative and quantitative metrics. In this context, this dissertation makes two key contributions in the design and analysis of efficient, scalable schemes for DoS mitigation and traceback. First, efficient perimeter mitigation schemes based on novel concepts, such as &ldquo;protocol-determinism&rdquo; and &ldquo;victim-assistance&rdquo; are proposed. The proposed schemes enable ISP edge routers to perform timely mitigation of both end-host and network exhaustion attacks. The proposed mitigation schemes have been evaluated through analytical studies for classical and advanced attacks quantifying security metrics, such as false positive and false negative rates, and performance metrics, such as effective attack rate and connection establishment latency increase. Our analysis shows that the proposed schemes offer very low false positive and false negative rates, and reduce attacker's effective attack rate significantly with an acceptable increase in connection establishment latency. Second, hybrid IP traceback schemes that integrate the concepts of packet marking and packet logging in a novel manner are proposed. The goal is to achieve a drastic reduction in the number of attack packets required to conduct the traceback process. The proposed traceback schemes have been evaluated through a combination of analytical and simulation studies quantifying performance metrics, such as number of attack packets, storage overhead, and attack localization distance. Our studies show that the proposed traceback schemes are superior in comparison to the well known PPM scheme. This dissertation opens up several directions for future research which includes (1) designing efficient mitigation schemes in the context of inter-domain network, (2) designing efficient mitigation schemes that employ traceback, and (3) designing a comprehensive DoS defense mechanism that integrates DoS prevention, mitigation, and traceback in an efficient manner.
A Quorum-Based Protocol for Searching Objects in Peer-to-Peer Networks
Authors: Ken Miura Taro Tagawa Hirotsugu Kakugawa
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

Peer-to-peer (P2P) system is an overlay network of peer computers without centralized servers, and many applications have been developed for such networks such as file sharing systems. Because a set of peers dynamically changes, design and verification of efficient protocols is a challenging task. In this paper, we consider an object searching problem under a resource model such that there are some replicas in a system and the lower bound of the ratio \rho=n^\prime /n is known in advance, where n^\primeis a lower bound of the number of peers that hold original or replica for any object type and n is the total number of peers. In addition, we consider object searching with probabilistic success, i.e., for each object search, object must be found with at least probability 0
Medical Image Analysis for Image Guided Therapy
Authors: Simon K. Warfield
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

The field of image guided therapy has advanced dramatically over the past decade. Innovations in imaging and image analysis have enabled key improvements in a) preoperative planning, b) intraoperative targeting, navigation and control, and c) postoperative assessment. We describe recent algorithmic advances that have enabled enhanced planning of the neurosurgical trajectory from preoperative structural, functional and diffusion tensor MRI, enabled image guided monitoring and navigation based on intraoperative MRI and nonrigid registration for multi-modality fusion with preoperative images, and enabled quantification of postoperative tumor resection through image segmentation.
Enhancing Performance of HW/SW Cosimulation and Coemulation by Reducing Communication Overhead
Authors: Moo-Kyoung Chung, Chong-Min Kyung
Venue: IEEE Transactions on Computers (2006)

For system-level simulation of a complex system-on-chip design, multiple hardware simulators and emulators can be combined to work together. The simulation performance in this case is often limited by the communication overhead between simulators and emulators. To reduce the amount of communication in this heterogeneous simulation environment, we propose novel methods to find a time interval during which there are no transactions among simulators based on a dynamic prediction of transaction occurrence time for both software and hardware models. We also propose a simulator scheduling algorithm which allows the simulator to work alone without interaction with others when there is no transaction. By so doing, we reduced the amount of pure communication by a factor of 15 to 67 and, as a result, achieved a speed-up factor of 4 to 40 compared to existing lock-step simulation, as shown by experimental results with various application examples.