estimates the effect of

ce and technology books to science and technology communication. The analyses show that the breeds and printing numbers of science and technology books are in good situation. They are of great variety, their printing numbers increase steadily; the contents of the books become rich and diversified.     

Computational Intelligence and Games： Challenges and Opportunities

The last few decades have seen a phenomenal increase in the quality, diversity and pervasiveness of computer games. The worldwide computer games market is estimated to be worth around USD 21bn annually, and is predicted to continue to grow rapidly. This paper reviews some of the recent developments in applying computational intelligence （CI） methods to games, points out some of the potential pitfalls, and suggests some fruitful directions for future research.     

预取技术研究进展

World Wide Web(WWW) services have grown to levels where significant delays are expected to happen.Technology like prefetching are likely to help users to personalize their needs ,reducing their waiting times. This paperfirstly describes the architecture of prefetching,then classifies them into three types: based on branch model,based ontree model and others and presents profoundly the basic ideas of some existing prefetching algorithms. Next,several models for controlling the prefetching are introduced. At last,the trend and course concerning the prefetching algo-rithms are concluded.     

Guidelines for creating a rule-based knowledge learning system and their application to a Chinese business card layout analysis

Rule selection has long been a problem of great challenge that has to be solved when developing a rule-based knowledge learning system.Many methods have been proposed to evaluate the eligibility of a single rule based on some criteria.However,in a knowledge learning system there is usually a set of rules,These rules are not independent,but interactive,They tend to affect each other and form a rulesystem.In such case,it is no longer rasonable to isolate each rule from others for evaluation.A best rule according to certain criterion is not always the best one for the whole system.Furthermore,the data in the real world from which people want to create their learning system are often ill-defined and inconsistent.In this case,the completeness and consistency criteria for rule selection are no longer essential.In this paper,some ideas about how to solve the rule-selection problem in a systematic way are proposed.These ideas have been applied in the design of a Chinese business card layout analysis system and gained a goods result on the training data set of 425 images.The implementation of the system and the result are presented in this paper.     

An Efficient Optimization Procedure for Tetrahedral Meshes by Chaos Search Algorithm

A simple and efficient local optimization-based procedure for node reposition-ing/smoothing of three-dimensional tetrahedral meshes is presented.The initial tetrahedral mesh is optimized with respect to a specified element shape measure by chaos search algorithm,which is very effective for the optimization problems with only a few design variables.Examples show that the presented smoothing procedure can provide favorable conditions for local transformation approach and the quality of mesh can be significantly improved by the combination of these two procedures with respect to a specified element shape measure.Meanwhile,several commonly used shape measures for tetrahedral element,which are considered to be equivalent in some weak sense over a long period of time,are briefly re-examined in this paper.Preliminary study indicates that using different measures to evaluate the change of element shape will probably lead to inconsistent result for both well shaped and poorly shaped elements.The proposed smoothing approach can be utilized as an appropriate and effective tool for evaluating element shape measures and their influence on mesh optimization process and optimal solution.     

Common interface for connecting of low profile biometric modules

For improving interoperability and gaining in many more benefits, standard interfaces for connecting modules in Information Technology （IT） are a need. Biometrics is not different from other IT fields. In fact in Biometrics those interfaces are needed at different levels： applications, data interchange, processing modules or sensors. Standardization bodies have already published standards related to data interchange and application programming interfaces （API）, but some others are still missing. Authors present in this paper a first approach for a definition of a common interface for those biometric related modules to be integrated in small and low cost embedded systems. Definition is done at two different levels, leaving open the final implementation, but outlining such implementation with state of the art communication protocols.     

Improved stability criteria on discrete-time systems with time-varying and distributed delays

In this paper, through constructing some novel Lyapunov-Krasovskii functional (LKF) terms and using some effective techniques, two sufficient conditions are derived to guarantee a class of discrete-time time-delay systems with distributed delay to be asymptotically and robustly stable, in which the linear fractional uncertainties are involved and the information on the time-delays is fully utilized. By employing the improved reciprocal convex technique, some important terms can be reconsidered when estimating the time difference of LKF, and the criteria can be presented in terms of linear matrix inequalities (LMIs). Especially, these derived conditions heavily depend on the information of time-delay of addressed systems. Finally, three numerical examples demonstrate that our methods can reduce the conservatism more efficiently than some existing ones.     

Robust adaptive tracking control of robotic systems with uncertainties

To deal with the uncertainty factors of robotic systems, a robust adaptive tracking controller is proposed. The knowledge of the uncertainty factors is assumed to be unidentified; the proposed controller can guarantee robustness to parametric and dynamics uncertainties and can also reject any bounded, immeasurable disturbances entering the system. The stability of the proposed controller is proven by the Lyapunov method. The proposed controller can easily be implemented and the stability of the closed system can be ensured; the tracking error and adaptation parameter error are uniformly ultimately bounded （UUB）. Finally, some simulation examples are utilized to illustrate the control performance.     

AGDL: A Definition Language for Attribute Grammars

AGDL is a definition language for attribute grammars. It is a specification language usedto generate a compiler automatically. AGDL, whose rules are easy to read, is an applicativelanguage with abstract data types, and it will be used as an important tool language to developcompiler generators by NCI.     

The Grade Difference Format and MGM^p （1,n） Optimization Model

There are some applications that need to use the gray system techniques in distributed computing, in the basis of the grade difference format, MGMp （1, n） model is proposed and some precision grade difference formats are obtained. Their relations and the mathematics＇ mechanism are discussed. The error will be interjected to them. In the cases of absolute and comparative error, the gray model, which is a new gray GMGp （1,n） model, is expounded and discussed. The models have nice anti-interference; the example manifests that the model has a good effect.     

A Topology Designing System for a Computer Network

In this paper,some problems on the topology design of network are discussed.An exact formula to calculate the delay of a line will be provided.In the design,the key problem is how to find some efficient heuristic algorithms.To solve this problem,a nonliner-discrete-capacity assignment heuristic and a hybrid perturbation heuristic are suggested.Then,a practical CAD system which helps design the topology of network will be introduced.     

A nontrivial factor in determining current distribution in an ac HTS cable-proximity effect

A superconductor has zero resistance at the superconducting state. This unique property creates many exceptional phenomena, of which some are known and the others are not. Our experiments with multilayer high temperature superconductor (HTS) cable samples revealed a new phenomenon that alternating current had a tendency to flow in the inner and outer layers of the cables. We attribute the cause of this phenomenon to the electromagnetic interaction in an infinite electrical conductivity medium and term it su...     

Evolutionary Optimization: Pitfalls and Booby Traps

Evolutionary computation (EC), a collective name for a range of metaheuristic black-box optimization algorithms, is one of the fastest-growing areas in computer science. Many manuals and "how-to"s on the use of different EC methods as well as a variety of free or commercial software libraries are widely available nowadays. However, when one of these methods is applied to a real-world task, there can be many pitfalls and booby traps lurking - certain aspects of the optimization problem that may lead to unsatisfactory results even if the algorithm appears to be correctly implemented and executed. These include the convergence issues, ruggedness, deceptiveness, and neutrality in the fitness landscape, epistasis, non-separability, noise leading to the need for robustness, as well as dimensionality and scalability issues, among others. In this article, we systematically discuss these related hindrances and present some possible remedies. The goal is to equip practitioners and researchers alike with a clear picture and understanding of what kind of problems can render EC applications unsuccessful and how to avoid them from the start.     

A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs

Algorithms used in data mining and bioinformatics have to deal with huge amount of data efficiently.In many applications,the data are supposed to have explicit or implicit structures.To develop efficient algorithms for such data,we have to propose possible structure models and test if the models are feasible.Hence,it is important to make a compact model for structured data,and enumerate all instances efficiently.There are few graph classes besides trees that can be used for a model.In this paper,we inves...     

Partition pruning for range query on distributed log-structured merge-tree

Log-structured merge tree(LSM-tree)is adopted by many distributed storage systems.It contains a Memtable and a number of SSTables.The Memtable is an in-memory structure and the SSTable is a disk-based structure.Data records are horizontally partitioned over the primary key and stored in different SSTables.Data writes on records are first served by the Memtable and then compacted to SSTables periodically.Although this design optimizes data writes by avoiding random disk writes,it is unfriendly to read request since the results should be retrieved and merged from both Memtable and SSTables.In particular,when the Memtable and SSTables are distributed on different nodes,it incurs expensive costs to serve range queries.A range query on nonprimary key columns has to scan all partitions,which generates many network and I/O expenses.In this paper,we propose a partition pruning strategy to save cost for range queries.A statistics cache is designed to determine whether a partition contains the desired data or not,which enables read requests to avoid scanning useless partitions.As records can be updated in Memtable freely,to prevent incorrect filtering,a version-based cache synchronization strategy is proposed to ensure the queries to obtain the latest data state.We implement the proposed method in an open source distributed database and conduct comprehensive experiments.Experimental results reveal that the performance of range queries increased 30%~40%with our partition pruning technique.     

Improvement and Implementation of Network Intrusion Detection System

Current network intrusion detection systems （NIDSes） are confronted with some problems. In addition to high false positive ratio and high false negative ratio, their own performances are difficult to be adapted to the need of increasing network traffic. To improve the speed and accuracy of detection, this paper analyzes the NIDS firstly, and secondly presents and implements two improved schemes from string matching algorithms and the structure of intrusion signature library. Experimental results show that our schemes are feasible.     

Analysis of affinely equivalent Boolean functions

By some basic transforms and invariant theory, we give two results: 1) an algorithm, which can be used to judge if two Boolean functions are affinely equivalent and to obtain the equivalence relationship if they are equivalent. This is useful in studying Boolean functions and in engineering. For example, we classify all 8-variable homogeneous bent functions of degree 3 into two classes; 2) Reed-Muller codes R(4,6)/R(1,6), R(3,7)/R(1,7) are classified efficiently.     

Forward-Backward Search Method

In order to simulate the process of man's“thinking forward and backward”,this paperdescribes a new search method-forward-backward search.The relationship between this searchmethod and two others,namely,statespace search and problem-reduction search,is alsodiscussed.Some examples of using forward-backward search are given,from which thecharacteristics and efficiency of this method can be seen.     

Review:Advances in the control of mechatronic suspension systems

The suspension system is a key element in motor vehicles. Advancements in electronics and microprocessor technology have led to the realization of mechatronic suspensions. Since its introduction in some production motorcars in the 1980 s, it has remained an area which sees active research and development, and this will likely continue for many years to come. With the aim of identifying current trends and future focus areas, this paper presents a review on the state-of-the-art of mechatronic suspensions. First, some commonly used classifications of mechatronic suspensions are presented. This is followed by a discussion on some of the actuating mechanisms used to provide control action. A survey is then reported on the many types of control approaches, including look-ahead preview, predictive, fuzzy logic, proportional–integral–derivative(PID), optimal, robust, adaptive, robust adaptive,and switching control. In conclusion, hydraulic actuators are most commonly used, but they impose high power requirements, limiting practical realizations of active suspensions. Electromagnetic actuators are seen to hold the promise of lower power requirements, and rigorous research and development should be conducted to make them commercially usable. Current focus on control methods that are robust to suspension parameter variations also seems to produce limited performance improvements, and future control approaches should be adaptive to the changeable driving conditions.     

The Global Properties of Valid Formulas in Modal Logic K

Global property is the necessary condition which must be satisfied by the provable formulas.It can help to find out some unprovable formula that does not satisfy some global property before proving it using formal automated reasoning systems,thus the efficiency of the whole system is improved.This paper presents some global properties of valid formulas in modal logic K.Such properties are structure characters of formulas,so they are simple and easy to check.At the same time,some global properties of K unsatisfiable formula set are also given.