Weighted <Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript>-estimates of solutions for damped wave equations with variable coefficients

The authors establish weighted L²-estimates of solutions for the damped wave equations with variable coefficients u _tt ? divA(x)?u+au _t = 0 in ? ⁿ under the assumption a(x) ≥ a₀[1+ρ(x)]^?l, where a₀ > 0, l < 1, ρ(x) is the distance function of the metric g = A^?1(x) on ? ⁿ . The authors show that these weighted L²-estimates are closely related to the geometrical properties of the metric g = A^?1(x).     

Construction of one-Lee weight and two-Lee weight codes over F<Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> + <Emphasis Type="Italic">v</Emphasis>F<Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>

This paper is devoted to the construction of one-Lee weight codes and two-Lee weight codes over F _p + vF _p (v ² = v) with type \({p^{2{k_1}}}{p^{{k_2}}}{p^{{k_3}}}\) based on two different distance-preserving Gray maps from ((F _p + vF _p ) ⁿ , Lee weight) to (F _p ²ⁿ , Hamming weight), where p is a prime. Moreover, the authors prove that the obtained two-Lee weight codes are projective only when p = 2.     

<Emphasis Type="Italic">H</Emphasis><Subscript>∞</Subscript> control for nonlinear stochastic Markov systems with time-delay and multiplicative noise

This paper is concerned with the H_∞ control problem for a class of nonlinear stochastic Markov jump systems with time-delay and system state-, control input- and external disturbancedependent noise. Firstly, by solving a set of Hamilton-Jacobi inequalities (HJIs), the exponential mean square H_∞ controller design of delayed nonlinear stochastic Markov systems is presented. Secondly, by using fuzzy T-S model approach, the H_∞ controller can be designed via solving a set of linear matrix inequalities (LMIs) instead of HJIs. Finally, two numerical examples are provided to show the effectiveness of the proposed design methods.     

Discrete-time mean-field stochastic <Emphasis Type="Italic">H</Emphasis><Subscript>2</Subscript>/<Emphasis Type="Italic">H</Emphasis><Subscript>∞</Subscript> control

The finite horizon H ₂/H _∞ control problem of mean-field type for discrete-time systems is considered in this paper. Firstly, the authors derive a mean-field stochastic bounded real lemma (SBRL). Secondly, a sufficient condition for the solvability of discrete-time mean-field stochastic linearquadratic (LQ) optimal control is presented. Thirdly, based on SBRL and LQ results, this paper establishes a sufficient condition for the existence of discrete-time stochastic H ₂/H _∞ control of meanfield type via the solvability of coupled matrix-valued equations.     

A unified approach to construct generalized B-splines for isogeometric applications

Generalized B-splines have been employed as geometric modeling and numerical simulation tools for isogeometric analysis(IGA for short). However, the previous models used in IGA,such as trigonometric generalized B-splines or hyperbolic generalized B-splines, are not the unified mathematical representation of conics and polynomial parametric curves/surfaces. In this paper,a unified approach to construct the generalized non-uniform B-splines over the space spanned by{α(t), β(t), ξ(t), η(t), 1, t, ···, t~(n-4)} is proposed, and the corresponding isogeometric analysis framework for PDE solving is also studied. Compared with the NURBS-IGA method, the proposed frameworks have several advantages such as high accuracy, easy-to-compute derivatives and integrals due to the non-rational form. Furthermore, with the proposed spline models, isogeometric analysis can be performed on the computational domain bounded by transcendental curves/surfaces, such as the involute of circle, the helix/helicoid, the catenary/catenoid and the cycloid. Several numerical examples for isogeometric heat conduction problems are presented to show the effectiveness of the proposed methods.     

An analogue of the ℤ<Subscript>4</Subscript>-Goethals code in non-primitive length

This paper constructs a cyclic ?₄-code with a parity-check matrix similar to that of Goethals code but in length 2^m + 1, for all m ≥ 4. This code is a subcode of the lifted Zetterberg code for m even. Its minimum Lee weight is shown to be at least 10, in general, and exactly 12 in lengths 33, 65. The authors give an algebraic decoding algorithm which corrects five errors in these lengths for m = 5, 6 and four errors for m > 6.     

Partially function linear error-in-response models with validation data

This paper considers partial function linear models of the form Y =∫X(t)β(t)dt + g(T)with Y measured with error. The authors propose an estimation procedure when the basis functions are data driven, such as with functional principal components. Estimators of β(t) and g(t) with the primary data and validation data are presented and some asymptotic results are given. Finite sample properties are investigated through some simulation study and a real data application.     

An improved algorithm for solving all <Emphasis Type="Italic">d</Emphasis>-MPs in multi-state networks

Reliability is a desirable performance indicator of many real-world systems to measure the quality level. One general method for evaluating multi-state reliability is using d-minimal paths (d-MPs). However, being an NP-hard problem, searching for all d-MPs is a rather challenging task. This paper proposes an improved algorithm to solve the d-MP problem. To reduce the search space of d-MPs, a concept of lower capacity bound is introduced into the d-MP problem, and an effective technique is developed to find lower capacity bounds. Meanwhile, the fast enumeration method which is a recent improvement to the traditional enumeration method is employed to solve d-MPs. In addition, by introducing the operation of transforming undirected edges into directed edges, the proposed algorithm is applicable to solving both directed networks and undirected networks. Through numerical experiments, it is found that the proposed algorithm holds a distinct advantage over the existing methods in solving all d-MPs.     

Using Generic Structures in System Dynamics Model Building: Reflection from Modeling for Indian Shrimp Industry

The paper focused on how a system dynamics modeler could reduce model development and testing time by using “Generic Structures” as an interim benchmark between causal loop diagram and stock flow diagram. Using generic structures as a benchmark could prevent the modeler from including redundant structures to the model and getting affected by personal biases that in turn could reduce repetitive amendments to the model during model testing. Indian Shrimp Industry, during 1990–2010, sequentially showed an early growth, a hasty decline, a combative rejuvenation, and an inexorable re-decline behavior in terms of the annual shrimp production and production capacity. Average Yield continuously fluctuated throughout the Industry’s life cycle during 1990–2010. Breaking such progressive behavior into temporal units, we found that the unit behaviors resemble with the behaviors of generic structures like, exponential growth, goal-seeking, S-shaped growth, limits to success, and overshoot-and-collapse. We, using the related generic structures as the interim benchmarks, illustrated a step-by-step modeling exercise for studying the dynamic behavior of Indian Shrimp Industry during 1990–2010. The paper concluded that using generic structures as the benchmark during system dynamics modeling improved the efficiency and the effectiveness of model building due to reduction in model building and testing time.     

Effective lower bounds of wrap-around <Emphasis Type="Italic">L</Emphasis><Subscript>2</Subscript>-discrepancy on three-level combined designs

How to obtain an effective design is a major concern of scientific research. This topic always involves high-dimensional inputs with limited resources. The foldover is a quick and useful technique in construction of fractional designs, which typically releases aliased factors or interactions. This paper takes the wrap-around L₂-discrepancy as the optimality measure to assess the optimal three-level combined designs. New and efficient analytical expressions and lower bounds of the wraparound L₂-discrepancy for three-level combined designs are obtained. The new lower bound is useful and sharper than the existing lower bound. Using the new analytical expression and lower bound as the benchmarks, the authors may implement an effective algorithm for constructing optimal three-level combined designs.     

The structure of departure process and optimal control strategy <Emphasis Type="Italic">N</Emphasis>* for <Emphasis Type="Italic">Geo/G</Emphasis>/1 discrete-time queue with multiple server vacations and Min(<Emphasis Type="Italic">N,V</Emphasis>)-Policy

This paper considers the departure process and the optimal control strategy for a discretetime Geo/G/1 queueing model in which the system operates under the control of multiple server vacations and Min(N, V)-policy. Using the law of total probability decomposition, the renewal theory and the probability generating function technique, the transient and the steady-state probabilities that the server is busy at any epoch n⁺ are derived. The authors also obtain the explicit expression of the probability generating function for the expected number of departures occurring in the time interval (0⁺, n⁺] from any initial state. Meanwhile, the relationship among departure process, server’s state process and service renewal process in server busy period is found, which shows the special structure of departure process. Especially, some corresponding results of departure process for special discrete-time queues are directly gained by our results. Furthermore, the approximate expansion for calculating the expected number of departures is presented. In addition, some other important performance measures, including the expected length of server busy period, server’s actual vacation period and busy cycle period etc., are analyzed. Finally, some numerical results are provided to determine the optimum value N* for minimizing the system cost under a given cost structure.     

A New Algorithm for Computing the Extended Hensel Construction of Multivariate Polynomials

This paper presents a new algorithm for computing the extended Hensel construction(EHC) of multivariate polynomials in main variable x and sub-variables u_1, u_2, ···, u_m over a number field K. This algorithm first constructs a set by using the resultant of two initial coprime factors w.r.t. x, and then obtains the Hensel factors by comparing the coefficients of x~i on both sides of an equation. Since the Hensel factors are polynomials of the main variable with coefficients in fraction field K(u_1, u_2, ···, u_m), the computation cost of handling rational functions can be high. Therefore,the authors use a method which multiplies resultant and removes the denominators of the rational functions. Unlike previously-developed algorithms that use interpolation functions or Gr?bner basis, the algorithm relies little on polynomial division, and avoids multiplying by different factors when removing the denominators of Hensel factors. All algorithms are implemented using Magma, a computational algebra system and experiments indicate that our algorithm is more efficient.     

The determination on weight hierarchies of <Emphasis Type="Italic">q</Emphasis>-ary linear codes of dimension 5 in class IV

The weight hierarchy of a linear [n; k; q] code C over GF(q) is the sequence (d ₁, d ₂, ···, d _k ) where d _r is the smallest support of any r-dimensional subcode of C. “Determining all possible weight hierarchies of general linear codes” is a basic theoretical issue and has important scientific significance in communication system. However, it is impossible for q-ary linear codes of dimension k when q and k are slightly larger, then a reasonable formulation of the problem is modified as: “Determine almost all weight hierarchies of general q-ary linear codes of dimension k”. In this paper, based on the finite projective geometry method, the authors study q-ary linear codes of dimension 5 in class IV, and find new necessary conditions of their weight hierarchies, and classify their weight hierarchies into 6 subclasses. The authors also develop and improve the method of the subspace set, thus determine almost all weight hierarchies of 5-dimensional linear codes in class IV. It opens the way to determine the weight hierarchies of the rest two of 5-dimensional codes (classes III and VI), and break through the difficulties. Furthermore, the new necessary conditions show that original necessary conditions of the weight hierarchies of k-dimensional codes were not enough (not most tight nor best), so, it is important to excogitate further new necessary conditions for attacking and solving the k-dimensional problem.     

Strong approximation method and the (functional) law of iterated logarithm for <Emphasis Type="Italic">GI</Emphasis>/<Emphasis Type="Italic">G</Emphasis>/1 queue

In this paper, a unified method based on the strong approximation (SA) of renewal process (RP) is developed for the law of the iterated logarithm (LIL) and the functional LIL (FLIL), which quantify the magnitude of the asymptotic rate of the increasing variability around the mean value of the RP in numerical and functional forms respectively. For the GI/G/1 queue, the method provides a complete analysis for both the LIL and the FLIL limits for four performance functions: The queue length, workload, busy time and idle time processes, covering three regimes divided by the traffic intensity.     

Project regularity: Development and evaluation of a new project characteristic

The ability to accurately characterize projects is essential to good project management. Therefore, a novel project characteristic is developed that reflects the value accrue within a project. This characteristic, called project regularity, is expressed in terms of the newly introduced regular/irregular-indicator RI. The widely accepted management system of earned value management (EVM) forms the basis for evaluation of the new characteristic. More concretely, the influence of project regularity on EVM forecasting accuracy is assessed, and is shown to be significant for both time and cost forecasting. Moreover, this effect appears to be stronger than that of the widely used characteristic of project seriality expressed by the serial/parallel-indicator SP. Therefore, project regularity could also be useful as an input parameter for project network generators. Furthermore, the introduction of project regularity can provide project managers with a more accurate indication of the time and cost forecasting accuracy that is to be expected for a certain project and, correspondingly, of how a project should be built up in order to obtain more reliable forecasts during project control.     

Construction of one-gray weight codes and two-Gray weight codes over ℤ<Subscript>4</Subscript> + <Emphasis Type="Italic">u</Emphasis>ℤ<Subscript>4</Subscript>

This paper firstly gives some necessary conditions on one-Gray weight linear codes. And then we use these results to construct several classes of one-Gray weight linear codes over ?₄+u?₄(u ² = u) with type \({16^{{k_1}}}{8^{{k_2}}}{8^{{k_3}}}{4^{{k_4}}}{4^{{k_5}}}{4^{{k_6}}}{2^{{k_7}}}{2^{{k_8}}}\) based on a distance-preserving Gray map from (?₄ + u?₄) ⁿ to ? ₄ ²ⁿ . Secondly, the authors use the similar approach to do works on two-Gray (projective) weight linear codes. Finally, some examples are given to illustrate the construction methods.     

The ANOVA-type inference in linear mixed model with skew-normal error

Linear mixed effect models with skew-normal errors and distribution-free random effects are considered. The ANOVA-type F-tests are proposed to test the significance of random effects and the hypothesis on fixed effects of interest, respectively. Both tests are proved to be exact F-tests under this model, and the exact confidence interval for fixed effects of interest is derived. Simulation results are given to study the powers of ANOVA-type tests.     

Dual hesitant fuzzy information aggregation with Einstein t-conorm and t-norm

Dual hesitant fuzzy set (DHFS) is a new generalization of fuzzy set (FS) consisting of two parts (i.e., the membership hesitancy function and the non-membership hesitancy function), which confronts several different possible values indicating the epistemic degrees whether certainty or uncertainty. It encompasses fuzzy set (FS), intuitionistic fuzzy set (IFS), and hesitant fuzzy set (HFS) so that it can handle uncertain information more flexibly in the process of decision making. In this paper, we propose some new operations on dual hesitant fuzzy sets based on Einstein t-conorm and t-norm, study their properties and relationships and then give some dual hesitant fuzzy aggregation operators, which can be considered as the generalizations of some existing ones under fuzzy, intuitionistic fuzzy and hesitant fuzzy environments. Finally, a decision making algorithm under dual hesitant fuzzy environment is given based on the proposed aggregation operators and a numerical example is used to demonstrate the effectiveness of the method.     

Control and Stabilization of the Rosenau Equation Posed on a Periodic Domain

This paper considers the Rosenau equation with a moving control?t u + ?_t?_x~4 u + ?_xu + u?x u = a(x + ct)h(x, t), c = 0, x ∈ T = R/(2πZ), t 0.The authors prove that the Rosenau equation with a moving control is locally exact controllable in Hs(T) with s ≥ 0 and globally exponential stable in H~s(T) with s ≥ 2. The two results nontrivially extend the work of(Rosier L and Zhang B Y, 2013) from the BBM equation to the Rosenau equation.     

A class of constacyclic codes over ring <Emphasis Type="Italic">R</Emphasis> + <Emphasis Type="Italic">vR</Emphasis>

By constructing a Gray map, a class of constacyclic codes over ring R = R+vR is studied. Using cyclic codes and negacyclic codes of length p ^s over ring R, the structure of (1?2v)-constacyclic codes and dual codes of length p ^s over ring R are given, the Gray images of (1 ? 2v)-constacyclic codes in a particular case are also studied. It is shown that linear codes of length p ^s over ring R are (1?2v)-constacyclic codes if and only if their Gray images are distance-invariant cyclic codes of length 2p ^s over ring R.