ppxscal/embedding_network huggingface dataset:
Incremental Maintenance of Materialized Object-Oriented Views in MultiView: Strategies and Performance Evaluation
Authors: Harumi A. Kuno, Elke A. Rundensteiner
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

View materialization is a promising technique for achieving the data sharing and virtual restructuring capabilities needed by advanced applications such as data warehousing and workflow management systems. Much existing work addresses the problem of how to maintain the consistency of materialized relational views under update operations. However, little progress has been made thus far regarding the topic of view materialization in object-oriented databases (OODBs). In this paper, we demonstrate that there are several significant differences between the relational and object-oriented paradigms that can be exploited when addressing the object-oriented view materialization problem. First, we propose techniques that prune update propagation by exploiting knowledge of the subsumption relationships between classes to identify branches of classes to which we do not need to propagate updates and by using derivation ordering to eliminate self-canceling propagation. Second, we use encapsulated interfaces, combined with the fact that any unique database property is inherited from a single location, to provide a "registration service" by which virtual classes can register their interest in specific properties and be notified upon modification of those properties. Third, we introduce the notion of hierarchical registrations that further optimizes update propagation by organizing the registration structures according to the class generalization hierarchy, thereby pruning the set of classes that are notified of updates. We have successfully implemented all proposed techniques in the MultiView system on top of the GemStone OODBMS. To the best of our knowledge, MultiView is the first OODB view system to provide updatable materialized virtual classes and virtual schemata. In this paper, we also present a cost model for our update algorithms, and we report results from the experimental studies we have run on the MultiView system, measuring the impact of various optimization strategies incorporated into our materialization update algorithms.
Lower boumds of Ramsey numbers based on cubic residues
Authors: Wenlong Su, Qiao Li, Haipeng Luo, Guiqing Li
Venue: Discrete Mathematics (2002)

A method to improve the lower bounds for Ramsey numbers R(k,l) is provided: one may construct cyclic graphs by using cubic residues modulo the primes in the form p = 6m + 1 to produce desired examples. In particular, we obtain 16 new lower bounds, which are R(6, 12) ≥ 230, R(5,15) ≥ 242, R(6,14) ≥ 284, R(6,15) ≥ 374, R(6, 16) ≥ 434, R(6,17) ≥ 548, R(6,18) ≥ 614, R(6,19) ≥ 710, R(6,20) ≥ 878, R(6,21) ≥ 884, R(7,19) ≥ 908, R(6,22) ≥ 1070, R(8,20) ≥ 1094, R(7,21) ≥ 1214, R(9,20) ≥ 1304, R(8,21) ≥ 1328.
How to efficiently capture on-chip inductance effects: introducing a new circuit element K
Authors: Anirudh Devgan, Hao Ji, Wayne Dai
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

On-chip inductance extraction and analysis is becoming increasing critical. Inductance extraction can be difficult, cumbersome and impractical on large designs as inductance depends on the current return path -- which is typically unknown prior to extracting and simulating the circuit model. In this paper, we propose a new circuit element, K, to model inductance effects, at the same time being easier to extract and analyze. K is defined as inverse of partial inductance matrix L, and has locality and sparsity normally associated with a capacitance matrix. We propose to capture inductance effects by directly extracting and simulating K, instead of partial inductance, leading to much more efficient procedure which is amenable to full chip extraction. This proposed approach has been verified through several simulation results.
A Constraint Learning Feedback Dynamic Model for Stereopsis
Authors: Amol Bokil, Alireza Khotanzad
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

This paper presents a stereo matcher inspired by the earlier work of Marr and Poggio [7]. Two major extensions are introduced: the algorithm is extended to gray-level images, and the inhibitory/excitatory weights of the model are learned rather than set a priori according to ¿uniqueness¿ and ¿continuity¿ constraints. Gray level stereo pairs of real scenes with known disparity maps are used to train the model. The trained system is successfully tested on other gray level stereo pairs of real scenes as well as a set of random dot stereograms (RDS). Performance is compared to a recent stereo matching algorithm.
Enabling unimodular transformations
Authors: Ron Sass, Matt Mutka
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

The development of a unimodular transformation theory and associated algorithms has renewed interest in Fortran do loops that are not perfectly (or tightly) nested. In this paper we summarize a number of techniques that convert imperfectly nested loops into perfectly nested loops. We examined over 25,000 lines of scientific Fortran kernels and benchmarks. Statistics are reported on how often imperfect loops occur and how effective two transformations (scalar forward substitution and loop distribution) are at converting imperfectly nested loops into perfectly nested loops. Further, we describe a compiler that integrates scalar forward substitution, loop distribution, and unimodular transformations while maintaining the basic philosophy of unimodular transformation theory. While our data indicate that imperfectly nested loops still present a problem, the compiler we describe is no more limited by perfectly nested loops than other restructuring compilers available today.
Index Organizations for Object-Oriented Database Systems
Authors: Elisa Bertino, Paola Foscoli
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

In this paper we present an indexing technique providing support for queries involving complex, nested objects and inheritance hierarchies. This technique is compared with two techniques obtained from more traditional organizations. The three techniques are evaluated using an analytical cost model. The discussion will be cast in the framework of object-oriented databases. However, results are applicable to data management systems characterized by features such as complex objects and inheritance hierarchies.
Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes
Authors: J. M. Kumar, L. M. Patnaik
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

A new interconnection topology-the extended hypercube-consisting of an interconnection network of k-cubes is discussed. The extended hypercube is a hierarchical, expansive, recursive structure with a constant predefined building block. The extended hypercube retains the positive features of the k-cube at different levels of hierarchy and at the same time has some additional advantages like reduced diameter and constant degree of a node. The paper presents an introduction to the topology of the extended hypercube and analyzes its architectural potential in terms of message routing and executing a classof highly parallel algorithms. Topological properties and performance studies of the extended hypercube are presented.
Transitioning Desktops to Set Tops
Authors: Frederick L. Kitson, Vasudev Bhaskaran, Devendra Kalra
Venue: IEEE Design Test (1995)

The capture, processing, transmission, digital storage, and display of multimedia requires a delicate balance between available MIPS, Mbytes/sec and Mbytes of dynamic and static memory. Video is the component of multimedia that provides the most visual realism while placing the most stress on computer system design regardless of price point. In a similar manner, interactive real-time, 3D animation graphics produces demanding data processing and transmission challenges.Multimedia applications of the future will combine interactive video and graphics in new and exciting forms. One example of this integration will be presented as well as some results on operations on video in the compressed domain. We will also address some of the issues and innovations in engendering media-enabled computer systems from conventional desktops such as workstations with modern RISC processors to the next generation of consumer computers known as settops.To provide a specific example, an MPEG1 decoder that is capable of real-time playback of video and audio on HP's RISC-based workstations will be described. Real-time playback is achieved by examining the complete MPEG1 decoding pipeline and optimizing the algorithms used for the various stages of the video decompression process. The settop functions and general architecture will be delineated with an overview of some system issues that affect the performance of interactive video. The desktop community is seeking TV-like functions such as surround sound and broadcast quality video, while the home consumer desires computer-like interactivity and connectivity.
Fast 3-D inductance extraction in lossy multi-layer substrate
Authors: Minqing Liu, Tiejun Yu, Wayne W. M. Dai
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

A mixed potential integral equation (MPIE) technique combined with fast multi-layer Green's functions and Gaussian Jacobi high order techniques is used to compute the 3-D frequency dependent inductances and resistances in lossy multi-layered substrate. Compared to FastHenry, a multipole-accelerated 3-D inductance extraction program, the algorithm presented here is more accurate and faster for lossy multilayer structures due to two reasons. First, substrate and optional ground plane's lose and coupling effect are efficiently modeled by multilayer Green's functions, while the Green's functions are efficiently calculated via window-based acceleration technique. Second, Gaussian Jacobi-based high order techniques are used to capture the singularity of the current distribution at metal edges, leading to significant reduction of problem size and speed-up of computation.
Protecting Mobile Web-Commerce Agents with Smartcards
Authors: Stefan Fünfrocken
Venue: Autonomous Agents and Multi-Agent Systems (2001)

Mobile agents add a new communication paradigm to traditional network communication mechanisms. So far, the pervasiveness of publicly available mobile agent platforms is not given. Offering a seamless integration of mobile agents into the WWW is crucial for the success of mobile agents. One of the growing fields of interest in the Web is the area of electronic commerce. Mobile Web-commerce agents could play a prominent role in future electronic commerce scenarios, if the malicious host problem could be solved. Our paper describes the integration of mobile agents into the Web and the use of Java cards to allow mobile agents to store and securely transport data. This is achieved by allowing the agents to carry encrypted code parts which can only be decrypted by the Java card attached to the target host of the next migration.
On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability
Authors: Baogang Xu
Venue: Discrete Mathematics (2002)

In this paper, we prove a structural theorem of Lebesgue's type concerning some unavoidable configurations for graphs which can be embedded on surfaces of nonnegative characteristic and in which no two 3-cycles share a common vertex. As a corollary, we get a result about choosability of graphs embedded in surface of positive characteristic.
Incremental algorithms for dispatching in dynamically typed languages
Authors: Yoav Zibin, Joseph (Yossi) Gil
Venue: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2003)

A fundamental problem in the implementation of object-oriented languages is that of a frugal dispatching data structure, i.e., support for quick response to dispatching queries combined with compact representation of the type hierarchy and the method families. Previous theoretical algorithms tend to be impractical due to their complexity and large hidden constant. In contrast, successful practical heuristics, including Vitek and Horspool's compact dispatch tables (CT) [16] designed for dynamically typed languages, lack theoretical support. In subjecting CT to theoretical analysis, we are not only able to improve and generalize it, but also provide the first non-trivial bounds on the performance of such a heuristic.Let n,ml denote the total number of types, messages, and different method implementations, respectively. Then, the dispatching matrix, whose size isnm, can be compressed by a factor of at most ι ≡ (nm)/l. Our main variant to CT achieves a compression factor of ½ √ι. More generally, we describe a sequence of algorithms CT1, CT2, CT3,..., where CTd achieves compression by a factor of (at least) 1overdι1—1/d, while using d memory dereferencing operations during dispatch. This tradeoff represents the first bounds on the compression ratio of constant-time dispatching algorithms.A generalization of these algorithms to a multiple-inheritance setting, increases the space by a factor of κ1-1/d, where κ is a metric of the complexity of the topology of the inheritance hierarchy, which (as indicated by our measurements) is typically small. The most important generalization is an incremental variant of the CTd scheme for a single-inheritance setting. This variant uses at most twice the space of CTd, and its time of inserting a new type into the hierarchy is optimal. We therefore obtain algorithms for efficient management of dispatching in dynamic-typing, dynamic-loading languages, such as Smalltalk and even the Java invokeinterface instruction.
Oriented Structure of the Occlusion Distortion: Is It Reliable?
Authors: Weichuan Yu, Gerald Sommer, Steven Beauchemin, Kostas Daniilidis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

In the energy spectrum of an occlusion sequence, the distortion term has the same orientation as the velocity of the occluding signal. Recent works claimed that this oriented structure can be used to distinguish the occluding velocity from the occluded one. Here, we argue that the orientation structure of the distortion cannot always work as a reliable feature due to the rapidly decreasing energy contribution. This already weak orientation structure is further blurred by a superposition of distinct distortion components. We also indicate that the superposition principle of Shizawa and Mase for multiple motion estimation needs to be adjusted.
Discovering interesting inclusion dependencies: application to logical database tuning
Authors: Stéphane Lopes, Jean-Marc Petit, Farouk Toumani
Venue: Information Systems (2002)

Inclusion dependencies together with functional dependencies form the most important data dependencies used in practice. Inclusion dependencies are important for various database applications such as database design and maintenance, semantic query optimization and efficient view maintenance of data warehouse. Existing approaches for discovering inclusion dependencies consist in producing the whole set of inclusion dependencies holding in a database, leaving the task of selecting the interesting ones to an expert user.In this paper, we take another look at the problem of discovering inclusion dependencies. We exploit the logical navigation, inherently available in relational databases through workloads of SQL statements, as a guess to automatically find out only interesting inclusion dependencies. This assumption leads us to devise a tractable algorithm for discovering interesting inclusion dependencies. Within this framework, approximate dependencies, i.e. inclusion dependencies which almost hold, are also considered.As an example, we present a novel application, namely self-tuning the logical database design, where the discovered inclusion dependencies can be used effectively.
To the Digital Age: Research Labs, Start-up Companies, and the Rise of MOS Technology
Authors: Ross Knox Bassett
Venue:  (2002)

:The metal-oxide-semiconductor (MOS) transistor is the fundamental element of digital electronics. The tens of millions of transistors in the home of a typical American-in personal computers, automobiles, appliances, and toys-are almost all MOS transistors. To the Digital Age:Research Labs, Start-up Companies, and the Rise of MOS Technology is the first book devoted to the history of the MOS transistor, which overthrew the previously dominant bipolar transistor and made digital electronics ubiquitous. Combining technological with corporate history, To the Digital Age examines the breakthroughs of individual innovators as well as the research and development power (and problems) of companies such as IBM, Intel, and Fairchild. Bassett discusses how the MOS transistor was invented but spurned at Bell Labs, and then how, in the early 1960s, spurred on by the possibilities of integrated circuits, RCA, Fairchild, and IBM all launched substantial MOS R&D programs. The development of the MOS transistor involved an industry-wide effort, and Bassett emphasizes how communication among researchers from different firms played a critical role in advancing the new technology. Bassett sheds substantial new light on the development of the integrated circuit, Moore's Law, the success of Silicon Valley start-ups as compared to vertically integrated East Coast firms, the development of the microprocessor, and IBM's multi-billion-dollar losses in the early 1990s. To the Digital Age offers a captivating account of the intricate R&D process behind a technological device that transformed modern society. Author Biography: Ross Knox Bassett is an assistant professor of history at NorthCarolina State University.
Load Sharing in Distributed Multimedia-on-Demand Systems
Authors: Y. c. Tay, HweeHwa Pang
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

Service providers have begun to offer multimedia-on-demand services to residential estates by installing isolated, small-scale multimedia servers at individual estates. Such an arrangement allows the service providers to operate without relying on a high-speed, large-capacity metropolitan area network, which is still not available in many countries. Unfortunately, installing isolated servers could incur very high server costs, as each server requires spare bandwidth to cope with fluctuations in user demand. In this paper, we explore the feasibility of linking up several small multimedia servers to a (limited-capacity) network, and allowing servers with idle retrieval bandwidth to help out servers that are temporarily overloaded; the goal is to minimize the waiting time for service to begin. We identify four characteristics of load sharing in a distributed multimedia system that differentiate it from load balancing in a conventional distributed system. We then introduce a GWQ load sharing algorithm that fits and exploits these characteristics; it puts all servers' pending requests in a global queue, from which a server with idle capacity obtains additional jobs. The performance of the algorithm is captured by an analytical model, which we validate through simulations. Both the analytical and simulation models show that the algorithm vastly reduces wait times at the servers. The analytical model also provides guidelines for capacity planning. Finally, we propose an enhanced GWQ+L algorithm that allows a server to reclaim active local requests that are being serviced remotely. Simulation experiments indicate that the scheduling decisions of GWQ+L are optimal, in the sense that it enables the distributed servers to approximate the performance of a large centralized server.
Methods for Structural Parametric Synthesis of Output Stage of Keying Radionavigation Transmitters with a Feeder
Authors: Ahmad Ali Al-Noman, V. F. Dmitrikov, A. V. Vashurin, S. P. Zarubin, Y. I. Osetrov, A. P. Ohinchenko, S. B. Pisarev
Venue: Wireless Personal Communications: An International Journal (1999)

This paper addresses the problem of the directly connected antenna to the keying radionavigation transmitter. The proposed solution to this problem is to connect a feeder between the bandpass circuit of the transmitter output stage and the transmitting antenna. Operational specific features of the keying transmitter of pulse-phase radionavigation system are considered for a long feeder. Methods for the structural parametric synthesis of output stage of a transmitter having a coaxial feeder are proposed in order to generate a signal of prescribed shape.
Adaptive Prefetching and Storage Reorganization In A Log-Structured Storage System
Authors: Chye Lin Chee, Hongjun Lu, Hong Tang, C. v. Ramamoorthy
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

We present a storage management system that has the ability to adapt to the data access characteristics of the application that uses it based on collection and analysis of runtime statistics. This feature is especially useful in the storage management layer of database systems, where applications exhibit relatively predictable access patterns. Adaptive reorganization is performed by the storage management system in a manner that optimizes the access patterns of the system for which it is used. We enhance the log-structured storage system that naturally caters for write optimization, with the addition of a statistics collection mechanism to determine data access patterns of applications. The storage system can serve as a testbed for a variety of statistics analysis and clustering mechanisms. Higher level application-specific data clustering mechanisms can be used to override the storage system's low-level clustering mechanisms. In addition, the analysis techniques and reorganization scheme can be used in other storage systems. Performance results from our prototype show potential response time speedups of up to 83 percent over the basic log-structured file system in the best case, using a combination of storage reorganization and prefetching.
Virtual Environments for Treating the Fear of Heights
Authors: Larry F. Hodges, Rob Kooper, Thomas C. Meyer, Barbara O. Rothbaum, Dan Opdyke, Johannes J. de Graaff, James S. Williford, Max M. North
Venue: Computer (1995)

Since the spring of 1993, the authors have been investigating the possibility of using virtual environments to conduct exposure therapy of individuals with psychological disorders. They describe their pilot study, which used virtual reality graded exposure techniques to treat acrophobia--the fear of heights. Two main issues are addressed: the extent to which subjects felt actually present in height situations, and the efficacy of the treatment conducted using virtual height situations. Acrophobia, a simple phobia, is characterized by marked anxiety upon exposure to heights, by avoidance of heights, and by interference in functioning as a result of this fear. Behavioral therapy of acrophobia has included exposing the subject to anxiety-producing stimuli while allowing this anxiety to attenuate. In vivo graded exposure is a common and effective treatment for acrophobia. For example, if a patient is afraid of heights, therapy sessions might begin by having the patient look through a third floor window with the therapist present. In subsequent sessions, the patient might move up to a window on the tenth floor. Other common locations for in vivo therapy are outside stairways, balconies, bridges, and elevators. The authors designed a number of virtual height situations to correspond to the types used for in vivo stimuli. The study yielded remarkable results, in particular, the sense of presence experienced by subjects. Subjects experienced a range of physical anxiety symptoms consistent with the apparent threat they encountered. Subject responses were also apparently modified, as evidenced by the decrease in anxiety, avoidance, and negative attitudes toward heights. The results also support the notion that more elements of the fear structure are changed than those directly addressed in therapy.