Combination of convex theories: Modularity,deduction completeness,and explanation

Decision procedures are key components of theorem provers and constraint satisfaction systems. Their modular combination is of prime interest for building efficient systems, but their effective use is often limited by poor interface capabilities, when such procedures only provide a simple “sat/unsat” answer. In this paper, we develop a framework to design cooperation schemas between such procedures while maintaining modularity of their interfaces. First, we use the framework to specify and prove the correctness of classic combination schemas by Nelson–Oppen and Shostak. Second, we introduce the concept of deduction complete satisfiability procedures, we show how to build them for large classes of theories, then we provide a schema to modularly combine them. Third, we consider the problem of modularly constructing explanations for combinations by re-using available proof-producing procedures for the component theories.     

Spin-valve planar Hall sensor for single bead detection

The planar Hall effect (PHE) sensor with a junction size of 3 μm × 3 μm for a single micro-bead detection has been fabricated successfully using a typical spin-valve thin film Ta(5)/NiFe(16)/Cu(1.2)/NiFe(2)/IrMn(15)/Ta(5) nm. The PHE sensor exhibits a sensitivity of about 7.2 μV Oe^?1 in the magnetic field range of ±7 Oe approximately. We have performed an experiment to illustrated the possibility of single micro-bead detection by using a PHE sensor. A single micro-bead of 2.8 μm diameter size is secluded from 0.1% dilute solution of the Dynabeads^® M-280 dropped on the sensor surface and is located on the sensor junction by using a micro magnetic needle. The comparison of the PHE voltage profiles in the field range from 0 to 20 Oe in the absence and presence of a single micro-bead identifies a single Dynabeads^® M-280, the maximal signal change as large as ΔV ～ 1.1 μV can be obtained at the field ～6.6 Oe. The results are well described in terms of the reversal of a basic single domain structure.     

TRUST BY ASSOCIATION: A META‐REPUTATION SYSTEM FOR PEER‐TO‐PEER NETWORKS

Trust mechanisms are used in peer‐to‐peer (P2P) networks to help well‐behaving peers find other well‐behaving peers with which to trade. Unfortunately, these trust mechanisms often do little to keep badly behaving peers from entering and taking advantage of the network, which makes the resulting network difficult or impossible to use for legitimate purposes such as e‐commerce. We propose trust by association, a way of tying peers together in invitation‐only P2P networks in such a way as to encourage the removal of badly behaving peers. We use invitations to create a structure within the otherwise ad hoc P2P network. Using this structure, we create a meta‐reputation system where we measure a peer’s trustworthiness not only by its own behavior, but also by the behavior of the peers it has invited to join. The connection created between the peers takes advantage of the external social relationship that must exist before a peer can be invited into the network. The result is a P2P network where, rather than just trying to marginalize badly behaving peers, there is incentive to kick them out of the network. We present results from a simple simulation showing that our approach works well in general when combined with and compared to an existing trust mechanism.     

Improving traversability of quadruped walking robots using body movement in 3D rough terrains

This paper presents a study on improving the traversability of a quadruped walking robot in 3D rough terrains. The key idea is to exploit body movement of the robot. The position and orientation of the robot are systematically adjusted and the possibility of finding a valid foothold for the next swing is maximized, which makes the robot have more chances to overcome the rough terrains. In addition, a foothold search algorithm that provides the valid foothold while maintaining a high traversability of the robot, is investigated and a gait selection algorithm is developed to help the robot avoid deadlock situations. To explain the algorithms, new concepts such as reachable area, stable area, potential search direction, and complementary kinematic margin are introduced, and the effectiveness of the algorithms is validated via simulations and experiments.     

Integrated micro Pirani gauge based hermetical package monitoring for uncooled VO x bolometer FPAs

This paper presents the design and fabrication of a micro Pirani gauge using VO _x as the sensitive material for monitoring the pressure inside a hermetical package for micro bolometer focal plane arrays (FPAs). The designed Pirani gauge working in heat dissipating mode was intentionally fabricated using standard MEMS processing which is highly compatible with the FPAs fabrication. The functional layer of the micro Pirani gauge is a VO _x thin film designed as a 100 × 200 μm pixel, suspended 2 μm above the substrate. By modeling of rarefied gas heat conduction using the Extended Fourier’s law, finite element analysis is used to investigate the sensitivity of the pressure gauge. Also the thermal interactions between the micro Pirani gauge and bolometer FPAs are verified. From the fabricated prototype, the measured device TCR is about −0.8% K⁻¹ and the sensitivity about 1.84 × 10⁻³ W K⁻¹ mbar⁻¹.     

SVM for English semantic classification in parallel environment

Semantic analysis is very important and very helpful for many researches and many applications for a long time. SVM is a famous algorithm which is used in the researches and applications in many different fields. In this study, we propose a new model using a SVM algorithm with Hadoop Map (M)/Reduce (R) for English document-level emotional classification in the Cloudera parallel network environment. Cloudera is also a distributed system. Our English testing data set has 25,000 English documents, including 12,500 English positive reviews and 12,500 English negative reviews. Our English training data set has 90,000 English sentences, including 45,000 English positive sentences and 45,000 English negative sentences. Our new model is tested on the English testing data set and we achieve 63.7% accuracy of sentiment classification on this English testing data set.     

A decision tree using ID3 algorithm for English semantic analysis

Natural language processing has been studied for many years, and it has been applied to many researches and commercial applications. A new model is proposed in this paper, and is used in the English document-level emotional classification. In this survey, we proposed a new model by using an ID3 algorithm of a decision tree to classify semantics (positive, negative, and neutral) for the English documents. The semantic classification of our model is based on many rules which are generated by applying the ID3 algorithm to 115,000 English sentences of our English training data set. We test our new model on the English testing data set including 25,000 English documents, and achieve 63.6% accuracy of sentiment classification results.     

BSPNN: boosted subspace probabilistic neural network for email security

In the modern age of Internet connectivity, advanced information systems have accumulated huge volumes of data. Such fast growing, tremendous amount of data, collected and stored in large databases has far exceeded our human ability to comprehend without proper tools. There has been a great deal of research conducted to explore the potential applications of Machine Learning technologies in Security Informatics. This article studies the Network Security Detection problems in which predictive models are constructed to detect network security breaches such as spamming. Due to overwhelming volume of data, complexity and dynamics of computer networks and evolving cyber threats, current security systems suffer limited performance with low detection accuracy and high number of false alarms. To address such performance issues, a novel Machine Learning algorithm, namely Boosted Subspace Probabilistic Neural Network (BSPNN), has been proposed which combines a Radial Basis Function Neural Network with an innovative diversity-based ensemble learning framework. Extensive empirical analyses suggested that BSPNN achieved high detection accuracy with relatively small computational complexity compared with other conventional detection methods.     

Efficient Multimedia Distribution in Source Constraint Networks

In recent years, the number of peer-to-peer (P2P) applications has increased significantly. One important problem in many P2P applications is how to efficiently disseminate data from a single source to multiple receivers on the Internet. A successful model used for analyzing this problem is a graph consisting of nodes and edges, with a capacity assigned to each edge. In some situations however, it is inconvenient to use this model. To that end, we propose to study the problem of efficient data dissemination in a source constraint network. A source constraint network is modeled as a graph in which, the capacity is associated with a node, rather than an edge. The contributions of this paper include (a) a quantitative data dissemination in any source constraint network, (b) a set of topologies suitable for data dissemination in P2P networks, and (c) an architecture and implementation of a P2P system based on the proposed optimal topologies. We will present the experimental results of our P2P system deployed on PlanetLab nodes demonstrating that our approach achieves near optimal throughput while providing scalability, low delay and bandwidth fairness among peers.     

Unsupervised active contours driven by density distance and local fitting energy with applications to medical image segmentation

This study presents an efficient variational region-based active contour model for segmenting images without priori knowledge about the object or background. In order to handle intensity inhomogeneities and noise, we propose to integrate into the region-based local intensity model a global density distance inspired by the Bhattacharyya flow. The local term based on local information of segmented image allows the model to deal with bias field artifact, which arises in data acquisition processes. The global term, which is based on the density distance between the probability distribution functions of image intensity inside and outside the active contour, provides information for accurate segmentation, keeps the curve from spilling, and addresses noise in the image. Intensive 2D and 3D experiments on many imaging modalities of medical fields such as computed tomography, magnetic resonance imaging, and ultrasound images demonstrate the effectiveness of the model when dealing with images with blurred object boundary, intensity inhomogeneities, and noise.