Search

The repeated replacement method (RRM) is a Lagrangian meshfree method which we have previously applied to the Euler equations for compressible fluid flow. In this paper we present new enhancements to RRM, and we apply the enhanced method to both linear and nonlinear elasticity. We compare the results of ten test problems to those of analytic solvers, to demonstrate that RRM can successfully simulate these elastic systems without many of the requirements of traditional numerical methods such as numerical derivatives, equation system solvers, or Riemann solvers. We also show the relationship between error and computational effort for RRM on these systems, and compare RRM to other methods to highlight its strengths and weaknesses. And to further explain the two elastic equations used in the paper, we demonstrate the mathematical procedure used to create Riemann and Sedov-Taylor solvers for them, and detail the numerical techniques needed to embody those solvers in code. [ABSTRACT FROM AUTHOR]

We describe in this paper the experimental procedure, the data treatment and the quantification of the black body correction: an experimental approach to compensate for scattering and systematic biases in quantitative neutron imaging based on experimental data. The correction algorithm is based on two steps; estimation of the scattering component and correction using an enhanced normalization formula. The method incorporates correction terms into the image normalization procedure, which usually only includes open beam and dark current images (open beam correction). Our aim is to show its efficiency and reproducibility: we detail the data treatment procedures and quantitatively investigate the effect of the correction. Its implementation is included within the open source CT reconstruction software MuhRec. The performance of the proposed algorithm is demonstrated using simulated and experimental CT datasets acquired at the ICON and NEUTRA beamlines at the Paul Scherrer Institut. [ABSTRACT FROM AUTHOR]

Sparse spectral clustering (SSC) has become one of the most popular clustering approaches in recent years. However, its high computational complexity prevents its application to large-scale datasets such as hyperspectral images (HSIs). In this paper, we propose two efficient approximate sparse spectral clustering methods for HSIs clustering in which clustering performance is improved by utilizing local information among the data. Firstly, we construct a smaller representative dataset on which sparse spectral clustering is performed. Then the labels of ground object are extending to whole dataset based on the local information according to two extending strategies. The first one is that the local interpolation is utilized to improve the extension of the clustering result. The other one is that the label extension is turned to a problem of subspace embedding, and is fulfilled by locally linear embedding (LLE). Several experiments on HSIs demonstrated that the proposed algorithms are effective for HSIs clustering. [ABSTRACT FROM AUTHOR]

This paper examines the application of a bootstrap test error estimation of radial basis functions, specifically thin-plate spline fitting, in surface smoothing. The presence of noisy data is a common issue of the point set model that is generated from 3D scanning devices, and hence, point set denoising is one of the main concerns in point set modelling. Bootstrap test error estimation, which is applied when searching for the smoothing parameters of radial basis functions, is revisited. The main contribution of this paper is a smoothing algorithm that relies on a bootstrap-based radial basis function. The proposed method incorporates a k-nearest neighbour search and then projects the point set to the approximated thin-plate spline surface. Therefore, the denoising process is achieved, and the features are well preserved. A comparison of the proposed method with other smoothing methods is also carried out in this study. [ABSTRACT FROM AUTHOR]

Motion capture allows accurate recording of human motion, with applications in many fields, including entertainment, medicine, sports science and human computer interaction. A common difficulty with this technology is the occurrence of missing data, due to occlusions, or recording conditions. Various models have been proposed to estimate missing data. Some are based on interpolation, low-rank properties or inter-correlations. Others involve dataset matching or skeleton constraints. While the latter have the advantage of promoting a realistic motion estimation, they require prior knowledge of skeleton constraints, or the availability of a prerecorded dataset. In this article, we propose a probabilistic averaging method of several recovery models (referred to as Probabilistic Model Averaging (PMA) in this paper), based on the likelihoods of the distances between body points. This method has the advantage of being automatic, while allowing an efficient gap data recovery. To support and validate the proposed method, we use a set of four individual recovery models, based on linear/nonlinear regression in local coordinate systems. Finally, we propose two heuristic algorithms to enforce skeleton constraints in the reconstructed motion, which can be used on any individual recovery model. For validation purposes, random gaps were introduced into motion-capture sequences, and the effects of factors such as the number of simultaneous gaps, gap length and sequence duration were analyzed. Results show that the proposed probabilistic averaging method yields better recovery than (i) each of the four individual models and (ii) two recent state-of-the-art models, regardless of gap length, sequence duration and number of simultaneous gaps. Moreover, both of our heuristic skeleton-constraint algorithms significantly improve the recovery for 7 out of 8 tested motion-capture sequences (p < 0.05), for 10 simultaneous gaps of 5 seconds. The code is available for free download at: . [ABSTRACT FROM AUTHOR]

The power system always has several variations in its profile due to random load changes or environmental effects such as device switching effects when generating further transients. Thus, an accurate mathematical model is important because most system parameters vary with time. Curve modeling of power generation is a significant tool for evaluating system performance, monitoring and forecasting. Several numerical techniques compete to fit the curves of empirical data such as wind, solar, and demand power rates. This paper proposes a new modified methodology presented as a parametric technique to determine the system’s modeling equations based on the Bode plot equations and the vector fitting (VF) algorithm by fitting the experimental data points. The modification is derived from the familiar VF algorithm as a robust numerical method. This development increases the application range of the VF algorithm for modeling not only in the frequency domain but also for all power curves. Four case studies are addressed and compared with several common methods. From the minimal RMSE, the results show clear improvements in data fitting over other methods. The most powerful features of this method is the ability to model irregular or randomly shaped data and to be applied to any algorithms that estimating models using frequency-domain data to provide state-space or transfer function for the model. [ABSTRACT FROM AUTHOR]

An understanding of how individuals shape and impact the evolution of society is vastly limited due to the unavailability of large-scale reliable datasets that can simultaneously capture information regarding individual movements and social interactions. We believe that the popular Indian film industry, “Bollywood”, can provide a social network apt for such a study. Bollywood provides massive amounts of real, unbiased data that spans more than 100 years, and hence this network has been used as a model for the present paper. The nodes which maintain a moderate degree or widely cooperate with the other nodes of the network tend to be more fit (measured as the success of the node in the industry) in comparison to the other nodes. The analysis carried forth in the current work, using a conjoined framework of complex network theory and random matrix theory, aims to quantify the elements that determine the fitness of an individual node and the factors that contribute to the robustness of a network. The authors of this paper believe that the method of study used in the current paper can be extended to study various other industries and organizations. [ABSTRACT FROM AUTHOR]

Delay represents a significant phenomenon in the dynamics of many human-related systems—including biological ones. It has i.a. a decisive impact on system stability, and the study of this influence is often mathematically demanding. This paper presents a computationally simple numerical gridding algorithm for the determination of stability margin delay values in multiple-delay linear systems. The characteristic quasi-polynomial—the roots of which decide about stability—is subjected to iterative discretization by means of pre-warped bilinear transformation. Then, a linear and a quadratic interpolation are applied to obtain the associated characteristic polynomial with integer powers. The roots of the associated characteristic polynomial are closely related to the estimation of roots of the original characteristic quasi-polynomial which agrees with the system′s eigenvalues. Since the stability border is crossed by the leading one, the switching root locus is enhanced using the Regula Falsi interpolation method. Our methodology is implemented on—and verified by—a numerical bio-cybernetic example of the stabilization of a human-being′s movement on a controlled swaying bow. The advantage of the proposed novel algorithm lies in the possibility of the rapid computation of polynomial zeros by means of standard programs for technical computing; in the low level of mathematical knowledge required; and, in the sufficiently high precision of the roots loci estimation. The relationship to the direct search QuasiPolynomial (mapping) Rootfinder algorithm and computational complexity are discussed as well. This algorithm is also applicable for systems with non-commensurate delays. [ABSTRACT FROM AUTHOR]

A fast and robust interpolation filter based on finite difference TPS has been proposed in this paper. The proposed method employs discrete cosine transform to efficiently solve the linear system of TPS equations in case of gridded data, and by a pre-defined weight function with respect to simulation residuals to reduce the effect of outliers and misclassified non-ground points on the accuracy of reference ground surface construction. Fifteen groups of benchmark datasets, provided by the International Society for Photogrammetry and Remote Sensing (ISPRS) commission, were employed to compare the performance of the proposed method with that of the multi-resolution hierarchical classification method (MHC). Results indicate that with respect to kappa coefficient and total error, the proposed method is averagely more accurate than MHC. Specifically, the proposed method is 1.03 and 1.32 times as accurate as MHC in terms of kappa coefficient and total errors. More importantly, the proposed method is averagely more than 8 times faster than MHC. In comparison with some recently developed methods, the proposed algorithm also achieves a good performance. [ABSTRACT FROM AUTHOR]

In peer-to-peer networks, application relays have been commonly used to provide various networking services. The service performance often improves significantly if a relay is selected appropriately based on its network location. In this paper, we studied the location-aware relay discovery and selection problem for large-scale P2P streaming networks. In these large-scale and dynamic overlays, it incurs significant communication and computation cost to discover a sufficiently large relay candidate set and further to select one relay with good performance. The network location can be measured directly or indirectly with the tradeoffs between timeliness, overhead and accuracy. Based on a measurement study and the associated error analysis, we demonstrate that indirect measurements, such as King and Internet Coordinate Systems (ICS), can only achieve a coarse estimation of peers’ network location and those methods based on pure indirect measurements cannot lead to a good relay selection. We also demonstrate that there exists significant error amplification of the commonly used “best-out-of-K” selection methodology using three RTT data sets publicly available. We propose a two-phase approach to achieve efficient relay discovery and accurate relay selection. Indirect measurements are used to narrow down a small number of high-quality relay candidates and the final relay selection is refined based on direct probing. This two-phase approach enjoys an efficient implementation using the Distributed-Hash-Table (DHT). When the DHT is constructed, the node keys carry the location information and they are generated scalably using indirect measurements, such as the ICS coordinates. The relay discovery is achieved efficiently utilizing the DHT-based search. We evaluated various aspects of this DHT-based approach, including the DHT indexing procedure, key generation under peer churn and message costs. [ABSTRACT FROM AUTHOR]

This paper presents an approach to describing the three dimensional shape of a violin plate in mathematical form. The shape description begins with standard contour lines and ends with an equation for a surface in three dimensional space. The traditional specification of cross sectional arching is unnecessary. Advantages of this approach are that it employs simple and universal description of plate geometry and yields a complete, smoothed, precise mathematical equation of the plate that is suitable for modern three dimensional production. It is quite general and suitable for both exterior and interior plate surfaces, yielding the ability to control thicknesses along with shape. This method can produce mathematical descriptions with tolerances easily less than 0.001 millimeters suitable for modern computerized numerical control carving and hand finishing. [ABSTRACT FROM AUTHOR]

The Small Exponent Test (SET) for exponentiation is an essential batch-verification technique that is widely applied. In this paper, we propose a simplified SET that can securely batch-verify n instances with only n − 1 randomizing exponents. We show that the structure of the proposed batch test is compact in the sense that it works with a minimal number of randomizing exponents for the SET. Thus, our test offers various advantages. Overall, compared to the original SET, the proposed simplified SET is more efficient for any sized batch instance. In particular, unlike the SET, our proposal performs well even when the size of a batch instance is small, e.g., n = 1 , 2 , 3 , and 4. This feature can be also used to significantly reduce pairing computations in a signature scheme where several pairing equations are verified. In addition, our test can be combined easily and generically with existing batch techniques such as the use of sparse exponents, the bucket test for large batch sizes, or an automated tool to generate a batch algorithm. Finally, with our simplified test, an efficient identification algorithm can be constructed to discover incorrect instances in a batch. [ABSTRACT FROM AUTHOR]

In a general (k, n) scalable secret image sharing (SSIS) scheme, the secret image is shared by n participants and any k or more than k participants have the ability to reconstruct it. The scalability means that the amount of information in the reconstructed image scales in proportion to the number of the participants. In most existing SSIS schemes, the size of each image shadow is relatively large and the dealer does not has a flexible control strategy to adjust it to meet the demand of differen applications. Besides, almost all existing SSIS schemes are not applicable under noise circumstances. To address these deficiencies, in this paper we present a novel SSIS scheme based on a brand-new technique, called compressed sensing, which has been widely used in many fields such as image processing, wireless communication and medical imaging. Our scheme has the property of flexibility, which means that the dealer can achieve a compromise between the size of each shadow and the quality of the reconstructed image. In addition, our scheme has many other advantages, including smooth scalability, noise-resilient capability, and high security. The experimental results and the comparison with similar works demonstrate the feasibility and superiority of our scheme. [ABSTRACT FROM AUTHOR]

Anonymity, which is more and more important to multi-receiver schemes, has been taken into consideration by many researchers recently. To protect the receiver anonymity, in 2010, the first multi-receiver scheme based on the Lagrange interpolating polynomial was proposed. To ensure the sender’s anonymity, the concept of the ring signature was proposed in 2005, but afterwards, this scheme was proven to has some weakness and at the same time, a completely anonymous multi-receiver signcryption scheme is proposed. In this completely anonymous scheme, the sender anonymity is achieved by improving the ring signature, and the receiver anonymity is achieved by also using the Lagrange interpolating polynomial. Unfortunately, the Lagrange interpolation method was proven a failure to protect the anonymity of receivers, because each authorized receiver could judge whether anyone else is authorized or not. Therefore, the completely anonymous multi-receiver signcryption mentioned above can only protect the sender anonymity. In this paper, we propose a new completely anonymous multi-receiver signcryption scheme with a new polynomial technology used to replace the Lagrange interpolating polynomial, which can mix the identity information of receivers to save it as a ciphertext element and prevent the authorized receivers from verifying others. With the receiver anonymity, the proposed scheme also owns the anonymity of the sender at the same time. Meanwhile, the decryption fairness and public verification are also provided. [ABSTRACT FROM AUTHOR]

This paper introduces the Fuzzy Logic Hypercube Interpolator (FLHI) and demonstrates applications in control of multiple-input single-output (MISO) and multiple-input multiple-output (MIMO) processes with Hammerstein nonlinearities. FLHI consists of a Takagi-Sugeno fuzzy inference system where membership functions act as kernel functions of an interpolator. Conjunction of membership functions in an unitary hypercube space enables multivariable interpolation of N-dimensions. Membership functions act as interpolation kernels, such that choice of membership functions determines interpolation characteristics, allowing FLHI to behave as a nearest-neighbor, linear, cubic, spline or Lanczos interpolator, to name a few. The proposed interpolator is presented as a solution to the modeling problem of static nonlinearities since it is capable of modeling both a function and its inverse function. Three study cases from literature are presented, a single-input single-output (SISO) system, a MISO and a MIMO system. Good results are obtained regarding performance metrics such as set-point tracking, control variation and robustness. Results demonstrate applicability of the proposed method in modeling Hammerstein nonlinearities and their inverse functions for implementation of an output compensator with Model Based Predictive Control (MBPC), in particular Dynamic Matrix Control (DMC). [ABSTRACT FROM AUTHOR]

This paper studies the nonlinear bending and vibration problems of functionally graded tubes with temperature-dependent material properties based on a refined beam model. The tubes are exposed to a uniform distributed temperature field and are placed on elastic foundation. The refined beam model for tubes can satisfy the stress boundary conditions on inner and outer surfaces. The governing equations of nonlinear bending and vibration for the functionally graded tubes are derived by using Hamilton's principle and are solved by introducing a two-step perturbation technique. Some comparisons for bending and vibration are presented to valid the correctness of present beam model and solution method. In numerical results, the effects of transverse shear deformation, the volume fraction, inner radius and elastic foundation stiffness as well as the temperature on the natural frequency, amplitude–frequency responses and nonlinear bending responses are discussed. [ABSTRACT FROM AUTHOR]

Abstract: This paper investigates the problem of chaos and hyper-chaos control, and proposes a simple adaptive feedback control method for chaos control under a reasonable assumption. In comparison with previous methods, the present control technique is simple both in the form of the controller and its application. Several illustrative examples with numerical simulations are studied by using the results obtained in this paper. Study of examples shows that our control method works very well in chaos control. [Copyright &y& Elsevier]

Abstract: One of the particularities of information encoded as DNA strands is that a string u contains basically the same information as its Watson–Crick complement, denoted here as . Thus, any expression consisting of repetitions of u and can be considered in some sense periodic. In this paper, we give a generalization of Lyndon and Schützenberger’s classical result about equations of the form , to cases where both sides involve repetitions of words as well as their complements. Our main results show that, for such extended equations, if , then all three words involved can be expressed in terms of a common word t and its complement . Moreover, if , then is an optimal bound. These results are established based on a complete characterization of all possible overlaps between two expressions that involve only some word u and its complement , which is also obtained in this paper. [Copyright &y& Elsevier]

In a 1966 paper by C.A.B. Smith, the short and long conjunctive sums of games are defined and methods are described for determining the theoretical winner of a game constructed using one type of these sums. In this paper, we develop a method for determining the winner of a game constructed using arbitrary combinations of these sums. [ABSTRACT FROM AUTHOR]

Some preconditioners for accelerating the classical iterative methods are given in Zhang et al. [Y. Zhang and T.Z. Huang, A class of optimal preconditioners and their applications, Proceedings of the Seventh International Conference on Matrix Theory and Its Applications in China, 2006. Y. Zhang, T.Z. Huang, and X.P. Liu, Modified iterative methods for nonnegative matrices and M-matrices linear systems, Comput. Math. Appl. 50 (2005), pp. 1587-1602. Y. Zhang, T.Z. Huang, X.P. Liu, A class of preconditioners based on the (I+S(α))-type preconditioning matrices for solving linear systems, Appl. Math. Comp. 189 (2007), pp. 1737-1748]. Another kind of preconditioners approximating the inverse of a symmetric positive definite matrix was given in Simons and Yao [G. Simons, Y. Yao, Approximating the inverse of a symmetric positive definite matrix, Linear Algebra Appl. 281 (1998), pp. 97-103]. Zhang et al. 's preconditioners and Simons and Yao's are generalized in this paper. These preconditioners are all of low construction cost, which all could be taken as approximate inverse of M-matrices. Numerical experiments of these preconditioners applied with Krylov subspace methods show the effectiveness and performance, which also show that the preconditioners proposed in this paper are better approximate inverse for M-matrices than Simons'. [ABSTRACT FROM AUTHOR]

In this paper we are interested in the global existence and large time behavior of solutions to the initial- boundary value problem for sub critical nonlinear dissipative equations (Multiple line equation(s) cannot be represented in ASCII text) where the nonlinear term N(u, ux) depends on the unknown function u and its derivative ux and satisfy the estimate (Multiple line equation(s) cannot be represented in ASCII text)The linear operator IK(u) is defined as follows (Multiple line equation(s) cannot be represented in ASCII text) where the constants an, am ϵ R, n, m are integers, m > n. The aim of this paper is to prove the global existence of solutions to the initial-boundary value Problem (1). We find the main term of the asymptotic representation of solutions in sub critical case, when the nonlinear term of equation has the time decay rate less then that of the linear terms. Also we give some general approach to obtain global existence of solution of initial-boundary value problem in sub critical case and elaborate general sufficient conditions to obtain asymptotic expansion of solution. [ABSTRACT FROM AUTHOR]

In a paper by J. V. Pereira and the author it was proved that any pencil of plane curves of degree $d>1$ with irreducible generic fiber can have at most five completely reducible fibers although no examples with five such fibers had ever been found. Recently Janis Stipins has proved that if a pencil has a base of $d^2$ points, then it cannot have five completely reducible fibers. In this paper we generalize Stipins' result to arbitrary pencils. We also include into consideration more general special fibers that are the unions of lines and non-reduced curves. These fibers are important for characteristic varieties of hyperplane complements. [ABSTRACT FROM AUTHOR]

We show how to prescribe the initial data of a characteristic problem satisfying the constraints, the smallness, the regularity and the asymptotic decay suitable to prove a global existence result. In this paper, the first of two, we show in detail the construction of the initial data and give a sketch of the existence result. This proof, which mimicks the analogous one for the non-characteristic problem in [19], will be the content of a subsequent paper. [ABSTRACT FROM AUTHOR]

The paper deals with homogenization of Navier–Stokes-type system describing electrorheological fluid with random characteristics. Under non-standard growth conditions we construct the homogenized model and prove the convergence result. The structure of the limit equations is also studied. [ABSTRACT FROM AUTHOR]

In a queueing system with the dropping function the arriving customer can be denied service (dropped) with the probability that is a function of the queue length at the time of arrival of this customer. The potential applicability of such mechanism is very wide due to the fact that by choosing the shape of this function one can easily manipulate several performance characteristics of the queueing system. In this paper we carry out analysis of the queueing system with the dropping function and a very general model of arrival process—the model which includes batch arrivals and the interarrival time autocorrelation, and allows for fitting the actual shape of the interarrival time distribution and its moments. For such a system we obtain formulas for the distribution of the queue length and the overall customer loss ratio. The analytical results are accompanied with numerical examples computed for several dropping functions. [ABSTRACT FROM AUTHOR]

This paper deals with the solvability of interval matrix equations in max-plus algebra. Max-plus algebra is the algebraic structure in which classical addition and multiplication are replaced by ⊕ and ⊗, where a ⊕ b = max ⁡ { a , b } and a ⊗ b = a + b . The notation A ⊗ X ⊗ C = B represents an interval max-plus matrix equation, where A , B , and C are given interval matrices. We define four types of solvability of interval max-plus matrix equations, i.e., the tolerance, weak tolerance, left-weak tolerance, and right-weak tolerance solvability. We derive the necessary and sufficient conditions for checking each of them, whereby all can be verified in polynomial time. [ABSTRACT FROM AUTHOR]

Tensor computation is intensive and difficult. Invariably, a vital component is the truncation of tensors, so as to control the memory and associated computational requirements. Various tensor toolboxes have been designed for such a purpose, in addition to transforming tensors between different formats. In this paper, we propose a simple Q-less QR truncation technique for tensors { x ( i ) } with x ( i ) ∈ R n 1 × ⋯ × n d in the simple and natural Kronecker product form. It generalizes the QR decomposition with column pivoting, adapting the well-known Gram–Schmidt orthogonalization process. The main difficulty lies in the fact that linear combinations of tensors cannot be computed or stored explicitly. All computations have to be performed on the coefficients α i in an arbitrary tensor v = ∑ i α i x ( i ) . The orthonormal Q factor in the QR decomposition X ≡ [ x ( 1 ) , ⋯ , x ( p ) ] = Q R cannot be computed but expressed as X R − 1 when required. The resulting algorithm has an O ( p 2 d n ) computational complexity, with n = max ⁡ n i . Some illustrative examples in the numerical solution of tensor linear equations are presented. [ABSTRACT FROM AUTHOR]

In the present paper, we investigate stability of solutions of Hamilton-Jacobi-Bellman equations under state constraints by studying stability of value functions of a suitable family of Bolza optimal control problems under state constraints. The stability is guaranteed by the classical assumptions imposed on Hamiltonians and an inward-pointing condition on state constraints. [ABSTRACT FROM AUTHOR]

In this paper, we obtain some new Lyapunov-type inequalities for a class of even-order linear differential equations, the results are new and generalize and improve some early results in this field. [ABSTRACT FROM AUTHOR]

Finding the solution of the absolute value equation (AVE) A x − | x | = b has attracted much attention in recent years. In this paper, we propose a relaxed nonlinear PHSS-like iterative method, which is more efficient than the Picard-HSS iterative method for the AVE, and is a generalization of the nonlinear HSS-like iteration method for the AVE. By using the theory of nonsmooth analysis, we prove the convergence of the relaxed nonlinear PHSS-like iterative method for the AVE. Numerical experiments are given to demonstrate the feasibility, robustness and effectiveness of the relaxed nonlinear HSS-like method. [ABSTRACT FROM AUTHOR]

In this paper, a randomized numerical approach is used to obtain approximate solutions for a class of nonlinear Fredholm integral equations of the second kind. The proposed approach contains two steps: at first, we define a discretized form of the integral equation by quadrature formula methods and solution of this discretized form converges to the exact solution of the integral equation by considering some conditions on the kernel of the integral equation. And then we convert the problem to an optimal control problem by introducing an artificial control function. Following that, in the next step, solution of the discretized form is approximated by a kind of Monte Carlo (MC) random search algorithm. Finally, some examples are given to show the efficiency of the proposed approach. [ABSTRACT FROM AUTHOR]

The goal of the Dynamic Buchberger Algorithm is to compute a Gröbner basis quickly by adjusting the term ordering as the computation proceeds. A known problem concerns the size and number of linear progams to be solved when refining the ordering. This paper describes two methods for reducing both their size and number. [ABSTRACT FROM AUTHOR]

In this paper, we present a new two-step iterative method for solving nonlinear equation. The method is based on a new quadrature rules. The convergence analysis of the method is discussed. Numerical tests show that the method can give better results than the Newton method and can be applied in some cases where the Newton method fails to give desired results. [ABSTRACT FROM PUBLISHER]

Abstract: Mixed-level designs have become widely used in the practical experiments. When the levels of some factors are difficult to be changed or controlled, fractional factorial split-plot (FFSP) designs are often used. It is highly to know when a mixed-level FFSP design with resolution III or IV has clear effects. This paper investigates the conditions of a resolution III or IV FFSP design with both two-level and four-level factors to have various clear factorial effects, including two types of main effects and three types of two-factor interaction components. The structures of such designs are shown and illustrated with examples. [Copyright &y& Elsevier]

The aim of this paper is to characterize the formal power series which have purely periodic β-expansions in Pisot or Salem unit base under some condition. Furthermore, we will prove that if β is a quadratic Pisot unit base, then every rational f in the unit disk has a purely periodic β-expansion and discuss their periods. [ABSTRACT FROM AUTHOR]

In the present paper we generalize the concept of groups with triality and apply it to the theory of the Moufang, Bol and Bruck loops. Such generalizations allow us to reduce certain problems from the loop theory to problems in the theory of groups. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we introduce the notion of intuitionistic -fuzzy subalgebras in -algebras and study their fundamental properties. We get a fuzzy subalgebra from an intuitionistic -fuzzy subalgebra. Also the notion of intuitionistic -fuzzy (closed) filters of -algebras is introduced. We investigate the relationship between intuitionistic -fuzzy subalgebras and intuitionistic -fuzzy (closed) filters of -algebras. [Copyright &y& Elsevier]

The purpose of this paper is to explicitly describe in terms of generators and relations the universal central extension of the infinite dimensional Lie algebra, $ \mathfrak{g}\otimes \mathbb{C}[t,t^{-1},u\vert u^2=(t^2-b^2)(t^2-c^2)]$ [ABSTRACT FROM AUTHOR]

Abstract: In this paper we give a method for peturbation of solutions of linear homogeneous differential equation of the second order. [Copyright &y& Elsevier]

Abstract: In this paper, we give necessary and sufficient conditions for generalized solution and periodicity of the difference equation with -periodic coefficients, where , . Also, we obtain that the generalized solution is periodic with -period. [Copyright &y& Elsevier]

The purpose of this paper is to give a new generalization of the operator-valued Poisson kernel and discuss its some applications. [ABSTRACT FROM AUTHOR]

Abstract: A uniparametric family of three-step eighth-order multipoint iterative methods requiring only a first derivative are proposed in this paper to find simple roots of nonlinear equations. Development and convergence analysis on the proposed methods is described along with numerical experiments including comparison with existing methods. [Copyright &y& Elsevier]

Abstract: This paper is concern analytic solutions of an iterative functional equation of the formByconstructing a convergent power series solution of an auxiliary equationanalytic solutions of the original equation are obtained. We discuss not only these α appeared in the auxiliary equation at the hyperbolic case 0<∣α∣≠1 and resonance, i.e., at a root of the unity, but also those α near resonance (i.e., near a root of the unity) under Brjuno condition. [Copyright &y& Elsevier]

Abstract: In [Z.Wei, S. Yao, L. Liu, The convergence properties of some new conjugate gradient methods, Applied Mathematics and Computation 183 (2006) 1341–1350], Wei et al. proposed a new conjugate gradient method called WYL method which has good numerical experiments and some excellent properties such as . In this paper, we prove that while , the sufficient descent condition can be satisfied at each iteration of the WYL method. Based on this, the global convergence of the WYL method with the standard Armijo line search and the generalized Wolfe–Powell line search is established. [Copyright &y& Elsevier]

Abstract: This paper studies the Zakharov equation with power law nonlinearity. An exact 1-soliton solution is obtained by the ansatz method. The parameter regimes are identified in the process. The numerical simulation is also given to complete the study. [Copyright &y& Elsevier]

Abstract: In this paper, we are concerned with the oscillation of second order superlinear differential equations of the formA new oscillation criterion is established under quite general assumptions. Our results are based on the information on a sequence of subintervals of [t 0,∞) only, rather than on the whole half-line. Our methodology is somewhat different from that of previous authors . Our results generalize and extend some earlier results of Yu and Lu and Meng . An example is also given to illustrate the results. [Copyright &y& Elsevier]