Some types of filters in residuated lattices

In this paper, inspired by some types of $BL$ -algebra filters (deductive systems) introduced in Haveshki et al. (Soft Comput 10:657–664, 2006), Kondo and Dudek (Soft Comput 12:419–423, 2008) and Turunen (Arch Math Log 40:467–473, 2001), we defined residuated lattice versions of them and study them in connection with Van Gasse et al. (Inf Sci 180(16):3006–3020, 2010), Lianzhen and Kaitai (Inf Sci 177:5725–5738, 2007), Zhu and Xu (Inf Sci 180:3614–3632, 2010). Also we consider some relations between these filters and quotient residuated lattice that are constructed via these filters.     

Exponential stability of impulsive stochastic fuzzy cellular neural networks with mixed delays and reaction–diffusion terms

The problem of mean square exponential stability for a class of impulsive stochastic fuzzy cellular neural networks with distributed delays and reaction–diffusion terms is investigated in this paper. By using the properties of M-cone, eigenspace of the spectral radius of nonnegative matrices, Lyapunov functional, Itô’s formula and inequality techniques, several new sufficient conditions guaranteeing the mean square exponential stability of its equilibrium solution are obtained. The derived results are less conservative than the results recently presented in Wang and Xu (Chaos Solitons Fractals 42:2713–2721, 2009), Zhang and Li (Stability analysis of impulsive stochastic fuzzy cellular neural networks with time varying delays and reaction–diffusion terms. World Academy of Science, Engineering and Technology 2010), Huang (Chaos Solitons Fractals 31:658–664, 2007), and Wang (Chaos Solitons Fractals 38:878–885, 2008). In fact, the systems discussed in Wang and Xu (Chaos Solitons Fractals 42:2713–2721, 2009), Zhang and Li (Stability analysis of impulsive stochastic fuzzy cellular neural networks with time varying delays and reaction–diffusion terms. World Academy of Science, Engineering and Technology 2010), Huang (Chaos Solitons Fractals 31:658–664, 2007), and Wang (Chaos Solitons Fractals 38:878–885, 2008) are special cases of ours. Two examples are presented to illustrate the effectiveness and efficiency of the results.     

Fault Estimation for a Quad-Rotor MAV Using a Polynomial Observer

This work addresses the problem of fault detection and diagnosis (FDD) for a quad-rotor mini air vehicle (MAV). Actuator faults are considered on this paper. The basic idea behind the proposed method is to estimate the faults signals using the extended state observers theory. To estimate the faults, a polynomial observer (Aguilar et al. 2011; Mata-Machuca et al., Commun Nonlinear Sci Numer Simul 15(12):4114–4130, 2010, BioSystems 100(1):65–69, 2010) is presented by using the available measurements and know inputs of the system. In order to investigate the diagnosability properties of the system, a differential algebra approach is proposed (Cruz-Victoria et al., J Frankl Inst 345(2):102–118, 2008; and Martinez-Guerra and Diop, IEE P-Contr Theor Ap 151(1):130–135, 2004). The effectiveness of the methodology is illustrated by means of numerical simulations.     

Vibration study and classification of rotor faults in PM synchronous motor

Thanks for the precision engineering technology, motor, especially Permanent Magnet Synchronous Motor can be made as Micro-motor. However, any imprecise rotor parts of this meticulous motor could lead to undesirable vibration and acoustic noise (Yu et al. in 3D influence of unbalanced magnetic pull induced by misalignment rotor in PMSM, APMRC2012, 2012; Bi et al. in Influence of axial asymmetrical rotor in PMAC motor operation, ICEMS, 2011; Bi et al. in Influence of rotor eccentricity to unbalanced-magnetic-pull in pm synchronous motor, ICEMS06, 2006). This paper presents five types of rotor faults design and vibration study of these five types of faults in motor is conducted. Based on the vibration pattern, fuzzy mathematics is employed to classify these five types of rotor faults.     

Cross-categorization of legal concepts across boundaries of legal systems: in consideration of inferential links

This work contrasts Giovanni Sartor’s view of inferential semantics of legal concepts (Sartor in Artif Intell Law 17:217–251, 2009) with a probabilistic model of theory formation (Kemp et al. in Cognition 114:165–196, 2010). The work further explores possibilities of implementing Kemp’s probabilistic model of theory formation in the context of mapping legal concepts between two individual legal systems. For implementing the legal concept mapping, we propose a cross-categorization approach that combines three mathematical models: the Bayesian Model of Generalization (BMG; Tenenbaum and Griffiths in Behav Brain Sci 4:629–640, 2001), the probabilistic model of theory formation, i.e., the Infinite Relational Model (IRM) first introduced by Kemp et al. (The twenty-first national conference on artificial intelligence, 2006, Cognition 114:165–196, 2010) and its extended model, i.e., the normal-IRM (n-IRM) proposed by Herlau et al. (IEEE International Workshop on Machine Learning for Signal Processing, 2012). We apply our cross-categorization approach to datasets where legal concepts related to educational systems are respectively defined by the Japanese- and the Danish authorities according to the International Standard Classification of Education. The main contribution of this work is the proposal of a conceptual framework of the cross-categorization approach that, inspired by Sartor (Artif Intell Law 17:217–251, 2009), attempts to explain reasoner’s inferential mechanisms.     

Algebraic flux correction for nonconforming finite element discretizations of scalar transport problems

This paper is concerned with the extension of the algebraic flux-correction (AFC) approach (Kuzmin in Computational fluid and solid mechanics, Elsevier, Amsterdam, pp 887–888, 2001; J Comput Phys 219:513–531, 2006; Comput Appl Math 218:79–87, 2008; J Comput Phys 228:2517–2534, 2009; Flux-corrected transport: principles, algorithms, and applications, 2nd edn. Springer, Berlin, pp 145–192, 2012; J Comput Appl Math 236:2317–2337, 2012; Kuzmin et al. in Comput Methods Appl Mech Eng 193:4915–4946, 2004; Int J Numer Methods Fluids 42:265–295, 2003; Kuzmin and Möller in Flux-corrected transport: principles, algorithms, and applications. Springer, Berlin, 2005; Kuzmin and Turek in J Comput Phys 175:525–558, 2002; J Comput Phys 198:131–158, 2004) to nonconforming finite element methods for the linear transport equation. Accurate nonoscillatory approximations to convection-dominated flows are obtained by stabilizing the continuous Galerkin method by solution-dependent artificial diffusion. Its magnitude is controlled by a flux limiter. This concept dates back to flux-corrected transport schemes. The unique feature of AFC is that all information is extracted from the system matrices which are manipulated to satisfy certain mathematical constraints. AFC schemes have been devised with conforming $P_1$ and $Q_1$ finite elements in mind but this is not a prerequisite. Here, we consider their extension to the nonconforming Crouzeix–Raviart element (Crouzeix and Raviart in RAIRO R3 7:33–76, 1973) on triangular meshes and its quadrilateral counterpart, the class of rotated bilinear Rannacher–Turek elements (Rannacher and Turek in Numer Methods PDEs 8:97–111, 1992). The underlying design principles of AFC schemes are shown to hold for (some variant of) both elements. However, numerical tests for a purely convective flow and a convection–diffusion problem demonstrate that flux-corrected solutions are overdiffusive for the Crouzeix–Raviart element. Good resolution of smooth and discontinuous profiles is attested to $Q_1^\mathrm{nc}$ approximations on quadrilateral meshes. A synthetic benchmark is used to quantify the artificial diffusion present in conforming and nonconforming high-resolution schemes of AFC-type. Finally, the implementation of efficient sparse matrix–vector multiplications is addressed.     

Hermitian Compact Interpolation on the Cubed-Sphere Grid

The cubed-sphere grid is a spherical grid made of six quasi-cartesian square-like patches. It was originally introduced in Sadourny (Mon Weather Rev 100:136–144, 1972). We extend to this grid the design of high-order finite-difference compact operators (Collatz, The numerical treatment of differential equations. Springer, Berlin, 1960; Lele, J Comput Phys 103:16–42, 1992). The present work is limitated to the design of a fourth-order accurate spherical gradient. The treatment at the interface of the six patches relies on a specific interpolation system which is based on using great circles in an essential way. The main interest of the approach is a fully symmetric treatment of the sphere. We numerically demonstrate the accuracy of the approximate gradient on several test problems, including the cosine-bell test-case of Williamson et al. (J Comput Phys 102:211–224, 1992) and a deformational test-case reported in Nair and Lauritzen (J Comput Phys 229:8868–8887, 2010).     

A Comparison of Iterated Optimal Stopping and Local Policy Iteration for American Options Under Regime Switching

A theoretical analysis tool, iterated optimal stopping, has been used as the basis of a numerical algorithm for American options under regime switching (Le and Wang in SIAM J Control Optim 48(8):5193–5213, 2010). Similar methods have also been proposed for American options under jump diffusion (Bayraktar and Xing in Math Methods Oper Res 70:505–525, 2009) and Asian options under jump diffusion (Bayraktar and Xing in Math Fin 21(1):117–143, 2011). An alternative method, local policy iteration, has been suggested in Huang et al. (SIAM J Sci Comput 33(5):2144–2168, 2011), and Salmi and Toivanen (Appl Numer Math 61:821–831, 2011). Worst case upper bounds on the convergence rates of these two methods suggest that local policy iteration should be preferred over iterated optimal stopping (Huang et al. in SIAM J Sci Comput 33(5):2144–2168, 2011). In this article, numerical tests are presented which indicate that the observed performance of these two methods is consistent with the worst case upper bounds. In addition, while these two methods seem quite different, we show that either one can be converted into the other by a simple rearrangement of two loops.     

An Efficient Algorithm for ℓ 0 Minimization in Wavelet Frame Based Image Restoration

Wavelet frame based models for image restoration have been extensively studied for the past decade (Chan et al. in SIAM J. Sci. Comput. 24(4):1408–1432, 2003; Cai et al. in Multiscale Model. Simul. 8(2):337–369, 2009; Elad et al. in Appl. Comput. Harmon. Anal. 19(3):340–358, 2005; Starck et al. in IEEE Trans. Image Process. 14(10):1570–1582, 2005; Shen in Proceedings of the international congress of mathematicians, vol. 4, pp. 2834–2863, 2010; Dong and Shen in IAS lecture notes series, Summer program on “The mathematics of image processing”, Park City Mathematics Institute, 2010). The success of wavelet frames in image restoration is mainly due to their capability of sparsely approximating piecewise smooth functions like images. Most of the wavelet frame based models designed in the past are based on the penalization of the ? ₁ norm of wavelet frame coefficients, which, under certain conditions, is the right choice, as supported by theories of compressed sensing (Candes et al. in Appl. Comput. Harmon. Anal., 2010; Candes et al. in IEEE Trans. Inf. Theory 52(2):489–509, 2006; Donoho in IEEE Trans. Inf. Theory 52:1289–1306, 2006). However, the assumptions of compressed sensing may not be satisfied in practice (e.g. for image deblurring and CT image reconstruction). Recently in Zhang et al. (UCLA CAM Report, vol. 11-32, 2011), the authors propose to penalize the ? ₀ “norm” of the wavelet frame coefficients instead, and they have demonstrated significant improvements of their method over some commonly used ? ₁ minimization models in terms of quality of the recovered images. In this paper, we propose a new algorithm, called the mean doubly augmented Lagrangian (MDAL) method, for ? ₀ minimizations based on the classical doubly augmented Lagrangian (DAL) method (Rockafellar in Math. Oper. Res. 97–116, 1976). Our numerical experiments show that the proposed MDAL method is not only more efficient than the method proposed by Zhang et al. (UCLA CAM Report, vol. 11-32, 2011), but can also generate recovered images with even higher quality. This study reassures the feasibility of using the ? ₀ “norm” for image restoration problems.     

Simulation studies of contact sensor for disk defect mapping

The keep increasing areal density in hard disk drive demands reducing the clearance between the read/write element and the disk surface. A clearance of 2 nm could be achieved using thermal-flying-height technology (Kurita et al. IEEE Trans Magn 41(5):3007–3009, 2005). In such a low-clearance flying regime, it is important to ensure the reliability of the head-disk interface. Head carbon overcoat wear should be taken into account and it requires ultra-smooth disk surface. Conventional method for disk inspection is using glide tester (Nayak et al. IEEE Trans Magn 39(2):729–734, 2003). However, with lower and lower clearance, some small defects on the disk surface can no longer be neglected, and these small defects cannot be detected by glide test. Thus a thermal-contact sensor integrated in a magnetic-head slider was proposed by Shimizu et.al to detect defects on disk surface (Shimizu et al. IEEE Trans Magn 47(10):3426–3432, 2011). Their experimental results confirmed that the contact sensor has equivalent sensitivity for detecting head-disk contact to that of a conventional acoustic emission sensor. And the defect mapping with this method was more sensitive than measurements with an optical surface analyzer. All these results were obtained using experimental method. Thus, numerical simulation studies are necessary in order to investigate the contact mechanics between asperities and the contact sensor. In this paper, a simplified contact model was developed to study contact mechanics between contact sensor and the disk asperity using finite element method. Different parameters’ effect on the signal of a contact sensor was investigated. These results are of significance for the development of a thermal contact sensor in the hard disk drive for higher recording density.     

A linear system form solution to compute the local space average color

In this document, we present an alternative to the method introduced by Ebner (Pattern Recognit 60–67, 2003; J Parallel Distrib Comput 64(1):79–88, 2004; Color constancy using local color shifts, pp 276–287, 2004; Color Constancy, 2007; Mach Vis Appl 20(5):283–301, 2009) for computing the local space average color. We show that when the problem is framed as a linear system and the resulting series is solved, there is a solution based on LU decomposition that reduces the computing time by at least an order of magnitude.     

On Rewriting Rules in Mizar

This paper presents some tentative experiments in using a special case of rewriting rules in Mizar (Mizar homepage: http://www.mizar.org/): rewriting a term as its subterm. A similar technique, but based on another Mizar mechanism called functor identification (Korni?owicz 2009) was used by Caminati, in his paper on basic first-order model theory in Mizar (Caminati, J Form Reason 3(1):49–77, 2010, Form Math 19(3):157–169, 2011). However for this purpose he was obligated to introduce some artificial functors. The mechanism presented in the present paper looks promising and fits the Mizar paradigm.     

On sunflowers and matrix multiplication

We present several variants of the sunflower conjecture of Erd?s & Rado (J Lond Math Soc 35:85–90, 1960) and discuss the relations among them. We then show that two of these conjectures (if true) imply negative answers to the questions of Coppersmith & Winograd (J Symb Comput 9:251–280, 1990) and Cohn et al. (2005) regarding possible approaches for obtaining fast matrix-multiplication algorithms. Specifically, we show that the Erd?s–Rado sunflower conjecture (if true) implies a negative answer to the “no three disjoint equivoluminous subsets” question of Coppersmith & Winograd (J Symb Comput 9:251–280, 1990); we also formulate a “multicolored” sunflower conjecture in ${\mathbb{Z}_3^n}$ and show that (if true) it implies a negative answer to the “strong USP” conjecture of Cohn et al. (2005) (although it does not seem to impact a second conjecture in Cohn et al. (2005) or the viability of the general group-theoretic approach). A surprising consequence of our results is that the Coppersmith–Winograd conjecture actually implies the Cohn et al. conjecture. The multicolored sunflower conjecture in ${\mathbb{Z}_3^n}$ is a strengthening of the well-known (ordinary) sunflower conjecture in ${\mathbb{Z}_3^n}$ , and we show via our connection that a construction from Cohn et al. (2005) yields a lower bound of (2.51 . . .) ⁿ on the size of the largest multicolored 3-sunflower-free set, which beats the current best-known lower bound of (2.21 . . . ) ⁿ Edel (2004) on the size of the largest 3-sunflower-free set in ${\mathbb{Z}_3^n}$ .     

Analytic expressions of quantum correlations in qutrit Werner states

Quantum correlations in qutrit Werner states are extensively investigated with five popular methods, namely, original quantum discord (OQD) (Ollivier and Zurek in Phys Rev Lett 88:017901, 2001), measurement-induced disturbance (MID) (Luo in Phys Rev A 77:022301, 2008), ameliorated MID (AMID) (Girolami et al. in J Phys A Math Theor 44:352002, 2011), relative entropy (RE) (Modi et al. in Phys Rev Lett 104:080501, 2010) and geometric discord (GD) (Daki? et al. in Phys Rev Lett 105:190502, 2010). Two different analytic expressions of quantum correlations are derived. Quantum correlations captured by the former four methods are same and bigger than those obtained via the GD method. Nonetheless, they all qualitatively characterize quantum correlations in the concerned states. Moreover, as same as the qubit case, there exist quantum correlations in separable qutrit Werner states, too.     

Toward more localized local algorithms: removing assumptions concerning global knowledge

Numerous sophisticated local algorithm were suggested in the literature for various fundamental problems. Notable examples are the MIS and $(\Delta +1)$ -coloring algorithms by Barenboim and Elkin (Distrib Comput 22(5–6):363–379, 2010), by Kuhn (2009), and by Panconesi and Srinivasan (J Algorithms 20(2):356–374, 1996), as well as the $O\mathopen {}(\Delta ^2)$ -coloring algorithm by Linial (J Comput 21:193, 1992). Unfortunately, most known local algorithms (including, in particular, the aforementioned algorithms) are non-uniform, that is, local algorithms generally use good estimations of one or more global parameters of the network, e.g., the maximum degree $\Delta $ or the number of nodes $n$ . This paper provides a method for transforming a non-uniform local algorithm into a uniform one. Furthermore, the resulting algorithm enjoys the same asymptotic running time as the original non-uniform algorithm. Our method applies to a wide family of both deterministic and randomized algorithms. Specifically, it applies to almost all state of the art non-uniform algorithms for MIS and Maximal Matching, as well as to many results concerning the coloring problem (In particular, it applies to all aforementioned algorithms). To obtain our transformations we introduce a new distributed tool called pruning algorithms, which we believe may be of independent interest.     

Estimating the Long-Memory Parameter in Nonstationary Processes Using Wavelets

In this article, we propose two new semiparametric estimators in the wavelet domain in order to estimate the parameter of nonstationary long memory models. Compared to the Fourier transform, the advantage of the wavelet approach to analyze the behavior of nonstationary time series is that it can localize a process simultaneously in time and scale. We thus develop a Wavelet Exact Local Whittle estimator and a Wavelet Feasible Exact Local Whittle estimator, which extend the estimators of Phillips and Shimotsu (Ann Stat 32(2):656–692, 2004), Shimotsu and Phillips (Ann Stat 33(4):1890–1933, 2005; J Econom 130:209–233, 2006) and Shimotsu (Econom Theory 26(2):501–540, 2010) into the wavelet domain. Simulation experiments show that the new estimators perform better under most situations in the stationary and nonstationary cases. We also applied these two new semiparametric estimators to some financial series (daily stock market indices and exchange rates).     

Principal tests and verification of a resonance-based solar harvester utilizing micro/nano technology

The authors propose an analysis of a model solar element based on the principle of a resonance system facilitating the transformation of the external form of incident energy into electrical energy. A similar principle provides the basis for harvesters designed to operate at lower frequencies, (Jirku et al. Microsyst Technol 16:677–690, 2010; Wen et al. In: Proceedings of World Automation Congress, Maui, 2000). In these harvesters, the efficiency of the energy form transformation can be controlled from the frequency spectrum of an external source.     

Insensitizing exact controls for the scalar wave equation and exact controllability of 2-coupled cascade systems of PDE’s by a single control

We study the exact controllability, by a reduced number of controls, of coupled cascade systems of PDE’s and the existence of exact insensitizing controls for the scalar wave equation. We give a necessary and sufficient condition for the observability of abstract-coupled cascade hyperbolic systems by a single observation, the observation operator being either bounded or unbounded. Our proof extends the two-level energy method introduced in Alabau-Boussouira (Siam J Control Opt 42:871–906, 2003) and Alabau-Boussouira and Léautaud (J Math Pures Appl 99:544–576, 2013) for symmetric coupled systems, to cascade systems which are examples of non-symmetric coupled systems. In particular, we prove the observability of two coupled wave equations in cascade if the observation and coupling regions both satisfy the Geometric Control Condition (GCC) of Bardos et al. (SIAM J Control Opt 30:1024–1065, 1992). By duality, this solves the exact controllability, by a single control, of $2$ -coupled abstract cascade hyperbolic systems. Using transmutation, we give null-controllability results for the multidimensional heat and Schrödinger $2$ -coupled cascade systems under GCC and for any positive time. By our method, we can treat cases where the control and coupling coefficients have disjoint supports, partially solving an open question raised by de Teresa (CPDE 25:39–72, 2000). Moreover we answer the question of the existence of exact insensitizing locally distributed as well as boundary controls of scalar multidimensional wave equations, raised by Lions (Actas del Congreso de Ecuaciones Diferenciales y Aplicaciones (CEDYA), Universidad de Málaga, pp 43–54, 1989) and later on by Dáger (Siam J Control Opt 45:1758–1768, 2006) and Tebou (C R Acad Sci Paris 346(Sér I):407–412, 2008).     

Comparison Between Reduced Basis and Stochastic Collocation Methods for Elliptic Problems

The stochastic collocation method (Babu?ka et al. in SIAM J Numer Anal 45(3):1005–1034, 2007; Nobile et al. in SIAM J Numer Anal 46(5):2411–2442, 2008a; SIAM J Numer Anal 46(5):2309–2345, 2008b; Xiu and Hesthaven in SIAM J Sci Comput 27(3):1118–1139, 2005) has recently been applied to stochastic problems that can be transformed into parametric systems. Meanwhile, the reduced basis method (Maday et al. in Comptes Rendus Mathematique 335(3):289–294, 2002; Patera and Rozza in Reduced basis approximation and a posteriori error estimation for parametrized partial differential equations Version 1.0. Copyright MIT, http://augustine.mit.edu, 2007; Rozza et al. in Arch Comput Methods Eng 15(3):229–275, 2008), primarily developed for solving parametric systems, has been recently used to deal with stochastic problems (Boyaval et al. in Comput Methods Appl Mech Eng 198(41–44):3187–3206, 2009; Arch Comput Methods Eng 17:435–454, 2010). In this work, we aim at comparing the performance of the two methods when applied to the solution of linear stochastic elliptic problems. Two important comparison criteria are considered: (1), convergence results of the approximation error; (2), computational costs for both offline construction and online evaluation. Numerical experiments are performed for problems from low dimensions $O(1)$ to moderate dimensions $O(10)$ and to high dimensions $O(100)$ . The main result stemming from our comparison is that the reduced basis method converges better in theory and faster in practice than the stochastic collocation method for smooth problems, and is more suitable for large scale and high dimensional stochastic problems when considering computational costs.