In dealing with model predictive controllers (MPC), controller tuning is a key design step. Various tuning methods are proposed in the literature which can be categorized as heuristic, numerical and analytical methods. Among the available tuning methods, analytical approaches are more interesting and useful. This paper is based on a proposed analytical MPC tuning approach for plants can be appr...

From a heuristic calculation of the leading order essential singularity in the distribution of Yang-Lee zeroes, we obtain new scaling relations near the ferromagnetic-Griffiths transition, including the prediction of a discontinuity on the analogue of the critical isotherm. We show that experimental data for the magnetization and heat capacity of La(0.7)Ca(0.3)MnO(3) are consistent with these p...

Based on Jiles–Atherton theory and the quadratic law, a displacement model for giant magnetostrictive actuators (GMA) has been developed. The Runge–Kutta method is used to solve nonlinear differential equation of hysteresis in segmented magnetic field. Aiming at problem that parameters are coupled with each other difficult estimate, heuristic intelligent search algorithm-differential evolution ...

In order to monitor the use of network transmission software, the network penetrating technique based on encrypted proxy is discussed. By comparing the behavior of related penetration software, the concept of communication fingerprint is introduced to expand the extension of the communication features. The fingerprints database of encrypted proxy software with specific characteristics is constr...

The Usability Pattern Inspection (UPI) is a new usability inspection method designed for the added downstream utility of producing concrete design recommendations. This paper provides first empirical evidence that UPI measures up to the established inspection method Heuristic Evaluation (HE) regarding defect identification. It is shown that there is also some potential for synergy between UPI a...

In statistical term extraction systems the identification and selection of nested term candidates often presents a challenge. The paper presents an implementation and evaluation of C-value, a heuristic that ranks and/or discards nested terms according to their stability in the corpus. The method was tested for English and Slovene, for both the overall performance of the term extractor improved ...

We investigate the problem of topology design of an optical network by bottleneck-cut identification. For an optical network, the topology-design problem can be viewed as a combined two-layer design problem: physical-topology design and virtual-topology design. In this study, we present the definition of bottleneck cut of an optical network. A heuristic algorithm is proposed to find the bottlen...

This paper reports the corpus-oriented development of a wide-coverage Japanese HPSG parser. We first created an HPSG treebank from the EDR corpus by using heuristic conversion rules, and then extracted lexical entries from the treebank. The grammar developed using this method attained wide coverage that could hardly be obtained by conventional manual development. We also trained a statistical p...

We propose a new heuristic for vertex ordering and a method that splits the vertex ordering into clusters. We apply them to the graph partitioning problem. The application of these ideas incorporates reordering in genetic algorithms and the identification of clustered structures in graphs. Experimental tests on benchmark graphs showed that the new vertex-ordering scheme performed better than ex...