Fuzzy rule base systems verification using high-level Petri nets

In this paper, we propose a Petri nets formalism for the verification of rule-based systems. Typical structural errors in a rule-based system are redundancy, inconsistency, incompleteness, and circularity. Since our verification is based on Petri nets and their incidence matrix, we need to transform rules into a Petri nets first, then derive an incidence matrix from the net. In order to let fuzzy rule-based systems detect above the structural errors, we are presenting a Petri-nets-based mechanism. This mechanism consists of three phases: rule normalization, rules transformation, and rule verification. Rules will be first normalized into Horn clauses, then transform the normalized rules into a high-level Petri net, and finally we verify these normalized rules. In addition, we are presenting our approach to simulate the truth conditions which still hold after a transition firing and negation in Petri nets for rule base modeling. In this paper, we refer to fuzzy rules as the rules with certainty factors, the degree of truth is computed in an algebraic form based on state equation which can be implemented in matrix computation in Petri nets. Therefore, the fuzzy reasoning problems can be transformed as the liner equation problems that can be solved in parallel. We have implemented a Petri nets tool to realize the mechanism presented fuzzy rules in this paper.     

An interactive agent-based system for concept-based web search

Search engines are useful tools in looking for information from the Internet. However, due to the difficulties of specifying appropriate queries and the problems of keyword-based similarity ranking presently encountered by search engines, general users are still not satisfied with the results retrieved. To remedy the above difficulties and problems, in this paper we present a multi-agent framework in which an interactive approach is proposed to iteratively collect a user's feedback from the pages he has identified. By analyzing the pages gathered, the system can then gradually formulate queries to efficiently describe the content a user is looking for. In our framework, the evolution strategies are employed to evolve critical feature words for concept modeling in query formulation. The experimental results show that the framework developed is efficient and useful to enhance the quality of web search, and the concept-based semantic search can thus be achieved.     

Oscillation in nonlinear difference equations

In this paper, we shall discuss oscillatory behavior of the solutions of difference equations, including the self-adjoint second-order linear equation and the discrete version of the nonlinear wave equation. Our work is to give sufficient conditions such that every nontrivial solution of the equations oscillates.     

Optimal Speed-Up Parallel Image Template Matching Algorithms on Processor Arrays with a Reconfigurable Bus System,

The image template matching problem is one of the fundamental problems of and has many practical applications in image processing, pattern recognition, and computer vision. It is a useful operation for filtering, edge detection, image registration, and object detection [13]. In this paper, we first design twoO[(M²/p²)log logM] andO[(M²/p²)+(M/p)log logp] time parallel image template matching algorithms on a 3-D processor array with a reconfigurable bus system usingp²N²processors with each processor containingO(1) andO(M/p) restricted memory for 1 ≤p≤M≤N, respectively, for anN×Ndigital image and anM×Mtemplate. By increasing the number of processors, these two proposed algorithms can be run inO(M²/p²) time for speeding up the time complexity usingp²M^1/cN²andp^2+1/cN²processors, respectively, wherecis a constant andc≥1. Furthermore, anO(1) time can be also obtained from these two proposed algorithms by usingM²+1^/cN²processors. These results improve the best known bounds and achieve both optimal and optimal speed-up in their time and processor complexities.     

Using parallel line information for vision-based landmark location estimation and an application to automatic helicopter landing

An approach to landmark location estimation by computer vision techniques is proposed. The objective is to derive the position and the orientation of the landmark with respect to the vehicle by a single image. Such information is necessary for automatic vehicle navigation. This approach requires lower hardware cost and simple computation. The vanishing points of the parallel lines on the landmark are used to detect the landmark orientation. The detected vanishing points are used to derive the relative orientation between the landmark and the camera, which is then utilized to compute the landmark orientation with respect to the vehicle. The size of the landmark is used to determine the landmark position. Sets of collinear points are extracted from the landmark and their inter-point distances are computed. The positions of the collinear point sets are evaluated and used to determine the landmark position. Landing site location estimation by using the identification marking H on the helicopter landing site for automatic helicopter landing is presented as an application of the proposed approach. Simulations and experiments have been conducted to prove the feasibility of the proposed approach.     

Using mega-fuzzification and data trend estimation in small data set learning for early FMS scheduling knowledge

Provided with plenty of data (experience), data mining techniques are widely used to extract suitable management skills from the data. Nevertheless, in the early stages of a manufacturing system, only rare data can be obtained, and built scheduling knowledge is usually fragile. Using small data sets, this research's purpose is improving the accuracy of machine learning for flexible manufacturing system (FMS) scheduling. The study develops a data trend estimation technique and combines it with mega-fuzzification and adaptive-network-based fuzzy inference systems (ANFIS). The results of the simulated FMS scheduling problem indicate that learning accuracy can be significantly improved using the proposed method involving a very small data set.     

Electrostatic actuation of three-dimensional MEMS mirrors using sidewall electrodes

We propose and demonstrate electrostatic sidewall-electrodes actuation of three-dimensional (3-D) microelectromechanical systems (MEMS) gimbal mirrors. The linearity of the mirror angle dependence on actuation voltage is improved with the sidewall-electrodes actuation. In addition, the undesired spring-softening effect commonly found in electrostatic actuation, where the mirror resonance frequency decreases with increased tilt angle, is significantly reduced. Sidewall actuation enables superior performance of 3-D MEMS mirrors including large pull-in angles, reduced actuation voltages, improved device reliability, and fast switching times.     

The Emotional Integration of Childhood Experience: Physiological, Facial Expressive, and Self-Reported Emotional Response During the Adult Attachment Interview.

Attachment researchers claim that individual differences in how adults talk about their early memories reflect qualitatively distinct organizations of emotion regarding childhood experiences with caregivers. Testing this assumption, the present study examined the relationship between attachment dimensions and physiological, facial expressive, as well as self-reported emotional responses during the Adult Attachment Interview (AAI). Consistent with theoretical predictions, more prototypically secure adults behaviorally expressed and reported experiencing emotion consistent with the valence of the childhood events they described. Insecure adults also showed distinctive and theoretically anticipated forms of emotional response: Dismissing participants evidenced increased electrodermal activity during the interview, a sign of emotional suppression, whereas preoccupied adults showed reliable discrepancies between the valence of their inferred childhood experiences and their facial expressive as well as reported emotion during the AAI. Results substantiate a case that the AAI reflects individual differences in emotion regulation that conceptually parallel observations of attachment relationships in infancy. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

The super-connected property of recursive circulant graphs

In a graph G, a k-container C_k(u,v) is a set of k disjoint paths joining u and v. A k-container C_k(u,v) is k∗-container if every vertex of G is passed by some path in C_k(u,v). A graph G is k∗-connected if there exists a k∗-container between any two vertices. An m-regular graph G is super-connected if G is k∗-connected for any k with 1?k?m. In this paper, we prove that the recursive circulant graphs G(2^m,4), proposed by Park and Chwa [Theoret. Comput. Sci. 244 (2000) 35-62], are super-connected if and only if m≠2.     

DISCRETIZED SUB‐OPTIMAL TRACKER FOR NONLINEAR CONTINUOUS TWO‐DIMENSIONAL SYSTEMS

The discretized quadratic sub‐optimal tracker for nonlinear continuous two‐dimensional (2‐D) systems is newly proposed in this paper. The proposed method provides a novel methodology for indirect digital redesign for nonlinear continuous 2‐D systems with a continuous performance index. This includes the following features: (1) the 2‐D optimal‐linearization approach of the nonlinear 2‐D Roesser's model (RM), (2) the dynamic programming‐based discretized quadratic optimal tracker for linear continuous 2‐D systems, (3) the steady‐state discretized quadratic sub‐optimal tracker for linear continuous 2‐D systems, and (4) the discretized quadratic sub‐optimal tracker for nonlinear continuous 2‐D systems. Illustrative examples are presented to demonstrate the effectiveness of the proposed procedure.