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.

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.

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.

One of the major sources of uncertainty in large-scale crop modeling is the lack of information capturing the spatiotemporal variability of crop sowing dates. Remote sensing can contribute to reducing such uncertainties by providing essential spatial and temporal information to crop models and improving the accuracy of yield predictions. However, little is known about the impacts of the differences in crop sowing dates estimated by using remote sensing (RS) and other established methods, the uncertainties introduced by the thresholds used in these methods, and the sensitivity of simulated crop yields to these uncertainties in crop sowing dates. In the present study, we performed a systematic sensitivity analysis using various scenarios. The LINTUL-5 crop model implemented in the SIMPLACE modeling platform was applied during the period 2001–2016 to simulate maize yields across four provinces in South Africa using previously defined scenarios of sowing dates. As expected, the selected methodology and the selected threshold considerably influenced the estimated sowing dates (up to 51 days) and resulted in differences in the long-term mean maize yield reaching up to 1.7 t ha−1 (48% of the mean yield) at the province level. Using RS-derived sowing date estimations resulted in a better representation of the yield variability in space and time since the use of RS information not only relies on precipitation but also captures the impacts of socioeconomic factors on the sowing decision, particularly for smallholder farmers. The model was not able to reproduce the observed yield anomalies in Free State (Pearson correlation coefficient: 0.16 to 0.23) and Mpumalanga (Pearson correlation coefficient: 0.11 to 0.18) in South Africa when using fixed and precipitation rule-based sowing date estimations. Further research with high-resolution climate and soil data and ground-based observations is required to better understand the sources of the uncertainties in RS information and to test whether the results presented herein can be generalized among crop models with different levels of complexity and across distinct field crops.

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 this paper we consider Susceptible \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rightarrow $$\end{document}→ Infectious \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rightarrow $$\end{document}→ Recovered (SIR) epidemics on random graphs with clustering. To incorporate group structure of the underlying social network, we use a generalized version of the configuration model in which each node is a member of a specified number of triangles. SIR epidemics on this type of graph have earlier been investigated under the assumption of homogeneous infectivity and also under the assumption of Poisson transmission and recovery rates. We extend known results from literature by relaxing the assumption of homogeneous infectivity both in individual infectivity and between different kinds of neighbours. An important special case of the epidemic model analysed in this paper is epidemics in continuous time with arbitrary infectious period distribution. We use branching process approximations of the spread of the disease to provide expressions for the basic reproduction number \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$R_0$$\end{document}R0, the probability of a major outbreak and the expected final size. In addition, the impact of random vaccination with a perfect vaccine on the final outcome of the epidemic is investigated. We find that, for this particular model, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$R_0$$\end{document}R0 equals the perfect vaccine-associated reproduction number. Generalizations to groups larger than three are discussed briefly.

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.

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".

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.

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.

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.

Consider the heterogeneity (e.g., heterogeneous social behaviour, heterogeneity due to different geography, contrasting contact patterns and different numbers of sexual partners etc.) of host population, in this paper, the authors propose an infection age multi-group SEIR epidemic model. The model system also incorporates the feedback variables, where the infectivity of infected individuals may depend on the infection age. In the direction of mathematical analysis of model, the basic reproduction number R0 has been computed. The global stability of disease-free equilibrium and endemic equilibrium have been established in the term of R0. More precisely, for R0 ≤ 1, the disease-free equilibrium is globally asymptotically stable and for R0 > 1, they establish global stability of endemic equilibrium using some graph theoretic techniques to Lyapunov function method. By considering a numerical example, they investigate the effects of infection age and feedback on the prevalence of the disease. Their result shows that feedback parameters have different and even opposite effects on different groups. However, by choosing an appropriate value of feedback parameters, the disease could be eradicated or maintained at endemic level. Besides, the infection age of infected individuals may also change the behaviour of the disease, global stable to damped oscillations or damped oscillations to global stable.

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 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.

In this paper, we apply the solution of the Schrodinger equation, i.e. the Schrodinger operator, to the graph characterization problem. The motivation behind this approach is two-fold. Firstly, the mathematically similar heat kernel has been used in the past for this same problem. And secondly, due to the quantum nature of the Schrodinger equation, our hypothesis is that it may be capable of providing richer sources of information. The two main features of the Schrodinger operator that we exploit in this paper are its non-ergodicity and the presence of quantum interferences due to the existence of complex amplitudes with both positive and negative components. Our proposed graph characterization approach is based on the Fourier analysis of the quantum equivalent of the heat flow trace, thus relating frequency to structure. Our experiments, performed both on synthetic and real-world data, demonstrate that this new method can be successfully applied to the characterization of different types of graph structures.

This paper treats 6j symbols or their orthonormal forms as a function of two variables spanning a square manifold which we call the “screen”. We show that this approach gives important and interesting insight. This two dimensional perspective provides the most natural extension to exhibit the role of these discrete functions as matrix elements that appear at the very foundation of the modern theory of classical discrete orthogonal polynomials. Here we present 2D and 1D recursion relations that are useful for the direct computation of the orthonormal 6j, which we name U. We present a convention for the order of the arguments of the 6j that is based on their classical and Regge symmetries, and a detailed investigation of new geometrical aspects of the 6j symbols. Specifically we compare the geometric recursion analysis of Schulten and Gordon with the methods of this paper. The 1D recursion relation, written as a matrix diagonalization problem, permits an interpretation as a discrete Shrodinger-like equations and an asymptotic analysis illustrates semiclassical and classical limits in terms of Hamiltonian evolution.

In this paper, we present a problem of candidates ranking for Master of Science studies at Faculty of Organizational Sciences, Belgrade (FOS). Current ranking model is based on weighted sum of two factors: average grade gained at undergraduate studies and number of points scored at the entrance exam for master studies. This universal model, although widespread and frequently used, is not entirely appropriate for a number of different Master of Science programs at FOS. Major problems of current model are that the model does not emphasize essential knowledge in accordance to wanted program and that the weighted sum is unable to model connection between variables. This paper presents a series of models, each more complex than the previous one, which are aggregating more relevant factor for ranking. Logical Aggregation (LA) is used as a method for the aggregation of certain variables in the last few models. LA is based on Interpolative Boolean algebra (IBA), a consistent multi-valued realization of Boolean algebra. This paper may be particularly interesting to all of those dealing with any form of students ranking, especially to university departments involved in enrolling students and selection for scholarships.

With the latitude and longitude coordinates and same place, 26 field monitoring data of Dahuofang was associated with HJ-1 satellite multispectral CCD data. This paper analyses the correlation between chlorophyll-a concentration and four bands, band combination of multispectral data. The Pearson’s correlation coefficient was calculated by MATLAB software to find band combination T1, T27, T32 which have higher Pearson coefficient and then establish the linear model with these independent variables. Due to the complex optical characteristics of the water body, the relationship between chlorophyll-a concentration and the spectrum can’t simply be described with a linear model. So in the paper we use BP neural network for modeling and prediction. The results show that BP neural network is better than the linear model and it can be used for the prediction of chlorophyll-a concentration.

For the family of non-parametric q-exponential statistical models, in a former paper, written by the same authors, a differentiable Banach manifold modelled on Lebesgue spaces of real random variables has been built. In this paper, the geometry induced on this manifold is characterized by q-divergence functionals. This geometry turns out to be a generalization of the geometry given by Fisher information metric and Levi-Civita connections. Moreover, the classical Amari’s α-connections appears as special case of the q −connections ∇ (q). The main result is the expected one, namely the zero curvature of the manifold. Loading... Geometric Science of InformationGeometric Science of Information Look Inside Chapter Metrics Downloads1K Provided by Bookmetrix Other actions Export citation About this Book Reprints and Permissions Add to Papers Share Share this content on Facebook Share this content on Twitter Share this content on LinkedIn

Surface reconstruction using patch-based multi-view stereo commonly assumes that the underlying surface is locally planar. This is typically not true so that least-squares fitting of a planar patch leads to systematic errors which are of particular importance for multi-scale surface reconstruction. In a recent paper [12], we determined the modulation transfer function of a classical patch-based stereo system. Our key insight was that the reconstructed surface is a box-filtered version of the original surface. Since the box filter is not a true low-pass filter this causes high-frequency artifacts. In this paper, we propose an extended reconstruction model by weighting the least-squares fit of the 3D patch. We show that if the weighting function meets specified criteria the reconstructed surface is the convolution of the original surface with that weighting function. A choice of particular interest is the Gaussian which is commonly used in image and signal processing but left unexploited by many multi-view stereo algorithms. Finally, we demonstrate the effects of our theoretic findings using experiments on synthetic and real-world data sets.

In this paper we present one way of modeling candlestick patterns using interpolative Boolean algebra (IBA). This method shows a degree of fulfillment for observed patterns, thus giving traders easy interpretation of by how much candlesticks fit into different patterns. Candlestick patterns have been used for financial forecasting for a couple of decades on Western markets and they have become a mainstream trader’s tool. Since the need for automated candlestick patterns discovery arose, some papers proposed fuzzy approach as a solution. Our decision to use IBA for modeling candlestick patterns comes from the fact that fuzzy logic has it limits and cannot be applied to these models. Proposed method is another approach to the same problem, but it could not be modeled using conventional fuzzy logic, because it is necessary for it to be in the Boolean frame. Results obtained from our tests are satisfactory and also open the opportunity for combining this technique with existing ones.

The paper considers the problem of pattern recognition when we have multiple data sources. We assume that for each data source there are estimated parameters of statistical distributions. The model of classification is primarily based on the Bayes rule and secondarily on the notion of interval-valued fuzzy sets. The set of possible class-conditional probability density functions is represented by an interval-valued fuzzy set. We consider the case where the uncertainty concerns the mean of Gaussian pdf. In the paper the bound on the optimal Bayess error is presented for a full probabilistic information.

In this paper we introduce and study Ishikawa’s iterative algorithm of nonexpansive mapping and averaged mappings in the setting of real Hilbert spaces. The main results presented in this paper extend the classic result of convergence of Mann’s iterative algorithm for nonexpansive mappings in the setting of Hilbert space and we prove the weak converge theorems.

This paper refers to the application of higher-order statistical signal processing techniques cumulant calculation on Gaussian noise cancellation. The performed procedure, joined to a convolution process and Fast Fourier Transform FFT application, results in the complete estimation i.e., amplitude, frequency and phase recovery of any corrupted periodic signal. Whereas tone frequency estimation is performed by 4th-order cumulant calculation, phase recovery is achieved by the convolution of the cumulant calculation and the corrupted signal. At last, the original signal amplitude is recovered by means of modification of the resulting amplitude spectrum. In this paper, higher-order statistics foundations are presented and the validation of the proposed algorithm is revealed in both theoretical and practical sense. Obtained results are highly satisfactory.

The present paper is concerned with the existence, meaning and use of the phases of the (complex) Fourier coefficients of pc-sets, viewed as maps from ℤ c to Open image in new window . It explores a particular cross-section of the most general torus of phases, representing pc-sets by the phases of the third and fifth coefficients. On this 2D torus, triads take on the well-known configuration of the Tonnetz. Some other (sequences of) chords are viewed in this space as examples of its musical relevance. The end of the paper uses the model as a convenient universe for drawing gestures – continuous paths between pc-sets.

In this paper, we provide a revised inference for correlated topic model (CTM) [3]. CTM is proposed by Blei et al. for modeling correlations among latent topics more expressively than latent Dirichlet allocation (LDA) [2] and has been attracting attention of researchers. However, we have found that the variational inference of the original paper is unstable due to almost-singularity of the covariance matrix when the number of topics is large. This means that we may be reluctant to use CTM for analyzing a large document set, which may cover a rich diversity of topics. Therefore, we revise the inference and improve its quality. First, we modify the formula for updating the covariance matrix in a manner that enables us to recover the original inference by adjusting a parameter. Second, we regularize posterior parameters for reducing a side effect caused by the formula modification. While our method is based on a heuristic intuition, an experiment conducted on large document sets showed that it worked effectively in terms of perplexity., 10th International Symposium on Neural Networks, ISNN 2013; Dalian; China; 4 July 2013 through 6 July 2013, Lecture Notes in Computer Science, 7952, pp.445-454; 2013

The paper presents a critique of the Shape Grammar paradigm viewed through the lens of the incompleteness theorem of Godel. Shape Grammars have been extensively researched through many lenses. Their productive systemic nature was the focus of the first papers along with more recent treatises in the field while their use in analysis of known building styles has been extensive and a proven mechanism for style analysis. It is surprising though that use of Shape Grammars in actual design in practice however has been minimal. The architectural community has not actively used the paradigm in the design of real buildings, probably because of the rigid analytical approach to style and rules, following from the academic analysis that the paradigm has been subjected to. However I propose that there is another underlying reason, other than the rigid approach to construct a Shape Grammar. The nature of the concurrent application and creation of the rules lies close to the incompleteness theorem of Godel, that uses a multitude of Turing Machines to prove that a from a set of True Axioms -A- we will never be able to determine if all sentences are true, without having to invent new axioms, outside the initial set -A-, thus unproven in terms of their true or false nature. Negation of this possibility drives us to the conclusion that true Design can never be feature -complete and thus can never be placed in a trusted framework that we all agree or believe it to be the complete truth.

Part 6: Shape and Structural Optimization; International audience; The paper provides shape derivative analysis for the wave equation with mixed boundary conditions on a moving domain Ωs in the case of non smooth neumann boundary datum. The key ideas in the paper are (i) bypassing the classical sensitivity analysis of the state by using parameter differentiability of a functional expressed in the form of Min-Max of a convex-concave Lagrangian with saddle point, and (ii) using a new regularity result on the solution of the wave problem (where the Dirichlet condition on the fixed part of the boundary is essential) to analyze the strong derivative.

In this paper, first of all, a four-dimensional dynamic economic system is established. First, choosing the saving rate as the bifurcation parameter, the stability and Hopf bifurcation of the system are studied. Then, a example of simulation of the model is used to prove the derived results in Sect57.2. Furthermore, a time-delayed feedback is added to the dynamic finance system. Choosing the delay as the bifurcation parameter, the local stability and the existence of Hopf bifurcation of the model with delay are researched. Stability changes and Hopf bifurcation happens while the delay passes through a critical value. We can see that increasing the delay can lead the dynamic economic system to fluctuate. Then, a numerical example is taken to confirm the theoretical results obtained in Sect.57.3. Finally, some conclusions are made. This paper has an important theoretical and practical significance.

Today, floating ring bearings are commonly used in rotors of high-speed turbochargers because of their low cost and their vibration suppressing capability. Nevertheless, and similar to conventional hydrodynamic bearings, floating ring bearings may exhibit self-excited vibrations and become unstable above the instability threshold speed. In this paper, a nonlinear dynamic model of a perfectly balanced rigid rotor supported by two identical floating ring bearings is used to determine the rotor vibration behavior. The hydrodynamic forces are modeled by applying the short bearing theory and the half Sommerfeld conditions for both fluid films. Numerical continuation is applied to determine stable or unstable limit cycles bifurcating from the equilibrium point at the Hopf bifurcation. This paper shows that the stable limit cycles undergo a single limit point bifurcation however no bifurcation is predicted for the unstable limit cycles.

The paper contributes to the development of the theory of AI-Completeness by formalizing the notion of AI-Complete, C-Complete and AI-Hard problems. The intended goal is to provide a classification of problems in the field of Artificial General Intelligence. We prove Turing Test to be an instance of an AI-Complete problem and further show certain AI problems to be AI-Complete or AI-Hard via polynomial time reductions. Finally, the paper suggests some directions for future work on the theory of AI-Completeness.

A straight line drawing of a graph is an open weak rectangle-of-influence (RI) drawing if there is no vertex in the relative interior of the axis parallel rectangle induced by the end points of each edge. Despite recent interest of the graph drawing community in rectangle-of-influence drawings, no algorithm is known to test whether a graph has a planar open weak RI-drawing. In a recent paper, we showed how to test, for inner-triangulated planar graphs, whether they have a planar open weak RI-drawing with a non-aligned frame, i.e., the graph obtained from removing the interior of every filled triangle is drawn such that no two vertices have the same coordinate. In this paper, we generalize this to all planar graphs with a fixed planar embedding, even if some interior faces are not triangles. On the other hand, we show that if the planar embedding is not fixed, then deciding if a given planar graph has an open weak RI-drawing is NP-complete. NP-completeness holds even for open weak RI-drawings with non-aligned frames.

In a previous paper we have shown that membrane systems with controlled mobility are able to solve a $\Pi_2^\mathrm{P}$ complete problem. Then, an enriched model with forced endocytosis and forced exocytosis enables us to move to the fourth level in the polynomial hierarchy, the model having $\Sigma_4^\mathrm{P} \cup \Pi_4^\mathrm{P}$ as lower bound. In this paper we study the computability power of this model (using forced endocytosis and forced exocytosis), and determine the border condition for achieving computational completeness: 4 membranes provide Turing completeness, while 3 membranes do not. Moreover, we show that the restricted division operation (which is crucial in achieving the $\Sigma_4^\mathrm{P} \cup \Pi_4^\mathrm{P}$ lower bound) does not provide computational completeness. However, Turing completeness can be achieved with pairs of operations (exocytosis, inhibitive endocytosis) and (inhibitive exocytosis, endocytosis) by using 4 membranes. Finally, we present some computability results expressing that membrane systems which use the operations of restricted division, restricted exocytosis and inhibitive endocytosis cannot yield computational completeness.

In this paper a novel three dimensions chaotic system with uncertain parameters and lorenz hyperchaotic system are as examples, the function projective synchronization and parameters identification of different hyperchaotic systems are researched. First, based on the Lyapunov theory of stability and adaptive control method, the adaptive nonlinear controller and adaptive identifying rule to uncertain parameter are designed logically. And by the controller and identifying rule, the function projective synchronization of different systems between three dimensions response system with uncertain parameter and drive system is realized. Second, the feasibility of the controller and identifying rule to uncertain parameter designed in this paper is analyzed theoretically, and the function projective synchronization and parameters identification are proved strictly theoretically. Finally, the theoretical results are verified by numerical simulation.

This paper investigates the backstepping control design with recursive feedback input approach for achieving global chaos synchronization of identical hyperchaotic Liu systems(2001). Our theorem on global chaos synchronization for hyperchaotic Liu systems is established using Lyapunov stability theory. Since the Lyapunov exponents are not required for these calculations, the backstepping control method is effective and convenient to synchronize the hyperchaotic Liu systems. Numerical simulations are also given to illustrate the synchronization results derived in this paper.

In 1951, Hopf [9] published a theorem in a seminal paper on surfaces of constant mean curvature which can be stated as follows. Let a genus zero compact surface M be immersed in \({\mathbb{R}^3}\) with constant mean curvature H. Then M is isometric to the standard sphere. Hopf gave two proofs of this result (see [9] for details).

Being the only imaging modality capable of delineating the anatomical structure of the white matter, diffusion magnetic resonance imaging (dMRI) is currently believed to provide a long-awaited means for early diagnosis of various neurological conditions as well as for interrogating the brain connectivity. Despite substantial advances in practical use of dMRI, a solid mathematical platform for modelling and treating dMRI signals still seems to be missing. Accordingly, in this paper, we show how a Hilbert space of $\mathbb{L}^2$-valued mappings $u: X \to \mathbb{L}^2({\mathbb{S}^2})$, with X being a subset of ℝ3 and $\mathbb{L}^2({\mathbb{S}^2})$ being the set of squared-integrable functions supported on the unit sphere ${\mathbb{S}^2}$, provides a natural setting for a specific example of dMRI, known as high-angular resolution diffusion imaging. The proposed formalism is also shown to provide a basis for image processing schemes such as total variation minimization. Finally, we discuss a way to amalgamate the proposed models with the tools of compressed sensing to achieve a close-to-perfect recovery of diffusion signals from a minimal number of their discrete measurements. The main outcomes of this paper are supported by a series of experimental results.

The representation and the thorough understanding of human motion is a crucial and challenging problem which has been raised in many scientific areas. This paper considers approaches in performing motion analysis with multi-resolution techniques based on rotations of joints over the time written in the form of a quaternion signal. The second generation wavelet transform constructed by the lifting scheme for the quaternion rotation representation can be used. Quaternions in terms of motion analysis are a more efficient representation of rotation than Euler angles. This paper presents the new quaternion lifting scheme building blocks for the smooth second degree transform based on the spherical cubic quaternion interpolation method (SQUAD). Also the possible applications of result multi-resolution representation as feature detection and compression are described.

Absolute stability of Lurie direct control systems with time-varying coefficients is studied in this paper. By using the method of Lyapunov functions and the decomposition techniques of large-scale systems, some absolute stability criterions of this kind of systems were obtained. The criterions, introduced in this paper, can not only be used in the direct Lurie control systems with norm-unbounded coefficients, but also can be used in the direct Lurie control systems with norm-bounded or constant coefficients. At last, two examples are given to illustrate the effectiveness of the criterions.

An abstract setting for robustly preconditioning symmetric positive definite (SPD) operators is presented. The term "robust" refers to the property of the condition numbers of the preconditioned systems being independent of mesh parameters and problem parameters. Important instances of such problem parameters are in particular (highly varying) coefficients. The method belongs to the class of additive Schwarz preconditioners. The paper gives an overview of the results obtained in a recent paper by the authors. It, furthermore, focuses on the importance of weighted Poincare inequalities, whose notion is extended to general SPD operators, for the analysis of stable decompositions. To demonstrate the applicability of the abstract preconditioner the scalar elliptic equation and the stream function formulation of Brinkman's equations in two spatial dimensions are considered. Several numerical examples are presented.