ppxscal/embedding_network huggingface dataset:
An efficient architecture for lifting-based two-dimensional discrete wavelet transforms
Authors: S. Barua, J. E. Carletta, K. A. Kotteri, A. E. Bell
Venue: Integration, the VLSI Journal (2005)

An architecture for the lifting-based two-dimensional discrete wavelet transform is presented. The architecture has regular data flow and low control complexity, and achieves 100% hardware utilization. It is easily adapted to arbitrary image sizes, multiple levels of transform, and different numbers of lifting steps. Symmetric extension of the image to be transformed is handled in a way that does not require additional computations or clock cycles. The proposed architecture achieves higher throughput and uses 30% fewer lines of embedded memory than architectures based on convolutional filter banks. The architecture has been implemented on an Altera APEX20KE field programmable gate array for three differently quantized versions of the biorthogonal 9/7 filter set used for JPEG2000 lossy compression. Our best implementation of a one-level two-dimensional discrete wavelet transform achieves a throughput of 66.8 megapixels per second using 7726 logic elements.
Imaging System for Visualization and Numerical Analysis of Cancer at Stomach and Skin Tissues
Authors: Sadzk Kara, Mustafa Okandan, Fulya Şener, Mustafa Yzldzrzm
Venue: Journal of Medical Systems (2005)

Digital imaging of cancerous cells is instrumental not only in determining the characteristic of the cancer but also monitoring the progress of the disease in the follow up of the patient and adapting the treatment, accordingly. Therefore, we have developed an imaging system to display and layout the characteristics of normal and cancerous cells in an automated way. Image processing techniques are performed on the digitized images of stomach and skin tissues, in order to derive the number of cells, area of an individual cell, and average area of the cells in a certain size of an image window.
Simultaneous buffer insertion and wire sizing considering systematic CMP variation and random leff variation
Authors: Lei He, Andrew Kahng, King Ho Tam, Jinjun Xiong
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

This paper studies the impacts of Chemical Mechanical Polishing (CMP)-induced systematic variation and random channel length (Leff) variation of transistors on interconnect design. We first construct a table look-up based interconnect RC parasitic model considering CMP effects with optimized fill insertion. Based on the model, we solve the simultaneous buffer insertion, wire sizing and fill insertion (SBWF) problem under CMP variation. We also extend the SBWF problem to consider the random Leff variation (SBWF). We approach the resulting vSBWF problem by (1) incorporating probability density function (PDF) into the SBWF algorithm; and (2) developing an efficient heuristic for PDF pruning, whose practical optimality is verified by an accurate but much slower pruning. Experimental results show that the SBWF design improves timing by 1.0% and reduces power by 5.7% on average with 7.4% less buffer area over the conventional buffer insertion and wire sizing design followed by fill insertion (SBWF), and that the vSBWF design reduces yield loss due to CMP and Leff variations by 44.3% on average over the SBWF design. The runtime of vSBWF is 8.3x that of SBWF, and vSBWF for the largest example containing 3103 sinks finishes in 124 minutes.
Mini Medical Record Application: Annual Register for Flu Shot Vaccinations
Authors: Myron Hatcher, Irene Heetebry, Hossein Tabriziani
Venue: Journal of Medical Systems (2005)

This application is an Intranet-based system. A database has been established utilizing patient information on the basis of age, medical diagnosis and employment history. If a health care provider or support staff states that a patient is over 65 years of age or has been diagnosed with a chronic disease and this limits the patient's ability to fight off infection, the need for preventive care is activated. In this situation the preventive care is the administration of an annual flu shot. For anyone over 65 years of age or with a chronic illness, a bulk mail of reminder cards with the dates of availability of injection is generated and mailed. All health care workers are notified at work of vaccination sites that they can use. In addition, should a patient have an appointment with a provider and a preventive flu injection is indicated, a reminder appears on the registration form. This reminder indicates a flu shot is needed as well as other preventive intervention.
How to use SimPoint to pick simulation points
Authors: Greg Hamerly, Erez Perelman, Brad Calder
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

Understanding the cycle level behavior of a processor running an application is crucial to modern computer architecture research. To gain this understanding, detailed cycle level simulators are typically employed. Unfortunately, this level of detail comes at the cost of speed, and simulating the full execution of an industry standard benchmark on even the fastest simulator can take weeks to months to complete. This fact has not gone unnoticed, and several techniques have been developed aimed at reducing simulation time.
Towards space: time light field rendering
Authors: Huamin Wang, Ruigang Yang
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

So far extending light field rendering to dynamic scenes has been trivially treated as the rendering of static light fields stacked in time. This type of approaches requires input video sequences in strict synchronization and allows only discrete exploration in the temporal domain determined by the capture rate. In this paper we propose a novel framework, space-time light field rendering, which allows continuous exploration of a dynamic scene in both spatial and temporal domain with unsynchronized input video sequences.In order to synthesize novel views from any viewpoint at any time instant, we develop a two-stage rendering algorithm. We first interpolate in the temporal domain to generate globally synchronized images using a robust spatial-temporal image registration algorithm followed by edge-preserving image morphing. We then interpolate those software-synchronized images in the spatial domain to synthesize the final view. Our experimental results show that our approach is robust and capable of maintaining photo-realistic results.
Acclairism: questioning biometric technology through an airport security clearance system
Authors: Luther Thie, Eyal Fried
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Biometric technologies are becoming socially acceptable in the wake of recent terrorist events. Bio-data is developing into a legitimate source for identity detection and assessment. Acclairism is an attempt to bring to light some of the conflicts and questions these technologies give rise to: What defines us as unique individuals? What defines us as trusted members of society? How much personal information will we willingly give away and under which circumstances? Through Acclairism we explore a situation wherein people freely accept a highly invasive, highly authoritative manipulation in return for tangible rewards and an upgraded social status. We perform this investigation through Acclair, a company providing brain-testing services as part of an exclusive security clearance for air-travelers.
Dynamic Task-Level Voltage Scheduling Optimizations
Authors: Jeffrey A. Barnett
Venue: IEEE Transactions on Computers (2005)

Energy versus delay trade-offs are explored for systems that must manage energy expenditure as well as computation deadlines. The focus is execution of a single process on a single processor. Two probabilistic process models are considered, along with a family of power dissipation models. The first process model assumes that process complexity is exactly c cycles with probability p(c). The second model considers the detailed branching and loop structure of the code. Probabilities are attached at branch points. The power models assume that energy dissipation per cycle is proportional to v^m and that execution time for a cycle is proportional to v^{-n}, where v is supply voltage. The energy versus delay trade-off is implemented using dynamic voltage and clock adjustments. The problems solved include 1) minimize expected execution time given a hard energy budget and 2) minimize expected energy expenditure given a hard deadline. The problem of minimimizing the expected value of Q(E,T), where Q is a penalty function and E and T are, respectively, total energy and total time, is also solved using the first process model. Analysis determines theoretical conditions where it may be profitable to switch voltage or modify an a priori voltage schedule.
Geometric analysis and quantitative evaluation of sport teamwork
Authors: Akira Fujimura, Kokichi Sugihara
Venue: Systems and Computers in Japan (2005)

A quantitative method for evaluating sport teamwork is proposed. The sports considered here are team sports in which players can move freely in the field, and two teams compete against each other. For this kind of sports, each player's dominant region has an important role in evaluating the teamwork. Therefore, here we propose some approaches to quantitative evaluation based on the concept of a generalized Voronoi diagram that divides space into dominant regions. We also construct a more realistic model of player's motion model based on experiments, and apply it to the evaluation. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(6): 49&ndash;58, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20254
A note on sorting Prolog assertions
Authors: C. S. Kwok
Venue: Issue 91 (January 1985) (1985)

In Prolog programs, arguments are often used to exchange information between relations. This kind of communication is tedious when a large amount of information has to be passed around. One way of solving the problem is to add assertions (unit clauses) to the knowledge base in execution time. These assertions are maintained as "global data structures." They are typically managed by the addition and deletion of clauses. However, most of the Prolog implementations offer little support for these operations. In C-Prolog [1], for example, a clause can only be added as the first or last clause of a relation. It would be useful if one could manipulate clauses in the same way as one manipulates lists. For example, sorting the assertions in the working memory of an expert system may lead the problem solver to follow a "better" path in the search space. In many applications, the working memory is build up incrementally. Thus, the insertion sort is a natural sorting method. The sorting may be combined with the addition of assertions using an assertcl(C) relation. A C-Prolog implementation of the articl(C) relation given below.
Ul'yanov and Nikol'skii-type inequalities
Authors: Z. Ditzian, S. Tikhonov
Venue: Journal of Approximation Theory (2005)

Ul'yanov-type inequalities are extended to include many measures of smoothness. Many of the results are valid for Lp, p gt; 0. Observations and extensions for needed Nikolskii-type inequalities are given.
Considerations on undergraduate computer science research
Authors: Stefan A. Robila, Amruth N. Kumar, Doug Baldwin, Clare Bates Congdon
Venue: Journal of Computing Sciences in Colleges (2005)

Research constitutes an intrinsic part of the intellectual activity of any faculty. Many times, however, heavy teaching loads and lack of incentives (such as institutional support and time releases) negatively affect the faculty's research work. Often, the knowledge level required in the research also limits the involvement of undergraduate students. Nevertheless, computer science faculty find innovative ways to attract the students and to extract benefits.
Clinical support system using information aggregation and visualization for order data
Authors: Shuichi Toyoda, Noboru Niki, Tetsuya Uemura, Hiromu Nishitani
Venue: Systems and Computers in Japan (2005)

Health care information systems developed by applying advancements in computer and high-speed network technologies have been clinically implemented recently. Such systems include systems that make hospital or clinical business efficient and systems that directly contribute to diagnoses. Medical organizations have sought systems that support efficient examinations and diagnoses by accurately grasping long-term care of chronic diseases related to daily habits etc. This paper presents a clinical support system that targets medium- to small-scale medical organizations. This system attempts to make diagnoses efficient by supporting grasping of long-term order data by aggregating and visualizing order data from the point of view of their contents characteristics and progress characteristics. Aggregation allows efficient expression of the variability of order data by taking combinations of order items based on their kinds as basic units. Visualization of aggregated order data allows expression of the continuity and periodicity of the data. In addition, it enables grasping of present and past orders etc. from the same screen. An order entry system constructed with the proposed clinical support system as its nucleus has been used clinically and its efficacy has been verified through a questionnaire study of doctors, analysis of the aggregating effects, a questionnaire study of the usage frequencies of input schemes, and measurements of the database access time. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 36(1): 12&ndash;24, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10649
A Comparison of CMB- and HLA-Based Approaches to Type I Interoperability Reference Model Problems for COTS-Based Distributed Simulation
Authors: Simon J. E. Taylor, Stephen J. Turner, Navonil Mustafee, Henrik Ahlander, Rassul Ayani
Venue: Simulation (2005)

Commercial off-the-shelf (COTS) simulation packages (CSPs) are software used by many simulation modelers to build and experiment with models of various systems in domains such as manufacturing, health, logistics, and commerce. As part of an ongoing standardization effort, this article introduces the COTS Simulation Package Emulator (CSPE), a proposed benchmark that can be used to investigate asynchronous entity-passing problems as described by the Type I interoperability reference model for COTS-based distributed simulation. To demonstrate its use, two approaches to this form of interoperability are discussed: an implementation based on the Chandy-Misra-Bryant (CMB) conservative algorithm and an implementation based on the High Level Architecture (HLA) Time Advance Request (TAR). It is shown the HLA approach outperforms the CMB approach in almost all cases. The article concludes that the CSPE benchmark is a valid basis from which the most efficient approach to Type I interoperability problems for COTS-based distributed simulation can be discovered.
Security - Problem Solved?
Authors: John Viega
Venue: Queue (2005)

There are plenty of security problems that have solutions. Yet, our security problems don&rsquo;t seem to be going away. What&rsquo;s wrong here? Are consumers being offered snake oil and rejecting it? Are they not adopting solutions they should be adopting? Or, is there something else at work, entirely? We&rsquo;ll look at a few places where the world could easily be a better place, but isn&rsquo;t, and build some insight as to why.
The problem of a mouse in a maze
Authors: Luca Majocchi, Giacomo R. Sechi
Venue: Issue 87 (January 1984) (1984)

In a broader research work about problem-solving methods and techniques, the problem of a mouse in a maze appears to be a fairly good problem to deal with. In fact, it is complex to be described in detail, easily understandable as regards its main features and well-known in order to have other instances of solution a new one can be compared to.
Multiple Collaborative Kernel Tracking
Authors: Zhimin Fan, Ying Wu, Ming Yang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

This paper presents a novel multiple collaborative kernel approach to visual tracking. This approach treats kernel-based tracking in a more general setting, i.e., a relaxation and constraints formulation, in which a complex motion is represented by a set of inter-correlated simpler motions. With this formulation, we present a rigorous analysis on a critical issue of kernel observability and obtain a criterion, based on which we propose a new method using collaborative kernels that has the theoretical guarantee of enhanced observability. This new method has been shown to be computationally efficient in both theory and practice, which can be readily applied to complex motions such as articulated motions.
Lockheed Martin: LOUELLA PARSING, an NLToolset system for MUC-6
Authors: Lois Childs, Louise Guthrie, Ira Sider
Venue: Proceedings of the 6th conference on Message understanding (1995)

During the 1980s. General Electric Corporate Research and Development began the design and implementation of a set of text-processing tools known as the NLToolset. This suite of tools developed, over time, in cooperation with a subgroup of the Management and Data Systems Operations component of General Electric Aerospace. Through corporate mergers, this subgroup has become the Language Exploitation Technologies group of the Lockheed Martin Management and Data Systems division. Over the years, the toolset has evolved into a robust set of aids for text analysis. It has been used to build a variety of applications, and the knowledge gained from each application has been utilized to improve the toolset. The LOUELLA PARSING system was designed with the latest version of the NLToolset.
TurboSMARTS: accurate microarchitecture simulation sampling in minutes
Authors: Thomas F. Wenisch, Roland E. Wunderlich, Babak Falsafi, James C. Hoe
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Recent research proposes accelerating processor microarchitecture simulation through statistical sampling. Prior simulation sampling approaches construct accurate model state for each measurement by continuously warming large microarchitectural structures (e.g., caches and the branch predictor) while emulating the billions of instructions between measurements. This approach, called functional warming, occupies hours of runtime while the detailed simulation that is measured requires mere minutes.To eliminate the functional warming bottleneck, we propose TurboSMARTS, a simulation framework that stores functionally-warmed state in a library of small, reusable checkpoints. TurboSMARTS enables the creation of the thousands of checkpoints necessary for accurate sampling by storing only the subset of warmed state accessed during simulation of each brief execution window. TurboSMARTS matches the accuracy of prior simulation sampling techniques (i.e., ±3% error with 99.7% confidence), while estimating the performance of an 8-way out-of-order super-scalar processor running SPEC CPU2000 in 91 seconds per benchmark, on average, using a 12 GB checkpoint library.
An ARIMA Supply Chain Model
Authors: Kenneth Gilbert
Venue: Management Science (2005)

This paper presents a multistage supply chain model that is based on Autoregressive Integrated Moving Average (ARIMA) time-series models. Given an ARIMA model of consumer demand and the lead times at each stage, it is shown that the orders and inventories at each stage are also ARIMA, and closed-form expressions for these models are given.The paper also discusses the causes of the bullwhip effect, a phenomenon in which variation in demand produces larger variations in upstream orders and inventory. This discussion reveals how different modeling can lead to different insights because they make different assumptions about the cause of the bullwhip effect. These observations are used to develop managerial insights about reducing the bullwhip effect.
A field-theoretic approach to understanding scale-free neocortical dynamics
Authors: Walter J. Freeman
Venue: Biological Cybernetics (2005)

A mesoscopic field-theoretic approach is compared with neural network and brain imaging approaches to understanding brain dynamics. Analysis of high spatiotemporal resolution rabbit electroencephalogram (EEG) reveals neural fields in the form of spatial patterns in amplitude (AM) and phase (PM) modulation of gamma and beta carrier waves that serve to classify EEGs from trials with differing conditioned stimuli (CS+/&#x2212;). Paleocortex exemplified by olfactory EEG has one AM&#x2013;PM pattern at a time that forms by an input-dependent phase transition. Neocortex shows multiple overlapping AM&#x2013;PM patterns before and during presentation of CSs. Modeling suggests that neocortex is stabilized in a scale-free state of self-organized criticality, enabling cooperative domains to form virtually instantaneously by phase transitions ranging in size from a few hypercolumns to an entire hemisphere. Self-organized local domains precede formation of global domains that supervene and contribute global modulations to local domains. This mechanism is proposed to explain Gestalt formation in perception.
A Mobile Commerce Framework Based on Web Services Architecture
Authors: Yao-Chung Chang, Jiann-Liang Chen, Wen-Ming Tseng
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

"Mobile Internet" arguably means more than just a new technique for communication; many analysts believe that it will revolutionize the business world and innovate the way individuals live. This study concentrates on switching existing e-commerce applications from the wired Internet to the mobile Internet. Web Services technologies are currently the most appropriate technologies to realize e-commerce applications. This study develops a mobile commerce application framework based on Web Services technologies and mobile Internet functions. To investigate the feasibility of the proposed framework, an m-store implementation is deployed in a laboratory and simulated using HTTP transactions with Secure Sockets Layer connections in a multi-user access environment. The minimum response time is stable (0.170 seconds for 5 users, 0.196 seconds for 50 users); the maximum throughput is invariable (0.365 Mbps for 5 users, 0.317 Mbps for 50 users), and the maximum transaction rate has little variation (5.882 per seconds for 5 users, 5.102 per seconds for 50 users). Results of this study demonstrate that the proposed framework is flexible, stable and scalable.
Multi-Image Matching Using Multi-Scale Oriented Patches
Authors: Matthew Brown, Richard Szeliski, Simon Winder
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This paper describes a novel multi-view matching framework based on a new type of invariant feature. Our features are located at Harris corners in discrete scale-space and oriented using a blurred local gradient. This defines a rotationally invariant frame in which we sample a feature descriptor, which consists of an 8 × 8 patch of bias/gain normalised intensity values. The density of features in the image is controlled using a novel adaptive non-maximal suppression algorithm, which gives a better spatial distribution of features than previous approaches. Matching is achieved using a fast nearest neighbour algorithm that indexes features based on their low frequency Haar wavelet coefficients. We also introduce a novel outlier rejection procedure that verifies a pairwise feature match based on a background distribution of incorrect feature matches. Feature matches are refined using RANSAC and used in an automatic 2D panorama stitcher that has been extensively tested on hundreds of sample inputs.