Dear reader, here send you
Table of content.
Welcome submission.
SCIENCE CHINA Information Home | Current Issue | All Past
Sciences 2015, Volume 58, Issue 3 Issues | Search
REVIEW
31101 PDF
(652KB)
Cite | LENG ChengCai, TIAN Jie. Mathematical method in optical molecular imaging. SCIENCE CHINA Information
Sciences, 2015, 58 (3): 31101-031101(13).
Abstract:
Optical molecular imaging is an important technique of studies at molecular level and provides promising tools to non-invasively delineate
physiological and pathological activities at cellular and molecular levels, and it has been widely used for diagnosing, managing diseases, metastasis detection and drug development. From a mathematical perspective, this paper mainly focuses on the forward problem and inverse problem in biological tissues based on the radiative transfer equation (RTE).
The forward problem is accustomed to describing photon propagation in biological tissues and the inverse problem is used to reconstruct internal source distribution from the signal detected on the external surface. We also introduce the detailed derivation of the RTE and Robin boundary condition and discretization of the forward problem, along with the reconstruction methods and iterative solution algorithms summarized for the inverse problem. Finally, the current and future challenges of optical molecular imaging are discussed. This survey aims

to construct a mathematical method, a state-of-the-art framework for optical molecular imaging, from which future research may benefit.
Cyber-physical-social-thinking space based science and technology framework for the Internet of Things PDF
(391KB)
Cite | NING HuanSheng, LIU Hong.
Cyber-physical-social-thinking space based science and technology framework for the Internet of Things. SCIENCE
CHINA Information Sciences, 2015, 58 (3):
31102-031102(19).
Abstract:
The Internet of Things (IoT) as an emerging network paradigm is bringing the next scientific and technological revolution for ubiquitous things' interactions in cyber-physical-social spaces. The IoT influences the current science and technology system by enabling its relatively stable interrelations for an inevitable archi- tecture reconfiguration. In this paper, we aim to explore an updated science and technology framework for the IoT.
Particularly, a novel cyber-physical-social-thinking
(CPST) space is established by involving an attractive concept of the Internet of Thinking (IoTk), and a science and technology framework is accordingly proposed referring to both scientific aspect (i.e., cyber-physical, social, and noetic sciences) and technological aspect (i.e., fundamental, physical, cyber, and social technologies). According to the perspective of the traditional Chinese culture, we explain the established science and technology framework, in which the
"Five Elements" (i.e., wood, fire, earth, metal, and water) have common properties with the restructured cyber-physical science in the IoT. Moreover, we introduce

a scenario of smart city to identify the technological aspect in the IoT, and discuss the key enabling technologies, including resource management, energy management, data management, session management, security and privacy, loop control, space-time consistency, nanotechnology, and quantum technol- ogy. It turns out that the established science and technology framework will launch an innovation for academia and industry communities.
RESEARCH PAPER community PDF (448KB)
Cite | LI HongTao, MA JianFeng, FU Shuai. A privacy-preserving data collection model for digital community. SCIENCE CHINA Information Sciences, 2015, 58
(3): 32101-032101(16).
Abstract:
The widespread use of mobile devices in digital community has promoted the variety of data collecting methods.
However, the privacy of individuals plays an important role in data processing or data transmission, and such information should be protected. In this paper, (
)-anonymity model, a widely used privacy-preserving model, is adopted as a security frame. Then, a privacy-preserving data collection model ((
))-CM based on (
)-anonymity is proposed and the threat model is analyzed. To resist the possible attack, we propose a generalization-encryption method to achieve a desired privacy level in (
)-CM. Generalization can decrease the data size and save the resource might induce information loss in data process; while encryption can decrease information loss, however, it can cause the waste

of resource. Generalization-encryption method dynamically encrypts a portion of the data with maximum information loss and adjusts the portion to balance the trade-off metric in the process of generalization.
Experimental results and theoretical analysis show that this method is effective in terms of privacy levels and data quality with low resource consumption.
Optimizing random write performance of FAST FTL for NAND flash memory PDF (431KB)
Cite | GUO XuFeng, WANG YuPing. Optimizing random write performance of FAST FTL for NAND flash memory. SCIENCE
CHINA Information Sciences, 2015, 58 (3):
32102-032102(14).
Abstract:
The NAND flash memory has gained its popularity as a storage device for consumer electronics due to its higher performance and lower power consumption. In most of these devices, an FTL (Flash Translation Layer) is adopted to emulate a block device interface to support the conventional disk-based file systems that make the flash management much easier. Among various FTLs, the FAST
(Fully-Associative Sector Translation) FTL has shown superior performance, becoming one of the state-of-the-art approaches. However, the FAST FTL performs poorly while dealing with a huge number of small-sized random writes brought by upper applications such as database transaction processing workloads. The two important reasons are the absence of efficient selection schemes for the reclaiming of random log blocks that leads to large overhead of full merges, and the sequential log block scheme which no longer applies to random writes due to the large costs of partial merges. To overcome the above

two defects in the presence of random writes, two techniques have been proposed. The first technique reduced full merge costs by adopting a novel random log block selection algorithm, based on the block associativity and the relevant-valid-page-amount of random log blocks as the key block selection criterion. The second technique replaced the sequential log block with a random log block to eliminate the overhead of partial merges. Experimental results showed that our optimizations can outperform FAST
FTL significantly in three aspects: erase counts, page migration amount, and response time. The maximum improvement level in these cases could reach up to 66.8%,
98.2%, and 51.0%, respectively.
Mlock: building delegable metadata service for the parallel file systems PDF (492KB)
Cite | ZHANG Quan, FENG Dan, WANG Fang, WU Sen. Mlock: building delegable metadata service for the parallel file systems. SCIENCE CHINA Information Sciences, 2015, 58 (3):
32103-032103(14).
Abstract:
The ever-growing demand for high performance computation calls for progressively larger parallel distributed file systems to match their requirement. These file systems can achieve high performance for large I/O operations through distributing load across numerous data servers. However, they fail to provide quality service for applications pertaining to small files. In this paper, we propose a delegable metadata service (DMS) for hiding latency of metadata accesses and optimizing small-file performance.
In addition, four techniques have been designed to maintain consistency and efficiency in DMS: pre-allocate serial metahandles, directory-based metadata

replacement, packing transaction operations and fine-grained lock revocation. These schemes have been employed in Cappella parallel distributed file system, and various experiments complying with industrial standards have been conducted for evaluation of its efficiency. The results show that our design has achieved significant improvement in performance of both metadata operations and small-file access. Moreover, this scheme is widely applicable for integration within many other distributed file systems.
Experimental analyses on phase transitions in compiling satisfiability problems PDF (1157KB)
Cite | GAO Jian, WANG JiaNan, YIN MingHao. Experimental analyses on phase transitions in compiling satisfiability problems. SCIENCE CHINA Information Sciences, 2015, 58
(3): 32104-032104(11).
Abstract:
In the past decade, a kind of well-known phenomena in many complex combinatorial problems such as satisfiability problem, called phase transition, have been widely studied. In this paper, the phase transition phenomena are investigated during compiling
-satisfiability problems into tractable languages with empirical methods. Ordered binary decision diagram and deterministic-decomposable negation normal form are selected as the tractable target languages for the compilation. Via intensive experiments, it can be concluded that an easy-hard-easy pattern exists during the compilations, which is only related to the ratio of the number of clauses to that of variables if we set
to a fixed value, rather than to the target languages.
Moreover, it can be concluded that the space exhausted during the compilations grows exponentially with the

number of variables growing, whereas there is also a phase transition separating the polynomial-increment region from the exponential-increment region. Additionally, it can be observed that there is a phase transition of prime implicants around peak points of the easy-hard-easy pattern and the ratios of random instances whose average lengths of prime implicants are larger than the threshold
0.5 change sharply. From these analyses, it can be concluded that prime implicant length and solution interchangeability are crucial impacts on sizes of compilation results.
32105 The DBlock family of block ciphers PDF (301KB)
Cite | WU WenLing, ZHANG Lei, YU XiaoLi. The DBlock family of block ciphers. SCIENCE CHINA Information Sciences,
2015, 58 (3): 32105-032105(14).
Abstract:
In this paper, we propose a new family of block ciphers named DBlock. It consists of three variants which are specified as DBlock-128, DBlock-192, and DBlock-256, respectively. DBlock-
has the equal
-bit block length and key length. The structure of DBlock successfully combines the advantages of Feistel and Type-2 generalized
Feistel structures together. Also, its design of round function employs different linear transforms operating on various word-sizes, which efficiently improve the diffusion effect. For key schedule of DBlock, it basically employs the same module used in encryption, except the choice of different byte permutations, which can improve its suitability for various implementation environments and also enhance its security against many cryptanalytic techniques. Our preliminary evaluation shows that DBlock

can achieve enough security margin against known attacks, and it can also obtain excellent performances on various software and hardware platforms.
Learning online structural appearance model for robust object tracking PDF (2420KB)
Cite | YANG Min, PEI MingTao, WU YuWei, JIA YunDe. Learning online structural appearance model for robust object tracking. SCIENCE CHINA Information Sciences, 2015, 58
(3): 32106-032106(14).
Abstract:
The main challenge of robust object tracking comes from the difficulty in designing an adaptive appearance model that is able to accommodate appearance variations.
Existing tracking algorithms often perform self-updating of the appearance model with examples from recent tracking results to account for appearance changes. However, slight inaccuracy of tracking results can degrade the appearance model. In this paper, we propose a robust tracking method by evaluating an online structural appearance model based on local sparse coding and online metric learning. Our appearance model employs pooling of structural features over the local sparse codes of an object region to obtain a middle-level object representation. Tracking is then formulated by seeking for the most similar candidate within a Bayesian inference framework where the distance metric for similarity measurement is learned in an online manner to match the varying object appearance. Both qualitative and quantitative evaluations on various challenging image sequences demonstrate that the proposed algorithm outperforms the state-of-the-art methods.
Probabilistic modeling of scenes using object frames PDF

(2629KB)
Cite | SU Hao, YU Adams Wei. Probabilistic modeling of scenes using object frames. SCIENCE CHINA Information
Sciences, 2015, 58 (3): 32107-032107(13).
Abstract:
In this paper, we propose a probabilistic scene model using object frames, each of which is a group of co-occurring objects with fixed spatial relations. In contrast to standard co-occurrence models, which mostly explore the pairwise co-existence of objects, the proposed model captures the spatial relationship among groups of objects.
Such information is closely tied to the semantics of the underlying scenes, which allows us to perform object detection and scene recognition in a unified framework.
The proposed probabilistic model has two major components.
The first models the dependencies between object frames and objects by adopting the Latent Dirichlet Allocation model for text analysis. The second component characterizes the dependencies between object frames and scenes by establishing a mapping between global image features and object frame distributions. Experimental results show that the induced object frames are both semantically meaningful and spatially consistent. In addition, our model significantly improves the performance of object recognition and scene retrieval.
Macro liveness graph and liveness of
-independent unbounded nets PDF (2326KB)
Cite | WANG ShouGuang, GAN MengDi, ZHOU MengChu. Macro liveness graph and liveness of
-independent unbounded nets. SCIENCE CHINA Information Sciences, 2015, 58 (3):
32201-032201(10).
Abstract:

Liveness is a basic property of a system and the liveness issue of unbounded Petri nets remains one of the most difficult problems in this field. This work proposes a novel method to decide the liveness of a class of unbounded generalized Petri nets called
-independent unbounded nets, breaking the existing limits to one-place-unbounded nets. An algorithm to construct a macro liveness graph
(MLG) is developed and a critical condition based on MLG deciding the liveness of
-independent unbounded nets is proposed. Examples are provided to demonstrate its effectiveness.
Height and attitude active disturbance rejection controller design of a small-scale helicopter PDF (905KB)
Cite | TANG Shuai, YANG QiuHui, QIAN ShaoKe, ZHENG
ZhiQiang. Height and attitude active disturbance rejection controller design of a small-scale helicopter.
SCIENCE CHINA Information Sciences, 2015, 58 (3):
32202-032202(17).
Abstract:
Small-scale helicopters are very attractive because of their unique features. However, autonomous flight control for small-scale helicopters is still a challenging work because they are naturally unstable, strongly nonlinear, and sensitive to disturbances. In this paper, we focus on the design of a height and attitude active disturbance rejection controller (ADRC) for a small-scale helicopter constructed in our lab. Firstly, a compre- hensive nonlinear model for the platform is presented, which is obtained through first principles modeling and system identification. The controller is designed using backstepping technique incorporated with extended state observer (ESO), which is used to estimate the unknown

disturbances. Then, the estimate is introduced into the control law to compensate for the disturbances. The design specifications of military rotorcraft are introduced to guide the controller design to achieve specified control performance. Considering the physical limitations, reference models are designed to shape the desired control responses. At last, several flight simulations are carried out to validate the effectiveness and robustness of the proposed controller. The results show that the proposed controller works well and Level 1 performance can be achieved.
Error aware multiple vertical planes based visual localization for mobile robots in urban environments PDF
(2101KB)
Cite | LI HaiFeng, WANG HongPeng, LIU JingTai. Error aware multiple vertical planes based visual localization for mobile robots in urban environments. SCIENCE CHINA
Information Sciences, 2015, 58 (3): 32203-032203(14).
Abstract:
A novel error-aware visual localization method is proposed that utilizes vertical planes, such as vertical building facades in urban areas as landmarks. Vertical planes, reconstructed from coplanar vertical lines, are robust high-level features if compared with point features or line features. Firstly, the error models of vertical lines and vertical planes are built, where maximum likelihood estimation (MLE) is employed to estimate all vertical planes from coplanar vertical lines. Then, the closed-form representation of camera location error variance is derived. Finally, the minimum variance camera pose estimation is formulated into a convex optimization problem, and the weight for each vertical plane is obtained

by solving this well-studied problem. Experiments are carried out and the results show that the proposed localization method has an accuracy of about 2 meters, at par with commercial GPS operating in open environments.
Closed-loop subspace identification algorithm based on correlation function estimates PDF (334KB)
Cite | WANG Jia, MILLER Daniel, WANG HongWei, GU Hong.
Closed-loop subspace identification algorithm based on correlation function estimates. SCIENCE CHINA Information
Sciences, 2015, 58 (3): 32204-032204(10).
Abstract:
A novel subspace identification method based on correlation function which estimates a state-space system dynamics of unknown plant operating in closed-loop experimental condition is proposed in this paper. It is shown that the cross-correlation function of the output and external input signals are equal to the crosscorrelation function of the input and external signals filtered through the system dynamics since noise signal has no correlation with the external input. The proposed algorithm is developed to obtain unbiased estimates of system matrices based on time-shifted invariance of the correlation function estimates. Later the algorithm is compared to other popular subspace methods in the simulation study and the results show the effectiveness of our method in the presence of colored noise and low signal-to-noise ratios.
Modeling and optimal torque control of a snake-like robot based on the fiber bundle theory PDF (585KB)
Cite | GUO Xian, MA ShuGen, LI Bin, WANG MingHui, WANG
YueChao. Modeling and optimal torque control of a snake-like robot based on the fiber bundle theory. SCIENCE

CHINA Information Sciences, 2015, 58 (3):
32205-032205(13).
Abstract:
For the snake-like robot with passive wheels, the side constraint force provides the required thrust which is less than the maximum static friction. Minimizing the side constraint force can reduce possibility of skidding which is important to ensure stable and efficient motion of the robot. In this paper we model the snakelike robot based on the fiber bundle theory. This method can reduce the complexity of the dynamics and derive the exact analytical solution for the side constraint force which is linear to the redundant torque. Using the linear relation, we can derive directly the optimal torque by minimizing the side constraint force. Additionally the nonholonomic constraint can be used for constructing the connection of the fiber bundle. Using the connection, we can select the gait of the snake-like robot. The position and orientation of the head can be described in terms of the special
Euclidean group SE(2) which is also the structure group of the fiber bundle. Using the symmetry of the structure group, we can reduce the dynamics equations and derive the analytical solution for the side constraint force.
Kinematics and dynamics simulations validate the proposed methods.
SHORT PAPER software testing quality PDF (128KB)
Cite | HE ZhiTao, LIU Chao, YAN HaiHua. Software testing evolution process model and growth of software testing quality. SCIENCE CHINA Information Sciences, 2015, 58 (3):
38101-038101(6).

Abstract:
The paper is based on the research on a formal definition of software testing, with reference to or- ganisms evolution's heredity/variation and adaptive dynamics equation. The formal descriptions on the hered- ity/variation in test versions and the driving force of software testing evolution were established and then a
Software Testing Evolution Process Model (STEPM) was obtained. Based on the model, the key factors of software testing quality were identified and a Software Testing
Quality Framework (STQF) was purposed. A series of formal models obtained in the paper open up new research field in software engineering with wide development foreground and are expected to promote studies on the dependability of software testing, provide ways to evaluate software testing quality and establish formal basis for fully automated testing conducted by programs.