ppxscal/embedding_network huggingface dataset:
Expressive power and data complexity of nonrecursive query languages for lists and trees (extended abstract)
Authors: Evgeny Dantsin, Andrei Voronkov
Venue: Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2000)

We extend the traditional query languages by primitives for handling lists and trees. Our main results characterize the expressive power and data complexity of the following extended languages: (1) relational algebra with lists and trees, (2) nonrecursive Datalog@@@@ with lists and trees, (3) nonrecursive Prolog with lists and trees, (4) first-order logic over lists and trees.Languages (2)-(4) turn out to have the same expressive power; their range-restricted fragments have the same expressive power as (1). Every query in these languages is a boolean combination of range-restricted queries.We also prove that these query languages have polynomial data complexity under any &ldquo;reasonable&rdquo; encoding of inputs. Furthermore, under a natural encoding of inputs, languages (2)-(4) have the same expressive power as first-order logic over finite structures, therefore their data complexity is in A Co. Thus, the use of lists and trees in nonrecursive query languages gives no gain in the expressiveness. This contrasts with a huge difference between the nonelementary program complexity of extended languages (2)-(4) and the PSPA CE program complexity of their relational counterparts.Our results partly explain why lists and trees are not so widely used in nonrecursive query languages as other collection types.
Quality of service over Ethernet for telelearning applications
Authors: J. M. Arco, B. Alarcos, A. M. Hellín, D. Meziat
Venue: Proceedings of the 4th annual SIGCSE/SIGCUE ITiCSE conference on Innovation and technology in computer science education (1999)

The objective of this investigation is to implement a technology that provides measurements of quality of service (QoS) of established local area networks. Improvements of the required infrastructure for applications of telelearning (videoconference, electronic blackboard, shared applications hellip;) are implemented with a minimal cost. We are implementing features of ATM on Ethernet local area networks, through the protocol "Cells In Frame" (CIF). This protocol encapsulates ATM cells in Ethernet frames using CIF specification. Values of measured parameters reveal that the implementation provides the ATM quality of service necessary for telelearning traffic type.
The role of contextual haptic and visual constraints on object manipulation in virtual environments
Authors: Yanqing Wang, Christine L. MacKenzie
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

An experiment was conducted to investigate the role of surrounding haptic and visual information on object manipulation in a virtual environment. The contextual haptic constraints were implemented with a physical table and the contextual visual constraints included a checkerboard background (&ldquo;virtual table&rdquo;). It was found that the contextual haptic constraints (the physical table surface) dramatically increased object manipulation speed, but slightly reduced spatial accuracy, compared to free space. The contextual visual constraints (presence of the checkerboard) actually showed detrimental effects on both object manipulation speed and accuracy. Implications of these findings for human-computer interaction design are discussed.
Control Variates for Probability and Quantile Estimation
Authors: Timothy C. Hesterberg, Barry L. Nelson
Venue: Management Science (1998)

In stochastic systems, quantiles indicate the level of system performance that can be delivered with a specified probability, while probabilities indicate the likelihood that a specified level of system performance can be achieved. We present new estimators for use in simulation experiments designed to estimate such quantiles or probabilities of system performance. All of the estimators exploit control variates to increase their precision, which is especially important when extreme quantiles (in the tails of the distribution of system performance) or extreme probabilities (near zero or one) are of interest. Control variates are auxiliary random variables with known properties-in this case, known quantiles-and a strong stochastic association with the performance measure of interest. Since transforming a control variate can increase its effectiveness, we propose both continuous and discrete approximations to the optimal (variance-minimizing) transformation for estimating probabilities, and then invert the probability estimators to obtain corresponding quantile estimators. We also propose a direct control-variate quantile estimator that is not based on inverting a probability estimator. An empirical study using queueing, inventory and project-planning examples shows that substantial reductions in mean squared error can be obtained when estimating the 0.9, 0.95, and 0.99 quantiles.
Class AB Output Stages of the Integrated Amplifiers
Authors: Vadim Ivanov
Venue: Analog Integrated Circuits and Signal Processing (1999)

General approach to the design of the class AB output stages of bipolar and CMOS amplifiers based on common-mode negative feedback is discussed. Frequency compensation of the result multiloop system is provided by feed forward links. Effectiveness of the proposed method is shown on designs of rail-to-rail bipolar and CMOS output stages, all-NPN output stage, output stage of the hearing aids IC. Common design mistakes are shown using industry-standard ICs.
Fast performance analysis of bus-based system-on-chip communication architectures
Authors: Kanishka Lahiri, Anand Raghunathan, Sujit Dey
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

This paper addresses the problem of efficient and accurate performance analysis to drive the exploration and design of bus-based System-on-Chip (SOC) communication architectures. Our technique fills a gap in existing techniques for system-level performance analysis, which are either too slow to use in an iterative communication architecture design framework (e.g., simulation of the complete system), or are not accurate enough to drive the design of the communication architecture (e.g., techniques that perform a &ldquo;static&rdquo; analysis of the system performance). The proposed system-level performance analysis technique consists of (i) initial co-simulation performed after IIW/SW partitioning and mapping, with the communication between components modeled in an abstract manner (e.g., as events or data transfers), (ii) extraction of abstracted symbolic traces, represented as a Bus and Synchronization Event (BSE) Graph, that captures the activity of the various system components and their communication over time, and (iii) manipulation of the BSE Graph using the bus parameters, to derive the behavior of the system accounting for effects of the bus architecture. We present experimental results on several example systems, including a TCP/IP network interface card sub-system. The results indicate that our performance estimation technique is over two orders of magnitude faster than performing a complete system simulation, while being very accurate (within 2.2% of performance estimates derived from accurate HW/SW co-simulation).
Lx: a technology platform for customizable VLIW embedded processing
Authors: Paolo Faraboschi, Geoffrey Brown, Joseph A. Fisher, Giuseppe Desoli, Fred Homewood
Venue: ACM SIGARCH Computer Architecture News (2000)

Lx is a scalable and customizable VLIW processor technology platform designed by Hewlett-Packard and STMicroelectronics that allows variations in instruction issue width, the number and capabilities of structures and the processor instruction set. For Lx we developed the architecture and software from the beginning to support both scalability (variable numbers of identical processing resources) and customizability (special purpose resources). In this paper we consider the following issues. When is customization or scaling beneficial? How can one determine the right degree of customization or scaling for a particular application domain? What architectural compromises were made in the Lx project to contain the complexity inherent in a customizable and scalable processor family? The experiments described in the paper show that specialization for an application domain is effective, yielding large gains in price/performance ratio. We also show how scaling machine resources scales performance, although not uniformly across all applications. Finally we show that customization on an application-by-application basis is today still very dangerous and much remains to be done for it to become a viable solution.
Image inpainting
Authors: Marcelo Bertalmio, Guillermo Sapiro, Vincent Caselles, Coloma Ballester
Venue: Proceedings of the 27th annual conference on Computer graphics and interactive techniques (2000)

Inpainting, the technique of modifying an image in an undetectable form, is as ancient as art itself. The goals and applications of inpainting are numerous, from the restoration of damaged paintings and photographs to the removal/replacement of selected objects. In this paper, we introduce a novel algorithm for digital inpainting of still images that attempts to replicate the basic techniques used by professional restorators. After the user selects the regions to be restored, the algorithm automatically fills-in these regions with information surrounding them. The fill-in is done in such a way that isophote lines arriving at the regions' boundaries are completed inside. In contrast with previous approaches, the technique here introduced does not require the user to specify where the novel information comes from. This is automatically done (and in a fast way), thereby allowing to simultaneously fill-in numerous regions containing completely different structures and surrounding backgrounds. In addition, no limitations are imposed on the topology of the region to be inpainted. Applications of this technique include the restoration of old photographs and damaged film; removal of superimposed text like dates, subtitles, or publicity; and the removal of entire objects from the image like microphones or wires in special effects.
Professional software engineering education
Authors: Peter J. Denning
Venue: Annals of Software Engineering (1999)

How might universities organize new lines of business in software engineering professional education&quest; Professional education enables practicing professionals to achieve defined levels of competence and to be certified according to standards in their professions. This kind of education is offered at very few universities. This paper proposes a conceptual framework for designing professional education programs&semi; software engineering is the central example. It suggests a strategy for combining traditional degree programs and professional certificate programs, in any mix suitable for a department and its clientele.
On the rapid prototyping and design of a wireless communication system on a chip (abstract only)
Authors: Brian Kelley
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

The evolutionary convergence of computing, integrated circuit technology, and advances in wireless communications has led to an explosive growth of personal communication devices and services (PCS). In fact, the dramatic &ldquo;Moores Law&rdquo; shrinkage of IC devices, itself, has led to an unprecedented ability to place increasingly complex systems on a chip (SoC). In a wireless communication environment, the integration task is made more difficult by the need to integrate RF, mixed signal, and digital systems. Furthermore, the digital system design task generally requires a mapping of heterogeneous stacks of software processes onto a similarly diverse collection of DSPs, uPs, and ASICs.In this presentation, we give an overview of a modern wireless communication device and describe advanced system level design methodologies utilized for rapid prototyping and design of current and next generation systems.
A novel application development environment for large-scale scientific computations
Authors: X. Shen, W. Liao, A. Choudhary, G. Memik, M. Kandemir, S. More, G. Thiruvathukal, A. Singh
Venue: Proceedings of the 14th international conference on Supercomputing (2000)

Our results demonstrate that our novel application development environment provides both ease-of-use and high performance for large-scale, I/O-intensive scientific applications.
Personal imaging and lookpainting as tools for personal documentary and investigative photojournalism
Authors: Steve Mann
Venue: Mobile Networks and Applications (1999)

A means and apparatus for covert capture of extremely high-resolution photorealistic images is presented. The apparatus embodies a new form of user-interface &ndash; instead of the traditional &ldquo;point and click&rdquo; metaphor which was thought to be the simplest photography had to offer, what is proposed is a &ldquo;look&rdquo; metaphor in which images are generated through the natural process of looking around, in a manner that does not require conscious thought or effort. These &ldquo;lookpaintings&rdquo; become photographic/videographic memories that may, at times, exceed the quality attainable with even large and cumbersome professional photographic film cameras, yet they may be captured through a device that resembles ordinary sunglasses. The method is based on long-term psychophysical adaptation using a covert sunglass-based reality-mediating apparatus, together with two new results in image processing. The first new result is a means of estimating the true projective coordinate transformation between successive pairs of images, and the second is that of estimating, to within a single unknown scalar constant, the quantity of light arriving at the image plane. Furthermore, what is captured is more than just a picture. The resulting environment map may be explored by one or more remote participants who may also correspond and interact with the wearer during the actual shooting process, giving rise to computer supported collaborative (collective) photography, videography, shared photographic/videographic memory, etc.
Binary translation and architecture convergence issues for IBM system/390
Authors: Michael Gschwind, Kemal Ebcioğlu, Erik Altman, Sumedh Sathaye
Venue: Proceedings of the 14th international conference on Supercomputing (2000)

We describe the design issues in an implementation of the ESA/390 architecture based on binary translation to a very long instruction word (VLIW) processor. During binary translation, complex ESA/390 instructions are decomposed into instruction &ldquo;primitives&rdquo; which are then scheduled onto a wide-issue machine. The aim is to achieve high instruction level parallelism due to the increased scheduling and optimization opportunities which can be exploited by binary translation software, combined with the efficiency of long instruction word architectures. A further aim is to study the feasibility of a common execution platform for different instruction set architectures, such as ESA/390, RS?6000, AS/400 and the Java Virtual Machine, so that multiple systems can be built around a common execution platform.
Information Subsystem of the Chemical Coefficients K1 and K2 As the Base for the Study of the Ecological Factors That Influence Human Health
Authors: Nives Štambuk-Giljanović, Berezina Matoković
Venue: Journal of Medical Systems (1999)

With regard to the relatively limited water supply in the area of Dalmatia (Southern Croatia), water supply system and health care institutions are especially interested in observing and monitoring the waters, as well as preserving their quality. The ecological need to sum up the work on water quality investigations led us to monitor the environment. Because it is necessary, from the informatical aspect, to organize mass ecological health data into databases, the relational database for the research of chemical analyses (coefficients K1 and K2) as the methodological foundation for the study of the ecological factors that influence human health is defined in this paper. Results used for the prototype implementation subsystem of the chemical water analysis control are based on the investigations of the Water Examination Department of the Public Health Institute of the Split-Dalmatian County (Croatia). Over 2500 data comprised the examination sample. The software used included Win'95, MO'97, and Paradox 4.5, while the hardware used included Pentium II 200 MHz, floppy, 64 MB RAM, HDD 2,1 GB, CD&times;24, HP Ljet 4L.
Low power synthesis of sum-of-products computation (poster session)
Authors: K. Masselos, S. Theoharis, P. K. Merakos, T. Stouraitis, C. E. Goutis
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

Novel techniques for the power efficient synthesis of sum-of-product computations are presented. Simple and efficient heuristics for scheduling and assignment are described. Different partly static cost functions are proposed to drive the synthesis tasks. The proposed cost functions target the power consumption either in the buses connecting the functional units with the storage elements or inside the functional units. The partly static nature of the proposed cost functions reduces the time of the synthesis procedure. Experimental results from different relevant digital signal processing algorithmic kernels prove that the proposed synthesis techniques lead to significant power savings.
On random sampling over joins
Authors: Surajit Chaudhuri, Rajeev Motwani, Vivek Narasayya
Venue: ACM SIGMOD Record (1999)

A major bottleneck in implementing sampling as a primitive relational operation is the inefficiency of sampling the output of a query. It is not even known whether it is possible to generate a sample of a join tree without first evaluating the join tree completely. We undertake a detailed study of this problem and attempt to analyze it in a variety of settings. We present theoretical results explaining the difficulty of this problem and setting limits on the efficiency that can be achieved. Based on new insights into the interaction between join and sampling, we develop join sampling techniques for the settings where our negative results do not apply. Our new sampling algorithms are significantly more efficient than those known earlier. We present experimental evaluation of our techniques on Microsoft's SQL Server 7.0.
Risk factors in enterprise wide information management systems projects
Authors: Mary Sumner
Venue: Proceedings of the 2000 ACM SIGCPR conference on Computer personnel research (2000)

In the past several years many organizations have initiated enterprise-wide information management systems projects, using such packages as SAP, Peoplesoft, and Oracle. These projects often represent the single largest investment in an information systems project in the history of these companies, and in many cases the largest single investment in any corporate-wide project. These enterprise-wide information management systems projects bring about a host of new questions, because they represent a new type of management challenge. Some of these questions and issues are:What are the major risk factors associated with implementing traditional MIS projects?What are the major risk factors associated with enterprise-wide information management projects?What new risk factors need to be addresed in ERP projects? What are some of the risks in MIS projects that are not factors in ERP projects?Based upon the findings, enterprise-wide information management systems projects pose new opportunities and significant challenges. Some of the &ldquo;summary&rdquo; ideas which are re-iterated throughout the case studies are: Justify the enterprise-wide projects based upon cost-justification and economies of scale.Re-engineer business processes to &ldquo;fit&rdquo; the package, rather than trying to modify the software to &ldquo;fit&rdquo; the organization's current business processes.Identify and implement strategies to re-skill the existing IT workforce and acquire external expertise through vendors and consultants when needed. Utilize &ldquo;business analysts,&rdquo; with both business knowledge and technology knowledge.Obtain top management support for the project and establish strong project leadership. Make a commitment to training end-users in custom report evelopment. Manage change through leadership, effective communications, and the role of a champion.
Shock Graphs and Shape Matching
Authors: Kaleem Siddiqi, Ali Shokoufandeh, Sven J. Dickinson, Steven W. Zucker
Venue: International Journal of Computer Vision (1999)

We have been developing a theory for the generic representation of 2-D shape, where structural descriptions are derived from the shocks (singularities) of a curve evolution process, acting on bounding contours. We now apply the theory to the problem of shape matching. The shocks are organized into a directed, acyclic shock graph, and complexity is managed by attending to the most significant (central) shape components first. The space of all such graphs is highly structured and can be characterized by the rules of a shock graph grammar. The grammar permits a reduction of a shock graph to a unique rooted shock tree. We introduce a novel tree matching algorithm which finds the best set of corresponding nodes between two shock trees in polynomial time. Using a diverse database of shapes, we demonstrate our system&lsquo;s performance under articulation, occlusion, and moderate changes in viewpoint.
Immanant Inequalities for Laplacians of Trees
Authors: Onn Chan, T. K. Lam
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

Let ${\cal T}_n$ be the collection of trees on $n$ vertices. Let ${\cal T}_n(b;p,q),$ ${\cal T}_n(m;k)$, and ${\cal T}_n(d;k)$ be subsets of ${\cal T}_n$ comprising trees, each whose vertex set has bipartition (p,q), trees whose maximum matching has size $k$, and trees of diameter k, respectively. Brualdi and Goldwasser Discrete Math., 48 (1984), pp. 1--21] obtained lower bounds on the permanent of the Laplacian matrix of a tree from each of these subsets. They characterized the tree in each of these subsets whose Laplacian matrix has the smallest permanent as the "double star" in ${\cal T}_n(b;p,q)$, the "spur" in ${\cal T}_n(m;k)$, and the "broom" in ${\cal T}_n(d;k).$ In this work, the concept of vertex orientations and a new interpretation of the matching numbers in a tree allow us to formulate a unified approach to extending these results to all other immanant functions besides the permanent. It turns out that the ``double star'' and the "spur" remain the tree in ${\cal T}_n(b;p,q)$ and the tree in ${\cal T}_n(m;k)$, respectively, whose Laplacian matrix has the smallest immanant value for all immanants. For ${\cal T}_n(d;k)$ the tree that has the smallest immanant value varies with the immanant function, but it belongs to a small family of "caterpillars" whose legs are all concentrated on a single vertex.
Performance evaluation of routing algorithms under various network configuration parameters
Authors: Shin-Jer Yang
Venue: International Journal of Network Management (1997)

Routing is a relevant issue for maintaining good performance and successfully operating in a network. Many types of routing algorithms have been proposed, such as shortest-path, centralized, distributed and flow-based. This article not only defines the relationship among performance indicators and network configuration parameters, but also presents a practical method for improving routing decisions. &copy; 1997 John Wiley Sons, Ltd.