ppxscal/embedding_network huggingface dataset:
Stripe-based SPHIT lossy compression of volumetric medical images for low memory usage and uniform reconstruction quality
Authors: Y. Kim
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

This paper presents a low memory implementation of efficient lossy volumetric medical image compression using the set partitioning in hierarchical trees (SPIHT) algorithm. The coding units in this three-dimensional wavelet transform and compression method are short sequences of horizontal stripes cut from the sequence of slices in the volumetric image. As the compression degree increases, the boundaries between adjacent coding units became increasingly visible. Unlike video, where image frames are viewed under dynamic conditions, the volume image is examined under static conditions and must not exhibit such boundary artifacts. In order to eliminate them, we utilize overlapping and averaging both at the intra-slice and inter-slice boundaries between adjacent and successive stripe sequences. Our low memory implementation smooths out considerably the variation in mean squared error among different slices and suffers only an insignificant loss in performance from that of a full memory implementation.
Class scheduling and size as correlates of learning
Authors: W. Venable
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

West Virginia University has been giving departmental final examinations in three engineering mechanics courses for almost thirty years. This paper reviews results of 118 class sections since 1989. Two significant findings were made: (1) Classes meeting three times a week outperform those meeting twice a week. (2) There are significant long-term differences between instructors.
Domain name system: The origin solution
Authors: Jim Reid, Anton Holleman
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

The Domain Name System (DNS) is one of the core enabling technologies in Internets and Intranets. It performs the key role of mapping between network addresses and descriptive names. Because DNS is generally considered to be difficult for non-specialists to implement and maintain, Origin has developed a flexible, integrated, managed DNS Service, whereby customers can retain differing levels of responsibility for the DNS backbone and the DNS content, and delegate the remainder to Origin.
On interdomain routing security and pretty secure BGP (psBGP)
Authors: P.C. van Oorschot, Tao Wan, Evangelos Kranakis
Venue: ACM Transactions on Information and System Security (TISSEC) (2007)

It is well known that the Border Gateway Protocol (BGP), the IETF standard interdomain routing protocol, is vulnerable to a variety of attacks, and that a single misconfigured or malicious BGP speaker could result in large-scale service disruption. In this paper, we present Pretty Secure BGP (psBGP)---a proposal for securing BGP, including an architectural overview, design details for significant aspects, and preliminary security and operational analysis. psBGP differs from other security proposals (e.g., S-BGP and soBGP) in that it makes use of a single-level PKI for AS number authentication, a decentralized trust model for verifying the propriety of IP prefix origin, and a rating-based stepwise approach for AS_PATH (integrity) verification. psBGP trades off the strong security guarantees of S-BGP for presumed-simpler operation, e.g., using a PKI with a simple structure, with a small number of certificate types, and of manageable size. psBGP is designed to successfully defend against various (nonmalicious and malicious) threats from uncoordinated BGP speakers, and to be incrementally deployed with incremental benefits.
Efficient and Accurate Statistical Timing Analysis for Non-Linear Non-Gaussian Variability With Incremental Attributes
Authors: Ashish Dobhal, Vishal Khandelwal, Ankur Srivastava
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

In this work, we present a non linear non Gaussian and incremental Statistical Timing Analysis (SSTA) framework. Specifically, unlike current approaches for non linear non Gaussian SSTA [1] which have numerical components, our approach is a completely analytical. We also investigate the incremental aspects of SSTA and present (1) a fast yet accurate incremental approach (2) a method to efficiently estimate the expected error injected by the incremental SSTA, which could be used to decide, when accurate SSTA should be executed and when incremental SSTA would suffice. Our approach (non incremental) is about 9588 times faster than Monte Carlo whereas an existing state of the art non linear non Gaussian SSTA engine [1] is only 31.3 times faster. Both had comparable errors w.r.t. Monte Carlo. Our incremental approach is 23 times faster than the accurate SSTA approach. Moreover, our error estimating methodology can accurately capture the trends of error injection due to incremental SSTA. Therefore, it could be used to predict when accurate SSTA is needed and when incremental is sufficient.
Segmentation and Classification of Human Forms using LADAR Data
Authors: James S. Albus, Tsai Hong, Tommy Chang
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

High resolution LADAR (LAser Detection and Ranging) images of scenes containing human forms have been automatically segmented and simple algorithms have been developed for recognizing human forms in various positions in both cluttered and uncluttered scenes. Registration of LADAR and color CCD images is suggested as a method to enhance the ability to segment both types of images.
hpGEM---A software framework for discontinuous Galerkin finite element methods
Authors: Lars Pesch, Alexander Bell, Henk Sollie, Vijaya R. Ambati, Onno Bokhove, Jaap J. W. Van Der Vegt
Venue: ACM Transactions on Mathematical Software (TOMS) (2007)

hpGEM, a novel framework for the implementation of discontinuous Galerkin finite element methods (FEMs), is described. We present data structures and methods that are common for many (discontinuous) FEMs and show how we have implemented the components as an object-oriented framework. This framework facilitates and accelerates the implementation of finite element programs, the assessment of algorithms, and their application to real-world problems. The article documents the status of the framework, exemplifies aspects of its philosophy and design, and demonstrates the feasibility of the approach with several application examples.
An analysis of interconnect delay minimization by low-voltage repeater insertion
Authors: Rajeevan Chandel, S. Sarkar, R. P. Agarwal
Venue: Microelectronics Journal (2007)

The effect of voltage-scaling on interconnect delay minimization by CMOS-repeater insertion is analyzed. Analytical models are developed to calculate the optimum number of repeaters as function of CMOS supply voltage. The analytically obtained results are in good agreement with SPICE extracted results. Analysis shows that voltage-scaling decreases power dissipation and the optimum number of repeaters required for delay minimization in long interconnects. Both resistive and inductive interconnects have been considered. At highly scaled voltages, the inductive interconnect has the advantage of lower power-delay product. It is also seen that voltage-scaling affects delay improvement due to repeater insertion.
A1: spreadsheet-based scripting for developing web tools
Authors: Eben M. Haber, Eser Kandogan, Allen Cypher, Paul P. Maglio, Rob Barrett
Venue: Proceedings of the 19th conference on Large Installation System Administration Conference - Volume 19 (2005)

A1 is a Java-based spreadsheet environment that enables system administrators to build small tools that simplify and automate common tasks, integrating real-time data across heterogeneous systems. A1 spreadsheets can be saved to a central repository, where they are published and shared as interactive web portlets. In this paper, we discuss the need for administrators to create their own tools, how the A1 environment is designed to support this need, and how A1's support for web publishing - without requiring special web programming - can enable teams to share, modify, and improve their tools. We also discuss the design and implementation of A1, and show a number of sample spreadsheets for various administration tasks.
k-Additivity and C-decomposability of bi-capacities and its integral
Authors: Katsushige Fujimoto, Toshiaki Murofushi, Michio Sugeno
Venue: Fuzzy Sets and Systems (2007)

k-Additivity is a convenient way to have less complex (bi-)capacities. This paper gives a new characterization of k-additivity, introduced by Grabisch and Labreuche, of bi-capacities and contrasts between the existing characterization and the new one, that differs from the one of Saminger and Mesiar. Besides, in the same way for capacities, a concept of C-decomposability, distinct from the proposal of Saminger and Mesiar, but closely linked to k-additivity, is introduced for bi-capacities. Moreover, the concept of C-decomposability applies to the Choquet integral with respect to bi-capacities.
Cost-Sensitive-Data Preprocessing for Mining Customer Relationship Management Databases
Authors: Junfeng Pan, Qiang Yang, Yiming Yang, Lei Li, Frances Tianyi Li, George Wenmin Li
Venue: IEEE Intelligent Systems (2007)

Telecommunications companies and financial institutions are facing increasing competition. A staged preprocessing framework for cost-sensitive-data processing can help these companies identify customers who might switch to a competitor (or churn). The framework gives users an intuitive idea of the data distribution using a self-organizing map and then uses a cost matrix to help convert the data with an improved equidepth discretization method. The preprocessed data set can be input to any classifier. When tested on the KDD Cup 1998 data set, the framework performed better than the competition's winner. It has also been implemented in a software product called ED-Money and applied to a Chinese mobile telecommunication data set.
Extremal problems for convex polygons
Authors: Charles Audet, Pierre Hansen, Frédéric Messine
Venue: Journal of Global Optimization (2007)

Consider a convex polygon V n with n sides, perimeter P n , diameter D n , area A n , sum of distances between vertices S n and width W n . Minimizing or maximizing any of these quantities while fixing another defines 10 pairs of extremal polygon problems (one of which usually has a trivial solution or no solution at all). We survey research on these problems, which uses geometrical reasoning increasingly complemented by global optimization methods. Numerous open problems are mentioned, as well as series of test problems for global optimization and non-linear programming codes.
Virtual private caches
Authors: Kyle J. Nesbit, James Laudon, James E. Smith
Venue: ACM SIGARCH Computer Architecture News (2007)

Virtual Private Machines (VPM) provide a framework for Quality of Service (QoS) in CMP-based computer systems. VPMs incorporate microarchitecture mechanisms that allow shares of hardware resources to be allocated to executing threads, thus providing applications with an upper bound on execution time regardless of other thread activity. Virtual Private Caches (VPCs) are an important element of VPMs. VPC hardware consists of two major components: the VPC Arbiter, which manages shared cache bandwidth, and the VPC Capacity Manager, which manages the cache storage. Both the VPC Arbiter and VPC Capacity Manager provide minimum service guarantees that, when combined, achieve QoS for the cache subsystem. Simulation-based evaluation shows that conventional cache bandwidth management policies allow concurrently executing threads to affect each other significantly in an uncontrollable manner. The evaluation targets cache bandwidth because the effects of cache capacity sharing have been studied elsewhere. In contrast with the conventional policies, the VPC Arbiter meets its QoS performance objectives on all workloads studied and over a range of allocated bandwidth levels. The VPC Arbiter’s fairness policy, which distributes leftover bandwidth, mitigates the effects of cache preemption latencies, thus ensuring threads a high-degree of performance isolation. Furthermore, the VPC Arbiter eliminates negative bandwidth interference which can improve aggregate throughput and resource utilization.
The Next Big Thing in Chipmaking
Authors: George Lawton
Venue: Computer (2007)

Changing the materials used to make transistors could overcome a substantial roadblock to continuing to use current production processes to shrink transistor elements and thereby increase chip performance, enabling chipmakers to scale down feature sizes through several more generations.
McGrid: framework for optimizing grid middleware on multi-core processors
Authors: Rajdeep Bhowmik, Chaitali Gupta, Madhusudhan Govindaraju, Aneesh Aggarwal
Venue: Proceedings of the 2007 workshop on Service-oriented computing performance: aspects, issues, and approaches (2007)

The microprocessor industry is rapidly moving towards chip multi-processors (CMPs), commonly referred to as multi-core processors, where multiple cores can independently execute different threads. This change in computer architecture requires corresponding design modifications in programming paradigms, including grid middleware tools, to harness the opportunities presented by multi-core processors. Naive implementations of grid middleware on multi-core systems can severely impact performance because of limitations of shared bus bandwidth, cache size and coherency, and communication between threads. The goal of developing an optimized multi-threaded grid middleware for emerging multi-core processors will be realized only if researchers and developers have access to an in-depth analysis of the impact of several low level microarchitectural parameters on performance. None of the current grid simulators and emulators provide feedback at the microarchitectural level, which is essential for such an analysis. We describe the initial design and implementation of an emulation framework, Multi-core Grid (McGrid), to analyze and provide insightful feedback on the performance limitations, bottlenecks, and optimization opportunities for grid middleware on multi-core systems. We describe early performance results of emulating the processing of some representative XML based grid documents on multi-core nodes using the McGrid framework.
Practical adaptive control: theory and applications
Authors: Petros A. Ioannou
Venue:  (2006)

An adaptive controller can be viewed as a combination of a control designed in the case of known parameters with an adaptive strategy accounting for the unknown parameters. It can be classified as identifier or non-identifier based, depending on the property of the adaptive strategy. In the past fifty years, adaptive control theory has reached a high level of maturity. However, its applications in safety sensitive systems are limited. Identifier based adaptive controllers can track plant changes and adjust the control parameters to counteract them. However, the conflict between parameter estimation and control may lead to poor transients during the learning process. Their nonlinear nature makes it difficult to check stability and performance bounds as done in the linear time invariant case. As a result in applications where safety is at stake practitioners are reluctant to close the loop with an identifier based adaptive controller. On the other hand, robust non-adaptive controllers can be designed to have acceptable transient behavior but may not be able to deal with unpredictable changes in the plant dynamics. In an effort to resolve this issue a bank of robust controllers is designed to cover the possible parametric uncertainty together with a switching logic searching the appropriate controller on line. These controllers, referred to as non-identifier based, are designed with the assumption that the pre-chosen controller bank contains at least one stabilizing controller. They may not guarantee good transients and it is not straightforward how to design the bank of controllers to cover the possible parametric uncertainty. The objective of this dissertation is to develop robust adaptive control algorithms that can be implemented safely to achieve desired performance. As we show in the model reference control case, by combining identifier and non-identifier based adaptive schemes, the resulting scheme, referred to as safe adaptive control, is superior in performance and robustness than existing ones. In addition, we investigate the applications of conventional robust adaptive controllers in intelligent transportation systems. With theoretical analysis, simulations and actual implementation, we show that robust adaptive controllers can be implemented safely and achieve desired performance in real time applications.
Towards Just Noticeable Differences for Natural Frequency of Manually Excited Virtual Dynamic Systems
Authors: Yanfang Li, Volkan Patoglu, Deborah Huang, Marcia K. O'Malley
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

This paper explores the experiment design to determine a human's ability to discriminate the natural frequency of manually excited virtual dynamic systems. We use a one degree-of-freedom haptic interface with a coupled graphical display to render a virtual mass-spring system, which is excited by the human operator using his/her dominant hand. The results from the preliminary experiment indicate a JND value of approximately 8%. However, results also indicate that excitation strategies have a significant effect on the discrimination threshold determination of this dynamic property. In this paper, along with a discussion of the preliminary results, a refined experiment design that accounts for different factors influencing the discrimination of manually excited natural frequency is presented.
STEF: A Secure Ticket-Based En-route Filtering Scheme for Wireless Sensor Networks
Authors: Christoph Kraub, Markus Schneider, Kpatcha Bayarou, Claudia Eckert
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Node compromise is a serious threat in wireless sensor networks. An adversary can use compromised nodes to inject false data into the network forging events to deceive the base station. Furthermore, an adversary can cause serious damage by injecting a large amount of false messages to deplete the scarce energy resources of the forwarding en-route sensor nodes. In this paper, we propose a Secure Ticket-Based Enroute Filtering Scheme (STEF) that drops false messages enroute. We propose a ticket concept where reply messages are only forwarded if they contain a valid ticket originally issued by the base station. Messages containing no ticket, or an replayed ticket, are immediately filtered out by not compromised sensor nodes. The ticket concept is based on lightweight one-way functions. This enables every en-route node to verify the tickets. Furthermore, our scheme does not need symmetric key sharing between message generating nodes and en-route nodes, which results in a high resiliency against node compromises. Our security and performance analysis shows that STEF provides a high security level and is very efficient in saving energy. Furthermore, the required storage capacity on the sensor nodes is very low.
Incentive-centered design for information security
Authors: Rick Wash, Jeffrey K. MacKie-Mason
Venue: Proceedings of the 1st USENIX Workshop on Hot Topics in Security (2006)

Humans are "smart components" in a system, but cannot be directly programmed to perform; rather, their autonomy must be respected as a design constraint and incentives provided to induce desired behavior. Sometimes these incentives are properly aligned, and the humans don't represent a vulnerability. But often, a misalignment of incentives causes a weakness in the system that can be exploited by clever attackers. Incentive-centered design tools help us understand these problems, and provide design principles to alleviate them. We describe incentivecentered design and some tools it provides. We provide a number of examples of security problems for which Incentive Centered Design might be helpful. We elaborate with a general screening model that offers strong design principles for a class of security problems.
Intrusion detection and intrusion prevention on a large network: a case study
Authors: Tom Dunigan, Greg Hinkel
Venue: Proceedings of the 1st conference on Workshop on Intrusion Detection and Network Monitoring - Volume 1 (1999)

This paper describes the general requirements for an Intrusion Prevention and Detection System and the methods used to prevent and detect intrusions into Oak Ridge National Laboratory's network. In this paper we describe actual intrusions, how they were detected, and how they were handled. We also describe the monitoring tools we use for detecting intrusions.
Applying evolutionary programming to improve branch classification in the hybrid branch prediction method using Switch-Counter
Authors: Ruijian Zhang, W. K. King, Qingdong Wang
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Providing accurate branch prediction is critical to exploit instruction level parallelism effectively. This paper shows that applying evolutionary programming in the hybrid branch prediction method using Switch-Counter can improve branch classification, thus increase branch prediction accuracy. In our study, various EP strategies and algorithms are applied to search the optimum branch classification. Using trace-driven simulation on SPEC2000, SPEC95, and MediaBench benchmarks, we measured the branch prediction accuracy of the hybrid prediction method using Switch-Counter both applying EP and without applying EP. The empirical results show that EP could gain impressive improvements of the branch classification so that the hybrid method achieved higher prediction accuracy comparing with that without EP. The contributions for the improvements by various genetic operators are evaluated as well. The empirical results also show that the EP algorithm applied in branch classification converges fairly fast. This limits the increase of compilation time. The attempt at applying EP to improve branch classification is an innovation in branch prediction. The results are quite encouraging.
Generic Access to Web and Grid-based Symbolic Computing Services: the SymGrid-Services Framework
Authors: Alexandru Carstea, Marc Frincu, Georgiana Macariu, Dana Petcu, Kevin Hammond
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

Modern Grid and Web technologies provide straightforward access to applications and services running on remote resources. The user (which may be a software developer or even an application) should be able to discover such a service and dynamically load an interface to interact with it. While some software systems support either fully or partially automatic creation of client software to access Web services, fewer support Grid services in the same way. This paper introduces a new system that automatically generates client software to allow access to both Grid and Web services. Although designed as a stand-alone tool for accessing any Web or Grid service, we demonstrate its usefulness in the context of the SymGrid framework for Grid-based symbolic computations.