Search

Kraft paper is the most popular raw material for based-paper packaging containers. Poisson’s ratio is an important index to indicate the inherent property of materials. There were many difficulties to measure Poisson’s ratio of kraft paper using the traditional contract methods, because of its micro deformation and anisotropy. A simple and efficient non-contract method had been proposed to solve this problem using DIC(Digital Image Correlation) method in this paper. Obtained the relative deformation of samples by calibrated CCD images, Poisson’s ratio could be computed. The test results indicated that Poisson’s ratios of corrugating medium in the MD(Machine Direction) and CD (Cross-machine Direction) were 0.275 and 0.119, and ones of linerboard were 0.275 and 0.119 in MD and CD, respectively. This study showed that DIC was a new approach to measure Poisson’s ratio of kraft paper.

SVM is a new general learning method based on the statistic learning system which can be used as an effective means to process small sample, nonlinear and high dimensional pattern recognition. This paper did research on the learning algorithm of support vector machine, extracted characteristic data of banknote which is on account of PCA according to the characteristics of the support vector machine (SVM), and proposed to put support vector machine (SVM) into banknotes denomination recognition by combining SMO training algorithm with one-to-many multi-value classification algorithm. Besides, this article used genetic algorithm in parameters optimization such as the punishment coefficient C of soft margin SVM and the width parameter of Gaussian kernel function. The ultimate purpose is to recognize the denomination of banknote efficiently and accurately. The experimental results verified that this kind of recognition method increases the recognition accuracy up to 90% or more.

Dirty-paper trellis-code watermarking with random-valued arcs is slow since the embedding into the cover work is performed on path-level which entails many Viterbi decodings through random convergence. We present a fast deterministic embedding in a trellis-code with orthogonal arcs. The proposed algorithm has a speedup factor of the message size since it is based on arc-level modification of the cover work in a bit-by-bit manner. Experimental results show that the proposed embedding provides higher fidelity and lower BER against various types of attacks, compared with conventional informed methods.

3D geo-information can be thought of in several ways. At the simplest level it involves a 2D data structure with elevation attributes, as with remote sensing data such as LIDAR. The resulting structure forms a simple 2-manifold. At a slightly more advanced level we may recognise that the earth may not always be modelled by a planar graph, but requires bridges and tunnels. This 2-manifold of higher genus may still use the same data structure (e.g. a triangulation) but certain assumptions (e.g. a Delaunay triangulation) no longer hold. Finally, we may wish to model true volumes, in which case a triangulation might be replaced by a tetrahedralisation.

We present an algorithm to find a flat folding of a piece of paper, so that one complete straight cut on the folding creates any desired plane graph of cuts. The folds are based on the straight skeleton, which lines up the desired edges by folding along various bisectors; and a collection of perpendiculars that make the crease pattern foldable. We prove that the crease pattern is flat foldable by demonstrating a family of folded states with the desired properties.

We report an experience on a practical system for drawing hypergraphs in the subset standard. The PATATE system is based on the application of a classical force directed method to a dynamic graph, which is deduced, at a given iteration time, from the hypergraph structure and particular vertex locations. Different strategies to define the dynamic underlying graph are presented. We illustrate in particular the method when the graph is obtained by computing an Euclidean Steiner tree.

Eugene Wigner is above all a theoretical physicist. However he was one of the two men (Hermann Weyl was the other) who introduced a powerful new mathematical tool into quantum mechanics in its earliest years. This is the theory of group representations, invented by Frobenius in 1896, and apparently not applied outside of pure group theory until E. Artin’s startling application to number theory in 1923. Wigner’s first application of this theory to quantum mechanics was published only four years later in 1927. Weyl’s contribution was of a completely different character and was made a few months after Wigner’s.

The core of the relationship between science and technology in Europe can be traced back to Galileo Galilei (died 1642) or Leonardo da Vinci (died 1519). Thus progress in scientific knowledge to the heliocentric world system essentially advanced through improved Dutch telescope technology and excellent lens grinding and also conversely the then new scientific model of the cosmos could be used directly for maritime navigation. Science and technology appear to be closely interlinked. Owing to the connection — obvious even then — between technical change and economic prosperity, early innovations were in no doubt as the importance of science to economic and social advance was self.

This is the final volume of Heisenberg's Collected Works. It contains his papers on a (nonlinear) unified theory of elementary particles, as well as his contribution to superconductivity and multiparticle production. Especially interesting is the first group of papers, which is split intotwo sections dealing with, firstly, the formulation of the famous nonlinear spinor equation and, secondly,its applications. Among others the reader willfind a thorough discussion of Heisenberg's collaboration with W. Pauli on these matters. Illuminating annotations to the various sections in this volume have been provided by H. Koppe, R. Hagedorn and the editors.

Associated with Poincare’s “geometric theorem”, there is a number of proven and unproven propositions on fixed points of symplectic (or, as called by Poincare canonical) diffeomorphisms of symplectic manifolds more general than a circular annulus (or in an even more generally, on intersections of so-called Lagrangian submanifolds of a symplectic manifold).

In 1956 Z. Kuramochi [2] defined a new boundary for any open Riemann surface R. It is now called Kuramochi boundary. Rigorous treatments of this boundary are found in Ill and [4]. It shares some properties with inner points of R. For instance, the values of every SHS function 2) are defined on the Kuramochl boundary in [1]. This was also done by Kuramochl [3] but his discussions were not quite clear.

We construct a stabilized finite-element method to compute flow and finite-strain deformations in an incompressible poroelastic medium. We employ a three-field mixed formulation to calculate displacement, fluid flux and pressure directly and introduce a Lagrange multiplier to enforce flux boundary conditions. We use a low order approximation, namely, continuous piecewise-linear approximation for the displacements and fluid flux, and piecewise-constant approximation for the pressure. This results in a simple matrix structure with low bandwidth. The method is stable in both the limiting cases of small and large permeability. Moreover, the discontinuous pressure space enables efficient approximation of steep gradients such as those occurring due to rapidly changing material coefficients or boundary conditions, both of which are commonly seen in physical and biological applications.

Dirty paper coding (DPC) is shown to achieve the capacity of multiple-input multiple-output (MIMO) Gaussian broadcast channels (BCs). Finding the optimal covariance matrices and order of users for maximizing user capacity requires high complexity computation. To deal with this problem, many researchers use fixed order of users e.g. minimum power first (MPF) and get subpar performance. Meanwhile, the complexity of DPC scheme grows linearly with number of users requiring to cancel known-interference. In this paper we present a scheme combining DPC and traditional Time Division Multiplexing (TDM) that aim to maximize user capacity and reduce complexity of implementation. Simulation results show that the proposed scheme achieves better performance than that of DPC MPF scheme.

Music boxes which play a paper tape are fantastic tools for visually demonstrating some of the mathematical concepts in musical structure. The literal written notes in a piece can be transformed physically through reflections and rotations, and then easily played on the music box. Principles of topology can be demonstrated by playing loops and Mobius strips. Written music can also be transformed into different types of canons by sending it through multiple music boxes.

In September 2009 Gordon Brown, the British Prime Minister, issued a statement on Downing Street’s official website. The statement read: “. . .Thousands of people have come together to demand justice for Alan Turing and recognition of the appalling way he was treated.

Temperature-activated diffusion of a graphene flake on a graphene layer and a commensurate-incommensurate phase transition in bilayer graphene are investigated using the classical potential for graphene developed recently on the basis of first-principles calculations with the van der Waals correction. It is shown that rotation of graphene flakes to incommensurate states can significantly contribute to diffusion of the flakes consisting of several tens of atoms even at room temperature. Formation of incommensurability defects in bilayer graphene upon stretching of one of the layers is observed by molecular dynamics simulations.

We describe an architecture requiring very few changes to any standard von Neumann machine that provably withstands coalitions between a malicious operating system and other users, in the sense that: If the operating system permits a program to run, then the program produces the same outputs as it would produce if it were running on an ideal, single-user machine; moreover, even if the operating system behaves according to expectations only most of the time, the programs get executed. The only information leaked by a program to the malicious coalition is the time and space requirements of the program. If the malicious operating system is dynamically replaced by a good operating system, then the latter can quickly and correctly determine what memory resources are available for future programs, as well as how much time is left for each of the currently executing programs, and can distribute these resources without any restrictions. This can be accomplished without restarting currently executing programs. To our knowledge, ours is the first attempt to provide provable guarantees along these lines, and the first treatment of any kind, provable or otherwise, for the third property.

Several lattice-based cryptosystems require to sample from a discrete Gaussian distribution over the integers. Existing methods to sample from such a distribution either need large amounts of memory or they are very slow. In this paper we explore a different method that allows for a flexible time-memory trade-off, offering developers freedom in choosing how much space they can spare to store precomputed values. We prove that the generated distribution is close enough to a discrete Gaussian to be used in lattice-based cryptography. Moreover, we report on an implementation of the method and compare its performance to existing methods from the literature. We show that for large standard deviations, the Ziggurat algorithm outperforms all existing methods.

An automatic method for rail inspection is introduced in this paper. The method detects rail flaws using computer vision algorithms. Unlike other methods designed for the same goal, we propose a method that automatically fits a 3D rail model to the observations. The proposed strategy is based on the novel combination of a simple but effective laser-camera calibration procedure with the application of an MCMC (Markov Chain Monte Carlo) framework. The proposed particle filter uses the efficient overrelation slice sampling method, which allows us to exploit the temporal coherence of observations and to obtain more accurate estimates than with other sampling techniques. The results show that the system is able to robustly obtain measurements of the wear of the rail. The two other contributions of the paper are the successfull introuction of the slice sampling technique into MCMC particle filters and the proposed online and flexible method for camera-laser calibration.

This paper addresses the problem of shape from shadings under perspective projection and turntable motion.Two-Frame-Theory is a newly proposed method for 3D shape recovery. It estimates shape by solving a first order quasi-linear partial differential equation through the method of characteristics. One major drawback of this method is that it assumes an orthographic camera which limits its application. This paper re-examines the basic idea of the Two-Frame-Theory under the assumption of a perspective camera, and derives a first order quasi-linear partial differential equation for shape recovery under turntable motion. The Dirichlet boundary condition is derived based on Dynamic programming. The proposed method is tested against synthetic and real data. Experimental results show that perspective projection can be used in the framework of Two-Frame-Theory, and competitive results can be achieved.

In two recent papers by Veitch and Roy and by Borgs, Chayes, Cohn, and Holden, a new class of sparse random graph processes based on the concept of graphexes over \(\sigma \)-finite measure spaces has been introduced. In this paper, we introduce a metric for graphexes that generalizes the cut metric for the graphons of the dense theory of graph convergence. We show that a sequence of graphexes converges in this metric if and only if the sequence of graph processes generated by the graphexes converges in distribution. In the course of the proof, we establish a regularity lemma and determine which sets of graphexes are precompact under our metric. Finally, we establish an identifiability theorem, characterizing when two graphexes are equivalent in the sense that they lead to the same process of random graphs.

A natural way to draw two planar graphs whose vertex sets are matched is to assign each matched pair a unique y-coordinate. In this paper we introduce the concept of such matched drawings, which are a relaxation of simultaneous geometric embeddings with mapping. We study which classes of graphs allow matched drawings and show that (i) two 3-connected planar graphs or a 3-connected planar graph and a tree may not be matched drawable, while (ii) two trees or a planar graph and a planar graph of some special families—such as unlabeled level planar (ULP) graphs or the family of "carousel graphs"—are always matched drawable. Research partially supported by the MIUR Project "MAINSTREAM: Algorithms for massive information structures and data streams".

1. The purpose of this paper is to show that FERMI’s potential allows one to determine a priori and with very good approximation all the energy levels of heavy atoms. This also allows one to calculate with remarkable accuracy, considering its statistical character, the splitting of the various terms. This is of great importance considering that one could not apply SOMMERFELD’s relativistic formula to these splittings, as the phenomenon goes well beyond the scheme of the fine-structure theory. Indeed it is well known that one has to use the assumption of the rotating electron which by now has lost its hypothetical character and appears to be well founded on a solid theoretical basis as Dirac’s last paper(1) has shown. Our calculations will be applied to the Roentgen levels of the 3M term of gadolinium (Z = 64) and of uranium (Z = 92) and, in the optical case, to the P terms of cesium (Z = 55).

In order to inherit and develop the Couplet culture, one of the most famous language culture in China, this paper implements a creation system of couplets. In this paper, a noval way to generate the customized couplet is discussed from the name-embedded couplet. The 2-gram word graph technology is used to generate the first sentence which contained the given word. Then, combined with language model which based on statistical method, grammar model and mutual information model, improved Viterbi Algorithm based on HMM is used to decode the second sentence. It turned out that the system can realize the automatic generation of the name embedded couplet. According to the contents involved in the given couplet, the system can generate pictures to match the couplet. This system is aimed for Spring Festival couplets and Birthday couplets, both are name-embedded couplet that generated with the name of people. Users can choose the templates and relative special elements freely to create a satisfactory multimedia couplet picture.

Electronic payment systems have leveraged the advantages offered by the RFID technology, whose security is promised to be improved by applying the notion of Physically Unclonable Functions (PUFs). Along with the evolution of PUFs, numerous successful attacks against PUFs have been proposed in the literature. Among these are machine learning (ML) attacks, ranging from heuristic approaches to provable algorithms, that have attracted great attention. Our paper pursues this line of research by introducing a Fourier analysis based attack against PUFs. More specifically, this paper focuses on two main aspects of ML attacks, namely being provable and noise tolerant. In this regard, we prove that our attack is naturally integrated into a provable Probably Approximately Correct (PAC) model. Moreover, we show that our attacks against known PUF families are effective and applicable even in the presence of noise. Our proof relies heavily on the intrinsic properties of these PUF families, namely arbiter, Ring Oscillator (RO), and Bistable Ring (BR) PUF families. We believe that our new style of ML algorithms, which take advantage of the Fourier analysis principle, can offer better measures of PUF security.

We briefly present notions and results from three directions of research which use formal language theory tools for modelling operations specific to DNA (and RNA) recombinations; in all cases one obtains computability models which are universal (language generating devices are obtained which are equivalent in power with Turing machines). The basic operations are those of sticking (a model of the Watson-Crick complementarity), of splicing (a model of the recombinant behaviour of DNA sequences under the influence of restriction enzymes), and of insertion/deletion (known to hold both for DNA and for RNA sequences). Because this paper is an overview, we present here only definitions and results without proofs; further details can be found in the papers quoted below.

This paper seeks to find an optimal actuation for controlling the reattachment region found downstream of a backward-facing step. The configuration has a 30-mm-height step. The external velocity is fixed at 15 m/s, based on that, the Reynolds number corresponds to 3 × 104. The control is performed via a single dielectric barrier discharge. Several actuation locations along the step model are tested and the best result regarding the modification of the mean reattachment point is observed with the actuator located at the hinge of the step. In terms of unsteady actuation, an optimal frequency is also observed for this position. For these optimal conditions, the paper introduces a brief analysis about the time-dependent modifications of the oscillations around the reattachment region.

Based on the measured data of IGS, the characteristics of QZSS signal, namely, carrier to noise ratio, noise and multipath characteristics, inter-frequency bias, were studied in this paper. At the same time, the results were compared with those of other satellite navigation systems, such as GPS and Galileo, to analyze the reason for the differences. Methods and results provided in this paper have important reference values for the study and construction of satellite navigation systems.

In the "The curse of simultaneity", Paes Leme at al. show that there are interesting classes of games for which sequential decision making and corresponding subgame perfect equilibria avoid worst case Nash equilibria, resulting in substantial improvements for the price of anarchy. This is called the sequential price of anarchy. A handful of papers have lately analysed it for various problems, yet one of the most interesting open problems was to pin down its value for network congestion games, where the price of anarchy equals 5/2. The main contribution of this paper is the surprising result that the sequential price of anarchy is unbounded even for linear symmetric routing games, thereby showing that sequentiality can be arbitrarily worse than simultaneity for this important class of games. Complementing this unboundedness result we solve an open problem in the area by establishing that the (regular) price of anarchy for linear symmetric routing games equals 5/2. Additionally, we prove that in these games, even with two players, computing the outcome of a subgame perfect equilibrium is NP-hard. The latter explains, to some extent, the difficulty of analyzing subgame perfect equilibria.

This paper describes a new method for error model construction. Instead of the standard local slope analysis of the Allan variance, two major modifications are proposed: (1) the Direct Bound principle, i.e. finding an entire error model that generates analyzing tool values that tightly bound the analyzing tool values generated by the real data; (2) instead of using Allan variance as a unique analyzing tool, a variety of analyzing tools termed Direct Predictor (DP) types 0, 1, 2, and 3 are introduced. In the paper, a uniform structure of DPs is developed and their parameterization is extended. For a nominal model that consists of a Markov process with additive white noise, the analytical functions for DPs are presented (for infinite data length). The errors due to the final data length are analyzed. Using these results, a reliable optimization problem is presented to implement the Direct Bound approach. The flexibility of working with hard and soft bounds is introduced. The presented simulation results show that the proposed method is indeed efficient and provides satisfactory results for model parameter estimations. The paper concludes with a description of an entire engineering process to cover test design and its analysis.

The codebook cardinality spectrum (CCS) of distributed arithmetic codes (DAC) provides an effective tool for analyzing the decoding complexity of the full-search DAC decoder. However, in our previous work, the study on CCS is limited to equiprobable binary sources. In this paper, by defining the CCS for nonuniform binary sources, we try to provide a more general theoretical analysis on this complex problem. At first, a general explicit form of the initial CCS is obtained by utilizing the Fourier transform. Then, we get a recursive equation for deducing the CCS forwardly. For the convenience of computation, the paper also provides a numerical method for calculating the CCS. Finally, we define the expansion factor for nonuniform binary sources to measure the complexity of the full-search DAC decoder.

This paper revisits the classical problem of multi-message broadcast: given an undirected network G, the objective is to deliver k messages, initially placed arbitrarily in G, to all nodes. Per round, one message can be sent along each edge. The standard textbook result is an $$OD+k$$ round algorithm, where D is the diameter of G. This bound is existentially optimal, which means there exists a graph $$G'$$ with diameter D over which any algorithm needs $$\varOmega D+k$$ rounds. In this paper, we seek the stronger notion of optimality--called universal optimality by Garay, Kutten, and Peleg [FOCS'93]--which is with respect to the best possible for graph G itself. We present a distributed construction that produces a k-message broadcast schedule with length roughly within an $$\tilde{O}\log n$$ factor of the best possible for G, after $$\tilde{O}D+k$$ pre-computation rounds. Our approach is conceptually inspired by that of Censor-Hillel, Ghaffari, and Kuhn [SODA'14, PODC'14] of finding many essentially-disjoint trees and using them to parallelize the flow of information. One key aspect that our result improves is that our trees have sufficiently low diameter to admit a nearly-optimal broadcast schedule, whereas the trees obtained by the algorithms of Censor-Hillel et al. could have arbitrarily large diameter, even up to $$\Theta n$$.

In the present paper, we propose Abstract Algebraic Logic (AAL) as a general logical framework for Judgment Aggregation. Our main contribution is a generalization of Herzberg’s algebraic approach to characterization results on judgment aggregation and propositional-attitude aggregation, characterizing certain Arrovian classes of aggregators as Boolean algebra and MV-algebra homomorphisms, respectively. The characterization result of the present paper applies to agendas of formulas of an arbitrary selfextensional logic. This notion comes from AAL, and encompasses a vast class of logics, of which classical, intuitionistic, modal, many-valued and relevance logics are special cases. To each selfextensional logic \(\mathcal{S}\), a unique class of algebras \(\mathbb{A}\mathrm{lg}\mathcal{S}\) is canonically associated by the general theory of AAL. We show that for any selfextensional logic \(\mathcal{S}\) such that \(\mathbb{A}\mathrm{lg}\mathcal{S}\) is closed under direct products, any algebra in \(\mathbb{A}\mathrm{lg}\mathcal{S}\) can be taken as the set of truth values on which an aggregation problem can be formulated. In this way, judgment aggregation on agendas formalized in classical, intuitionistic, modal, many-valued and relevance logic can be uniformly captured as special cases. This paves the way to the systematic study of a wide array of “realistic agendas” made up of complex formulas, the propositional connectives of which are interpreted in ways which depart from their classical interpretation. This is particularly interesting given that, as observed by Dietrich, nonclassical (subjunctive) interpretation of logical connectives can provide a strategy for escaping impossibility results.

Large time-delay often occurs unexpectedly in data transmission via Internet. As a kind of typical non-Gaussian stochastic process cannot be described by traditional prediction models with Gaussian innovation. In this paper, FARIMA model with standard symmetrical α stable distribution is adopted to model the transmission time-delay in Internet, and the method for estimating the model parameters is presented. Numerical results show that the approach proposed in this paper is more accurate than the general FARIMA model with Gaussian innovation in modeling Internet time-delay.

Software project risk system is a nonlinear system and the chaos theory provides a new paradigm for understanding the development and evolution of its risk factors. From the angle of chaotic dynamics, this paper studies the software project risk system and based on the rational premise, builds a dynamical model of software project risk system dominated by three main parameters. According to Lyapunov exponent which can judge chaos characters, this paper calculates Lyapunov exponent of the software project risk system model, proves that this system is a chaos one and analyzes the chaos characters such as initial sensibility, inner randomness and strange attractor of this system. Therefore, it opens up a new thought for software project risk control.

A fundamental problem in wireless sensor networks is to connect a given set of sensors while minimizing the receiver interference. This is modeled as follows: each sensor node corresponds to a point in R^d and each transmission range corresponds to a ball. The receiver interference of a sensor node is defined as the number of transmission ranges it lies in. Our goal is to choose transmission radii that minimize the maximum interference while maintaining a strongly connected asymmetric communication graph. For the two-dimensional case, we show that it is NP-complete to decide whether one can achieve a receiver interference of at most 5 . In the one-dimensional case, we prove that there are optimal solutions with nontrivial structural properties. These properties can be exploited to obtain an exact algorithm that runs in quasi-polynomial time. This generalizes a result by Tan et al. to the asymmetric case.

One of the most popular models widely used in nanotribology as the basis for many investigations of frictional mechanisms on the atomic scale is the so-called Tomlinson model, consisting of a point mass driven over a periodic potential. The name “Tomlinson model” is, however, historically incorrect: The paper by Tomlinson from the year 1929 which is often cited in this context did not, in fact, contain the model known as the “Tomlinson model” and suggests, instead, an adhesive contribution to friction. In reality, it was Ludwig Prandtl who suggested this model in 1928 to describe the plastic deformation in crystals and dry friction. Staying in line with some other researchers, we call this model the “Prandtl-Tomlinson model,” although the model could simply and rightly be dubbed the “Prandtl model.” The original paper by Ludwig Prandtl was written in German and was not accessible for a long time for the largest part of the international tribological community. The present paper is a historical introduction to the English translation of the classical paper by Ludwig Prandtl, which was published in 2012. It gives a short review of the model as well as its properties, applications, and extensions from a contemporary point of view.

There are many non-contact ways for determination of flowrates in the metallurgy industry and one of those methods is Magnetohydrodynamics. The paper mainly considers the forces produced in Magnetohydrodynamics interacting with magnetic field. The aim of this paper is to make the measurement essentially independent of the fluid electrical conductivity. The flowmeter used in this study includes two coils and the forces generated by these coils are recognized in time. As a result, it is concluded that the forces produced in the coils can accurately measure the flowrate of a flow. This result can be developed to simulate the reliability and calibration parameters of the measurement.

For an elliptic curve over the rational number field and a prime number p, we study the structure of the classical Selmer group of p-power torsion points. In our previous paper Kurihara (Refined Iwasawa theory for p-adic representations and the structure of Selmer groups. Munster J Math http://www.math.keio.ac.jp/~kurihara/, to appear), assuming the main conjecture and the non-degeneracy of the p-adic height pairing, we proved that the structure of the Selmer group with respect to p-power torsion points is determined by some analytic elements \(\tilde{\delta }_{m}\) defined from modular symbols (see Theorem 1 below). In this paper, we do not assume the main conjecture nor the non-degeneracy of the p-adic height pairing, and study the structure of Selmer groups (see Theorems 3 and 4), using these analytic elements and Kolyvagin systems of Gauss sum type.

The local k-neighborhood of a vertex v in an unweighted graph G = (V,E) with vertex set V and edge set E is the subgraph induced by all vertices of distance at most k from v. The rooted k-neighborhood of v is also called a k-disk around vertex v. If a graph has maximum degree bounded by a constant d, and k is also constant, the number of isomorphism classes of k-disks is constant as well. We can describe the local structure of a bounded-degree graph G by counting the number of isomorphic copies in G of each possible k-disk. We can summarize this information in form of a vector that has an entry for each isomorphism class of k-disks. The value of the entry is the number of isomorphic copies of the corresponding k-disk in G. We call this vector frequency vector of k-disks. If we only know this vector, what does it tell us about the structure of G? In this paper we will survey a series of papers in the area of Property Testing that leads to the following result (stated informally): There is a k = k(ε,d) such that for any planar graph G its local structure (described by the frequency vector of k-disks) determines G up to insertion and deletion of at most εd n edges (and relabelling of vertices)., This project has received funding from the European Union’s Seventh Framework Programme for research, technological development and demonstration under grant agreement no. 307696.

This paper investigated the use of instantaneous frequency (IF) instead of power amplitude and power spectrum in side-channel analysis. By opposition to the constant frequency used in Fourier Transform, instantaneous frequency reflects local phase differences and allows detecting frequency variations. These variations reflect the processed binary data and are hence cryptanalytically useful. IF exploits the fact that after higher power drops more time is required to restore power back to its nominal value. Whilst our experiments reveal IF does not bring specific benefits over usual power attacks when applied to unprotected designs, IF allows to obtain much better results in the presence of amplitude modification countermeasures.

This paper proposes trajectory tracking algorithm for differential drive type of Automatic Guided Vehicle (AGV) system with the unknown wheel radii using adaptive backstepping control method. To guarantee the tracking errors go to zero, backstepping control method is proposed. By choosing appropriate Lyapunov function based on its kinematic modeling, system stability is guaranteed and a control law can be obtained. In this paper, the unknown radii of left and right wheels caused by uneven load distribution or manufacturing imperfection are considered. To solve this problem, an adaptive law is proposed to estimate the changing of wheels radii. The simulation and experimental results show that the proposed controller successfully estimates the unknown parameters and tracks the reference trajectories.

Not only the world is distributed, but more and more applications are distributed. Hence, a fundamental question is the following one: What can be computed in a distributed system? The answer to this question depends on the environment in which evolves the considered distributed system, i.e., on the assumptions the system relies on. This environment is very often left implicit and nearly always not formulated in terms of precise underlying requirements. In the extreme case where the environment is such that there is no synchrony assumption and the computing entities may commit failures, many problems become impossible to solve (in these cases, a network of Turing machines where some machines may crash, is less powerful than a single reliable Turing machine). Given a distributed computing problem, it is consequently important to know the weakest assumptions (lower bounds) that give the limits beyond which the considered distributed problem cannot be solved. This paper is a short introduction to this kind of issues. It first presents a few of elements related to distributed computability, and then briefly addresses distributed complexity issues. The style of the paper is voluntarily informal.

Since human face is often not clear in the surveillance video, this paper proposes a retrieval method on the whole body with fine-grained feature extraction. This method first extracts foreground region of human movement based on Gaussian mixed model (GMM). The human body is divided into two parts, head and below the head, based on the human morphological features and skin color. There are three parts coupled with the whole body, and then, we extract color feature for each part. Secondly, the human body is divided into front and back feature samples according to the a priori knowledge. Calculate the gap between the retrieval eigenvectors and the eigenvectors of the target body, then determine whether match. The experimental results show that this method maintains better retrieval precision when the recall rate is high. This paper target retrieve is real time on video.

Signal de-noising and extraction of useful signal feature are significant problems in the work of scientific research. Higher-order cumulants (HOC) have a strong ability of noise reduction. However, the increase in the order number of HOC will lead to the increase in computation. This will bring great difficulties to practical application. This paper introduces the knowledge of 1.5-dimensional spectrum, which results from the HOC. 1.5-dimensional spectrum is actually a simplified calculation method of HOC. It also remains the HOC’s excellent characteristic which can suppress the additive Gaussian noise. Consequently, 1.5-dimensional spectrum can be well applied in engineering practice. Meanwhile, the Hilbert transform is also introduced simply in this paper. The simulation signals and rolling failure data are processed with the 1.5-dimensional spectrum and Hilbert transform, respectively. The comparison results confirm the practical value of 1.5-dimensional spectrum.

This paper examines the impulse control of a standard Brownian motion under a long-term average criterion. In contrast with the dynamic programming approach, this paper first imbeds the stochastic control problem into an infinite-dimensional linear program over a space of measures and then reduces the problem to a simpler nonlinear optimization that has a familiar interpretation. One is able to easily identify the optimal cost and a family of optimal impulse control policies.

This paper examines the impulse control of a standard Brownian motion under a discounted criterion. In contrast with the dynamic programming approach, this paper first imbeds the stochastic control problem into an infinite-dimensional linear program over a space of measures and derives a simpler nonlinear optimization problem that has a familiar interpretation. Optimal solutions are obtained for initial positions in a restricted range. Duality theory in linear programming is then used to establish optimality for arbitrary initial positions.

CAPTCHA is a completely automated public Turing test which has been broadly adopted to enhance the website security and strengthen its attack resistance ability. The research of recognition technology of CAPTCHA has a great benefit for increasing the machine learning ability and aiding to designing high security code. The work in this paper focuses on the most difficult adhesion code in picture. At present, the traditional methods which depend heavily on segmentation will become invalid for most adhesion picture code. To resolve the problem, an integrated recognition algorithm based on mask matching is presented in this paper. The recognition of picture code is completed regardless of segmentation and noise removal beforehand. Especially, the matching degree is controlled by a fuzzy factor which can be adjusted automatically to meet with the picture code. During mask creation, two kinds of methods are provided. Finally, a series of experiments from different websites demonstrate that the algorithm can crack all kinds of picture codes and has a satisfied performance in time and popularity.