Search

This paper describes a valuable linear yaw-roll tractor-semitrailer (TST) model with five-degree-of-freedom (DOFs) for control algorithm development when steering and braking. The key parameters, roll stiffness, axle cornering stiffness, and fifth-wheel stiffness, are identified by the genetic algorithm (GA) and multistage genetic algorithm (MGA) based on TruckSim outputs to increase the accuracy of the model. Thus, the key parameters of the simplified model can be modified according to the real-time vehicle states by online lookup table and interpolation. The TruckSim vehicle model is built referring to the real tractor (JAC-HFC4251P1K7E33ZTF6×2) and semitrailer (Luyue LHX9406) used in the field test later. The validation of the linear yaw-roll model of a tractor-semitrailer using field test data is presented in this paper. The field test in the performance testing ground is detailed, and the test data of roll angle, roll rate, and yaw rate are compared with the outputs of the model with maps of the key parameters. The results indicate that the error of the tractor’s roll angle and semitrailer’s roll angle between model data and test data is 1.13% and 1.24%, respectively. The roll rate and yaw rate of the tractor and semitrailer are also in good agreement.

The digging resistance in a normal state is the key to excavator design and automated excavation. It is difficult to accurately predict, simulate, or directly measure the digging resistance in a normal state due to uncertainties in the soil properties and excavation parameters. In this paper, a research idea is proposed that uses the working device as the entry point to indirectly calculate the digging resistance in a normal state by measuring the motion parameters and the cylinder pressure intensity. Based on the rule of combination for spatial force systems, a method for combining and projecting the system of the digging resistance is proposed in which the system is projected as six parts, and the tangential force, normal force, and bending moment in the plane of symmetry of the working device are the objects of the solution to avoid redundant equations. Based on kinematics and dynamics models of the excavator and the force and moment equilibrium conditions of the working device, equations for the active-side calculation of the incomplete digging resistance are derived. Based on these equations, the motion parameters of the working device and data on the cylinder pressure intensity obtained by measurement are used to calculate the incomplete digging resistance. The validation scheme and process proposed use the incomplete digging resistance as the external load to obtain the simulated stress of the working device through transient analysis. The simulated stress and the measured stress corresponding to the position of the measurement point are extracted and compared. The results show that there is a difference in the size of the numerical value between the simulated and measured stress, but the variation law is highly consistent, which validates the calculation method. In this paper, an active-side calculation method is provided for the incomplete digging resistance in a normal state without considering the soil-tool interaction relationships, which lays a theoretical foundation for the study of the digging resistance characteristics in a normal state, as well as excavator design and automated excavation.

In order to detect infrared (IR) dim and small targets in a strong clutter background, a method based on local energy center of sequential image is proposed. This paper began by using improved anisotropy for background prediction (IABP), followed by target enhancement by improved high-order cumulates (HOC). Finally, on the basis of image preprocessing, the paper constructs a sequential image energy center detection algorithm that integrates the neighborhood, continuity, area, and energy and other motion characteristics of the target. Experiments showed that the improved anisotropic background predication could be loyal to the true background of the original image to the maximum extent, presenting a superior overall performance to other background prediction methods; the improved HOC significantly increased the signal-noise ratio of images; when the signal-noise ratio (SNR) is lower than 2.5 dB, the proposed method could effectively eliminate noise and detect targets.

In order to express the safety level of hull structures, IACS Common Structure Rules of Bulk Carriers and Oil Tankers (CSR-H) makes new requirements of hull girder ultimate strength. Compared with original CSR (i.e., CSR-OT and CSR-BC), partial safety factors of hull girder ultimate strength in CSR-H have been partly modified, and new requirements of residual strength have been added in the rules for hull safety after grounded/collided damage. This paper compares the rule requirements of ultimate strength in CSR-H and CSR-OT/CSR-BC and explains the technical background of rule requirements. The hull girder ultimate strength is mainly analyzed by SMITH method in rule requirements due to fast and stable calculation results. This paper also uses nonlinear finite element method (NFEM) to explain the critical influence factors for hull girder ultimate strength implied in the rule requirements. Based on 5 typical Bulk Carriers and 4 typical Oil Tankers, the influence of hull girder ultimate strength and residual strength in CSR-H has been evaluated for ship building industry. The actual ship evaluation results can be used to instruct the new CSR-H ship design.

The concrete-filled square steel tube (CFSST) columns have been widely applied in structural engineering. Although many constitutive models have been proposed to describe CFSST short columns under concentric loading, the applicability of the existing concentric model in the analysis of CFSST short columns under eccentric loading has not been properly verified. In this paper, the eccentric behaviors of CFSST short columns were investigated with the software of ABAQUS/standard. It was found that the contact stress between steel tube and inner concrete was seriously affected by eccentric ratios, indicating that the confinement effect of steel tube on inner concrete was different under concentric and eccentric loading. In this paper, a new stress-strain model of inner concrete which considered the influence of eccentricity was developed and verified with existing experimental results. It was found that the proposed stress-strain model was more accurate in simulating the eccentric behaviors of CFSST short columns.

This paper presents a predictive control strategy for an image-based visual servoing scheme that employs evolutionary optimization. The visual control task is approached as a nonlinear optimization problem that naturally handles relevant visual servoing constraints such as workspace limitations and visibility restrictions. As the predictive scheme requires a reliable model, this paper uses a local model that is based on the visual interaction matrix and a global model that employs 3D trajectory data extracted from a quaternion-based interpolator. The work assumes a free-flying camera with 6-DOF simulation whose results support the discussion on the constraint handling and the image prediction scheme.

This paper presents a method to perform chord classification from recorded audio. The signal harmonics are obtained by using the Fast Fourier Transform, and timbral information is suppressed by spectral whitening. A multiple fundamental frequency estimation of whitened data is achieved by adding attenuated harmonics by a weighting function. This paper proposes a method that performs feature selection by using a thresholding of the uncertainty of all frequency bins. Those measurements under the threshold are removed from the signal in the frequency domain. This allows a reduction of 95.53% of the signal characteristics, and the other 4.47% of frequency bins are used as enhanced information for the classifier. An Artificial Neural Network was utilized to classify four types of chords: major, minor, major 7th, and minor 7th. Those, played in the twelve musical notes, give a total of 48 different chords. Two reference methods (based on Hidden Markov Models) were compared with the method proposed in this paper by having the same database for the evaluation test. In most of the performed tests, the proposed method achieved a reasonably high performance, with an accuracy of 93%.

Currently superresolution from a motion blurred image still remains a challenging task. The conventional approach, which preprocesses the blurry low resolution (LR) image with a deblurring algorithm and employs a superresolution algorithm, has the following limitation. The high frequency texture of the image is unavoidably lost in the deblurring process and this loss restricts the performance of the subsequent superresolution process. This paper presents a novel technique that performs motion deblurring and superresolution jointly from one single blurry image. The basic idea is to regularize the ill-posed reconstruction problem using an edge-preserving gradient prior and a sparse kernel prior. This method derives from an inverse problem approach under an efficient optimization scheme that alternates between blur kernel estimation and superresolving until convergence. Furthermore, this paper proposes a simple and efficient refinement formulation to remove artifacts and render better deblurred high resolution (HR) images. The improvements brought by the proposed combined framework are demonstrated by the processing results of both simulated and real-life images. Quantitative and qualitative results on challenging examples show that the proposed method outperforms the existing state-of-the-art methods and effectively eliminates motion blur and artifacts in the superresolved image.

Feature interaction has gained considerable attention recently. However, many feature selection methods considering interaction are only designed for categorical features. This paper proposes a mixed feature selection algorithm based on neighborhood rough sets that can be used to search for interacting features. In this paper, feature relevance, feature redundancy, and feature interaction are defined in the framework of neighborhood rough sets, the neighborhood interaction weight factor reflecting whether a feature is redundant or interactive is proposed, and a neighborhood interaction weight based feature selection algorithm (NIWFS) is brought forward. To evaluate the performance of the proposed algorithm, we compare NIWFS with other three feature selection algorithms, including INTERACT, NRS, and NMI, in terms of the classification accuracies and the number of selected features with C4.5 and IB1. The results from ten real world datasets indicate that NIWFS not only deals with mixed datasets directly, but also reduces the dimensionality of feature space with the highest average accuracies.

Multiplicative relations are one of most powerful techniques to express the preferences over alternatives (or criteria). In this paper, we propose a wide range of hesitant multiplicative fuzzy power aggregation geometric operators on multiattribute group decision making (MAGDM) problems for hesitant multiplicative information. In this paper, we first develop some compatibility measures for hesitant multiplicative fuzzy numbers, based on which the corresponding support measures can be obtained. Then we propose several aggregation techniques, and investigate their properties. In the end, we develop two approaches for multiple attribute group decision making with hesitant multiplicative fuzzy information and illustrate a real world example to show the behavior of the proposed operators.

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.

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.

A method to evaluate the stability of tunnel face is proposed in the framework of upper bound theorem. The safety factor which is widely applied in slope stability analysis is introduced to estimate the stability of tunnel face using the upper bound theorem of limit analysis in conjunction with a strength reduction technique. Considering almost all geomaterials following a nonlinear failure criterion, a generalized tangential technique is used to calculate the external work and internal energy dissipation in the kinematically admissible velocity field. The upper bound solution of safety factor is obtained by optimization calculation. To evaluate the validity of the method proposed in this paper, the safety factor is compared with those calculated by limit equilibrium method. The comparison shows the solutions derived from these two methods match each other well, which shows the method proposed in this paper can be considered as effective.

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

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.

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.

In this paper, we propose a sparseness constraint NMF method, named graph regularized matrix factorization with sparse coding (GRNMF_SC). By combining manifold learning and sparse coding techniques together, GRNMF_SC can efficiently extract the basic vectors from the data space, which preserves the intrinsic manifold structure and also the local features of original data. The target function of our method is easy to propose, while the solving procedures are really nontrivial; in the paper we gave the detailed derivation of solving the target function and also a strict proof of its convergence, which is a key contribution of the paper. Compared with sparseness constrained NMF and GNMF algorithms, GRNMF_SC can learn much sparser representation of the data and can also preserve the geometrical structure of the data, which endow it with powerful discriminating ability. Furthermore, the GRNMF_SC is generalized as supervised and unsupervised models to meet different demands. Experimental results demonstrate encouraging results of GRNMF_SC on image recognition and clustering when comparing with the other state-of-the-art NMF methods.

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.

A wide range of application domains from cognitive robotics to intelligent systems encompassing diverse paradigms such as ambient intelligence and ubiquitous computing environments require the ability to represent and reason about the spatial aspects of the environment within which an agent or a system is functional. Many existing spatial reasoners share a common limitation that they do not provide any checking functions for cross-consistency between the directional and the topological relation set. They provide only the checking function for path-consistency within a directional or topological relation set. This paper presents an efficient spatial reasoning algorithm working on a mixture of directional and topological relations between spatial entities and then explains the implementation of a spatial reasoner based on the proposed algorithm. Our algorithm not only has the checking function for path-consistency within each directional or topological relation set, but also provides the checking function for cross-consistency between them. This paper also presents an application system developed to demonstrate the applicability of the spatial reasoner and then introduces the results of the experiment carried out to evaluate the performance of our spatial reasoner.

The problems of improving computational efficiency and extending representational capability are the two hottest topics in approaches of global manifold learning. In this paper, a new method called extensive landmark Isomap (EL-Isomap) is presented, addressing both topics simultaneously. On one hand, originated from landmark Isomap (L-Isomap), which is known for its high computational efficiency property, EL-Isomap also possesses high computational efficiency through utilizing a small set of landmarks to embed all data points. On the other hand, EL-Isomap significantly extends the representational capability of L-Isomap and other global manifold learning approaches by utilizing only an available subset from the whole landmark set instead of all to embed each point. Particularly, compared with other manifold learning approaches, the data manifolds with intrinsic low-dimensional concave topologies and essential loops can be unwrapped by the new method more successfully, which are shown by simulation results on a series of synthetic and real-world data sets. Moreover, the accuracy, robustness, and computational complexity of EL-Isomap are analyzed in this paper, and the relation between EL-Isomap and L-Isomap is also discussed theoretically.

Single image superresolution (SISR) requires only one low-resolution (LR) image as its input which thus strongly motivates researchers to improve the technology. The property that small image patches tend to recur themselves across different scales is very important and widely used in image processing and computer vision community. In this paper, we develop a new approach for solving the problem of SISR by generalizing this property. The main idea of our approach takes advantage of a generic prior that assumes that a randomly selected patch in the underlying high-resolution (HR) image should visually resemble as much as possible with some patch extracted from the input low-resolution (LR) image. Observing the proposed prior, our approach deploys a cost function and applies an iterative scheme to estimate the optimal HR image. For solving the cost function, we introduce Gaussian mixture model (GMM) to train on a sampled data set for approximating the joint probability density function (PDF) of input image with different scales. Through extensive comparative experiments, this paper demonstrates that the visual fidelity of our proposed method is often superior to those generated by other state-of-the-art algorithms as determined through both perceptual judgment and quantitative measures.

Moving targets detection and tracking is an important and basic issue in the field of intelligent video surveillance. The classical Codebook algorithm is simplified in this paper by introducing the average intensity into the Codebook model instead of the original minimal and maximal intensities. And a hierarchical matching method between the current pixel and codeword is also proposed according to the average intensity in the high and low intensity areas, respectively. Based on the simplified Codebook algorithm, this paper then proposes a robust object tracking algorithm called Simplified Codebook Masked Camshift algorithm (SCMC algorithm), which combines the simplified Codebook algorithm and Camshift algorithm together. It is designed to overcome the sensitiveness of traditional Camshift algorithm to background color interference. It uses simplified Codebook to detect moving objects, whose result is employed to mask color probability distribution image, based on which we then use Camshift to predict the centroid and size of these objects. Experiment results show that the proposed simplified Codebook algorithm simultaneously improves the detection accuracy and computational efficiency. And they also show that the SCMC algorithm can significantly reduce the possibility of false convergence and result in a higher correct tracking rate, as compared with the traditional Camshift algorithm.

This paper presents a new method of color aesthetic evaluation based on the combination of form and color. According to the human visual physiological and psychological characteristics, this paper first proposes a new form-color field theory for the coupled form-color aesthetic evaluation based on the psychophysical field theory and the Moon and Spencer model. Second, it builds a coupled form-color topological graph for describing their interaction and develops a strength calculation algorithm for color harmony based on the new form-color field theory. Finally, it develops an aesthetic measure evaluation model for coupled form-color fields to evaluate the new theory. The experiment results show that the new coupled form-color aesthetic evaluation method is useful and can be integrated into an intelligent evaluation process for color design scheme.

In recent years Grammatical Evolution (GE) has been used as a representation of Genetic Programming (GP) which has been applied to many optimization problems such as symbolic regression, classification, Boolean functions, constructed problems, and algorithmic problems. GE can use a diversity of searching strategies including Swarm Intelligence (SI). Particle Swarm Optimisation (PSO) is an algorithm of SI that has two main problems: premature convergence and poor diversity. Particle Evolutionary Swarm Optimization (PESO) is a recent and novel algorithm which is also part of SI. PESO uses two perturbations to avoid PSO’s problems. In this paper we propose using PESO and PSO in the frame of GE as strategies to generate heuristics that solve the Bin Packing Problem (BPP); it is possible however to apply this methodology to other kinds of problems using another Grammar designed for that problem. A comparison between PESO, PSO, and BPP’s heuristics is performed through the nonparametric Friedman test. The main contribution of this paper is proposing a Grammar to generate online and offline heuristics depending on the test instance trying to improve the heuristics generated by other grammars and humans; it also proposes a way to implement different algorithms as search strategies in GE like PESO to obtain better results than those obtained by PSO.

The purpose of this paper is to propose a three-dimensional grey interval relational degree model for dynamic Multiattribute decision making. In the model, the observed values are interval grey numbers. Elements are selected in the system as the points in anm-dimensional linear space. Then observation data of each element to different time and objects are as the coordinates of point. An optimization model is employed to obtain each scheme’s affiliate degree for the positive and negative ideal schemes. And a three-dimensional grey interval relational degree model based on time, index, and scheme is constructed in the paper. The result shows that the three-dimensional grey relational degree simplifies the traditional dynamic multiattribute decision making method and can better resolve the dynamic multiattribute decision making problem of interval numbers. The example illustrates that the method presented in the paper can be used to deal with problems of uncertainty such as dynamic multiattribute decision making.

Hesitant fuzzy set has been an important tool in dealing with multiple attribute decision making (MADM) problems, especially for the decision making situation when only some values of membership are possible for an alternative on attributes. However, determining attributes weights in hesitant fuzzy MADM is still an open problem. In this paper, we propose an objective weighting approach based on Shannon information entropy, which expresses the relative intensities of attribute importance to signify the average intrinsic information transmitted to the decision maker. Furthermore, we construct a hesitant fuzzy MADM approach based on the TOPSIS method and a weighted correlation coefficient proposed in this paper. Finally, we utilize a supplier selection example to validate the objective attributes weights determining method and the proposed hesitant fuzzy MADM approach.

This paper addresses a novel and efficient algorithm for solving optimization problem in image processing applications. Image enhancement (IE) is one of the complex optimization problems in image processing. The main goal of this paper is to enhance color images such that the eminence of the image is more suitable than the original image from the perceptual viewpoint of human. Traditional methods require prior knowledge of the image to be enhanced, whereas the aim of the proposed biogeography based optimization (BBO) enhanced with blended migration operator (BMO) algorithm is to maximize the objective function in order to enhance the image contrast by maximizing the parameters like edge intensity, edge information, and entropy. Experimental results are compared with the current state-of-the-art approaches and indicate the superiority of the proposed technique in terms of subjective and objective evaluation.

To overcome the shortcomings of traditional dimensionality reduction algorithms, incremental tensor principal component analysis (ITPCA) based on updated-SVD technique algorithm is proposed in this paper. This paper proves the relationship between PCA, 2DPCA, MPCA, and the graph embedding framework theoretically and derives the incremental learning procedure to add single sample and multiple samples in detail. The experiments on handwritten digit recognition have demonstrated that ITPCA has achieved better recognition performance than that of vector-based principal component analysis (PCA), incremental principal component analysis (IPCA), and multilinear principal component analysis (MPCA) algorithms. At the same time, ITPCA also has lower time and space complexity.

Infrared images are fuzzy and noisy by nature; thus the segmentation of human targets in infrared images is a challenging task. In this paper, a fast thresholding method of infrared human images based on two-dimensional fuzzy Tsallis entropy is introduced. First, to address the fuzziness of infrared image, the fuzzy Tsallis entropy of objects and that of background are defined, respectively, according to probability partition principle. Next, this newly defined entropy is extended to two dimensions to make good use of spatial information to deal with the noise in infrared images, and correspondingly a fast computation method of two-dimensional fuzzy Tsallis entropy is put forward to reduce its computation complexity fromO(L2)toO(L). Finally, the optimal parameters of fuzzy membership function are searched by shuffled frog-leaping algorithm following maximum entropy principle, and then the best threshold of an infrared human image is computed from the optimal parameters. Compared with typical entropy-based thresholding methods by experiments, the method presented in this paper is proved to be more efficient and robust.

In this paper, some basic concepts of multimodal transportation and swarm intelligence were described and reviewed and analyzed related literatures of multimodal transportation scheme decision and swarm intelligence methods application areas. Then, this paper established a multimodal transportation scheme decision optimization mathematical model based on transportation costs, transportation time, and transportation risks, explained relevant parameters and the constraints of the model in detail, and used the weight coefficient to transform the multiobjective optimization problems into a single objective optimization transportation scheme decision problem. Then, this paper is proposed by combining particle swarm optimization algorithm and ant colony algorithm (PSACO) to solve the combinatorial optimization problem of multimodal transportation scheme decision for the first time; this algorithm effectively combines the advantages of particle swarm optimization algorithm and ant colony algorithm. The solution shows that the PSACO algorithm has two algorithms’ advantages and makes up their own problems; PSACO algorithm is better than ant colony algorithm in time efficiency and its accuracy is better than that of the particle swarm optimization algorithm, which is proved to be an effective heuristic algorithm to solve the problem about multimodal transportation scheme decision, and it can provide economical, reasonable, and safe transportation plan reference for the transportation decision makers.

The paper proposes a procedure for design of PI controllers for hydraulic systems with long transmission lines which are described by models of high order. Design is based on the combination of the IE criterion and engineering specifications (settling time and relative stability) as well as on the application ofD-decomposition. In comparison with some known results, the method is of graphical character, and it is very simple (solving nonlinear algebraic equations is eliminated). The paper presents the algorithm of software procedure for design of the controller. The method is compared with other methods at the level of simulation, and its superiority is shown. By applying the Nyquist criterion, it is shown that the method possesses robustness in relation to non modelled dynamics.

In view of techniques for constructing high-order fuzzy time series models, there are three methods which are based on advanced algorithms, computational methods, and grouping the fuzzy logical relationships, respectively. The last kind model has been widely applied and researched for the reason that it is easy to be understood by the decision makers. To improve the fuzzy time series forecasting model, this paper presents a novel high-order fuzzy time series models denoted asGTS(M,N)on the basis of generalized fuzzy logical relationships. Firstly, the paper introduces some concepts of the generalized fuzzy logical relationship and an operation for combining the generalized relationships. Then, the proposed model is implemented in forecasting enrollments of the University of Alabama. As an example of in-depth research, the proposed approach is also applied to forecast the close price of Shanghai Stock Exchange Composite Index. Finally, the effects of the number of orders and hierarchies of fuzzy logical relationships on the forecasting results are discussed.

Made available in DSpace on 2013-08-28T14:12:42Z (GMT). No. of bitstreams: 1 WOS000301370100001.pdf: 1963909 bytes, checksum: 9b2ab8dd0740cdb43557fa124608b53c (MD5) Made available in DSpace on 2013-09-30T18:11:23Z (GMT). No. of bitstreams: 2 WOS000301370100001.pdf: 1963909 bytes, checksum: 9b2ab8dd0740cdb43557fa124608b53c (MD5) WOS000301370100001.pdf.txt: 38827 bytes, checksum: dde5e752a84552369f78e4de52812a2e (MD5) Previous issue date: 2012-01-01 Submitted by Vitor Silverio Rodrigues (vitorsrodrigues@reitoria.unesp.br) on 2014-05-20T13:28:05Z No. of bitstreams: 2 WOS000301370100001.pdf: 1963909 bytes, checksum: 9b2ab8dd0740cdb43557fa124608b53c (MD5) WOS000301370100001.pdf.txt: 38827 bytes, checksum: dde5e752a84552369f78e4de52812a2e (MD5) Made available in DSpace on 2014-05-20T13:28:05Z (GMT). No. of bitstreams: 2 WOS000301370100001.pdf: 1963909 bytes, checksum: 9b2ab8dd0740cdb43557fa124608b53c (MD5) WOS000301370100001.pdf.txt: 38827 bytes, checksum: dde5e752a84552369f78e4de52812a2e (MD5) Previous issue date: 2012-01-01 Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) This work aims to analyze the stability of the rotational motion of artificial satellites in circular orbit with the influence of gravity gradient torque, using the Andoyer variables. The used method in this paper to analyze stability is the Kovalev-Savchenko theorem. This method requires the reduction of the Hamiltonian in its normal form up to fourth order by means of canonical transformations around equilibrium points. The coefficients of the normal Hamiltonian are indispensable in the study of nonlinear stability of its equilibrium points according to the three established conditions in the theorem. Some physical and orbital data of real satellites were used in the numerical simulations. In comparison with previous work, the results show a greater number of equilibrium points and an optimization in the algorithm to determine the normal form and stability analysis. The results of this paper can directly contribute in maintaining the attitude of artificial satellites. São Paulo State Univ, UNESP, Grp Orbital Dynam & Planetol, BR-12516410 Guaratingueta, SP, Brazil São Paulo Salesian Univ UNISAL, Dept Math, BR-12600100 Lorena, SP, Brazil Natl Inst Space Res INPE, Space Mech & Control Div, BR-12227010 Sao Jose Dos Campos, SP, Brazil Fac Technol FATEC, Dept Aircraft Maintenance & Aeronaut Mfg, BR-12247004 Sao Jose Dos Campos, SP, Brazil São Paulo State Univ, UNESP, Grp Orbital Dynam & Planetol, BR-12516410 Guaratingueta, SP, Brazil

A novel adaptive fuzzy min-max neural network classifier called AFMN is proposed in this paper. Combined with principle component analysis and adaptive genetic algorithm, this integrated system can serve as a supervised and real-time classification technique. Considering the loophole in the expansion-contraction process of FMNN and GFMN and the overcomplex network architecture of FMCN, AFMN maintains the simple architecture of FMNN for fast learning and testing while rewriting the membership function, the expansion and contraction rules for hyperbox generation to solve the confusion problems in the hyperbox overlap region. Meanwhile, principle component analysis is adopted to finish dataset dimensionality reduction for increasing learning efficiency. After training, the confidence coefficient of each hyperbox is calculated based on the distribution of samples. During classifying procedure, utilizing adaptive genetic algorithm to complete parameter optimization for AFMN can also fasten the entire procedure than traversal method. For conditions where training samples are insufficient, data core weight updating is indispensible to enhance the robustness of classifier and the modified membership function can adjust itself according to the input varieties. The paper demonstrates the performance of AFMN through substantial examples in terms of classification accuracy and operating speed by comparing it with FMNN, GFMN, and FMCN.

Feature extraction plays an important role in preprocessing procedure in dealing with small sample size problems. Considering the fact that LDA, LPP, and many other existing methods are confined to one case of the data set. To solve this problem, we propose an efficient method in this paper, named global between maximum and local within minimum. It not only considers the global structure of the data set, but also makes the best of the local geometry of the data set through dividing the data set into four domains. This method preserves relations of the nearest neighborhood, as well as demonstrates an excellent performance in classification. Superiority of the proposed method in this paper is manifested in many experiments on data visualization, face representative, and face recognition.

Fractional Calculus (FC) goes back to the beginning of the theory of differential calculus. Nevertheless, the application of FC just emerged in the last two decades, due to the progress in the area of chaos that revealed subtle relationships with the FC concepts. In the field of dynamical systems theory some work has been carried out but the proposed models and algorithms are still in a preliminary stage of establishment. Having these ideas in mind, the paper discusses FC in the study of system dynamics and control. In this perspective, this paper investigates the use of FC in the fields of controller tuning, legged robots, redundant robots, heat diffusion, and digital circuit synthesis.

The flight dynamic equations in mathematics for aircraft response to the adverse weathers, such as wind shear, atmospheric turbulence, and in-flight icing, are nonlinear and unsteady. To effectively analyze the performance degradation and variations in stability of commercial aircraft that encountered these weather hazards, the nonlinear and dynamic (i.e., time dependent) aerodynamic models based on flight data would be needed. In the present paper, a numerical modeling method based on a fuzzy-logic algorithm will be presented to estimate the aerodynamic models for a twin-jet transport by using the flight data from the flight data recorder (FDR). The aerodynamic models having the capability to generate continuous stability derivatives, especially for sensitivity study of unknown factors in adverse weather conditions, will be demonstrated in this paper.

In the past several decades, new-product diffusion models has been an active area of research in marketing (see, e.g., Mahajan, Muller, and Wind 2000, and Mahajan and Wind 1986). Such models are useful because they can provide important insights into the timing of initial purchase of new products by consumers. Much of the work in this area has been spawned by a seminal paper of Bass (1969), in which it was postulated that the trajectory of cumulative adoptions of a new product follows a deterministic function whose instantaneous growth rate depends on two parameters, one of which captures a consumer's intrinsic tendency to purchase, independent of the number of previous adopters, and the other captures a positive force of influence on a consumer by previous adopters. While Bass's model, or the Bass Model (BM), yields an S-shaped cumulative-adoptions curve that has proven to provide excellent empirical fit for a wide range of new-product-adoptions data sets (especially for consumer durables), there also has been a common belief (see, e.g., Eliashberg and Chatterjee 1986) that it would be of interest to have an appropriate stochastic version of his model. The purpose of this paper is to formulate and study a stochastic counterpart of the BM. Inspired by a very early paper of Taga and Isii (1959), we formulate the trajectory of cumulative number of adoptions as a pure birth process with a set of state-dependent birth rates that are judiciously chosen to closely parallel the roles played by the two parameters in the deterministic BM. We demonstrate that with our choice of birth rates, the resulting pure birth process exhibits characteristics that resemble those in the BM. In particular, we show that the fraction of individuals who have adopted the product by time t in our formulation agrees with (converges in probability to) the corresponding deterministic fraction in a BM with the same pair of parameters, when the total number of consumers in the target population approaches infinity. Our formulation, therefore, supports and expands the BM by having explicit micro-level stochastic interactions amongst individual adopters.

The periodic nonuniform sampling plays an important role in digital signal processing and other engineering fields. In this paper, we introduce the Gaussian regularization method to accelerate the convergence rate of periodic nonuniform sampling series. We prove that the truncation error of the Gaussian regularized periodic nonuniform sampling series decays exponentially. Numerical experiments are presented to demonstrate our result.

In order to control pests and eventually maintain the number of pests below the economic threshold, in this paper, based on the nonsmooth dynamical system, a two-stage-structured pest control Filippov model is proposed. We take the total number of juvenile and adult pest population as the control index to determine whether or not to implement chemical control strategies. The sliding-mode domain and conditions for the existence of regular and virtual equilibria, pseudoequilibrium, boundary equilibria, and tangent points are given. Further, the sufficient condition of the locally asymptotic stability of pseudoequilibrium is obtained. By numerical simulations, the local bifurcations of the equilibria are discussed. Our results show that the total number of pest populations can be successfully controlled below the economic threshold by taking suitable threshold policy.

The vibration transmission path systems are generally composed of the vibration source, the vibration transfer path and the vibration receiving structure. The transfer path is the medium of the vibration transmission. Therefore, the uncertainty of path parameters influences the system reliability greatly. In order to avoid the resonance failure, the transmission reliability analysis and the reliability sensitivity analysis are both very important. Based on the reliability theory, the absolute value difference of natural frequency and excitation frequency of random vibration transmission path system was limited and the reliability pattern of the resonance problem was defined in this paper. Applying the generalized second moment technique of vector-valued functions and the stochastic finite element theory, the theoretical analysis method of the transmission reliability and reliability sensitivity was presented. The corresponding vibration transmission path system with uncertain path parameters including mass, stiffness and path position was analyzed theoretically and computed numerically, and then the correlated mathematical expressions were obtained. Thus, in practical project, most of uncertain factors in the vibration systems can be analyzed so that the effective way can be given to avoid resonance failure.

The hydrodynamic coefficients are important parameters for predicting the motion of the glider and upgrading the hull design. In this paper, based on the Reynolds number similarity theory, 6 degrees of freedom (DOFs) of the fluid force and torque of a 1:1 full-scale glider model are measured. The present measurements were carried out at (2 - 14m/s) by varying attack angles and sideslip angles (-9 - 9°), respectively. The measurements were used to study the variation of the hydrodynamics of the glider, and the measurements have also been used to validate results obtained from a CFD code that uses RNG k-ε. The hydrodynamic force coefficients obtained from CFD accord well with the measurements. However, the torque coefficients difference is fairly large. Dynamics simulation results show that CFD results can be used to design and study the motion characteristics of gliders. In order to simplify the design process of gliders, we fit the empirical formula based on the experimental data and obtain a drag coefficient equation with Reynolds number. The influence of two kinds of appendages of the Conductance-Temperature-Depth (CTD) unit and thruster unit on the glider drag were studied by a contrast test. The analysis results can provide reference for design and the motion investigate of gliders.

This paper aims to achieve the accurate prediction of box girder deformation in SCS-enhanced PSC continuous box girder bridges. To this end, the authors proposed a box girder deformation prediction model based on unequal interval grey model (UIGM) and residual composite correction (RCC). Firstly, the tension forces of cables and the deformation data of box girder were regarded as the time sequence and the original unequal interval sequence, respectively, and the UIGM was constructed to predict the box girder deformation. Secondly, the sine function was constructed on the average features of the residual sequence waveform, and the periodic sequence function was generated by harmonic transform. The two functions were employed to extract the implicit periodic information and overcome the limitation of the UIGM (i.e., the UIGM only generates the change rate of a single index). Finally, the Markov chain method was adopted to treat the random fluctuations and further enhance the prediction accuracy and adaptability of the model. Then, the proposed UIGM-RCC was applied to predict the box girder deformation of Dongming Huanghe River Highway Bridge and forecast the settlement of a building mentioned in previous research. The results show that the proposed model can reflect the exact periodicity and random fluctuations of box girder deformation in SCS-enhanced PSC continuous box girder bridges. The research findings provide a meaningful reference for improving deformation prediction accuracy in SCS-enhanced structures.

Singular value (SV) difference is the difference in the singular values between a noisy image and the original image; it varies regularly with noise intensity. This paper proposes an image denoising method using the singular value difference in the wavelet domain. First, the SV difference model is generated for different noise variances in the three directions of the wavelet transform and the noise variance of a new image is used to make the calculation by the diagonal part. Next, the single-level discrete 2-D wavelet transform is used to decompose each noisy image into its low-frequency and high-frequency parts. Then, singular value decomposition (SVD) is used to obtain the SVs of the three high-frequency parts. Finally, the three denoised high-frequency parts are reconstructed by SVD from the SV difference, and the final denoised image is obtained using the inverse wavelet transform. Experiments show the effectiveness of this method compared with relevant existing methods.

Digital watermarking is a technique used to protect an author’s copyright and has become widespread due to the rapid development of multimedia technologies. In this paper, a novel watermarking algorithm using the nonsubsample shearlet transform is proposed, which combines the directional edge features of an image. A shearlet provides an optimal multiresolution and multidirectional representation of an image based on distributed discontinuities such as edges, which ensures that the embedded watermark does not blur the image. In the proposed algorithm, the nonsubsample shearlet transform is used to decompose the cover image into directional subbands, where different directional subbands represent different directional and textured features. The subband whose texture directionality is strongest is selected to carry the watermark and is thus suitable for the human visual system. Next, singular value decomposition is performed on the selected subband image. Finally, the watermark is embedded in the singular value matrix, which is beneficial for the watermarking robustness and invisibility. In comparison with related watermarking algorithms based on discrete wavelet transforms and nonsubsample contourlet transform domains, experimental results demonstrate that the proposed scheme is highly robust against scaling, cropping, and compression.

Segmentation of brain tissues is an important but inherently challenging task in that different brain tissues have similar grayscale values and the intensity of a brain tissue may be confused with that of another one. The paper accordingly develops an ICKFCM method based on kernelized fuzzy c-means clustering with ICA analysis for extracting regions of interest in MRI brain images. The proposed method first removes the skull region using a skull stripping algorithm. Through ICA, three independent components are then extracted from multimodal medical images containing T1-weighted, T2-weighted, and PD-weighted MRI images. As MRI signals can be regarded as a combination of the signals from brain matters, ICA can be used for contrast enhancement of MRI images. Finally, the three independent components are utilized as inputs by KFCM algorithm to extract different brain tissues. Relying on the decomposition of a multivariate signal into independent non-Gaussian components and using a more appropriate kernel-induced distance for fuzzy clustering, the proposed method is capable of achieving greater reliability in both theory and practice than other segmentation approaches. According to the experiment results, the proposed method is capable of accurately extracting the complicated shapes of brain tissues and still remaining robust against various types of noises.

Combining interval-valued hesitant fuzzy soft sets (IVHFSSs) and a new comparative law, we propose a new method, which can effectively solve multiattribute decision-making (MADM) problems. Firstly, a characteristic function of two interval values and a new comparative law of interval-valued hesitant fuzzy elements (IVHFEs) based on the possibility degree are proposed. Then, we define two important definitions of IVHFSSs including the interval-valued hesitant fuzzy soft quasi subset and soft quasi equal based on the new comparative law. Finally, an algorithm is presented to solve MADM problems. We also use the method proposed in this paper to evaluate the importance of major components of the well drilling mud pump.

For infrared images, it is a formidable challenge to highlight salient regions completely and suppress the background noise effectively at the same time. To handle this problem, a novel saliency detection method based on multiscale local sparse representation and local contrast measure is proposed in this paper. The saliency detection problem is implemented in three stages. First, a multiscale local sparse representation based approach is designed for detecting saliency in infrared images. Using it, multiple saliency maps with various scales are obtained for an infrared image. These maps are then fused to generate a combined saliency map, which can highlight the salient region fully. Second, we adopt a local contrast measure based technique to process the infrared image. It divides the image into a number of image blocks. Then these blocks are utilized to calculate the local contrast to generate a local contrast measure based saliency map. In this map, the background noise can be suppressed effectually. Last, to make full use of the advantages of the above two saliency maps, we propose combining them together using an adaptive fusion scheme. Experimental results show that our method achieves better performance than several state-of-the-art algorithms for saliency detection in infrared images.

This paper proposes an image watermarking method based on the fast discrete cosine transform (DCT) algorithm for implementation in digital signal processor. A digital watermark can be effectively embedded and efficiently extracted without the host image. The keys in watermarking process include four frequency coefficients in DCT, two random permutation vectors, and a quantization matrix for normalizing the watermark and the host image. The fast DCT algorithm has been shown to reduce the complexity of two-dimensional image transformation so that embedding/decoding an image watermark can be completed in real time within 0.33 seconds. The quality of both watermarked image and extracted (retrieved) watermark remains excellent. It is shown that the watermarking method is efficient in and robust to data cropping, transmission loss, and compression/decompression.