ppxscal/embedding_network huggingface dataset:
Memory scheduling for modern microprocessors
Authors: Ibrahim Hur, Calvin Lin
Venue: ACM Transactions on Computer Systems (TOCS) (2007)

The need to carefully schedule memory operations has increased as memory performance has become increasingly important to overall system performance. This article describes the adaptive history-based (AHB) scheduler, which uses the history of recently scheduled operations to provide three conceptual benefits: (1) it allows the scheduler to better reason about the delays associated with its scheduling decisions, (2) it provides a mechanism for combining multiple constraints, which is important for increasingly complex DRAM structures, and (3) it allows the scheduler to select operations so that they match the program's mixture of Reads and Writes, thereby avoiding certain bottlenecks within the memory controller. We have previously evaluated this scheduler in the context of the IBM Power5. When compared with the state of the art, this scheduler improves performance by 15.6&percnt;, 9.9&percnt;, and 7.6&percnt; for the Stream, NAS, and commercial benchmarks, respectively. This article expands our understanding of the AHB scheduler in a variety of ways. Looking backwards, we describe the scheduler in the context of prior work that focused exclusively on avoiding bank conflicts, and we show that the AHB scheduler is superior for the IBM Power5, which we argue will be representative of future microprocessor memory controllers. Looking forwards, we evaluate this scheduler in the context of future systems by varying a number of microarchitectural features and hardware parameters. For example, we show that the benefit of this scheduler increases as we move to multithreaded environments.
Ant-Based Stable Disjoint Path Routing Algorithm in Wireless Ad Hoc Networks
Authors: Zhengyu Wu, Lin Cui, Xiangjun Dong
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

A Mobile Ad hoc Network (MANET) is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. Earlier research has proposed several unipath routing protocols specifically on MANET. However, the single path is easily broken and needs to perform a route discovery process again due to the dynamic topology of ad hoc networks. To alleviate these problems, a new routing algorithm called Ant-Based Stable Disjoint Path Routing Algorithm (ABSDPRA) is proposed. ABSDPRA is based on swarm intelligence and especially on the ant colony based meta heuristic. The proposed algorithm can consider link stability. The introduced routing algorithm is highly adaptive, efficient and scalable. ABSDPRA exploits the concept of a routing protocol called GRID and discover multiple disjoint routing paths with a low routing overhead. Simulation results indicate that ABSDPRA has a higher packet delivery ratio, lower end-to- end delay and lower routing load than AODV.
Development of a simulation model of colorectal cancer
Authors: Stephen Roberts, Lijun Wang, Robert Klein, Reid Ness, Robert Dittus
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2007)

Colorectal cancer (CRC) is deadly if not found early. Any protocols developed for screening and surveillance and any policy decisions regarding the availability of CRC resources should consider the nature of the disease and its impact over time on costs and quality-adjusted life years in a population. Simulation models can provide a flexible representation needed for such analysis; however, the development of a credible simulation model of the natural history of CRC is hindered by limited data and incomplete knowledge. To accommodate the extensive modeling and remodeling required to produce a credible model, we created an object-oriented simulation platform driven by a model-independent database within the .NET environment. The object-oriented structure not only encapsulated the needs of a simulation replication but created an extensible framework for specialization of the CRC components. This robust framework allowed development to focus modeling on the CRC events and their event relationships, conveniently facilitating extensive revision during model construction. As a second-generation CRC modeling activity, this model development benefited from prior experience with data sources and modeling difficulties. A graphical user interface makes the model accessible by displaying existing scenarios, showing input variables and their values, and permitting the creation of new scenarios and changes to its input. Output from the simulation is captured in familiar tabbed worksheets and stored in the database. The eventual CRC model was conceptualized through a series of assumptions that conformed to beliefs and data regarding the natural history of CRC. Throughout the development cycle, extensive verification and validation calibrated the model. The result is a simulation model that characterizes the natural history of CRC with sufficient accuracy to provide an effective means of evaluating numerous issues regarding the burden of this disease on individuals and society. Generalizations from this study are offered regarding the use of discrete-event simulation in disease modeling and medical decision making.
Design and Algorithms Realization of Rough Set Simulation Tool Box
Authors: Xue-feng Zhang, Qing-ling Zhang, Yutong Wang, Bao-yan Zhu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

The basic conception and trait of data analysis system based on rough set(RS) method are briefly described. Two important concepts of indiscernibility relation and relative positive region are mainly focused on. By using the depen- dant degree of knowledge, the algorithm of RS data analysis system is submitted. By comparing the numbers of reduced attributes, the result of minimal attributes reduction is se- lected. Program realization of many algorithms of solving relative core, upper(lower) approximation, equivalence re- lation, relatively significant degree, relatively attributes re- duction, relatively value reduction, minimal decision rules is obtained. The MATLAB programs of above fields are given. MATLAB simulation tool box is designed. By im- posing graphical user interfaceGUI method, the favorable man-machine alternation system main interface is devised. GUI programming method is particularly introduced by us- ing a button example.
A rough set approach for the discovery of classification rules in interval-valued information systems
Authors: Yee Leung, Manfred M. Fischer, Wei-Zhi Wu, Ju-Sheng Mi
Venue: International Journal of Approximate Reasoning (2008)

A novel rough set approach is proposed in this paper to discover classification rules through a process of knowledge induction which selects decision rules with a minimal set of features for classification of real-valued data. A rough set knowledge discovery framework is formulated for the analysis of interval-valued information systems converted from real-valued raw decision tables. The minimal feature selection method for information systems with interval-valued features obtains all classification rules hidden in a system through a knowledge induction process. Numerical examples are employed to substantiate the conceptual arguments.
Chance Constrained Bi-level Programming Approach for Flow Interception Problem with Stochastic Users in Fuzzy Environment
Authors: Jun Yang, Min Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Flow interception problem is concerned with how to lo- cate facilities with fixed numbers to serve the maximum by- passing customer flows. This paper mainly investigates this problem with stochastic customer flows. Customer flows's path-choosing behavior is to maximize possibility of ob- taining serve on the condition of satisfying the fuzzy trip cost threshold level. Consequentially, chance-constrained bi-level programming model for this problem is designed. Genetic algorithm, simplex method, stochastic simulation and fuzzy simulation algorithm are integrated to seek the approximate best solution of the model.
Optimum State Assignment for Synchronous Sequential Circuits
Authors: J. R. Story
Venue: IEEE Transactions on Computers (1972)

The problem of encoding the internal states of synchronous sequential switching circuits so as to minimize the combinational network cost is treated. Cost is defined as the number of AND-OR inputs required in the two-level implementation of each memory element input equation separately ( i.e., the cost is not reduced initially by the existence of common terms between equations). An algorithm has been developed that considers implicitly all distinct state-assignment schemes for a given state table, thus ensuring that the state assignment that results in the least "cost" combinational network is selected. Since any optimum state-assignment scheme is dependent on the type of memory element, the algorithm is designed for use with J-K flip-flop memory elements because of their wide use and versatility.
Summary
Authors: Juan A. de la Puente, Santiago Urueña
Venue: Proceedings of the 13th international workshop on Real-time Ada (2007)

The final session summarized the main conclusions of the workshop and addressed some open issues. Another objective was to decide whether a new IRTAW is needed, and, if so, the location and time frame.
An Optical-Digital Computer for Parallel Processing of Images
Authors: H. Stark
Venue: IEEE Transactions on Computers (1975)

An optical-digital computer (ODC) that enables parallel processing of images is discussed. A number of optical and analog electronic preprocessing operations are described. These include the use of the texture variance to separate objects in an image on the basis of texture, application of autocorrelation techniques to find hidden periodicities in images, masking on the basis of color, Fourier analysis, and planimetric analysis of color scenes. A particular design of an ODC is discussed. The computer consists of an optical system, an image analyzer, a bandwidth compressor and digitizer, and a digital computer. A number of applications are furnished. Emphasis is given to processing aerial and radiographic imagery.
Registration of Challenging Image Pairs: Initialization, Estimation, and Decision
Authors: Gehua Yang, Charles V. Stewart, Michal Sofka, Chia-Ling Tsai
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Our goal is an automated 2d-image-pair registration algorithm capable of aligning images taken of a wide variety of natural and man-made scenes as well as many medical images. The algorithm should handle low overlap, substantial orientation and scale differences, large illumination variations, and physical changes in the scene. An important component of this is the ability to automatically reject pairs that have no overlap or have too many differences to be aligned well.We propose a complete algorithm, including techniques for initialization, for estimating transformation parameters, and for automatically deciding if an estimate is correct. Keypoints extracted and matched between images are used to generate initial similarity transform estimates, each accurate over a small region. These initial estimates are rank-ordered and tested individually in succession. Each estimate is refined using the Dual-Bootstrap ICP algorithm, driven by matching of multiscale features. A three-part decision criteria, combining measurements of alignment accuracy, stability in the estimate, and consistency in the constraints, determines whether the refined transformation estimate is accepted as correct. Experimental results on a data set of 22 challenging image pairs show that the algorithm effectively aligns 19 of the 22 pairs and rejects 99.8% of the misalignments that occur when all possible pairs are tried. The algorithm substantially out-performs algorithms based on keypoint matching alone.
Peripheral database module for clinical management and research in sleep medicine
Authors: Felix Matthews, Jurg Blaser, Erich W. Russi, Konrad E. Bloch
Venue: Technology and Health Care (1999)

Hospital-wide information systems may provide economical solutions for communication processes or for documentation by means of centralized digital medical records. Within a large university hospital, however, there may be too many diverse subspecialties and too many special medical procedures to be supported comprehensively by a single database information system. A peripheral modular system has been tailored to the specific needs of a sleep disorder clinic as an adjunct to the main clinical information system. The client server application allows for automatic data acquisition by on-line devices and by a graphical user interface. It supports administrative tasks for patient management, specific encounter interactions and data retrieval for research. Performance and acceptance of the system was assessed during clinical use, revealing positive response by the users, also with respect to significant time savings. Our experience suggests that the concept of peripheral database modules as &ldquo;satellites&rdquo; to a main clinical system provides flexibility in design and implementation of the specialized databases while providing access to data of more general relevance via the main database.
On Verification of Probabilistic Timed Automata against Probabilistic Duration Properties
Authors: Dang Van Hung, Miaomiao Zhang
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

In this paper, we introduce an extension of Duration Calculus called Simple Probabilistic Duration Calculus (SPDC) to express dependability requirements for real-time systems, and address the problem to decide if a probabilistic timed automaton satisfies a SPDC formula. We prove that the problem is decidable for a class of SPDC called probabilistic linear duration invariants, and provide a model checking algorithm for solving this problem.
Harvesting verifiable challenges from oblivious online sources
Authors: J. Alex Halderman, Brent Waters
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

Several important security protocols require parties to perform computations based on random challenges. Traditionally, proving that the challenges were randomly chosen has required interactive communication among the parties or the existence of a trusted server. We offer an alternative solution where challenges are harvested from oblivious servers on the Internet. This paper describes a framework for deriving "harvested challenges" by mixing data from various pre-existing online sources. While individual sources may become predictable or fall under adversarial control, we provide a policy language that allows application developers to specify combinations of sources that meet their security needs. Participants can then convince each other that their challenges were formed freshly and in accordance with the policy. We present Combine, an open source implementation of our framework, and show how it can be applied to a variety of applications, including remote storage auditing and non-interactive client puzzles.
NS2: networked searchable store with correctness
Authors: Radu Sion, Sumeet Bajaj, Bogdan Carbunar, Stefan Katzenbeisser
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

In an outsourced data framework, we introduce and demonstrate mechanisms for securely storing a set of data items (documents) on an un-trusted server, while allowing for subsequent conjunctive keyword searches for matching documents. The protocols provide full computational privacy, query correctness assurances and no leaks: the server either correctly executes client queries or (if it behaves maliciously) is immediately detected. The client is then provided with strong assurances proving the authenticity and completeness of results. This is different from existing secure keyword search research efforts where a cooperating, non-malicious server behavior is assumed. Additionally, not only does the oblivious search protocol conceal the outsourced data (from the un-trusted server) but it also does not leak client access patterns, the queries themselves, the association between different queries or between newly added documents and their corresponding keywords (not even in encrypted form). These assurances come at the expense of additional computation costs which we analyze in the context of today's hardware.
Fuzzy Logic Based On-Line Efficiency Optimization Control of a Ball Mill Grinding Circuit
Authors: Xisong Chen, Junyong Zhai, Qi Li, Shumin Fei
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Grinding circuit must provide stable particle size distribution and should also operate in a way to maximize mill efficiency. Fuzzy logic based on-line optimization control integrated in an expert system was developed to control product particle size while enhancing mill efficiency in a ball mill grinding circuit. In the supervisory level, fuzzy logic control determined the optimum set-points for the controllers in the regulatory level. The whole system not only ensured a long-term stableness of particle size even ore hardness has changed but also increased the mill efficiency more than 8 percent in practical application compared with conventional control. More than half a year's industrial operation demonstrates the practicality, reliability and effectiveness of the suggested control strategy.
Conference Report: Microprocessors in Automation and Communications
Authors: W. Myers
Venue: Computer (1978)

As befits the mother of the democracies, debate on the role the microprocessor is to play in Great Britain is vigorous. Even the Prime Minister, James Callaghan, has joined the fray, telling the Labour Party conference at Blackpool that the microprocessor exemplifies the kind of technological change Britain must accommodate in the 1980's. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
An Alternative Simple Language and Environment for PCs
Authors: S. Pemberton
Venue: IEEE Software (1987)

ABC is a simple language for personal computing. Intended as an alternative to Basic, it has grown to be a powerful tool for expert users, too.
Self-Similarity Analysis Applied to 2D Breast Cancer Imaging
Authors: Filipe Soares, Pawel Andruszkiewic, Mario Freire, Paulo Cruz, Manuela Pereira
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

This article presents a new trend in computerized medical image analysis of breast cancer features, existing in mammograms (grey scale 2D images), based on recent approaches of the self-similarity formalism. A procedure for detecting small-sized details in mammograms, based on a multifractal approach, is proposed. These details can represent microcalcifications, possible signs of breast cancer. We present and discuss the results obtained using the proposed extraction method. Furthermore, we demonstrate its accuracy when applied to clinical mammograms, revealing microcalcification regions, distinguished by direct singularity information extraction.
Efficient bulk deletes for multi dimensional clustered tables in DB2
Authors: Bishwaranjan Bhattacharjee, Timothy Malkemus, Sherman Lau, Sean McKeough, Jo-anne Kirton, Robin Von Boeschoten, John P Kennedy
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

In data warehousing applications, the ability to efficiently delete large chunks of data from a table is very important. This feature is also known as Rollout or Bulk Deletes. Rollout is generally carried out periodically and is often done on more than one dimension or attribute. The ability to efficiently handle the updates of RID indexes while doing Rollouts is a well known problem for database engines and its solution is very important for data warehousing applications. DB2 UDB V8.1 introduced a new physical clustering scheme called Multi Dimensional Clustering (MDC) which allows users to cluster data in a table on multiple attributes or dimensions. This is very useful for query processing and maintenance activities including deletes. Subsequently, an enhancement was incorporated in DB2 UDB Viper 2 which allows for very efficient online rollout of data on dimensional boundaries even when there are a lot of secondary RID indexes defined on the table. This is done by the asynchronous updates of these RID indexes in the background while allowing the delete to commit and the table to be accessed. This paper details the design of MDC Rollout and the challenges that were encountered. It discusses some performance results which show order of magnitude improvements using it and the lessons learnt.
Customer-centric marketing with Internet coupons
Authors: Hsing Kenneth Cheng, Kutsal Dogan
Venue: Decision Support Systems (2008)

We develop an analytical framework to examine customer-centric marketing with Internet coupons. We show that mass distribution of Internet coupons without a customer-centric information system to identify customers' profile will have adverse consequences that defeat the price discrimination effect of couponing. We analyze alternative strategies including distributing Internet coupons to targeted customers with perfect and imperfect profile information of customers. The targeted coupons with perfect information case amounts to dynamic pricing, but without customers' backlash. In the targeted customers with imperfect information scenario, we consider Internet coupons with fixed face value as well as changing face value cases. We derive the condition under which the firm should opt for the changing face value Internet coupons. As the firm's customer-centric information system improves in terms of enhanced targeting accuracy at a lower cost, the changing face value Internet coupons will become more prevalent.
Adaptive Alpha-Trimmed Average Operator Based on Gaussian Distribution Hypothesis Test for Image Representation
Authors: Cheng Cai, Kin-Man Lam, Zheng Tan
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Representation operator is one of the key issues of the content-based retrieval. In this paper, we propose an adaptive alpha-trimmed average operator based on Gaussian distribution hypothesis test for image representation. The adaptive alpha-trimmed average operator extracts the representation by trimming outliers and then estimating the central value of the rest. Since the more samples are used, the more accurate representation we get, the optimal trimming parameter should guarantee to remove the extreme values and at the same time keep useful samples as more as possible. The criterion to distinguish between useful data and extreme noise is derived from Gaussian distribution hypothesis test on the basis of global statistics. Experimental results from standard images show that our proposed scheme outperforms traditional adaptive methods.