Search

Vehicles are often caught in dilemma zone when they approach signalized intersections in yellow interval. The existence of dilemma zone which is significantly influenced by driver behavior seriously affects the efficiency and safety of intersections. This paper proposes the driver behavior models in yellow interval by logistic regression and fuzzy decision tree modeling, respectively, based on camera image data. Vehicle’s speed and distance to stop line are considered in logistic regression model, which also brings in a dummy variable to describe installation of countdown timer display. Fuzzy decision tree model is generated by FID3 algorithm whose heuristic information is fuzzy information entropy based on membership functions. This paper concludes that fuzzy decision tree is more accurate to describe driver behavior at signalized intersection than logistic regression model.

The nearest neighbor is one of the most popular classifiers, and it has been successfully used in pattern recognition and machine learning. One drawback ofkNN is that it performs poorly when class distributions are overlapping. Recently, local probability center (LPC) algorithm is proposed to solve this problem; its main idea is giving weight to samples according to their posterior probability. However, LPC performs poorly when the value ofkis very small and the higher-dimensional datasets are used. To deal with this problem, this paper suggests that the gradient of the posterior probability function can be estimated under sufficient assumption. The theoretic property is beneficial to faithfully calculate the inner product of two vectors. To increase the performance in high-dimensional datasets, the multidimensional Parzen window and Euler-Richardson method are utilized, and a new classifier based on local probability centers is developed in this paper. Experimental results show that the proposed method yields stable performance with a wide range ofkfor usage, robust performance to overlapping issue, and good performance to dimensionality. The proposed theorem can be applied to mathematical problems and other applications. Furthermore, the proposed method is an attractive classifier because of its simplicity.

This paper is devoted to the average consensus problems in directed networks of agents with unknown control direction. In this paper, by using Nussbaum function techniques and Laplacian matrix, novel average consensus protocols are designed for multiagent systems with unknown control direction in the cases of directed networks with fixed and switching topology. In the case of switching topology, the disagreement vector is utilized. Finally, simulation is provided to demonstrate the effectiveness of our results.

This paper investigates the exponential synchronization problem of stochastic complex dynamical networks with impulsive perturbation and Markovian switching. The complex dynamical networks consist ofκmodes, and the networks switch from one mode to another according to a Markovian chain with known transition probability. Based on the Lyapunov function method and stochastic analysis, by employingM-matrix approach, some sufficient conditions are presented to ensure the exponential synchronization of stochastic complex dynamical networks with impulsive perturbation and Markovian switching, and the upper bound of impulsive gain is evaluated. At the end of this paper, two numerical examples are included to show the effectiveness of our results.

This technical paper deals with the problem of stochastic stability and stabilization for a class of linear Markovian jumping systems with discrete time-varying delay. A novel delay-dependent stochastic stability criterion for Markovian delay systems is established based on new augmented Lyapunov-Krasovskii functional and delay fractioning techniques. Then a state feedback controller is designed to guarantee the stochastic stability of the resulting closed-loop system. Numerical examples are provided to illustrate the effectiveness of the proposed design approach in this paper.

The one-dimensional continuous genetic algorithm (CGA) previously developed by the principal author is extended and enhanced to deal with two-dimensional spaces in this paper. The enhanced CGA converts the partial differential equations into algebraic equations by replacing the derivatives appearing in the differential equation with their proper finite difference formula in 2D spaces. This optimization methodology is then applied for the solution of steady-state two-dimensional Stokes and nonlinear Navier Stokes problems. The main advantage of using CGA for the solution of partial differential equations is that the algorithm can be applied to linear and nonlinear equations without any modification in its structure. A comparison between the results obtained using the 2D CGA and the known Galerkin finite element method using COMSOL is presented in this paper. The results showed that CGA has an excellent accuracy as compared to other numerical solvers.

Multiobjective programming problems have been widely applied to various engineering areas which include optimal design of an automotive engine, economics, and military strategies. In this paper, we propose a noninterior path following algorithm to solve a class of multiobjective programming problems. Under suitable conditions, a smooth path will be proven to exist. This can give a constructive proof of the existence of solutions and lead to an implementable globally convergent algorithm. Several numerical examples are given to illustrate the results of this paper.

For nonlinear discrete-time stochastic systems, a fuzzy controller design methodology is developed in this paper subject to state variance constraint and passivity constraint. According to fuzzy model based control technique, the nonlinear discrete-time stochastic systems considered in this paper are represented by the discrete-time Takagi-Sugeno fuzzy models with multiplicative noise. Employing Lyapunov stability theory, upper bound covariance control theory, and passivity theory, some sufficient conditions are derived to find parallel distributed compensation based fuzzy controllers. In order to solve these sufficient conditions, an iterative linear matrix inequality algorithm is applied based on the linear matrix inequality technique. Finally, the fuzzy stabilization problem for nonlinear discrete ship steering stochastic systems is investigated in the numerical example to illustrate the feasibility and validity of proposed fuzzy controller design method.

This paper presents two methods for dual-rate sampled-data nonlinear output-error systems. One method is the missing output estimation based stochastic gradient identification algorithm and the other method is the auxiliary model based stochastic gradient identification algorithm. Different from the polynomial transformation based identification methods, the two methods in this paper can estimate the unknown parameters directly. A numerical example is provided to confirm the effectiveness of the proposed methods.

Spheroid disturbance of input data brings great challenges to support vector regression; thus it is essential to study the robust regression model. This paper is dedicated to establish a robust regression model which makes the regression function robust against disturbance of data and system parameter. Firstly, two theorems have been given to show that the robust linearε-support vector regression problem could be settled by solving the dual problems. Secondly, it has been focused on the development of robust support vector regression algorithm which is extended from linear domain to nonlinear domain. Finally, the numerical experiments result demonstrates the effectiveness of the models and algorithms proposed in this paper.

This paper considers controller parameterization method ofH∞control for polynomial Hamiltonian systems (PHSs), which involves internal stability and external disturbance attenuation. The aims of this paper are to design a controller with parameters to insure that the systems areH∞stable and propose an algorithm for solving parameters of the controller with symbolic computation. The proposed parameterization method avoids solving Hamilton-Jacobi-Isaacs equations, and thus the obtained controllers with parameters are relatively simple in form and easy in operation. Simulation with a numerical example shows that the controller is effective as it can optimizeH∞control by adjusting parameters. All these results are expected to be of use in the study ofH∞control for nonlinear systems with perturbations.

By simplifying tolerance problem and treating faulty voltages on different test points as independent variables, integer-coded table technique is proposed to simplify the test point selection process. Usually, simplifying tolerance problem may induce a wrong solution while the independence assumption will result in over conservative result. To address these problems, the tolerance problem is thoroughly considered in this paper, and dependency relationship between different test points is considered at the same time. A heuristic graph search method is proposed to facilitate the test point selection process. First, the information theoretic concept of entropy is used to evaluate the optimality of test point. The entropy is calculated by using the ambiguous sets and faulty voltage distribution, determined by component tolerance. Second, the selected optimal test point is used to expand current graph node by using dependence relationship between the test point and graph node. Simulated results indicate that the proposed method more accurately finds the optimal set of test points than other methods; therefore, it is a good solution to minimize the size of the test point set. To simplify and clarify the proposed method, only catastrophic and some specific parametric faults are discussed in this paper.

The dissipative delay-feedback control problems for nonlinear stochastic delay systems (NSDSs) based on dissipativity analysis are studied in this paper. Based on the Lyapunov stability theory and stochastic analysis technique, both delay-independent and delay-dependent dissipativity criteria are established as linear matrix inequalities- (LMIs-) based feasibility tests. The obtained results in this paper for the nominal systems include the available results onH∞approach and passivity for stochastic delay systems as special cases. The delay-dependent feedback controller is designed by considering the relationship among the time-varying delay, its lower and upper bound, and its differential without ignoring any terms, which effectively reduces the conservative. A numerical example is given to illustrate the theoretical developments.

This paper researched three definitions of Gauss map and found that the definition of “Gauss map” in the paper of Arasomwan and Adewumi may be incoherent with other publications. In addition, we analyzed the difference of continuous Gauss map and the floating-point Gauss map, and we pointed out that the floating-point simulation behaved significantly differently from the continuous Gauss map.

This paper is concerned with the problem of the robustH∞filtering for the Takagi-Sugeno (T-S) fuzzy stochastic systems with bounded parameter uncertainties. For a given T-S fuzzy stochastic system, this paper focuses on the stochastically mean-square stability of the filtering error system and theH∞performance level of the output error and the disturbance input. The design method for delay-dependent filter is developed based on linear matrix inequalities. Finally, the effectiveness of the proposed methods is substantiated with an illustrative example.

Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2013/930927 Open Access This paper studies the problem of H∞ finite-impulse response (FIR) filtering design of time-delay system. The time-delay considered here is time-varying meanwhile with a certain stochastic characteristic, and the probability of delay distribution is assumed to be known. Furthermore, the requirement of pulse-shape is also considered in filter design. Employing the information about the size and probability distribution of delay, a delay-probability-distribution-dependent criterion is proposed for the filtering error system. Based on a Lyapunov-Krasovskii functional, a set of linear matrix inequalities (LMIs) are formulated to solve the problem. At last, a numerical example is used to demonstrate the effectiveness of the filter design approach proposed in the paper.

We propose a novel online manifold regularization framework based on the notion of duality in constrained optimization. The Fenchel conjugate of hinge functions is a key to transfer manifold regularization from offline to online in this paper. Our algorithms are derived by gradient ascent in the dual function. For practical purpose, we propose two buffering strategies and two sparse approximations to reduce the computational complexity. Detailed experiments verify the utility of our approaches. An important conclusion is that our online MR algorithms can handle the settings where the target hypothesis is not fixed but drifts with the sequence of examples. We also recap and draw connections to earlier works. This paper paves a way to the design and analysis of online manifold regularization algorithms.

This paper presents a fault diagnosis algorithm to estimate the fault for a class of linear discrete systems based on an adaptive fault estimation observer. And observer gain matrix and adaptive adjusting rule of the fault estimator are designed. Furthermore, the adaptive regulating algorithm can guarantee the first-order difference of a Lyapunov discrete function to be negative, so that the observer is ensured to be stable and fault estimation errors are convergent. Finally, simulation results of an aircraft F-16 illustrate the advantages of the theoretic results that are obtained in this paper.

This paper discusses spectral method with the tensor-product nodal basis at the Legendre-Gauss-Lobatto points for solving the Steklov eigenvalue problem. A priori error estimates of spectral method are discussed, and based on the work of Melenk and Wohlmuth (2001), a posterior error estimator of the residual type is given and analyzed. In addition, this paper combines the shifted-inverse iterative method and spectral method to establish an efficient scheme. Finally, numerical experiments with MATLAB program are reported.

The paper presents the theoretical part of a method for identifying constitutive parameters involved in the modified Oyane ductile fracture criterion at high temperature. Quite a general rigid viscoplastic model is adopted to describe material behavior. The ductile fracture criterion is in general path-dependent and involves stresses. Therefore, the identification of constitutive parameters of this criterion is a difficult task which usually includes experimental research and numerical simulation. The latter requires a precisely specified material model and boundary conditions. It is shown in the present paper that for a wide class of material models usually used to describe the behavior of materials at high temperatures, the criterion is significantly simplified when the site of fracture initiation is located on traction free surfaces. In particular, this reduced criterion does not involve stresses. Since there are well established experimental procedures to determine the input data for the reduced criterion, the result obtained can be considered as a theoretical basis for the efficient method for identifying constitutive parameters of the modified Oyane ductile fracture criterion at high temperature. The final expression can also be used in computational models to increase the accuracy of predictions.

This paper studies the stabilization problem for a class of unified chaotic systems subject to uncertainties and input nonlinearity. Based on the sliding mode control theory, we present a new method for the sliding mode controller design and the control law algorithm for such systems. In order to achieve the goal of stabilization unified chaotic systems, the presented controller can make the movement starting from any point in the state space reach the sliding mode in limited time and asymptotically reach the origin along the switching surface. Compared with the existing literature, the controller designed in this paper has many advantages, such as small chattering, good stability, and less conservative. The analysis of the motion equation and the simulation results all demonstrate that the method is effective.

This paper solves control problems of agents achieving consensus motions in presence of nonuniform time delays by obtaining the maximal tolerable delay value. Two types of consensus motions are considered: the rectilinear motion and the rotational motion. Unlike former results, this paper has remarkably reduced conservativeness of the consensus conditions provided in such form: for each system, if all the nonuniform time delays are bounded by the maximal tolerable delay value which is referred to as “delay margin,” the system will achieve consensus motion; otherwise, if all the delays exceed the delay margin, the system will be unstable. When discussing the system which is intended to achieve rotational consensus motion, an expanded system whose state variables are real numbers (those of the original system are complex numbers) is introduced, and corresponding consensus condition is given also in the form of delay margin. Numerical examples are provided to illustrate the results.

In the machine learning based on kernel tricks, people often put one variable of a kernel function on the given samples to produce the basic functions of a solution space of learning problem. If the collection of the given samples deviates from the data distribution, the solution space spanned by these basic functions will also deviate from the real solution space of learning problem. In this paper a multikernel-like learning algorithm based on data probability distribution (MKDPD) is proposed, in which the parameters of a kernel function are locally adjusted according to the data probability distribution, and thus produces different kernel functions. These different kernel functions will generate different Reproducing Kernel Hilbert Spaces (RKHS). The direct sum of the subspaces of these RKHS constitutes the solution space of learning problem. Furthermore, based on the proposed MKDPD algorithm, a new algorithm for labeling new coming data is proposed, in which the basic functions are retrained according to the new coming data, while the coefficients of the retrained basic functions remained unchanged to label the new coming data. The experimental results presented in this paper show the effectiveness of the proposed algorithms.

This paper studies the stability problem of a grey neutral stochastic system with distributed delays. The main feature of a grey system is that the parameters of system are evaluated by grey numbers, and system has the strong background in engineering applications. However, the literature dealing with the stability problem for grey system seems to be scarce. The main aim of this paper is to fill the gap. Based on the Lyapunov stability theorem and Itô’s formula, especially, using the decomposition technique of the continuous matrix-covered sets of grey matrix, we propose several novel sufficient conditions, which ensure our considered grey system in mean-square exponential stability and almost surely exponential stability. Furthermore, two examples are provided to show the effectiveness of the obtained results.

With the rapid development and application of CRFs (Conditional Random Fields) in computer vision, many researchers have made some outstanding progress in this domain because CRFs solve the classical version of the label bias problem with respect to MEMMs (maximum entropy Markov models) and HMMs (hidden Markov models). This paper reviews the research development and status of object recognition with CRFs and especially introduces two main discrete optimization methods for image labeling with CRFs: graph cut and mean field approximation. This paper describes graph cut briefly while it introduces mean field approximation more detailedly which has a substantial speed of inference and is researched popularly in recent years.

In order to improve the effects of denoising, this paper introduces the basic principles of wavelet threshold denoising and traditional structures threshold functions. Meanwhile, it proposes wavelet threshold function and fixed threshold formula which are both improved here. First, this paper studies the problems existing in the traditional wavelet threshold functions and introduces the adjustment factors to construct the new threshold function basis on soft threshold function. Then, it studies the fixed threshold and introduces the logarithmic function of layer number of wavelet decomposition to design the new fixed threshold formula. Finally, this paper uses hard threshold, soft threshold, Garrote threshold, and improved threshold function to denoise different signals. And the paper also calculates signal-to-noise (SNR) and mean square errors (MSE) of the hard threshold functions, soft thresholding functions, Garrote threshold functions, and the improved threshold function after denoising. Theoretical analysis and experimental results showed that the proposed approach could improve soft threshold functions with constant deviation and hard threshold with discontinuous function problems. The proposed approach could improve the different decomposition scales that adopt the same threshold value to deal with the noise problems, also effectively filter the noise in the signals, and improve the SNR and reduce the MSE of output signals.

In this paper, an improved NSGA2 algorithm is proposed, which is used to solve the multiobjective problem. For the original NSGA2 algorithm, the paper made one improvement: joining the local search strategy into the NSGA2 algorithm. After each iteration calculation of the NSGA2 algorithm, a kind of local search strategy is performed in the Pareto optimal set to search better solutions, such that the NSGA2 algorithm can gain a better local search ability which is helpful to the optimization process. Finally, the proposed modified NSGA2 algorithm (MNSGA2) is simulated in the two classic multiobjective problems which is called KUR problem and ZDT3 problem. The calculation results show the modified NSGA2 outperforms the original NSGA2, which indicates that the improvement strategy is helpful to improve the algorithm.

Single-objection function cannot describe the characteristics of the complicated hydrologic system. Consequently, it stands to reason that multiobjective functions are needed for calibration of hydrologic model. The multiobjective algorithms based on the theory of nondominate are employed to solve this multiobjective optimal problem. In this paper, a novel multiobjective optimization method based on differential evolution with adaptive Cauchy mutation and Chaos searching (MODE-CMCS) is proposed to optimize the daily streamflow forecasting model. Besides, to enhance the diversity performance of Pareto solutions, a more precise crowd distance assigner is presented in this paper. Furthermore, the traditional generalized spread metric (SP) is sensitive with the size of Pareto set. A novel diversity performance metric, which is independent of Pareto set size, is put forward in this research. The efficacy of the new algorithm MODE-CMCS is compared with the nondominated sorting genetic algorithm II (NSGA-II) on a daily streamflow forecasting model based on support vector machine (SVM). The results verify that the performance of MODE-CMCS is superior to the NSGA-II for automatic calibration of hydrologic model.

In the field of decision-making, for the multiple attribute decision-making problem with the partially unknown attribute weights, the evaluation information in the form of the intuitionistic fuzzy numbers, and the preference on alternatives, this paper proposes a comprehensive decision model based on the intuitionistic fuzzy cross entropy distance and the grey correlation analysis. The creative model can make up the deficiency that the traditional intuitionistic fuzzy distance measure is easy to cause the confusion of information and can improve the accuracy of distance measure; meanwhile, the grey correlation analysis method, suitable for the small sample and the poor information decision-making, is applied in the evaluation. This paper constructs a mathematical optimization model of maximizing the synthesis grey correlation coefficient between decision-making evaluation values and decision-makers’ subjective preference values, calculates the attribute weights with the known partial weight information, and then sorts the alternatives by the grey correlation coefficient values. Taking venture capital firm as an example, through the calculation and the variable disturbance, we can see that the methodology used in this paper has good stability and rationality. This research makes the decision-making process more scientific and further improves the theory of intuitionistic fuzzy multiple attribute decision-making.

Bhaskar and Lakshmikantham (2006) showed the existence of coupled coincidence points of a mappingFfromX×XintoXand a mappinggfromXintoXwith some applications. The aim of this paper is to extend the results of Bhaskar and Lakshmikantham and improve the recent fixed-point theorems due to Bessem Samet (2010). Indeed, we introduce the definition of generalizedg-Meir-Keeler type contractions and prove some coupled fixed point theorems under a generalizedg-Meir-Keeler-contractive condition. Also, some applications of the main results in this paper are given.

In most synthesis evaluation systems and decision-making systems, data are represented by objects and attributes of objects with a degree of belief. Formally, these data can be abstracted by the form (objects; attributes; P), wherePrepresents a kind degree of belief between objects and attributes, such that,Pis a basic probability assignment. In the paper, we provide a kind of probability information system to describe these data and then employ rough sets theory to extract probability decision rules. By extension of Dempster-Shafer evidence theory, we can get probabilities of antecedents and conclusion of probability decision rules. Furthermore, we analyze the consistency of probability decision rules. Based on consistency of probability decision rules, we provide an inference method to finish inference of probability decision rules, which can be used to decide the class of a new objectx′. The conclusion points out that the inference method of the paper not only deals with precise information, but also imprecise or uncertain information as well.

A Canonic-Signed-Digit-(CSD-) coded genetic algorithm (GA) is proposed to find the optimal design of robustly stable infinite impulse response digital filter (IIR). Under the characteristics of the CSD structure, the circuit of the filter can be simplified and also the calculation speed can be raised to increase the hardware’s efficiency. However, the design of CSD has a big challenge: the CSD structure of the system parameters will be destroyed by an optimal design procedure. To solve this problem, in this research a CSD-coded GA is proposed so that the CSD structure can be maintained. Moreover, the robustly stable IIR filters design problem is included in this paper. The robustness of the IIR filters is achieved by ensuring that all poles of the filters are located inside a diskD(α,r)contained in the unit circle, in whichαis the center,ris the radius of the disk, and|α|+r<1. Consequently, in this paper, a new and more efficientD(α,r)-stability criterion will be derived and then embedded in GA for the design of robust IIR filters. It is worthwhile to note that to design an IIR filter simultaneously with CSD-structured parameters and robust stability is difficult and is not well explored so far. An example will be presented to show the efficiency of the proposed strategy for design of IIR filters.

In order to increase productivity, it is important to study the performance of a hydraulically fractured well producing at constant wellbore pressure. This paper constructs a new productivity formula, which is obtained by solving a weakly singular integral equation of the first kind, for an infinite-conductivity hydraulically fractured well producing at constant pressure. And the two key components of this paper are a weakly singular integral equation of the first kind and a steady-state productivity formula. A new midrectangle algorithm and a Galerkin method are presented in order to solve the weakly singular integral equation. The numerical results of these two methods are in accordance with each other. And then the solutions of the weakly singular integral equation are utilized for the productivity formula of hydraulic fractured wells producing at constant pressure, which provide fast analytical tools to evaluate production performance of infinite-conductivity fractured wells. The paper also shows equipotential threads, which are generated from the numerical results, with different fluid potential values. These threads can be approximately taken as a family of ellipses whose focuses are the two endpoints of the fracture, which is in accordance with the regular assumption in Kuchuk and Brigham, 1979.

This paper addresses the short-term scheduling problem of hydrothermal power systems, which results in a large-scale mixed-integer nonlinear programming problem. The objective consists in minimizing the operation cost over a two-day horizon with a one-hour time resolution. To solve this difficult problem, a Lagrangian Relaxation (LR) based on variable splitting is designed where the resulting dual problem is solved by a Bundle method. Given that the LR usually fails to find a feasible solution, we use an inexact Augmented Lagrangian method to improve the quality of the solution supplied by the LR. We assess our approach by using a real-life hydrothermal configuration extracted from the Brazilian power system, proving the conceptual and practical feasibility of the proposed algorithm. In summary, the main contributions of this paper are (i) a detailed and compatible modelling for this problem is presented; (ii) in order to solve efficiently the entire problem, a suitable decomposition strategy is presented. As a result of these contributions, the proposed model is able to find practical solutions with moderate computational burden, which is absolutely necessary in the modern power industry.

The paper presents a new methodology for optimizing the design of DC-DC converters. The magnitudes that we take into account are efficiency, ripples, bandwidth, and RHP zero placement. We apply a geometric programming approach, because the variables are positives and the constraints can be expressed in a posynomial form. This approach has all the advantages of convex optimization. We apply the proposed methodology to a boost converter. The paper also describes the optimum designs of a buck converter and a synchronous buck converter, and the method can be easily extended to other converters. The last example allows us to compare the efficiency and bandwidth between these optimal-designed topologies.

This paper studies a perishable inventory model, which assumes that each perishable item has finite lifetime, and only one item is consumed each time. The lifetimes of perishable items are independent random variables with the general distribution and so are the consumption internal. Under this assumption, by using backward equations and limit distribution of Markov skeleton processes, this paper obtains the existence conditions and the explicit expression of the limit distribution of the inventory level of perishable inventory model.

This paper describes a mathematical formulation for the efficient localization of 3D surfaces including free-form surfaces and flat surfaces. An important application of this paper is to register flat surface calculated from unfolding process with a curved surface extracted from ship CAD prior to the multipoint press forming works. The mathematical formulation handles the registration and comparison of two free surfaces represented by sparse points based on the iterative closest point (ICP) algorithm and localization that can be applicable to ship-hull plate forming. The ICP algorithm gives an adequate set of initial translation and rotation for surface objects with little correspondence through the minimization of mean square distance metric. Comparison of surfaces is explained in order to determine a corresponding set which gives the optimized press stroke between unfold surface and referential object surface. It thereby allows the optimized press works in ship-hull forming. The combination of registration and comparison is applied to decide the shape equivalence of correspondent surfaces as well as to estimate the transform matrix between point sets where similarity is low. Experimental results show the capabilities of the registration on unfolding surface and curved surface.

The objective function and the constraints can be formulated as linear functions of independent variables in most of the real-world optimization problems. Linear Programming (LP) is the process of optimizing a linear function subject to a finite number of linear equality and inequality constraints. Solving linear programming problems efficiently has always been a fascinating pursuit for computer scientists and mathematicians. The computational complexity of any linear programming problem depends on the number of constraints and variables of the LP problem. Quite often large-scale LP problems may contain many constraints which are redundant or cause infeasibility on account of inefficient formulation or some errors in data input. The presence of redundant constraints does not alter the optimal solutions(s). Nevertheless, they may consume extra computational effort. Many researchers have proposed different approaches for identifying the redundant constraints in linear programming problems. This paper compares five of such methods and discusses the efficiency of each method by solving various size LP problems and netlib problems. The algorithms of each method are coded by using a computer programming language C. The computational results are presented and analyzed in this paper.

This paper presents a method determining neighborhoods of the image pixels automatically in adaptive denoising. The neighborhood is named stationary neighborhood (SN). In this method, the noisy image is considered as an observation of a nonlinear time series (NTS). Image denoising must recover the true state of the NTS from the observation. At first, the false neighbors (FNs) in a neighborhood for each pixel are removed according to the context. After moving the FNs, we obtain an SN, where the NTS is stationary and the real state can be estimated using the theory of stationary time series (STS). Since each SN of an image pixel consists of elements with similar context and nearby locations, the method proposed in this paper can not only adaptively find neighbors and determine size of the SN according to the characteristics of a pixel, but also be able to denoise while effectively preserving edges. Finally, in order to show the superiority of this algorithm, we compare this method with the existing universal denoising algorithms.

This paper indicates that the filled function which appeared in one of the papers by Y. L. Shang et al. (2007) is also a tunneling function; that is, we prove that under some general assumptions this function has the characters of both tunneling function and filled function. A solution algorithm based on this T-F function is given and numerical tests from test functions show that our T-F function method is very effective in finding better minima.

A shear flow motivated by relatively moving half-planes is theoretically studied in this paper. Either the mass influx or the mass efflux is allowed on the boundary. This flow is called the extended Stokes' problems. Traditionally, exact solutions to the Stokes' problems can be readily obtained by directly applying the integral transforms to the momentum equation and the associated boundary and initial conditions. However, it fails to solve the extended Stokes' problems by using the integral-transform method only. The reason for this difficulty is that the inverse transform cannot be reduced to a simpler form. To this end, several crucial mathematical techniques have to be involved together with the integral transforms to acquire the exact solutions. Moreover, new dimensionless parameters are defined to describe the flow phenomena more clearly. On the basis of the exact solutions derived in this paper, it is found that the mass influx on the boundary hastens the development of the flow, and the mass efflux retards the energy transferred from the plate to the far-field fluid.

This paper presents a positional FEM formulation to deal with geometrical nonlinear dynamics of shells. The main objective is to develop a new FEM methodology based on the minimum potential energy theorem written regarding nodal positions and generalized unconstrained vectors not displacements and rotations. These characteristics are the novelty of the present work and avoid the use of large rotation approximations. A nondimensional auxiliary coordinate system is created, and the change of configuration function is written following two independent mappings from which the strain energy function is derived. This methodology is called positional and, as far as the authors' knowledge goes, is a new procedure to approximated geometrical nonlinear structures. In this paper a proof for the linear and angular momentum conservation property of the Newmark algorithm is provided for total Lagrangian description. The proposed shell element is locking free for elastic stress-strain relations due to the presence of linear strain variation along the shell thickness. The curved, high-order element together with an implicit procedure to solve nonlinear equations guarantees precision in calculations. The momentum conserving, the locking free behavior, and the frame invariance of the adopted mapping are numerically confirmed by examples.

This paper aims at deriving an efficient criterion for the robust stability analysis of discrete-time systems with time-varying delay. In the derivation, to obtain a larger stability region under the requirement of less computational complexity, this paper proposes a valuable method capable of establishing a less conservative stability criterion without using the free-weighting approach and an extremely augmented state. In parallel, the stabilization problem of systems with time-delayed control input is addressed in connection with the derived stability criterion.

An instrumental matrix approach to design output feedback passive controller for switched singular systems is proposed in this paper. The nonlinear inequality condition including Lyapunov inverse matrix and controller gain matrix is decoupled by introducing additional instrumental matrix variable. Combined with multiple Lyapunov function method, the nonlinear inequality is transformed into linear matrix inequality (LMI). An LMI condition is presented for switched singular system to be stable and passive via static output feedback under designed switching signal. Moreover, the conditions proposed do not require the decomposition of Lyapunov matrix and its inverse matrix or fixing to a special structure. The theoretical results are verified by means of an example. The method introduced in the paper can be effectively extended to a single singular system and normal switched system.

Virtual power plant (VPP) is an aggregation of multiple distributed generations, energy storage, and controllable loads. Affected by natural conditions, the uncontrollable distributed generations within VPP, such as wind and photovoltaic generations, are extremely random and relative. Considering the randomness and its correlation of uncontrollable distributed generations, this paper constructs the chance constraints stochastic optimal dispatch of VPP including stochastic variables and its random correlation. The probability distributions of independent wind and photovoltaic generations are described by empirical distribution functions, and their joint probability density model is established by Frank-copula function. And then, sample average approximation (SAA) is applied to convert the chance constrained stochastic optimization model into a deterministic optimization model. Simulation cases are calculated based on the AIMMS. Simulation results of this paper mathematic model are compared with the results of deterministic optimization model without stochastic variables and stochastic optimization considering stochastic variables but not random correlation. Furthermore, this paper analyzes how SAA sampling frequency and the confidence level influence the results of stochastic optimization. The numerical example results show the effectiveness of the stochastic optimal dispatch of VPP considering the randomness and its correlations of distributed generations.

The first aim of the paper is to present a survey of possible approaches for the study of fuzzy stochastic differential or integral equations. They are stochastic counterparts of classical approaches known from the theory of deterministic fuzzy differential equations. For our aims we present first a notion of fuzzy stochastic integral with a semimartingale integrator and its main properties. Next we focus on different approaches for fuzzy stochastic differential equations. We present the existence of fuzzy solutions to such equations as well as their main properties. In the first approach we treat the fuzzy equation as an abstract relation in the metric space of fuzzy sets over the space of square integrable random vectors. In the second one the equation is interpreted as a system of stochastic inclusions. Finally, in the last section we discuss fuzzy stochastic integral equations with solutions being fuzzy stochastic processes. In this case the notion of the stochastic Itô’s integral in the equation is crisp; that is, it has single-valued level sets. The second aim of this paper is to show that there is no extension to more general diffusion terms.

This paper studies a production scheduling problem with deteriorating jobs, which frequently arises in contemporary manufacturing environments. The objective is to find an optimal sequence of the set of jobs to minimize the total weighted tardiness, which is an indicator of service quality. The problem belongs to the class of NP-hard. When the number of jobs increases, the computational time required by an optimization algorithm to solve the problem will increase exponentially. To tackle large-scale problems efficiently, a two-stage method is presented in this paper. We partition the set of jobs into a few subsets by applying a neural network approach and thereby transform the large-scale problem into a series of small-scale problems. Then, we employ an improved metaheuristic algorithm (called GTS) which combines genetic algorithm with tabu search to find the solution for each subproblem. Finally, we integrate the obtained sequences for each subset of jobs and produce the final complete solution by enumeration. A fair comparison has been made between the two-stage method and the GTS without decomposition, and the experimental results show that the solution quality of the two-stage method is much better than that of GTS for large-scale problems.

In view of techniques for constructing high-order fuzzy time series models, there are three types which are based on advanced algorithms, computational method, and grouping the fuzzy logical relationships. The last type of models is easy to be understood by the decision maker who does not know anything about fuzzy set theory or advanced algorithms. To deal with forecasting problems, this paper presented novel high-order fuzz time series models denoted as GTS(M, N)based on generalized fuzzy logical relationships and automatic clustering. This paper issued the concept of generalized fuzzy logical relationship and an operation for combining the generalized relationships. Then, the procedure of the proposed model was implemented on forecasting enrollment data at the University of Alabama. To show the considerable outperforming results, the proposed approach was also applied to forecasting the Shanghai Stock Exchange Composite Index. Finally, the effects of parametersMandN, the number of order, and concerned principal fuzzy logical relationships, on the forecasting results were also discussed.

Degree constrained minimum spanning tree (DCMST) refers to constructing a spanning tree of minimum weight in a complete graph with weights on edges while the degree of each node in the spanning tree is no more thand(d≥ 2). The paper proposes an improved multicolony ant algorithm for degree constrained minimum spanning tree searching which enables independent search for optimal solutions among various colonies and achieving information exchanges between different colonies by information entropy. Local optimal algorithm is introduced to improve constructed spanning tree. Meanwhile, algorithm strategies in dynamic ant, random perturbations ant colony, and max-min ant system are adapted in this paper to optimize the proposed algorithm. Finally, multiple groups of experimental data show the superiority of the improved algorithm in solving the problems of degree constrained minimum spanning tree.

This paper makes a discussion on the ranking problem of complex objects where each object is composed of some patterns described by individual attribute information as well as the relational information between patterns. This paper presents a fuzzy collaborative clustering-based ranking approach for this kind of ranking problem. In this approach, a referential object is employed to guide the ranking process. To achieve the final ranking result, fuzzy collaborative clustering is carried on the patterns in the referential object by using the collaborative information obtained from each ranked object. Since the collaborative information of ranking objects is represented by cluster centers and/or partition matrices, we give two forms of the proposed approach. With the aid of fuzzy collaborative clustering, the ranking results can be obtained by comparing the difference of the referential object before and after collaboration with respect to ranking objects. One can find that this proposed ranking approach is totally different from the previous ranking methods because of its completely collaborative clustering mechanism. Moreover, some synthetic examples show that our proposed ranking algorithm is valid.