Category: Uncategorized

Optimizing Capacitance Ratio Assignment for Low-Sensitivity SC Filter Implementation

Accurate capacitance matching is essential for switched-capacitor filters implementation because the filter coefficients depend upon the capacitance ratios. The use of identical unit capacitors in parallel to form larger capacitances and careful layout…

Accurate capacitance matching is essential for switched-capacitor filters implementation because the filter coefficients depend upon the capacitance ratios. The use of identical unit capacitors in parallel to form larger capacitances and careful layout design can provide, in many cases, an accuracy of 0.1%. Unfortunately, this technique can be directly applied only if the filter coefficients are rational numbers. In general, coefficient approximations are required, leading to frequency response errors. In this paper, a new design method, using a genetic algorithm, is proposed to find the optimum capacitance ratio approximations by rational numbers which minimize the total number of unit capacitors for a given acceptable frequency response error, in order to save die area.

Expensive Multiobjective Optimization by MOEA/D With Gaussian Process Model

In some expensive multiobjective optimization problems (MOPs), several function evaluations can be carried out in a batch way. Therefore, it is very desirable to develop methods which can generate multipler test points simultaneously. This paper propos…

In some expensive multiobjective optimization problems (MOPs), several function evaluations can be carried out in a batch way. Therefore, it is very desirable to develop methods which can generate multipler test points simultaneously. This paper proposes such a method, called MOEA/D-EGO, for dealing with expensive multiobjective optimization. MOEA/D-EGO decomposes an MOP in question into a number of single-objective optimization subproblems. A predictive model is built for each subproblem based on the points evaluated so far. Effort has been made to reduce the overhead for modeling and to improve the prediction quality. At each generation, MOEA/D is used for maximizing the expected improvement metric values of all the subproblems, and then several test points are selected for evaluation. Extensive experimental studies have been carried out to investigate the ability of the proposed algorithm.

Chemical-Reaction-Inspired Metaheuristic for Optimization

We encounter optimization problems in our daily lives and in various research domains. Some of them are so hard that we can, at best, approximate the best solutions with (meta-) heuristic methods. However, the huge number of optimization problems and …

We encounter optimization problems in our daily lives and in various research domains. Some of them are so hard that we can, at best, approximate the best solutions with (meta-) heuristic methods. However, the huge number of optimization problems and the small number of generally acknowledged methods mean that more metaheuristics are needed to fill the gap. We propose a new metaheuristic, called chemical reaction optimization (CRO), to solve optimization problems. It mimics the interactions of molecules in a chemical reaction to reach a low energy stable state. We tested the performance of CRO with three nondeterministic polynomial-time hard combinatorial optimization problems. Two of them were traditional benchmark problems and the other was a real-world problem. Simulation results showed that CRO is very competitive with the few existing successful metaheuristics, having outperformed them in some cases, and CRO achieved the best performance in the real-world problem. Moreover, with the No-Free-Lunch theorem, CRO must have equal performance as the others on average, but it can outperform all other metaheuristics when matched to the right problem type. Therefore, it provides a new approach for solving optimization problems. CRO may potentially solve those problems which may not be solvable with the few generally acknowledged approaches.

Robust path tracking control of mobile robot via dynamic petri recurrent fuzzy neural network

Abstract  This study focuses on the design of robust path tracking control for a mobile robot via a dynamic Petri recurrent fuzzy neural
network (DPRFNN). In the DPRFNN, the concept of a Petri net (PN) and the recurrent frame of internal fee…

Abstract  

This study focuses on the design of robust path tracking control for a mobile robot via a dynamic Petri recurrent fuzzy neural
network (DPRFNN). In the DPRFNN, the concept of a Petri net (PN) and the recurrent frame of internal feedback loops are incorporated
into a traditional fuzzy neural network (FNN) to alleviate the computation burden of parameter learning and to enhance the
dynamic mapping of network ability. This five-layer DPRFNN is utilized for the major role in the proposed control scheme,
and the corresponding adaptation laws of network parameters are established in the sense of projection algorithm and Lyapunov
stability theorem to ensure the network convergence as well as stable control performance without the requirement of detailed
system information and the compensation of auxiliary controllers. In addition, the effectiveness of the proposed robust DPRFNN
control scheme is verified by experimental results of a differential-driving mobile robot under different moving paths and
the occurrence of uncertainties, and its superiority is indicated in comparison with a stabilizing control system.

  • Content Type Journal Article
  • DOI 10.1007/s00500-010-0607-x
  • Authors
    • Rong-Jong Wai, Yuan Ze University Department of Electrical Engineering and Fuel Cell Center Chung Li Taiwan, ROC
    • Chia-Ming Liu, Yuan Ze University Department of Electrical Engineering and Fuel Cell Center Chung Li Taiwan, ROC
    • You-Wei Lin, Yuan Ze University Department of Electrical Engineering and Fuel Cell Center Chung Li Taiwan, ROC

Comment on: robust stability of stochastic genetic regulatory networks with discrete and distributed delays

Abstract  This comment points out to some mistakes in the main theorem of Wang (Soft Comput, 13(12):1199–1208, 2009) concerning stochastic
robust stability of genetic regulatory networks (GRNs). The inequalities in the theorem are not LMIs…

Abstract  

This comment points out to some mistakes in the main theorem of Wang (Soft Comput, 13(12):1199–1208, 2009) concerning stochastic
robust stability of genetic regulatory networks (GRNs). The inequalities in the theorem are not LMIs. Moreover, the proof
of theorem is based on a sector condition that was expressed incorrectly and thus invalidates the proof. The correct LMIs
are provided in this comment.

  • Content Type Journal Article
  • DOI 10.1007/s00500-010-0608-9
  • Authors
    • Alireza Salimpour, Tarbiat Modares University Intelligent Control Systems Laboratory, School of Electrical and Computer Engineering P.O. Box 14115-194 Tehran Iran
    • Vahid Johari Majd, Tarbiat Modares University Intelligent Control Systems Laboratory, School of Electrical and Computer Engineering P.O. Box 14115-194 Tehran Iran
    • Mahdi Sojoodi, Tarbiat Modares University Intelligent Control Systems Laboratory, School of Electrical and Computer Engineering P.O. Box 14115-194 Tehran Iran

A definition for I-fuzzy partitions

Abstract  In this paper, we define I-fuzzy partitions (or intuitionistic fuzzy partitions as called by Atanassov or interval-valued
fuzzy partitions). As our ultimate goal is to compare the results of standard fuzzy clustering algorithms (e….

Abstract  

In this paper, we define I-fuzzy partitions (or intuitionistic fuzzy partitions as called by Atanassov or interval-valued
fuzzy partitions). As our ultimate goal is to compare the results of standard fuzzy clustering algorithms (e.g. fuzzy c-means), we define a method to construct them from a set of fuzzy clusters obtained from several executions of fuzzy c-means. From a practical point of view, the approach presented here tries to solve the difficulty of comparing the results
of fuzzy clustering methods and, in particular, the difficulty of finding the global optimal.

  • Content Type Journal Article
  • DOI 10.1007/s00500-010-0605-z
  • Authors
    • Vicenç Torra, CSIC, Spanish Council for Scientific Research IIIA, Institut d’Investigació en Intel-ligència Artificial Campus de Bellaterra 08193 Bellaterra Catalonia Spain
    • Sadaaki Miyamoto, University of Tsukuba Department of Risk Engineering, School of Systems and Information Engineering Tsukuba Ibaraki 305-8573 Japan

State BL-algebras

Abstract  The concept of a state MV-algebra was firstly introduced by Flaminio and Montagna (An algebraic approach to states on MV-algebras.
In: Novák V (ed) Fuzzy logic 2, proceedings of the 5th EUSFLAT conference, September 11–14, Ostra…

Abstract  

The concept of a state MV-algebra was firstly introduced by Flaminio and Montagna (An algebraic approach to states on MV-algebras.
In: Novák V (ed) Fuzzy logic 2, proceedings of the 5th EUSFLAT conference, September 11–14, Ostrava, vol II, pp 201–206, 2007; Int J Approx Reason 50:138–152, 2009) as an MV-algebra with internal state as a unary operation. Di Nola and Dvurečenskij (Ann Pure Appl Logic 161:161–173, 2009a; Math Slovaca 59:517–534, 2009b) gave a stronger version of a state MV-algebra. In the present paper, we introduce the notion of a state BL-algebra, or more
precisely, a BL-algebra with internal state. We present different types of state BL-algebras, like strong state BL-algebras
and state-morphism BL-algebras, and we study some classes of state BL-algebras. In addition, we give a sample of important
examples of state BL-algebras and present some open problems.

  • Content Type Journal Article
  • DOI 10.1007/s00500-010-0571-5
  • Authors
    • Lavinia Corina Ciungu, Polytechnical University of Bucharest Splaiul Independenţei 113 Bucharest Romania
    • Anatolij Dvurečenskij, Slovak Academy of Sciences Mathematical Institute Štefánikova 49 814 73 Bratislava Slovakia
    • Marek Hyčko, Slovak Academy of Sciences Mathematical Institute Štefánikova 49 814 73 Bratislava Slovakia

Quantum security in wireless sensor networks

Abstract  Security in sensor networks, though an important issue for widely available wireless networks, has been studied less extensively
than other properties of these networks, such as, for example, their reliability. The few security sch…

Abstract  

Security in sensor networks, though an important issue for widely available wireless networks, has been studied less extensively
than other properties of these networks, such as, for example, their reliability. The few security schemes proposed so far
are based on classical cryptography. In contrast, the present paper develops a new security solution, based on quantum cryptography.
The scheme developed here comes with the advantages quantum cryptography has over classical cryptography, namely, effectively
unbreakable keys and therefore effectively unconditionally secure messages. Our security system ensures privacy of the measured
data field in the presence of an intruder who listens to messages broadcast in the field.

  • Content Type Journal Article
  • DOI 10.1007/s11047-010-9190-4
  • Authors
    • Naya Nagy, School of Computing, Queen’s University, Kingston, ON K7L 3N6, Canada
    • Marius Nagy, School of Computing, Queen’s University, Kingston, ON K7L 3N6, Canada
    • Selim G. Akl, School of Computing, Queen’s University, Kingston, ON K7L 3N6, Canada

Output concepts for accelerated Turing machines

Abstract  The accelerated Turing machine (ATM) is the work-horse of hypercomputation. In certain cases, a machine having run through
a countably infinite number of steps is supposed to have decided some interesting question such as the Twin …

Abstract  

The accelerated Turing machine (ATM) is the work-horse of hypercomputation. In certain cases, a machine having run through
a countably infinite number of steps is supposed to have decided some interesting question such as the Twin Prime conjecture.
One is, however, careful to avoid unnecessary discussion of either the possible actual use by such a machine of an infinite
amount of space, or the difficulty (even if only a finite amount of space is used) of defining an outcome for machines acting
like Thomson’s lamp. It is the authors’ impression that insufficient attention has been paid to introducing a clearly defined
counterpart for ATMs of the halting/non-halting dichotomy for classical Turing computation. This paper tackles the problem
of defining the output, or final message, of a machine which has run for a countably infinite number of steps. Non-standard
integers appear quite useful in this regard and we describe several models of computation using filters.

  • Content Type Journal Article
  • DOI 10.1007/s11047-010-9197-x
  • Authors
    • Petrus H. Potgieter, Department of Decision Sciences, University of South Africa (Unisa), P.O. Box 392, Pretoria, 0003 South Africa
    • Elemér E. Rosinger, Department of Mathematics and Applied Mathematics, University of Pretoria, Pretoria, 0002 South Africa