ppxscal/embedding_network huggingface dataset:
Verification of Boolean programs with unbounded thread creation
Authors: Byron Cook, Daniel Kroening, Natasha Sharygina
Venue: Theoretical Computer Science (2007)

Most symbolic software model checkers use abstraction techniques to reduce the verification of infinite-state programs to that of decidable classes. Boolean programs [T. Ball, S.K. Rajamani, Bebop: A symbolic model checker for Boolean programs, in: SPIN 00, in: Lecture Notes in Computer Science, vol. 1885, Springer, 2000, pp. 113-130] are the most popular representation for these abstractions. Unfortunately, today's symbolic software model checkers are limited to the analysis of sequential programs due to the fact that reachability in Boolean programs with unbounded thread creation is undecidable. We address this limitation with a novel algorithm for over-approximating reachability in Boolean programs with unbounded thread creation. Although the Boolean programs are not of finite state, the algorithm always reaches a fix-point. The fixed points are detected by projecting the state of the threads to the globally visible parts, which are finite.
EntityRank: searching entities directly and holistically
Authors: Tao Cheng, Xifeng Yan, Kevin Chen-Chuan Chang
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

As the Web has evolved into a data-rich repository, with the standard "page view," current search engines are becoming increasingly inadequate for a wide range of query tasks. While we often search for various data "entities" (e.g., phone number, paper PDF, date), today's engines only take us indirectly to pages. While entities appear in many pages, current engines only find each page individually. Toward searching directly and holistically for finding information of finer granularity, we study the problem of entity search, a significant departure from traditional document retrieval. We focus on the core challenge of ranking entities, by distilling its underlying conceptual model Impression Model and developing a probabilistic ranking framework, EntityRank, that is able to seamlessly integrate both local and global information in ranking. We evaluate our online prototype over a 2TB Web corpus, and show that EntityRank performs effectively.
A Domain Strategy for Computer Program Testing
Authors: L. J. White
Venue: IEEE Transactions on Software Engineering (1980)

This paper presents a testing strategy desiged to detect errors in the control flow of a computer program, and the conditions under which this strategy is reliable are given and characterized. The control flow statements in a computer progam partition the input space into a set of mutually exclusive domains, each of which corresponds to a particular program path and consists of input data points which cause that path to be executed. The testing strategy generates test points to examine the boundaries of a domain to detect whether a domain error has occurred, as either one or more of these boundaries will have shifted or else the corresponding predicate relational operator has changed. If test points can be chosen within e of each boundary, under the appropriate assumptions, the strategy is shown to be reliable in detecting domain errons of magnitude greater than ?. Moreover, the number of test points required to test each domain grows only linearly with both the dimensionality of the input space and the number of predicates along the path being tested.
Assessing the need for sequence-based normalization in tiling microarray experiments
Authors: Thomas E. Royce, Joel S. Rozowsky, Mark B. Gerstein
Venue: Bioinformatics (2007)

Motivation: Increases in microarray feature density allow the construction of so-called tiling microarrays. These arrays, or sets of arrays, contain probes targeting regions of sequenced genomes at regular genomic intervals. The unbiased nature of this approach allows for the identification of novel transcribed sequences, the localization of transcription factor binding sites (ChIP-chip), and high resolution comparative genomic hybridization, among other uses. These applications are quickly growing in popularity as tiling microarrays become more affordable. To reach maximum utility, the tiling microarray platform needs be developed to the point that 1 nt resolutions are achieved and that we have confidence in individual measurements taken at this fine of resolution. Any biases in tiling array signals must be systematically removed to achieve this goal. Results: Towards this end, we investigated the importance of probe sequence composition on the efficacy of tiling microarrays for identifying novel transcription and transcription factor binding sites. We found that intensities are highly sequence dependent and can greatly influence results. We developed three metrics for assessing this sequence dependence and use them in evaluating existing sequence-based normalizations from the tiling microarray literature. In addition, we applied three new techniques for addressing this problem; one method, adapted from similar work on GeneChip brand microarrays, is based on modeling array signal as a linear function of probe sequence, the second method extends this approach by iterative weighting and re-fitting of the model, and the third technique extrapolates the popular quantile normalization algorithm for between-array normalization to probe sequence space. These three methods perform favorably to existing strategies, based on the metrics defined here. Availability: http://tiling.gersteinlab.org/sequence_effects/ Contact: mark.gerstein@yale.edu Supplementary information: Supplementary data are available at Bioinformatics online.
A Hybrid Logic for Reasoning about Knowledge and Topology
Authors: Bernhard Heinemann
Venue: Journal of Logic, Language and Information (2008)

We extend Moss and Parikh's bi-modal system for knowledge and effort by means of hybrid logic. In this way, some additional concepts from topology related to knowledge can be captured. We prove the soundness and completeness as well as the decidability of the extended system. Special emphasis will be placed on algebras.
B71-6 System Structure in Data, Programs, and Computers
Authors: T. R. Bashkow
Venue: IEEE Transactions on Computers (1971)

This book represents an interesting attempt to take an overall view of a data system defined by the author as "the artifact that consists of a digital computer, a control program, and an accessible library of programs and data." His intended audience are professionals in the computer industry whose pursuit of specialized vocations leads them away from systematic consideration of the data system as a whole. His avowed aim is "crispness in style and frugality in detail." Consequently this book covers a good deal of ground sometimes very briefly.
Amaze: A Multiplayer Computer Game
Authors: E. J. Berglund
Venue: IEEE Software (1985)

Amaze relies solely on the V kernel for point-to-point communication. The game's techniques could work in a general class of distributed applications.
A fuzzy approach to the flow control problem
Authors: Runtong Zhang, Yannis A. Phillis
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

We consider queueing systems in which arriving customers may be accepted or rejected. The objective is to determine the optimal admission policies so as to maximize the average profit (reward minus cost) over an infinite horizon. In this paper we use fuzzy logic to solve two problems for which analytical solutions exist. Fuzzy logic produces identical policies to the analytical ones and, therefore, these problems serve as benchmarks for further work. We then tackle a new problem with two arrival streams and parallel servers. The fuzzy approach is tested with simulation, and appears to be efficient and promising in areas where analysis is limited.
An Argument in Favor of Mechanized Software Production
Authors: G. -C. Roman
Venue: IEEE Transactions on Software Engineering (1977)

A new software engineering methodology called program control structuring is proposed. Its development is justified by the need to offer the designer the capability to improve the productivity and quality of software development in the conditions of a "highly imperfect" environment. Such an environment is shown to involve the use of transient and inexperienced programmers, frequent alterations to the design specifications, and continuous development. The philosophy behind program control structuring is that of minimizing the probability of error in the design and implementation of large programs by means of language-and problem-dependent standardization. The particular standardization approach used by program control structuring is shown to provide 1) a program structure that is simple and flexible, readily understood, easily developed, and inexpensively maintained, and 2) a high-quality and partially mechanizable structure-oriented documentation scheme. Subsequently, it is suggested that many of the standards are mechanizable in the immediate future as a necessary condition for achieving higher productivity and improved program quality. Finally, the mechanization of software production is proposed as a step needed to precede the development of automatic program generation systems.
Exploiting symmetry in SAT-based Boolean matching for heterogeneous FPGA technology mapping
Authors: Yu Hu, Victor Shih, Rupak Majumdar, Lei He
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

The Boolean matching problem is a key procedure in technology mapping for heterogeneous Field Programmable Gate Arrays (FPGA), and SAT-based Boolean matching (SAT-BM) provides a highly flexible solution for various FPGA architectures. However, the computational complexity of state-of-the-art SAT-BM prohibits its application practically. In this paper we propose an efficient SAT-BM algorithm by exploring function and architectural symmetries. While the most recent work obtained up to 13x speedup, we achieve up to 200x speedup, when both are compared to the original SAT-BM algorithm.
Segmentation of Three-dimensional Retinal Image Data
Authors: Alfred Fuller, Robert Zawadzki, Stacey Choi, David Wiley, John Werner, Bernd Hamann
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

We have combined methods from volume visualization and data analysis to support better diagnosis and treatment of human retinal diseases. Many diseases can be identified by abnormalities in the thicknesses of various retinal layers captured using optical coherence tomography (OCT). We used a support vector machine (SVM) to perform semi-automatic segmentation of retinal layers for subsequent analysis including a comparison of layer thicknesses to known healthy parameters. We have extended and generalized an older SVM approach to support better performance in a clinical setting through performance enhancements and graceful handling of inherent noise in OCT data by considering statistical characteristics at multiple levels of resolution. The addition of the multi-resolution hierarchy extends the SVM to have &#x201C;global awareness.&#x201D; A feature, such as a retinal layer, can therefore be modeled
AMPer
Authors: Christopher D. Fjell, Robert E.W. Hancock, Artem Cherkasov
Venue: Bioinformatics (2007)

Motivation: Increasing antibiotics resistance in human pathogens represents a pressing public health issue worldwide for which novel antibiotic therapies based on antimicrobial peptides (AMPs) may offer one possible solution. In the current study, we utilized publicly available data on AMPs to construct hidden Markov models (HMMs) that enable recognition of individual classes of antimicrobials peptides (such as defensins, cathelicidins, cecropins, etc.) with up to 99% accuracy and can be used for discovering novel AMP candidates. Results: HMM models for both mature peptides and propeptides were constructed. A total of 146 models for mature peptides and 40 for propeptides have been developed for individual AMP classes. These were created by clustering and analyzing AMP sequences available in the public sources and by consequent iterative scanning of the Swiss-Prot database for previously unknown gene-coded AMPs. As a result, an additional 229 additional AMPs have been identified from Swiss-Prot, and all but 34 could be associated with known antimicrobial activities according to the literature. The final set of 1045 mature peptides and 253 propeptides have been organized into the open-source AMPer database. Availability: The developed HMM-based tools and AMP sequences can be accessed through the AMPer resource at http://www.cnbi2.com/cgi-bin/amp.pl Contact: cfjell@interchange.ubc.ca Supplementary information: Supplementary data are available at Bioinformatics online.
High-Level Power Management of Audio Power Amplifiers for Portable Multimedia Applications
Authors: Kyungsoo Lee, Youngjin Cho, Naehyuck Chang
Venue: Proceedings of the 2006 IEEE/ACM/IFIP Workshop on Embedded Systems for Real Time Multimedia (2006)

Modern hand-held multimedia devices are equipped with high-power audio subsystems with built-in loudspeakers. These audio subsystems consume around 30% of the total system power, due to the poor efficiency of loudspeakers, even though high-efficiency class-D amplifiers are used. We introduce an elaborated system-level approach to the analysis of power consumption in amplifiers and consequent power saving for hand-held multimedia applications. Loudspeakers act like resistors below the resonant region and above the linear region, dissipating battery power without producing audible sound output. We exploit the poor frequency response of typical built-in miniature loudspeakers with inadequate enclosures, and limit the production of unnecessary frequencies that never become recognizable sound. We achieve up to 23% and 35% power reduction without appreciable fidelity degradation, with an SNR (signal to noise ratio) of 33% and 35%, for a class-AB and class-D amplifiers, respectively. All the data and experimental results in this paper are actual measurements using our in-house audio power analysis platform
Catch me, if you can: evading network signatures with web-based polymorphic worms
Authors: Matthew Van Gundy, Davide Balzarotti, Giovanni Vigna
Venue: Proceedings of the first USENIX workshop on Offensive Technologies (2007)

Polymorphic worms are self-replicating malware that change their representation as they spread throughout networks in order to evade worm detection systems. A number of approaches to detect polymorphic worms have been proposed. These approaches use samples of a polymorphic worm (and of benign traffic as well) to derive a signature that can detect all instances of the worm without producing excessive false positives. Even though these systems claim to be able to generate signatures for any type of worm, all the examples that are used to show the ability to detect polymorphic worms are based on exploits that target memory corruption vulnerabilities. In this paper, we show how a different class of worms, namely those based on web vulnerabilities and scripting languages, can be much harder to detect than "traditional" polymorphic worms. We developed a polymorphic engine for PHP code and we tested the ability of state-of-the-art tools to detect this type of worm. The results of our experiments show that a PHP-based polymorphic worm would be able to successfully evade existing signature generation systems.
A regression-based temporal pattern mining scheme for data streams
Authors: Wei-Guang Teng, Ming-Syan Chen, Philip S. Yu
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

We devise in this paper a regression-based algorithm, called algorithm FTP-DS (Frequent Temporal Patterns of Data Streams), to mine frequent temporal patterns for data streams. While providing a general framework of pattern frequency counting, algorithm FTP-DS has two major features, namely one data scan for online statistics collection and regression-based compact pattern representation.To attain the feature of one data scan, the data segmentation and the pattern growth scenarios are explored for the frequency counting purpose. Algorithm FTP-DS scans online transaction flows and generates candidate frequent patterns in real time. The second important feature of algorithm FTP-DS is on the regression-based compact pattern representation. Specifically, to meet the space constraint, we devise for pattern representation a compact ATF (standing for Accumulated Time and Frequency) form to aggregately comprise all the information required for regression analysis. In addition, we develop the techniques of the segmentation tuning and segment relaxation to enhance the functions of FTP-DS. With these features, algorithm FTP-DS is able to not only conduct mining with variable time intervals but also perform trend detection effectively. Synthetic data and a real dataset which contains net-Permission work alarm logs from a major telecommunication company are utilized to verify the feasibility of algorithm FTP-DS.
A Real-Time Operating System for Manned Spaceflight
Authors: P. W. Weiler, R. S. Kopp, R. G. Dorman
Venue: IEEE Transactions on Computers (1970)

This paper highlights the salient features of the real- time operating system/360 (RTOS) which is being used as the ground support system for the Apollo space program.
OBSI: Object Based Storage System for Massive Image Databases
Authors: Lihua Yu, Gang Chen, Yijun Bei, Feng Shao, JinXiang Dong
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

The popularity of online free album services in the recent prevailing Web2.0 paradigm has posed great challenges to the existing image storage systems. In this paper, we analyze the characteristics of online image storage techniques from a system perspective. We present a novel framework called OBSI, which stands for an object based storage system for storing and retrieving images of online album services. In the design of OBSI, we employ a novel divide and conquer approach which subdivides OBSI into two layers: an object layer and a chunk layer. The chunk layer handles the "dirty work", such as disk space management and reliability guarantee. The object layer provides a uniform object storage and retrieval interface to applications. OBSI reduces disk access by employing a simple and yet effective storage allocation algorithm which allocates storage objects continuously as clustered to their respective metadata. Experimental results show that OBSI provides high efficiency and throughput in image storage and retrieval services.
Application of Multithreshold Elements in the Realization of Many-Valued Logic Networks
Authors: A. Druzeta
Venue: IEEE Transactions on Computers (1974)

Multithreshold many-valued switching primitives are introduced. Their usefulness in the construction of many-valued storage elements is demonstrated. It is shown that they can be advantageously employed in large combinational networks, such as those found in arithmetic units.
On a conjecture for trigonometric sums and starlike functions
Authors: Stamatis Koumandos, Stephan Ruscheweyh
Venue: Journal of Approximation Theory (2007)

We pose and discuss the following conjecture: let s"n^@m(z)@?@?"k"="0^n(@m)"kk!z^k, and for @r@?(0,1] let @m^*(@r) be the unique solution @m@?(0,1] of @!"0^(^@r^+^1^)^@psint-@r@pt^@m^-^1dt=0.Then for 0
ALOHA - a grading tool for semi-automatic assessment of mass programming courses
Authors: Tuukka Ahoniemi, Tommi Reinikainen
Venue: Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006 (2006)

Many mass programming courses face the problems related to using multiple graders for student assignments: achieving objectivity and consistency in grading. Grading rubrics are a possible solution to this problem. ALOHA is an online grading tool that provides rubrics that all the graders have to use. ALOHA also provides features that make the grading process, including the writing of a feedback text, more convenient for the graders and the teacher.
Application of Data Mining Techniques to the Storage Management and Online Distribution of Satellite Images
Authors: Denise Nunes Rotandi Azevedo
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Nowadays, the massive amount of information stored in organizations of different market branches is a potential knowledge source to be explored and extracted. This paper describes a prototype developed in the context of an Online Satellite Images Distribution System using Data Mining Techniques for the knowledge extraction concerning the image use, seeking for the improvement of the distribution services rendered, as well as the improvement of the processing resources and storage administration. The developed prototype used real Image Data of the Satellite Database (Catalogue) and classification algorithms to determine the use potentiality of each image received through the Satellite and to understand the main characteristics of it. The obtained results indicate that the use of Data Mining techniques can help in automating the choice of images to be previously processed and stored. It can represent an improvement in the customer service and can lead to a better use of the storage space and the processing resources.
Networked Control Systems: Definition and Analysis of a Hybrid Priority Scheme for the Message Scheduling
Authors: Guy Juanole, Gerard Mouney
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

The message scheduling is an essential mechanism in the context of Networked Control Systems (NCS) which are systems based on communication networks and which allow, in particular, the implementation of closed loop distributed control applications. The scheduling of the messages of the flows of these closed loop distributed applications strongly influences the stability of these applications. The message scheduling is, in several networks, mainly based on fixed (static) priorities associated to the messages (for example the network CAN). In previous works, we have shown that the static priority scheme has intrinsic limitations and so, we propose in this paper, in order to overcome these limitations, the concept of hybrid (hierarchical) priority. Different hybrid priority schemes are presented and evaluated with respect to the stability performances of the closed loop distributed process control applications. We show, in particular, the advantage of a scheduling based on a scheme "hybrid priority + time strategy".