Neuro-fuzzy approach to processing inputs with missing values in pattern recognition problems

An approach to dealing with missing data, both during the design and normal operation of a neuro-fuzzy classifier is presented in this paper. Missing values are processed within a general fuzzy min–max neural network architecture utilising hyperbox fuzzy sets as input data cluster prototypes. An emphasis is put on ways of quantifying the uncertainty which missing data might have caused. This takes a form of classification procedure whose primary objective is the reduction of a number of viable alternatives rather than attempting to produce one winning class without supporting evidence. If required, the ways of selecting the most probable class among the viable alternatives found during the primary classification step, which are based on utilising the data frequency information, are also proposed. The reliability of the classification and the completeness of information is communicated by producing upper and lower classification membership values similar in essence to plausibility and belief measures to be found in the theory of evidence or possibility and necessity values to be found in the fuzzy sets theory. Similarities and differences between the proposed method and various fuzzy, neuro-fuzzy and probabilistic algorithms are also discussed. A number of simulation results for well-known data sets are provided in order to illustrate the properties and performance of the proposed approach.     

On the construction of samples for testing approximate optimization methods for estimate calculation algorithms

To validate approximate optimization schemes for estimate calculation algorithms (ECAs), it is necessary to compute the optimal height, which cannot be done in a reasonable amount of time. A variety of samples are built for which the optimal height of the ECAs is known by construction.     

Effect of end groups on complexation kinetics between cyclodextrins and guest polymers

α‐Cyclodextrin (α‐CD) has been complexed with various poly(ethylene glycol) (PEG) derivatives in aqueous solution. It has been found that the end groups of PEG derivatives affect the complexation kinetics greatly, but have only a little influence on the thermodynamic behavior. By increasing the hydrophobicity of end groups, the complexation speeds up rapidly. On the other hand, the bulky end groups slow down the threading of polymeric guests into the cavity of CD. By changing the hydrophobicity and the size of end groups, the complexation rate can be adjusted in the range of several orders of magnitudes, which should be quite useful in the design of new supramolecular systems. © 2006 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 44: 2050–2057, 2006     

Implementation of a Nonzero-order Joint Transform Correlator Using Interferometric Technique

The implementation of a nonzero-order joint transform correlator using the double port Mach-Zehnder interferometric technique is proposed and demonstrated. This approach provides on-line processing for directly removing the zero-order components of a joint power spectrum in one step and performs the nonzero-order optical correlation. Experimental results are presented and discussed.     

Recognition of the Finite Simple Groups F 4(2m) by Spectrum

The spectrum of a finite group is the set of its element orders. A finite group G is said to be recognizable by spectrum, if every finite group with the same spectrum as G is isomorphic to G. The purpose of the paper is to prove that for every natural m the finite simple Chevalley group F ₄(2 ^m ) is recognizable by spectrum.     

Indexing text using the Ziv–Lempel trie

Let a text of u characters over an alphabet of size σ be compressible to n phrases by the LZ78 algorithm. We show how to build a data structure based on the Ziv–Lempel trie, called the LZ-index, that takes 4nlog₂n(1+o(1)) bits of space (that is, 4 times the entropy of the text for ergodic sources) and reports the R occurrences of a pattern of length m in worst case time O(m³logσ+(m+R)logn). We present a practical implementation of the LZ-index, which is faster than current alternatives when we take into consideration the time to report the positions or text contexts of the occurrences found.     

Maximum norms of random sums and transient pattern formation

Many interesting and complicated patterns in the applied sciences are formed through transient pattern formation processes. In this paper we concentrate on the phenomenon of spinodal decomposition in metal alloys as described by the Cahn-Hilliard equation. This model depends on a small parameter, and one is generally interested in establishing sharp lower bounds on the amplitudes of the patterns as the parameter approaches zero. Recent results on spinodal decomposition have produced such lower bounds. Unfortunately, for higher-dimensional base domains these bounds are orders of magnitude smaller than what one would expect from simulations and experiments. The bounds exhibit a dependence on the dimension of the domain, which from a theoretical point of view seemed unavoidable, but which could not be observed in practice.

In this paper we resolve this apparent paradox. By employing probabilistic methods, we can improve the lower bounds for certain domains and remove the dimension dependence. We thereby obtain optimal results which close the gap between analytical methods and numerical observations, and provide more insight into the nature of the decomposition process. We also indicate how our results can be adapted to other situations.

     

机器人头部的视觉跟踪系统研究

对运动目标进行识别和跟踪是机器人视觉的一项关键技术。提出了一种可以快速跟踪运动目标的系统设计方案,采用了双计算机处理和Memolink通信方式的机器人控制结构,以图像处理为基础,在图像经过校正之后,通过区域分割和目标识别两个步骤来确定目标的位置,并控制机器人对目标进行跟踪。实验表明,该方法具有较高的速度和准确性。     

Photo-induced evolution of copper sheets from cluster molecules and its application to photolithographic copper patterning

UV photoexcitation of (t-butylethynyl copper)₂₄ cluster films induces segregation of the crystals into metallic and organic phases and leads to evolve the metallic sheets sandwiched by organic polymers. The growth of the metallic crystals in the plane of the photo-electromagnetic field is attributed due to plasmon-plasmon interaction among nanoparticles embedded in dielectric polymer matrices. The surface enhanced photochemical reaction of residual cluster molecules on the photon incident direction is expected to take an important role for joining the metal particles to produce a metallic sheet. We can apply this phenomenon for photolithographic copper pattern generation on a flexible base plate.     

Dynamic fractal unifying interaction confirmed with magnetospheric behavior and orbital data

The solar wind makes the magnetosphere to expand and contract as indicated by the expansions and contractions of the auroral oval due to balancing of the dynamic pressure of the ambient space plasma at inner and outer magnetic lines. This self‐similar magnetospheric behavior elucidates the controversial magnetic storm‐substorm relationship and reveals the 3D‐spiral structure of magnetic interaction. The found self‐similarly evolving structure of one seen as fundamental interaction suggests dynamic fractal unifying interaction that builds a firework universe having 3D‐spiral code. The unifying interaction is described with equation drawn in new fundamental dynamic fractal framework. The equation of unifying interaction converges to the inverse square laws and the principle of uncertainty at laboratory scales. The dynamic fractal fundamental framework is made of one 3D‐spirally‐faster‐inward contracting and expanding, oscillating, basic matter. It simply accounts for observed constant speed of light and for the creation of bright and dark bands on a screen behind a tiny slit. The dynamic fractal framework is quantitatively confirmed with the orbital data for the Milky Way Galaxy, the Sun, the Earth, and the triple asteroid system 87 Sylvia. Many testable predictions are also made. The presented new fundamental dynamic fractal framework allows qualitative and quantitative modeling and simplification. © 2007 Wiley Periodicals, Inc. Complexity 12: 61–76, 2007