ppxscal/embedding_network huggingface dataset:
Maximising the cost effectiveness of BMD referral for DXA using ultrasound as a selective population pre-screen
Authors: C. M. Langton, P. A. Ballard, D. K. Langton, D. W. Purdie
Venue: Technology and Health Care (1997)

Bone mineral density (BMD) referral for dual energy X-ray absorptiometry (DXA) is generally based upon agreed clinical referral criteria (CRC). The aim of this study was to determine whether ultrasound measurements of Broadband Ultrasound Attenuation (BUA) and velocity (VOS) provide a superior selective pre-screen referral method for BMD assessment by DXA. 107 women aged 60-69 years (64.2\pm 2.8) had BMD measurements at lumbar spine and right femoral neck along with ultrasound BUA and VOS measurements of the left calcaneus. Each subject completed an extensive clinical and social questionnaire to ascertain those who would have met one or more of the five general clinical referral criteria adopted by our Centre. Each subject was classified by DXA using the WHO criteria as normal, osteopenic or osteoporotic at lumbar spine or femoral neck. The cost per osteoporotic subject correctly identified was calculated. As a reference, based upon DXA measurements alone on all 107 subjects, the cost per osteoporotic subject identified would be &pound; 185. If subjects had been referred using the clinical referral criteria the cost is &pound; 171. For assessment of referral by BUA or VOS, an additional charge for ultrasound measurement of all subjects was incorporated. At a BUA of 60 dB MHz^{-1} the cost per osteoporotic subject is &pound; 107. Ultrasound velocity or a combination of BUA or VOS with clinical referral criteria did not provide a significantly reduced cost than the current clinical referral criteria alone. This study has demonstrated that BUA provides an improved referral procedure to that currently achieved with clinical referral criteria and supports the concept of BUA being used as a selective pre-screen for DXA in 7th decade subjects.
On Converse and Saturation Results for Tikhonov Regularization of Linear Ill-Posed Problems
Authors: Andreas Neubauer
Venue: SIAM Journal on Numerical Analysis (1997)

In this paper we prove some new converse and saturation results for Tikhonov regularization of linear ill-posed problems Tx=y, where T is a linear operator between two Hilbert spaces.
Document presentation and query formulation in Muse
Authors: S. Gibbs, D. Tsichritzis
Venue: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval (1986)

Several problems of document presentation and query, formulation arising in systems dealing with multimedia documents are discussed. Examples from a prototype distributed multimedia document filing system are described.
Low Complexity Bit-Parallel Multipliers for a Class of Finite Fields
Authors: Huapeng Wu, M. Anwarul Hasan
Venue: IEEE Transactions on Computers (1998)

New implementations of bit-parallel multipliers for a class of finite fields are proposed. The class of finite fields is constructed with irreducible AOPs (all one polynomials) and ESPs (equally spaced polynomials). The size and time complexities of our proposed multipliers are lower than or equal to those of the previously proposed multipliers of the same class.
Shifting Inductive Bias with Success-Story Algorithm, AdaptiveLevin Search, and Incremental Self-Improvement
Authors: Jürgen Schmidhuber, Jieyu Zhao, Marco Wiering
Venue: Machine Learning (1997)

We study task sequences that allow for speeding up the learner&lsquo;s average reward intake through appropriate shifts of inductive bias (changes of the learner&lsquo;s policy). To evaluate long-term effects of bias shifts setting the stage for later bias shifts we use the &ldquo;success-story algorithm&rdquo; (SSA). SSA is occasionally called at times that may depend on the policy itself. It uses backtracking to undo those bias shifts that have not been empirically observed to trigger long-term reward accelerations (measured up until the current SSA call). Bias shifts that survive SSA represent a lifelong success history. Until the next SSA call, they are considered useful and build the basis for additional bias shifts. SSA allows for plugging in a wide variety of learning algorithms. We plug in (1) a novel, adaptive extension of Levin search and (2) a method for embedding the learner&lsquo;s policy modification strategy within the policy itself (incremental self-improvement). Our inductive transfer case studies involve complex, partially observable environments where traditional reinforcement learning fails.
A design of a distributed full text retrieval system
Authors: Ian A. MacLeod, Patrick Martin, Brent Nordin
Venue: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval (1986)

This paper describes the design of a distributed information system for full text retrieval. The system is similar in functionality to STAIRS and is being developed on a network of PC's interconnected by PC Network. The implementation is built on a generalisation of the remote procedure call concept. Communications are based upon the recent CCITT X.400 standard. Examples are given of the design strategy for a subset of the STAIRS system.
Designing high performance CMOS microprocessors using full custom techniques
Authors: William J. Grundmann, Dan Dobberpuhl, Randy L. Allmon, Nicholas L. Rethman
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

In this paper, we describe a full customCMOS design methodology and supporting CADtechnologies used to develop ALPHA and StrongARMmicroprocessors at Digital Semiconductor. The paper issubdivided into four parts, starting with a description ofthe design methodology and general CAD flows.Additional sections focus on two particular areas ofinterest: high performance low-power and full customdesign benefits and verification issues.
Simulation of the Illinois Waterway locks system
Authors: D. Brent Bandy
Venue: Proceedings of the 28th conference on Winter simulation (1996)

A computer simulation model of the locks system on the Illinois Waterway is described. The model was developed using ProModel for Windows and includes boats and barge tows traveling through the locks system and operation of the locks. Entities with attributes are used to simulate the boats and barge tows that enter the system, travel either upstream or downstream through the locks, and then leave the system. Locations are used for the locks and for entry and exiting of the boats and barge tows. The operation of the locks is simulated through the use of variables, resources, and operation logic in the processing module. The handling of both boats and barge tows in the locks greatly complicates the simulation model, since their differences in size is significant. For example, a lockage can easily handle ten or more boats, while a barge tow with fifteen barges can require a double lockage (typically nine barges for the first lockage and six barges and the tow boat for the second lockage). At times both barge tows and boats are included in a single lockage.
Teaching introductory simulation in 1996: from the first assignment to the final presentation
Authors: Peter Lorenz, Thomas J. Schriber
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Rapid developments in computing and simulation are providing continuing challenges for the design and delivery of courses in discrete-event simulation. Such courses not only need to keep up with relevant developments, but also have the potential for taking advantage of some of the developments in the structuring of the courses. For example, animation can be the topic initially taken up in a course that covers both simulation and animation. We report here on a teaching approach in which a simulation course starts with the topic of animation, then introduces the programming-language subset of a modeling language to support animation at a fundamental level, then returns to animation to introduce more sophisticated aspects of that material, then goes back to the modeling language to investigate the modeling of queuing networks, and so on. Introducing animation first has the effect of capturing intense student interest and dedication at the outset of the course and has the additional benefit of helping students visualize and deal with parallel processes of the type they will be studying and modeling later in the course. Recent technological developments are further reflected by including a World Wide Web-based support system in the course.
Balancing push and pull for data broadcast
Authors: Swarup Acharya, Michael Franklin, Stanley Zdonik
Venue: Proceedings of the 1997 ACM SIGMOD international conference on Management of data (1997)

The increasing ability to interconnect computers through internet-working, wireless networks, high-bandwidth satellite, and cable networks has spawned a new class of information-centered applications based on data dissemination. These applications employ broadcast to deliver data to very large client populations. We have proposed the Broadcast Disks paradigm [Zdon94, Acha95b] for organizing the contents of a data broadcast program and for managing client resources in response to such a program. Our previous work on Broadcast Disks focused exclusively on the &ldquo;push-based&rdquo; approach, where data is sent out on the broadcast channel according to a periodic schedule, in anticipation of client requests. In this paper, we study how to augment the push-only model with a &ldquo;pull-based&rdquo; approach of using a backchannel to allow clients to send explicit requests for data to the server. We analyze the scalability and performance of a broadcast-based system that integrates push and pull and study the impact of this integration on both the steady state and warm-up performance of clients. Our results show that a client backchannel can provide significant performance improvement in the broadcast environment, but that unconstrained use of the backchannel can result in scalability problems due to server saturation. We propose and investigate a set of three techniques that can delay the onset of saturation and thus, enhance the performance and scalability of the system.
Dynamic itemset counting and implication rules for market basket data
Authors: Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, Shalom Tsur
Venue: ACM SIGMOD Record (1997)

We consider the problem of analyzing market-basket data and present several important contributions. First, we present a new algorithm for finding large itemsets which uses fewer passes over the data than classic algorithms, and yet uses fewer candidate itemsets than methods based on sampling. We investigate the idea of item reordering, which can improve the low-level efficiency of the algorithm. Second, we present a new way of generating &ldquo;implication rules,&rdquo; which are normalized based on both the antecedent and the consequent and are truly implications (not simply a measure of co-occurrence), and we show how they produce more intuitive results than other methods. Finally, we show how different characteristics of real data, as opposed by synthetic data, can dramatically affect the performance of the system and the form of the results.
A Comparison of Two Switched Current Differentiators at Extremely Low Current Level
Authors: Chunyan Wang, Francis Devos, Yang Ni
Venue: Analog Integrated Circuits and Signal Processing (1998)

We are presenting comparative studies on two switched current (SI) differentiators; one is a classical version, the other is a cumulative version. Both are applied to smart pixel time-domain differentiation. In both differentiators, the differentiation is calculated by subtracting the instantaneous photocurrent from a previously sampled one. The key issue in this case is to obtain accuracy even with an extremely low current level (from pA to nA). The operability of both SI memories is verified through chip tests. Within an optical input dynamic range of five decades and a minimum level of 2 Lux (1pA in current), the maximum current reproduction error rate is 10% for the first one and 6% for the second. Furthermore, the cumulability of the second version is also confirmed by our tests.
Spot: Scheduling Programs Optimally for Television
Authors: Srinivas K. Reddy, Jay E. Aronson, Antonie Stam
Venue: Management Science (1998)

This paper introduces SPOT (Scheduling Programs Optimally for Television), an analytical model for optimal prime-time TV program scheduling. Due in part to the advent of new cable TV channels, the competition for viewer ratings has intensified substan tially in recent years, and the revenues of the major networks have not kept pace with the costs of the programs. As profit margins decrease, the networks seek to improve their viewer ratings with innovative scheduling strategies. Our SPOT models for scheduling network programs combine predicted ratings for different combinations of prime-time schedules with a novel, mixed-integer, generalized network-based flow, mathematical programming model, which when solved provides an optimal schedule. In addition to historical performance, subjective inputs from actual network managers were used as input to the network flow optimization model. The optimization model is flexible. It can utilize the managers? input and maximize profit (instead of ratings) by considering not only the revenue potential but also the costs of the shows. Moreover, SPOT can describe the scheduling problem over any time period (e.g., day, week, month, season), and designate certain shows to, and restrict them from, given time slots. The methodology of SPOT is illustrated using data for the first quarter of 1990, obtained from a cable network. The optimization model produces solutions that would have generated an increase of approximately 2% in overall profitability, representing over $6 million annually for the cable network. SPOT not only produces more profitable TV schedules for this network, but also provides valuable general insights into the development of mixed programming strategies for improving future schedules.
Analysis of the Noise Characteristics of CMOS Current Conveyors
Authors: Erik Bruun
Venue: Analog Integrated Circuits and Signal Processing (1997)

The definition of the current conveyor is reviewed and a multiple-output second generation current conveyor (CCII) is shown to combine the different generations of current conveyors presently existing. Next, noise sources are introduced, and a general noise model for the current conveyor is described. This model is used for the analysis of selected examples of current conveyor based operational amplifier configurations and the noise performance of these configurations is compared. Finally, the noise model is developed for a CMOS current conveyor implementation, and approaches to an optimization of the noise performance are discussed. It is concluded that a class AB implementation can yield a lower noise output for the same dynamic range than a class A implementation. For both the class A implementation and the class AB implementation it is essential to design low noise current mirrors and current sources, and with the class AB design, the current mirror and current source noise can be reduced by using small values of bias current without compromising the maximum available output current.
Group membership and view synchrony in partitionable asynchronous distributed systems: specifications
Authors: Özalp Babaoğlu, Renzo Davoli, Alberto Montresor
Venue: ACM SIGOPS Operating Systems Review (1997)

Transient failures, unknown scheduling strategies and variable loads on the computing and communication resources give rise to an asynchronous and partitionable characterization for practical distributed systems with large geographic extent. We consider the group membership problem in partitionable asynchronous systems and give a formal specification that guarantees liveness and prevents capricious view splitting. Our work is based on the notion of reachability as an appropriate characterization of failures in partitionable systems in that it subsumes both process crashes and communication failures. The group membership problem is formulated in the context of view synchrony that includes a reliable multicast service for communication within the group. Our specification is modular and includes properties governing group membership separately from those governing reliable multicasts. It can be taken either partially for defining a group membership service alone, or taken as a whole for defining view synchrony.
Mixed-Mode BIST Using Embedded Processors
Authors: Sybille Hellebrand, Hans-Joachim Wunderlich, Andre Hertwig
Venue: Journal of Electronic Testing: Theory and Applications (1998)

In complex systems, embedded processors may be used to run software routines for test pattern generation and response evaluation. For system components which are not completely random pattern testable, the test programs have to generate deterministic patterns after random testing. Usually the random test part of the program requires long run times whereas the part for deterministic testing has high memory requirements.In this paper it is shown that an appropriate selection of the random pattern test method can significantly reduce the memory requirements of the deterministic part. A new, highly efficient scheme for software-based random pattern testing is proposed, and it is shown how to extend the scheme for deterministic test pattern generation. The entire test scheme may also be used for implementing a scan based BIST in hardware.
Improving the accuracy and performance of memory communication through renaming
Authors: Gary S. Tyson, Todd M. Austin
Venue: Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture (1997)

As processors continue to exploit more instruction-level parallelism, a greater demand is placed on reducing the effects of memory access latency. In this paper, we introduce a novel modification of the processor pipeline called memory renaming. Memory renaming applies register access techniques to load instructions, reducing the effect of delays caused by the need to calculate effective addresses for the load and all preceding stores before the data can be fetched. Memory renaming allows the processor to speculatively fetch values when the producer of the data can be reliably determined without the need for an effective address. This work extends previous studies of data value and dependence speculation. When memory renaming is added to the processor pipeline, renaming can be applied to 30% to 50% of all memory references, translating to an overall improvement in execution time of up to 41%. Furthermore, this improvement is seen across all memory segments-including the heap segment, which has often been difficult to manage efficiently.
Digital Design of Discrete Exponential BidirectionalAssociative Memory
Authors: Chua-Chin Wang, Chih-Lwan Fan
Venue: Journal of VLSI Signal Processing Systems (1997)

The exponential bidirectional associative memory (eBAM) was proved to be a systematically stable high-capacity memory. Considering the difficulty of the implementation of such an eBAM by analog circuits and the compactability with binary logic circuits, we adopt the digital logic methodology to design such a neural network. Besides, we also count in other factors, e.g., scalability and speed, so that the complete digital design of this neural network is feasible. In order to realize the eBAM by digital circuitry only, some special design is required such that the exponential function can be implemented without the loss of operating speed. For example, a high-speed 8-to-9 exponent value generator is required in the design. In addition, because the traditional add/sub accumulator costs too much area when the dimension of patterns is large, a cascaded increment/decrement accumulator (IDA) is proposed in the design, which can also speed up the addition or subtraction besides the saving of chip area. For the sake of area saving, regenerated IDA is also proposed to reduce the cost of chip area. At last, thorough simulations by MAGIC and IRSIM are proceeded to verify the performance of the design.
The origins of information science and the International Institute of Bibliography/International Federation for Information and Documentation (FID)
Authors: W. Boyd Rayward
Venue: Journal of the American Society for Information Science (1997)

This article suggests that the ideas and practices embraced by the term &ldquo;documentation,&rdquo; introduced by Paul Otlet and his colleagues to describe the work of the International Institute of Bibliography (later FID) that they set up in Brussels in 1895, constituted a new &ldquo;discursive formation,&rdquo; to echo Foucault. While today's special terminology of information science was not then in use, this should not obscure the fact that key concepts for information science as we now understand this field of study and research&mdash;and the technical systems and professional activities in which it is anchored&mdash;were implicit in and operationalized by what was created within the International Institute of Bibliography in 1895 and the decades that followed. The ideas and practices to be discussed would today be rubricated as information technology, information retrieval, search strategies, information centers, fee-based information services, linked data bases, database management software, scholarly communication networks, multimedia and hypertext, even the modern, diffuse notion of &ldquo;information&rdquo; itself. The article argues that important aspects of the origins of information science, as we now know it in the U.S. and elsewhere in the English-speaking world, were contained within or became an extension of the discursive formation that we have labeled &ldquo;documentation.&rdquo; &mdash;Author's Abstract
Local Scale Control for Edge Detection and Blur Estimation
Authors: James H. Elder, Steven W. Zucker
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1998)

The standard approach to edge detection is based on a model of edges as large step changes in intensity. This approach fails to reliably detect and localize edges in natural images where blur scale and contrast can vary over a broad range. The main problem is that the appropriate spatial scale for local estimation depends upon the local structure of the edge, and thus varies unpredictably over the image. Here we show that knowledge of sensor properties and operator norms can be exploited to define a unique, locally computable minimum reliable scale for local estimation at each point in the image. This method for local scale control is applied to the problem of detecting and localizing edges in images with shallow depth of field and shadows. We show that edges spanning a broad range of blur scales and contrasts can be recovered accurately by a single system with no input parameters other than the second moment of the sensor noise. A natural dividend of this approach is a measure of the thickness of contours which can be used to estimate focal and penumbral blur. Local scale control is shown to be important for the estimation of blur in complex images, where the potential for interference between nearby edges of very different blur scale requires that estimates be made at the minimum reliable scale.