ppxscal/embedding_network huggingface dataset:
From conditional probability to the logic of doxastic actions
Authors: Alexandru Baltag, Sonja Smets
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

We investigate the discrete (finite) case of the Popper-Renyi theory of conditional probability, introducing discrete conditional probabilistic models for knowledge and conditional belief, and comparing them with the more standard plausibility models. We also consider a related notion, that of safe belief, which is a weak (nonnegatively introspective) type of "knowledge". We develop a probabilistic version of this concept ("degree of safety") and we analyze its role in games. We completely axiomatize the logic of conditional belief, knowledge and safe belief over conditional probabilistic models. We develop a theory of probabilistic dynamic belief revision, introducing "action models" and a notion of probabilistic update product, that comes together with appropriate reduction laws.
Distilling Programs for Verification
Authors: G. W. Hamilton
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

In this paper, we show how our program transformation algorithm called distillation can not only be used for the optimisation of programs, but can also be used to facilitate program verification. Using the distillation algorithm, programs are transformed into a specialised form in which functions are tail recursive, and very few intermediate structures are created. We then show how properties of this specialised form of program can be easily verified by the application of inductive proof rules. We therefore argue that the distillation algorithm is an ideal candidate for inclusion within compilers as it facilitates the two goals of program optimization and verification.
Address Fragment-Compact Garbage Collection
Authors: Yang Fei, Yin Baolin
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

A garbage collection algorithm, Address Fragment- Compact (AFC) is discussed in this paper. The algorithm is based on Address Sort-Compact (ASC) algorithm. AFC algorithm operates in two stages: the object scanning stage and the heap compacting stage. During object scanning, the addresses of the live objects are added to the fragment ordered address queue without sorting, the addresses of the pointers pointing to the live objects are added to the deference set. In the compacting stage, the live objects are moved to the lower end of the heap in different ways according to their sizes. As AFC does not sort the addresses of the objects and updates the deference set in just one pass, it is more efficient than ASC. Test shows that the pause time of AFC is 30% up to 50% shorter than that of ASC while saves 50% to 60% memory compared with ASC.
Evaluating the Performance of a Biclustering Algorithm Applied to Collaborative Filtering - A Comparative Analysis
Authors: Pablo A. D. de Castro, Fabricio O. de Franca, Hamilton M. Ferreira, Fernando J. Von Zuben
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

Collaborative filtering (CF) is a method to perform automated suggestions for a user based on the opinion of other users with similar interest. Most of the CF algorithms do not take into account the existent duality between users and items, considering only the similarities between users or only the similarities between items. The authors have proposed in a previous work a bio-inspired methodology for CF, namely BIC-aiNet, capable of clustering rows and columns of a data matrix simultaneously. The usefulness and performance of the methodology are reported in the literature. Now, the authors carry out more rigorous comparative experiments with BICaiNet and other techniques found in the literature, as well as evaluate the scalability of the algorithm in several datasets of different sizes. The results indicate that our proposal is able to provide useful recommendations for the users, outperforming other methodologies for CF.
Counting Down to Zero Software Failures
Authors: R. M. Poston
Venue: IEEE Software (1987)

Can you produce software in which your customers can find no failures? Perhaps not, but one metodology will help you get very close to doing so, as this commercial case study shows.
A Microcomputer with a Shift-Register Memory
Authors: S. I. Kartashev
Venue: IEEE Transactions on Computers (1976)

A study of architecture for an 8-bit microprogrammed microcomputer (MPM) is presented in this paper. The control memory of this microcomputer is implemented as a dynamic shift-register memory (SRM). It is shown that the use of the SRM simplifies the processor circuits to such an extent that the entire CPU can be placed on a single LSI module. A new type of instruction (the tabled instruction) introduced not only simplifies organization of data exchange between the SRM and the processor, but also allows organizing of complex control sequences. It is shown that some tabled instructions implement the actions which ordinarily are performed by small subroutines of conventional microprogrammed computers. Other features of the MPM are more 1) a powerful set of instructions and 2) greatly simplified programming, since hundreds of processor registers are made available to the programmer.
Feature selection via sensitivity analysis of SVM probabilistic outputs
Authors: Kai-Quan Shen, Chong-Jin Ong, Xiao-Ping Li, Einar P. Wilder-Smith
Venue: Machine Learning (2008)

Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) learning. Like most feature-selection methods, the proposed method ranks all features in decreasing order of importance so that more relevant features can be identified. It uses a novel criterion based on the probabilistic outputs of SVM. This criterion, termed Feature-based Sensitivity of Posterior Probabilities (FSPP), evaluates the importance of a specific feature by computing the aggregate value, over the feature space, of the absolute difference of the probabilistic outputs of SVM with and without the feature. The exact form of this criterion is not easily computable and approximation is needed. Four approximations, FSPP1-FSPP4, are proposed for this purpose. The first two approximations evaluate the criterion by randomly permuting the values of the feature among samples of the training data. They differ in their choices of the mapping function from standard SVM output to its probabilistic output: FSPP1 uses a simple threshold function while FSPP2 uses a sigmoid function. The second two directly approximate the criterion but differ in the smoothness assumptions of criterion with respect to the features. The performance of these approximations, used in an overall feature-selection scheme, is then evaluated on various artificial problems and real-world problems, including datasets from the recent Neural Information Processing Systems (NIPS) feature selection competition. FSPP1-3 show good performance consistently with FSPP2 being the best overall by a slight margin. The performance of FSPP2 is competitive with some of the best performing feature-selection methods in the literature on the datasets that we have tested. Its associated computations are modest and hence it is suitable as a feature-selection method for SVM applications.
Supervisor Existence for Product Composition of Discrete Event Systems
Authors: Chengjia Li, Yifan Cai, Xiaodong Sun
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

A discrete event system is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. The supervisory control of product composition for discrete event systems is investigated. For discrete event systems modeled by automata, when the supervisors for two subsystems exist, the existence condition of supervisor composed from the sub supervisors for the overall product systems is obtained. Furthermore, the relationship of supervisors between the overall systems and the subsystems are also illustrated.
Fault Diagnosis for Power Electronic System with Fault Gradation Using Assembly Neural Network Group
Authors: Chengcai Ma, Xiaodong Gu, Yuanyuan Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

The existing methods of fault diagnosis almost treat all the faults equally. This always leads to large expense of the whole diagnosis system and serious faults are not controlled efficiently. This paper proposes a new fault diagnosis approach to power electronic system with fault gradation using assembly BP(Back-Propagation) neural network group consisting of 3 sub BP neural networks. According to the hazard extents and the occurrence frequencies of different faults, the faults are divided into different grades. The higher the fault grade, the larger the number of the used sub neural networks is. Experimental results show that the diagnosis correctness rate of the faults with the highest grade is 100% , and the diagnosis correctness rates of the other faults with lower grade, which are of less hazard and lower occurrence frequency, are also about 95%.Because the final output is the sum of the products of the sub neural networks' outputs and their confidence degrees, the wrong output of one sub neural network has little influence to the final output of the assembly neural network group. Therefore, our approach makes the correctness rate of the fault diagnosis rise greatly. The approach proposed in this paper also can be expanded to other fault diagnoses, such as mechanical systems.
Comments on " ANew Algorithm for Generating Prime Implicants"
Authors: S. R. Das
Venue: IEEE Transactions on Computers (1971)

One of the major areas in switching theory research has been concerned with obtaining suitable algorithrns for the minimization of Boolean functions in connection with the general problem of their economic realization. A solution of the minimization problem, in general, involves consideration of two distinct phases. In the first phase all the prime implicants of the function are found, while in the second phase, from this set of all the prime implicants, a minimal subset (according to some criterion of minimality) of prime implicants is selected such that their disjunction is equivalent to the function and from which none of the prime implicants can be dropped without sacrificing equivalence. Many different algorithms exist for solving both the first and the second phase of this minimization problem. In a recent paper,' Slagle et al. describe a new algorithm for the generation of all the prime implicants of a Boolean function. As claimed by the authors, this algorithm is different from those previously given in the literature. The algorithm is efficient, does not generate the same prime implicant more than once (though the algorithm sometimes generates some non-prime implicants), and does not need large capacity of memory for implementation on a digital computer. The algorithm works equally well with either the conjunctive or the disjunctive (both canonical and noncanonical) form of the function.
Is it worth learning differential geometric methods for modeling and control of mechanical systems?
Authors: Andrew D. Lewis
Venue: Robotica (2007)

Evidence is presented to indicate that the answer is, “Yes, sometimes.”
Fault Tolerant Arithmetic Operations with Multiple Error Detection and Correction
Authors: Saeed Safari
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

Emerging technologies are dealing with more complex VLSI systems, also smaller gates and transistors which are severely influenced by electromagnetic noises and Single Event Transient (SET) errors. Because of this increase in sensitivity and decrease in size, several soft errors might appear at the same time which can lead to multiple simultaneous errors. In this paper a concurrent and multiple error detection and correction scheme is presented for adders and multipliers based on the combination of a parity prediction scheme and a partially distributed triple modular redundancy. This scheme fits carry look-ahead and carry-skip adders/ALUs in which the carry logic represents the largest part of the circuit. The efficiency of the scheme is basically analyzed by the probability computations. The simulation of multiple random fault injection is performed to validate the predicted performance.
Statistical Disk Cluster Classification for File Carving
Authors: Cor J. Veenman
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

File carving is the process of recovering files from a disk without the help of a file system. In forensics, it is a helpful tool in finding hidden or recently removed disk content. Known signatures in file headers and footers are especially useful in carving such files out, that is, from header until footer. However, this approach assumes that file clusters remain in order. In case of file fragmentation, file clusters can be disconnected and the order can even be disrupted such that straighforward carving will fail. In this paper, we focus on methods for classifying clusters into file types by using the statistics of the clusters. By not exploiting the possible embedded signatures, we generate evidence from a different source that can be integrated lateron. We propose a set of characteristic features and use statistical pattern recognition to learn a supervised classification model for a range of relevant file types. We exploit the statistics of a restricted number of neighboring clusters (context) to improve classification performance. In the experiments we show that the proposed features indeed enable the differentation of clusters into file types. Moreover, for some file types the incorporation of cluster context improves the recognition performance significantly.
Hardware Description Languages: Voices from the Tower of Babel*
Authors: G. J. Lipovski
Venue: Computer (1977)

A hardware description language can be used to describe the logic gates, the sequential machines, and the functional modules, along with their interconnection and their control, in a digital system. In a general sense, Boolean equations, logic diagrams, programrning languages, and Petri nets are hardware description languages: they can be used to describe some aspect of hardware and they have definable syntax and semantics. Specifically, what is more commonly referred to as a hardware description language is a variation of a programming language tuned to the overall needs of describing hardware. This article will discuss the rationale for using such languages in the first place, identify the problems attendant upon their proliferation, and describe the measures being taken to achieve a solution.
Thread algebra for strategic interleaving
Authors: J. A. Bergstra, C. A. Middelburg
Venue: Formal Aspects of Computing (2007)

We take a thread as the behavior of a sequential deterministic program under execution and multi-threading as the form of concurrency provided by contemporary programming languages such as Java and C#. We outline an algebraic theory about threads and multi-threading. In the case of multi-threading, some deterministic interleaving strategy determines how threads are interleaved. Interleaving operators for a number of plausible interleaving strategies are specified in a simple and concise way. By that, we show that it is essentially open-ended what counts as an interleaving strategy. We use deadlock freedom as an example to show that there are properties of multi-threaded programs that depend on the interleaving strategy used.
Extracting rhythmic brain activity for brain-computer interfacing through constrained independent component analysis
Authors: Suogang Wang, Christopher J. James
Venue: Computational Intelligence and Neuroscience (2007)

We propose a technique based on independent component analysis (ICA) with constraints, applied to the rhythmic electroen-cephalographic (EEG) data recorded from a brain-computer interfacing (BCI) system. ICA is a technique that can decompose the recorded EEG into its underlying independent components and in BCI involving motor imagery, the aim is to isolate rhythmic activity over the sensorimotor cortex. We demonstrate that, through the technique of spectrally constrained ICA, we can learn a spatial filter suited to each individual EEG recording. This can effectively extract discriminatory information from two types of single-trial EEG data. Through the use of the ICA algorithm, the classification accuracy is improved by about 25%, on average, compared to the performance on the unpreprocessed data. This implies that this ICA technique can be reliably used to identify and extract BCI-related rhythmic activity underlying the recordings where a particular filter is learned for each subject. The high classification rate and low computational cost make it a promising algorithm for application to an online BCI system.
Specify, Compile, Run: Hardware from PSL
Authors: Roderick Bloem, Stefan Galler, Barbara Jobstmann, Nir Piterman, Amir Pnueli, Martin Weiglhofer
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We propose to use a formal specification language as a high-level hardware description language. Formal languages allow for compact, unambiguous representations and yield designs that are correct by construction. The idea of automatic synthesis from specifications is old, but used to be completely impractical. Recently, great strides towards efficient synthesis from specifications have been made. In this paper we extend these recent methods to generate compact circuits and we show their practicality by synthesizing a generalized buffer and an arbiter for ARM's AMBA AHB bus from specifications given in PSL. These are the first industrial examples that have been synthesized automatically from their specifications.
KoMIS: An Ontology-Based Knowledge Management System for Industrial Safety
Authors: Amjad Abou Assali, Dominique Lenne, Bruno Debray
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

This paper presents an ontology-based knowledge management system for indexing and retrieving information about a domain-specific corpus of resources in an industrial enterprise. From our ongoing project KoMIS (Knowledge Management for Industrial Safety), we introduce in this paper our approach to index the internal resources of an enterprise using two ontologies; a domain ontology that describes the terms of the studied domain (the industrial safety domain), and an application ontology that describes the various types of indexed resources. In our indexing approach, the resulting index is an RDF file that can be interrogated using one of the RDF query languages. An ontology-based information retrieval system is built as a Web application to help and guide users in their research for resources. Thanks to our indexing and retrieval model, the returned Web page of results is built dynamically so that each potential modification of the application ontology will be taken into account without affecting the internal structure of the information retrieval system.
Luxury & new luxury, quality & equality
Authors: Eli Blevis, Kevin Makice, William Odom, David Roedl, Christian Beck, Shunying Blevis, Arvind Ashok
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

This paper describes and compares notions of luxury and new luxury as a social notion of sustainability. The context of the discourse is sustainable interaction design (SID), defined in the paper and attributed to several sources. Several research questions are posed concerning the relationship between luxury, new luxury, quality, and equality in the context of SID. We propose an informal design critical framework that embeds interaction design in terms of luxury and sustainability. Several examples of products and services are analyzed in the proposed framework according to three themes: communications, computer software, and music. The paper concludes by reflecting on the research questions with respect to the framework.
Implementation of ebXML Message Transaction supported on a Security and Reliability for Effective e-Business
Authors: Chang-ryul Jung, B. N. Sudhakar, Sung-keun Lee, Jin-gwang Koh
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

..In this paper, we propose the development strategy of message transaction system in electronic business to business system with consideration of security. B2B must be designed to transfer electronic data between business and business in completely secured and reliable form. For the purpose of secured and reliable transaction of electronic data, we propose the complete framework . Also, we provide message system for communication and transaction for E-business, and provide message test set through the development strategy for interoperability of message. The message test set is a data class modeling of ebXML MSH(message service handler) which supports message test set to ebXML message transaction of e-business. Finally, we implemented the message processing system through SMTP Mail transaction into ebMSH for the ebXML Message Test-Set for message service transaction after database relationship.
Researches and Application of Algorithm on Core Characteristic Extraction for Auto-separating System of Watermelon Seeds
Authors: Sun Yong, Guan Miao, Yu Daoqin, Li Hong Gang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

The algorithm of extracting a series of characteristic value, taking watermelon seeds as the research object, has been successfully applied into the software system of separating watermelon seeds automatically. By extracting characteristic values, like the length of orthogonal long and minor axis of the watermelon seeds, the proportion between the length and width, the area, the degree of connecting superficial pattern, the coverage degree of black region and the distribution difference of histogram gradation and screening the watermelon seeds, the software system finally divides and picks the qualified melon seeds. The system takes visual interface. It has the interactive function between man and machine, being more objective, more accurate and more convenient, compared with the hands' works. The realization of real-time image gathering function enormously enhances the speed and the efficiency. The core technology of the software system also can be served as important reference for other relevant fields.