ppxscal/embedding_network huggingface dataset:
Efficient mining of XML query patterns for caching
Authors: Liang Huai Yang, Mong Li Lee, Wynne Hsu
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

As XML becomes ubiquitous, the efficient retrieval of XML data becomes critical. Research to improve query response time has been largely concentrated on indexing paths, and optimizing XML queries. An orthogonal approach is to discover frequent XML query patterns and cache their results to improve the performance of XML management systems. In this paper, we present an efficient algorithm called FastXMiner, to discover frequent XML query patterns. We develop theorems to prove that only a small subset of the generated candidate patterns needs to undergo expensive tree containment tests. In addition, we demonstrate how the frequent query patterns can be used to improve caching performance. Experiments results show that FastXMiner is efficient and scalable, and caching the results of frequent patterns significantly improves the query response time.
Media design aesthetics: emotional and entertaining experience design for the ubiquitous society
Authors: Masa Inakage
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

Our society is in the midst of paradigm shift from mass media-based society to personal media-based society, driven by the digital revolution. Mass media and communication media are converging to form massively connected personal and everywhere media. In the personal and everywhere media, the interaction of people, artifacts, and the environment contributes to the emotional and entertaining experience in the daily life. Thus, the experience design is the core activity of media design, and aesthetics is the key component in the media design formula. Our research has focused on the experience design of entertaining contents for personal and everywhere media. We have termed this emerging area of content genre as "Ubiquitous Content", and defined the genre as contents for living people, those which bond closely with life. They are content experienced through interaction between people, artifacts and the environment, all existing in the real world. Ubiquitous Content is realized through the embedding of ubiquitous technology such as sensors, and the designing of embodied human interactions. The talk touches various areas of media design through the lens of content design and supporting technology research drawing on the recent research projects at our research team on Ubiquitous Content at Keio University. As an example of Ubiquitous Content that uses the environment, "Breathing Network Edition" is a set of network-connected affective lamps that are breathing as if they are alive. The speed of breathing depends on the liveliness of the environment nearby. The lamp listens to the conversation and breathes to act as a conversation metronome. In the normal setting, each lamp breathes at its own rhythm but they occasionally all synchronize. An example of entertaining artifact is "Clay Tone". Clay play is one of the acts of play partaken by children in many kindergartens. Clay Tone is a sound generation system that can be manipulated by physically handling bodies of clay. With Clay Tone, we aim to create a new kind of clay play that ties itself with music, encouraging imagination. "livePic" is a drawing board which expands the drawing experience. "livePic" provides embodied interactions between users and users' drawings. Users can feel as if they magically bring their drawings to life. After they draw something, they can animate the picture with physical interactions, such as their breaths. "livePic" has possibilities to stimulate potential creativity and sensibility of the children and to grow their imagination throughout their youth.
A Ladder-Structured Decision Tree for Recognizing Tumors in Chest Radiographs
Authors: D. H. Ballard
Venue: IEEE Transactions on Computers (1976)

We describe a hierarchic computer procedure for the detection of nodular tumors in a chest radiograph. The radiograph is scanned and consolidated into several resolutions which are enhanced and analyzed by a hierarchic tumor recognition process. The hierarchic structure of the tumor recognition process has the form of a ladder-like decision tree. The major steps in the decision tree are: 1) find the lung regions within the chest radiograph, 2) find candidate nodule sites (potential tumor locations) within the lung regions, 3) find boundaries for most of these sites, 4) find nodules from among the candidate nodule boundaries, and 5) find tumors from among the nodules. The first three steps locate potential nodules in the radiograph. The last two steps classify the potential nodules into nonnodules, nodules which are not tumors, and nodules which are tumors.
Primitives for workload summarization and implications for SQL
Authors: Surajit Chaudhuri, Prasanna Ganesan, Vivek Narasayya
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Workload information has proved to be a crucial component for database-administration tasks as well as for analysis of query logs to understand user behavior and system usage. These tasks require the ability to summarize large SQL workloads. In this paper, we identify primitives that are important to enable many important workload-summarization tasks. These primitives also appear to be useful in a variety of practical scenarios besides workload summarization. Today's SQL is inadequate to express these primitives conveniently. We discuss possible extensions to SQL and the relational engine to efficiently support such summarization primitives.
Continuous Monitoring of Physiologic Variables with a Dedicated Minicomputer
Authors: L. J. Thomas
Venue: Computer (1975)

A custom designed system employing advanced communication techniques1,2 and unique video displays3 for computer-based patient monitoring (see Figure 1) has been designed and built by the Washington University Biomedical Computer Laboratory in cooperation with the Department of Surgery and Barnes Hospital. Planning of the system, designed specifically for the hospital's four-bed Cardiothoracic Surgical Intensive Care Unit, began in 1971, and the completed system was installed in March of 1973.
Issues Regarding New Product Release in Semiconductor Manufacturing
Authors: Choon-Sang Chew
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Analog testing to prove device parametric and functional performance in accordance with datasheet specifications is recognized as one of the crucial elements throughout new product development cycle time. Of course, unless fabrication process and operation are developed and controlled to absolute flawless levels, device testing is inevitable in manufacturing. For the analog space of parts, the manufacturing test, handling and operation can be influenced by, target performance, ability to meaningfully measure specs, size, packaging, environment, required equipment/setup, completeness of handoffs and robustness of test cell platforms.
Cache-based Computer Systems
Authors: K. R. Kaplan, R. O. Winder
Venue: Computer (1973)

A cache-based computer system employs a fast, small memory -the " cache" - interposed between the usual processor and main memory. At any given time the cache contains as much as possible the instructions and data the processor needs; as new information is needed it is brought from main memory to cache, displacing old information. The processor tends to operate with a memory of cache speed but with main memory cost-per-bit. This configuration has analogies with other systems employing memory hierarchies, such as "paging" or "virtual memory" systems. In contrast with these latter, a cache is managed by hardware algorithms, deals with smaller blocks of data (32 bytes, for example, rather than 4096), provides a smaller ratio of memory access times (5:1 rather than 1000: 1), and, because of the last factor, holds the processor idle while blocks of data are being transferred from main memory to cache rather than switching to another task. These are important differences, and may suffice to make the cache-based system cost effective in many situations where paging is not.
Semi-automatic schema integration in Clio
Authors: Laura Chiticariu, Mauricio A. Hernández, Phokion G. Kolaitis, Lucian Popa
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Schema integration is the problem of finding a unified representation, called the integrated schema, from a set of source schemas that are related to each other. The relationships between the source schemas can be represented via correspondences between schema elements or via some other forms of schema mappings such as constraints or views. The integrated schema can be viewed as a means for dealing with the heterogeneity in the source schemas, by providing a standard representation of the data. Schema integration has received much of attention in the research literature [1, 2, 6, 8, 10] and still remains a challenge in practice. Existing approaches require substantial amount of human feedback during the integration process and moreover, the outcome of these approaches is a single integrated schema. In general, however, there can be multiple possible schemas that integrate data in different ways and each may be valuable in a given scenario.
Interworking of heterogeneous access networks and QoS provisioning via IP multimedia core networks
Authors: Spyridon L. Tompros, Spyridon Denazis
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

Moving towards packet networks, where IP will have a prominent role, constitutes nowadays a widely accepted perception of future communications, the first instance of which has begun to materialise with the IP multimedia core network subsystem (IMS). By specification, IMS is the first implementation towards reaching converged communications which allows users to communicate with video, audio and multimedia content, via any fixed, mobile and wireless access network type, with controllable QoS. To enable IMS communications across heterogeneous networks, incorporating UMTS, WLAN and fixed IP access points, 3GPP and ETSI's TISPAN currently work on schemes for controlling bandwidth allocation at the service level by employing logical interfaces that carry SIP messages. This article analyzes how interconnection between such heterogeneous networks may be performed on real platforms. In this effort, special attention is paid to the way the various interconnection possibilities can affect end-to-end QoS provisioning.
PRiM: An i*-based process reengineering method for information systems specification
Authors: Gemma Grau, Xavier Franch, Neil A. M. Maiden
Venue: Information and Software Technology (2008)

Information system development can often be addressed as a business process reengineering practice, either because it automates some human-based processes or because it replaces an existing legacy system. Therefore, observing and analysing current processes can enable analysts to converge on the specification of the new system, generating and evaluating new system alternatives throughout. In this paper, we propose a method to support this reengineering process that analyses the strengths and weaknesses of the current process; considers the strategic needs of the organization; provides guidelines for the prescriptive construction of i^* models; and drives the systematic generation and evaluation of alternative technological and organizational solutions for the new system.
Modeling cryptographic properties of voice and voice-based entity authentication
Authors: Giovanni Di Crescenzo, Munir Cochinwala, Hyong S. Shim
Venue: Proceedings of the 2007 ACM workshop on Digital identity management (2007)

Strong and/or multi-factor entity authentication protocols are of crucial importancein building successful identity management architectures. Popular mechanisms to achieve these types of entity authentication are biometrics, and, in particular, voice, for which there are especially interesting business cases in the telecommunication and financial industries, among others. Despite several studies on the suitability of voice within entity authentication protocols, there has been little or no formal analysis of any such methods. In this paper we embark into formal modeling of seemingly cryptographic properties of voice. The goal is to define a formal abstraction for voice, in terms of algorithms with certain properties, that are of both combinatorial and cryptographic type. While we certainly do not expect to achieve the perfect mathematical model for a human phenomenon, we do hope that capturing some properties of voice in a formal model would help towards the design and analysis of voice-based cryptographic protocols, as for entity authentication. In particular, in this model we design and formally analyze two voice-based entity authentication schemes, the first being a voice-based analogue of the conventional password-transmission entity authentication scheme. We also design and analyze, in the recently introduced bounded-retrieval model [4], one voice-and-password-based entity authentication scheme that is additionally secure against intrusions and brute-force attacks, including dictionary attacks.
An investigation and comparison of artificial neural network and time series models for Chinese food grain price forecasting
Authors: H. F. Zou, G. P. Xia, F. T. Yang, H. Y. Wang
Venue: Neurocomputing (2007)

This paper compares the predictive performance of ARIMA, artificial neural network and the linear combination models for forecasting wheat price in Chinese market. Empirical results show that the combined model can improve the forecasting performance significantly in contrast with its counterparts in terms of the error evaluation measurements. However, as far as turning points and profit criterions are concerned, the ANN model is best as well as at capturing a significant number of turning points. The results are conflicting when implementing dissimilar forecasting criteria (the quantitative and the turning points measurements) to evaluate the performance of three models. The ANN model is overall the best model, and can be used as an alternative method to model Chinese future food grain price.
File Structures, Program Structures, and Attributed Grammars
Authors: L. Logrippo
Venue: IEEE Transactions on Software Engineering (1983)

A language for defining sequential file structures, characterized as nested sequences of records having in common certain keys and types, is presented. "Input schemata" are defined as program skeletons that contain all the necessary control structure to process a specified file. A method for obtaining an input schema from the corresponding file structure definition is given. The method is based on attributed grammars, and has been implemented in the programming language PROLOG. This constitutes a formalization of some aspects of the data-directed program design method of Jackson and Warnier. Examples of applications of this method to business data processing problems such as file updating and report generation are given.
Query expansion and dimensionality reduction: Notions of optimality in Rocchio relevance feedback and latent semantic indexing
Authors: Miles Efron
Venue: Information Processing and Management: an International Journal (2008)

Rocchio relevance feedback and latent semantic indexing (LSI) are well-known extensions of the vector space model for information retrieval (IR). This paper analyzes the statistical relationship between these extensions. The analysis focuses on each method's basis in least-squares optimization. Noting that LSI and Rocchio relevance feedback both alter the vector space model in a way that is in some sense least-squares optimal, we ask: what is the relationship between LSI's and Rocchio's notions of optimality? What does this relationship imply for IR? Using an analytical approach, we argue that Rocchio relevance feedback is optimal if we understand retrieval as a simplified classification problem. On the other hand, LSI's motivation comes to the fore if we understand it as a biased regression technique, where projection onto a low-dimensional orthogonal subspace of the documents reduces model variance.
An ILP algorithm for post-floorplanning voltage-island generation considering power-network planning
Authors: Wan-Ping Lee, Hung-Yi Liu, Yao-Wen Chang
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Power optimization is a crucial concern for modern circuit designs. Multiple supply voltages (MSV's) provide an effective technique for the power optimization. This paper addresses the voltage-island generation problem for MSV designs at the post-floorplanning stage. We first present a general formulation of this problem that considers level-shifter planning and power-network routing resources. Without loss of solution quality, we propose an economical graph-based representation that needs only a linear number of nodes to the block number to model the block adjacency in a floorplan for the voltage-island generation. In contrast, previous works need a quadratic number of nodes. To tackle the addressed problem, we employ an ILP formulation which consists of (1) level-shifter aware wirelength estimation to capture the timing overhead, (2) voltage-island-clustering inequalities to avoid complicated constraint transformations, and (3) inequalities to capture the power-network routing-resource usage. Compared with previous works, our algorithm can produce better voltage islands in terms of power-network routing resources. Experimental results show that our algorithm can effectively reduce the power-network routing resource by up to 19.46% with a reasonable overhead of 4.03% more power consumption and using reasonable running time.
A Theoretical Study on Wire Length Estimation Algorithms for Placement with Opaque Blocks
Authors: Tan Yan, Shuting Li, Y. Takashima, H. Murata
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

How to estimate the shortest routing length when certain blocks are considered as routing obstacles is becoming an essential problem for block placement because HPWL, is no longer valid in this case. Although this problem is well studied in computational geometry (Mitchell, 2000), the research results are neither well-known to the CAD community nor presented in a way easy for CAD researchers to ultilize their establishment. With the help of some recent notions in block placement, this paper interprets the research result in Atallah and Chen (1991) and de Rezende et al. (1985), which gives the best algorithm for this problem as we know, in a way more concise and more friendly to CAD researchers. Besides, we also tailor its algorithm to VLSI CAD application. As the result, we present a method that estimates the shortest obstacle-avoiding routing length in 0(M2 + N) time for a placement with M blocks and N 2-pin nets.
On the rational (k+1, k+1)-type difference equation
Authors: Stevo Stević
Venue: Journal of Applied Mathematics and Computing (2007)

In this paper we investigate the boundedness character of the positive solutions of the rational difference equation of the form xn+1 = a0+Σj=1k ajxn-j+1/b0+Σj=1kbjxn-j+1, n=0, 1... where k ε N, and aj, bj, j = 0,1 ....,k, are nonnegative numbers such that b0+Σj=1k bjxn-j+1 > 0 for every n ε N ∪ {0}. In passing we confirm several conjectures recently posed in the paper: E. Camouzis, G. Ladas and E. P. Quinn, On third order rational difference equations (part 6), J. Differ. Equations Appl. 11(8) (2005), 759-777.
Case study: ITU-T recommendation X.805 applied to an enterprise environment&mdash;banking
Authors: David Ramirez
Venue: Bell Labs Technical Journal (2007)

Base station costs are dominated by the cost of radio frequency (RF) units, that is, the duplexers, the power amplifiers, and the radio cards. But Moore's law is not applicable to these components. It only applies to the digital processing units of a base station, such as the baseband processing, line interface, and central control cards. The continuous size reduction of features at the chip level allows for increasingly higher integration of digital functionality. But in RF units, form factor is often a function of wavelength, which prevents a higher level of integration. Significant form factor and cost reductions in RF, therefore, will not arise from ongoing incremental improvements. They will result only through architectural innovation. However, changes in architecture predominantly require certain key technologies that are not yet available. Within the context of European Union (EU) research funding, the key technologies that are necessary to turn future RF system architectural visions into reality are being developed. This paper elaborates on the RF system vision and the research framework into which Bell Labs Europe is embedded, for conducting collaborative research to acquire the missing technological assets. &copy; 2007 Alcatel-Lucent.
A silicone rubber mould of the heart
Authors: Francisco F. E. S. C. Torrent-Guasp, W. F. Whimster, K. Redmann
Venue: Technology and Health Care (1997)

The macroscopical structure of the ventricular myocardium has been an unsolved problem since the XVIth century, when Anatomy started as an authentic science. Since then the spatial organization of the myocardial fibres has represented, as Pettigrew says, &ldquo;an arrangement so unusual and perplexing, that it has long been considered as forming a kind of Gordian knot in Anatomy. Of the complexity of the arrangement I need not speak further than to say that Vesalius, Albinus, Haller and De Blainville, all confessed their inability to unravel it&rdquo;. What is shown in the present paper is the result of an anatomical work, developed over 43 years, by means of which it has been shown that the ventricular myocardial mass consists of a band, curled in a helical way, which extends from the pulmonary artery to the aorta. This is illustrated by a silicone rubber model cast from an actual unrolled myocardial band.
Design of Distributed Databases on Local Computer Systems with a Multiaccess Network
Authors: B. W. Wah
Venue: IEEE Transactions on Software Engineering (1985)

Concurrency control, distribution design, and query processing are some of the important issues in the design of distributed databases. In this paper, we have studied these issues with respect to a relational database on a local computer system connected by a multiaccess broadcast bus. A broadcast bus allows information to be distributed efficiently, and hence simplifies the solutions to some of these issues. A transaction model that integrates the control strategies in concurrency control and query processing is proposed. In concurrency control, the lock, unlock, and update of data are achieved by a few broadcasts. A dynamic strategy is used in query processing, as less data are transferred when compared to a static strategy. The status information needed in dynamic query processing can be conveniently obtained by broadcasting. Lastly, some NP-hard file placement problems are found to be solvable in polynomial time when updates are broadcast.