ppxscal/embedding_network huggingface dataset:
Magnetocapacitance of a MODFET under two-dimensional periodic potential modulation
Authors: G. S. Kliros, P. C. Divari
Venue: Microelectronics Journal (2007)

In this paper we present calculations on the density of states (DOS) and the magnetocapacitance of the 2DEG in a MODFET under two-dimensional (2D) weak periodic modulation in the presence of a perpendicular magnetic field. Adopting a Gaussian broadening of magnetic-field-dependent width, we present explicit and simple expressions for the DOS, valid for the relevant weak magnetic fields and modulation strengths. As the modulation strength in both directions increase, beating patterns of the magnetocapacitance oscillations are observed in the low-magnetic-field range (Weiss-oscillations regime) which are absent in the 1D weak modulation case.
A hierarchical internet object cache
Authors: Anawat Chankhunthod, Peter B. Danzig, Chuck Neerdaels, Michael F. Schwartz, Kurt J. Worrell
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

This paper discusses the design and performance of a hierarchical proxy-cache designed to make Internet information systems scale better. The design was motivated by our earlier trace-driven simulation study of Internet traffic. We challenge the conventional wisdom that the benefits of hierarchical file caching do not merit the costs, and believe the issue merits reconsideration in the Internet environment. The cache implementation supports a highly concurrent stream of requests. We present performance measurements that show that our cache outperforms other popular Internet cache implementations by an order of magnitude under concurrent load. These measurements indicate that hierarchy does not measurably increase access latency. Our software can also be configured as a Web-server accelerator; we present data that our httpd-accelerator is ten times faster than Netscape's Netsite and NCSA 1.4 servers. Finally, we relate our experience fitting the cache into the increasingly complex and operational world of Internet information systems, including issues related to security, transparency to cache-unaware clients, and the role of file systems in support of ubiquitous wide-area information systems.
The TraPa System: A Web-Based System to Improve Cross-Border Patient Transfers
Authors: Stathis Th. Konstantinidis, Panagiotis D. Bamidis, Slobodan Marolov, Costas Pappas
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Communication, collaboration and exchange of information between health units via the internet have been thoroughly discussed and many web systems have been proposed. However, little work has been done at patients' transportation using web-based technologies. We propose a web-based system which provides an e-platform for patient transportation between health units in the same country as well as in different countries, taking into consideration the cross-country legal framework for patient transportation. To this extend, the system prototype is tested for the case of cross-border patient transfer between Greece and Bulgaria.
Operational information systems: an example from the airline industry
Authors: Van Oleson, Greg Eisenhaur, Calton Pu, Karsten Schwan, Beth Plale, Dick Amin
Venue: Proceedings of the 1st conference on Industrial Experiences with Systems Software - Volume 1 (2000)

Our research is motivated by the scaleability, availability, and extensibility challenges in deploying open systems based, enterprise operational applications. We present Delta's mid-tier Operational Information Systems (OIS) as an approach for leveraging its legacy operational OLTP infrastructure, to participate in the emerging world of electronic commerce, as well as enable new applications. The approach is to place minimally intrusive 'taps' into the legacy OLTP systems to capture transactions as they occur for consistent replay in the mid-tier OIS. One important issue addressed by our work is the processing, and dissemination of information in the mid-tier system itself, potentially serving hundreds of thousands of access and display points, distributed across a highly geographically distributed system (e.g. airports world wide), and also involving large 'working sets' of operational data, used by applications that require rapid response and also rapid recovery from failures. To address the scaleability, availability, and cost of this OIS infrastructure, we are researching cluster computing techniques, as well as, devising replication and failover techniques. To address the communications scaleability requirements, we are experimenting with novel event-based implementations of information transport and processing, that include reliable multicast variations.
Efficient Indexing of Heterogeneous Data Streams with Automatic Performance Configurations
Authors: Ken Q. Pu, Ying Zhu
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

We study the problem of indexing continuous data streams in which data are heterogeneous in structure. Such data streams arise naturally in many real-life scenarios such as sensor networks. Our index structure uses bitmap based techniques to efficiently sketch the structures to allow space-efficient lossless archiving of the data stream. It also allows very fast query processing on the archived data stream. Furthermore, our index structure adapts to structural evolutions of the stream to ensure good indexing and querying performance both in space and time. We developed a cost-based optimization framework so the indexing engine adjusts its configuration at run-time to adapt to changes in the data stream. By means of linear feedback controllers, structural clustering and steepest gradient ascent optimization, our indexing engine can achieve excellent performance without any human intervention.
Trajectory Retrieval Using Similarity Measure According to Link Type between Motion Verbs
Authors: Miyoung Cho, Chang Choi, Sicheon You, Minchang Lee, Jonghei Ra, Pankoo Kim
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Our main objective is to compare distance measurement for the motion verbs from the cognitive point of view and that of computable point of view. We use motion verbs to represent moving of objects as high-level features from the cognitive point of view. In the previous works, Specially, we focus on antonym relation and not just limit research only on the basic relations(IS_A, PART_OF) in hierarchical model and get suitable weight value(0.7) using correlation coefficient. In this paper, we propose trajectory retrieval using similarity measure according to link type between motion verbs.
SLAM: Sleep-Wake Aware Local Monitoring in Sensor Networks
Authors: Issa Khalil, Saurabh Bagchi, Ness B. Shroff
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Sleep-wake protocols are critical in sensor networks to ensure long-lived operation. However, an open problem is how to develop efficient mechanisms that can be incorporated with sleep-wake protocols to ensure both long-lived operation and a high degree of security. Our contribution in this paper is to address this problem by using local monitoring, a powerful technique for detecting and mitigating control and data attacks in sensor networks. In local monitoring, each node oversees part of the traffic going in and out of its neighbors to determine if the behavior is suspicious, such as, unusually long delay in forwarding a packet. Here, we present a protocol called SLAM to make local monitoring parsimonious in its energy consumption and to integrate it with any extant sleep-wake protocol in the network. The challenge is to enable sleep-wake in a secure manner even in the face of nodes that may be adversarial and not wake up nodes responsible for monitoring its traffic. We prove analytically that the security coverage is not weakened by the protocol. We perform simulations in ns-2 to demonstrate that the performance of local monitoring is practically unchanged while listening energy saving of 30 to 129 times is achieved, depending on the network load.
Simplified path metric updating in the M algorithm for VLSI implementation
Authors: L. Gonzalez
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

A VLSI structure for path metric updating in the M algorithm is presented. The architecture is based on the combination of a modified Batcher's (1968) odd-even merging network and a bitonic selection procedure. A feature of the trellis structure allows to replace an existing solution based on two 2M-item sorting operations by three M-item sorting operations with an additional one-layer bitonic merge. These three sorting networks and the bitonic merging procedure permit a reduction of up to 50% in hardware complexity.
Combining Reconstruction and Discrimination with Class-Specific Sparse Coding
Authors: Stephan Hasler, Heiko Wersing, Edgar Körner
Venue: Neural Computation (2007)

Sparse coding is an important approach for the unsupervised learning of sensory features. In this contribution, we present two new methods that extend the traditional sparse coding approach with supervised components. Our goal is to increase the suitability of the learned features for classification tasks while keeping most of their general representation capability. We analyze the effect of the new methods using visualization on artificial data and discuss the results on two object test sets with regard to the properties of the found feature representation.
Reducing hardware requirement in FIR filter design
Authors: M. A. Soderstrand
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

A hardware optimization scheme based upon minimum-adder CSD multiplier blocks is combined with a technique for trading adders for delays to reduce hardware requirements for fixed-coefficient FIR filters well below that achieved with either technique alone. The technique starts with determining the minimum order filter necessary to meet the filter specifications assuming infinite precision filter coefficients. Then the coefficients are truncated to B bits (which may be specified by the designer) and the order of the filter is increased, if necessary, to meet the filter specifications. From this baseline filter, an exhaustive search is carried out by increasing the filter order (adding delays) and decreasing the bits (decreasing adders) to search for the minimum hardware. At each search point, the minimum-adder CSD multiplier block approach is used to assure the optimum hardware realization. The result is the implementation in FPGAs or VLSI of FIR filters with less real estate and/or with less power consumption.
Harmonic signal modeling using adaptive nonlinear function estimation
Authors: T. Wigren
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

It is well-known that sine waves produce harmonic overtones when passed through static nonlinear functions. This paper describes a new algorithm where an arbitrary periodic signal is estimated recursively. The estimated signal model is typically parameterised as a real sine wave with unknown frequency in cascade with a piecewise linear function. A recursive Gauss-Newton prediction error identification algorithm for joint estimation of the driving frequency and the parameters of the nonlinear output function can then be derived. The approach handles colored measurement disturbances and gives a direct measure of the size of the nonlinearity that corresponds to the harmonic spectrum. The Cramer-Rao bound (CRB) is also calculated in the paper.
Delivery of high quality uncompressed video over ATM to windows NT desktop
Authors: Sherali Zeadally
Venue: Proceedings of the USENIX Windows NT Workshop on The USENIX Windows NT Workshop 1997 (1997)

The emergence of high bandwidth applications such as medical visualization and virtual reality has exposed significant deficiencies in network, protocol, and end-system design. In this paper we discuss important end-system issues which arise when supporting applications demanding networked delivery and manipulation of uncompressed video to the desktop. Our experimental network environment consists of DEC Alpha workstations using the Windows NT 4.0 operating system and connected via an ATM switch. We present the design and initial results of a network architecture that demonstrates the creation, manipulation, and distribution of high-quality uncompressed video using standard industry-based technologies. In addition, we discuss networking performance results and present a simple Windows Sockets 2.0 cost model for TCP/IP and UDP/IP over ATM. An early potential market where this work is expected to have a direct impact is video editing in motion picture and television studios. In this context, we hope to provide cost-effective networked solutions aimed at replacing costly dedicated video editing hardware with the versatile capabilities of general purpose workstations and nonproprietary network solutions.
High accuracy registration of translated and rotated images using hierarchical method
Authors: B. D. Jeffs
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

A new hierarchical image registration algorithm is presented which achieves subpixel accuracy for images with both translational and rotational movements. This wavenumber domain algorithm is efficient compared to the conventional approaches based on interpolation or correlation in spatial or frequency domain. In addition, the proposed approach is robust and can achieve subpixel accuracy registration even when the images contain aliasing errors due to undersampling. This hierarchical searching method which involved coarse and fine search further enhances the convergence time of registration. The accuracy of the proposed approach is demonstrated through computer simulations for different types of images.
Quality Assurance for Autonomous Systems--A Review of Model-Based Methods
Authors: Ina Schieferdecker
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

A major field in research and development are open, distributed, communication-intense systems, which are currently characterized by increasing heterogeneity in structure and technologies and by growing complexity and behavior dynamics. Autonomous systems are being investigated in order to return to manageable and stable systems whose operation and maintenance is affordable. By resolving the obstacles of current systems via enlarged system autonomy, the quality assurance of such dynamic, reconfigurable, adjustable systems becomes problematic. This keynote reviews requirements, methods and approaches for model-based quality assurance of autonomous systems.
Ensemble classification by critic-driven combining
Authors: D. J. Miller
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

We develop new rules for combining estimates obtained from each classifier in an ensemble. A variety of combination techniques have been previously suggested, including averaging probability estimates, as well as hard voting schemes. We introduce a critic associated with each classifier, whose objective is to predict the classifier's errors. Since the critic only tackles a two-class problem, its predictions are generally more reliable than those of the classifier, and thus can be used as the basis for our suggested improved combination rules. While previous techniques are only effective when the individual classifier error rate is p
On the performance of TCP splicing for URL-aware redirection
Authors: Ariel Cohen, Sampath Rangarajan, Hamilton Slye
Venue: Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2 (1999)

This paper describes the design, implementation and performance of a layer-7 switch which supports URL-aware redirection of HTTP traffic. Currently, there are several vendors who are beginning to announce the availability of such switches in the market, but little or no implementation and performance information is available. We discuss design issues pertaining to such switches through a prototype implementation of a URL-aware switch in the Linux kernel, and analyze the performance of our implementation. We investigate the use of TCP splicing as a mechanism for improving the performance of the switch; we explore whether TCP splicing will benefit URL-aware redirection even though HTTP connections, on average, are short-lived and transfer small amounts of data. Results from our implementation show that TCP splicing does improve the performance of URL-aware switches that handle short-lived HTTP connections. Our results also re-affirm earlier findings that TCP splicing substantially improves the performance of any application-layer proxy when large amounts of data are transferred through the splice.
Engineering design in the freshman year at the University of Alabama-Foundation Coalition program
Authors: J. Parker, D. Cordes, J. Richardson
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

A pair of courses, Foundations of Engineering I and II, form the two-semester engineering component of Foundation Coalition's integrated freshman year at the University of Alabama (UA). These courses replace two existing freshman engineering courses which are devoted to computer programming and engineering graphics. In order to present a more realistic and interesting introduction to engineering as a profession, the courses focuses on the engineering design process. Both courses are organized around four three-week-long design projects. The projects are selected from a variety of areas, covering the breadth of engineering disciplines taught at UA. The design projects also complement the current subject matter of the integrated mathematics, chemistry and physics courses. For example, while both physics and chemistry are introducing the ideal gas law, the engineering project involves the design of a compressed natural gas tank for an automotive application. Each design project requires a team report in written and oral form. The students are introduced to a variety of computer tools to aid their presentation of reports, such as word processors, spreadsheets and presentation packages. Student access to the Internet and e-mail is also provided. This paper provides an in-depth examination of the first of these two courses. It includes a brief overview of the relationships that exist between the integrated courses in the freshman year a detailed examination of the nature and scope of the design projects included within the course, and feedback from both faculty and students on the merits of the approach.
New foundations for efficient authentication, commutative cryptography, and private disjointness testing
Authors: Ronald L. Rivest
Venue:  (2006)

This dissertation presents new constructions and security definitions related to three areas: authentication, cascadable and commutative crytpography, and private set operations. Existing works relevant to each of these areas fall into one of two categories: efficient solutions lacking formal proofs of security or provably-secure, but highly inefficient solutions. This work will bridge this gap by presenting new constructions and definitions that are both practical and provably-secure. The first contribution in the area of efficient authentication is a provably-secure authentication protocol named HB+. The HB+ protocol is efficient enough to be implemented on extremely low-cost devices, or even by a patient human with a coin to flip. The security of HB+ is based on the hardness of a long-standing learning problem that is closely related to coding theory. HB+ is the first authentication protocol that is both practical for low-cost devices, like radio frequency identification (RFID) tags, and provably secure against active adversaries. The second contribution of this work is a new framework for defining and proving the security of cascadable crypt osystems, specifically commutative cryptosystems. This new framework addresses a gap in existing security definitions that fail to handle cryptosystems where ciphertexts produced by cascadable encryption and decryption operations may contain some message-independent history. Several cryptosystems, including a new, practical commutative cryptosystem, are proven secure under this new framework. Finally, a new and efficient private disjointness testing construction named HW is offered. Unlike previous constructions, HW is secure in the face of malicious parties, but without the need for random oracles or expensive zero-knowledge protocols. HW is as efficient as previous constructions and may be implemented using standard software libraries. The security of HW is based on a novel use of subgroup assumptions. These assumptions may prove useful in solving many other private set operation problems. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
An empirical evaluation of deep architectures on problems with many factors of variation
Authors: Hugo Larochelle, Dumitru Erhan, Aaron Courville, James Bergstra, Yoshua Bengio
Venue: Proceedings of the 24th international conference on Machine learning (2007)

Recently, several learning algorithms relying on models with deep architectures have been proposed. Though they have demonstrated impressive performance, to date, they have only been evaluated on relatively simple problems such as digit recognition in a controlled environment, for which many machine learning algorithms already report reasonable results. Here, we present a series of experiments which indicate that these models show promise in solving harder learning problems that exhibit many factors of variation. These models are compared with well-established algorithms such as Support Vector Machines and single hidden-layer feed-forward neural networks.
A soft-decision approach for symbol segmentation within handwritten mathematical expressions
Authors: S. Lehmberg
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

A soft-decision approach for symbol segmentation within on-line sampled handwritten mathematical expressions is presented. Based on stroke-specific features as well as geometrical features between the strokes a symbol hypotheses net is generated. For assistance additional knowledge obtained by a symbol prerecognition stage is used. The results achieved by the segmentation and prerecognition experiments indicate the performance of our approach.
Formal concept analysis based on hierarchical class analysis
Authors: Yaohua Chen, Yiyu Yao
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

The study of concept formation and learning is a central topic in cognitive informatics. Formal concept analysis can be viewed as an approach on this topic based on a formal context. In this paper, we study some basic data units for formal concept analysis based on hierarchical class analysis. In a formal context, objects and attributes can be grouped into equivalence classes based on equivalence relations. The order relations define the hierarchical structures of the equivalence classes. There exist some basic sets of objects and attributes that are used to not only reflect the equivalence relation and order relation, but also constitute all formal concepts derived from the formal context. The properties of these basic sets are studied and analyzed.