Intuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata

Intuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata are discussed. The notions of intuitionistic fuzzy recognizer, complete accessible intuitionistic fuzzy recognizer, intuitionistic fuzzy finite automata, deterministic intuitionistic fuzzy finite automata, and intuitionistic fuzzy language are introduced. It is shown that the languages recognized by intuitionistic fuzzy recognizer are regular, and the intuitionistic fuzzy languages recognized by the intuitionistic fuzzy finite automaton and the intuitionistic fuzzy languages recognized by deterministic intuitionistic fuzzy finite automaton are equivalent. This work is supported by National Science Foundation of China (Grant No.10571112), “TRAPOYT” of China and National 973 Foundation Research Program(Grant No.2002CB312200).     

On languages accepted by space-bounded oracle machines

Characterizations of classes of languages accepted by space-bounded oracle machines are developed. These characterizations are given in terms of the regular sets, certain information about the oracle set, and certain algebraic closure operations.This research was supported in part by the National Science Foundation under Grant MCS77-11360     

On the 2<Superscript>m</Superscript>-variable symmetric Boolean functions with maximum algebraic immunity

The properties of the 2m-variable symmetric Boolean functions with maximum al- gebraic immunity are studied in this paper. Their value vectors, algebraic normal forms, and algebraic degrees and weights are all obtained. At last, some necessary conditions for a symmetric Boolean function on even number variables to have maximum algebraic immunity are introduced.     

基于量子逻辑的下推自动机的代数刻画

首先,本文提出量子下推自动机（简记为L-VPDA）的概念,从代数角度出发详细研究了此类自动机的性质,同时建立此类自动机的代数刻画,即利用量子状态构造证明了任意L-VPDA与状态转移为经典函数且具有量子终状态的L-VPDA间的相互等价性;其次详细研究了量子上下文无关语言的代数刻画以及对于正则运算的封闭性。     

A novel algorithm for explicit optimal multi-degree reduction of triangular surfaces

This paper introduces the algebraic property of bivariate orthonormal Jacobi polynomials into geometric approximation. Based on the latest results on the transformation formulae between bivariate Bernstein polynomials and Jacobi polynomials, we naturally deduce a novel algorithm for multi-degree reduction of triangular B~zier surfaces. This algorithm possesses four characteristics： ability of error forecast, explicit expression, less time consumption, and best precision. That is, firstly, whether there exists a multi-degree reduced surface within a prescribed tolerance is judged beforehand; secondly, all the operations of multi-degree reduction are just to multiply the column vector generated by sorting the series of the control points of the original surface in lexicographic order by a matrix; thirdly, this matrix can be computed at one time and stored in an array before processing degree reduction; fourthly, the multi-degree reduced surface achieves an optimal approximation in the norm L2. Some numerical experiments are presented to validate the effectiveness of this algorithm, and to show that the algorithm is applicable to information processing of products in CAD system.     

Globally exponentially attractive sets of the family of Lorenz systems

In this paper, the concept of globally exponentially attractive set is proposed and used to consider the ultimate bounds of the family of Lorenz systems with varying parameters. Explicit estimations of the ultimate bounds are derived. The results presented in this paper contain all the existing results as special cases. In particular, the critical cases, b→ 1^＋ and a→0^＋, for which the previous methods failed, have been solved using a unified formula.     

Lukasiewicz逻辑值上下文无关语言的代数刻画

提出了基于Lukasiewicz逻辑的下推自动机（l-VPDA）的概念,从代数角度研究了此类自动机的性质,同时建立此类自动机的代数刻画,即利用模糊状态构造,证明了任意以终状态方式接受模糊语言的l-VPDA与状态转移为经典函数且具有l值模糊终状态的l-VPDA间的相互等价性;并证明任意以空栈方式接受模糊语言的l-VPDA与状态转移除一步转移为模糊的以外,其余都是经典函数的l-VPDA是相互等价的;详细研究了l-值模糊上下文无关语言的代数和层次刻画,以及对于正则运算的封闭性。     

A pure quasi-human algorithm for solving the cuboid packing problem

We excavate the wisdom from an old Chinese proverb “gold corner, silver side and strawy void”, and further improve it into “maximum value in diamond cave” for solving the NP-hard cuboid packing problem. We extract, integrate and formalize the idea by west modern mathematical tools, and propose a pure quasi-human algorithm. The performance of the algorithm is evaluated on two sets of public benchmarks. For 100 strongly heterogeneous difficult benchmarks, experiments show an average packing utilization of 87.31%, which surpasses current best record reported in the literature by 1.83%. For 47 difficult benchmarks without orientation constraint, experiments show an average volume utilization of 92.05%, which improves current best record reported in the literature by 1.05%. Supported by the National Natural Science Foundation of China (Grant No. 60773194), the National Basic Research Program of China (Grant No. 2004CB318000), and Postdoctoral Science Foundation of China (Grant No. 20070420174)     

A new algebraic modelling approach to distributed problem-solving in MAS

This paper is devtoed to a new algebraic modelling approach to distributed problem-solving in multi-agent systems(MAS),which is featured by a unified framework for describing and treating social behaviors,social dynamics and social intelligence.A coneptual architecture of algebraic modelling is presented.The algebraic modelling of typical social be-haviors,social situation and social dynamics is discussed in the context of distributed problem-solving in MAS .The comparison and simulation on distributed task allocations and resource assignments in MAS show more advantages of the algebraic approach than other conventional methods.     

Time required for garbage collection in retention block-structured languages

This paper investigates the time requirements for an implementation of retention block-structured languages that uses a garbage collector as its sole means for recovering inaccessible storage. The usual three-pass markcompactify-and-update garbage collector is optimized to eliminate the need for the third pass in the event that the executed program is lifetime well-stacking.Supported (in part) by the United States Energy Research and Development Administration, Contract No. E(04-3)-34, PA 214, and (in part) by the National Science Foundation, Grant No. DCR75-08659.     

格值有限状态机的一些性质

讨论格值有限状态机强连通性、循环性、完全性以及交换性等一些代数性质,证明若两个格值有限状态机之间存在满足一定条件的同态映射时,它们之间的这些性质之间的关系,还给出了格值有限状态机的一些积的定义,以及对积的一些性质进行了讨论,也得到了一些结果。     

A Note on Non-Closure Property of Sublogarithmic Space-Bounded 1-Inkdot Alternating Pushdown Automata with Only Existential (Universal) States

1-inkdot alternating pushdown automaton is a slightly modified alternating pushdown automaton with the additional power of marking at most 1 tape-cell on the input （with an inkdot） once. This paper investigates the closure property of sublogarithmic space-bounded 1-inkdot alternating pushdown automata with only existential （universal） states, and shows, for example, that for any function L（n） such that L（n） ≥ log logn and L（n） = o（log n）, the class of sets accepted by weakly （strongly） L（n） space-bounded 1-inkdot two-way alternating pushdown automata with only existential （universal） states is not closed under concatenation with regular sets, length-preserving homomorphism, and Kleene closure.     

SKY: efficient peer-to-peer networks based on distributed Kautz graphs

Many proposed P2P networks are based on traditional interconnection topologies. Given a static topology, the maintenance mechanism for node join/departure is critical to designing an efficient P2P network. Kautz graphs have many good properties such as constant degree, low congestion and optimal diameter. Due to the complexity in topology maintenance, however, to date there have been no effective P2P networks that are proposed based on Kautz graphs with base > 2. To address this problem, this paper presents the “distributed Kautz (D-Kautz) graphs”, which adapt Kautz graphs to the characteristics of P2P networks. Using the D-Kautz graphs we further propose SKY, the first effective P2P network based on Kautz graphs with arbitrary base. The effectiveness of SKY is demonstrated through analysis and simulations. Supported partially by the National Natural Science Foundation of China (Grant Nos. 60673167 and 60703072), the Hunan Provincial Natural Science Foundation of China (Grant No. 08JJ3125), and the National Basic Research Program of China (973) (Grant No. 2005CB321801)     

A 485ps 64-Bit Parallel Adder in 0.18$\mu$m CMOS

This paper presents an optimized 64-bit parallel adder. Sparse-tree architecture enables low carry-merge fan-outs and inter-stage wiring complexity. Single-rail and semi-dynamic circuit improves operation speed. Simulation results show that the proposed adder can operate at 485ps with power of 25.6mW in 0.18μm CMOS process. It achieves the goal of higher speed and lower power.     

Synthetic aperture radar tomography sampling criteria and three-dimensional range migration algorithm with elevation digital spotlighting

Based on the general geometric model of multi-baseline Synthetic Aperture Radar Tomography (To-moSAR), the three-dimensional (3-D) sampling criteria, the analytic expression of the 3-D Point Spread Function (PSF) and the 3-D resolution are derived in the 3-D wavenumber domain in this paper. Considering the relationship between the observation geometry and the size of illuminated scenario, a 3-D Range Migration Algorithm with Elevation Digital Spotlighting (RMA-EDS) is proposed. With this algo-rithm 3-D imag...     

Network-based reconfiguration routes for a self-reconfigurable robot

This paper presents a network-based analysis approach for the reconfiguration problem of a self-reconfigurable robot. The self-reconfigurable modular robot named ＂AMOEBA-I＂ has nine kinds of non-isomorphic configurations that consist of a configuration network. Each configuration of the robot is defined to be a node in the weighted and directed configuration network. The transformation from one configuration to another is represented by a directed path with nonnegative weight. Graph theory is applied in the reconfiguration analysis, where reconfiguration route, reconfigurable matrix and route matrix are defined according to the topological information of these configurations. Algorithms in graph theory have been used in enumerating the available reconfiguration routes and deciding the best reconfiguration route. Numerical analysis and experimental simulation results prove the validity of the approach proposed in this paper. And it is potentially suitable for other self-reconfigurable robots＇ configuration control and reconfiguration planning.     

Perfect forward secure identity-based authenticated key agreement protocol in the escrow mode

The majority of existing escrowable identity-based key agreement protocols only provide partial forward secrecy. Such protocols are, arguably, not suitable for many real-word applications, as the latter tends to require a stronger sense of forward secrecy—perfect forward secrecy. In this paper, we propose an efficient perfect forward-secure identity-based key agreement protocol in the escrow mode. We prove the security of our protocol in the random oracle model, assuming the intractability of the Gap Biline...     

On detection performance of MIMO radar for Rician target

By using spatial diversity, multiple-input-multiple-output (MIMO) radar can improve detection performance for fluctuating targets. In this paper, we propose a spatial fluctuation target model for MIMO radar, where targets are classified as non-fluctuating target, Rayleigh target and Rician target. Based on Stein’s lemma, we use relative entropy to study detection performance of optimum detector for Rician target. It is found that in low signal noise ratio (SNR) region, the performance improvement of MIMO ra...     

A novel strong tracking finite-difference extended Kalman filter for nonlinear eye tracking

Non-intrusive methods for eye tracking are important for many applications of vision-based human computer interaction. However, due to the high nonlinearity of eye motion, how to ensure the robustness of external interference and accuracy of eye tracking poses the primary obstacle to the integration of eye movements into todays’s interfaces. In this paper, we present a strong tracking finite-difference extended Kalman filter algorithm, aiming to overcome the difficulty in modeling nonlinear eye tracking. In filtering calculation, strong tracking factor is introduced to modify a priori covariance matrix and improve the accuracy of the filter. The filter uses finite-difference method to calculate partial derivatives of nonlinear functions for eye tracking. The latest experimental results show the validity of our method for eye tracking under realistic conditions. Supported by the National Natural Science Foundation of China (Grant No. 60572027), the Outstanding Young Researchers Foundation of Sichuan Province (Grant No. 03ZQ026-033), the Program for New Century Excellent Talents in University of China (Grant No. NCET-05-0794), and the Young Teacher Foundation of Mechanical School (Grant No. MYF0806)     

Removing local irregularities of triangular meshes with highlight line models

The highlight line model is a powerful tool in assessing the quality of a surface. It increases the flexibility of an interactive design environment. In this paper, a method to generate a highlight line model on an arbitrary triangular mesh is presented. Based on the highlight line model, a technique to remove local shape irregularities of a triangular mesh is then presented. The shape modification is done by solving a minimization problem and performing an iterative procedure. The new technique improves not only the shape quality of the mesh surface, but also the shape of the highlight line model. It provides an intuitive and yet suitable method for locally optimizing the shape of a triangular mesh. Supported by National Science Foundation of China (Grant Nos. 60533070, 60625202), National Basic Research Program of China (Grant No. 2004CB719400), National High-Tech Research & Development Program of China (Grant No. 2007AA040401), Fok Ying Tung Education Foundation (Grant No. 111070), National Science Foundation of USA (Grant Nos. DMI-0422126, DMS-0310645), and Kentucky Science & Technology Corporation (Grant No. COMM-Fund-712)