Hand gesture - libiscasaccn - .doc by suchufp

VIEWS: 62 PAGES: 334

									<RECORD 1>
Accession number:20070610415136
Title:Hand gesture recognition based on structure analysis
Authors:Zhu, Ji-Yu (1); Wang, Xi-Ying (2); Wang, Wei-Xin (2); Dai, Guo-Zhong (2)
Author affiliation:(1) Department of Computer Science and Technology, University of Science and
Technology of China, Hefei 230027, China; (2) Intelligence Engineering Laboratory, Institute of
Software, Chinese Academy of Sciences, Beijing 100083, China
Corresponding author:Zhu, J.-Y.
       (zhujiyu@ustc.edu)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:12
Issue date:December 2006
Publication year:2006
Pages:2130-2137
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press, 18,Shuangqing Street,Haidian, Beijing, 100085, China
Abstract:Camera-based user interface is one of the main style in multimodal user interface, which
includes gesture interaction, pose interaction, gaze interaction, and so on. Camera-based gesture
interaction is a natural, convenient way to interact with computer. Gesture recognition is the basis
of gesture interaction. This paper considers both hand segmentation and gesture modeling, and
presents a method of gesture segmentation and globe and local gesture features extraction. The
background, motion, and color information of the video is described by fuzzy set, and is processed
with fuzzy operation, and then the hand is segmented from the environment. Because different
parts of the hand have different size, so Image Pyramid is used to analyze them to obtain the globe
and local characteristics of the gesture. Then the hand is simply divided into palm and five fingers.
The coordinates of the center of palm and every finger and the orientation from the center of the
palm to the center of all the five fingers (as the orientation of the gesture) are used to denote a 2D
gesture. This algorithm can be used to recognize 2D gesture. In experiment, the algorithm is
applied to real-time gesture segmentation and recognition successfully, and robust enough against
environment noise.
Number of references:8
Main heading:Gesture recognition
Controlled terms:Algorithms - Cameras - Computer simulation - Computer vision - Fuzzy sets -
Human computer interaction - Image segmentation - Mathematical morphology - Pattern
recognition - Set theory - Two dimensional - User interfaces
Uncontrolled terms:2D gesture - Environment noise - Finger - Fuzzy operation - Fuzzy set theory
- Gaze interaction - Gesture interaction - Gesture modeling - Gesture segmentation - Graph
pyramid - Hand segmentation - Image pyramid - Multimodal user interface - Palm - Pose
interaction - Structure analysis - Video background information - Video color information - Video
motion information
Classification code:722.2 Computer Peripheral Equipment - 723.2 Data Processing and Image
Processing - 723.5 Computer Applications - 921.4 Combinatorial Mathematics, Includes Graph
Theory, Set Theory
Treatment:Applications (APP); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 2>
Accession number:20064510228614
Title:Differential fault analysis on SMS4
Authors:Zhang, Lei (1); Wu, Wen-Ling (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) State Key Laboratory of Information Security,
Graduate University, Chinese Academy of Sciences, Beijing 100049, China
Corresponding author:Zhang, L.
        (zhanglei1015@is.iscas.ac.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:9
Issue date:September 2006
Publication year:2006
Pages:1596-1602
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:SMS4 is the block cipher used in WAPI, and it is also the first commercial block cipher
disclosed by the government. Since it was disclosed only a short time ago, on its security, there
has been no published paper at present. In this paper the strength of SMS4 against the differential
fault attack is examined. The authors use the byte-oriented fault model, and take advantage of the
differential analysis as well. Theoretically, the 128bit master key for SMS4 can be obtained by
using 32 faulty ciphertexts. But in practice, for the fact that the byte position where the fault
happens isn't equally distributed, the number of faulty ciphertexts needed will be a little bigger
than the theoretical value. The attack experiment result validates this fact too. The result shows
that only need average 47 faulty ciphertexts to recover the 128bit keys for SMS4. So SMS4 is
vulnerable to differential fault attack. To avoid this kind of attack, the authors suggest that the
encryption device should be protected to prevent the adversary from deducing faults.
Number of references:11
Main heading:Cryptography
Controlled terms:Algorithms - Data privacy - Difference equations - Failure analysis - Public key
cryptography - Security of data
Uncontrolled terms:128bit master key - Byte oriented fault model - Byte position - Commercial
block cipher - Difference distribution table - Differential fault analysis - Differential fault attack -
Encryption device - Fault model - Faulty ciphertext - SMS4 - WAPI
Classification code:723.2 Data Processing and Image Processing - 921.6 Numerical Methods
Treatment:Applications (APP); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 3>
Accession number:20064210177596
Title:Finding relations among linear constraints
Authors:Yan, Jun (1); Zhang, Jian (1); Xu, Zhongxing (1)
Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of
Sciences; (2) Graduate University, Chinese Academy of Sciences
Corresponding author:Yan, J.
        (yanjun@ios.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4120 LNAI
Monograph title:Artificial Intelligence and Symbolic Computation - 8th International Conference,
AISC 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:226-240
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540397280
ISBN-13:9783540397281
Document type:Conference article (CA)
Conference name:8th International Conference on Artificial Intelligence and Symbolic
Computation, AISC 2006
Conference date:September 20, 2006 - September 22, 2006
Conference location:Beijing, China
Conference code:68305
Publisher:Springer Verlag
Abstract:In program analysis and verification, there are some constraints that have to be processed
repeatedly. A possible way to speed up the processing is to find some relations among these
constraints first. This paper studies the problem of finding Boolean relations among a set of linear
numerical constraints. The relations can be represented by rules. It is believed that we can not
generate all the rules in polynomial-time. A search based algorithm with some heuristics to speed
up the search process is proposed. All the techniques are implemented in a tool called MALL
which can generate the rules automatically. Experimental results with various examples show that
our method can generate enough rules in acceptable time. Our method can also handle other types
of constraints if proper numeric solvers are available. &copy; Springer-Verlag Berlin Heidelberg
2006.
Number of references:16
Main heading:Constraint theory
Controlled terms:Boolean algebra - Heuristic methods - Linear systems - Numerical methods -
Polynomials - Problem solving
Uncontrolled terms:Boolean relations - Numeric solvers - Program analysis
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.4 Artificial Intelligence - 921 Mathematics - 921.1 Algebra -
921.6 Numerical Methods
Treatment:Theoretical (THR); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 4>
Accession number:20063810125669
Title:A general model for long-tailed network traffic approximation
Authors:Wang, Junfeng (1); Zhou, Hongxia (3); Zhou, Mingtian (1); Li, Lei (2)
Author affiliation:(1) College of Computer Science and Engineering, University of Electronic
Science and Technology of China, Chengdu 610054, China; (2) Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (3) Chongqing Communication Institute,
Chongqing 400035, China
Corresponding author:Wang, J.
        (mailwangjf@yahoo.com.cn)

Source title:Journal of Supercomputing
Abbreviated source title:J Supercomput
Volume:38
Issue:2
Issue date:November 2006
Publication year:2006
Pages:155-172
Language:English
ISSN:09208542
E-ISSN:15730484
CODEN:JOSUED
Document type:Journal article (JA)
Publisher:Kluwer Academic Publishers
Abstract:The long-tailed distribution characterizes many Internet traffic properties which are often
modeled by Lognormal distribution, Weibull or Pareto distribution theoretically. However, it is
rather difficult to directly apply these models in traffic analysis and performance evaluation
studies due to their complex representations and theoretical properties. This paper proposes a
Hyper-Erlang Model (Mixed Erlang distribution) for such long-tailed network traffic
approximation. It fits network traffic with long-tailed characteristic into a mixed Erlang
distribution directly to facilitate our further analysis. Compared with the well-known
hyperexponential based method, the mixed Erlang model is more accurate in fitting the tail
behavior and also computationally efficient. Further investigations on the M/G/1 queueing
behavior also prove the efficiency of the Mixed Erlang based approximation. &copy; Springer
Science + Business Media, LLC 2006.
Number of references:29
Main heading:Telecommunication networks
Controlled terms:Algorithms - Approximation theory - Mathematical models - Pareto principle -
Queueing theory - Telecommunication traffic
Uncontrolled terms:Expectation maximization (EM) algorithm - Hyper-erlang distribution -
Network measurements - Network traffic approximation - Pareto distribution - Queueing analysis
Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer
Software, Data Handling and Applications - 911 Cost and Value Engineering; Industrial
Economics - 921.6 Numerical Methods - 922.1 Probability Theory
Treatment:Theoretical (THR)
DOI:10.1007/s11227-006-7944-7
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 5>
Accession number:20064110165633
Title:Quantified-role based controllable delegation model
Authors:Zhai, Zheng-De (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Acad. of Sci., Beijing 100080, China
Corresponding author:Zhai, Z.-D.
       (zhaizhengde@is.iscas.ac.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:8
Issue date:August 2006
Publication year:2006
Pages:1401-1407
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:Delegation is an important secure policy that RBAC should support. Most Existing
RBAC delegation models cannot effectively support fine delegation granularity and controllable
propagation of permissions. This paper first introduces the concept of quantified-role and then
proposes a fine-grained delegation constraint mechanism. Lastly, it gives a formal Quantified-role
Based Controllable Delegation Model (QBCDM). The model supports the delegation of any part
of permissions of roles, while avoiding incurring high administrative cost. It also provides
mandatory constraints and fine-grained discretionary constraints, which ensure the constringency
of delegation ability in multi-step delegations and significantly enhance controllability of
delegation.
Number of references:15
Main heading:Network protocols
Controlled terms:Constraint theory - Controllability - Costs - Management - Mathematical models
- Security of data - Theorem proving
Uncontrolled terms:Controllable propagation - Fine delegation granularity - Permissions -
Quantified roles - Role based access control - Role based delegation - Secure policy
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723 Computer Software, Data Handling and Applications - 731.1
Control Systems - 911 Cost and Value Engineering; Industrial Economics - 912.2 Management -
921 Mathematics
Treatment:Applications (APP); Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 6>
Accession number:20065110324876
Title:Pseudorandomness on the round-structure of Skipjack
Authors:Wu, Wenling (1); Wei, Hongru (2)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) School of Applied Science, Beijing University
of Science and Technology, Beijing 100083, China
Corresponding author:Wu, W.
        (wll@is.iscas.ac.cn)

Source title:Chinese Journal of Electronics
Abbreviated source title:Chin J Electron
Volume:15
Issue:3
Issue date:2006
Publication year:2006
Language:English
ISSN:10224653
CODEN:CHJEEW
Document type:Journal article (JA)
Publisher:Chinese Institute of Electronics
Abstract:Skipjack is a simple cipher, and one interesting feature is the use of two different types of
rounds. These are referred to as A and B-rounds. Earlier researchers have studied the security of
Skipjack against some attack methods, but they did not focus on pseudorandomness of the
round-structure of Skipjack. In this paper, we discuss the pseudorandomness on the
round-structure of Skipjack. We first point out six rounds A-Skipjack is not pseudorandom, and
then prove seven rounds A-Skipjack is pseudorandom for any adversaries. Next we point out
twelve rounds B-Skipjack is not pseudorandom, and prove fourteen rounds B-Skipjack is
pseudorandom for any adversaries.
Number of references:19
Main heading:Data structures
Controlled terms:Block codes - Computer crime - Engineering research - Security of data
Uncontrolled terms:Block ciphers - Pseudorandomness - Random function - Round structure -
Skipjack
Classification code:723.1 Computer Programming - 723.2 Data Processing and Image Processing
- 901.3 Engineering Research
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 7>
Accession number:20080711094436
Title:Distributed utilization control for real-time clusters with load balancing
Authors:Fu, Yong (1); Wang, Hongan (1); Lu, Chenyang (3); Chandra, Ramu Sharat (4)
Author affiliation:(1) Intelligence Engineering Lab., Institute of Software, Chinese Academy of
Sciences; (2) State Key Lab. of Computer Science, Institute of Software, Chinese Academy of
Sciences; (3) Department of Computer Science and Engineering, Washington University, St. Louis;
(4) GE Global Research Center
Corresponding author:Fu, Y.
        (fuyong@iel.iscas.ac.cn)

Source title:Proceedings - Real-Time Systems Symposium
Abbreviated source title:Proc. Real Time Syst. Symp.
Monograph title:Proceedings of 27th IEEE International Real-Time Systems Symposium, RTSS
2006
Issue date:2006
Publication year:2006
Pages:137-146
Article number:4032343
Language:English
ISSN:10528725
CODEN:PRSYEA
ISBN-10:0769527612
ISBN-13:9780769527611
Document type:Conference article (CA)
Conference name:27th IEEE International Real-Time Systems Symposium, RTSS 2006
Conference date:December 5, 2006 - December 8, 2006
Conference location:Rio de Janeiro, Brazil
Conference code:71346
Publisher:Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Recent years have seen rapid growth of online services that rely on large-scale server
clusters to handle high volume of requests. Such clusters must adaptively control the CPU
utilizations of many processors in order to maintain desired soft real-time performance and
prevent system overload in face of unpredictable workloads, This paper presents DUC-LB, a
novel distributed utilization control algorithm for cluster-based soft real-time applications.
Compared to earlier works on utilization control, a distinguishing feature of DUC-LB is its
capability to handle system dynamics caused by load balancing, which is a common and essential
component of most clusters today. Simulation results and control-theoretic analysis demonstrate
that DUCLB can provide robust utilization control and effective load balancing in large-scale
clusters. &copy; 2006 IEEE.
Number of references:37
Main heading:Real time control
Controlled terms:Cluster analysis - Computer simulation - Parallel algorithms - Program
processors - Resource allocation - Robust control
Uncontrolled terms:Distributed utilization control - Distributed utilization control algorithms -
Robust utilization control
Classification code:723.1 Computer Programming - 723.5 Computer Applications - 731 Automatic
Control Principles and Applications - 912.2 Management - 921 Mathematics
Treatment:Theoretical (THR)
DOI:10.1109/RTSS.2006.20
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 8>
Accession number:2006259948873
Title:Compositional semantics and refinement of statecharts
Authors:Zhu, Xue-Yang (1); Tang, Zhi-Song (1)
Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China
Corresponding author:Zhu, X.-Y.
       (zxy@ios.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:4
Issue date:April 2006
Publication year:2006
Pages:670-681
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:Statecharts is widely used as a behavioral modeling language for reactive systems for its
concise and intuitive expression. It can represent the system behavior at different levels of
abstraction, and therefore can represent the result of every refinement step in the process of system
modeling. However, it's beyond its capability to reason about whether the model semantics of the
lower level preserves that of the higher level and whether the models they describe satisfy some
properties. In this aspect, the formal language XYZ/E can be used complementarily. The XYZ/E is
an executable linear temporal logic. It can express both the properties and behavior of systems. In
this paper, the semantics of Statecharts is defined inductively using the Basic Transition System,
and its temporal semantics is expressed by an XYZ/E formula. The semantics we give is
modularly compositional. The semantic preserving of different refinement steps can be guaranteed
by the semantic definition directly. Models that Statecharts specify and their properties are
represented in the same logic, so the assertion that a model meets its specification is expressed by
logical implication.
Number of references:29
Main heading:Formal languages
Controlled terms:Composition - Semantics - Software engineering - Specifications
Uncontrolled terms:Asynchronous time model - Basic transition system (BTS) - Behavioral
modeling language - Formal semantics - Linear temporal logic (LTL) - Reactive systems -
Refinement - State charts - Synchronous time model - Temporal semantics - XYZ/E
Classification code:723.1 Computer Programming - 902.2 Codes and Standards - 903.2
Information Dissemination
Treatment:Applications (APP)
DOI:10.1360/jos170670
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 9>
Accession number:2006229906803
Title:Facilitating formal specification acquisition by using recursive functions on context-free
languages
Authors:Chen, Haiming (1); Dong, Yunmei (1)
Author affiliation:(1) Computer Science Laboratory, Institute of Software, Chinese Academy of
Sciences, P.O. Box 8718, Beijing, 100080, China
Corresponding author:Chen, H.
        (chm@ios.ac.cn)

Source title:Knowledge-Based Systems
Abbreviated source title:Knowl Based Syst
Volume:19
Issue:2
Issue date:June 2006
Publication year:2006
Pages:141-151
Language:English
ISSN:09507051
CODEN:KNSYET
Document type:Journal article (JA)
Publisher:Elsevier
Abstract:Although formal specification techniques are very useful in software development, the
acquisition of formal specifications is a difficult task. This paper presents the formal specification
language LFC, which is designed to facilitate the acquisition and validation of formal
specifications. LFC uses context-free languages for syntactic aspect and relies on a new kind of
recursive functions, i.e. recursive functions on context-free languages, for semantic aspect of
specifications. Construction and validation of LFC specifications are machine-aided. The basic
ideas behind LFC, the main aspects of LFC, and the use of LFC and illustrative examples are
described. &copy; 2005 Elsevier B.V. All rights reserved.
Number of references:35
Main heading:Computer hardware description languages
Controlled terms:Computer science - Context free languages - Data acquisition - Functions -
Semantics - Specifications
Uncontrolled terms:Formal specification language - Recursive function - Specification acquisition
- Specification validation
Classification code:721 Computer Circuits and Logic Elements - 723.1.1 Computer Programming
Languages - 723.2 Data Processing and Image Processing - 902.2 Codes and Standards - 903.2
Information Dissemination - 921 Mathematics
Treatment:Theoretical (THR)
DOI:10.1016/j.knosys.2005.10.005
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 10>
Accession number:20080611082585
Title:A fault-tolerant scheme for complex transaction patterns in J2EE
Authors:Zuo, Lin (1); Liu, Shaohua (1); Wei, Jun (1)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Zuo, L.
        (martin_zl@otcaix.iscas.ac.cn)

Source title:Proceedings - IEEE International Enterprise Distributed Object Computing Workshop,
EDOC
Abbreviated source title:Proc IEE Int. Enterprise Distrib. Obj. Comput. Workshop EDOC
Monograph title:Proceedings - 10th IEEE International Enterprise Distributed Object Computing
Conference, EDOC 2006
Issue date:2006
Publication year:2006
Pages:165-174
Article number:4031205
Language:English
ISSN:15417719
ISBN-10:076952558X
ISBN-13:9780769525587
Document type:Conference article (CA)
Conference name:10th IEEE International Enterprise Distributed Object Computing Conference,
EDOC 2006
Conference date:October 16, 2006 - October 20, 2006
Conference location:Hong Kong, China
Conference code:71260
Publisher:Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:End-to-End Reliability is an important issue in building large-scale distributed enterprise
applications based on multi-tier architecture, but the support of reliability as adopted in
conventional replication or transactions mechanisms is not enough due to their distinct objectives -
replication guarantees the liveness of computational operations by using forward error recovery,
while transactions guarantee the safety of application data by using backward error recovery.
Combining the two mechanisms for stronger reliability is a challenging task Current solutions,
however, are typically on the assumption of simple transaction pattern where a request from a
single client executes in the context of exactly one transaction at the middle-tier application server,
and seldom think about some complex patterns, such as client transaction enclosing multiple client
requests or nested transactions. In this paper, we first identify four transaction pattern classes, and
then propose a fault-tolerant scheme that can uniformly provide exactly-once semantic reliability
support for these patterns. In this scheme, application servers are passively replicated to endow
business logics with high reliability and high availability. In addition, by replicating transaction
coordinator, the blocking problem of 2PC protocol during distributed transactions processing is
eliminated. We have implemented this approach and integrated it into our own J2EE application
server, OnceAS. Also, its effectiveness is discussed in different transaction patterns and the
corresponding performance is evaluated. &copy; 2006 IEEE.
Number of references:22
Main heading:Financial data processing
Controlled terms:Computational methods - Fault tolerance - Network protocols - Servers
Uncontrolled terms:Application servers - Complex transaction patterns - Distributed transactions
processing - Multi-tier architecture
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 722 Computer Systems and Equipment - 722.4 Digital Computers
and Systems - 723 Computer Software, Data Handling and Applications - 911.1 Cost Accounting
Treatment:Theoretical (THR)
DOI:10.1109/EDOC.2006.8
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 11>
Accession number:20063110047068
Title:Eigenvariables, bracketing and the decidability of positive minimal predicate logic
Authors:Dowek, Gilles (1); Jiang, Ying (2)
Author affiliation:(1) &#201;cole polytechnique, INRIA, LIX, 91128 Palaiseau Cedex, France; (2)
Institute of Software, Chinese Academy of Sciences, P.O. Box, 100080 Beijing, China
Corresponding author:Dowek, G.
        (Gilles.Dowek@polytechnique.fr)

Source title:Theoretical Computer Science
Abbreviated source title:Theor Comput Sci
Volume:360
Issue:1-3
Issue date:August 21, 2006
Publication year:2006
Pages:193-208
Language:English
ISSN:03043975
CODEN:TCSCDI
Document type:Journal article (JA)
Publisher:Elsevier
Abstract:We give a new proof of a theorem of Mints that the positive fragment of minimal
predicate logic is decidable. The idea of the proof is to replace the eigenvariable condition of
sequent calculus by an appropriate scoping mechanism. The algorithm given by this proof seems
to be more practical than that given by the original proof. A naive implementation is given at the
end of the paper. Another contribution is to show that this result extends to a large class of theories,
including simple type theory (higher-order logic) and second-order propositional logic. We obtain
this way a new proof of the decidability of the inhabitation problem for positive types in system F.
&copy; 2006.
Number of references:9
Main heading:Logic programming
Controlled terms:Computability and decidability - Computational complexity - Eigenvalues and
eigenfunctions - Theorem proving
Uncontrolled terms:Bound variable - Minimal logic - Positive quantifier - Sequent calculus -
System F
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.1 Computer Programming - 921.1 Algebra
Treatment:Theoretical (THR); Experimental (EXP)
DOI:10.1016/j.tcs.2006.01.053
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 12>
Accession number:2006129773008
Title:Reachability checking of finite precision timed automata
Authors:Yan, Rong-Jie (1); Li, Guang-Yuan (1); Xu, Yu-Bo (1); Liu, Chun-Ming (1); Tang,
Zhi-Song (1)
Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China; (2) Graduate School, Chinese Academy of Sciences, Beijing
100049, China
Corresponding author:Yan, R.-J.
       (yrj@ios.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:1
Issue date:January 2006
Publication year:2006
Pages:1-10
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:To relieve the state space explosion problem, and accelerate the speed of model checking,
this paper introduces the concept of finite precision timed automata (FPTAs) and proposes a data
structure to represent its symbolic states. FPTAs only record the integer values of clock variables
together with the order of their most recent resets to reduce the state space. The constraints under
which the reachability checking of a timed automation can be reduced to that of the corresponding
FPTA are provided, and then an algorithm for reachability analysis is presented. Finally, the paper
presents some preliminary experimental results, and analyzes the advantages and disadvantages of
the new data structure.
Number of references:27
Main heading:Finite automata
Controlled terms:Algorithms - Automation - Constraint theory - Data structures - Mathematical
models - State space methods
Uncontrolled terms:Clock variables - Finite precision timed automata - Model checking -
Reachability - Symbolic methods - Symbolic states
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.2 Data Processing and Image Processing - 723.3 Database
Systems - 731.1 Control Systems - 921 Mathematics
Treatment:Applications (APP); Theoretical (THR); Experimental (EXP)
DOI:10.1360/jos170001
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 13>
Accession number:20063310068997
Title:An access control method using organization structure
Authors:Xu, Zhen (0); Feng, Dingguo (0)
Corr. author affiliation:State Key Laboratory of Information Security, Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China
Source title:Jisuanji Gongcheng/Computer Engineering
Abbreviated source title:Jisuanji Gongcheng
Volume:32
Issue:13
Issue date:Jul 5 2006
Publication year:2006
Pages:20-22
Language:Chinese
ISSN:10003428
CODEN:JISGEV
Document type:Journal article (JA)
Publisher:Shanghai Computer Society, Shanghai, China
Abstract:Large organizations tend to organize their information resources according to their
structures. Such a structure often has many similar sub-structures. Using tradition RBAC to model
the access control requirement under such environments will lead to define permissions and roles
in each one of these sub-structures. So there has much extra work to manage such an access
control system. This paper presents an extended RBAC model. In order to solve the above
problem, this model adopts organization structures, defines abstract roles and associates such
abstract roles and organization structure units.
Number of references:3
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 14>
Accession number:20080311040332
Title:A test path generation approach for component testing based on UML state diagram
Authors:Ma, Yuhong (1); Lu, Jiang (3); Zhao, Ruilian (1)
Author affiliation:(1) Computer Science Dept., Beijing University of Chemical Technology, 15
Beisanhuan East, Chanyang District, Beijing, 100029, China; (2) Laboratory of Computer Science,
Institute of Software, Chinese Academy of Sciences, 4 Nansi Street, Zhongguancun, Beijing
100080, China; (3) College of Information Engineering, Chang'an University, Xi'an City, Shanxi
Province, 710064, China
Corresponding author:Zhao, R.
        (rlzhao@mail.buct.edu.cn)
Source title:Proceedings of the 10th IASTED International Conference on Software Engineering
and Applications, SEA 2006
Abbreviated source title:Proc. IASTED Int. Conf. Softw. Eng. Applic.
Monograph title:Proceedings of the 10th IASTED International Conference on Software
Engineering and Applications, SEA 2006
Issue date:2006
Publication year:2006
Pages:471-476
Language:English
ISBN-13:9780889865990
Document type:Conference article (CA)
Conference name:10th IASTED International Conference on Software Engineering and
Applications, SEA 2006
Conference date:November 13, 2006 - November 15, 2006
Conference location:Dallas, TX, United states
Conference code:70929
Sponsor:The IASTED, Technical Committee on Software Engineering
Publisher:Acta Press, Building B6, Suite 101, 2509 Dieppe Avenue S.W., Calgary, AB, T3E 7J9,
Canada
Abstract:Component-based software engineering is increasingly being adopted for software
development. Component testing plays an important role in guaranteeing component quality and
reliability. This paper presents a test path generation approach for component testing based on
UML state diagram. The UML state diagram corresponding to component is transformed to an
Extended Finite State Machine (EFSM), test paths are generated by applying Branch cutting
method to traverse the EFSM, and then test cases are designed to check the component.
Experimental results show that this approach is effective and promising. The test cases developed
can remarkably reveal the requirement faults and functional defects in components.
Number of references:9
Main heading:Software testing
Controlled terms:Finite automata - Requirements engineering - Unified Modeling Language
Uncontrolled terms:Branch cutting methods - Component testing - Extended finite state machines
- State diagrams - Test path generation
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.1.1 Computer Programming Languages - 723.5 Computer
Applications
Treatment:Theoretical (THR); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 15>
Accession number:2006129772977
Title:Cluster partition algorithm in wireless sensor networks
Authors:Zhao, Bao-Hua (1); Zhang, Wei (1); Liu, Heng-Chang (1); Qu, Yu-Gui (1)
Author affiliation:(1) Department of Computer Science and Technology, University of Science and
Technology of China, Hefei 230027, China; (2) Laboratory of Computer Science, Institute of
Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Zhao, B.-H.
Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:1
Issue date:January 2006
Publication year:2006
Pages:161-165
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:Since sensors self-organize in the form of clusters within a two-tiered wireless sensor
network, how to cluster a network has become a fundamental problem. This paper provides a
cluster partition algorithm to prolong the lifetime of a network, considering factors such as
decency of clusters, average cluster power consumption, and load-balance between clusters. This
algorithm appoints some nodes as cluster head; each takes all the nodes nearby as its members.
Basic station gets the states of all the cluster heads, and optimizes the partition according to the
factors above.
Number of references:11
Main heading:Sensors
Controlled terms:Algorithms - Networks (circuits) - Radio - Wireless telecommunication systems
Uncontrolled terms:Cluster partition algorithm - Load balance - Two tiered structure - Wireless
sensor network
Classification code:703.1 Electric Networks - 716 Telecommunication; Radar, Radio and
Television - 723 Computer Software, Data Handling and Applications - 732.2 Control
Instrumentation
Treatment:Applications (APP); Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 16>
Accession number:20064110165686
Title:An automated approach for structural test data generation based on messy GA
Authors:Xue, Yun-Zhi (1); Chen, Wei (1); Wang, Yong-Ji (1); Zhao, Chen (1); Wang, Qing (1)
Author affiliation:(1) Laboratory for Internet Software Technologies, Institute of Software, The
Chinese Academy of Sciences, Beijing 100080, China; (2) Graduate School, The Chinese
Academy of Sciences, Beijing 100049, China; (3) Laboratory of Computer Science, Institute of
Software, The Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Xue, Y.-Z.
       (yunzhi@intec.iscas.ac.cn)
Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:8
Issue date:August 2006
Publication year:2006
Pages:1688-1697
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:Structural testing is one of the basic approaches for identifying test cases. Because of
complexity of programming languages and variety of applications, an efficient approach to
automated generation of structural test data is to breed search iteratively by profiling of program
execution. Based on Messy GA, an automated approach for generating such data is proposed in
this paper by solving F(X), a test coverage function of test data set. It utilizes Messy GA's
prominent feature that can optimize complicated problems without prior knowledge about schema
arrangement in chromosomes, so that it can improve concurrency level of searching and test
coverage. Compared with other approaches based on GA, the experimental results for several
typical programs and real-world applications show that it can generate higher quality test data
more efficiently, and can be applied to larger applications.
Number of references:22
Main heading:Computer software
Controlled terms:Chromosomes - Computer program listings - Computer programming languages
- Data processing - Encoding (symbols) - Functions - Genetic algorithms - Mathematical operators
- Optimization - Testing
Uncontrolled terms:Automatic generation - Messy GA - Prior knowledge - Sizable chromosomes -
Structural test - Test cases - Test coverage functions - Test data
Classification code:723.1 Computer Programming - 723.2 Data Processing and Image Processing
- 921 Mathematics
Treatment:Applications (APP); Theoretical (THR); Experimental (EXP)
DOI:10.1360/jos171688
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 17>
Accession number:20072410651826
Title:Distinguishing between automatic and manual aspects of model driven development
Authors:Duan, Yucong (1); Gu, Yuqing (1); Cheung, S.C. (2); Fu, Xiaolan (3); Wang, Jing (4); Hu,
Qingwu (5)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, China; (2) Hong Kong
University of Science and Technology, China; (3) Institute of Psychology, Chinese Academy of
Sciences, China; (4) Department of Computer and Information Science, Towson University,
United States; (5) China Development Center for NEC Telecom System, China
Corresponding author:Duan, Y.
       (duanyucong@263.net)

Source title:Proceedings of the International Symposium and Workshop on Engineering of
Computer Based Systems
Abbreviated source title:Proc Int Symp Workshop Eng Computer Based Syst
Monograph title:Proceedings - 13th Annual IEEE International Symposium and Workshop on
Engineering of Computer Based Systems, ECBS 2006
Issue date:2006
Publication year:2006
Pages:487-488
Article number:1607404
Language:English
CODEN:85RRAV
ISBN-10:0769525466
ISBN-13:9780769525464
Document type:Conference article (CA)
Conference name:13th Annual IEEE International Symposium and Workshop on Engineering of
Computer-Based Systems, ECBS 2006
Conference date:March 27, 2006 - March 30, 2006
Conference location:Potsdam, Germany
Conference code:69731
Publisher:Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Manual portion and automatable aspects are often not explicitly differentiated and
defined in most model driven software development (MDSD). This may hinder the advancement
of the automation level of MDSD with problems such as defining the boundaries of automation
tasks, and measuring the workload for model transformations (MT), etc. In common senses, the
two parts are not distinguishable because they belong to irrespective subjective and objective
conceptual areas respectively. By discussing this issue specifically for MDSD, a conceptual
exclusion approach for differentiation based on an extended Entity Relationship (ER) model is
proposed. A conceptual framework called MIB/CSD (manual work, inheritance, behaviorism /
cardinality, static, dynamic) to implement the differentiation approach is designed. Feasibility of
the differentiation work with regard to UML is discussed in both the theoretical aspect with the
extended ER model and the practical aspect with some existing evidences. &copy; 2006 IEEE.
Number of references:2
Main heading:Software engineering
Controlled terms:Automation - Differentiation (calculus) - Mathematical models - Mathematical
transformations - Unified Modeling Language
Uncontrolled terms:Entity Relationship (ER) models - Model transformations (MT)
Classification code:723.1 Computer Programming - 723.1.1 Computer Programming Languages -
731 Automatic Control Principles and Applications - 921.2 Calculus - 921.3 Mathematical
Transformations
Treatment:Theoretical (THR)
DOI:10.1109/ECBS.2006.38
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 18>
Accession number:20063710112290
Title:Pen-based user interface with scenarios tree
Authors:Wang, Danli (0); Dai, Guozhong (0)
Corresponding author:Wang, D.
        (danli@ios.cn)

Corr. author affiliation:Intelligence Engineering Laboratory, Institute of Soft-ware, Chinese
Academy of Sciences, Beijing 100080, China
Source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and
Computer Graphics
Abbreviated source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao
Volume:18
Issue:8
Issue date:August 2006
Publication year:2006
Pages:1276-1280
Language:Chinese
ISSN:10039775
CODEN:JFTXFX
Document type:Journal article (JA)
Publisher:Institute of Computing Technology, Beijing, China
Abstract:In view of enhancing the usability of pen-based user interface (PUI) and presenting the
full superiority of its natural interaction and convenience in operation, an interface design
approach using the scenarios-tree to manage affairs related to holding conferences and provide
services for inquiring about and access to the proceedings and other records is illustrated.
Number of references:16
DOI:10.1109/TED.2006.871874
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 19>
Accession number:20074610921094
Title:DISPDESK: A logistic constraint programming system for construction machinery
Authors:Zheng, Yujun (1); Yang, Junwei (3); Zhu, Yuling (2); Xue, Jinyun (4)
Author affiliation:(1) IEEE; (2) Systems Engineering Research Institute of Engineer Equipment,
Beijing, 100093, China; (3) National Key Laboratory for Remanufacturing, Beijing, 100072,
China; (4) College of Computer Information Engineering, Jiangxi Normal University, Nanchang,
330027, China; (5) Institute of Software, Chinese Academy of Sciences
Corresponding author:Zheng, Y.
       (uchengz@yahoo.com.cn)

Source title:2006 IEEE International Conference on Service Operations and Logistics, and
Informatics, SOLI 2006
Abbreviated source title:IEEE Int. Conf. Serv. Oper. Logist. Inform.
Monograph title:2006 IEEE International Conference on Service Operations and Logistics, and
Informatics, SOLI 2006
Issue date:2006
Publication year:2006
Pages:376-381
Article number:1700895
Language:English
ISBN-10:1424403189
ISBN-13:9781424403189
Document type:Conference article (CA)
Conference name:2006 IEEE International Conference on Service Operations and Logistics, and
Informatics, SOLI 2006
Conference date:June 21, 2006 - June 23, 2006
Conference location:Shanghai, China
Conference code:70555
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Logistic planning and programming of construction machinery involves complex sets of
objectives and constraints; therefore traditional approaches typically result in a large monolithic
model that is difficult to solve, understand, and maintain. In order to tackle large, particularly
combinatorial, problems in logistic support for construction machinery, we design a constraint
programming system, namely DISPDESK, which comprises a specification generator and its
underlying domain-specific architecture, an algorithm library and its selector, a pre-defined
solution library and a problem solver. The system features separation of concerns in specifications,
little requirements for programming skills, domain-specific optimization, and semi-automatic
generation of high-performance and reliable problem solvers. &copy; 2006 IEEE.
Number of references:10
Main heading:Logistics
Controlled terms:Combinatorial optimization - Constraint theory - Mathematical models -
Mathematical programming - Problem solving - Process planning
Uncontrolled terms:Constraint programming - Construction machinery - Logistic support
Classification code:912 Industrial Engineering and Management - 913.1 Production Engineering -
921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 921.5 Optimization
Techniques - 961 Systems Science
Treatment:General review (GEN)
DOI:10.1109/SOLI.2006.236277
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 20>
Accession number:2006259955118
Title:Evaluation of the capability of personal software process based on data envelopment analysis
Authors:Ding, Liping (1); Yang, Qiusong (1); Sun, Liang (1); Tong, Jie (1); Wang, Yongji (1)
Author affiliation:(1) Laboratory for Internet Software Technologies, Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China; (2) Key Laboratory for Computer Science,
Chinese Academy of Sciences, Beijing 100080, China; (3) Graduate School, Chinese Academy of
Sciences, Beijing 100039, China
Corresponding author:Ding, L.
        (dingliping@itechs.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3840 LNCS
Monograph title:Unifying the Software Process Spectrum - International Software Process
Workshop, SPW 2005, Revised Selected Papers
Issue date:2006
Publication year:2006
Pages:235-248
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540311122
ISBN-13:9783540311126
Document type:Conference article (CA)
Conference name:International Software Process Workshop, SPW 2005
Conference date:May 25, 2005 - May 27, 2005
Conference location:Beijing, China
Conference code:67507
Publisher:Springer Verlag
Abstract:Personal Software Process (PSP) is a defined and measured software process designed to
be used by an individual software engineer. For PSP users, it's important to evaluate the impact of
the PSP upon their own personal capabilities of software development. However, the evaluation of
capability of PSP is a Variable Return to Scale (VRS) and multivariate input and output. problem,
which makes traditional evaluation methods useless. In this paper, an evaluation framework for
the capability of PSP based on Data Envelopment Analysis (DEA) is proposed. This framework
has the advantage of dealing with VRS issues with multivariate input and output. In addition, the
input or output variables of the framework can have different measurement units. Therefore, a
quantitative and comprehensive result can be returned by this relative efficiency evaluation
method and it can support the continuous improvement of PSP. &copy; Springer-Verlag Berlin
Heidelberg 2005.
Number of references:15
Main heading:Software engineering
Controlled terms:Computer simulation - Computer software - Data acquisition - Multivariable
control systems - Problem solving
Uncontrolled terms:Data Envelopment Analysis (DEA) - Different measurement units - Personal
Software Process (PSP)
Classification code:723.1 Computer Programming - 723.4 Artificial Intelligence - 723.5 Computer
Applications - 731.1 Control Systems
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 21>
Accession number:20071510542047
Title:The modeling analysis of cryptographic protocols using Promela
Authors:Xiao, Meihua (1); Li, Jing (1)
Author affiliation:(1) School of Information Engineering, Nanchang University, Nanchang 330029,
China; (2) Key Laboratory for Computer Science, Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China
Corresponding author:Xiao, M.
        (xiao_mh@263.net)

Source title:Proceedings of the World Congress on Intelligent Control and Automation (WCICA)
Abbreviated source title:Proc. World Congr. Intelligent Control Autom. WCICA
Volume:1
Monograph title:Proceedings of the World Congress on Intelligent Control and Automation
(WCICA)
Issue date:2006
Publication year:2006
Pages:4321-4325
Article number:1713191
Language:English
ISBN-10:1424403324
ISBN-13:9781424403325
Document type:Conference article (CA)
Conference name:6th World Congress on Intelligent Control and Automation, WCICA 2006
Conference date:June 21, 2006 - June 23, 2006
Conference location:Dalian, China
Conference code:69445
Publisher:Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:The analysis and verification of security protocols is an important field in the security of
computer nowadays. Model checking technique to the analysis of security protocols has proved
remarkably successful, which involves three parts: modeling of system behaviors, description of
system properties and system verification. Modeling of system behaviors is a highly challenging
task because of its complexity, especially modeling of intruder capability. A general method is
proposed to construct a Promela model of the cryptographic protocol, and make use of this way to
model the Helsinki protocol. The Promela model of Helsinki protocol is automatically verified by
model checker Spin and an attack to Helsinki protocol has successfully been found. Experimental
result shows the verification validity via message sequence chart. The general method may
become a good guideline for verifying similar cryptographic protocols. &copy; 2006 IEEE.
Number of references:11
Main heading:Security of data
Controlled terms:Cryptography - Data reduction - Formal methods - Model checking - Systems
analysis
Uncontrolled terms:Cryptographic protocol - Helsinki protocol - Promela model
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.1 Computer Programming - 723.2 Data Processing and Image
Processing - 723.5 Computer Applications - 912.3 Operations Research - 961 Systems Science
Treatment:Theoretical (THR); Experimental (EXP)
DOI:10.1109/WCICA.2006.1713191
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 22>
Accession number:20064510226364
Title:Universal inverting algorithms for bounded one-way functions
Authors:Xue, Rui (1); Liu, Ji-Qiang (2)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Department of Computer and Information
Technology, Beijing Jiaotong University, Beijing 100044, China
Corresponding author:Xue, R.
       (rxue@purdue.edu)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:9
Issue date:September 2006
Publication year:2006
Pages:1603-1607
Language:English
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:Bounded one-way function is a new cryptographic primitive proposed for the foundation
of practical cryptography. The relation between general one-way function and bounded one-way
function is given by authors previously. The existence of one-way function is an open problem,
which is related to some important open problems in computer science, such as NP problem.
Bounded one-way function gives a new insight in the one-way function. From the relation
between bounded and general one-way function, it is clear that if there exists a c-bounded
one-way function for any positive integer c, then there exists a one-way function. While modern
cryptography theory depends on the existence of one-way function, it is deserved continuing to
investigate the hardness of one-way function. The authors explore, in this paper, the hardness of
bounded one-way functions. The authors concentrate ourselves to the c-bounded one-way function
for a fixed integer c. The main result in this paper is that for any integer c&gt;0, there exists an
algorithm of c-bounded called universal algorithm for all c-bounded one-way functions, such that,
its success probability bounds up success probability of any inverting algorithm of c-bounded for
sufficient large n. This is a uniform bound for c-bounded inverters, and hence a characterization
for c-bounded one-way functions.
Number of references:5
Main heading:Cryptography
Controlled terms:Algorithms - Boundary element method - Computational complexity - Computer
science - Functions - Inverse problems - Public key cryptography - Security of data
Uncontrolled terms:Bounded one way function - Negligible functions - NP problem - Universal
inverting algorithm
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.2 Data Processing and Image Processing - 921.6 Numerical
Methods
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 23>
Accession number:20071910589189
Title:Joint adaptive intra refreshment and unequally error protection algorithms for robust
transmission of H.264/AVC video
Authors:Jin, Xu (1); Zhimei, Wu (1)
Author affiliation:(1) Multimedia Communication Research Center, Institute of Software, Chinese
Academy of Sciences (ISCAS), Beijing 100080, China
Corresponding author:Jin, X.
Source title:2006 IEEE International Conference on Multimedia and Expo, ICME 2006 -
Proceedings
Abbreviated source title:IEEE Int. Conf. Multimedia Expo ICME Proc.
Volume:2006
Monograph title:2006 IEEE International Conference on Multimedia and Expo, ICME 2006 -
Proceedings
Issue date:2006
Publication year:2006
Pages:693-696
Article number:4036694
Language:English
ISBN-10:1424403677
ISBN-13:9781424403677
Document type:Conference article (CA)
Conference name:2006 IEEE International Conference on Multimedia and Expo, ICME 2006
Conference date:July 9, 2006 - July 12, 2006
Conference location:Toronto, ON, Canada
Conference code:69554
Sponsor:IEEE Circuits and Systems Society; IEEE Communications Society; IEEE Computer
Society; IEEE Signal Processing Society
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:In this paper, we propose an efficient intra refreshment algorithm, which can achieve
both the global optimization in determining the intra refreshing ratio and the local accuracy in
selecting the proper macroblocks to be intracoded before the current frame is actually encoded.
Furthermore, incorporated with our proposed intra refreshment algorithm, an effective UEP
scheme based on a dynamic FMO mapping mode is also proposed in this paper to better protect
the intra macroblocks in a frame. The experimental results show that our joint intra refreshment
and UEP algorithm can remarkably improve the reconstructed video quality in the packet lossy
network. &copy; 2006 IEEE.
Number of references:6
Main heading:Image communication systems
Controlled terms:Adaptive systems - Algorithms - Block codes - Dynamic programming -
Optimization - Robust control
Uncontrolled terms:Macroblocks - Mapping modes - Packet lossy networks - UEP algorithms
Classification code:716 Telecommunication; Radar, Radio and Television - 723.1 Computer
Programming - 723.4 Artificial Intelligence - 731 Automatic Control Principles and Applications -
921.5 Optimization Techniques
Treatment:Theoretical (THR); Experimental (EXP)
DOI:10.1109/ICME.2006.262540
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 24>
<RECORD 1>
Accession number:20064410214585
Title:Efficient digital ink multi-dimension data coding algorithm
Authors:Li, Jun-Feng (1); Dai, Guo-Zhong (1)
Author affiliation:(1) Human Computer Interaction and Intelligent Information Processing
Laboratory, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Li, J.-F.
        (solemnizeljf@hotmail.com)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:9
Issue date:September 2006
Publication year:2006
Pages:1860-1866
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:An efficient digital ink data coding algorithm IWPHSP (integer wavelet packet based
hierarchical set partitioned) is proposed in this paper. The algorithm compresses digital ink
multi-dimension data losslessly using three approaches: integer wavelet packet transform,
hierarchical set partitioned, significant bits combination code and fast adaptive arithmetic code.
The experiments show that the IWPHSP algorithm is efficient.
Number of references:12
Main heading:Interactive devices
Controlled terms:Algorithms - Bits - Codes (symbols) - Data compression - Data processing -
Digital arithmetic - Encoding (symbols) - Ink - Set theory - Wavelet transforms
Uncontrolled terms:Arithmetic codes - Data coding - Digital ink - Hierarchical set partitioned -
Integer wavelet packet transforms - Multi dimensional - Significant bits combination codes
Classification code:716.1 Information Theory and Signal Processing - 721.1 Computer Theory,
Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722.2
Computer Peripheral Equipment - 723.2 Data Processing and Image Processing - 921
Mathematics
Treatment:Applications (APP); Theoretical (THR); Experimental (EXP)
DOI:10.1360/jos171860
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 25>
Accession number:20070710422653
Title:Extending interactive Web services for improving presentation level integration in Web
portals
Authors:Song, Jing-Yu (1); Wei, Jun (1); Wan, Shu-Chao (1); Huang, Tao (1)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Song, J.-Y.
        (songjy@otcaix.iscas.ac.cn)

Source title:Journal of Computer Science and Technology
Abbreviated source title:J Comput Sci Technol
Volume:21
Issue:4
Issue date:2006
Publication year:2006
Pages:620-630
Language:English
ISSN:10009000
CODEN:JCTEEM
Document type:Journal article (JA)
Publisher:Springer New York LLC, 233 Springer Street, New York, 10013-1578, United States
Abstract:Presentation level integration now becomes an important and fast growing trend in
enterprise computing. Portal-based composite applications use portlet and interactive web service,
which usually offers several portlets, as their basic constituents. Hence, portlet description and
discovery are the key issues that have to be considered for the development of portal-based
composite applications. This paper proposes a novel concept POI (Presentation Oriented Interface)
to describe the presentation features of a portlet, so that interactive web services may be extended
to facilitate the selection and interoperation of portlets. Portlet discovery can be effectively
achieved based on the calculation of POI similarity that considers both type and structure
similarity. Experiments show that the proposed approach can improve the satisfaction of portlet
discovery, and also facilitate the portlet interoperation, thereby achieving better application
integration at presentation level. &copy; Springer Science + Business Media, Inc. 2006.
Number of references:20
Main heading:Telecommunication services
Controlled terms:Industrial management - Interactive computer graphics - Portals - Requirements
engineering - User interfaces
Uncontrolled terms:Interactive web services - Portlet - Presentation Oriented Interface (POI)
Classification code:716 Telecommunication; Radar, Radio and Television - 722.2 Computer
Peripheral Equipment - 723 Computer Software, Data Handling and Applications - 912.2
Management
Treatment:Theoretical (THR)
DOI:10.1007/s11390-006-0620-9
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 26>
Accession number:2006229911991
Title:Intrusion detection for ad hoc routing based on fuzzy behavior analysis
Authors:Zhang, Xiaoning (1); Feng, Dengguo (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Zhang, X.
        (zxnmail@21cn.com)

Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development
Abbreviated source title:Jisuanji Yanjiu yu Fazhan
Volume:43
Issue:4
Issue date:April 2006
Publication year:2006
Pages:621-626
Language:Chinese
ISSN:10001239
CODEN:JYYFEY
Document type:Journal article (JA)
Publisher:Science Press
Abstract:Mobile ad hoc network is a kind of network that does not need infrastructure. In such
networks mobile nodes are self-organized and provide network routing for each other. Ad hoc
networks are extremely vulnerable to attacks, especially internal attacks. In this paper, an intrusion
detection scheme is proposed to detect internal routing attacks. In the scheme, every node
monitors its adjacent nodes and tries to detect their misbehavior by analyzing the difference
between their route behavior and the route specification. An FBA (fuzzy behavior analysis)
method is introduced into the data analysis procedure, which can greatly decrease the false alarm
rate. Simulation result shows that the scheme can effectively detect intrusions, while keeping the
false alarm rate comparatively low.
Number of references:11
Main heading:Security of data
Controlled terms:Computer simulation - Data acquisition - Data reduction - Fuzzy control -
Specifications
Uncontrolled terms:Dynamic source routing (DSR) - False alarm rate - Fuzzy behavior analysis
(FBA) - Infrastructure - Internal attacks - Intrusion detection - Mobile ad hoc network - Network
routing - Routing behavior analysis detection
Classification code:723.2 Data Processing and Image Processing - 723.5 Computer Applications -
731.1 Control Systems - 902.2 Codes and Standards - 921 Mathematics
Treatment:Applications (APP)
DOI:10.1360/crad20060408
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 27>
Accession number:20080611078662
Title:A presentation feature based approach to improving interactive web service discovery in web
portals
Authors:Jingyu, Song (1); Jun, Wei (1); Shuchao, Wan (1); Hua, Zhong (1)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Jingyu, S.
        (songjy@otcaix.iscas.ac.cn)

Source title:Proceedings - IEEE International Conference on e-Business Engineering, ICEBE
2006
Abbreviated source title:Proc. IEEE Int. Conf. e-Bus. Eng. ICEBE
Monograph title:Proceedings - IEEE International Conference on e-Business Engineering, ICEBE
2006
Issue date:2006
Publication year:2006
Pages:563-570
Article number:4031707
Language:English
ISBN-10:0769526454
ISBN-13:9780769526454
Document type:Conference article (CA)
Conference name:IEEE International Conference on e-Business Engineering, ICEBE 2006
Conference date:October 24, 2006 - October 26, 2006
Conference location:Shanghai, China
Conference code:71267
Sponsor:IEEE Computer Society Technical Committee on Electronic Commerce
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Presentation level integration now becomes an important and fast growing trend in
enterprise computing and portal-based composite applications are the mainstream to realize it.
Such applications use portlet and interactive web service, which usually offers several portlets, as
their basic constituents. Hence, portlet description and discovery are the key issues that have to be
considered. This paper proposes a novel concept POI (Presentation Oriented Interface) to describe
the presentation features of a portlet, so that interactive web services may be extended to facilitate
the selection and interoperation of portlets. Interactive web services discovery can be effectively
achieved based on the calculation of POI similarity that considers both type and structure
similarity. Experiments show that the proposed approach can improve the satisfaction of service
discovery, thereby achieving better application integration at presentation level. &copy; 2006
IEEE.
Number of references:13
Main heading:Web services
Controlled terms:Data mining - Feature extraction - Portals
Uncontrolled terms:Enterprise computing - Service discovery
Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer
Software, Data Handling and Applications - 723.2 Data Processing and Image Processing
Treatment:Theoretical (THR)
DOI:10.1109/ICEBE.2006.10
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 28>
Accession number:20070110348718
Title:Research on Chinese Linux input method engine standard
Authors:Xie, Qian (1); Jiang, Li (1); Wu, Jian (1); Sun, Yufang (1)
Author affiliation:(1) Open System and Chinese Information Processing Center, Institute of
Software, Chinese Acad. of Sci., Beijing 100080, China; (2) School of Computer and Information
Engineering, Henan University, Kaifeng 475001, China
Corresponding author:Xie, Q.
       (xieqian02@iscas.cn)

Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development
Abbreviated source title:Jisuanji Yanjiu yu Fazhan
Volume:43
Issue:11
Issue date:November 2006
Publication year:2006
Pages:1965-1971
Language:Chinese
ISSN:10001239
CODEN:JYYFEY
Document type:Journal article (JA)
Publisher:Science Press, 18,Shuangqing Street,Haidian, Beijing, 100085, China
Abstract:There are several input method frameworks along with corresponding implementations
coexisting on Linux. The situation indicates inadequateness of existing standardizing effort
focusing on input method protocol. However, IME (input method engine) interface standard
developed by China Linux Standards Group introduces a brand new way to standardize input
method, and makes it possible to develop an adaptive IME working on different frameworks.
Based on the survey and synthesis of the existing input method frameworks on Linux, rationale
and benefit of IME interface standardization are analyzed. Features and design principles of the
standard are expounded. Entities related to input method are partitioned into four portions.
Runtime mechanisms of each portion as well as interactions between different portions are
analyzed in detail by means of event flow chart. Feasibility of the standard is demonstrated by
sample IME implementations. Three sample implementations that cover different aspects of IME
interface standard are briefly summarized. The design and developing practice can be referenced
in developing compliant IME. Finally, the prospect of promising applications and future working
directions are proposed.
Number of references:9
Main heading:Software engineering
Controlled terms:Character sets - Computer operating systems - Data processing - Flowcharting -
Standardization
Uncontrolled terms:Benefit - China Linux standards group - Chinese information processing -
Design principle - IME implementations - IME interface standardization - Inadequateness - Input
method engine (IME) - Linux standardization - Rationale - Runtime mechanisms
Classification code:722.2 Computer Peripheral Equipment - 723.1 Computer Programming -
723.2 Data Processing and Image Processing - 902.2 Codes and Standards
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 29>
Accession number:20083811574831
Title:Benchmarking of routing protocols for layered satellite networks
Authors:Wang, Junfeng (1); Xu, Fanjiang (2); Sun, Fuchun (3)
Author affiliation:(1) School of Computer Science and Engineering, Sichuan University, Chengdu
610064, China; (2) Institute of Software, Chinese Academy of Sciences, Beijing, 100080, China;
(3) Department of Computer Science and Technology, Tsinghua University, Beijing, 100084,
China
Corresponding author:Wang, J.
       (mailwangjf@yahoo.com.cn)

Source title:IMACS Multiconference on "Computational Engineering in Systems Applications",
CESA
Abbreviated source title:IMACS Multiconference "Comput. Eng. Syst. Appl.", CESA
Monograph title:IMACS Multiconference on "Computational Engineering in Systems
Applications", CESA
Issue date:2006
Publication year:2006
Pages:1087-1094
Article number:4105552
Language:English
ISBN-10:7302139229
ISBN-13:9787302139225
Document type:Conference article (CA)
Conference name:IMACS Multiconference on "Computational Engineering in Systems
Applications", CESA
Conference date:October 4, 2006 - October 6, 2006
Conference location:Beijing, China
Conference code:73096
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:As a key part of Next Generation Network (NGN) infrastructure, next generation
broadband satellite networks are expected to support a variety of applications with diverse
performance requirements. Research on the onboard routing protocols is the primary step to meet
the various QoS related requirements, which becomes feasible with the rapid development of
onboard processing capacity of satellite. In the paper, we evaluate the more fundamental metric of
convergence rate of RIP, OSPF, DRDT and MLSR routing protocols under various satellite
network scenarioes based on simulation. Though many literatures have argued that the routing
protocols running in terrestrial networks do not fit well for satellite networks, this paper presents
the simulation-based evaluation of typical terrestrial routing protocols in satellite settings
quantitatively and serves as a benchmark for satellite network routing protocol development and
performance evaluation.
Number of references:18
Main heading:Computer networks
Controlled terms:Applications - Arsenic compounds - Benchmarking - Communication satellites -
Industrial research - Network routing - Routing protocols - Satellites
Uncontrolled terms:Convergence rate - Performance evaluation - Satellite networks
Classification code:723 Computer Software, Data Handling and Applications - 804.1 Organic
Compounds - 804.2 Inorganic Compounds - 722.3 Data Communication, Equipment and
Techniques - 901.3 Engineering Research - 912.1 Industrial Engineering - 913 Production
Planning and Control; Manufacturing - 912 Industrial Engineering and Management - 722
Computer Systems and Equipment - 655.2 Satellites - 655.2.1 Communication Satellites - 703.1
Electric Networks - 451.2 Air Pollution Control - 716 Telecommunication; Radar, Radio and
Television - 718 Telephone Systems and Related Technologies; Line Communications - 721
Computer Circuits and Logic Elements - 717 Optical Communication
DOI:10.1109/CESA.2006.313487
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 30>
Accession number:2006249938939
Title:Signal integrity for the design of high speed switch
Authors:Li, Nan (0); Liu, Qiong (0); Wu, Zhimei (0)
Corr. author affiliation:Institute of Software, Chinese Academy of Sciences, Beijing 100080,
China
Source title:Jisuanji Gongcheng/Computer Engineering
Abbreviated source title:Jisuanji Gongcheng
Volume:32
Issue:10
Issue date:May 20 2006
Publication year:2006
Pages:237-239+242
Language:Chinese
ISSN:10003428
CODEN:JISGEV
Document type:Journal article (JA)
Publisher:Shanghai Computer Society, Shanghai, China
Abstract:The signal integrity issue is very important in the design of high-speed communication
devices. This paper addresses some signal integrity problems encountered during the design of a
layer-3 switch, such as the noise of power distribution system, clock jitter, propagation delay and
impedance of transmission line. The techniques are summarized for solving these problems.
Number of references:8
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 31>
Accession number:20064210172879
Title:A powerful technique to eliminate isomorphism in finite model search
Authors:Jia, Xiangxue (1); Zhang, Jian (1)
Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of
Sciences; (2) Graduate University, Chinese Academy of Sciences
Corresponding author:Jia, X.
Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4130 LNAI
Monograph title:Automated Reasoning - Third International Joint Conference, IJCAR 2006,
Proceedings
Issue date:2006
Publication year:2006
Pages:318-331
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540371877
ISBN-13:9783540371878
Document type:Conference article (CA)
Conference name:Third International Joint Conference on Automated Reasoning, IJCAR 2006
Conference date:August 17, 2006 - August 20, 2006
Conference location:Seattle, WA, United states
Conference code:68295
Publisher:Springer Verlag
Abstract:We propose a general-purpose technique, called DASH (Decision Assignment Scheme
Heuristic), to eliminate isomorphic subspaces when generating finite models. Like LNH, DASH is
based on inherent isomorphism in first order clauses on finite domains. Unlike other methods,
DASH can completely eliminate isomorphism during the search. Therefore, DASH can generate
all the models none of which are isomorphic. And DASH is an efficient technique for finite model
enumeration. The main idea is to cut the branch of the search tree which is isomorphic to a branch
that has been searched. We present a new method to describe the class of isomorphic branches. We
implemented this technique by modifying SEM1.7B, and the new tool is called SEMD. This
technique proves to be very efficient on typical problems like the generation of finite groups, rings
and quasigroups. The experiments show that SEMD is much faster than SEM on many problems,
especially when generating all the models and when there is no model. SEMD can generate all the
non-isomorphic models with little extra cost, while other tools like MACE4 will spend more time.
&copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:22
Main heading:Heuristic methods
Controlled terms:Mathematical models - Problem solving - Theorem proving - Trees
(mathematics)
Uncontrolled terms:Finite model enumeration - Isomorphic subspaces - Isomorphism - Search tree
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.4 Artificial Intelligence - 921 Mathematics - 921.4
Combinatorial Mathematics, Includes Graph Theory, Set Theory
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 32>
Accession number:20064510226375
Title:Cryptanalysis of an identity-based verifiably encrypted signature scheme
Authors:Zhang, Zhen-Feng (1)
Author affiliation:(1) Stale Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Zhang, Z.-F.
        (zfzhang@is.iscas.ac.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:9
Issue date:September 2006
Publication year:2006
Pages:1688-1693
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:Based on Hess's identity-based signature scheme, Gu and Zhu proposed an identity-based
verifiably encrypted signature scheme in CISC 2005. The authors claim that their scheme is
provably secure in the random oracle model and can be used as a primitive to construct
identity-based optimistic fair exchange protocols. However, this paper shows that their protocol is
insecure: A malicious signer can easily generate a valid verifiably encrypted signature, which can
not be extracted into an ordinary signature by a designated adjudicator. Moreover, the protocol is
also vulnerable to colluding attacks.
Number of references:14
Main heading:Network protocols
Controlled terms:Cryptography - Electronic commerce - Electronic data interchange - Electronic
document exchange - Electronic document identification systems - Identification (control systems)
- Random processes - Security of data
Uncontrolled terms:Bilinear pairing - CISC 2005 - Colluding attacks - Cryptanalysis - Hess -
Identity based optimistic fair exchange protocols - Identity based signature - Malicious signer -
Random oracle model - Verifiably encrypted signature
Classification code:723.2 Data Processing and Image Processing - 723.5 Computer Applications -
731.1 Control Systems - 911.2 Industrial Economics - 922.1 Probability Theory
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 33>
Accession number:20064710250562
Title:A network flow approach to the Minimum Common Integer Partition Problem
Authors:Zhao, Wenbo (1); Zhang, Peng (1); Jiang, Tao (3)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, P.O. Box 8718, Beijing,
100080, China; (2) Graduate University, Chinese Academy of Sciences, Beijing, China; (3)
Department of Computer Science and Engineering, University of California at Riverside, United
States
Corresponding author:Zhao, W.
        (zwenbo@gcl.iscas.ac.cn)

Source title:Theoretical Computer Science
Abbreviated source title:Theor Comput Sci
Volume:369
Issue:1-3
Issue date:December 15, 2006
Publication year:2006
Pages:456-462
Language:English
ISSN:03043975
CODEN:TCSCDI
Document type:Journal article (JA)
Publisher:Elsevier
Abstract:In the k-Minimum Common Integer Partition Problem, abbreviated as k-MCIP, we are
given k multisets X<inf>1</inf>, ..., X<inf>k</inf> of positive integers, the goal is to find an
integer multiset T of the minimum size such that for every i, we can partition each of the integers
in X<inf>i</inf> so that the disjoint (multiset) union of their partitions equals T. This problem has
applications in computational molecular biology, in particular, ortholog assignment and DNA
hybridization fingerprint assembly. The problem is known to be NP-hard for any k &ge; 2. In this
article, we improve the approximation ratio for k-MCIP by viewing this problem as a flow
decomposition problem in some flow network. We show an efficient 0.5625 k-approximation
algorithm, improving upon the previously best known 0.6139 k-approximation algorithm for this
problem. &copy; 2006 Elsevier B.V. All rights reserved.
Number of references:10
Main heading:Integer programming
Controlled terms:Algorithms - Approximation theory - Computational methods - DNA -
Molecular biology - Problem solving
Uncontrolled terms:Approximation algorithm - Flow decomposition problem - Minimum
Common Integer Partition - Network flow
Classification code:461.2 Biological Materials and Tissue Engineering - 461.9 Biology - 721.1
Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming
Theory - 723.4 Artificial Intelligence - 921.5 Optimization Techniques - 921.6 Numerical Methods
Treatment:Theoretical (THR)
DOI:10.1016/j.tcs.2006.09.001
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 34>
Accession number:20062910013718
Title:On-demand multicast routing protocol based on node classification in MANET
Authors:Deng, Xia (1); Sun, Li-Min (2); Wang, Jian-Xin (1); Luo, Yu-Hong (1); Chen, Jian-Er (1)
Author affiliation:(1) School of Information Science and Engineering, Central South University,
Changsha 410083, China; (2) Institute of Software, Chinese Academy of Sciences, Beijing 100080,
China
Corresponding author:Deng, X.
Source title:Journal of Central South University of Technology (English Edition)
Abbreviated source title:J Cent South Univ Technol Eng Ed
Volume:13
Issue:2
Issue date:April 2006
Publication year:2006
Pages:190-195
Language:English
ISSN:10059784
CODEN:JCSTFT
Document type:Journal article (JA)
Publisher:Central South University of Technology
Abstract:An improved on-demand multicast routing protocol (ODMRP), node classification
on-demand multicast routing protocol (NC-ODMRP), which is based on node classification in
mobile ad hoc networks was proposed. NC-ODMRP classifies nodes into such three categories as
ordinary node, forwarding group (FG) node, neighbor node of FG node according to their history
forwarding information. The categories are distinguished with different weights by a weight table
in the nodes. NC-ODMRP chooses the node with the highest weight as an FG node during the
setup of forwarding group, which reduces a lot of redundant FG nodes by sharing more FG nodes
between different sender and receiver pairs. The simulation results show that NC-ODMRP can
reduce more than 20% FG number of ODMRP, thus enhances nearly 14% data forwarding
efficiency and 12% energy consumption efficiency when the number of multicast senders is more
than 5.
Number of references:17
Main heading:Mobile telecommunication systems
Controlled terms:Classification (of information) - Error correction - Multicasting - Multipath
propagation - Network protocols - Wireless telecommunication systems
Uncontrolled terms:Forwarding group (FG) node - Mobile ad hoc networks - Multicast - Node
classification on demand multicast routing protocol (NC ODMRP) - On demand multicast routing
protocol (ODMRP)
Classification code:716 Telecommunication; Radar, Radio and Television - 717 Optical
Communication - 718 Telephone Systems and Related Technologies; Line Communications -
721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory,
Programming Theory - 723 Computer Software, Data Handling and Applications
Treatment:Applications (APP); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 35>
Accession number:2006199861498
Title:A multi-objective optimization model of the partner selection problem in a virtual enterprise
and its solution with genetic algorithms
Authors:Fuqing, Zhao (1); Yi, Hong (1); Dongmei, Yu (2)
Author affiliation:(1) School of Computer and Communication Engineering, Lanzhou Univ. of
Tech., Lanzhou 730050, China; (2) Key Laboratory of Computer Science, Institute of Software,
Chinese Academy of Science, Beijing 100080, China
Corresponding author:Fuqing, Z.
        (zhaofq@mail2.lut.cn)

Source title:International Journal of Advanced Manufacturing Technology
Abbreviated source title:Int J Adv Manuf Technol
Volume:28
Issue:11-12
Issue date:May 2006
Publication year:2006
Pages:1246-1253
Language:English
ISSN:02683768
E-ISSN:14333015
CODEN:IJATEA
Document type:Journal article (JA)
Publisher:Springer-Verlag London Ltd
Abstract:Virtual enterprise is a basic organization form to achieve agile manufacturing in a
manufacturing enterprise. One of the key factors of virtual enterprise's success is that the dominant
enterprise can make the correct decision in the selection of a cooperative partner. In this paper, a
multi-objective optimization model is proposed from an activity network project. Based on the
concept of inefficient candidate, the solution space of the problem is first reduced. Then, an R-GA
with embedded project scheduling is developed for solving the problem, where fuzzy
factors-based rules are proposed in order to modify the partner selection according to different
situations in the evaluation process of the genetic algorithm by using the characteristics of the
considered problem and the knowledge of project scheduling. The results indicate that the
proposed model and algorithm can obtain satisfactory solutions.
Number of references:20
Main heading:Genetic algorithms
Controlled terms:Algorithms - Decision making - Fuzzy control - Mathematical models -
Optimization - Problem solving - Scheduling
Uncontrolled terms:Agile manufacturing - Multi-objective optimization model - Partner selection
problem - Project scheduling - Virtual enterprise
Classification code:723 Computer Software, Data Handling and Applications - 723.4 Artificial
Intelligence - 731.1 Control Systems - 912.2 Management - 921 Mathematics - 921.5
Optimization Techniques
Treatment:Theoretical (THR)
DOI:10.1007/s00170-004-2461-4
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 36>
Accession number:2006289996313
Title:Building reliable content-based routing protocol over structured P2P networks
Authors:Wang, Jin-Ling (1); Jin, Bei-Hong (1); Li, Jing (1)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Graduate School, Chinese Academy of Sciences,
Beijing 100049, China
Corresponding author:Wang, J.-L.
       (jlwang@otcaix.iscas.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:5
Issue date:May 2006
Publication year:2006
Pages:1107-1114
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:Much work has been done on building content-based publish/subscribe systems over
structured P2P networks, so that the two technologies can be combined together to better support
large-scale and highly dynamic systems. However, existing content-based routing protocols can
only provide weak reliability guarantees over P2P networks. Based on the routing protocols of
structured P2P networks, a new type of content-based routing protocol for pub/sub systems is
designed, which is called Identifier Range Based Routing (IRBR) protocol. The IRBR protocol
guarantees that the subscribing nodes always receive the interested events exactly once as long as
the message from publishing nodes to subscribing nodes is arrivable in the P2P network. At the
same time, it can also disseminate an event to all interested subscribers with less network traffic. A
prototype pub/sub system has been developed on Pastry, and the experimental results demonstrate
the fault-tolerance and routing efficiency of the protocol.
Number of references:23
Main heading:Network protocols
Controlled terms:Publishing - Reliability - Routers
Uncontrolled terms:Content based routing - Fault tolerance - Identifier range based routing (IRBR)
- Publish/subscribe - Routing protocols - Source based forwarding - Structured peer to peer (P2P)
network
Classification code:722.3 Data Communication, Equipment and Techniques - 723 Computer
Software, Data Handling and Applications - 903.2 Information Dissemination - 922.2
Mathematical Statistics
Treatment:Applications (APP)
DOI:10.1002/smll.200690035
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 37>
Accession number:20063510086582
Title:Cryptanalysis of two password authenticated key exchange protocols based on RSA
Authors:Cao, Tianjie (1); Lin, Dongdai (2)
Author affiliation:(1) School of Computer Science and Technology, China University of Mining
and Technology, Xuzhou 221008, China; (2) State Key Laboratory of Information Security,
Institute of Software of Chinese Academy of Sciences, Beijing 100080, China; (3) Graduate
School of the Chinese Academy of Sciences, Beijing 100039, China
Corresponding author:Cao, T.
        (tjcao@cumt.edu.cn)

Source title:IEEE Communications Letters
Abbreviated source title:IEEE Commun Lett
Volume:10
Issue:8
Issue date:August 2006
Publication year:2006
Pages:623-625
Language:English
ISSN:10897798
CODEN:ICLEF6
Document type:Journal article (JA)
Publisher:Institute of Electrical and Electronics Engineers Inc.
Abstract:In 2002, Zhu et al. proposed a password-based authenticated key exchange protocol
based on RSA. Many researchers pointed out that Zhu et al.'s protocol is vulnerable to off-line
dictionary attack. In 2003, Yeh et al. proposed an improved protocol. Recently, Lo and Yang-Wang
pointed out that Yeh et al.'s improved protocol is also vulnerable to offline dictionary attack. To
avoid this weakness existed in Yeh et al.'s protocol, Lo and Yang-Wang proposed two improved
protocols. However, in this letter, we show that the Lo protocol is vulnerable to an active off-line
dictionary attack and the Yang-Wang protocol is vulnerable to a passive off-line dictionary attack.
&copy; 2006 IEEE.
Number of references:12
Main heading:Network protocols
Controlled terms:Computer networks - Cryptography - Security of data
Uncontrolled terms:Cryptanalysis - Key agreement - Network security - Password authentication
Classification code:723.2 Data Processing and Image Processing - 723.5 Computer Applications
Treatment:Theoretical (THR)
DOI:10.1109/LCOMM.2006.1665131
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 38>
Accession number:20065010305271
Title:Optimizing implementation of patch-based texture synthesis
Authors:Wang, Yiping (0); Wang, Wencheng (0); Wu, Enhua (0)
Corresponding author:Wang, Y.
Corr. author affiliation:State Key Laboratory of Computer Science, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and
Computer Graphics
Abbreviated source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao
Volume:18
Issue:10
Issue date:October 2006
Publication year:2006
Pages:1502-1507
Language:Chinese
ISSN:10039775
CODEN:JFTXFX
Document type:Journal article (JA)
Publisher:Institute of Computing Technology, Beijing, China
Abstract:For patch-based texture synthesis, this paper investigates the influence of its parameters
on synthesis efficiency, where the parameters are the shape and size of patches and the size of the
overlap regions between neighbour patches. Based on the texture features, the periods of texture
change and the constraint from the overlap regions, techniques are given in the paper to measure
the influence of the parameters, and therefore, to adaptively optimize the parameters for
promoting texture synthesis.
Number of references:10
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 39>
Accession number:20064110165636
Title:Delegation model for periodicity constraints-based DAC
Authors:Zhang, Hong (1); He, Ye-Ping (1); Shi, Zhi-Guo (1)
Author affiliation:(1) National Engineering Research Center for Foundational Software, Institute
of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Graduate University, Chinese Acad.
of Sci., Beijing 100039, China
Corresponding author:Zhang, H.
         (hong@ercist.iscas.ac.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:8
Issue date:August 2006
Publication year:2006
Pages:1427-1437
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:Currently, general DAC model doesn't support for constraints on the usage of delegated
permissions in information systems. This paper firstly consider the Bertino's work which introduce
periodic time and temporal dependencies in DAC model, and then presents a permission
delegation model PDACDM to support temporary constraints, temporal dependencies constraints
and propagation constraints. PDACDM uses periodic time, the number of usage times and a time
interval of validity to control temporal delegation, uses derivation rule to control the temporal
dependencies between permissions, uses delegation depth to control the propagation of delegated
permissions. Authors give formal definition of PDACDM and prove execution model consistency
to show that it provides the foundation for applications executing the permission delegation.
Number of references:14
Main heading:Network protocols
Controlled terms:Constraint theory - Formal logic - Functions - Knowledge based systems -
Mathematical models - Security of data - Theorem proving
Uncontrolled terms:Derivation rules - Discretionary access control - Information security -
Periodic time - Permission delegation - Propagation constraints - Temporal dependencies
constraints - Temporary constraints - Usage times
Classification code:716 Telecommunication; Radar, Radio and Television - 721.1 Computer
Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723
Computer Software, Data Handling and Applications - 731.1 Control Systems - 921 Mathematics
Treatment:Applications (APP); Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 40>
Accession number:20065110322622
Title:Maximum-likelihood estimation of haplotype frequencies in trio pedigrees
Authors:Zhang, Qiangfeng (1); Chen, Guoliang (1); Xu, Yun (1); Che, Haoyang (2)
Author affiliation:(1) Department of Computer Science and Technology, University of Science and
Technology of China, Hefei, Anhui, 230027, China; (2) Laboratory of Computer Science, Institute
of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Zhang, Q.
       (qfzhang@mail.ustc.edu.cn)

Source title:First International Multi- Symposiums on Computer and Computational Sciences,
IMSCCS'06
Abbreviated source title:First Int. Multi-Symp. Comput. Computation. Sci.
Volume:1
Monograph title:First International Multi- Symposiums on Computer and Computational Sciences,
IMSCCS'06
Issue date:2006
Publication year:2006
Pages:35-39
Article number:1636015
Language:English
ISBN-10:0769525814
ISBN-13:9780769525815
Document type:Conference article (CA)
Conference name:First International Multi- Symposiums on Computer and Computational
Sciences, IMSCCS'06
Conference date:April 20, 2006 - April 24, 2006
Conference location:Hangzhou, Zhejiang, China
Conference code:68798
Sponsor:STEMES/IMSCCS Conference, USA; University of Iowa, USA; Zhejing University,
China; Harbin Engineering University, China
Publisher:Institute of Electrical and Electronics Engineers Computer Society
Abstract:Most past efforts only focus on haplotyping on genotype data of unrelated individuals
and data with general pedigrees but give insufficient effort to the special case of trio genotype data.
We present a two-stage method in this paper, which first determines all feasible haplotype
configurations for each trio, then uses the expectation-maximization (EM) algorithm to estimate
haplotype frequencies based on these haplotype configurations. We design the haplotyping
algorithm and the EM algorithm to estimate haplotype frequencies for this special trio genotype
data. All algorithms are implemented in a C software package TRIOHAP. Its effectiveness and
efficiency have been tested both on simulated and real data sets. The experimental results show
that, TRIOHAP runs much faster than the other popular haplotyping software, which discards the
trio information. Moreover, because TRIOHAP utilizes such information, our estimation is more
accurate and more reliable. &copy; 2006 IEEE.
Number of references:12
Main heading:Computer science
Controlled terms:Algorithms - Biotechnology - Computer simulation - Computer software - Data
reduction - Genes
Uncontrolled terms:Haplotyping software - Pedigrees - Real data sets - Trio genotype data
Classification code:461.2 Biological Materials and Tissue Engineering - 461.8 Biotechnology -
721 Computer Circuits and Logic Elements - 723 Computer Software, Data Handling and
Applications - 723.2 Data Processing and Image Processing - 723.5 Computer Applications
Treatment:Theoretical (THR)
DOI:10.1109/IMSCCS.2006.85
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 41>
<RECORD 1>
Accession number:20070210352392
Title:A practical alternative to domain and type enforcement integrity formal models
Authors:Tang, Liuying (1); Qing, Sihan (2)
Author affiliation:(1) Engineering Research Center of Fundamental Software, Institute of
Software, Chinese Academy of Science, Beijing 100080, China; (2) Engineering Research Center
for Information Security Technology, Institute of Software, Chinese Academy of Sciences, Beijing
100080, China; (3) ZhongkeAnsheng Corporation of Information Technology, Beijing 100086,
China; (4) Graduate School, Chinese Academy of Sciences, Beijing 100049, China
Corresponding author:Tang, L.
        (tangly@ercist.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4318 LNCS
Monograph title:Information Security and Cryptology - Second SKLOIS Conference, Inscrypt
2006, Proceedings
Issue date:2006
Publication year:2006
Pages:225-237
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540496084
ISBN-13:9783540496083
Document type:Conference article (CA)
Conference name:2nd SKLOIS Conference on Information Security and Cryptology, Inscrypt
2006
Conference date:November 29, 2006 - December 1, 2006
Conference location:Beijing, China
Conference code:68899
Publisher:Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany
Abstract:Much secure system policy development uses the DTE (Domain and Type Enforcement)
model, but the DTE model cannot explicitly provide the security goals of the policy. The
invariants of the only based-DTE integrity protection formal model are too complex and make the
model impractical. A DTE-Biba integrity formal model is proposed, in which DTE is the
underlying component and the Biba integrity is the security goal. The DTE-Biba formal model
describes direct Biba control relationships, and ignores the integrity level of objects. The aim is to
provide the foundation for supporting effective policy configuration, policy integrity analysis and
integrity verification of the DTE secure systems. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:12
Main heading:Security of data
Controlled terms:Information analysis - Mathematical models - Public policy
Uncontrolled terms:Formal model - Information flow - Security goal - Security label
Classification code:723.2 Data Processing and Image Processing - 901 Engineering Profession -
903.1 Information Sources and Analysis - 921 Mathematics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 42>
Accession number:20064010142083
Title:Non-deterministic event correlation based on C-F model
Authors:Zheng, Qiuhua (1); Qian, Yuntao (1); Yao, Min (1)
Author affiliation:(1) Computational Intelligence Research Laboratory, College of Computer
Science, Zhejiang University, Hangzhou, Zhejiang Province, China; (2) State Key Laboratory of
Information Security, Institute of Software, Chinese Academy of Sciences
Corresponding author:Zheng, Q.
       (zheng_qiuhua@163.com)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3614 LNAI
Monograph title:Fuzzy Systems and Knowledge Discovery - Second International Conference,
FSKD 2005, Proceedings
Issue date:2006
Publication year:2006
Pages:1107-1117
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-13:9783540283317
Document type:Conference article (CA)
Conference name:2nd International Conference on Fuzzy Systems and Knowledge Discovery,
FSKD 2005
Conference date:August 27, 2005 - August 29, 2005
Conference location:Changsa, China
Conference code:68203
Publisher:Springer Verlag
Abstract:This paper proposes a non-deterministic event correlation technique for diagnosis
problem of end-to-end service in network, which uses an event - fault model based on path
domain of events. The technique utilizes a refined heuristic approach to create and update fault
hypotheses that can explain these events received by system, and computes these hypotheses'
belief by C-F model method. The result of event correlation is the hypothesis with maximum
belief. Simulation shows this approach can get a high accuracy even in the case of low
observability events ratio. &copy; Springer-Verlag Berlin Heidelberg 2005.
Number of references:12
Main heading:Correlation methods
Controlled terms:Computer networks - Computer simulation - Diagnosis - Fault tolerant computer
systems - Heuristic methods - Mathematical models
Uncontrolled terms:Event correlation - Non-deterministic event - Path domain
Classification code:461.6 Medicine and Pharmacology - 722.4 Digital Computers and Systems -
723 Computer Software, Data Handling and Applications - 723.5 Computer Applications - 921
Mathematics - 922.2 Mathematical Statistics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 43>
Accession number:20064910289459
Title:Research and development of instant messaging worms
Authors:Qing, Si-Han (1); Wang, Chao (1); He, Jian-Bo (1); Li, Da-Zhi (2)
Author affiliation:(1) Engineering Research Center for Information Security Technology, Institute
of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Beijing ZhongkeAnsheng
Corporation of Information Technology, Beijing 100086, China; (3) Graduate School, Chinese
Academy of Sciences, Beijing 100049, China
Corresponding author:Qing, S.-H.
       (qsihan@ercist.iscas.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:10
Issue date:October 2006
Publication year:2006
Pages:2118-2130
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:With the abroad application of instant messaging and explosive growth of users in
current years, IM worms have higher outbreak frequency, wider coverage and deeper hurt, which
have been a serious threat to network security. In this paper, the concept and research situation of
IM (instant messaging)worms, function component, execution mechanism and comparison with
other worms are presented, then the network topology and propagation models are discussed, and
finally the critical techniques of IM worm prevention are given. Some major problems and
research trends in this area are also addressed.
Number of references:38
Main heading:Computer worms
Controlled terms:Communication - Internet - Prevention - Topology
Uncontrolled terms:Instant messaging (IM) worm - Internet worm - Network security - Network
topology - Propagation model
Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer
Software, Data Handling and Applications - 913.5 Maintenance - 921.4 Combinatorial
Mathematics, Includes Graph Theory, Set Theory
Treatment:Applications (APP)
DOI:10.1360/jos172118
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 44>
Accession number:20063610099122
Title:Interactive fur modeling based on hierarchical texture layers
Authors:Yang, Gang (1); Sun, Hanqiu (2); Wang, Wencheng (1); Wu, Enhua (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences; (2) Chinese University
of Hong Kong; (3) University of Macau; (4) Graduate School, Chinese Academy of Sciences
Corresponding author:Yang, G.
        (yg@ios.ac.cn)

Source title:Proceedings - VRCIA 2006ACM International Conference on Virtual Reality
Continuum and its Applications
Abbreviated source title:Proc. VRCIA Int. Conf. Virtual Reality Continuum Applic.
Volume:2006
Monograph title:Proceedings - VRCIA 2006: ACM International Conference on Virtual Reality
Continuum and its Applications
Issue date:2006
Publication year:2006
Pages:343-346
Language:English
Document type:Conference article (CA)
Conference name:VRCIA 2006: ACM International Conference on Virtual Reality Continuum and
its Applications
Conference date:June 14, 2006 - June 17, 2006
Conference location:Hong Kong, China
Conference code:68059
Sponsor:ACM SIGGRAPH; Eurographics Association
Publisher:Association for Computing Machinery
Abstract:This paper presents a system to interactively model and render fur on surfaces of
arbitrary topology. It employs the hierarchical layers of textured slices to represent fur so the
computation complexity on rendering and editing can be reduced greatly. The system utilizes
vector Held and scalar field to control the geometric variations of the furry shape. Users can
intuitively edit the fur by manipulating these fields, and view the variation results in real time. Our
system supports several interactive fur modeling operations, including combing, wind blowing,
interpolating, smoothing and disturbance operations, The experimental results have shown the
feasibility of the proposed approach. Copyright &copy; 2006 by tht Association for Computing
Machinery, Inc.
Number of references:8
Main heading:Interactive computer graphics
Controlled terms:Computer simulation - Geometry - Interpolation - Mathematical models - Three
dimensional computer graphics - Topology - Virtual reality
Uncontrolled terms:Hierarchical texture layers - Interactive modeling - Modeling - Scalar field
Classification code:723.5 Computer Applications - 921.4 Combinatorial Mathematics, Includes
Graph Theory, Set Theory - 921.6 Numerical Methods
Treatment:Theoretical (THR); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 45>
Accession number:20064310199285
Title:Model-based testing of concurrent programs with predicate sequencing constraints
Authors:Wu, Peng (1); Lin, Huimin (1)
Author affiliation:(1) Lab. of Computer Science, Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China; (2) CNRS, LIX, Ecole Polytechnique, Rue de Saclay, 91128
Palaiseau Cedex, France
Corresponding author:Wu, P.
       (wp@ios.ac.cn)

Source title:International Journal of Software Engineering and Knowledge Engineering
Abbreviated source title:Int. J. Software Engineer. Knowledge Engineer.
Volume:16
Issue:5
Issue date:October 2006
Publication year:2006
Pages:727-746
Language:English
ISSN:02181940
CODEN:ISEKEW
Document type:Journal article (JA)
Publisher:World Scientific Publishing Co. Pte Ltd
Abstract:A predicate sequencing constraint logic (PSCL) is proposed to represent test purpose for
concurrent program testing. The logic is capable of expressing not only sequencing relationships
among input and output events, but also data dependencies between event parameters. A
PSCL-based symbolic test generation method is developed to automatically derive symbolic test
cases that incorporate given data, dependency constraints as verdict conditions. The method works
in a syntactic way without referring to concrete program states and the derived test cases allow
dynamic test data selection according to the response from the software under test. The advantage
of the approach is demonstrated with a case study. &copy; World Scientific Publishing Company.
Number of references:28
Main heading:Concurrent engineering
Controlled terms:Computer simulation - Constraint theory - Data reduction - Formal logic -
Syntactics
Uncontrolled terms:Data selection - Model based testing - Predicate sequencing constraints -
Symbolic test generation
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.2 Data Processing and Image Processing - 723.5 Computer
Applications - 903.2 Information Dissemination - 913.6 Product Development; Concurrent
Engineering
Treatment:Theoretical (THR)
DOI:10.1142/S0218194006002999
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 46>
Accession number:20062910011341
Title:Study of neural networks for electric power load forecasting
Authors:Wang, Hui (1); Li, Bao-Sen (2); Han, Xin-Yang (3); Wang, Dan-Li (1); Jin, Hong (1)
Author affiliation:(1) Intelligence Engineering Lab., Institute of Software, CAS, Beijing, China; (2)
Jining Elactric Power Company, Shandong, China; (3) Dynamic Economy Research Center, State
Power Cooperation, Beijing, China; (4) School of Information Engineering, USTB, Beijing, China
Corresponding author:Wang, H.
        (Wanghui@ios.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3972 LNCS
Monograph title:Advances in Neural Networks - ISNN 2006: Third International Symposium on
Neural Networks, ISNN 2006, Proceedings - Part II
Issue date:2006
Publication year:2006
Pages:1277-1283
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540344373
ISBN-13:9783540344377
Document type:Conference article (CA)
Conference name:3rd International Symposium on Neural Networks, ISNN 2006 - Advances in
Neural Networks
Conference date:May 28, 2006 - June 1, 2006
Conference location:Chengdu, China
Conference code:67771
Publisher:Springer Verlag
Abstract:Electric Power Load Forecasting is important for the economic and secure operation of
power system, and highly accurate forecasting result leads to substantial savings in operating cost
and increased reliability of power supply. Conventional load forecasting techniques, including
time series methods and stochastic methods, are widely used by electric power companies for
forecasting load profiles. However, their accuracy is limited under some conditions. In this paper,
neural networks have been successfully applied to load forecasting. Forecasting model with
Neural Networks is set up based on the analysis of the characteristics of electric power load, and it
works well even with rapidly changing weather conditions. This paper also proposes a novel
method to improve the generalization ability of the Neural Networks, and this leads to further
increasing accuracy of load forecasting. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:12
Main heading:Electric load forecasting
Controlled terms:Cost accounting - Economic and social effects - Electric power systems - Neural
networks - Reliability - Stochastic control systems - Time series analysis
Uncontrolled terms:Electric Power Load Forecasting - Forecasting models - Time series methods -
Weather conditions
Classification code:706.1 Electric Power Systems - 723.4 Artificial Intelligence - 731.1 Control
Systems - 901.4 Impact of Technology on Society - 911.1 Cost Accounting - 922.2 Mathematical
Statistics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 47>
Accession number:2006189859678
Title:Stick textures for image-based rendering
Authors:Wang, Wencheng (1); Li, Kuiyu (1); Wu, Enhua (1)
Author affiliation:(1) State Key Laboratory of Computer Science, Institute of Software, Chinese
Academy of Sciences, Beijing, 100080, China; (2) Department of Computer and Information
Science, Faculty of S. T., University of Macau, Macao, China
Corresponding author:Wang, W.
       (whn@ios.ac.cn)

Source title:Graphical Models
Abbreviated source title:Graphical Models
Volume:68
Issue:3
Issue date:May 2006
Publication year:2006
Pages:294-306
Language:English
ISSN:15240703
CODEN:GRMOFM
Document type:Journal article (JA)
Publisher:Elsevier Inc.
Abstract:This paper presents a new data structure, called stick textures, to give a continuous and
compact 3D representation of the scene displayed in depth images. A stick texture is constructed
for each pixel of a depth image, composed of the interpolated pixels to fill the gaps between the
pixel and its neighbour pixels covered by a same continuous surface. Thus, rendering sticks
instead of pixels can save operations on hole-filling for acceleration, and produce high quality
novel images with 3D details and view motion parallax displayed very well. In addition, stick
textures are always short, and every stick texture can be rendered as a pixel. Therefore, stick
textures have not a high storage requirement, and they can be easily integrated with existing
image-based rendering methods to achieve high rendering efficiency, e.g., using GPUs for
acceleration and conveniently handling large-scale scenes, even the scenes with multi-layered
objects. Experimental results demonstrate the advantages of stick textures in image quality,
rendering speed and storage requirement. &copy; 2006 Elsevier Inc. All rights reserved.
Number of references:28
Main heading:Computer graphics
Controlled terms:Acceleration measurement - Data structures - Image analysis - Image quality -
Textures
Uncontrolled terms:Graphics data structures and data types - Graphics processors - Image-based
rendering - Object representation
Classification code:723.2 Data Processing and Image Processing - 723.3 Database Systems -
723.5 Computer Applications - 741 Light, Optics and Optical Devices - 933 Solid State Physics -
943.2 Mechanical Variables Measurements
Treatment:Theoretical (THR)
DOI:10.1016/j.gmod.2006.02.002
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 48>
Accession number:2006129773011
Title:Task-type aware transaction scheduling algorithm in J2EE
Authors:Ding, Xiao-Ning (1); Zhang, Xin (1); Jin, Bei-Hong (1); Huang, Tao (1)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Graduate School, Chinese Academy of Sciences,
Beijing 100049, China
Corresponding author:Ding, X.-N.
        (dxn@otcaix.iscas.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:1
Issue date:January 2006
Publication year:2006
Pages:31-38
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:J2EE is the primary middleware platform for distributed enterprise applications. Current
J2EE (Java 2 platform enterprise edition) transaction scheduling to entity beans is still a simple
First-Come First-Served (FCFS) policy. Due to this simple policy, transaction manager is unable
to distinguish the key tasks from the trivial ones and the performance of the key tasks is reduced
when the server's load is heavy. Since some characteristics of J2EE middleware, the traditional
scheduling algorithms can not be applied to J2EE directly. This paper puts forward a scheduling
algorithm named TMPBP (threaded multi-queue priority-based protocol). The algorithm includes
a heuristic priority assignment algorithm named HRS, which can recognize the key tasks
dynamically. TMPBP improves the Quality of Service (QoS) of the key tasks effectively under
heavy load. It is safe and has no starvation or priority inversion. The performance experiments
indicate that a considerable improvement on QoS of key tasks has been achieved under the proper
parameters of the algorithm.
Number of references:17
Main heading:Middleware
Controlled terms:Algorithms - Heuristic methods - Network protocols - Quality of service -
Scheduling - Servers
Uncontrolled terms:First come first served policy - Heuristic priority - J2EE middleware - Java 2
platform enterprise edition - Priority inversion - Starvation - Threaded multi queue priority based
protocols - Transaction scheduling
Classification code:716 Telecommunication; Radar, Radio and Television - 717 Optical
Communication - 722 Computer Systems and Equipment - 723.1 Computer Programming - 912.2
Management - 921 Mathematics
Treatment:Applications (APP); Theoretical (THR)
DOI:10.1360/jos170031
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 49>
Accession number:2006199868433
Title:IP traceback scheme based on marking-in-order
Authors:Qu, Hai-Peng (1); Feng, Deng-Guo (1); Su, Pu-Rui (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Department of Computer, Ocean University of
China, Qingdao 266071, China
Corresponding author:Qu, H.-P.
        (haipeng@acm.org)

Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica
Abbreviated source title:Tien Tzu Hsueh Pao
Volume:34
Issue:1
Issue date:January 2006
Publication year:2006
Pages:173-176
Language:Chinese
ISSN:03722112
CODEN:TTHPAG
Document type:Journal article (JA)
Publisher:Chinese Institute of Electronics
Abstract:Packet Marking Scheme have been proposed for achieving traceback of DoS attacks,
which has several advantages such as short responding time and small resource consuming. Since
the randomicity of the packet marking procedure, the number of the packets needed by the victim
in reconstructing is much more than the minimum number of packets required, therefore resulting
in the increase of the rate of false positives and the responding time. In this paper, a
marking-in-order scheme is proposed, which need less packets in reconstructing procedure
because of marking the packets in order by storing every target IP's marking state in a hash table.
The scheme is more practical for its high efficiency.
Number of references:10
Main heading:Packet switching
Controlled terms:Algorithms - Data communication systems - Internet - Quality of service -
Routers - Security of data
Uncontrolled terms:DDoS - Denial of service - Distributed denial of service - IP Traceback -
Packet-marking traceback
Classification code:718 Telephone Systems and Related Technologies; Line Communications -
723 Computer Software, Data Handling and Applications
Treatment:Applications (APP); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 50>
Accession number:20070310362230
Title:REMUDA: A practical topology control and data forwarding mechanism for wireless sensor
networks
Authors:Sun, Li-Min (1); Yan, Ting-Xin (1); Bi, Yan-Zhong (1)
Author affiliation:(1) Institute of Software, Chinese Acad. of Sci., Beijing 100080, China; (2)
Graduate School, Chinese Acad. of Sci., Beijing 100039, China
Corresponding author:Sun, L.-M.
       (sunlimin@ios.cn)

Source title:Zidonghua Xuebao/Acta Automatica Sinica
Abbreviated source title:Zidonghua Xuebao
Volume:32
Issue:6
Issue date:November 2006
Publication year:2006
Pages:867-874
Language:English
ISSN:02544156
CODEN:ZIXUDZ
Document type:Journal article (JA)
Publisher:Science Press, 18,Shuangqing Street,Haidian, Beijing, 100085, China
Abstract:In wireless sensor networks, topology control plays an important role for data forwarding
efficiency in the data gathering applications. In this paper, we present a novel topology control and
data forwarding mechanism called REMUDA, which is designed for a practical indoor parking lot
management system. REMUDA forms a tree-based hierarchical network topology which brings as
many nodes as possible to be leaf nodes and constructs a virtual cluster structure. Meanwhile, it
takes the reliability, stability and path length into account in the tree construction process. Through
an experiment in a network of 30 real sensor nodes, we evaluate the performance of REMUDA
and compare it with LEPS which is also a practical routing protocol in TinyOS. Experiment results
show that REMUDA can achieve better performance than LEPS.
Number of references:12
Main heading:Sensors
Controlled terms:Parking - Reliability - Stability - Topology
Uncontrolled terms:Data forwarding mechanism - Parking lot management system - Tree based
hierarchical topology - Virtual cluster - Wireless sensor networks
Classification code:432.4 Highway Traffic Control - 732.2 Control Instrumentation - 913.3
Quality Assurance and Control - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set
Theory
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 51>
Accession number:20070310372721
Title:Method of topology discovery for switched Ethernet based on address forwarding tables
Authors:Sun, Yan-Tao (1); Wu, Zhi-Mei (1); Shi, Zhi-Qiang (1)
Author affiliation:(1) Multimedia Communication and Network Engineering Research Center,
Institute of Software, Chinese Acad. of Sci., Beijing 100080, China
Corresponding author:Sun, Y.-T.
        (yantao02@ios.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:12
Issue date:December 2006
Publication year:2006
Pages:2565-2576
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences, P.O. Box 8718, Beijing, 100080, China
Abstract:In this paper, the connections reasoning technique (CRT) based on the predication logic
is proposed to infer the connections between network nodes. This technique interprets the address
forwarding tables (AFTs) as a set of predicate formulas and translates the topology discovery into
a mathematic problem of logic reasoning, so that the topology discovery can be studied by
resorting to mathematic tools. An algorithm for topology discovery based on CRT is proposed in
this paper. Compared with current discovery algorithms, this method excels in: 1) Applying the
redundancies in AFTs more effectively, so that the whole topology can be built up by just small
part of AFTs; 2) Naturally resolving the problem of topology discovery for multi-subnet switched
domain without any extensions. Furthermore, a method with little cost is proposed to discover the
dynamic topology in this paper. This algorithm is successfully applied to the network management
system for CBISN (Community Broadband Integrated Services Network).
Number of references:15
Main heading:Local area networks
Controlled terms:Algorithms - Broadband networks - Data communication systems - Electric
network topology - Mathematical techniques - Network protocols - Routers - Switches - Switching
networks
Uncontrolled terms:Address forwarding table - Address forwarding tables (AFTs) - Community
broadband integrated services network (CBISN) - Connections reasoning technique (CRT) -
Discovery algorithm - Dynamic topology - Logic reasoning - Mathematic problem - Mathematic
tool - Multisubnet switched domain - Network management - Network management system -
Network nodes - Predicate formulas - Predication logic - Switched Ethernets - Topology discovery
- Topology inference
Classification code:703.1 Electric Networks - 704.1 Electric Components - 716
Telecommunication; Radar, Radio and Television - 722.3 Data Communication, Equipment and
Techniques - 921 Mathematics
Treatment:Applications (APP); Experimental (EXP)
DOI:10.1360/jos172565
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 52>
Accession number:20062910006248
Title:Visualization of large hierarchical data by circle packing
Authors:Wang, Weixin (1); Wang, Hui (1); Dai, Guozhong (1); Wang, Hongan (1)
Author affiliation:(1) Intelligence Engineering Lab., Institute of Software, Chinese Academy of
Sciences, 4# S. Fourth Street, Zhong Guan Cun, Beijing 100080, China; (2) State Key Lab. of
Computer Science, 4# S. Fourth Street, Zhong Guan Cun, Beijing 100080, China
Corresponding author:Wang, W.
        (weixin@ios.cn)

Source title:Conference on Human Factors in Computing Systems - Proceedings
Abbreviated source title:Conf Hum Fact Comput Syst Proc
Volume:1
Monograph title:CHI 2006: Conference on Human Factors in Computing Systems, Conference
Proceedings SIGCHI
Issue date:2006
Publication year:2006
Pages:517-520
Language:English
ISBN-10:1595931783
ISBN-13:9781595931788
Document type:Conference article (CA)
Conference name:CHI 2006: Conference on Human Factors in Computing Systems
Conference date:April 22, 2006 - April 27, 2006
Conference location:Montreal, QC, Canada
Conference code:67748
Sponsor:ACM SIGCHI
Publisher:Association for Computing Machinery
Abstract:In this paper a novel approach is described for tree visualization using nested circles. The
brother nodes at the same level are represented by externally tangent circles; the tree nodes at
different levels are displayed by using 2D nested circles or 3D nested cylinders. A new layout
algorithm for tree structure is described. It provides a good overview for large data sets. It is easy
to see all the branches and leaves of the tree. The new method has been applied to the visualization
of file systems. Copyright 2006 ACM.
Number of references:10
Main heading:Data reduction
Controlled terms:Algorithms - Data structures - Display devices - File organization - Trees
(mathematics) - Two dimensional - Visualization
Uncontrolled terms:Circle packing - File systems - Nested circles - Tree visualization
Classification code:722.2 Computer Peripheral Equipment - 723.2 Data Processing and Image
Processing - 723.3 Database Systems - 921.4 Combinatorial Mathematics, Includes Graph Theory,
Set Theory
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 53>
Accession number:20064710251862
Title:Topological dynamics characterization for layered satellite networks
Authors:Wang, Junfeng (1); Hu, Yuemei (1); Zhou, Hongxia (3); Zhou, Mingtian (2)
Author affiliation:(1) National Key Laboratory of Integrated Information System Technology,
Institute of Software, Chinese Academy of Sciences, Beijing, 100080, China; (2) College of
Computer Science and Engineering, University of Electronic Science and Technology of China,
Chengdu 610054, China; (3) Chongqing Communication Institute, Chongqing 400035, China
Corresponding author:Wang, J.
        (mailwangjf@yahoo.com.cn)

Source title:Conference Proceedings of the IEEE International Performance, Computing, and
Communications Conference
Abbreviated source title:Conf. Proc. IEEE Int. Perform. Comput. Commun. Conf.
Volume:2006
Monograph title:25th IEEE International Performance, Computing, and Communications
Conference, 2006, IPCCC 2006
Issue date:2006
Publication year:2006
Pages:349-356
Article number:1629426
Language:English
ISBN-10:1424401976
ISBN-13:9781424401970
Document type:Conference article (CA)
Conference name:25th IEEE International Performance, Computing, and Communications
Conference, 2006, IPCCC 2006
Conference date:April 10, 2006 - April 12, 2006
Conference location:Phoenix, AZ, United states
Conference code:68530
Publisher:Institute of Electrical and Electronics Engineers Inc.
Abstract:The highly topological dynamics characterize the mostfundamental property of satellite
networks contrary to the terrestrial networks. This manifest feature directs the researches on
various aspects of satellite networks, including routing and switching architecture selection,
routing protocol and reliable transmission control protocol design and enhancement, etc,. The
paper quantifies the dynamical activates of layered satellite network topologies. The number and
length of network snapshots of one-layered satellite constellations are formulated concisely. The
snapshot distributions of typical multi-layered constellations are also evaluated. With this work, it
compensates for the simplified topological assumptions in many satellite network related
investigations. The thorough understanding of this basic feature not only provides for an accurate
quantification of network behavior, but also guides constellation design for future satellite
networks. &copy;2006 IEEE.
Number of references:18
Main heading:Telecommunication networks
Controlled terms:Network protocols - Routers - Satellite communication systems
Uncontrolled terms:Satellite networks - Terrestrial networks - Transmission control protocols
Classification code:655.2.1 Communication Satellites - 716 Telecommunication; Radar, Radio and
Television - 723 Computer Software, Data Handling and Applications
Treatment:Theoretical (THR)
DOI:10.1109/.2006.1629426
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 54>
Accession number:20070310361759
Title:Grid computing model for cryptology
Authors:Jiang, Zhong-Hua (1); Lin, Dong-Dai (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Graduate School, Chinese Academy of Sciences,
Beijing 100049, China
Corresponding author:Jiang, Z.-H.
       (jzh@is.iscas.ac.cn)

Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica
Abbreviated source title:Tien Tzu Hsueh Pao
Volume:34
Issue:10
Issue date:October 2006
Publication year:2006
Pages:1787-1792
Language:Chinese
ISSN:03722112
CODEN:TTHPAG
Document type:Journal article (JA)
Publisher:Chinese Institute of Electronics, P.O. Box 165, Beijing, 100036, China
Abstract:Many problems in cryptology and information security fields are eventually converted to
time-consuming computations which usually need to be completed over heterogeneous and
geographically distributed computers. The analysis, design and application of a cryptographic
algorithm usually depend on its concrete computing settings; different algorithms and different
implementations of an algorithm need different computing environments. In this paper, the targets
and features of different cryptographic computations are firstly analyzed according to their
computing requirements; the corresponding computing modes are put forward; and a general
purpose cryptographic computing model on grid is given. The task dividing policy, resource
allocation and load balance for the model are then discussed. The implementation and the
performance evaluation for the model based on Globus Toolkit 4 are further presented.
Number of references:18
Main heading:Cryptography
Controlled terms:Algorithms - Computational complexity - Distributed computer systems -
Resource allocation - Security of data - Virtual corporation
Uncontrolled terms:Computational grid - Computing environment - Cryptographic algorithm -
Cryptographic computation - Cryptology - Globus Toolkit - Information security field - Load
balance - Task dividing - Time consuming computation
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 722.4 Digital Computers and Systems - 723.2 Data Processing and
Image Processing - 912.2 Management - 912.3 Operations Research - 921 Mathematics
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 55>
Accession number:20063410082424
Title:Application-aware web service requests scheduling strategy
Authors:Guan, He-Qing (1); Zhang, Wen-Bo (1); Wei, Jun (1); Huang, Tao (1)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Key Laboratory of Computer Science, Institute
of Software, Chinese Academy of Sciences, Beijing 100080, China; (3) Graduate University,
Chinese Academy of Sciences, Beijing 100039, China
Corresponding author:Guan, H.-Q.
       (ghq@otcaix.iscas.ac.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:7
Issue date:July 2006
Publication year:2006
Pages:1189-1198
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:For commercial Web-services based applications (WSBAs), performance problem is a
major concern. As the main platform for WSBAs, Web application servers (WASs) typically adopt
the first-come first-served (FCFS) scheduling strategy. FCFS strategy does not distinguish critical
requests from non-critical ones, and therefore the performance of critical ones might be reduced.
Most of the existing research seldom takes into account the requirements from applications, which
impairs the performance guarantee from WASs. This paper proposes a novel application-aware
Web service requests scheduling (AWSRS) strategy for WSBAs, introduces the concept of
application benefit to evaluate the effect of WAS in improving the performance for applications.
Based on that, the strategy is able to classify requests and intelligently assign corresponding
resources for them, in order to maximize the total application benefits. Later experimental results
indicate that the strategy effectively improves the performance of critical requests.
Number of references:17
Main heading:Software engineering
Controlled terms:Optimization - Performance - Quality of service - Resource allocation -
Scheduling
Uncontrolled terms:Application aware strategy - QoS - Request scheduling - Web application
server - Web service
Classification code:723.1 Computer Programming - 912.2 Management - 921.5 Optimization
Techniques
Treatment:Applications (APP); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 56>
Accession number:20064010141990
Title:GSMA: A structural matching algorithm for schema matching in data warehousing
Authors:Cheng, Wei (1); Sun, Yufang (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Cheng, W.
       (Chengwei@ios.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3614 LNAI
Monograph title:Fuzzy Systems and Knowledge Discovery - Second International Conference,
FSKD 2005, Proceedings
Issue date:2006
Publication year:2006
Pages:408-411
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-13:9783540283317
Document type:Conference article (CA)
Conference name:2nd International Conference on Fuzzy Systems and Knowledge Discovery,
FSKD 2005
Conference date:August 27, 2005 - August 29, 2005
Conference location:Changsa, China
Conference code:68203
Publisher:Springer Verlag
Abstract:Schema matching, the problem of finding semantic correspondences between elements of
source and warehouse schemas, plays a key role in data warehousing. Currently, schema mapping
is largely determined manually by domain experts, thus a labor-intensive process. In this paper, we
propose a structural matching algorithm based on semantic similarity propagation. Experimental
results on several real-world domains are presented, and show that the algorithm discovers
semantic mappings with a high degree of accuracy. &copy; Springer-Verlag Berlin Heidelberg
2005.
Number of references:10
Main heading:Pattern matching
Controlled terms:Algorithms - Conformal mapping - Data warehouses - Semantics
Uncontrolled terms:Labor-intensive processes - Schema matching - Semantic similarity
propagation - Structural matching algorithms
Classification code:723.3 Database Systems - 723.5 Computer Applications - 903.2 Information
Dissemination - 921 Mathematics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 57>
Accession number:20063310068249
Title:Priority mapping algorithm without affecting the schedulability of tasks set
Authors:Wang, Baojin (1); Li, Mingshu (2)
Author affiliation:(1) Institute of Information and Engineering, PLA Information and Engineering
University, Zhengzhou 450002, China; (2) Laboratory for Internet Software Technologies,
Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (3) Laboratory of
Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Wang, B.
        (baojin_wang@itechs.iscas.ac.cn)

Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development
Abbreviated source title:Jisuanji Yanjiu yu Fazhan
Volume:43
Issue:6
Issue date:June 2006
Publication year:2006
Pages:1083-1089
Language:Chinese
ISSN:10001239
CODEN:JYYFEY
Document type:Journal article (JA)
Publisher:Science Press
Abstract:In practice, the schedulability of static priority scheduling may be reduced if priority
levels of the system are insufficient. When the priority levels that a task set requires are more than
the system can support, more than one task must be assigned the same priority. The priority
mapping algorithms that have been used can augment the worst-case response time of task with
higher priority, and may reduce the system schedulability. If keeping system schedulable, these
algorithms may require more priority levels than the system can support. With preemption
threshold scheduling model, the schedulability is improved as compared to both preemption and
non-preemption scheduling models, and all tasks can be handled with the minimum number of
event handling threads. But, the number of system priority levels that a thread needs does not be
reduced. This paper presents a priority mapping algorithm called TSM (threshold segment
mapping) and a thread implementation architecture with event-driven. It is shown that the TSM
algorithm can maintain the strict order of tasks' priorities, and does not improve task's worst-case
response time. The number of system priority levels used by the algorithm and architecture equals
to that of threads. Simulations show that when maintaining system schedulability, the TSM
algorithm uses less priority levels than existing priority mapping algorithms.
Number of references:10
Main heading:Real time systems
Controlled terms:Algorithms - Scheduling
Uncontrolled terms:Event driven - Nonpreemptive group - Preemption threshold - Priority
mapping - Strict order
Classification code:722.4 Digital Computers and Systems - 723 Computer Software, Data
Handling and Applications - 912.2 Management
Treatment:Applications (APP)
DOI:10.1360/crad20060618
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 58>
Accession number:20064110165641
Title:Formal safety analysis of a class of multilevel security models
Authors:He, Jian-Bo (1); Qing, Si-Han (1); Wang, Chao (2)
Author affiliation:(1) National Engineering Research Center for Fundamental Software, Institute
of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Engineering and Research Center
for Information Security Technology, Institute of Software, Chinese Acad. of Sci., Beijing 100080,
China; (3) Beijing Zhongke Ansheng Corporation of Information Technology, Beijing 100086,
China; (4) Graduate University, Chinese Acad. of Sci., Beijing 100049, China
Corresponding author:He, J.-B.
        (jianbo03@iscas.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:8
Issue date:August 2006
Publication year:2006
Pages:1468-1479
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:How to improve the traditional BLP model to make it more applicable is one of the major
problems to be solved in the design of secure operating systems. There are several improved BLP
models that have been applied to real systems. However, the security property of these models
must be verified and assured, if not the models will lose its function as a security model. In this
paper, the essence of multilevel security (MLS) is analyzed and the security theorem applicable
for improved BLP models involved in multi-level objects is proposed for the first time. Then the
effect of security invariants on the definition of system security is analyzed and emphasized. The
assertion that the security invariant of various MLS models must be verified to be consistent with
the MLS security policy is also introduced. To justify the assertion, an improved BLP model,
DBLP, is analyzed as an example. To enhance the clarity, the Z formal language is used to specify
the system and the theorem prover Z/EVES used to analyze and verify whole specification and
relevant theorems. The verification result shows that the invariant of DBLP model does not satisfy
the security theorem introduced in this paper, and therefore the DBLP is insecure. The research
provides a way of specification and verification for the analysis of various improved BLP models.
In addition, it presents a theoretical foundation for selection of MLS models.
Number of references:19
Main heading:Computer operating systems
Controlled terms:Computer programming languages - Formal languages - Functions -
Mathematical models - Security of data - Security systems - Specifications - Theorem proving
Uncontrolled terms:Bell La Padula models - Formal safety analysis - Multilevel security policies -
Security invariants - Theorem provers - Z languages
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 722 Computer Systems and Equipment - 723 Computer Software,
Data Handling and Applications - 902.2 Codes and Standards - 914.1 Accidents and Accident
Prevention - 921 Mathematics
Treatment:Applications (APP); Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 59>
Accession number:2006069683209
Title:Approximate eigen-decomposition preconditioners for solving numerical PDE problems
Authors:Sun, Jiachang (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Sun, J.
       (sun@mail.rdcps.ac.cn)

Source title:Applied Mathematics and Computation (New York)
Abbreviated source title:Appl Math Comput (New York)
Volume:172
Issue:2 SPEC. ISS.
Issue date:January 15, 2006
Publication year:2006
Pages:772-787
Language:English
ISSN:00963003
CODEN:AMHCBQ
Document type:Journal article (JA)
Publisher:Elsevier Inc.
Abstract:Approximate matrix inverse has played key role in constructing preconditioners since
last 1990s, because of their solid theoretical background. Sparse approximate inverse
preconditioners (SAIPs) have attracted much attention recently, because their potential usefulness
in a parallel environment. As a general matrix approach, in this paper, we propose an approximate
eigen-decomposition preconditioners by combining a FFT-like multiplication algorithm. Some
numerical tests are given to show this algorithm is more effective than the traditional method such
as ILU with PETSc for solving a wide class of discrete elliptic problems. &copy; 2004 Elsevier
Inc. All rights reserved.
Number of references:9
Main heading:Eigenvalues and eigenfunctions
Controlled terms:Algorithms - Approximation theory - Problem solving
Uncontrolled terms:Matrix splitting - Preconditioning
Classification code:723.4 Artificial Intelligence - 921.1 Algebra - 921.6 Numerical Methods
Treatment:Theoretical (THR)
DOI:10.1016/j.amc.2004.11.018
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 60>
Accession number:20073110729578
Title:A predictive approach to achieving consistency in cooperative caching in MANET
Authors:Huang, Yu (1); Cao, Jiannong (2); Jin, Beihong (3)
Author affiliation:(1) Dept. of Computer Science, Univ. of Science and Technology of China,
Hefei, China; (2) Internet and Mobile Computing Lab., Dept. of Computing, Hong Kong
Polytechnic Univ., Kawloon, Hong Kong; (3) Technology Center of Software Engineering,
Institute of Software, Chinese Academy of Sciences, Beijing, China
Corresponding author:Huang, Y.
        (csyhuang@comp.polyu.edu.hk)
Source title:ACM International Conference Proceeding Series
Abbreviated source title:ACM Int. Conf. Proc. Ser.
Volume:152
Monograph title:Proceedings of the 1st International Conference on Scalable Information Systems,
InfoScale '06
Issue date:2006
Publication year:2006
Article number:1146898
Language:English
ISBN-10:1595934286
ISBN-13:9781595934284
Document type:Conference article (CA)
Conference name:1st International Conference on Scalable Information Systems, InfoScale '06
Conference date:May 30, 2006 - June 1, 2006
Conference location:Hong Kong, China
Conference code:69863
Publisher:Association for Computing Machinery, 1515 Broadway, 17th Floor, New York, NY
10036-5701, United States
Abstract:Cooperative caching is a very important technique for efficient data dissemination and
sharing in mobile ad hoc networks (MANETs). Many applications have requirements on the
consistency of the content cached on different nodes. However, this issue has not been adequately
addressed and few of the existing solutions are really adaptive in a dynamic MANET environment.
In this paper, we propose a predictive algorithm called PCC (Predictive Caching Consistency) that
can make on-line tradeoff between the level of consistency of cached data and the overhead
associated with achieving it. Simulation results show that PCC works adoptively and efficiently in
a MANET environment, even with dynamic changes in the size of the network, mobility model of
nodes, number of queries, and frequency of data updates. &copy; 2006 ACM.
Number of references:11
Main heading:Ad hoc networks
Controlled terms:Computer simulation - Frequency allocation - Information dissemination -
Mobile telecommunication systems - Predictive control systems
Uncontrolled terms:Cooperative caching - Data dissemination - Dynamic MANET environment -
Predictive Caching Consistency
Classification code:903.2 Information Dissemination - 731.1 Control Systems - 723.5 Computer
Applications - 723 Computer Software, Data Handling and Applications - 722.3 Data
Communication, Equipment and Techniques - 716.4 Television Systems and Equipment - 716.3
Radio Systems and Equipment
Treatment:Theoretical (THR)
DOI:10.1145/1146847.1146898
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 61>
<RECORD 1>
Accession number:20070310373315
Title:Cost-based dynamic change of process
Authors:Tian, Yong (0); Dong, Guangzhi (0); Liu, Junfei (0)
Corresponding author:Tian, Y.
       (yong_t@163.com)

Corr. author affiliation:Intelligence Engineering Laboratory, Institute of Software, Chinese Acad.
of Sciences, Beijing 100080, China
Source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and
Computer Graphics
Abbreviated source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao
Volume:18
Issue:11
Issue date:November 2006
Publication year:2006
Pages:1781-1785
Language:Chinese
ISSN:10039775
CODEN:JFTXFX
Document type:Journal article (JA)
Publisher:Institute of Computing Technology, Beijing, China
Abstract:An example is adopted to illustrate that several alternative change paths exist during
process running. We describe dataflow and control flow by means of matrix, then find out all
potential change paths by transforming the matrix; finally, analyze those paths by comparing the
related costs and figure out the best one.
Number of references:9
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 62>
Accession number:20063010021487
Title:Multimodal error correction for continuous handwriting recognition in pen-based user
interfaces
Authors:Wang, Xugang (1); Li, Junfeng (1); Ao, Xiang (1); Wang, Gang (3); Dai, Guozhong (1)
Author affiliation:(1) Intelligence Engineering Lab., Institute of Software, Chinese Academic of
Science, Beijing 100080, China; (2) Laboratory of Computer Science, Institute of Software,
Chinese Academic of Science, Beijing 100080, China; (3) France Telecom Research and
Development Beijing, Beijing 100080, China
Corresponding author:Wang, X.
        (wxg@iel.iscas.ac.cn)

Source title:International Conference on Intelligent User Interfaces, Proceedings IUI
Abbreviated source title:Int Conf Intell User Interfaces Proc IUI
Volume:2006
Monograph title:IUI 06 - 2006 International Conference on Intelligent User Interfaces
Issue date:2006
Publication year:2006
Pages:324-326
Language:English
ISBN-10:1595932879
ISBN-13:9781595932877
Document type:Conference article (CA)
Conference name:IUI 06 - 2006 International Conference on Intelligent User Interfaces
Conference date:January 29, 2005 - Febrary 1, 2005
Conference location:Sydney, Australia
Conference code:67837
Sponsor:ACM SIGART; ACM SIGCHI
Publisher:Association for Computing Machinery
Abstract:In this paper, we describe a multimodal error correction mechanism. It allows the user to
correct errors in continuous handwriting recognition naturally by simultaneously using pen gesture
and speech. A multimodal fusion algorithm is designed to enhance recognition accuracies of
handwriting and speech through cross-modal influence. We have performed preliminary
evaluation experiments and the results show that this multimodal mechanism can efficiently
correct the errors in continuous handwriting recognition.
Number of references:12
Main heading:Character recognition
Controlled terms:Error correction - Gesture recognition - Modal analysis - Sensor data fusion -
Speech recognition - User interfaces
Uncontrolled terms:Fusion algorithms - Handwriting Recognition - Multimodal Fusion -
Pen-based User Interfaces
Classification code:921 Mathematics - 751.5 Speech - 723.2 Data Processing and Image
Processing - 723 Computer Software, Data Handling and Applications - 722.2 Computer
Peripheral Equipment - 721.1 Computer Theory, Includes Formal Logic, Automata Theory,
Switching Theory, Programming Theory - 716 Telecommunication; Radar, Radio and Television
Treatment:Theoretical (THR); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 63>
Accession number:20070210351646
Title:A dynamically modified privilege control policy
Authors:Qing, Sihan (1); Shen, Qingni (1); Ji, Qingguang (1); He, Yeping (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Qing, S.
        (qsihan@ercist.iscas.ac.cn)

Source title:Proceedings of the 2006 IEEE Workshop on Information Assurance
Abbreviated source title:Proc. IEEE Workshop Info. Assurance
Volume:2006
Monograph title:Proceedings of the 2006 IEEE Workshop on Information Assurance
Issue date:2006
Publication year:2006
Pages:340-347
Article number:1652115
Language:English
ISBN-10:1424401305
ISBN-13:9781424401307
Document type:Conference article (CA)
Conference name:2006 IEEE Workshop on Information Assurance
Conference date:June 21, 2006 - June 23, 2006
Conference location:West Point, NY, United states
Conference code:68874
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Trusted systems typically include trusted processes which possess special privileges.
Such privileges can circumvent certain security checks but should be used in a controlled manner.
This paper proposes a privilege control policy called DMPC (Dynamically Modified Privilege
Control). It has two components: a hybrid privilege control model and a new POSIX (Portable
Operating System Interface) capability inheritance algorithm. The privilege control model in
DMPC is a combination of Role Based Access Control (RBAC), Domain and Type Enforcement
(DTE) and POSIX capability mechanism while the capability inheritance algorithm serves as an
engine to effectively enforce the hybrid privilege control model on a secure operating system. The
DMPC's design has given a high priority to supporting least privilege to a finer level of granularity
on trusted systems. Additional (sub-) goals for the DMPC policy are: realizing separation of duties
among privileged users, achieving separation of trusted functions from untrusted ones and
providing a flexible and dynamically mediated capability mechanism. We show that RBAC alone
is insufficient to enforce the principle of least privilege in a dynamic context, and that DTE and
POSIX capability mechanism can successfully be conjugated with RBAC for this purpose. We
also describe an implementation of the DMPC policy on a real system and report on experimental
results. &copy;2006 IEEE.
Number of references:16
Main heading:Security of data
Controlled terms:Algorithms - Computer operating systems - Public policy - Real time systems -
Search engines - User interfaces
Uncontrolled terms:Capability inheritance algorithm - Least privilege - Portable Operating System
Interface (POSIX) - Role Based Access Control (RBAC)
Classification code:722 Computer Systems and Equipment - 722.2 Computer Peripheral
Equipment - 722.4 Digital Computers and Systems - 723.2 Data Processing and Image Processing
Treatment:Theoretical (THR); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 64>
Accession number:20063010026596
Title:An optimal method for multiple observers sitting on terrain based on improved simulated
annealing techniques
Authors:Lv, Pin (1); Zhang, Jin-Fang (1); Lu, Min (1)
Author affiliation:(1) National Key Laboratory of Integrated Information System Technology,
Institute of Software, Chinese Academy of Sciences, Beijing, 10080, China
Corresponding author:Lv, P.
        (lvpin04@ios.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4031 LNAI
Monograph title:Advances in Applied Artificial Intelligence - 19th International Conference on
Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2006,
Proceedings
Issue date:2006
Publication year:2006
Pages:373-382
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540354530
ISBN-13:9783540354536
Document type:Conference article (CA)
Conference name:19th International Conference on Industrial, Engineering and Other Applications
of Applied Intelligent Systems, IEA/AIE 2006
Conference date:June 27, 2006 - June 30, 2006
Conference location:Annecy, France
Conference code:67891
Publisher:Springer Verlag
Abstract:The problem of multiple observers sitting on terrain (MOST) is an important part in
visibility-based terrain reasoning (VBTR), but it is difficult because of the unacceptable
computing time. Recent developments in this field focus on involving spatial optimization
techniques, such as a heuristic algorithm. In this paper, a new method is developed based on the
Improved Simulated Annealing (ISA) algorithm through the analysis of different terrain characters.
A new annealing function and a new state function are designed to make the improved algorithm
fit the problem better. Experiment results show that without loss of precision, use of the ISA
algorithm reduces time cost 50%-70% when compared with the traditional SA. &copy;
Springer-Verlag Berlin Heidelberg 2006.
Number of references:20
Main heading:Simulated annealing
Controlled terms:Algorithms - Artificial intelligence - Computer science - Functions - Heuristic
methods - Problem solving
Uncontrolled terms:Heuristic algorithms - Improved Simulated Annealing (ISA) algorithm -
Multiple observers sitting on terrain (MOST) - Visibility-based terrain reasoning (VBTR)
Classification code:723 Computer Software, Data Handling and Applications - 723.4 Artificial
Intelligence - 921 Mathematics
Treatment:Theoretical (THR)
DOI:10.1007/11779568_41
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 65>
Accession number:2006199868618
Title:Fuzzy scheduling design in computer control
Authors:Jin, Hong (1); Wang, Hong-An (1); Tang, Xue-Mei (2); Wang, Hui (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China;
(2) Beijing Institute of Special Machine and Electricity, Beijing 100012, China
Corresponding author:Jin, H.
        (hjin@iel.iscas.ac.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:3
Issue date:March 2006
Publication year:2006
Pages:414-422
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:In order to improve the control performance of systems and use the limited computing
resource reasonably, it is necessary to consider the codesign problem between control and
real-time scheduling in computer-controlled systems synthetically. In this paper, the real-time
scheduling problem of multiple control tasks with fuzzy deadlines is studied. The concept of
dedication index and the scheduling policy of largest dedication first (LDF) are proposed. In order
to relieve the overhead caused by the thrashing among tasks, the threshold-based largest
dedication first (TLDF) is presented. Finally, Two proposed scheduling policies LDF and TLDF
are compared by simulation. The scheduling of control tasks with fuzzy deadlines is implemented,
and the utilization of computing resource gets increased meanwhile the control performance cost
gets decreased and tradeoff.
Number of references:17
Main heading:Scheduling
Controlled terms:Computer control - Computer simulation - Fuzzy control - Real time systems
Uncontrolled terms:Codesign - Computer controlled systems - Control performance cost - Control
tasks - Fuzzy deadlines - Largest dedication first (LDF) - Real time scheduling
Classification code:722.4 Digital Computers and Systems - 723.5 Computer Applications - 731.1
Control Systems - 912.2 Management - 921 Mathematics - 922.2 Mathematical Statistics
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 66>
Accession number:20063710111258
Title:Block and memory based part of speech tagging
Authors:Shi, Jing (1); Dai, Guo-Zhong (1)
Author affiliation:(1) Computer Human Interaction and Intelligent Information Processing
Laboratory, Institute of Software, Chinese Acad. of Sci., Beijing 100080, China
Corresponding author:Shi, J.
        (crystal1087@126.com)

Source title:Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and
Technology Edition)
Abbreviated source title:Jilin Daxue Xuebao (Gongxueban)
Volume:36
Issue:4
Issue date:July 2006
Publication year:2006
Pages:560-563
Language:Chinese
ISSN:16715497
CODEN:JDXGAH
Document type:Journal article (JA)
Publisher:Editorial Board of Jilin University
Abstract:Automatic part-of-speech tagging is often applied to natural language processing. The
approach of block and memory based model (BMM) is other than that of the traditional models.
BMM takes a whole Chinese sentence as a processing unit. Each word is considered respectively
in a more abundant and informative context environment. The lexicon of WordNet is employed to
store the tag sets, and, to improve the efficiency, the incremental learning method is applied to
obtain parameters. A constant is given to smooth the sparse data and some handcrafting rules are
used to amend the results. Experiments show that the accuracy of close test is about 99% and the
accuracy of open test is higher than 95%.
Number of references:11
Main heading:Speech processing
Controlled terms:Artificial intelligence - Automation - Data processing - Learning algorithms -
Mathematical models - Natural language processing systems - Parameter estimation
Uncontrolled terms:Automatic tagging - Close test - Incremental learning - Open test
Classification code:723.2 Data Processing and Image Processing - 723.4 Artificial Intelligence -
723.5 Computer Applications - 731.1 Control Systems - 751.5 Speech - 921.6 Numerical Methods
Treatment:Applications (APP); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 67>
Accession number:20072610672059
Title:Message from the general chair
Authors:Lin, Huimin (0)
Corresponding author:Lin, H.
Corr. author affiliation:Institute of Software, Chinese Academy of Sciences, China
Source title:Proceedings - International Conference on Quality Software
Abbreviated source title:Proc. Int. Conf. Qual. Softw.
Monograph title:Proceedings - Sixth International Conference on Quality Software, QSIC 2006
Publication year:2006
Pages:xi
Article number:4032256
Language:English
ISSN:15506002
ISBN-10:0769527183
ISBN-13:9780769527185
Document type:Journal article (JA)
Conference name:6th International Conference on Quality Software, QSIC 2006
Conference date:Oct 27 - 28 2006
Conference location:Beijing, China
Conference code:69805
Publisher:Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ
08855-1331, United States
Abstract:No abstract available
DOI:10.1109/QSIC.2006.39
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 68>
Accession number:2006289996225
Title:An identity-based authentication model for multi-domain Grids
Authors:Lu, Xiao-Ming (1); Feng, Deng-Guo (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Lu, X.-M.
       (lu_xm@is.iscas.ac.cn)

Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica
Abbreviated source title:Tien Tzu Hsueh Pao
Volume:34
Issue:4
Issue date:April 2006
Publication year:2006
Pages:577-582
Language:Chinese
ISSN:03722112
CODEN:TTHPAG
Document type:Journal article (JA)
Publisher:Chinese Institute of Electronics
Abstract:We consider the efficient authentication for Grids. We analyze the problems of existing
Grid authentication frameworks, and propose an identity-based authentication model for
multi-domain Grids. Our model is based on the identity-based PKI so as to overcome the problem
of low efficiency and high cost posed by traditional certificate based PKI. Moreover, our model
supports cross-domain mutual entity authentication, which is necessary to common Grids
consisting of distinct domains. Through simulation testing, it is shown that our model is more
efficient and more lightweight than those frameworks based on traditional PKI. It is also shown
that due to supporting cross-domain authentication, our model is more suitable for Grids than
framework proposed by W. Mao, which can only work in a single domain.
Number of references:16
Main heading:Public key cryptography
Controlled terms:Computer simulation - Internet - Mathematical models - Security of data -
Testing
Uncontrolled terms:Cross domain authentication - Grids - Identity based authentication - Identity
based PKI - Mutual entity authentication - Signcryption
Classification code:716 Telecommunication; Radar, Radio and Television - 717 Optical
Communication - 723.2 Data Processing and Image Processing - 723.5 Computer Applications -
921 Mathematics
Treatment:Applications (APP); Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 69>
Accession number:20073310758945
Title:BPEL4WS unit testing: Test case generation using a concurrent path analysis approach
Authors:Yan, Jun (1); Li, Zhongjie (2); Yuan, Yuan (2); Sun, Wei (2); Zhang, Jian (1)
Author affiliation:(1) Laborary of Computer Science, Institute of Software, Chinese Academy of
Sciences; (2) IBM China Research Lab.; (3) Graduate University, Chinese Academy of Sciences
Corresponding author:Yan, J.
       (yanjun@ios.ac.cn)

Source title:Proceedings - International Symposium on Software Reliability Engineering, ISSRE
Abbreviated source title:Proc. Int. Symp. Softw. Reliab. Eng.
Monograph title:Proceedings - 17th International Symposium on Software Reliability Engineering,
ISSRE 2006
Issue date:2006
Publication year:2006
Pages:75-84
Article number:4021973
Language:English
ISSN:10719458
CODEN:PSSRFV
ISBN-10:0769526845
ISBN-13:9780769526843
Document type:Conference article (CA)
Conference name:17th International Symposium on Software Reliability Engineering, ISSRE
2006
Conference date:November 7, 2006 - November 10, 2006
Conference location:Raleigh, NC, United states
Conference code:70041
Sponsor:IEEE Computer Society; IEEE Computer Society Tech. Council on Software Eng.
(TCSE); IEEE Reliability Society
Publisher:IEEE Computer Society, 10662 Los Vaqueros Circle - P.O. Box 3014, Los Alamitos, CA
90720-1314, United States
Abstract:BPEL is a language that could express complex concurrent behaviors. This paper
presents a novel method of BPEL test case generation, which is based on concurrent path analysis.
This method first uses an Extended Control Flow Graph (XCFG) to represent a BPEL program,
and generates all the sequential test paths from XCFG. These sequential test paths are then
combined to form concurrent test paths. Finally a constraint solver BoNuS is used to solve the
constraints of these test paths and generate feasible test cases. Some techniques are proposed to
reduce the number of combined concurrent test paths. Some test criteria derived from traditional
sequential program testing are also presented to reduce the number of test cases. This method is
modularized so that many test techniques such as various test criteria and complex constraint
solvers can be applied. This method is tested sound and efficient in experiments. It is also
applicable to the testing of other business process languages with possible extension and adaption.
&copy; 2006 IEEE.
Number of references:15
Main heading:Formal languages
Controlled terms:Computational methods - Graph theory
Uncontrolled terms:Path analysis - Test criteria - Test paths
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.1.1 Computer Programming Languages - 921.4 Combinatorial
Mathematics, Includes Graph Theory, Set Theory
Treatment:Theoretical (THR); Experimental (EXP)
DOI:10.1109/ISSRE.2006.16
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 70>
Accession number:2006149802905
Title:Automatically optimized distributed intrusion detection system using mobile agent
Authors:Wang, Jin (1); Li, Dequan (1); Feng, Dengguo (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Graduate University, Chinese Academy of
Sciences, Beijing 100039, China
Corresponding author:Wang, J.
       (wangjin@is.iscas.ac.cn)

Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development
Abbreviated source title:Jisuanji Yanjiu yu Fazhan
Volume:43
Issue:1
Issue date:January 2006
Publication year:2006
Pages:9-14
Language:Chinese
ISSN:10001239
CODEN:JYYFEY
Document type:Journal article (JA)
Publisher:Science Press
Abstract:Now the traditional distributed intrusion detection system in network has many limits
because of several technical difficulties encountered in keeping pace with the increasing network
speed and communication complexity between applications. AODIDS is proposed, which can
optimize itself by a mobile agent named Improver Agent. Improver Agent roves and evaluates the
performance of an Analyzer Agent. According to the evaluation, the Improver Agent makes an
optimization plan to make the most of the capacity of the system.
Number of references:7
Main heading:Security of data
Controlled terms:Computer networks - Data communication systems - Intelligent agents -
Optimization - Packet switching - Software agents
Uncontrolled terms:Distributed intrusion detection system - Mobile agent
Classification code:723.2 Data Processing and Image Processing - 723.4 Artificial Intelligence -
723.5 Computer Applications
Treatment:Applications (APP); Experimental (EXP)
DOI:10.1360/crad20060102
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 71>
Accession number:20063610101517
Title:Security architecture to support multiple security policies based on access control space
Authors:Li, Li-Ping (1); Qing, Si-Han (1); He, Ye-Ping (1); Shen, Qing-Ni (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China;
(2) Graduate School of Chinese Academy of Sciences, Beijing 100039, China
Corresponding author:Li, L.-P.
Source title:Tongxin Xuebao/Journal on Communication
Abbreviated source title:Tongxin Xuebao
Volume:27
Issue:2
Issue date:February 2006
Publication year:2006
Pages:107-112+118
Language:Chinese
ISSN:1000436X
Document type:Journal article (JA)
Publisher:Editorial Board of Journal on Communications
Abstract:In order to solve the problems of policy reusability and policy co-existence in LSM, a
new security architecture ELSM is proposed. It introduced Model Combiner as main module to
implement module stack management and module decision management. Module decision is
based on access control space as policy specification for general support. The design of ELSM and
the analysis of its implementation in Ansheng OS prove its effectiveness.
Number of references:15
Main heading:Computer operating systems
Controlled terms:Architecture - Reusability - Specifications
Uncontrolled terms:Linux security module (LSM) - Model Combiner - Module decision
management - Module stack management - Policy specification - Security architecture - Security
policy model
Classification code:723 Computer Software, Data Handling and Applications - 902.2 Codes and
Standards
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 72>
Accession number:20064310193819
Title:Study on parallel computing
Authors:Chen, Guo-Liang (1); Sun, Guang-Zhong (1); Zhang, Yun-Quan (2); Mo, Ze-Yao (3)
Author affiliation:(1) Anhui Province-MOST Key Co-Lab. of High Performance Computing and
Its Applications, Department of Computer Science and Technology, University of Science and
Technology of China, Hefei 230027, China; (2) Laboratory of Parallel Computing, Institute of
Software, Chinese Academy of Sciences, Beijing 100080, China; (3) Laboratory of Computational
Physics, Institute of Applied Physics and Computational Mathematics, Beijing 100088, China
Corresponding author:Chen, G.-L.
        (glchen@ustc.edu.cn)
Source title:Journal of Computer Science and Technology
Abbreviated source title:J Comput Sci Technol
Volume:21
Issue:5
Monograph title:Special Issue Dedicated to the 20th Anniversary of NFSC
Issue date:September 2006
Publication year:2006
Pages:665-673
Language:English
ISSN:10009000
CODEN:JCTEEM
Document type:Journal article (JA)
Publisher:Springer New York LLC
Abstract:In this paper, we present a general survey on parallel computing. The main contents
include parallel computer system which is the hardware platform of parallel computing, parallel
algorithm which is the theoretical base of parallel computing, parallel programming which is the
software support of parallel computing. After that, we also introduce some parallel applications
and enabling technologies. We argue that parallel computing research should form an integrated
methodology of "architecture - algorithm - programming - application". Only in this way, parallel
computing research becomes continuous development and more realistic. &copy; Springer
Science + Business Media, Inc. 2006.
Number of references:83
Main heading:Parallel processing systems
Controlled terms:Computer hardware - Computer programming - Computer software - Parallel
algorithms
Uncontrolled terms:Parallel application - Parallel architecture - Parallel programming
Classification code:722.4 Digital Computers and Systems - 723 Computer Software, Data
Handling and Applications - 723.1 Computer Programming
Treatment:Literature review (LIT); Theoretical (THR)
DOI:10.1007/s11390-006-0665-9
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 73>
Accession number:2006259955103
Title:Expanding the horizons of software development processes: A 3-D integrated methodology
Authors:Li, Mingshu (1)
Author affiliation:(1) State Key Lab. of Computer Science, Institute of Software, Chinese
Academy of Sciences, No. 4 South Fourth Street, Zhong Guan Cun, Beijing 10 00 80, China
Corresponding author:Li, M.
        (mingshu@iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3840 LNCS
Monograph title:Unifying the Software Process Spectrum - International Software Process
Workshop, SPW 2005, Revised Selected Papers
Issue date:2006
Publication year:2006
Pages:54-67
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540311122
ISBN-13:9783540311126
Document type:Conference article (CA)
Conference name:International Software Process Workshop, SPW 2005
Conference date:May 25, 2005 - May 27, 2005
Conference location:Beijing, China
Conference code:67507
Publisher:Springer Verlag
Abstract:This paper investigates how to define and improve software development processes.
Based on examining the software development during last two decades, it proposes a breakthrough
point of an updated view of requirements, called Great Requirements, and presents a 3-D
integrated software engineering methodology for improving software development activities. It
expands the horizons of possible future software development processes. &copy; Springer-Verlag
Berlin Heidelberg 2005.
Number of references:49
Main heading:Software engineering
Controlled terms:Computer science - Computer software - Information technology - Three
dimensional computer graphics
Uncontrolled terms:3-D integrated methodology - Software development processes - Software
engineering methodology
Classification code:723.1 Computer Programming - 723.5 Computer Applications - 903
Information Science
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 74>
Accession number:20063210058229
Title:An A-Team based architecture for constraint programming
Authors:Zheng, Yujun (1); Wang, Lianlai (1); Xue, Jinyun (2)
Author affiliation:(1) Systems Engineering Institute of Engineer Equipment, 100093 Beijing,
China; (2) Institute of Software, Chinese Academy of Sciences, 100080 Beijing, China; (3)
College of Computer Information and Engineering, Jiangxi Normal University, 330027 Nanchang,
China
Corresponding author:Zheng, Y.
       (uchengz@yahoo.com.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4088 LNAI
Monograph title:Agent Computing and Multi-Agent Systems: 9th Pacific Rim International
Workshop on Multi-Agents, PRIMA 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:552-557
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540367071
ISBN-13:9783540367079
Document type:Conference article (CA)
Conference name:9th Pacific Rim International Workshop on Multi-Agents, PRIMA 2006
Conference date:August 7, 2006 - August 8, 2006
Conference location:Guilin, China
Conference code:67976
Publisher:Springer Verlag
Abstract:The paper proposes an agent-based constraint programming architecture that we have
successfully applied to solve large, particularly combinatorial, operations problems. The
architecture is based on the asynchronous team (A-Team) in which multiple problem solving
agents cooperate with each other by exchanging results to produce a set of non-dominated
solutions. We extend the A-Team by introducing CSP-specific agents, explicitly defining solution
states, and enabling solution decomposition/composition, and thereby improve the performance,
reliability, and automation of constraint programming significantly. &copy; Springer-Verlag Berlin
Heidelberg 2006.
Number of references:12
Main heading:Computer architecture
Controlled terms:Computer programming - Constraint theory - Multi agent systems - Problem
solving
Uncontrolled terms:Asynchronous team (A-Team) - Constraint programming architecture -
Solution decomposition - Solution states
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723 Computer Software, Data Handling and Applications - 723.1
Computer Programming - 723.4 Artificial Intelligence - 723.5 Computer Applications
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 75>
Accession number:2006219897363
Title:Architecture for extensible and configurable event notification service
Authors:Wang, Yang (1); Wei, Jun (1); Wang, Zhen-Yu (2)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China;
(2) Wuhan Digital Engineering Institute, Wuhan 430074, China
Corresponding author:Wang, Y.
       (yangwang@public.wh.hb.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:3
Issue date:March 2006
Publication year:2006
Pages:638-648
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:Event notification services, specially based on Publish/subscribe infrastructures, are used
in a large spectrum of distributed applications as their basic communication and integration
infrastructure. With their recent popularization, event notification services are required to support
various specific application domains. The state of practice is that, in the development of
distributed applications, developers face the dilemma of choosing between application-specific or
general purpose notification servers. In this paper, a flexible solution is proposed - a dynamically
customizable and extensible architecture for notification services, which is presented based on
configuration management and meta-service mechanisms with the ability to customize and extend
the subscription, event description, interaction protocol and configuration languages. It allows
dynamical extension and customization of the notification service to satisfy not only functional
requirements but also non-functional features from application domains.
Number of references:22
Main heading:Communication
Controlled terms:Architecture - Integration - Middleware - XML
Uncontrolled terms:Configuration management - Distributed applications - Dynamic architecture -
Event based middleware - Event notification service - Extensible architecture - Meta service
mechanisms - Pub proxy - Publish/subscribe system - Smart proxy - Sub proxy
Classification code:402 Buildings and Towers - 716 Telecommunication; Radar, Radio and
Television - 723 Computer Software, Data Handling and Applications - 921.2 Calculus
Treatment:Applications (APP)
DOI:10.1360/jos170638
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 76>
Accession number:2006129772960
Title:Approaches and technologies for formal verification of security protocols
Authors:Xue, Rui (1); Feng, Deng-Guo (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Xue, R.
Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:1
Issue date:January 2006
Publication year:2006
Pages:1-20
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:The formal methods for verifying security protocols are classified and analyzed from
technological points of view. Authors survey the developing history of analyzing approaches and
techniques on security protocols; describe the current status, as well as point out the tendency of
them. This work comes from authors' personal research interesting, and it processes in two
different lines: The first line follows the trace of emergence and developments of formal methods
in verification of security protocols. The other line is to analyze the features when concrete
systems are used during verification. The most popular methods and systems are briefly
introduced by examples.
Number of references:72
Main heading:Network protocols
Controlled terms:Mathematical models - Reliability - Security systems
Uncontrolled terms:Cryptographic reliability - Dolev Yao model - Formal analysis - Secure
protocol - Security goal
Classification code:421 Strength of Building Materials; Mechanical Properties - 723 Computer
Software, Data Handling and Applications - 914.1 Accidents and Accident Prevention - 921
Mathematics
Treatment:General review (GEN)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 77>
Accession number:20064310200380
Title:A distributed approach to construction of topology mismatching aware P2P overlays in
wireless ad hoc networks
Authors:Huang, Yu (1); Jin, Beihong (2); Cao, Jiannong (3)
Author affiliation:(1) Dept. of Computer Science, Univ. of Science and Technology of China,
Hefei, China; (2) Institute of Software, Chinese Academy of Sciences, Beijing, China; (3) Dept. of
Computing, Hong Kong Polytechnic Univ., Hong Kong, Hong Kong
Corresponding author:Huang, Y.
       (yuhuang@otcaix.iscas.ac.cn)

Source title:Proceedings - 14th Euromicro International Conference on Parallel, Distributed, and
Network-Based Processing, PDP 2006
Volume:2006
Monograph title:Proceedings - 14th Euromicro International Conference on Parallel, Distributed,
and Network-Based Processing, PDP 2006
Issue date:2006
Publication year:2006
Pages:340-347
Article number:1613293
Language:English
ISBN-10:076952513X
ISBN-13:9780769525136
Document type:Conference article (CA)
Conference name:14th Euromicro International Conference on Parallel, Distributed, and
Network-Based Processing, PDP 2006
Conference date:Febrary 15, 2006 - Febrary 17, 2006
Conference location:Montbeliard-Sochaux, France
Conference code:68364
Publisher:Institute of Electrical and Electronics Engineers Computer Society
Abstract:Peer-to-Peer computing is mainly based on the virtual overlay network constructed in the
application layer. Often, there is topology mismatching between the overlay network and the
physical network, which may cause great traffic overhead. In this paper, we study the topology
mismatching problem and its impact on communication in wireless ad hoc networks. We present
an efficient, fully distributed algorithm, named D-TAOC, for constructing the overlay network. By
qualitative analysis and simulation experiments, we show that D-TAOC can significantly reduce
the traffic overhead while slightly sacrificing the routing efficiency. We also prove that D-TAOC
works well in a dynamic peer-to-peer environment. &copy; 2006 IEEE.
Number of references:18
Main heading:Distributed computer systems
Controlled terms:Algorithms - Computer simulation - Data transfer - Routers - Virtual reality -
Wireless telecommunication systems
Uncontrolled terms:Distributed algorithms - Peer to Peer computing - Routing efficiency -
Wireless ad hoc networks
Classification code:716 Telecommunication; Radar, Radio and Television - 722.4 Digital
Computers and Systems - 723 Computer Software, Data Handling and Applications - 723.2 Data
Processing and Image Processing - 723.5 Computer Applications
Treatment:Theoretical (THR); Experimental (EXP)
DOI:10.1109/PDP.2006.9
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 78>
Accession number:2006259948894
Title:Analysis and improvement of a security-provable mutually authenticated key agreement
protocol
Authors:Zhou, Yong-Bin (1); Zhang, Zhen-Feng (1); Feng, Deng-Guo (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China;
(2) State Key Laboratory of Information Security, Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China
Corresponding author:Zhou, Y.-B.
       (zyb@is.iscas.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:4
Issue date:April 2006
Publication year:2006
Pages:868-875
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:Deng, et al. proposed a security-provable mutually authenticated key agreement protocol
MAKAP for mobile communication in 2003. This paper demonstrates by mounting an effective
attack against MAKAP that the protocol has security flaws. It is vulnerable against unknown
key-share attack. This paper investigates the reasons why such flaws exist and proposes an
improved protocol version (called MAKAP-I protocol). The MAKAP-I protocol is not only
provably secure within the random oracle model but also more efficient and practical in terms of
computation and communication cost memory requirement and implementation cost, than the
original MAKAP protocol.
Number of references:10
Main heading:Public key cryptography
Controlled terms:Mobile telecommunication systems - Mountings - Network protocols - Security
of data
Uncontrolled terms:Communication cost - Memory requirement cost - Mobile communication -
Mutually authenticated key agreement protocol (MAKAP) - Provable security - Security flaws -
Unknown key share attack
Classification code:717 Optical Communication - 723 Computer Software, Data Handling and
Applications
Treatment:Applications (APP)
DOI:10.1360/jos170868
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 79>
Accession number:20063010029802
Title:Interactively rendering dynamic caustics on GPU
Authors:Liu, Baoquan (1); Wu, Enhua (1); Liu, Xuehui (1)
Author affiliation:(1) State Key Lab. of Computer Science, Institute of Software, Chinese
Academy of Sciences, Beijing; (2) Department of Computer and Information Science, University
of Macau, China; (3) Graduate University, Chinese Academy of Sciences
Corresponding author:Liu, B.
        (lbq@ios.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4035 LNCS
Monograph title:Advances in Computer Graphics - 24th Computer Graphics International
Conference, CGI 2006
Issue date:2006
Publication year:2006
Pages:136-147
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:354035638X
ISBN-13:9783540356387
Document type:Conference article (CA)
Conference name:24th Computer Graphics International Conference, CGI 2006
Conference date:June 26, 2006 - June 28, 2006
Conference location:Hangzhou, China
Conference code:67899
Publisher:Springer Verlag
Abstract:In this paper, a new technique is presented for interactive rendering of caustics fully
processed on GPU. Without any pre-computation required, the algorithm can directly render
refractive caustics from complex deformable transparent objects onto an opaque receiver surface.
By the technique we accurately trace the path of the photons and calculate the energy carried by
the photons emitted from the light source, and distribute the energy onto the receiver surface
according to Gauss basis function. As a result, photorealistic caustic image is calculated without
post-processing and temporal filtering over recent frames. We demonstrate that the interactive
caustics can be rendered by our method in real-time for non-uniform deformation of both
refractive object and receiver surface, and at the same time, interactive change of light and camera
in terms of position and direction could be made. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:13
Main heading:Computer graphics
Controlled terms:Algorithms - Cameras - Computational methods - Image processing - Light
sources - Photons
Uncontrolled terms:Caustics - Gauss basis function - GPU - Refractive object
Classification code:707.2 Electric Lamps - 721.1 Computer Theory, Includes Formal Logic,
Automata Theory, Switching Theory, Programming Theory - 723.2 Data Processing and Image
Processing - 723.5 Computer Applications - 742.2 Photographic Equipment - 931.3 Atomic and
Molecular Physics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 80>
Accession number:20062910013962
Title:Constraint-based termination analysis of active rules
Authors:Xu, Guihong (1); Zhang, Jian (1)
Author affiliation:(1) Laboratory of Computer Science, Institute of Soft-ware, Chinese Academy
of Sciences, Beijing 100080, China; (2) Graduate University, Chinese Academy of Sciences,
Beijing 100049, China
Corresponding author:Xu, G.
       (xgh@ios.ac.cn)

Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development
Abbreviated source title:Jisuanji Yanjiu yu Fazhan
Volume:43
Issue:5
Issue date:May 2006
Publication year:2006
Pages:894-900
Language:Chinese
ISSN:10001239
CODEN:JYYFEY
Document type:Journal article (JA)
Publisher:Science Press
Abstract:Detecting termination of rules is in general undecidable. Existing static analysis
techniques are very conservative, and the current SQL3 standard does not prescribe methods for
ensuring termination, so most commercial database products impose a fixed upper limit on the
number of cascading rule firings. The commercial solution has undesirable effects e.g. some
correct rule firing sequences may prematurely be halted. Since a rule can be viewed as a database
state transformer, database states are expressed with linear and Boolean hybrid constraints, and
processing of rules is simulated based on constraint expressions and constraint solving. This
method can obtain more precise conclusion than the existing methods.
Number of references:15
Main heading:Database systems
Controlled terms:Algorithms - Computer simulation - Constraint theory - Linear systems -
Standards
Uncontrolled terms:Active rule - Constraint solving - Database state - Termination
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.3 Database Systems - 723.5 Computer Applications - 731.1
Control Systems - 902.2 Codes and Standards - 921.6 Numerical Methods
Treatment:Applications (APP)
DOI:10.1360/crad20060519
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 81>
<RECORD 1>
Accession number:20064910289466
Title:View-dependent progressive transmission of highly detailed surfaces
Authors:Ji, Jun-Feng (1); Li, Sheng (1); Liu, Xue-Hui (1); Wu, En-Hua (1)
Author affiliation:(1) Key Laboratory of Computer Science, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Graduate School, Chinese Academy of Sciences,
Beijing 100049, China; (3) State Information Center of China, Beijing 100045, China; (4) School
of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China; (5)
Department of Computer and Information Science, Faculty of Science and Technology, University
of Macau, Macao, China
Corresponding author:Ji, J.-F.
        (jijfn@mx.cei.gov.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:10
Issue date:October 2006
Publication year:2006
Pages:2192-2198
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:This paper presents a novel approach for the progressive transmission of highly detailed
surfaces interactively. Based on the characteristics in human vision, 3D surfaces are converted into
the hierarchical quadtree in parameter space and a normal texture atlas. By taking advantage of
normal mapping, only the silhouette to current viewpoint is refined and transmitted, and
consequently the amount of patches needed to transfer each frame is greatly reduced. The structure
of the representation is simple, so efficient compression scheme can be applied to encoding the
hierarchical topological structure. At the same time, the parametric patches can be transmitted in
arbitrary order due to their regular connectivity, so the truly view-dependent transmission could be
achieved in high efficiency. Experiment results show that the approach proposed is feasible and
highly efficient in meeting the requirement, especially to those models with highly detailed
surfaces.
Number of references:22
Main heading:Computer graphics
Controlled terms:Mapping - Surfaces - Textures - Transmissions - Vision
Uncontrolled terms:Human vision - Normal mapping - Progressive transmission - Quadtree - View
dependent
Classification code:723.5 Computer Applications - 741.2 Vision
Treatment:Applications (APP); Experimental (EXP)
DOI:10.1360/jos172192
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 82>
Accession number:20071710565345
Title:A risk-driven method for eXtreme programming release planning
Authors:Mingshu, Li (1); Meng, Huang (1); Fengdi, Shu (1); Juan, Li (1)
Author affiliation:(1) Lab. for Internet Software Technologies, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) State Key Laboratory of Computer Science,
Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (3) Graduate
University, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Mingshu, L.
        (mingshu@itechs.iscas.ac.cn)

Source title:Proceedings - International Conference on Software Engineering
Abbreviated source title:Proc Int Conf Software Eng
Volume:2006
Monograph title:Proceeding of the 28th International Conference on Software Engineering 2006,
ICSE '06
Issue date:2006
Publication year:2006
Pages:423-430
Language:English
ISSN:02705257
CODEN:PCSEDE
ISBN-10:1595933751
ISBN-13:9781595933751
Document type:Conference article (CA)
Conference name:28th International Conference on Software Engineering 2006, ICSE '06
Conference date:May 20, 2006 - May 28, 2006
Conference location:Shanghai, China
Conference code:69469
Sponsor:ACM Special Interest Group on Software Engineering, SIGSOFT
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:XP (eXtreme Programming) has become popular for IID (Iteration and Increment
Development). It is suitable for small teams, lightweight projects and vague/volatile requirements.
However, some challenges are left to developers when they desire to practise XP. A critical one of
them is constructing the release plan and negotiating it with customers. In this paper, we propose a
risk-driven method for XP release planning. It has been applied in a case study and the results
show the method is feasible and effective. XP practicers can follow it to decide a suitable release
plan and control the development process. Copyright 2006 ACM.
Number of references:28
Main heading:Computer programming
Controlled terms:Computer aided software engineering - Project management - Requirements
engineering - Risk assessment
Uncontrolled terms:Iteration and Increment Development (IID) - Lightweight projects - XP
release planning
Classification code:723.1 Computer Programming - 723.5 Computer Applications - 912.2
Management - 914.1 Accidents and Accident Prevention
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 83>
Accession number:2006259955120
Title:Spiral pro: A project plan generation framework and support tool
Authors:Wang, Jizhe (1); Meyers, Steven (3)
Author affiliation:(1) Laboratory for Internet Software Technologies, Institute of Soft Ware,
Chinese Academy of Sciences, Beijing 100080, China; (2) Graduate School, Chinese Academy of
Sciences, Beijing 100039, China; (3) Center for Software Engineering, University of Southern
California, Los Angeles, CA 90089, United States; (4) Software Process Group, 1968 W. Adams
Blvd., Los Angeles, CA 90018, United States
Corresponding author:Wang, J.
        (wangjizhe@itechs.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3840 LNCS
Monograph title:Unifying the Software Process Spectrum - International Software Process
Workshop, SPW 2005, Revised Selected Papers
Issue date:2006
Publication year:2006
Pages:262-276
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540311122
ISBN-13:9783540311126
Document type:Conference article (CA)
Conference name:International Software Process Workshop, SPW 2005
Conference date:May 25, 2005 - May 27, 2005
Conference location:Beijing, China
Conference code:67507
Publisher:Springer Verlag
Abstract:Project planning is a delicate and on-going activity that requires a great deal of
experience and knowledge. Several models and methods are developed which explore the various
aspects of planning a project. In this paper, we propose a framework named Spiral Pro that
integrates Spiral Model, MBASE and COCOMO II to help project managers do their project
planning in a systematic way. In an empirical study, a project plan template, developed following
the framework, was provided for thirteen e-service projects and a survey was used at the end to
assess the study. Based on the survey, some characteristics are summarized, which help point out
the effectiveness of using of Spiral Pro framework. Motivated by the findings in the study, a tool
has been developed to help both experienced and inexperienced project managers make better use
of the framework for project planning. &copy; Springer-Verlag Berlin Heidelberg 2005.
Number of references:20
Main heading:Project management
Controlled terms:Computer software - Electronic commerce - Managers - Mathematical models -
Strategic planning
Uncontrolled terms:Project managers - Project plan generation - Project planning
Classification code:723.5 Computer Applications - 912.2 Management - 912.4 Personnel - 921
Mathematics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 84>
Accession number:20073210756552
Title:Co-CreativePen toolkit: A pen-based 3D toolkit for children cooperatly designing virtual
environment
Authors:Tian, Feng (1); Wang, Hongan (1); Zhang, Fengjun (1); Dai, Guozhong (1)
Author affiliation:(1) Intelligence Engineering Lab., Institute of Software, Chinese Academy of
Sciences, P.O. Box 8718, Beijing, 100080, China
Corresponding author:Tian, F.
       (tf@iel.iscas.ac.cn)

Source title:Proceedings - 2006 10th International Conference on Computer Supported
Cooperative Work in Design, CSCWD 2006
Abbreviated source title:Proc. Int. conf. Comput. Supported Coop. Work Des.
Monograph title:Proceedings - 2006 10th International Conference on Computer Supported
Cooperative Work in Design, CSCWD 2006
Issue date:2006
Publication year:2006
Pages:360-364
Article number:4019097
Language:English
ISBN-10:1424401658
ISBN-13:9781424401659
Document type:Conference article (CA)
Conference name:2006 10th International Conference on Computer Supported Cooperative Work
in Design, CSCWD 2006
Conference date:May 3, 2006 - May 5, 2006
Conference location:Nanjing, China
Conference code:69887
Sponsor:Southeast University, China; IEEE Beijing Section; National Natural Science Foundation
of China; CIMS Committee, National Hi-Tech R and D Program of China; K.C.Wong Education
Foundation, Hong Kong
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Co-CreativePen Toolkit is a pen-based 3D toolkit for children cooperatly designing
virtual environment. This toolkit is used to construct different applications involved with
distributed pen-based 3D interaction. In this toolkit, sketch method is encapsulated as kinds of
interaction techniques. Children can use pen to construct 3D and IBR objects, to navigate in the
virtual world, to select and manipulate virtual objects, and to communicate with other children.
Children can use pen to select other children in the virtual world, and use pen to write message to
children selected. The distributed architecture of Co-CreativePen Toolkit is based on the CORBA.
A common scene graph is managed in the server with several copies of this graph are managed in
every client. Every changes of the scene graph in client will cause the change in the server and
other client. &copy; 2006 IEEE.
Number of references:13
Main heading:Computer supported cooperative work
Controlled terms:Common object request broker architecture (CORBA) - Computer aided
software engineering - Interactive computer graphics - Three dimensional computer graphics -
Virtual reality
Uncontrolled terms:3D interaction - Scene graph - Virtual objects
Classification code:723.1 Computer Programming - 723.2 Data Processing and Image Processing
- 723.5 Computer Applications
Treatment:Theoretical (THR)
DOI:10.1109/CSCWD.2006.253154
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 85>
Accession number:20063410082420
Title:High performance SOAP processing based on dynamic template-driven mechanism
Authors:Hua, Lei (1); Wei, Jun (1); Niu, Chun-Lei (1); Zheng, Hao-Ran (1)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Hua, L.
        (hualei@otcaix.iscas.ac.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:7
Issue date:July 2006
Publication year:2006
Pages:1145-1156
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:In this paper, the authors first analyze the performance of SOAP processing on Java
platform, and identify that data model mapping between XML data and Java data is the main
impact factor on performance. Therefore, the authors propose a new paradigm of data model
mapping-Dynamic Early Binding which enables to improve SOAP processing by avoiding Java
reflection operations and proactively generating processing codes. This dynamic early binding is
realized by Data Mapping Template (DMT), which is specified by extended context free grammar
and implemented by pushdown automaton with output. The DMTs are generated and compiled at
runtime and drive the data mapping process with XML Pull Parsing. The authors illustrate the
effectiveness by applying it into a high performance SOAP engine, SOAPExpress, and yielding
over 100% speedups compared to Apache Axis 1.2 in Sun Microsystems' benchmark-WS Test 1.0.
Number of references:10
Main heading:Software engineering
Controlled terms:Context free grammars - Data processing - Finite automata - Java programming
language - Performance - XML
Uncontrolled terms:Data model mapping - Dynamic early binding - Service oriented architecture -
Web services
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.1 Computer Programming - 723.2 Data Processing and Image
Processing
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 86>
Accession number:2006289997181
Title:Anti-virus framework based on application monitor
Authors:Wu, Yanjun (0); Shi, Wenchang (0); Liang, Hongliang (0); Zhou, Zhouyi (0)
Corr. author affiliation:Institute of Software, Chinese Academy of Sciences, Beijing 100080,
China
Source title:Jisuanji Gongcheng/Computer Engineering
Abbreviated source title:Jisuanji Gongcheng
Volume:32
Issue:12
Issue date:Jun 20 2006
Publication year:2006
Pages:152-153+156
Language:Chinese
ISSN:10003428
CODEN:JISGEV
Document type:Journal article (JA)
Publisher:Shanghai Computer Society, Shanghai, China
Abstract:The paper introduces a new anti-virus framework under Linux based on application
monitoring. Each of the new files introduced by monitored applications is marked with a
suspected label. When a file with suspected label is accessed at first time, anti-virus scanning will
be performed. The mediation is done in kernel, thus transparent and mandatory to users. The
results of testing with ClamAV show the framework effectively prevents viruses from entering
system via common applications with low performance cost.
Number of references:5
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 87>
Accession number:20064610244672
Title:A conceptual approach to modeling model driven development processes
Authors:Duan, Yucong (1); Gu, Yuqing (1); Fu, Xiaolan (2)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, China; (2)
State Key Laboratory of Brain and Cognitive Science, Institute of Psychology, Chinese Academy
of Sciences, Beijing, China
Corresponding author:Duan, Y.
        (duanyucong@263.net)

Source title:Proceedings of the International Conference on Networking, International Conference
on Systems andInternational Conference on Mobile Communications and Learning Technologies,
ICN/ICONS/MCL'06
Abbreviated source title:Proc. Int. Conf. Netw. Int. Conf. Syst. Int. Conf. Mobile Com. Learn.
Technol.
Volume:2006
Monograph title:Proceedings of the International Conference on Networking, International
Conference on Systems andInternational Conference on Mobile Communications and Learning
Technologies, ICN/ICONS/MCL'06
Issue date:2006
Publication year:2006
Article number:1628424
Language:English
ISBN-10:0769525520
ISBN-13:9780769525525
Document type:Conference article (CA)
Conference name:International Conference on Networking, International Conference on Systems
andInternational Conference on Mobile Communications and Learning Technologies,
ICN/ICONS/MCL'06
Conference date:April 23, 2006 - April 29, 2006
Conference location:Morne, Mauritius
Conference code:68505
Sponsor:IARIA
Publisher:Institute of Electrical and Electronics Engineers Computer Society
Abstract:Many model driven software development (MDSD) processes take the form of the
integration of several development techniques or approaches. However comparing, selecting, and
composing of them usually go implicitly lacking systemic guidelines. In this paper a conceptual
approach for MDSD process frameworks modeling is proposed. Taking three inter-discipline
concepts, abstraction, generality, and behaviorism that are fundamental to mathematics,
philosophy as well as computer science as comparison dimensions, development techniques are
compared in both static and dynamic facets of MDSD processes. An experimental method for
composing them into development process frameworks is also given. This work potentially will be
beneficial to meet nonfunctional software performance requirements on MDSD processes such as
improving efficiency, traceability, and ensuring consistency etc. &copy; 2006 IEEE.
Number of references:34
Main heading:Software engineering
Controlled terms:Abstracting - Computer science - Computer simulation - Mathematical models
Uncontrolled terms:Many model driven software development (MDSD) - Systemic guidelines -
Traceability
Classification code:721 Computer Circuits and Logic Elements - 723.1 Computer Programming -
723.5 Computer Applications - 903.1 Information Sources and Analysis - 921 Mathematics
Treatment:Theoretical (THR); Experimental (EXP)
DOI:10.1109/ICNICONSMCL.2006.5
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 88>
Accession number:20070510400078
Title:Stability analysis of multi-regime networked control systems
Authors:Zheng, Gang (1); Tan, Min (2); Song, Y.H. (3)
Author affiliation:(1) General Software Laboratory, Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China; (2) Institute of Automation, Chinese Academy of Sciences,
Beijing 100080, China; (3) Department of Electronic and Computer Engineering, Brunei
University, Uxbridge UB8 3PH, United Kingdom
Corresponding author:Zheng, G.
       (gangzhengcn@yahoo.com.cn)

Source title:Kongzhi Lilun Yu Yinyong/Control Theory and Applications
Abbreviated source title:Kong Zhi Li Lun Yu Ying Yong
Volume:23
Issue:5
Issue date:October 2006
Publication year:2006
Pages:749-755
Language:Chinese
ISSN:10008152
CODEN:KLYYEB
Document type:Journal article (JA)
Publisher:South China University of Technology, Guangzhou, 510640, China
Abstract:A network-induced delay occurs frequently in networked control systems. A hybrid
automaton with delay (HAD) is proposed to model a class of networked control systems with
multiple continuous dynamical regimes. Based on the HAD model, the stability for the
equilibrium of a networked control system is analyzed, and the sufficient condition of the stability
for the equilibrium is also presented, in which, multiple Lyapunov functionals, with respect to the
discrete states of the HAD, are non-increasing across the time instants when discrete transitions
happen. Furthermore, for the case where the continuous dynamics in the HAD is denoted by a
linear time invariant system with delay, the linear matrix inequality (LMI) technique is employed
to search for a common Lyapunov functional of different discrete states in the HAD and to obtain
the upper bound on the system delay remaining stable. Finally, an example is given to illustrate the
analysis results.
Number of references:16
Main heading:Closed loop control systems
Controlled terms:Computer simulation - Feedback control - Internet - Stability
Uncontrolled terms:Discrete states - Hybrid systems - Linear matrix inequality - Linear time
invariant system - Lyapunov function - Networked control - Time delay
Classification code:716 Telecommunication; Radar, Radio and Television - 723.5 Computer
Applications - 731.1 Control Systems
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 89>
Accession number:20064210172586
Title:ESTS: An error statistic based time synchronization protocol for wireless sensor networks
Authors:Sun, Limin (1); Wang, Haidong (1); Yan, Tingxin (1); Liu, Jingjing (2)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, P.O.Box 8718, Beijing
100080, China; (2) Grade 04 Finance Department, College of Economy, Centre University for
Nationalities Beijing, 100081 Beijing, China
Corresponding author:Sun, L.
       (sunlimin@ios.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4114 LNAI - II
Monograph title:Computational Intelligence International Conference on Intelligent Computing,
ICIC 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:1317-1323
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540372741
ISBN-13:9783540372745
Document type:Conference article (CA)
Conference name:International Conference on Intelligent Computing, ICIC 2006
Conference date:August 16, 2006 - August 19, 2006
Conference location:Kunming, China
Conference code:68291
Publisher:Springer Verlag
Abstract:Time synchronization in wireless sensor networks is critical for providing accurate
timing service to many applications. This paper presents an Error Statistic based Time
Synchronization protocol (ESTS) for wireless sensor networks. ESTS uses a flooding mechanism
for basic global time synchronization and delay measurement, and achieves a fine grained
synchronization through compensating per hop delay to all the nodes. It is a light weight
mechanism for its simplicity in both computation and communication. Experiments show that
ESTS obtains a better performance in energy efficiency than most in-situ time synchronization
protocols in the same precision level. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:10
Main heading:Wireless telecommunication systems
Controlled terms:Energy efficiency - Error statistics - Network protocols - Sensors -
Synchronization
Uncontrolled terms:Flooding mechanism - Time Synchronization protocol - Timing services -
Wireless sensor networks
Classification code:525.2 Energy Conservation - 716 Telecommunication; Radar, Radio and
Television - 723 Computer Software, Data Handling and Applications - 731.1 Control Systems -
732.2 Control Instrumentation - 922.2 Mathematical Statistics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 90>
Accession number:20080711094409
Title:Generalized unsolicited tests for authentication protocol analysis
Authors:Li, Yongjian (1); Pang, Jun (3)
Author affiliation:(1) Chinese Academy of Sciences, Institute of Software, Laboratory of
Computer Science, P.O.Box 8718, Beijing, China; (2) State Key Laboratory of Information
Security, P.O.Box 8718, Beijing, China; (3) University of Oldenburg, Department of Computer
Science, Safety-critical Embedded Systems, 26111 Oldenburg, Germany; (4) Chinese Academy of
Sciences, Institute of Software, Laboratory of Computer Science, 4# South Fourth Street, Zhong
Ciuan Cun, Beijing, China
Corresponding author:Li, Y.
       (lyj238@ios.ac.cn)

Source title:Parallel and Distributed Computing, Applications and Technologies, PDCAT
Proceedings
Abbreviated source title:Parallel Distrib. Comput. Appl. Technol. PDCAT Proc.
Monograph title:Proceedings - Seventh International Conference on Parallel and Distributed
Computing, Applications and Technologies, PDCAT 2006
Issue date:2006
Publication year:2006
Pages:509-514
Article number:4032236
Language:English
ISBN-10:0769527361
ISBN-13:9780769527369
Document type:Conference article (CA)
Conference name:7th International Conference on Parallel and Distributed Computing,
Applications and Technologies, PDCAT 2006
Conference date:December 4, 2006 - December 7, 2006
Conference location:Taipei, Taiwan
Conference code:71345
Sponsor:IEEE Computer Society; Inst. Electronics, Information and Communication Engineers;
Institute of Information Science Academia Sinica; National United University; National Taiwan
University of Science and Technology
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Guttman and Javier Thayer introduced the notion of unsolicited authentication tests, and
used it to prove the correctness of security protocols in which a key server authenticate its clients.
As an example, they have applied unsolicited authentication tests to prove the authentication goals
of the Otway-Rees protocol. However, unsolicited authentication tests seem not to be fully
explored in that case study, and the proofs were complicated. In this paper, we revisit the
unsolicited authentication tests, and show how to strengthen and apply them in more general cases.
To justify our work, we also use this extension to prove all agents' authentication guarantee of the
Otway-Rees protocol. &copy; 2006 IEEE.
Number of references:8
Main heading:Network protocols
Controlled terms:Authentication - Computational methods
Uncontrolled terms:Cryptographic protocols - Otway-Rees protocols - Strand space
Classification code:723 Computer Software, Data Handling and Applications - 921 Mathematics
Treatment:Theoretical (THR)
DOI:10.1109/PDCAT.2006.65
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 91>
Accession number:20081811228160
Title:Difficulties in estimating available bandwidth
Authors:Zhou, Hui (3); Wang, Yongji (2); Wang, Xiuli (3); Huai, Xiaoyong (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences; (2) Key Laboratory for
Computer Science, Chinese Academy of Sciences; (3) Graduate University, Chinese Academy of
Sciences
Corresponding author:Zhou, H.
        (hzhou@itechs.iscas.ac.cn)

Source title:IEEE International Conference on Communications
Abbreviated source title:IEEE Int Conf Commun
Volume:2
Monograph title:2006 IEEE International Conference on Communications, ICC 2006
Issue date:2006
Publication year:2006
Pages:704-709
Article number:4024211
Language:English
ISSN:05361486
ISBN-10:1424403553
ISBN-13:9781424403554
Document type:Conference article (CA)
Conference name:2006 IEEE International Conference on Communications, ICC 2006
Conference date:July 11, 2006 - July 15, 2006
Conference location:Istanbul, Turkey
Conference code:71912
Publisher:Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Available bandwidth estimation is very important for network operators, users, and
bandwidth-sensitive applications. In the last 15 years, a large number of techniques and software
tools have been introduced to estimate the available bandwidth actively. Many of them were
verified in simulation and over a limited number of Internet paths. However, none of them have
been widely used because there is still great uncertainty in their accuracy over the Internet at large.
Based on the analysis of 11 well-known tools and our own experience in developing one of them,
we present a comprehensive analysis of the fundamental difficulties with most of the existing tools.
&copy; 2006 IEEE.
Number of references:31
Main heading:Bandwidth
Controlled terms:Computer aided software engineering - Computer simulation - Sensitivity
analysis - Telecommunication networks - User interfaces
Uncontrolled terms:Bandwidth estimation - Bandwidth-sensitive applications - Internet paths
Classification code:716.1 Information Theory and Signal Processing - 722.2 Computer Peripheral
Equipment - 723.1 Computer Programming - 723.5 Computer Applications - 921 Mathematics
Treatment:Theoretical (THR)
DOI:10.1109/ICC.2006.254790
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 92>
Accession number:2005489518322
Title:A new fuzzy approach to improve fashion product development
Authors:Lau, T.W. (1); Hui, Patrick C.L. (1); Ng, Frency S.F. (1); Chan, Keith C.C. (2)
Author affiliation:(1) Institute of Textiles and Clothing, Hong Kong Polytechnic University, Hung
Hom, Kowloon, Hong Kong; (2) Department of Computing, Hong Kong Polytechnic University,
Hung Hom, Kowloon, Hong Kong; (3) Institution of Electrical Engineers; (4) Institute of Textiles
and Clothing, Hong Kong Polytechnic University; (5) British Computer Society; (6) Institute of
Textiles and Clothing; (7) Textile Institute, United Kingdom; (8) Department of Computing; (9)
Institute of Software, Chinese Academy of Sciences, Beijing, China
Corresponding author:Hui, P.C.L.
Source title:Computers in Industry
Abbreviated source title:Comput Ind
Volume:57
Issue:1
Issue date:January 2006
Publication year:2006
Pages:82-92
Language:English
ISSN:01663615
CODEN:CINUD4
Document type:Journal article (JA)
Publisher:Elsevier
Abstract:This study attempts to use a fuzzy expert system with gradient descent optimization for
prediction of fabric specimens in fashion product development. Compared with the traditional
methods used fabric mechanical properties to predict fabric specimens, our advisory system
accepts fabric hand descriptors which are more closely related to the sensory judgments made by
individuals during fabric selection. Fifty participants were selected to evaluate the performance of
the proposed fuzzy fabric advisory system. They were asked to express their preferred fabric
specimen on inputs of the 14 bipolar fabric hand descriptors in the system. The fuzzy prediction
rules associated with the membership functions of each fabric specimen were developed from a
survey. After fine-tuning of the proposed system, the prediction accuracy is over eighty percent.
The outcomes of this study could help consumers to select the most appropriate fabric and provide
field practitioners appropriate suggestions for effective product development in clothing and
fashion industries. &copy; 2005 Elsevier B.V. All rights reserved.
Number of references:24
Main heading:Fuzzy sets
Controlled terms:Knowledge based systems - Optimization - Product development - Sensory
perception
Uncontrolled terms:Fabric hand descriptors - Fabric specimen prediction - Fuzzy systems -
Sensory knowledge
Classification code:461.4 Ergonomics and Human Factors Engineering - 723.4.1 Expert Systems -
913.1 Production Engineering - 921 Mathematics - 921.5 Optimization Techniques
Treatment:Theoretical (THR)
DOI:10.1016/j.compind.2005.04.003
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 93>
Accession number:2006229911980
Title:Static data-race detection for multithread programs
Authors:Wu, Ping (1); Chen, Yiyun (1); Zhang, Jian (2)
Author affiliation:(1) Department of Computer Science and Technology, University of Science and
Technology of China, Hefei 230027, China; (2) Laboratory of Computer Science, Institute of
Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Wu, P.
        (cynthia@ustc.edu.cn)

Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development
Abbreviated source title:Jisuanji Yanjiu yu Fazhan
Volume:43
Issue:2
Issue date:February 2006
Publication year:2006
Pages:329-335
Language:Chinese
ISSN:10001239
CODEN:JYYFEY
Document type:Journal article (JA)
Publisher:Science Press
Abstract:Multithreaded concurrent programs are finding wide application, which brings more
detrimental data race errors. Traditional static race detection methods are bothered by false
positives caused by conservative analysis of concurrent semantics and alias info. In this paper, a
precise and effective analysis framework is proposed. The framework applies precise alias
analysis and simulates the happen-before order statically. To improve efficiency, an object-based
race checker is proposed and compact equality-class-based alias representation is designed. The
framework is implemented in a Java compiler-JTool. Through empirical results, the precision and
effectiveness of the proposed algorithm are demonstrated.
Number of references:10
Main heading:Data processing
Controlled terms:Algorithms - Computer programming - Data flow analysis - Semantics - Transfer
functions
Uncontrolled terms:Alias analysis - Benchmark programs - Concurrent programs - Conservative
analysis - Data race - Java compiler - Multithread programs - Program analysis - Static race
detection methods - Temporal constraint graph
Classification code:723.1 Computer Programming - 723.2 Data Processing and Image Processing
- 731.1 Control Systems - 903.2 Information Dissemination - 921 Mathematics
Treatment:Applications (APP)
DOI:10.1360/crad20060221
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 94>
Accession number:20080711094569
Title:Developing a selection model for interactive Web services
Authors:Shuchao, Wan (1); Jun, Wei (1); Jingyu, Song (1); Heqing, Guan (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, China; (2)
Graduate School, Chinese Academy of Sciences, Beijing, China
Corresponding author:Shuchao, W.
       (wsc@otcaix.iscas.ac.cn)

Source title:Proceedings - ICWS 2006: 2006 IEEE International Conference on Web Services
Abbreviated source title:Proc. ICWS IEEE Int. Conf. Web Serv.
Monograph title:Proceedings - ICWS 2006: 2006 IEEE International Conference on Web Services
Issue date:2006
Publication year:2006
Pages:231-238
Article number:4032032
Language:English
ISBN-10:0769526691
ISBN-13:9780769526690
Document type:Conference article (CA)
Conference name:ICWS 2006: 2006 IEEE International Conference on Web Services
Conference date:September 18, 2006 - September 22, 2006
Conference location:Chicago, IL, United states
Conference code:71350
Sponsor:IEEE Computer Society, Technical Committee on Services Computing
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Traditional web services are function oriented, where various developed standards
mainly assist business applications to expose their functional descriptions, but each service
consumer is required to develop different presentation logics for the same business logic
respectively. Although works on the Interactive Web Service (IWS) make some progress and
achieve the result of WSRP, researchers keep on making efforts to encapsulate user interface with
the functional interface so as to present available information of content and facilitate the direct
interactions between users and back-end services. Regarding IWS this paradigm of web services,
service selection will shift focus from function orientation to presentation orientation. This paper
proposes a novel IWS description model with the extension of an element -View and its three
sub-elements including presentation, content and interaction, with which IWS can be described
more completely and accurately. Based on the description model, an IWS selection model with
matching rules is developed, which can meet diverse selection requirements of service consumers
at multiple levels and aspects. &copy; 2006 IEEE.
Number of references:15
Main heading:Pattern recognition
Controlled terms:Competitive intelligence - Interactive computer systems - Standards - User
interfaces - Web services
Uncontrolled terms:Back end services - Interactive Web services
Classification code:716 Telecommunication; Radar, Radio and Television - 722.2 Computer
Peripheral Equipment - 722.4 Digital Computers and Systems - 723 Computer Software, Data
Handling and Applications - 902.2 Codes and Standards - 912.2 Management
Treatment:Theoretical (THR)
DOI:10.1109/ICWS.2006.50
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 95>
Accession number:20064710255835
Title:Identity-based PKI scheme for machine readable travel document
Authors:Zhang, Fan (1); Feng, Deng-Guo (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Zhang, F.
        (zhangfan@is.iscas.ac.cn)

Source title:Proceedings - International Conference on Advanced Information Networking and
Applications, AINA
Abbreviated source title:Proc. Int. Conf. Adv. Inf. Netw. Appl. AINA
Volume:2
Monograph title:Proceedings - 20th International Conference on Advanced Information
Networking and Applications
Issue date:2006
Publication year:2006
Pages:461-465
Article number:1620422
Language:English
ISSN:1550445X
ISBN-10:0769524664
ISBN-13:9780769524665
Document type:Conference article (CA)
Conference name:20th International Conference on Advanced Information Networking and
Applications
Conference date:April 18, 2006 - April 20, 2006
Conference location:Vienna, Austria
Conference code:68528
Sponsor:IEEE Computer Society Technical Committee on Distributed Proces.; Vienna University
of Technology, Vienna, Austria
Publisher:Institute of Electrical and Electronics Engineers Inc.
Abstract:Certificate-based Public Key Infrastructure (PKI) scheme of International Civil Aviation
Organization (ICAO) has some problems, especially with the distribution of public key. In this
paper, we propose an identity-based PKI scheme for Machine Readable Travel Document
(MRTD). By virtue of simple key management on identity-based signature, our scheme facilitates
public key distribution among participating countries, and eliminates the need of a global Public
Key Directory (PKD). &copy; 2006 IEEE.
Number of references:7
Main heading:Electronic document identification systems
Controlled terms:Public key cryptography - Security of data - Technology transfer
Uncontrolled terms:Machine Readable Travel Document (MRTD) - Public Key Directory (PKD) -
Public Key Infrastructure (PKI)
Classification code:716 Telecommunication; Radar, Radio and Television - 723.2 Data Processing
and Image Processing - 723.5 Computer Applications - 901.4 Impact of Technology on Society
Treatment:Theoretical (THR)
DOI:10.1109/AINA.2006.196
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 96>
Accession number:2006289986254
Title:Security analysis of a server-aided RSA key generation protocol
Authors:Cao, Tianjie (1); Mao, Xianping (1); Lin, Dongdai (2)
Author affiliation:(1) School of Computer Science and Technology, China University of Mining
and Technology, Xuzhou 221008, China; (2) State Key Laboratory of Information Security,
Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (3) Graduate School,
Chinese Academy of Sciences, Beijing 100039, China
Corresponding author:Cao, T.
        (tjcao@is.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3903 LNCS
Monograph title:Information Security Practice and Experience - Second International Conference,
ISPEC 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:314-320
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540330526
ISBN-13:9783540330523
Document type:Conference article (CA)
Conference name:2nd International Conference on Information Security Practice and Experience,
ISPEC 2006
Conference date:April 11, 2006 - April 14, 2006
Conference location:Hangzhou, China
Conference code:67679
Sponsor:Singapore Management University, Singapore; Shanghai Jiaotong University, China;
Institute for Infocomm Research, Singapore
Publisher:Springer Verlag
Abstract:Modadugu, Boneh and Kim proposed two RSA key generation protocols (MBK
Protocols) to generate the RSA keys efficiently on a low-power handheld device with the help of
the untrusted servers, and the servers do not get any useful information about the keys they helped
generation, The security of MBK Protocols is based on the assumption that the two servers are
unable to share information with each other. To resists a "collusion attack", namely the attack
which the two servers collude to share information in MBK Protocols, Chen et al. proposed two
improved protocols and claimed that their protocols are secure against such collusion attack. This
paper shows that Chen et al.'s standard RSA key generation protocol cannot resist collusion attack
and then cannot be used in practice. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:19
Main heading:Security of data
Controlled terms:Client server computer systems - Computer science - Distributed computer
systems - Information management - Network protocols
Uncontrolled terms:Collusion attack - Handheld device - Key generation protocols - Low-power
handheld device - MBK Protocols - Server-aided-RSA key generation
Classification code:721 Computer Circuits and Logic Elements - 722.4 Digital Computers and
Systems - 723.2 Data Processing and Image Processing - 903.2 Information Dissemination
Treatment:Theoretical (THR)
DOI:10.1007/11689522_29
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 97>
Accession number:20063210053404
Title:Approximate semantic query based on multi-agent systems
Authors:Ma, Yinglong (1); Wu, Kehe (1); Jin, Beihong (2); Liu, Shaohua (2)
Author affiliation:(1) School of Computer Science and Technology, North China Electric Power
University, Beijing 102206, China; (2) Technology Center of Software Engineering, Institute of
Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Ma, Y.
       (m_y_long@otcaix.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4062 LNAI
Monograph title:Rough Sets and Knowledge Technology - First International Conference, RSKT
2006, Proceedings
Issue date:2006
Publication year:2006
Pages:735-741
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540362975
ISBN-13:9783540362975
Document type:Conference article (CA)
Conference name:First International Conference on Rough Sets and Knowledge Technology,
RSKT 2006
Conference date:July 24, 2006 - July 26, 2006
Conference location:Chongqing, China
Conference code:67982
Sponsor:International Rough Set Society; National Natural Science Foundation of China;
Chongqing University of Posts and Telecommunications; Chongqing Institute of Technology;
Chongqing Science and Technology Commission
Publisher:Springer Verlag
Abstract:Within multi-agent systems, it is almost impossible for multiple Web agents to
completely share a same vocabulary. This makes multi-agent communication difficult. In this
paper, we proposed an approach for better multi-agent communication using approximation
technology of semantic terminology across multiple ontolgies. This method uses description logic
language for describing ontological information and perform approximate query across multiple
ontologies. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:8
Main heading:Multi agent systems
Controlled terms:Approximation theory - Computer programming languages - Computer science -
Information technology - Query languages - Semantics - World Wide Web
Uncontrolled terms:Description logic - Multi-agent systems - Multiple ontologies - Ontology
Classification code:716 Telecommunication; Radar, Radio and Television - 721 Computer Circuits
and Logic Elements - 723.1.1 Computer Programming Languages - 723.5 Computer Applications
- 903.2 Information Dissemination - 921.6 Numerical Methods
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 98>
Accession number:2006259955138
Title:A survey of CMM/CMMI implementation in China
Authors:Wu, Zhanchun (1); Christensen, David (3); Li, Mingshu (1); Wang, Qing (1)
Author affiliation:(1) Laboratory for Internet Software Technologies, Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China; (2) Graduate School of Chinese Academy
of Sciences, Beijing 100039, China; (3) One Market Ltd. Co., P.O. Box 58004, Whitby,
Wellington, New Zealand; (4) Key Laboratory for Computer Science, Chinese Academy of
Sciences, Beijing 100080, China
Corresponding author:Wu, Z.
        (wzchun@itechs.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3840 LNCS
Monograph title:Unifying the Software Process Spectrum - International Software Process
Workshop, SPW 2005, Revised Selected Papers
Issue date:2006
Publication year:2006
Pages:507-520
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540311122
ISBN-13:9783540311126
Document type:Conference article (CA)
Conference name:International Software Process Workshop, SPW 2005
Conference date:May 25, 2005 - May 27, 2005
Conference location:Beijing, China
Conference code:67507
Publisher:Springer Verlag
Abstract:Since 1999, the Chinese software industry has been using CMM/CMMI to improve
software process. By November, 2004, more that 180 appraisals have been conducted. But the
number of CMM/CMMI users is fairly low compared to the whole Chinese software industry. In
addition, the growth rate of appraisal numbers has fallen during 2004. Limited research has been
done to find out the obstacles for the wide-usage of CMM/CMMI in China. In this research, by
investigating most of the organizations who have been appraised, reasons, success factors and
benefits of CMM/CMMI implementation are identified, problems which negatively impact the
CMM/CMMI usage are analyzed. Recommendations are made to the Chinese software industry
and government to solve those problems, which could help those who want to or are using
CMM/CMMI. &copy; Springer-Verlag Berlin Heidelberg 2005.
Number of references:17
Main heading:Software engineering
Controlled terms:Computer software - Probabilistic logics - Research and development
management - Societies and institutions - Standards
Uncontrolled terms:Chinese software industry - CMM/CMMI implementation - Software
processes
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.1 Computer Programming - 901.1.1 Societies and Institutions
- 901.3 Engineering Research - 902.2 Codes and Standards - 912.2 Management
Treatment:Theoretical (THR)
DOI:10.1007/11608035_41
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 99>
Accession number:2006069682796
Title:Concurrency control protocol for dynamic priority scheduling in hard real-time databases
Authors:Wang, Hongan (1); Wang, Qiang (1); Wang, Kun (1); Jin, Hong (1); Dai, Guozhong (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China;
(2) Intelligent Engineering Laboratory of ISCAS; (3) IEEE
Corresponding author:Wang, H.
Source title:Chinese Journal of Electronics
Abbreviated source title:Chin J Electron
Volume:15
Issue:1
Issue date:January 2006
Publication year:2006
Pages:6-11
Language:English
ISSN:10224653
CODEN:CHJEEW
Document type:Journal article (JA)
Publisher:Chinese Institute of Electronics
Abstract:Many real-time databases are used to support mission-critical applications, in which
transactions have hard deadlines. The difficulties of providing a guarantee of meeting hard
deadlines lie in the problems of priority inversion and deadlocks. Several priority ceiling protocols
have been proposed to solve these two problems with fixed priority assignment using rate
monotonic algorithm. In this paper, we develop a new concurrency control protocol MV-PL,
which can be applied in dynamic priority scheduling so as to achieve higher processor utilization.
Multiversion mechanism is adopted to increase the degree of concurrency and avoid unnecessary
conflict blockings via dynamic adjustment of serialization order. And more locking conditions are
defined so as to minimize unnecessary ceiling blockings existing in other protocols. It has also
been proven that the new protocol have the single-blocking and deadlock-free properties. The
simulation results show that the new protocol outperforms other protocols in terms of enhancing
the schedulability of hard real-time transactions.
Number of references:12
Main heading:Concurrency control
Controlled terms:Computer system recovery - Database systems - Network protocols - Real time
systems - Scheduling
Uncontrolled terms:Real-time database - Schedulability analysis - Transaction scheduling
Classification code:722.4 Digital Computers and Systems - 723.3 Database Systems - 912.2
Management
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 100>
<RECORD 1>
Accession number:20063710112284
Title:A framework for 3D interaction based on scene semantics
Authors:Ji, Lianen (0); Zhang, Fengjun (0); Wang, Liang (0); Dai, Guozhong (0)
Corr. author affiliation:Intelligence Engineering Laboratory, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and
Computer Graphics
Abbreviated source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao
Volume:18
Issue:8
Issue date:August 2006
Publication year:2006
Pages:1236-1242
Language:Chinese
ISSN:10039775
CODEN:JFTXFX
Document type:Journal article (JA)
Publisher:Institute of Computing Technology, Beijing, China
Abstract:Benefiting from the principles of cognitive psychology in the real world, we combine
visual representation of virtual scene with their semantic information in VEs to support the user's
interaction process. As a result, various types of 3D interaction techniques can be integrated into a
consistent interaction framework, which makes 3D UIs more understandable and usable for users
in complex VEs. By enhancing the semantic-process ability of scene graph, we construct a special
3D interface architecture that supports high-level interaction semantics. Using this architecture,
3D interactive systems can directly implement interaction tasks in geometric level and in semantic
level. A VR application of guidance to touring in Children's Amusement City is presented.
Number of references:13
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 101>
Accession number:20071210494068
Title:A novel synchronization invariant audio watermarking scheme based on DWT and DCT
Authors:Wang, Xiang-Yang (1); Zhao, Hong (1)
Author affiliation:(1) School of Computer and Information Technique, Liaoning Normal
University, Dalian 116029, China; (2) State Key Laboratory of Information Security, Institute of
Software, Chinese Academy of Sciences, Beijing 100039, China
Corresponding author:Wang, X.-Y.
        (wxy37@263.net)

Source title:IEEE Transactions on Signal Processing
Abbreviated source title:IEEE Trans Signal Process
Volume:54
Issue:12
Issue date:December 2006
Publication year:2006
Pages:4835-4840
Language:English
ISSN:1053587X
CODEN:ITPRED
Document type:Journal article (JA)
Publisher:Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Synchronization attack is one of the key issues of digital audio watermarking. In this
correspondence, a blind digital audio watermarking scheme against synchronization attack using
adaptive quantization is proposed. The features of the proposed scheme are as follow s: 1) a kind
of more steady synchronization code and a new embedded strategy are adopted to resist the
synchronization attack more effectively; 2) he niultircsolution characteristics of discrete wavelet
transform (DWT) and the energy-compression characteristics of discrete cosine transform (DCT)
are combined to improve the transparency of digital watermark; 3) the watermark is embedded
into the low frequency components by adaptive quantization according to human auditory
masking; and 4) the scheme can extract the watermark without the help of the original digital
audio signal. Experiment results shows that the proposed watermarking scheme is inaudible and
robust against various signal processing such as noise adding, resampling, requantization, random
cropping, and MPEG-I Layer III (MP3) compression. &copy; 2006 IEEE.
Number of references:13
Main heading:Digital watermarking
Controlled terms:Discrete cosine transforms - Discrete wavelet transforms - Speech intelligibility -
Spurious signal noise - Synchronization
Uncontrolled terms:Adaptive quantization - Audio watermarking - Random cropping
Classification code:716 Telecommunication; Radar, Radio and Television - 723.2 Data Processing
and Image Processing - 751.5 Speech - 921.3 Mathematical Transformations - 961 Systems
Science
Treatment:Theoretical (THR); Experimental (EXP)
DOI:10.1109/TSP.2006.881258
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 102>
Accession number:20063810124338
Title:Study of eGOMS model for pen-based user interface
Authors:Wang, Hui (0); Dai, Guo-Zhong (0)
Corr. author affiliation:Institute of Software, Chinese Academy of Sciences, Beijing 100080,
China
Source title:Xitong Fangzhen Xuebao / Journal of System Simulation
Abbreviated source title:Xitong Fangzhen Xuebao
Volume:18
Issue:SUPPL.
Issue date:August 2006
Publication year:2006
Pages:427-429
Language:Chinese
ISSN:1004731X
CODEN:XFXUFS
Document type:Journal article (JA)
Publisher:Acta Simulata Systematica Sinica, Beijing, China
Abstract:New interaction model is needed for the design of Pen-based User Interface. User Model
based on cognitive psychology is the base of interface design. The purpose of user interface is to
provide a natural, high efficient interactive tool so as to decrease the cognitive distance between
user and computer. The Human Computer Interaction model should be based on human's cognitive
ability. The mechanism and characteristics human perception and cognition, attention and the
process of information processing were studied, and an eGOMS model for Pen-based User
Interface was proposed.
Number of references:5
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 103>
Accession number:20063610099084
Title:Optimizing the parameters for patch-based texture synthesis
Authors:Wang, Yiping (1); Wang, Wencheng (2); Wu, Enhua (2)
Author affiliation:(1) University of Science and Technology of China; (2) Institute of Software,
Chinese Academy of Sciences; (3) University of Macau
Corresponding author:Wang, Y.
       (wangyp@ios.ac.cn)

Source title:Proceedings - VRCIA 2006ACM International Conference on Virtual Reality
Continuum and its Applications
Abbreviated source title:Proc. VRCIA Int. Conf. Virtual Reality Continuum Applic.
Volume:2006
Monograph title:Proceedings - VRCIA 2006: ACM International Conference on Virtual Reality
Continuum and its Applications
Issue date:2006
Publication year:2006
Pages:75-82
Language:English
Document type:Conference article (CA)
Conference name:VRCIA 2006: ACM International Conference on Virtual Reality Continuum and
its Applications
Conference date:June 14, 2006 - June 17, 2006
Conference location:Hong Kong, China
Conference code:68059
Sponsor:ACM SIGGRAPH; Eurographics Association
Publisher:Association for Computing Machinery
Abstract:Patch-based texture synthesis takes patches of sample textures to produce new textures,
and has the fame to run fast and produce textures very efficiently. In its operation, its parameters
for synthesis, including the shape and size of patches and the widths of the overlapping regions
between adjacent patches, have much impact on its synthesis efficiency. However, less discussion
can be found on these impacts, This paper presents novel methods to measure the impacts by these
parameters, and then adaptively optimize these parameters to promote patch-based texture
synthesis. Copyright &copy; 2006 by the Association for Computing Machinery, Inc.
Number of references:20
Main heading:Computational methods
Controlled terms:Adaptive control systems - Optimization - Parameter estimation - Textures
Uncontrolled terms:Adaptive Optimization - Patch-based Texture Synthesis - Texture Features
Classification code:731.1 Control Systems - 921 Mathematics - 921.5 Optimization Techniques -
933 Solid State Physics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 104>
Accession number:20063010022787
Title:High performance SOAP processing driven by data mapping template
Authors:Wei, Jun (1); Hua, Lei (1); Niu, Chunlei (1); Zheng, Haoran (1)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Wei, J.
        (wj@otcaix.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4025 LNCS
Monograph title:Distributed Applications and Interoperable Systems - 6th IFIP WG 6.1
International Conference, DAIS 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:152-168
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540351264
ISBN-13:9783540351269
Document type:Conference article (CA)
Conference name:6th IFIP WG 6.1 International Conference on Distributed Applications and
Interoperable Systems, DAIS 2006
Conference date:June 14, 2006 - June 16, 2006
Conference location:Bologna, Italy
Conference code:67880
Sponsor:University of Bologna, Italy; IFIP WG 6.1
Publisher:Springer Verlag
Abstract:Web Services, with loosely-coupled, high-interoperable and platform-independent
characteristics, is gaining popularity in distributed computing. However, web services suffers
performance penalty because its protocol stack is based on XML. SOAP is used to specify wire
message format in web services, and SOAP processing largely affects the performance of web
services. In this paper, we firstly analyze the performance of web services on Java platform, and
identify that data model mapping between XML data and Java data is the main impact factor on
performance. Therefore, we propose a new scheme of data model mapping "Dynamic Early
Binding" which enables to improve SOAP processing by avoiding Java reflection operations and
proactively generating processing codes. This dynamic early binding is realized by Data Mapping
Template (DMT), which is specified by extended context free grammar and implemented by
pushdown automaton with output. We introduce the technique into our developed SOAP engine -
SOAPExpress. The effectiveness is illustrated by yielding over 100% speedups compared to
Apache Axis 1.2 in our benchmark. &copy; IFIP International Federation for Information
Processing 2006.
Number of references:15
Main heading:Data processing
Controlled terms:Benchmarking - Data structures - Distributed computer systems - Information
retrieval - Information services - Java programming language - World Wide Web - XML
Uncontrolled terms:Data Mapping Template (DMT) - Distributed computing - Java platform -
Web services
Classification code:912 Industrial Engineering and Management - 903.4 Information Services -
903.3 Information Retrieval and Use - 723.2 Data Processing and Image Processing - 723.1.1
Computer Programming Languages - 722.4 Digital Computers and Systems - 716
Telecommunication; Radar, Radio and Television
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 105>
Accession number:20063210049298
Title:An improved poly1305 MAC
Authors:Wang, Dayin (1); Lin, Dongdai (1); Wu, Wenling (1)
Author affiliation:(1) Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Wang, D.
       (wdy@is.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3989 LNCS
Monograph title:Applied Cryptography and Network Security - 4th International Conference,
ACNS 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:284-292
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540347038
ISBN-13:9783540347033
Document type:Conference article (CA)
Conference name:4th International Conference on Applied Cryptography and Network Security,
ACNS 2006
Conference date:June 6, 2006 - June 9, 2006
Conference location:Singapore, Singapore
Conference code:67947
Publisher:Springer Verlag
Abstract:In this paper, we propose an improved Poly1305 MAC, called IPMAC. IPMAC is a
refinement of Poly1305 MAC shown by Bernstein. We use only one 16-byte key and one 16-byte
nonce for IPMAC while Poly1305 MAC uses two 16-byte keys and one 16-byte nonce, 48-byte in
total. The cost of reducing the size of secret keys is almost negligible: only one encryption.
Similarly to Poly1305 MAC, our algorithm correctly and efficiently handles messages of arbitrary
bit length. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:8
Main heading:Public key cryptography
Controlled terms:Algorithms - Computation theory - Computer science - Data storage equipment -
Information theory - Security of data
Uncontrolled terms:16-byte nonce - Arbitrary bit length - Poly1305 MAC - Secret keys
Classification code:716.1 Information Theory and Signal Processing - 721.1 Computer Theory,
Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722.1 Data
Storage, Equipment and Techniques - 723 Computer Software, Data Handling and Applications -
723.2 Data Processing and Image Processing
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 106>
Accession number:20073110737898
Title:Achieving bounded delay on message delivery in publish/subscribe systems
Authors:Wang, Jinling (1); Cao, Jiannong (1); Li, Jing (2); Wu, Jie (3)
Author affiliation:(1) Department of Computing, Hong Kong Polytechnic University; (2) Institute
of Software, Chinese Academy of Sciences, Beijing, China; (3) Department of Computer Science
and Engineering, Florida Atlantic University
Corresponding author:Cao, J.
       (csjcao@comp.polyu.edu.hk)

Source title:Proceedings of the International Conference on Parallel Processing
Abbreviated source title:Proc. Int. Conf. Parallel Process.
Monograph title:ICPP 2006: Proceedings of the 2006 International Conference on Parallel
Processing
Issue date:2006
Publication year:2006
Pages:407-414
Article number:1690644
Language:English
ISSN:01903918
CODEN:PCPADL
ISBN-10:0769526365
ISBN-13:9780769526362
Document type:Conference article (CA)
Conference name:ICPP 2006: 2006 International Conference on Parallel Processing
Conference date:August 14, 2006 - August 18, 2006
Conference location:Columbus, OH, United states
Conference code:69882
Sponsor:International Association for Computers and Communications, IACC; Ohio State
University, USA
Publisher:Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Publish/subscribe (pub/sub) systems are very suitable for the dissemination of dynamic
information over the Internet. As dynamic information is usually characterized by a short lifetime,
both publishers and subscribers may specify the delay requirement on message delivery. Although
existing pub/sub systems can easily be extended so that publishers and subscribers can specify
their delay requirements, it remains a challenging problem to improve the efficiency of pub/sub
systems so that as many messages can be successfully delivered as possible, while the network
traffic does not increase significantly. In this paper, we propose an efficient approach for pub/sub
systems to achieve bounded delay on message delivery. Three message scheduling strategies are
proposed for the system to make use of available bandwidth efficiently. Simulation results show
that our strategies enable subscribers to receive significantly more valid messages than traditional
strategies, while the network traffic just increases slightly. &copy; 2006 IEEE.
Number of references:18
Main heading:Message passing
Controlled terms:Bandwidth - Computer simulation - Information management - Internet -
Scheduling - Telecommunication systems
Uncontrolled terms:Bounded delay - Message delivery - Publish/subscribe systems
Classification code:716 Telecommunication; Radar, Radio and Television - 716.1 Information
Theory and Signal Processing - 723.1 Computer Programming - 723.2 Data Processing and Image
Processing - 723.5 Computer Applications - 912.2 Management
Treatment:Theoretical (THR)
DOI:10.1109/ICPP.2006.16
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 107>
Accession number:20063210058215
Title:A combination framework for semantic based query across multiple ontologies
Authors:Ma, Yinglong (1); Wu, Kehe (1); Jin, Beihong (2); Li, Wei (1)
Author affiliation:(1) School of Computer Sciences and Technology, North China Electric Power
University, Beijing 102206, China; (2) Technology Center of Software Engineering, Institute of
Software, Chinese Academy of Sciences, P.O. Box 8718, Beijing 100080, China
Corresponding author:Ma, Y.
        (m_y_long@otcaix.iscas.ac.cn)
Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4088 LNAI
Monograph title:Agent Computing and Multi-Agent Systems: 9th Pacific Rim International
Workshop on Multi-Agents, PRIMA 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:463-470
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540367071
ISBN-13:9783540367079
Document type:Conference article (CA)
Conference name:9th Pacific Rim International Workshop on Multi-Agents, PRIMA 2006
Conference date:August 7, 2006 - August 8, 2006
Conference location:Guilin, China
Conference code:67976
Publisher:Springer Verlag
Abstract:It is crucial for ontology engineers to compose these heterogeneous ontologies for
effective and scalable interoperability among Web agents. In this paper, we propose a combination
framework based on effective and scalable ontology interoperability for high-quality query
answering. We also put forward a specifical process to substantiate our combination approach. The
underlying theoretical and empirical analyses are exploited for ensuring effectiveness and
correctness of the approach. Experimental results from our prototype system show that
high-quality query results but sacrifice some of reasoning complexity. &copy; Springer-Verlag
Berlin Heidelberg 2006.
Number of references:11
Main heading:Query languages
Controlled terms:Computational complexity - Formal languages - Intelligent agents -
Interoperability - Semantics - World Wide Web
Uncontrolled terms:High-quality query - Ontologies - Query answering - Reasoning complexity
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.1.1 Computer Programming Languages - 723.4 Artificial
Intelligence
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 108>
Accession number:2006129773020
Title:Underlying techniques for large-scale distributed computing oriented publish/subscribe
system
Authors:Ma, Jian-Gang (1); Huang, Tao (1); Wang, Jin-Ling (1); Xu, Gang (1); Ye, Dan (1)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Graduate School, Chinese Academy of Sciences,
Beijing 100049, China
Corresponding author:Ma, J.-G.
       (mjg@otcaix.iscas.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:1
Issue date:January 2006
Publication year:2006
Pages:134-147
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:The publish/subscribe system is adapted to the dynamic large-scale distributed
computing environment well and will be used widely due to its asynchronous, many-to-many and
loosely-coupled communication properties. This paper analyzes the state-of-art of
publish/subscribe systems. Many existing systems are classified according to the criteria, such as
topology structure, event model and subscription model. Then the key techniques, such as
matching algorithm, content-based routing algorithm, formal modeling, quality of service, are
explained. Typical pub/sub prototypes and products are compared, and their shortcomings and
limitations are discussed. The challenge of enhancing the system intelligence by introducing the
event semantic and approximate matching are analyzed, and the trends of supporting the mobile
computing and P2P computing environment is forecasted.
Number of references:51
Main heading:Middleware
Controlled terms:Algorithms - Distributed computer systems - Formal languages - Mathematical
models - Mobile computing - Publishing - Quality of service - Security of data - Semantics -
Topology
Uncontrolled terms:Content based routing - Event models - Event semantics - Large scale
distributed computing - Matching algorithms - P2P computing - Publish subscribe systems
Classification code:716 Telecommunication; Radar, Radio and Television - 721.1 Computer
Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory -
723.1 Computer Programming - 723.2 Data Processing and Image Processing - 903.2 Information
Dissemination - 921 Mathematics
Treatment:Applications (APP); General review (GEN)
DOI:10.1360/jos170134
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 109>
Accession number:20070310361763
Title:Anomaly intrusion detection model based on nonhierarchical clustering
Authors:Su, Pu-Rui (1); Feng, Deng-Guo (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Su, P.-R.
Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica
Abbreviated source title:Tien Tzu Hsueh Pao
Volume:34
Issue:10
Issue date:October 2006
Publication year:2006
Pages:1809-1811
Language:Chinese
ISSN:03722112
CODEN:TTHPAG
Document type:Journal article (JA)
Publisher:Chinese Institute of Electronics, P.O. Box 165, Beijing, 100036, China
Abstract:More and more intruders exploit the vulnerabilities of system and applications to intrude
the system. This paper introduced an anomaly intrusion detection model analyzing processes'
behaviors. It introduces the similarity calculation method based on Vector-space. And it introduces
an argument to value the capabilities of system calls to differentiate the process behaviors.
Thinking of the characters of the abnormalities caused by intrusions, the detection algorithm
adopts the method of locally analyzing.
Number of references:10
Main heading:Error detection
Controlled terms:Algorithms - Computer operating systems - Computer system firewalls -
Security of data - Security systems
Uncontrolled terms:Anomaly detection - Application vulnerability - Detection algorithm - Intruder
- Intrusion detection - Nonhierarchical clustering - Process behavior - Similarity calculation
method - System call capability - System vulnerability - Vector space
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.2 Data Processing and Image Processing - 914.1 Accidents
and Accident Prevention - 921 Mathematics
Treatment:Applications (APP); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 110>
Accession number:2006239925193
Title:Design and implementation of a multi-layered privilege control mechanism
Authors:Shen, Qingni (1); Qing, Sihan (1); Li, Liping (1)
Author affiliation:(1) Engineering and Research Center for Information Security Technology,
Chinese Academy of Sciences, Beijing 100080, China; (2) Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (3) Graduate University, Chinese Academy of
Sciences, Beijing 100049, China
Corresponding author:Shen, Q.
       (sqn@ercist.iscas.ac.cn)

Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development
Abbreviated source title:Jisuanji Yanjiu yu Fazhan
Volume:43
Issue:3
Issue date:March 2006
Publication year:2006
Pages:423-428
Language:Chinese
ISSN:10001239
CODEN:JYYFEY
Document type:Journal article (JA)
Publisher:Science Press
Abstract:As an important component of high-level secure operating systems, the privilege control
mechanism can provide an appropriate level of security assurance for the system. It presents a
multi-layered privilege control mechanism implemented in Ansheng OS V4.0, a copyrighted
security operating system that satisfies all the specified requirements of criteria class 4,
'Structured-Protection', in GB17859-1999 (equally, the B2 level in TCSEC). This mechanism
enforces privilege control and management in the user-level, function-level and program-level of
the system, and it can make the system implementation responsibility separation with roles
defined in the role-based access control policy, dynamic functionality separation with domains
defined in the domain and type enforcement policy, least privilege principle required by the
POSIX standard and therefore ensure the security of the system with the use of privilege in such a
controlled manner.
Number of references:9
Main heading:Security of data
Controlled terms:Computer operating systems - Control theory - Copyrights - Genetic algorithms
Uncontrolled terms:Capability inheritance algorithm - Capability state - Domain - Least privilege -
Privilege control mechanism - Role - Secure operating system - Security architecture - System
implementation responsibility separation
Classification code:723.2 Data Processing and Image Processing - 731.1 Control Systems - 902.3
Legal Aspects - 903 Information Science - 921 Mathematics
Treatment:Applications (APP)
DOI:10.1360/crad20060308
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 111>
Accession number:2006179835398
Title:Cooperative hunting by distributed mobile robots based on local interaction
Authors:Cao, Zhiqiang (1); Tan, Min (1); Li, Lei (2); Gu, Nong (3); Wang, Shou (1)
Author affiliation:(1) Laboratory of Complex Systems and Intelligence Science, Institute of
Automation, Chinese Academy of Sciences, Beijing 100080, China; (2) Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China; (3) School of Engineering and Technology,
Deakin University, Geelong, Vic. 3217, Australia
Corresponding author:Cao, Z.
       (zqcao@compsys.ia.ac.cn)

Source title:IEEE Transactions on Robotics
Abbreviated source title:IEEE Trans. Rob.
Volume:22
Issue:2
Issue date:April 2006
Publication year:2006
Pages:403-407
Language:English
ISSN:15523098
Document type:Journal article (JA)
Publisher:Institute of Electrical and Electronics Engineers Inc.
Abstract:This paper proposes a distributed control approach called local interactions with local
coordinate systems (LILCS) to multirobot hunting tasks in unknown environments, where a team
of mobile robots hunts a target called evader, which will actively try to escape with a safety
strategy. This robust approach can cope with accumulative errors of wheels and imperfect
communication networks. Computer simulations show the validity of the proposed approach.
&copy; 2006 IEEE.
Number of references:14
Main heading:Mobile robots
Controlled terms:Computer simulation - Distributed parameter control systems - Robustness
(control systems) - Telecommunication networks
Uncontrolled terms:Evader - Hunting - Local interaction - Local interactions with local coordinate
systems
Classification code:723.5 Computer Applications - 731.1 Control Systems - 731.5 Robotics
Treatment:Theoretical (THR)
DOI:10.1002/rcm.2272
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 112>
Accession number:20062910010246
Title:Evaluation of project quality: A DEA-based approach
Authors:Zhang, Shen (1); Wang, Yongji (1); Tong, Jie (1); Zhou, Jinhui (1); Ruan, Li (1)
Author affiliation:(1) Laboratory for Internet Software Technologies, Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China; (2) Key Laboratory for Computer Science,
Chinese Academy of Sciences, Beijing 100080, China; (3) Graduate University, Chinese Academy
of Sciences, Beijing 100039, China
Corresponding author:Zhang, S.
       (zhangshen@itechs.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3966 LNCS
Monograph title:Software Process Change - International Software Process Workshop and
International Workshop on Software Process Simulation and Modeling, SPW/ProSim 2006
Issue date:2006
Publication year:2006
Pages:88-96
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540341994
ISBN-13:9783540341994
Document type:Conference article (CA)
Conference name:International Software Process Workshop and International Workshop on
Software Process Simulation and Modeling, SPW/ProSim 2006
Conference date:May 20, 2006 - May 21, 2006
Conference location:Shanghai, China
Conference code:67767
Publisher:Springer Verlag
Abstract:The evaluation of project quality exhibits multivariable, VRS (variable return to scale)
and decision maker's preference properties. In this paper, we present a Data Envelopment Analysis
(DEA) based evaluation approach. The DEA VRS model, which handles multivariable and VRS
effectively, is used to measure project quality. And the DEA cone ratio model, which utilizes
Analytical Hierarchy Process (AHP) to constrain quality metrics with respect to decision maker's
preference, is also adopted to analyze the return to scale of the projects. A case study, which
assesses 10 projects from ITECHS and 20 "Top active" projects on sourceforge.net with the novel
method, is demonstrated. The results indicate that our approach is effective for quality evaluation
and can get accurate estimates of future possible improvements. &copy; Springer-Verlag Berlin
Heidelberg 2006.
Number of references:12
Main heading:Project management
Controlled terms:Computational methods - Computer science - Constraint theory - Data
acquisition - Decision making - Estimation - Hierarchical systems - Mathematical models -
Measurement theory
Uncontrolled terms:Analytical Hierarchy Process (AHP) - Data Envelopment Analysis (DEA) -
Quality metrics - Variable return to scale (VRS)
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.2 Data Processing and Image Processing - 731.1 Control
Systems - 912.2 Management - 921 Mathematics - 922 Statistical Methods
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 113>
Accession number:20063110043209
Title:Research on a definition method of digital forensic requirement
Authors:Sun, Bo (1); Liu, Xin-Ran (1); Sun, Yu-Fang (2)
Author affiliation:(1) National Computer Network Emergency Response Technical
Team/Coordination Center of China, Beijing 100029, China; (2) Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Sun, B.
       (Sunbo@mail.nisac.gov.cn)

Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica
Abbreviated source title:Tien Tzu Hsueh Pao
Volume:34
Issue:5
Issue date:May 2006
Publication year:2006
Pages:921-923
Language:Chinese
ISSN:03722112
CODEN:TTHPAG
Document type:Journal article (JA)
Publisher:Chinese Institute of Electronics
Abstract:How to describe and standardize the digital forensic requirement is an important part in
digital forensic methodology. The paper propose the definition method of digital forensic
requirement and an abstract model, named Environment Request Description (ERD). ERD
definite three methods to describe digital forensic environment and requirement: Components,
Environment Profile and Environment Target. ERD don't depend on a special digital forensic
environment. Customer, developer and others depending on active usage could decide requirement.
It will be useful to definite a forensic requirement in different and complex digital forensic
environment.
Number of references:9
Main heading:Computer crime
Controlled terms:Components - Data acquisition - Digital computers - Laws and legislation -
Mathematical models - Monitoring - Requirements engineering - Video cameras
Uncontrolled terms:Abstract models - Digital forensics - Environment profiles - Environment
request description - Environment targets - Fidelity - Forensic requirements - Validity
Classification code:722.4 Digital Computers and Systems - 723 Computer Software, Data
Handling and Applications - 742.2 Photographic Equipment - 902.3 Legal Aspects - 921
Mathematics
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 114>
Accession number:2006259948898
Title:Pairwise key agreement protocols based on the weil pairing
Authors:Yao, Gang (1); Feng, Deng-Guo (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Yao, G.
        (g.yao@is.iscas.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:4
Issue date:April 2006
Publication year:2006
Pages:907-914
Language:English
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:To achieve security in the networks, it is important to be able to encrypt and authenticate
messages sent between the users. Keys for encryption and authentication purposes must be agreed
upon by the users in the networks. Three new pairwise key agreement protocols based on Weil
pairing are proposed in this paper. In those protocols, all the users share common secret
information. They may arrange the pairwise key and authenticate each other by fewer messages.
The proposed protocols have the security attributes such as known session key security, perfect
forward secrecy, no key-compromise impersonation, no unknown key-share and no key control.
Number of references:9
Main heading:Cryptography
Controlled terms:Data transfer - Internet - Network protocols - Security of data
Uncontrolled terms:Authentication - Key agreement protocols - Key compromise - Key control -
Key share - Secret information - Session key - Weil pairing
Classification code:717 Optical Communication - 723 Computer Software, Data Handling and
Applications
Treatment:Applications (APP)
DOI:10.1360/jos170907
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 115>
Accession number:20082511322267
Title:A channel-state aware scheduling mechanism for wireless local area networks
Authors:Xinyun, Zhou (1); Jianwei, Niu (2); Limin, Sun (1); Lingzhi, Sheng (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Science, Beijing 100080, China;
(2) Beihang University, Beijing 100083, China
Corresponding author:Xinyun, Z.
        (xinyun01@ios.cn)

Source title:IEEE International Symposium on Personal, Indoor and Mobile Radio
Communications, PIMRC
Abbreviated source title:IEEE Int Symp Person Indoor Mobile Radio Commun PIMRC
Monograph title:2006 IEEE 17th International Symposium on Personal, Indoor and Mobile Radio
Communications, PIMRC
Issue date:2006
Publication year:2006
Article number:4022755
Language:English
ISBN-10:1424403294
ISBN-13:9781424403295
Document type:Conference article (CA)
Conference name:2006 IEEE 17th International Symposium on Personal, Indoor and Mobile
Radio Communications, PIMRC
Conference date:September 11, 2006 - September 14, 2006
Conference location:Helsinki, Finland
Conference code:72218
Publisher:Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:In this paper, the influence of wireless channel fading on packet loss and delay for
wireless local area networks is studied in detail. It shows that in CSMA/CA MAC scheme, packets
with bad channel state will engross MAC buffer and deteriorate other downlink flows'
performance. To overcome this problem, a novel channel state aware scheduling algorithm is
presented to reduce the QoS degradation caused by channel fluctuation. It schedules every
downlink flow into separated LLC layer queue firstly. Then, aided by the physical layer
information, SNR, a channel flag based queue selection algorithm is used to isolate traffics with
high PER(packet error rate). Simulation study shows this cross-layer scheme can decrease sending
delay and packet loss for downlink real-time flows, and use wireless link resource more effectively.
&copy; 2006 IEEE.
Number of references:10
Main heading:Local area networks
Controlled terms:Algorithms - Boolean functions - Computer networks - Error analysis -
Evolutionary algorithms - Fading (radio) - Metropolitan area networks - Network protocols -
Packet loss - Packet networks - Scheduling - Scheduling algorithms - Sulfate minerals - Wireless
local area networks (WLAN) - Wireless telecommunication systems
Uncontrolled terms:Channel state (CS) - Cross layer schemes - CSMA/CA - Downlink (DL) -
Downlink flows - International symposium - Marker and cell (MAC) scheme - Mobile radio
communications - Packet Error Rate (PER) - Physical (PHY) layers - Real time flows -
Scheduling mechanisms - Selection algorithm - Simulation studies - wireless channels - Wireless
link - Wireless local area network (wireless LAN)
Classification code:921.6 Numerical Methods - 912.2 Management - 723 Computer Software,
Data Handling and Applications - 721.1 Computer Theory, Includes Formal Logic, Automata
Theory, Switching Theory, Programming Theory - 716.3 Radio Systems and Equipment - 716
Telecommunication; Radar, Radio and Television - 482.2 Minerals
DOI:10.1109/PIMRC.2006.253983
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 116>
Accession number:2006219897357
Title:Real-time 3D fluid simulation on GPU with complex obstacles
Authors:Liu, You-Quan (1); Liu, Xue-Hui (1); Wu, En-Hua (2)
Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China; (2) Department of Computer and Information Science, Faculty
of Science and Technology, University of Macau, Macao, China; (3) Graduate School, Chinese
Academy of Sciences, Beijing 100049, China
Corresponding author:Liu, Y.-Q.
       (lyq@ios.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:3
Issue date:March 2006
Publication year:2006
Pages:568-576
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:This paper, solves the 3D fluid dynamics problem in a complex environment by taking
advantage of the parallelism and programmability of GPU (graphics processing unit). In difference
from other methods, innovation is made in two aspects. Firstly, more general boundary conditions
could be processed on GPU in the method. By the method, the boundary from a 3D scene with
capped solid clipping is generated, making the computation run on GPU despite of the complexity
of the whole geometry scene. Then by grouping the voxels into different types according to their
positions relative to the obstacles and locating the voxel that determines the value of the current
voxel, the values on the boundaries are modified according to the boundary conditions. Secondly,
more compact structure in data packing is designed at the fragment processing level to enhance
parallelism and reduce execution passes. The scalar variables including density and temperature
are packed into four channels of texels to accelerate the computation of 3D Navier-Stokes
Equations. The test results show the efficiency of the method, and as a result, it is feasible to run
middle-scale problems of 3D fluid dynamics in an interactive speed for more general environment
with complex geometry on PC platform.
Number of references:27
Main heading:Graphic methods
Controlled terms:Computer graphics - Data processing - Fluid dynamics - Geometry - Navier
Stokes equations - Partial differential equations - Personal computers
Uncontrolled terms:Coupled map lattice (CML) - Geometry scene - Graphics hardware - Graphics
processing unit (GPU) - Lattice Boltzmann method (LBM) - Programmability - Real time -
Register combiner - Texture shader
Classification code:722.4 Digital Computers and Systems - 723.2 Data Processing and Image
Processing - 723.5 Computer Applications - 921 Mathematics - 931.1 Mechanics
Treatment:Applications (APP)
DOI:10.1360/jos170568
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 117>
Accession number:20070210352390
Title:A verifiable formal specification for RBAC model with constraints of separation of duty
Authors:Yuan, Chunyang (1); He, Yeping (1); He, Jianbo (1); Zhou, Yi (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China;
(2) Graduate School, Chinese Academy of Sciences, Beijing 100049, China
Corresponding author:Yuan, C.
        (chunyang03@ios.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4318 LNCS
Monograph title:Information Security and Cryptology - Second SKLOIS Conference, Inscrypt
2006, Proceedings
Issue date:2006
Publication year:2006
Pages:196-210
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540496084
ISBN-13:9783540496083
Document type:Conference article (CA)
Conference name:2nd SKLOIS Conference on Information Security and Cryptology, Inscrypt
2006
Conference date:November 29, 2006 - December 1, 2006
Conference location:Beijing, China
Conference code:68899
Publisher:Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany
Abstract:Formal method provides a way to achieve an exact and consistent definition of security
for a given scenario. This paper presents a formal state-based verifiable RBAC model described
with Z language, in which the state-transition functions are specified formally. Based on the
separation of duty policy, the constraint rules and security theorems are constructed. Using a case
study, we show how to specify and verify the consistency of formal RBAC system with theorem
proving. By specifying RBAC model formally, it provides a precise description for the system
security requirements. The internal consistency of this model can be validated by verification of
the model. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:18
Main heading:Specifications
Controlled terms:Constraint theory - Formal languages - Mathematical models - Security of data
Uncontrolled terms:Formal specification - RBAC - Separation of duty
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.1.1 Computer Programming Languages - 723.2 Data
Processing and Image Processing - 902.2 Codes and Standards - 921 Mathematics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 118>
Accession number:2006129772978
Title:Multiscale network traffic prediction model based on wavelet
Authors:Hong, Fei (1); Wu, Zhi-Mei (2)
Author affiliation:(1) School of Computer Science, Beihang University, Beijing 100083, China; (2)
Multimedia Communication and Network Research Center, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Hong, F.
       (hongfei@buaa.edu.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:1
Issue date:January 2006
Publication year:2006
Pages:166-170
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:Scaling and multiscale behaviours, such as the long-range dependence, the self-similarity,
and the multi-fractal have been commonly viewed as the most significant characteristics of the
network traffic today. The capacity planning theory for network requires accurate modelling of the
incoming traffic, as well as accurate predictions of its future behaviour. The wavelet-based
approach is a natural way to provide multiscale prediction to applications. With introduction of the
ARIMA linear prediction in the wavelet domain, a novel network traffic prediction model is
presented based on the multi-fractal wavelet model, which is shown to be the accurate model of
the multiscale network traffic. The simulation results with the real traffic traces show the accuracy
and efficiency of the model.
Number of references:16
Main heading:Traffic surveys
Controlled terms:Computer networks - Computer simulation - Forecasting - Fractals - Wavelet
transforms
Uncontrolled terms:ARIMA model - MWM - Network traffic - Prediction - Wavelet
Classification code:432.4 Highway Traffic Control - 716 Telecommunication; Radar, Radio and
Television - 912.2 Management - 921 Mathematics
Treatment:Applications (APP); Theoretical (THR); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 119>
Accession number:2006079699539
Title:Pseudorandomness of Camellia-like scheme
Authors:Wu, Wen-Ling (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) State Key Laboratory of Information Security,
Institute of Software, Chinese Academy of Sciences
Corresponding author:Wu, W.-L.
        (wwl@is.iscas.ac.cn)

Source title:Journal of Computer Science and Technology
Abbreviated source title:J Comput Sci Technol
Volume:21
Issue:1
Issue date:January 2006
Publication year:2006
Pages:82-88
Language:English
ISSN:10009000
CODEN:JCTEEM
Document type:Journal article (JA)
Publisher:Springer New York LLC
Abstract:Luby and Rackoff idealized DES by replacing each round function with one large
random function. In this paper, the author idealizes Camellia by replacing each S-box with one
small random function, which is named Camellia-like scheme. It is then proved that five-round
Camellia-like scheme is pseudorandom and eight-round Camellia-like scheme is
super-pseudorandom for adaptive adversaries. Further the paper considers more efficient
construction of Camellia-like scheme, and discusses how to construct pseudorandom
Camellia-like scheme from less random functions.
Number of references:27
Main heading:Random processes
Controlled terms:Computer science - Function evaluation
Uncontrolled terms:Block cipher - Camellia - Pseudorandomness - Random function -
Super-pseudorandomness
Classification code:721 Computer Circuits and Logic Elements - 921.6 Numerical Methods -
922.1 Probability Theory
Treatment:Theoretical (THR)
DOI:10.1007/s11390-006-0082-0
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 120>
Accession number:20062910010239
Title:Assessing 3-D integrated software development processes: A new benchmark
Authors:Li, Mingshu (1)
Author affiliation:(1) State Key Lab. of Computer Science, Institute of Software, Chinese
Academy of Sciences, No. 4 South Fourth Street, Zhong Guan Cun, Beijing 100080, China
Corresponding author:Li, M.
       (mingshu@iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3966 LNCS
Monograph title:Software Process Change - International Software Process Workshop and
International Workshop on Software Process Simulation and Modeling, SPW/ProSim 2006
Issue date:2006
Publication year:2006
Pages:15-38
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540341994
ISBN-13:9783540341994
Document type:Conference article (CA)
Conference name:International Software Process Workshop and International Workshop on
Software Process Simulation and Modeling, SPW/ProSim 2006
Conference date:May 20, 2006 - May 21, 2006
Conference location:Shanghai, China
Conference code:67767
Publisher:Springer Verlag
Abstract:The increasing complexity and dynamic of software development have become the most
critical challenges for large projects. As one of the new emerged methodologies to these problems,
TRISO-Model uses an integrated three-dimensional structure to classify and organize the essential
elements in software development. In order to simulate and evaluate the modeling ability of
TRISO-Model, a new benchmark is created in this paper, called SPW-2006 Example, by
extending the ISPW-6 Example. It may be used to evaluate other software process models, and/or
to evaluate software organizations, software projects and also software development processes,
particularly 3-D integrated software development processes. With the SPW-2006 Example and its
evolution for quantitative evaluation to 3-D integrated software development processes, a new
approach of TRISO-Model based assessment and improvement is enabled. &copy;
Springer-Verlag Berlin Heidelberg 2006.
Number of references:49
Main heading:Computer aided software engineering
Controlled terms:Benchmarking - Computational complexity - Computer simulation - Computer
software - Mathematical models - Three dimensional computer graphics - User interfaces
Uncontrolled terms:3-D integrated software development - Software organizations - Software
projects - TRISO-Model
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 722.2 Computer Peripheral Equipment - 723.1 Computer
Programming - 723.5 Computer Applications
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 121>
<RECORD 1>
Accession number:20064910289454
Title:Minimizing total weighted completion time on parallel unbounded batch machines
Authors:Li, Shu-Guang (1); Li, Guo-Jun (1); Wang, Xiu-Hong (4)
Author affiliation:(1) School of Mathematics and Systems Science, Shandong University, Ji'nan
250100, China; (2) Department of Mathematics and Information Science, Yantai University,
Yantai 264005, China; (3) Institute of Software, Chinese Academy of Sciences, Beijing 100080,
China; (4) School of Mathematics and Information, Ludong University, Yantai 264025, China
Corresponding author:Li, S.-G.
       (sgliytu@hotmail.com)
Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:10
Issue date:October 2006
Publication year:2006
Pages:2063-2068
Language:English
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:This paper considers the problem of scheduling n jobs on m parallel unbounded batch
machines to minimize the total weighted completion time. Each job is characterized by a positive
weight, a release time and a processing time. Each unbounded batch machine can process up to B
(B&ge;n) jobs as a batch simultaneously. The processing time of a batch is the longest processing
time among jobs in the batch. Jobs processed in the same batch have the same completion time,
i.e., their common starting time plus the processing time of the batch. A polynomial time
approximation scheme (PTAS) for this problem is presented.
Number of references:7
Main heading:Scheduling
Controlled terms:Dynamic programming - Polynomials - Processing
Uncontrolled terms:Batch machines - Parallel unbounded batch machines - Polynomial time
approximation scheme (PTAS) - Release times - Total weighted completion time
Classification code:912.2 Management - 913.4 Manufacturing - 921.1 Algebra - 921.5
Optimization Techniques
Treatment:Applications (APP)
DOI:10.1360/jos172063
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 122>
Accession number:20071810584848
Title:Backtracking algorithms and search heuristics to generate test suites for combinatorial testing
Authors:Yan, Jun (1); Zhang, Jian (1)
Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of
Sciences; (2) Graduate University, Chinese Academy of Sciences
Corresponding author:Yan, J.
       (yanjun@ios.ac.cn)

Source title:Proceedings - International Computer Software and Applications Conference
Abbreviated source title:Proc Int Comput Software Appl Conf
Volume:1
Monograph title:Proceedings - 30th Annual International Computer Software and Applications
Conference, COMPSAC 2006
Issue date:2006
Publication year:2006
Pages:385-392
Article number:4020100
Language:English
ISSN:07303157
CODEN:PSICD2
ISBN-10:0769526551
ISBN-13:9780769526553
Document type:Conference article (CA)
Conference name:30th Annual International Computer Software and Applications Conference,
COMPSAC 2006
Conference date:September 17, 2006 - September 21, 2006
Conference location:Chicago, IL, United states
Conference code:69546
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Combinatorial covering arrays have been used in several testing approaches. This paper
first discusses some existing methods for finding such arrays. Then a SAT-based approach and a
backtracking search algorithm are presented to solve the problem. A novel pruning strategy called
SCEH is proposed to increase the efficiency of the methods. Several existing search heuristics and
symmetry breaking techniques are also used in the backtracking search algorithm. Lastly, this
paper introduces a tool called EXACT (Exhaustive seArch of Combinatorial Test suites) which
implements all the above techniques to construct the covering arrays automatically. The
experimental results show that our backtracking search method outperforms other methods in
many small size cases. &copy; 2006 IEEE.
Number of references:16
Main heading:Heuristic algorithms
Controlled terms:Computer aided software engineering - Problem solving
Uncontrolled terms:Backtracking algorithms - Combinatorial testing - Search algorithm
Classification code:723.1 Computer Programming - 723.4 Artificial Intelligence - 723.5 Computer
Applications
Treatment:Theoretical (THR)
DOI:10.1109/COMPSAC.2006.33
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 123>
Accession number:20070310361762
Title:Framework for implementing dynamically modified least privilege security policy
Authors:Shen, Qing-Ni (1); Qing, Si-Han (1); He, Ye-Ping (2); Li, Li-Ping (2)
Author affiliation:(1) School of Software and Microelectronics, Peking University, Beijing 102600,
China; (2) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Shen, Q.-N.
       (qingnishen@ss.pku.edu.cn)

Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica
Abbreviated source title:Tien Tzu Hsueh Pao
Volume:34
Issue:10
Issue date:October 2006
Publication year:2006
Pages:1803-1808
Language:Chinese
ISSN:03722112
CODEN:TTHPAG
Document type:Journal article (JA)
Publisher:Chinese Institute of Electronics, P.O. Box 165, Beijing, 100036, China
Abstract:Least privilege mechanism can provide a reasonable degree of security assurance for
secure operating systems. This paper described a framework for implementing dynamically
modified least privilege security policy, which combined role's duty separation property and
domain's function separation property. Under the control of its new capability mechanism based
on a process's executable image, current role and current domain, it restricted the process to the
minimum amount of privileges within these contexts. This paper illustrated its implementation in
ANSHENG OS v4.0, a copyrighted secure operating system satisfying all the specified
requirements of Criteria class 4, Structured-Protection, in GB17859-1999 (equally, the B2 level in
TCSEC) in China. Thus it demonstrates that this framework can help enforcing dynamically least
privilege control on a secure operating system, while still providing a flexible efficient system.
Number of references:16
Main heading:Security systems
Controlled terms:Computer operating systems - Dynamic programming - Security of data
Uncontrolled terms:ANSHENG OS - Capability - Criteria class - Domain - Duty separation
property - Efficient system - Function separation property - Least privilege - Role - Secure
operating system - Security assurance - Security policy - Structured Protection
Classification code:723.2 Data Processing and Image Processing - 914.1 Accidents and Accident
Prevention - 921.5 Optimization Techniques
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 124>
Accession number:20064310199171
Title:Visual sampling based clustering algorithm VSC
Authors:Shitong, Wang (1); Chung, F.L. (2); Wei, Guo (1); Bin, Han (1)
Author affiliation:(1) School of Information, Southern Yangtse University, Wu Xi, Jiang Su, China;
(2) Department Computing, Hong Kong Polytechnic University, Hong Kong, Hong Kong; (3)
National Key Laboratory of Computer Science, Institute of Software, CAS SINICA, China
Corresponding author:Shitong, W.
Source title:Information Technology Journal
Abbreviated source title:Inf. Technol. J.
Volume:5
Issue:5
Issue date:September/October 2006
Publication year:2006
Pages:779-791
Language:English
ISSN:18125638
E-ISSN:18125646
Document type:Journal article (JA)
Publisher:Asian Network for Scientific Information
Abstract:This study attempts to achieve two goals: (1) The novel visual sampling based clustering
algorithm VSC is proposed, based on the visual sampling principle. The clustering algorithm VSC
incorporates the visual sampling principle together with the famous Weber law such that it has two
distinctive advantages: (a) it is insensitive to initial conditions and very effective for convex
datasets; (b) the reasonable cluster number can be effectively determined by the new
Weber-law-based clustering validity index. Our experimental results demonstrate its success. (2)
The link relationship between our algorithm VSC and algorithm SCA. Both theoretical analysis
and experimental results show that in many cases, our algorithm VSC here has almost the same
clustering results as algorithm SCA. This fact reveals that our algorithm can be utilized to
overcome the drawback of SCA, i.e., the parameter &gamma; therein is very difficult to be well
determined. &copy; 2006 Asian Network for Scientific Information.
Number of references:16
Main heading:Visual communication
Controlled terms:Algorithms - Data structures - Information analysis - Parameter estimation
Uncontrolled terms:Clustering - Clustering validity index - Fixed points - Visual sampling - Weber
law
Classification code:717.1 Optical Communication Systems - 723 Computer Software, Data
Handling and Applications - 723.2 Data Processing and Image Processing - 731.1 Control Systems
- 903.1 Information Sources and Analysis
Treatment:Theoretical (THR); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 125>
Accession number:20064510226360
Title:Anomaly detection model based on dynamic behavior and character patterns
Authors:Lin, Guo-Yuan (1); Guo, Shan-Qing (1); Huang, Hao (1); Cao, Tian-Jie (2)
Author affiliation:(1) State Key Laboratory for Novel Software Technology, Department of
Computer Science and Technology, Nanjing University, Nanjing 210093, China; (2) School of
Computer, China University of Mining and Technology, Xuzhou 221008, China; (3) State Key
Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing
100080, China
Corresponding author:Lin, G.-Y.
       (lgy8864@163.com)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:9
Issue date:September 2006
Publication year:2006
Pages:1553-1560
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:Differing from existed anomaly detection methods which only dealt with the frequencies
of system calls or local variation, the paper puts forward a model named DBCPIDS. It took in
both dynamic behavior and character patterns of programs. In this model, the authors defined the
short sequence of system calls as a character pattern if this sequence satisfied the certain support
degree, and propose an improved HMM (IHMM) on this basis. When detecting intrusions, firstly,
we would judge whether the program trace is matched character patterns. If not, then the authors
would use IHMM to detect. The model can not only reflect the global character of the program
normal traces, but also pay much attention to the local warp in the execution. The experiments
results show that the authors can get higher detection rate and lower false positive rate with
DBCPIDS.
Number of references:13
Main heading:Inspection
Controlled terms:Computer networks - Dynamic programming - Monitoring - Real time systems -
Security systems
Uncontrolled terms:Anomaly detection - Character pattern - DBCPIDS - Detection rate - Dynamic
behavior - False positive rate - Global character - Improved HMM (IHMM) - Local variation -
Local warp - Subsequence - System call
Classification code:722.4 Digital Computers and Systems - 723 Computer Software, Data
Handling and Applications - 913.3.1 Inspection - 914.1 Accidents and Accident Prevention - 921.5
Optimization Techniques
Treatment:Applications (APP); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 126>
Accession number:20080611078553
Title:MotePlat: A monitoring and control platform for wireless sensor networks
Authors:Sun, Limin (1); Sun, Yuyan (1); Shu, Jian (3); He, Qingwei (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, P.O.Box 8718, Beijing,
100080, China; (2) Graduate University, Chinese Academy of Sciences, No.19-A YuQuan Road,
Beijing, 100049, China; (3) Faculty of Computing, Nanchang Institute of Aeronautical Technology,
696 Fenghe South Road, Nanchang, Jiangxi, 330063, China
Corresponding author:Sun, L.
       (sunlimin@ios.cn)

Source title:Proceedings - Fifth International Conference on Grid and Cooperative Computing,
GCC 2006 - Workshops
Abbreviated source title:Proc.5th Int. Conf.Grid Coop. Comput.
Monograph title:Proceedings - Fifth International Conference on Grid and Cooperative Computing,
GCC 2006 - Workshops
Issue date:2006
Publication year:2006
Pages:452-458
Article number:4031590
Language:English
ISBN-10:0769526950
ISBN-13:9780769526959
Document type:Conference article (CA)
Conference name:5th International Conference on Grid and Cooperative Computing, GCC 2006 -
Workshops
Conference date:October 21, 2006 - October 23, 2006
Conference location:Hunan, China
Conference code:71266
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:With the wide application of wireless sensor networks, the surveillance of wireless sensor
networks itself has drawn more and more attention in recent years. Based on sensor nodes under
TinyOS, we develop a monitoring and control platform called MotePlat<sup>1</sup> to facilitate
our development of WSN application systems. MotePlat employs a three-tier application
framework and adopts an agent mechanism in the software architecture of sensor nodes and sink
nodes. Users can remotely acquire node status information, such as its residual energy, a list of its
neighbor nodes and link quality to each neighbor through this platform. They can also adjust
configuration of sensor nodes, control the network to accomplish various tasks, debug software
modules of sensor nodes and test the network performance. In this paper, we describe some key
technologies in MotePlat including node status information acquisition and network controlling
mechanism, nodes' software architecture, and the workflow in the process of monitoring, control,
debug and test. &copy; 2006 IEEE.
Number of references:12
Main heading:Wireless sensor networks
Controlled terms:Data acquisition - Process control - Program debugging - Software architecture
Uncontrolled terms:Information acquisition - Link quality - Sensor nodes - Sink nodes
Classification code:716.3 Radio Systems and Equipment - 722.3 Data Communication, Equipment
and Techniques - 723.1 Computer Programming - 723.2 Data Processing and Image Processing -
723.5 Computer Applications - 731 Automatic Control Principles and Applications
Treatment:Theoretical (THR)
DOI:10.1109/GCCW.2006.63
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 127>
Accession number:2006189850244
Title:Incomplete exponential sums over Galois rings with applications to some binary sequences
derived from Z<inf>2</inf><sup>l</sup>
Authors:Hu, Honggang (1); Feng, Dengguo (1); Wu, Wenling (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Hu, H.
        (hghu@ustc.edu)

Source title:IEEE Transactions on Information Theory
Abbreviated source title:IEEE Trans. Inf. Theory
Volume:52
Issue:5
Issue date:May 2006
Publication year:2006
Pages:2260-2265
Language:English
ISSN:00189448
CODEN:IETTAW
Document type:Journal article (JA)
Publisher:Institute of Electrical and Electronics Engineers Inc.
Abstract:An upper bound for the incomplete exponential sums over Galois rings is derived
explicitly. Based on the incomplete exponential sums, we analyze the partial period properties of
some binary sequences derived from Z<inf>2l</inf> in detail, such as the Kerdock-code binary
sequences and the highest level sequences of primitive sequences over Z<inf>2l</inf>. The results
show that the partial period distributions and the partial period independent r-pattern distributions
of these binary sequences are asymptotically uniform. Nontrivial upper bounds for the aperiodic
autocorrelation of these sequences are also given. &copy; 2006 IEEE.
Number of references:21
Main heading:Correlation theory
Controlled terms:Binary codes - Binary sequences - Boundary conditions
Uncontrolled terms:Aperiodic correlation - Galois rings - Highest level sequences - Incomplete
exponential sums - Partial period distribution
Classification code:716.1 Information Theory and Signal Processing - 723.1 Computer
Programming - 922.2 Mathematical Statistics
Treatment:Theoretical (THR)
DOI:10.1109/TIT.2006.872850
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 128>
Accession number:20070310373303
Title:Two-handed interaction techniques in desktop VRs
Authors:Zhang, Fengjun (0); Zhang, Chi (0); Wang, Liang (0); Ji, Lianen (0); Fu, Yonggang (0);
Dai, Guozhong (0)
Corresponding author:Zhang, F.
       (zfj@iel.iscas.ac.cn)

Corr. author affiliation:Intelligence Engineering Laboratory, Institute of Software, Chinese Acad.
of Sciences, Beijing 100080, China
Source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and
Computer Graphics
Abbreviated source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao
Volume:18
Issue:11
Issue date:November 2006
Publication year:2006
Pages:1698-1703
Language:Chinese
ISSN:10039775
CODEN:JFTXFX
Document type:Journal article (JA)
Publisher:Institute of Computing Technology, Beijing, China
Abstract:Based on the analysis of main characteristics of common interaction devices, we propose
a series of device combinations for two-handed interaction in desktop VEs, which have the
extensive adaptability and usability for bimanual interaction tasks. According to the requirement
of common interaction task in VEs, and combined with the characteristics of device candidates,
the devices respectively used by dominant hand and nondominant hand can be assigned to
implement different interaction subtask. Through combining various single-handed interaction
techniques, we design three types of two-handed interaction techniques adapted for typical
combinations of desktop interaction devices. Furthermore a toolkit for development of two-handed
interaction technique is building up. Finally, several applications based on these techniques are
demonstrated.
Number of references:14
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 129>
Accession number:20063010021452
Title:Structuralizing digital ink for efficient selection
Authors:Ao, Xiang (1); Li, Junfeng (1); Wang, Xugang (1); Dai, Guozhong (1)
Author affiliation:(1) Intelligence Engineering Lab., Institute of Software, Chinese Academy of
Sciences, P.O.Box 8718, Beijing, China
Corresponding author:Ao, X.
       (ax@iel.iscas.ac.cn)

Source title:International Conference on Intelligent User Interfaces, Proceedings IUI
Abbreviated source title:Int Conf Intell User Interfaces Proc IUI
Volume:2006
Monograph title:IUI 06 - 2006 International Conference on Intelligent User Interfaces
Issue date:2006
Publication year:2006
Pages:148-154
Language:English
ISBN-10:1595932879
ISBN-13:9781595932877
Document type:Conference article (CA)
Conference name:IUI 06 - 2006 International Conference on Intelligent User Interfaces
Conference date:January 29, 2005 - Febrary 1, 2005
Conference location:Sydney, Australia
Conference code:67837
Sponsor:ACM SIGART; ACM SIGCHI
Publisher:Association for Computing Machinery
Abstract:Raw digital ink is informal and unstructured. Its editing, especially its selection, is often
inefficient. In this paper, we present approaches to structuralize raw digital ink as multiple
hierarchies to facilitate its selection. First a link model is built to organize ink as a mesh-like
structure. Based on the link model, the isolated stroke groups form patches. In each patch, textual
and graphical areas are separated. Then, each textual area is segmented into text lines, and each
text line is partitioned to words. We also design gestures for selecting structured ink. Experiments
showed that our ink-structuralizing approaches are effective and selecting structured ink by our
gestures considerably outperforms selecting raw ink. Copyright 2006 ACM.
Number of references:20
Main heading:Ink
Controlled terms:Feature extraction - Gesture recognition - Graph theory - Image segmentation -
Mathematical models - Text processing
Uncontrolled terms:Digital inks - Selection gestures - Structuralizing - Text line extraction -
Text/graph separation
Classification code:716 Telecommunication; Radar, Radio and Television - 723.2 Data Processing
and Image Processing - 723.5 Computer Applications - 741.1 Light/Optics - 804 Chemical
Products Generally - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory
Treatment:Theoretical (THR); Experimental (EXP)
DOI:10.1145/1111449.1111484
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 130>
Accession number:20063210049299
Title:Certificateless public-key signature: Security model and efficient construction
Authors:Zhang, Zhenfeng (1); Wong, Duncan S. (2); Xu, Jing (3); Feng, Dengguo (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Department of Computer Science, City
University of Hong Kong, Hong Kong, Hong Kong; (3) Graduate University of Chinese Academy
of Sciences, Beijing 100039, China
Corresponding author:Zhang, Z.
       (zfzhang@is.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3989 LNCS
Monograph title:Applied Cryptography and Network Security - 4th International Conference,
ACNS 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:293-308
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540347038
ISBN-13:9783540347033
Document type:Conference article (CA)
Conference name:4th International Conference on Applied Cryptography and Network Security,
ACNS 2006
Conference date:June 6, 2006 - June 9, 2006
Conference location:Singapore, Singapore
Conference code:67947
Publisher:Springer Verlag
Abstract:"Certificateless public-key cryptosystem" is a new and attractive paradigm, which avoids
the inherent key escrow property in identity-based public-key cryptosysterns, and does not need
expensive certificates as in the public key infrastructure. A strong security model for certificateless
public key encryption was established by Al-Riyami and Paterson in 2003. In this paper, we first
present a security model for certificateless public-key signature schemes, and then propose an
efficient construction based on bilinear pairings. The security of the proposed scheme can be
proved to be equivalent to the computational Diffie-Hellman problem in the random oracle model
with a tight reduction. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:20
Main heading:Public key cryptography
Controlled terms:Algorithms - Computation theory - Computer science - Information technology -
Mathematical models - Security of data
Uncontrolled terms:Diffie-Hellman problem - Public key encryption - Public-key signature
schemes - Random oracle models
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723 Computer Software, Data Handling and Applications - 723.2
Data Processing and Image Processing - 723.5 Computer Applications - 903 Information Science -
921 Mathematics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 131>
Accession number:20072510660245
Title:A distributed cryptographic computing system
Authors:Jiang, Zhonghua (1); Xu, Lin (1); Lin, Lei (1); Wang, Dayin (1); Lin, Dongdai (1)
Author affiliation:(1) State Key Laboratory Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Jiang, Z.
        (jzh@is.iscas.ac.cn)

Source title:Proceedings - First International Conference on Semantics, Knowledge and Grid,
SKG 2005
Abbreviated source title:Proc. First Int. Conf. Semantics Knowl. Grid
Monograph title:Proceedings - First International Conference on Semantics, Knowledge and Grid,
SKG 2005
Issue date:2006
Publication year:2006
Article number:4125903
Language:English
ISBN-10:0769525342
ISBN-13:9780769525341
Document type:Conference article (CA)
Conference name:1st International Conference on Semantics, Knowledge and Grid, SKG 2005
Conference date:November 27, 2005 - November 29, 2005
Conference location:Beijing, China
Conference code:69776
Sponsor:National Basic Research Program of China; National Science Foundation of China;
Chinese Academy of Sciences; Chinese Academy of Sciences, Institute of Computing Technology;
China Knowledge Grid Research Group
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Traditional cryptographic computing systems are almost designed to solve one kind of
crypto-computation (e.g., RSA576 or ECCp-109). In this paper, we put forward a general-purpose
distributed crypto-computing system. Firstly, the grid based architecture is presented, which
couples multiple computing engines distributed over grid including Crypto++. The computing
process is then introduced. Finally, its implementation and performance evaluation are revealed
under Globus Toolkit 3. &copy; 2006 IEEE.
Number of references:9
Main heading:Public key cryptography
Controlled terms:Computation theory - Computer aided software engineering - Distributed
computer systems - Network architecture - Problem solving
Uncontrolled terms:Crypto-computing system - Globus Toolkit - Performance evaluation
Classification code:716 Telecommunication; Radar, Radio and Television - 721.1 Computer
Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory -
722.4 Digital Computers and Systems - 723.1 Computer Programming - 723.4 Artificial
Intelligence - 723.5 Computer Applications
Treatment:Theoretical (THR)
DOI:10.1109/SKG.2005.5
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 132>
Accession number:20064210172454
Title:A reliable resilient backpropagation method with gradient ascent
Authors:Wang, Xugang (1); Wang, Hongan (1); Dai, Guozhong (1); Tang, Zheng (2)
Author affiliation:(1) Intelligence Engineering Laboratory, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Faculty of Engineering, Toyama University,
Toyama-shi 930-8555, Japan
Corresponding author:Wang, X.
        (wxg@iel.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4114 LNAI - II
Monograph title:Computational Intelligence International Conference on Intelligent Computing,
ICIC 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:236-244
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540372741
ISBN-13:9783540372745
Document type:Conference article (CA)
Conference name:International Conference on Intelligent Computing, ICIC 2006
Conference date:August 16, 2006 - August 19, 2006
Conference location:Kunming, China
Conference code:68291
Publisher:Springer Verlag
Abstract:While the Resilient Backpropagation (RPROP) method can be extremely fast in
converging to a solution, it suffers from the local minima problem. In this paper, a fast and reliable
learning algorithm for multi-layer artificial neural networks is proposed. The learning model has
two phases: the RPROP phase and the gradient ascent phase. The repetition of two phases can help
the network get out of local minima. The proposed algorithm is tested on some benchmark
problems. For all the above problems, the systems are shown to be capable of escaping from the
local minima and converge faster than the Backpropagation with momentum algorithm and the
simulated annealing techniques. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:21
Main heading:Backpropagation
Controlled terms:Learning algorithms - Mathematical models - Neural networks - Problem solving
- Simulated annealing
Uncontrolled terms:Benchmark problems - Gradient ascents - Local minima problems -
Momentum algorithms - Resilient backpropagation
Classification code:723.4 Artificial Intelligence - 921 Mathematics
Treatment:Theoretical (THR); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 133>
Accession number:2006259950442
Title:View-dependent refinement of multiresolution meshes using programmable graphics
hardware
Authors:Ji, Junfeng (1); Wu, Enhua (1); Li, Sheng (1); Liu, Xuehui (1)
Author affiliation:(1) State Key Lab. of Computer Science, Institute of Software, Chinese
Academy of Sciences, Beijing, China; (2) Department of Computer and Information Science,
Faculty of Science and Technology, University of Macau, Macau, China; (3) Graduate University,
Chinese Academy of Sciences, Beijing, China; (4) State Information Center, Beijing, China; (5)
School of Electronics Engineering and Computer Science, Peking University, Beijing, China; (6)
Institute of Software, Chinese Academy of Sciences; (7) University of Macau (UM); (8) Computer
and Information Science Department, UM; (9) IEEE; (10) ACM; (11) Research Department; (12)
HCI, Multimedia Lab., Peking University
Corresponding author:Ji, J.
        (jijfn@cei.gov.cn)

Source title:Visual Computer
Abbreviated source title:Visual Comput
Volume:22
Issue:6
Issue date:June 2006
Publication year:2006
Pages:424-433
Language:English
ISSN:01782789
CODEN:VICOE5
Document type:Journal article (JA)
Publisher:Springer Verlag
Abstract:View-dependent multiresolution rendering places a heavy load on CPU. This paper
presents a new method on view-dependent refinement of multiresolution meshes by using the
computation power of modern programmable graphics hardware (GPU). Two rendering passes
using this method are included. During the first pass, the level of detail selection is performed in
the fragment shaders. The resultant buffer from the first pass is taken as the input texture to the
second rendering pass by vertex texturing, and then the node culling and triangulation can be
performed in the vertex shaders. Our approach can generate adaptive meshes in real-time, and can
be fully implemented on GPU. The method improves the efficiency of mesh simplification, and
significantly alleviates the computing load on CPU.
Number of references:21
Main heading:Computer hardware
Controlled terms:Computer graphics - Program processors - Real time systems - Textures
Uncontrolled terms:Graphics processing unit (GPU) - Level of detail (LOD) - Quadtree - Texture
atlas - View dependent multiresolution rendering
Classification code:722 Computer Systems and Equipment - 722.4 Digital Computers and
Systems - 723.1 Computer Programming - 723.5 Computer Applications
Treatment:Theoretical (THR)
DOI:10.1007/s00371-006-0020-8
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 134>
Accession number:20063010029817
Title:Research on user-centered design and recognition pen gestures
Authors:Tian, Feng (1); Cheng, Tiegang (1); Wang, Hongan (1); Dai, Guozhong (1)
Author affiliation:(1) Intelligence Engineering Laboratory, Institute of Software, Chinese
Academy of Sciences
Corresponding author:Tian, F.
       (tf@iel.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4035 LNCS
Monograph title:Advances in Computer Graphics - 24th Computer Graphics International
Conference, CGI 2006
Issue date:2006
Publication year:2006
Pages:312-323
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:354035638X
ISBN-13:9783540356387
Document type:Conference article (CA)
Conference name:24th Computer Graphics International Conference, CGI 2006
Conference date:June 26, 2006 - June 28, 2006
Conference location:Hangzhou, China
Conference code:67899
Publisher:Springer Verlag
Abstract:Pen-based user interface has become a hot research field in recent years. Pen gesture
plays an important role in Pen-based user interfaces. But it's difficult for UI designers to design,
and for users to learn and use. In this purpose, we performed a research on user-centered design
and recognition pen gestures. We performed a survey of 100 pen gestures in twelve famous
pen-bases systems to find problems of pen gestures currently used. And we conducted a
questionnaire to evaluate the matching degree between commands and pen gestures to discover
the characteristics that a good pen gestures should have. Then cognition theories were applied to
analyze the advantages of those characteristics in helping improving the learnability of pen
gestures. From these, we analyzed the pen gesture recognition effect and presented some
improvements on features selection in recognition algorithm of pen gestures. Finally we used a
couple of psychology experiments to evaluate twelve pen gestures designed based on the research.
It shows those gestures is better for user to learn and use. Research results of this paper can be
used for designer as a primary principle to design pen gestures in pen-based systems. &copy;
Springer-Verlag Berlin Heidelberg 2006.
Number of references:34
Main heading:Gesture recognition
Controlled terms:Computer aided design - Engineering research - Pattern matching - Psychology
computing - Surveying - User interfaces
Uncontrolled terms:Learnability - Pen gestures - Pen-bases systems - Recognition algorithms
Classification code:405.3 Surveying - 722.2 Computer Peripheral Equipment - 723.5 Computer
Applications - 901.3 Engineering Research
Treatment:Theoretical (THR); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 135>
Accession number:20064610244688
Title:The design of an artificial immune system
Authors:Su, Purui (1); Feng, Dengguo (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software Chinese
Academy of Sciences
Corresponding author:Su, P.
       (supurui@is.iscas.ac.cn)

Source title:Proceedings of the International Conference on Networking, International Conference
on Systems andInternational Conference on Mobile Communications and Learning Technologies,
ICN/ICONS/MCL'06
Abbreviated source title:Proc. Int. Conf. Netw. Int. Conf. Syst. Int. Conf. Mobile Com. Learn.
Technol.
Volume:2006
Monograph title:Proceedings of the International Conference on Networking, International
Conference on Systems andInternational Conference on Mobile Communications and Learning
Technologies, ICN/ICONS/MCL'06
Issue date:2006
Publication year:2006
Article number:1628440
Language:English
ISBN-10:0769525520
ISBN-13:9780769525525
Document type:Conference article (CA)
Conference name:International Conference on Networking, International Conference on Systems
andInternational Conference on Mobile Communications and Learning Technologies,
ICN/ICONS/MCL'06
Conference date:April 23, 2006 - April 29, 2006
Conference location:Morne, Mauritius
Conference code:68505
Sponsor:IARIA
Publisher:Institute of Electrical and Electronics Engineers Computer Society
Abstract:Nature immune system is an excellent defense system. Inspired by the two immune
response mechanisms of nature immune system, a new design of an artificial immune system -
COMUS - has been brought forward. COMUS mainly comprises of two parts: PIRM and SIRM. It
could detect both known and unknown intrusions. And it could automatically extract signatures for
the abnormalities which have not been encountered before, and generate scripts to describe the
abnormalities and remember them to response much more quickly next time. COMUS is adaptive
which could automatically update the application's profile to keep up with the changing
environment. And automatically or manually updating the Signature Lib of Abnormal Behaviors
will make COMUS get the ability to identify new attacks. Experiments are performed to evaluate
the system and results are reported. &copy; 2006 IEEE.
Number of references:17
Main heading:Immunology
Controlled terms:Adaptive algorithms - Biomedical engineering - Computer simulation
Uncontrolled terms:Artificial immune system - Immune response - Intrusions
Classification code:461.1 Biomedical Engineering - 461.9.1 Immunology - 723.5 Computer
Applications
Treatment:Theoretical (THR)
DOI:10.1109/ICNICONSMCL.2006.209
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 136>
Accession number:2006259955117
Title:Software testing process automation based on UTP - A case study
Authors:Chen, Wei (1); Ying, Qun (1); Xue, Yunzhi (1); Zhao, Chen (1)
Author affiliation:(1) Laboratory for Internet Software Technologies, Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China; (2) Graduate School, Chinese Academy of
Sciences, Beijing 100039, China
Corresponding author:Chen, W.
        (chenwei@itechs.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3840 LNCS
Monograph title:Unifying the Software Process Spectrum - International Software Process
Workshop, SPW 2005, Revised Selected Papers
Issue date:2006
Publication year:2006
Pages:222-234
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540311122
ISBN-13:9783540311126
Document type:Conference article (CA)
Conference name:International Software Process Workshop, SPW 2005
Conference date:May 25, 2005 - May 27, 2005
Conference location:Beijing, China
Conference code:67507
Publisher:Springer Verlag
Abstract:Automation of software testing process plays an important role in improving software
quality, shortening period of development and reducing development cost, However, most existing
testing automation methods tend to rely on various kinds of limited formal models, and make a
contrived separation between software testing and other phases in software life cycle. This
separation limits wide spread application of these methods, On the other hand, UML, as a unified
modeling language that has been widely employed to describe and model software and software
process, can provide good basis for testing automation to close the separation. In this paper we
introduce an approach that transforms design models represented by UML to testing models
represented by UTP (UML Testing Profile), and further more transforms the testing models to
TTCN-3 (Test and Test Control Notation) test cases that can be executed on a TTCN-3 execution
engine, according to TTCN-3 mapping interface defined in UTP. This approach integrates testing
phase with other phases tightly together, and leads to automation or semi-automation of software
testing process, Finally, the paper demonstrates the effectiveness of the proposed approach by
deriving TTCN-3 test cases for a typical C/S software system. &copy; Springer-Verlag Berlin
Heidelberg 2005.
Number of references:12
Main heading:Automation
Controlled terms:Computer programming languages - Computer simulation - Computer software -
Control systems - Costs - Integration - Mapping - Mathematical transformations - Utility programs
Uncontrolled terms:Software testing process - UML Testing Profile (UTP) - Unified modeling
language
Classification code:921.2 Calculus - 911 Cost and Value Engineering; Industrial Economics -
731.1 Control Systems - 921.3 Mathematical Transformations - 731 Automatic Control Principles
and Applications - 723.1.1 Computer Programming Languages - 723.1 Computer Programming -
723.5 Computer Applications
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 137>
Accession number:20070310373300
Title:Vector field visualization based on texture synthesis
Authors:Lin, Liangliang (0); Yang, Gang (0); Huang, Haoda (0); Liu, Xuehui (0); Wu, Enhua (0)
Corresponding author:Lin, L.
        (lllin@ustc.edu)

Corr. author affiliation:State Key Laboratory of Computer Science, Institute of Software, Chinese
Acad. of Sciences, Beijing 100080, China
Source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and
Computer Graphics
Abbreviated source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao
Volume:18
Issue:11
Issue date:November 2006
Publication year:2006
Pages:1677-1682
Language:Chinese
ISSN:10039775
CODEN:JFTXFX
Document type:Journal article (JA)
Publisher:Institute of Computing Technology, Beijing, China
Abstract:This paper presents a vector field visualization approach based on texture synthesis. The
approach primarily adopts patch-based texture synthesis flow, synthesizing progressively-variant
textures to reflect the diversification trend of vector fields. In the approach, the basic synthesis
patches are divided adaptively into multi-layer, multiform sub-patches to fit the variety of vector
field. In some patches where the inside vector data vary acutely, the pixel-based texture synthesis
is adopted to preserve the smoothness of the synthesis results. Experimental results show that our
method can generate appropriate textures to clearly exhibit the diversifications trend of module
and direction in vector fields, achieving fast and high-qualified vector field visualization.
Number of references:16
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 138>
Accession number:20064210184860
Title:Research on formal security policy model specification and its formal analysis
Authors:Li, Li-Ping (1); Qing, Si-Han (1); Zhou, Zhou-Yi (1); He, Jian-Bo (1); Wen, Hong-Zi (3)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China;
(2) Graduate School, Chinese Academy of Sciences, Beijing 100049, China; (3) Information
Center of State Electricity Regulatory, Beijing 100045, China
Corresponding author:Li, L.-P.
Source title:Tongxin Xuebao/Journal on Communication
Abbreviated source title:Tongxin Xuebao
Volume:27
Issue:6
Issue date:June 2006
Publication year:2006
Pages:94-101
Language:Chinese
ISSN:1000436X
Document type:Journal article (JA)
Publisher:Editorial Board of Journal on Communications
Abstract:Formal method is one of the kernel technologies of developing high security level
computer system. But by current formal development method, assurance of security policy model
correctness cannot be provided directly using machine proof which is stricter than manual proof,
correspondence between security policy model and security functional specification is also hard to
achieve. To solve these problems, a new and effective method was proposed for specification
constructing and proving by extending the specification technique of security functional
specification into the specification of security policy model. Also, BLP model was specified and
analyzed as an example.
Number of references:20
Main heading:Security of data
Controlled terms:Computer systems - Formal logic - Theorem proving
Uncontrolled terms:Bell LaPadula model - Formal analysis - Formal specification - Security
policy model - Theorem prove
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.2 Data Processing and Image Processing
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 139>
Accession number:20062810000564
Title:A vickrey-type multi-attribute auction model
Authors:Chen, Xiang (1); Hu, Shan-Li (1)
Author affiliation:(1) Department of Computer Science and Techonoly, Fuzhou University,
Fuzhou, 350002, China; (2) Laboratory of Computer Science, Institute of Software, Chinese
Academy of Sciences, Bejing 100080, China
Corresponding author:Chen, X.
        (angus_cx@yahoo.com.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3930 LNAI
Monograph title:Advances in Machine Learning and Cybernetics - 4th International Conference,
ICMLC 2005, Revised Selected Papers
Issue date:2006
Publication year:2006
Pages:21-29
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540335846
ISBN-13:9783540335849
Document type:Conference article (CA)
Conference name:4th International Conference on Machine Learning and Cybernetics, ICMLC
2005
Conference date:August 18, 2005 - August 21, 2005
Conference location:Guangzhou, China
Conference code:67728
Sponsor:IEEE; Hong Kong Polytechnic University; Hebei University; International University in
Germany; Harbin Institute of Technology
Publisher:Springer Verlag
Abstract:Internet auction is not only an integral part of Electronic Commerce but is also becoming
a promising field for applying autonomous agents and multi-agent system (MAS) technologies.
And auction, as an efficient resource allocation method, has an important role in MAS problems
and as such is receiving increasing attention from scholars. This paper suggests a protocol (VAMA)
and strategies for multi-attribute auction. Some useful properties such as strategy-proof are also
proven. This paper also includes an analysis of the strategy of the buyer, and gives a decentralized
mechanism for VAMA implementation as well as discussing some questions about VAMA. Finally,
this protocol is compared with existing ones, improving on the work of Esther David etc. &copy;
Springer-Verlag Berlin Heidelberg 2006.
Number of references:11
Main heading:Internet
Controlled terms:Electronic commerce - Mathematical models - Multi agent systems - Network
protocols - Problem solving - Resource allocation
Uncontrolled terms:Decentralized mechanism - Multi-attribute auction - Strategy-proof
Classification code:723 Computer Software, Data Handling and Applications - 723.4 Artificial
Intelligence - 723.5 Computer Applications - 912.2 Management - 921 Mathematics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 140>
Accession number:20064910289467
Title:Fast selecting visible surfaces in high precision
Authors:Wei, Feng (1); Wang, Wen-Cheng (1); Wu, En-Hua (1)
Author affiliation:(1) Key Laboratory of Computer Science, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Graduate School, Chinese Academy of Sciences,
Beijing 100049, China; (3) Department of Computer and Information Science, Faculty of Science
and Technology, University of Macau, Macao, China
Corresponding author:Wei, F.
        (weif@ios.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:10
Issue date:October 2006
Publication year:2006
Pages:2199-2210
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:It is very important to efficiently select visible surfaces in rendering complex scenes. As
for this, a method is presented in this paper by combining the strategies for image-based selection
and object-based selection. First, it classifies the surfaces by their normals, and manages every
class of surfaces in hierarchical indexing structures by their positions in 3D space. Then, the
visible surfaces are pixel-driven searched from near to far. As the index structures can manage the
surfaces orderly, this search can be calculated quickly and all visible surfaces can be obtained.
Meanwhile, the selected visible surfaces can be fused automatically to act as the occluders to
implicitly cull the occluded surfaces in large quantities. Compared with existing methods for
selecting visible surfaces, the new method is fast and in high precision, and can conveniently
handle the scenes with dynamic objects.
Number of references:22
Main heading:Visibility
Controlled terms:Selection - Surfaces - Virtual reality
Uncontrolled terms:Complex scenes - Dynamic objects - Fast - High precision - Index structures -
Visible surfaces
Classification code:723 Computer Software, Data Handling and Applications - 741.2 Vision - 931
Classical Physics; Quantum Theory; Relativity
Treatment:Applications (APP); Experimental (EXP)
DOI:10.1360/jos172199
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 141>
Accession number:20070610415132
Title:Binary mixtures simulation based on Lattice Boltzmann method
Authors:Zhu, Hong-Bin (1); Liu, Xue-Hui (1); Liu, You-Quan (4); Wu, En-Hua (1)
Author affiliation:(1) State Key Laboratory of Computer Science, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Department of Computer and Information
Science, Faculty of Science and Technology, University of Macau, Macau, China; (3) Graduate
University, Chinese Academy of Sciences, Beijing 100039, China; (4) Ageia Technologies Inc.,
Beijing 100091, China
Corresponding author:Zhu, H.-B.
        (zhuhb@ios.ac.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:12
Issue date:December 2006
Publication year:2006
Pages:2071-2079
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press, 18,Shuangqing Street,Haidian, Beijing, 100085, China
Abstract:The fluids with different properties are mixed together to form a multi-component fluid
system. It is a normal and interesting phenomenon in nature. The main visual effects root in the
diffusing process (such as dissolving phenomenon) and the demixing process (cooking oil1 floats
on the surface of the water) of the mixture. However, because of the complex microscopic
interaction between the mixture components, the simulation of the multi-component fluid is still a
very challenging mission, and few relative works has been reported at present in the graphics
literature. In this paper, the authors introduce a Lattice Boltzmann Model (LBM) to simulate
binary mixtures. Different from other similar models, the viscid and diffusing properties of the
fluid are considered separately, and this makes it so easy to simulate the miscible or immiscible
two fluids system within one framework. In addition, the operation of LBM is mostly linear local
computation, which can be easily speeded up on Graphics Processing Unit (GPU) in order to make
real-time simulation. The several experimental results of binary mixtures are presented in the
paper.
Number of references:29
Main heading:Computer graphics
Controlled terms:Animation - Binary mixtures - Diffusion - Flow of fluids - Image processing -
Partial differential equations - Simulation - Three dimensional computer graphics - Virtual reality -
Viscosity
Uncontrolled terms:Challenging mission - Demixing process - Diffusing process - Dissolving
phenomenon - Fluids system - Graphics literature - Graphics processing unit (GPU) - Lattice
Boltzmann model (LBM) - Linear local computation - Microscopic interaction - Mixture
component - Multicomponent fluid flow - Real time simulation - Visual effect - Water surface
Classification code:723.2 Data Processing and Image Processing - 723.5 Computer Applications -
921.2 Calculus
Treatment:Applications (APP); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 142>
<RECORD 1>
Accession number:2006119760977
Title:Visibility determination for rendering large scale scenes
Authors:Wang, Wencheng (0); Wei, Feng (0); Wu, Enhua (0)
Corr. author affiliation:Laboratory of Computer Science, Institute of Software, Chinese Academy
of Sciences, Beijing 100080, China
Source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and
Computer Graphics
Abbreviated source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao
Volume:18
Issue:2
Issue date:February 2006
Publication year:2006
Pages:161-169
Language:Chinese
ISSN:10039775
CODEN:JFTXFX
Document type:Journal article (JA)
Publisher:Institute of Computing Technology, Beijing, China
Abstract:Efficient visibility determination can greatly save computation on the invisible parts.
Various visibility determination methods are systematically introduced. In addition to basic
methods, the efficient techniques and systems for fulfilling visibility determination and developing
its applications are surveyed.
Number of references:52
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 143>
Accession number:20064210182263
Title:On the expected value of the joint 2-adic complexity of periodic binary multisequences
Authors:Hu, Honggang (1); Hu, Lei (2); Feng, Dengguo (1)
Author affiliation:(1) State Key Lab. of Information Security (Institute of Software, Chinese
Academy of Sciences), Beijing, 100080, China; (2) State Key Lab. of Information Security
(Graduate School of Chinese Academy of Sciences), Beijing, 100049, China
Corresponding author:Hu, H.
       (hghu@ustc.edu)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4086 LNCS
Monograph title:Sequences and Their Applications, SETA 2006 - 4th International Conference,
Proceedings
Issue date:2006
Publication year:2006
Pages:199-208
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540445234
ISBN-13:9783540445234
Document type:Conference article (CA)
Conference name:4th International Conference on Sequences and Their Applications, SETA 2006
Conference date:September 24, 2006 - September 28, 2006
Conference location:Beijing, China
Conference code:68303
Publisher:Springer Verlag
Abstract:Recently people show some interest in the word-based stream ciphers. The theory of such
stream ciphers requires the study of the complexity of multisequences. The 2-adic complexity is
the FCSR analog of the linear complexity, and it is very useful in the study of the security of
stream ciphers. The improved version of 2-adic complexity - the symmetric 2-adic complexity was
presented in 2004 which is a better measure for the cryptographic strength of binary sequences. In
this paper, we derive the expected value of the joint 2-adic complexity of periodic binary
multisequences. A nontrivial lower bound for the expected value of the joint symmetric 2-adic
complexity of periodic binary multisequences is also given. &copy; Springer-Verlag Berlin
Heidelberg 2006.
Number of references:13
Main heading:Computational complexity
Controlled terms:Binary sequences - Linear systems
Uncontrolled terms:2-adic complexity - Binary multisequences - Stream ciphers
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 731.1 Control Systems
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 144>
Accession number:20063110043198
Title:Research on network collaboration based on HLA ownership and Agent multicast
Authors:Wang, Hong-Bing (1); Fan, Zhi-Hua (1); She, Chun-Dong (1)
Author affiliation:(1) General Software Laboratory, Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China
Corresponding author:Wang, H.-B.
       (wawahohobibi@163.com)

Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica
Abbreviated source title:Tien Tzu Hsueh Pao
Volume:34
Issue:5
Issue date:May 2006
Publication year:2006
Pages:867-873
Language:Chinese
ISSN:03722112
CODEN:TTHPAG
Document type:Journal article (JA)
Publisher:Chinese Institute of Electronics
Abstract:A network collaboration framework based on High Level Architecture and Multi Agent
System is introduced in this paper. Some required properties about network collaboration are
presented. A network collaboration model and its algorithm HOAM are proposed based on HLA
ownership and agent multicast. The shortage of being not satisfied with message causal order in
the current implementation RTI of HLA is solved. Causality constraint supported by HOAM
algorithm is proved. A comparative analysis is made in terms of the performance of HOAM and
LICRA algorithm. It shows that HOAM, as a simple pessimistic algorithm, has the approximate
same performance with LICRA, as a complex optimistic algorithm.
Number of references:15
Main heading:Computer supported cooperative work
Controlled terms:Algorithms - Architecture - Computer networks - Constraint theory -
Mathematical models - Multi agent systems - Multicasting
Uncontrolled terms:Agent multicast - Causality constraints - Complex optimistic algorithms -
High level architecture - Message causal orders - Network collaboration - Object consistency -
Simple pessimistic algorithms
Classification code:921 Mathematics - 731.1 Control Systems - 723.5 Computer Applications -
722 Computer Systems and Equipment - 721.1 Computer Theory, Includes Formal Logic,
Automata Theory, Switching Theory, Programming Theory - 717 Optical Communication - 716
Telecommunication; Radar, Radio and Television
Treatment:Applications (APP); Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 145>
Accession number:20062910005592
Title:#3-regular bipartite planar vertex cover is #P-complete
Authors:Xia, Mingji (1); Zhao, Wenbo (2)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, P.O. Box 8717, Beijing
100080, China; (2) Graduate University, Chinese Academy of Sciences, Beijing, China
Corresponding author:Xia, M.
        (xmj@gcl.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3959 LNCS
Monograph title:Theory and Applications of Models of Computation - Third International
Conference, TAMC 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:356-364
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540340211
ISBN-13:9783540340218
Document type:Conference article (CA)
Conference name:3rd International Conference on Theory and Applications of Models of
Computation, TAMC 2006
Conference date:May 15, 2006 - May 20, 2006
Conference location:Beijing, China
Conference code:67762
Sponsor:National Natural Sciences Foundation of China; Chinese Academy of Sciences, Institute
of Software, China
Publisher:Springer Verlag
Abstract:We generalize the polynomial interpolation method by giving a sufficient condition,
which guarantees that the coefficients of a polynomial are uniquely determined by its values on a
recurrence sequence. Using this method, we show that #3-Regular Bipartite Planar Vertex Cover is
#P-complete. The result is unexpected, since the same question for 2-regular graph is in FP. &copy;
Springer-Verlag Berlin Heidelberg 2006.
Number of references:7
Main heading:Polynomials
Controlled terms:Computation theory - Graph theory - Interpolation - Mathematical models
Uncontrolled terms:Bipartite planar vertex - Polynomial interpolation
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 921.1 Algebra - 921.4 Combinatorial Mathematics, Includes
Graph Theory, Set Theory - 921.6 Numerical Methods
Treatment:Theoretical (THR)
DOI:10.1007/11750321_34
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 146>
Accession number:20082811358945
Title:Optimal design of AQM routers with D-stable regions based on ITAE performance
Authors:Wang, Xiuli (1); Wang, Yongji (1); Zhou, Hui (1)
Author affiliation:(1) Laboratory for Internet Software Technologies, Institute of Software,
Chinese Academy of Sciences, P. O. Box 8718, Beijing 100080, China; (2) Graduate University,
Chinese Academy of Sciences, Beijing 100039, China; (3) Key Laboratory for Computer Science,
Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Wang, X.
       (wxl@itechs.iscas.ac.cn)

Source title:HUT-ICCE 2006 First International Conference on Communications and Electronics,
Proceedings
Abbreviated source title:HUT-ICCE Int. Conf. Commun. Electron. Proc.
Volume:PART 1
Monograph title:HUT-ICCE 2006 1st International Conference on Communications and
Electronics, Proceedings
Issue date:2006
Publication year:2006
Pages:78-83
Article number:4156502
Language:English
ISBN-10:1424405688
ISBN-13:9781424405688
Document type:Conference article (CA)
Conference name:HUT-ICCE 2006 1st International Conference on Communications and
Electronics
Conference date:October 10, 2006 - October 11, 2006
Conference location:Hanoi, Viet nam
Conference code:72413
Sponsor:Institute of Electrical and Electronics Engineers (IEEE); Institute of Electronics
Engineers of Korea (IEEK); Inst. Electron. Inf. Commun. Eng. Japan (IEICE); EMT; DAAD
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:This paper applies a novel optimization method for Proportional-Integral- Differential
(PID) controller design with D-stable regions based on Integral of Time-weighted Absolute Error
(ITAE) performance to Active Queue Management (AQM) routers that permits the designer to
control the desired dynamic performance of a closed-loop system. A set of desired D-stable
regions in the complex plane is first specified and then a numerical optimization algorithm based
on ITAE performance is run to find the controller parameters such that all the roots of the
closed-loop system are within the specified regions. This controller for AQM routers can detect
and control the congestion effectively and predictively. Compared with the Random Early
Detection (RED) and Proportional-Integral (PI) algorithms via experimental simulations in
Network Simulator Version 2 (NS2), the proposed method, called DITAE-PID method, is indeed
more efficient and robust in achieving the smaller queuing delay and higher throughput of an
AQM router. &copy; 2006 IEEE.
Number of references:20
Main heading:Routing algorithms
Controlled terms:Congestion control (communication) - Farm buildings - Integral equations -
Optimization - Proportional control systems - Queueing networks - Routers - Two term control
systems
Uncontrolled terms:absolute errors - Active queue management (AQM) routers - Closed-loop
systems - Complex planes - Controller parameters - dynamic performances - Experimental
simulations - international conferences - Network simulator version 2 (Ns-2) - Numerical
optimizations - Optimal designs - Optimization methods - PID method - Proportional integral
(PI) - Proportional integral differential (PID) controllers - Queuing delays - Random Early
Detection (RED)
Classification code:402.1 Industrial and Agricultural Buildings - 716 Telecommunication; Radar,
Radio and Television - 723 Computer Software, Data Handling and Applications - 731.1 Control
Systems - 921.2 Calculus - 921.5 Optimization Techniques
DOI:10.1109/CCE.2006.350851
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 147>
Accession number:2006129772964
Title:Model merging based approach for modeling the CMM implementation process
Authors:Li, Juan (1); Yuan, Feng (1); Li, Ming-Shu (1); Wang, Qing (1)
Author affiliation:(1) Laboratory for Internet Software Technologies, Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China; (2) Graduate School, Chinese Academy of
Sciences, Beijing 100039, China; (3) Laboratory of Computer Science, Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Li, J.
       (lijuan@itechs.iscas.ac.cn)
Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:1
Issue date:January 2006
Publication year:2006
Pages:54-65
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:As a widely used software process improvement model, CMM (Capability Maturity
Model) provides a guide for choosing process improvement strategies by facilitating the
identification of current process capabilities. However, how to model the CMM implementation
process remains an open issue for a fact that enterprise software processes are complex and
variable. This paper presents an approach for modeling the CMM implementation process based
on model merging mechanism. Using SPEM (Software Process Engineering Metamodel), CPM
(CMM Process Model) and EPM (Enterprise Process Model) can be built and then merged to
achieve CIPM (CMM Implementation Process Model). Also when EPM is changed, the changed
content can be reflected conveniently in CIPM using the model merging mechanism. In above
model merging approach, process models are described with the labeled directed graph and
merging algorithms are proposed. Authors prove model merging consistency and use a process
model merging prototype tool to show that the proposed approach is practical and effective.
Number of references:13
Main heading:Merging
Controlled terms:Mathematical models - Process engineering - Software engineering
Uncontrolled terms:Capability Maturity Model(CMM) - Directed graph - Enterprise process
model (EPM) - Model merging - Software process modeling
Classification code:723.1 Computer Programming - 913.1 Production Engineering - 921
Mathematics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 148>
Accession number:20062910004864
Title:A multimodal fusion framework for children's storytelling systems
Authors:Wang, Danli (1); Zhang, Jie (1); Dai, Guozhong (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Science, Beijing 100080, China
Corresponding author:Wang, D.
        (danli@ios.cn)
Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3942 LNCS
Monograph title:Technologies for E-Learning and Digital Entertainment - First International
Conference, Edutainment 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:585-588
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540334238
ISBN-13:9783540334231
Document type:Conference article (CA)
Conference name:1st International Conference on Technologies for E-Learning and Digital
Entertainment, Edutainment 2006
Conference date:April 16, 2006 - April 19, 2006
Conference location:Hangzhou, China
Conference code:67734
Sponsor:Zhejiang University, China; VR Committee of the China Society of Image and Graphics
Publisher:Springer Verlag
Abstract:Storytelling by a child, as a training activity, influences significantly a child's linguistic
abilities, logic and thought process, imagination, and creativity, There presently exist many
software-based Storytelling applications, However, most, are deemed incompatible or not suitable
to Chinese children. Due to the limited vocabulary of pre-school and lower-level grade school
children, speech-based and pen-based input models are considered the most effective way of input.
But now there is not an effective multimodal mode to solve the problem for children's Storytelling
systems. In this paper, we propose a multimodal fusion framework that utilizes pen and speech
techniques to incorporate both context information and linguistic attributes of the Chinese
language into the design. Based on the proposed framework, we formulated specific methods of
integration, and developed a prototype for our proposed system. &copy; Springer-Verlag Berlin
Heidelberg 2006.
Number of references:10
Main heading:Information dissemination
Controlled terms:Computer software - Integration - Learning systems - Linguistics - Multimedia
systems - Software prototyping - Speech recognition - Students
Uncontrolled terms:Linguistic abilities - Multimodal fusion framework - Multimodal mode -
Storytelling systems
Classification code:921.2 Calculus - 903.2 Information Dissemination - 901.2 Education - 751.5
Speech - 723.5 Computer Applications - 723.1 Computer Programming - 461.4 Ergonomics and
Human Factors Engineering
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 149>
Accession number:2006219897359
Title:Uniprocessor static priority scheduling with limited priority levels
Authors:Wang, Bao-Jin (1); Li, Ming-Shu (2); Wang, Zhi-Gang (1)
Author affiliation:(1) Institute of Information and Engineering, PLA Information and Engineering
University, Zhengzhou 450002, China; (2) Laboratory for Internet Software Technologies,
Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Wang, B.-J.
        (baojin_wang@itechs.iscas.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:3
Issue date:March 2006
Publication year:2006
Pages:602-610
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:In practice, the schedulability of static priority scheduling may be reduced when priority
levels of the system are insufficient. If a task set requires more priority levels than the system can
support, several tasks must be assigned the same priority level. This causes the priority mapping
problem. To solve it, a priority mapping algorithm and necessary and sufficient conditions for
analyzing the schedulability of a task after priority mapping are needed. There are three kinds of
priority mapping algorithms: decreasing priority assignment algorithm, increasing priority
assignment algorithm, and threshold segment mapping algorithm. This paper presents
implementation and analyzing conditions of algorithms. Properties of the algorithms are also
described and showed. Performance of the algorithms is compared through simulations.
Simulation results and conclusions are useful for designing and implementing real-time embedded
systems.
Number of references:11
Main heading:Scheduling
Controlled terms:Algorithms - Embedded systems - Mapping
Uncontrolled terms:Decreasing priority assignment (DPA) algorithm - Increasing priority
assignment (IPA) algorithm - Limited priority levels - Preemption threshold - Priority mapping -
Rate monotonic (RM) - Real time - Static priority scheduling - Threshold segment mapping (TSM)
algorithm
Classification code:723 Computer Software, Data Handling and Applications - 902.1 Engineering
Graphics - 912.2 Management - 921 Mathematics
Treatment:Applications (APP)
DOI:10.1360/jos170602
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 150>
Accession number:20062910010259
Title:A Process-Agent construction method for software process modeling in SoftPM
Authors:Wang, Qing (1); Xiao, Junchao (1); Li, Mingshu (1); Nisar, M. Wasif (1); Yuan, Rong (1);
Zhang, Lei (1)
Author affiliation:(1) Laboratory for Internet Software Technologies, Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China; (2) Graduate University, Chinese Academy
of Sciences, Beijing 100039, China; (3) Key Laboratory for Computer Science, Chinese Academy
of Sciences, Beijing 100080, China
Corresponding author:Wang, Q.
        (wq@itechs.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3966 LNCS
Monograph title:Software Process Change - International Software Process Workshop and
International Workshop on Software Process Simulation and Modeling, SPW/ProSim 2006
Issue date:2006
Publication year:2006
Pages:204-213
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540341994
ISBN-13:9783540341994
Document type:Conference article (CA)
Conference name:International Software Process Workshop and International Workshop on
Software Process Simulation and Modeling, SPW/ProSim 2006
Conference date:May 20, 2006 - May 21, 2006
Conference location:Shanghai, China
Conference code:67767
Publisher:Springer Verlag
Abstract:Software development, unlike manufacturing industry, is highly dependent on the
capabilities of individual software engineers and software development teams. SEI presents PSP
and TSP to establish personal and team capabilities in the software process, to maintain them and
assist organizations in conducting CMMI-Based process improvement. Thus, executors'
capabilities should be taken into account as a key issue of the software process modeling method.
ISCAS conducts research on Organization-Entities capabilities- based software process modeling
and presents a corresponding method. The Organization-Entities have definite capabilities and are
called Process-Agents. The modeling method applies Agent technology to organize the basic
process units and to establish the project process system self-adaptively according to the special
project goal and constraining environment. In this paper, we present the method for constructing
the Process-Agent. Each Process-Agent is comprised of two parts: Firstly, the infrastructure to
describe Process-Agent's knowledge, and secondly the engine driven by external environment,
used for reasoning Process-Agent's behavior based on its knowledge. &copy; Springer-Verlag
Berlin Heidelberg 2006.
Number of references:14
Main heading:Software engineering
Controlled terms:Behavioral research - Computational methods - Computer science - Knowledge
engineering - Mathematical models - Personnel - Project management - Research - Societies and
institutions
Uncontrolled terms:Agent technology - Organization-Entities - Software process - Team
capabilities
Classification code:921 Mathematics - 912.4 Personnel - 912.2 Management - 901.3 Engineering
Research - 901.1.1 Societies and Institutions - 723.4 Artificial Intelligence - 723.1 Computer
Programming - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 461.4 Ergonomics and Human Factors Engineering
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 151>
Accession number:20062910014124
Title:Toward a unified implementation for dynamic programming
Authors:Zheng, Yujun (1); Shi, Haihe (1); Xue, Jinyun (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Zheng, Y.
        (ucheng@yahoo.com.cn)

Source title:High Technology Letters
Abbreviated source title:High Technol Letters
Volume:12
Issue:SUPPL.
Issue date:May 2006
Publication year:2006
Pages:34-39
Language:English
ISSN:10066748
CODEN:HTLEFC
Document type:Journal article (JA)
Publisher:Inst. of Scientific and Technical Information of China
Abstract:Dynamic programming(DP) was widely used for optimization problems, but its
implementation varied from problem to problem. Based on formal methods and generic types, a
unified approach of DP algorithms derivation and programs generation was proposed. At the first
stage, two formal algorithms were derived from DP problem specifications, and then they are
transformed into generic programs using partition-and-recur(PAR). By binding generic types to
constructed ones and passing anonymous methods to delegates, concrete programs for a variety of
DP problems could be directly generated. Case studies of these three typical DP programs were
presented to illustrate the approach.
Number of references:14
Main heading:Dynamic programming
Controlled terms:Algorithms - Operations research - Optimization
Uncontrolled terms:Formal methods - Generic type - Loop invariant - Partition and recur
Classification code:723 Computer Software, Data Handling and Applications - 912.3 Operations
Research - 921.5 Optimization Techniques
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 152>
Accession number:20064910289460
Title:Research on measurement of peer-to-peer file sharing system
Authors:Liu, Qiong (1); Xu, Peng (1); Yang, Hai-Tao (1); Peng, Yun (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Liu, Q.
       (liuqiong@ios.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:10
Issue date:October 2006
Publication year:2006
Pages:2131-2140
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:With the progress of peer-to-peer (P2P) technology, the Internet applications model is in
a great reformation. In order to get an all-win solution among the Internet users, Internet service
providers and content providers, it is necessary to measure and analyze the P2P applications from
their perspectives. In this paper, the content of P2P measurement is introduced firstly, and then the
existing research on P2P measurement is classified into 3 areas: topology measurement, traffic
measurement and availability measurement. After comparing between measurement methods, the
comprehensive survey on P2P measurement is given, and then the existing measurements and
their results are analyzed in depth, furthermore, the shortcomings and problems are outlined. In
the end, the future trend of the P2P measurement is discussed.
Number of references:31
Main heading:Internet
Controlled terms:Availability - Measurements - Quality of service - Topology
Uncontrolled terms:Availability measurement - Network measurement - Peer to peer (P2P)
network - Topology measurement - Traffic measurement
Classification code:717 Optical Communication - 913.5 Maintenance - 921.4 Combinatorial
Mathematics, Includes Graph Theory, Set Theory
Treatment:Applications (APP)
DOI:10.1360/jos172131
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 153>
Accession number:20064910294959
Title:Compositional verification for workflow nets
Authors:Li, Jiao (1); Cheung, To-Yat (2)
Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of
Sciences, P. O. Box 8718, Beijing 100080, China; (2) Department of Computer Science, City
University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong
Corresponding author:Li, J.
       (ljiao@ios.ac.cn)

Source title:Journal of Circuits, Systems and Computers
Abbreviated source title:J. Circuits Syst. Comput.
Volume:15
Issue:4
Issue date:August 2006
Publication year:2006
Pages:551-570
Language:English
ISSN:02181266
CODEN:JCSME7
Document type:Journal article (JA)
Publisher:World Scientific Publishing Co. Pte Ltd
Abstract:A workflow is the automation of business processes that describe activities in a business
context. Petri nets have been widely used as a workflow modeling technique. Workflow nets
(WF-nets), introduced by van der Aalst [LNCS 1248 (1997) 407-426], are a class of Petri nets
tailored towards workflow analysis. Soundness is used as the least correctness criterion for
WF-nets in order to ensure that a process can terminate properly. This paper extends WF-nets by
considering resources and allowing for multi-cases in a process. For the extended model, the
relationship between soundness and standard behavior properties of Petri nets is investigated. A
compositional method to construct and verify sound WF-nets is introduced. &copy; World
Scientific Publishing Company.
Number of references:14
Main heading:Petri nets
Controlled terms:Composition - Computational methods - Error correction - Industrial
management - Job analysis - Office automation
Uncontrolled terms:Business processes - Compositional verification - Soundness - Workflow nets
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.5 Computer Applications - 912 Industrial Engineering and
Management - 912.2 Management - 921.4 Combinatorial Mathematics, Includes Graph Theory,
Set Theory
Treatment:Theoretical (THR)
DOI:10.1142/S0218126606003167
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 154>
Accession number:20062910013940
Title:Implementation and performance analysis of a new MPI Allgather algorithm on terascale
linux clusters
Authors:Chen, Jing (1); Zhang, Yun-Quan (2); Zhang, Lin-Bo (4); Yuan, Wei (2)
Author affiliation:(1) Department of Computer Science, University of Science and Technology of
China, Hefei 230026, China; (2) Laboratory of Parallel Computing, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (3) State Key Laboratory of Computer Science,
Chinese Academy of Sciences, Beijing 100080, China; (4) Academy of Mathematics and Systems
Sciences, Chinese Academy of Sciences, Beijing 100080, China; (5) State Key Laboratory of
Scientific and Engineering Computing, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Chen, J.
        (jingchen@mail.rdcps.ac.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:5
Issue date:May 2006
Publication year:2006
Pages:808-814
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:Message passing interface (MPI) is one of the most important parallel programming
environment. The MPI library provides point-to-point and collective communication functions,
among which MPI Allgather is one of the most frequently used functions. Three kinds of
algorithm are implemented for MPI Allgather in the latest versions of MPICH, i.e., the ring, the
recursive doubling and the Bruck algorithms. In order to minimize the TCP traffic and congestion
over fast ethernet, the authors propose a new MPI Allgather algorithm, namely the neighbor
exchange. In the neighbor exchange algorithm, a property of pair-wise communication is
incorporated and a process always exchanges data with its logical neighbor processes. A concept,
the average logical communication distance (ALCD), is proposed to measure the algorithmic
communication locality. Analysis on the ALCD for the four algorithms reveals that the neighbor
exchange and the ring algorithms have the best communication locality property among the four
MPI Allgather algorithms. Numerical experiments on terascale Linux clusters DeepComp 6800
and DAWNING 4000A show that the neighbor exchange algorithm performs the best for long
messages but is suboptimal for short and medium sized ones. For medium-size messages, the ring
algorithm performs the best and for short messages, the recursive doubling algorithm performs the
best.
Number of references:6
Main heading:Interfaces (computer)
Controlled terms:Algorithms - Communication - Congestion control (communication) -
Evaluation - Parallel processing systems
Uncontrolled terms:Cluster - Collective communication - Message passing interface Allgather
algorithm - Performance evaluation
Classification code:716.1 Information Theory and Signal Processing - 722.2 Computer Peripheral
Equipment - 722.4 Digital Computers and Systems - 921.6 Numerical Methods
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 155>
Accession number:20083611506631
Title:Supporting ad-hoc collaboration with group-based RBAC model
Authors:Li, Qi (1); Zhang, Xinwen (2); Qing, Sihan (1); Xu, Mingwei (3)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China;
(2) Department of Information and Software Engineering, George Mason University, Fairfax, VA
22030, United States; (3) Department of Computer Science, Tsinghua University, Beijing 100084,
China
Corresponding author:Li, Q.
        (liqi01@tsinghua.org.cn)

Source title:2006 International Conference on Collaborative Computing: Networking,
Applications and Worksharing, CollaborateCom
Abbreviated source title:Int. Conf. Collab.Comput.: Netw., Appl. Worksharing, CollaborateCom
Monograph title:2006 International Conference on Collaborative Computing: Networking,
Applications and Worksharing, CollaborateCom
Issue date:2006
Publication year:2006
Article number:4207559
Language:English
Document type:Conference article (CA)
Conference name:2006 International Conference on Collaborative Computing: Networking,
Applications and Worksharing, CollaborateCom
Conference date:November 17, 2006 - November 20, 2006
Conference location:Atlanta, GA, United states
Conference code:73122
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:With the increasing accessibility of information and data, Role-Based Access
Control(RBAC) has become a popular technique for security and privacy purposes. However,
trusted collaboration between different groups in large corporate Intranets is still an unresolved
problem. The challenge is how to extend existing access control model for efficient security
management and administration to allow trusted collaboration between different groups. In this
paper, we propose a group-based RBAC model (GB-RBAC) for this purpose. In particular, virtual
group is proposed in our model to allow secure information and resource sharing in multi-group
collaboration environments. All the members of a virtual group build trust relation between
themselves and are authorized to join the collaborative work. The scheme and strategies provided
in this paper meet the requirements of security, autonomy, and privacy for collaborations. As a
result, our scheme provides an easy way to employ RBAC policies to secure ad-hoc collaboration.
&copy; 2006 IEEE.
Number of references:8
Main heading:Access control
Controlled terms:Ad hoc networks - Computer supported cooperative work - Industrial
management - Security of data - Security systems
Uncontrolled terms:Access control models - Ad-hoc collaboration - Collaborative works - Group
collaboration - Group-based - International conferences - RBAC models - Resource sharing -
Role-based Access Control - Security and privacy - Security management - Virtual groups -
Work-sharing
Classification code:722.3 Data Communication, Equipment and Techniques - 723 Computer
Software, Data Handling and Applications - 723.2 Data Processing and Image Processing - 723.5
Computer Applications - 912.2 Management - 914.1 Accidents and Accident Prevention
DOI:10.1109/COLCOM.2006.361887
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 156>
Accession number:20081011131648
Title:A perceptual sensitivity based redundant slices coding scheme for error-resilient transmission
H.264/AVC video
Authors:Xu, Jin (1); Wu, Zhimei (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, 100080, China
Corresponding author:Xu, J.
        (xujin@iscas.ac.cn)
Source title:2006 International Conference on Communications, Circuits and Systems, ICCCAS,
Proceedings
Abbreviated source title:ICCCAS Int. Conf. Commun. Circuits Sys.
Volume:1
Monograph title:2006 International Conference on Communications, Circuits and Systems,
ICCCAS, Proceedings - Signal Processing
Issue date:2006
Publication year:2006
Pages:139-142
Article number:4063848
Language:English
ISBN-10:0780395840
ISBN-13:9780780395848
Document type:Conference article (CA)
Conference name:2006 International Conference on Communications, Circuits and Systems,
ICCCAS
Conference date:June 25, 2006 - June 28, 2006
Conference location:Guilin, China
Conference code:71454
Sponsor:Hong Kong University of Science and Technology (HKUST); University of Electronic
Science and Technology of China (UESTC); The City University of Hong Kong; Guilin
University of Electronic Technology (GUET); National Natural Science Foundation of China
(NSFC)
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:In this paper, redundant slices feature of the H.264/AVC codec is evaluated. In order to
trade off compression efficiency and error robustness of a H.264/AVC codec with redundant slice
capability, we propose a novel perceptual sensitivity based redundant slices coding scheme. The
perceptually sensitive regions are determined by using a simple yet effective perceptual sensitivity
analysis technique, which analyzes both the motion and the texture structures in the original video
sequence. The experimental results show that our proposed algorithm can remarkably improve the
reconstructed video quality in the packet lossy network. &copy; 2006 IEEE.
Number of references:7
Main heading:Image coding
Controlled terms:Error analysis - Image communication systems - Image compression - Image
quality - Motion estimation - Sensitivity analysis - Video signal processing
Uncontrolled terms:Compression efficiency - Perceptual sensitivity - Video quality
Classification code:716.1 Information Theory and Signal Processing - 716.4 Television Systems
and Equipment - 741 Light, Optics and Optical Devices - 921.6 Numerical Methods
Treatment:Theoretical (THR)
DOI:10.1109/ICCCAS.2006.284604
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 157>
Accession number:2006249938956
Title:Multivariate Fourier transform methods over simplex and super-simplex domains
Authors:Sun, Jiachang (0)
Corresponding author:Sun, J.
Corr. author affiliation:Institute of Software, Chinese Academy of Sciences, Beijing 100080,
China
Source title:Journal of Computational Mathematics
Abbreviated source title:J Comput Math
Volume:24
Issue:3
Issue date:May 2006
Publication year:2006
Pages:305-322
Language:English
ISSN:02549409
CODEN:JCMMEB
Document type:Journal article (JA)
Publisher:Inst. of Computational Mathematics and Sc./Eng. Computing, Beijing, China
Abstract:In this paper, we propose the well-known Fourier method on some non-tensor product
domains in R<sup>d</sup> including simplex and so-called super-simplex which consists of (d +
1)! simplices. As two examples, in 2-D and 3-D case a super-simplex is shown as a parallel
hexagon and a parallel quadrilateral dodecahedron, respectively. We have extended most of
concepts and results of the traditional Fourier methods on multivariate cases, such as Fourier basis
system, Fourier series, discrete Fourier transform (DFT) and its fast algorithm (FFT) on the
super-simplex, as well as generalized sine and cosine transforms (DST, DCT) and related fast
algorithms over a simplex. The relationship between the basic orthogonal system and
eigen-functions of a Laplacian-like operator over these domains is explored.
Number of references:14
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 158>
Accession number:20072610672100
Title:An adaptive caching mechanism for Web services
Authors:Li, Lei (1); Niu, Chunlei (2); Zheng, Haoran (2); Wei, Jun (2)
Author affiliation:(1) Department of Computer Science, University of Science and Technology of
China; (2) Institute of Software, Chinese Academy of Sciences
Corresponding author:Li, L.
       (lilei@otcaix.iscas.ac.cn)

Source title:Proceedings - International Conference on Quality Software
Abbreviated source title:Proc. Int. Conf. Qual. Softw.
Monograph title:Proceedings - Sixth International Conference on Quality Software, QSIC 2006
Issue date:2006
Publication year:2006
Pages:303-310
Article number:4032299
Language:English
ISSN:15506002
ISBN-10:0769527183
ISBN-13:9780769527185
Document type:Conference article (CA)
Conference name:6th International Conference on Quality Software, QSIC 2006
Conference date:October 27, 2006 - October 28, 2006
Conference location:Beijing, China
Conference code:69805
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Web services, with an emphasis on open standards and flexibility, can provide benefits
over existing capital markets integration practices. However, Web services must first meet certain
technical requirements including performance, security and so on. SOAP, based on Extensible
Markup Language (XML), inherits not only the advantages of XML, but its relatively poor
performance. This makes SOAP a poor choice for many high-performance applications. Cache is
effective approach for improving the round-trip time for request-response exchanges. At present,
there are lots of researches on server side cache implementation for Web Services have been
presented, however, each of these studies has its own limitations and no one is the best in all
situations. Focusing on these issues, this paper proposed a novel adaptive cache mechanism,
which can choose an optimized cache implementation dynamically in the runtime. Moreover, this
paper presented a fine-grained cache approach to obtain the further performance gain and design a
cache key associated method to decrease the usage of memory. Through our experiments in this
paper, we observed that our approach obtained a huge performance gain by incorporating the
adaptive cache mechanism into the SOAP engine. &copy; 2006 IEEE.
Number of references:23
Main heading:Web services
Controlled terms:Adaptive systems - Security of data - XML
Uncontrolled terms:Adaptive caching mechanism - High performance applications - Round trip
time
Classification code:723 Computer Software, Data Handling and Applications - 723.2 Data
Processing and Image Processing - 723.4 Artificial Intelligence
Treatment:Theoretical (THR)
DOI:10.1109/QSIC.2006.9
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 159>
Accession number:2006259948875
Title:Interaction-centered hierarchical post-WIMP user interface model
Authors:Qin, Yan-Yan (1); Tian, Feng (1); Wang, Xiao-Chun (1); Dai, Guo-Zhong (1)
Author affiliation:(1) Laboratory of Human-Computer Interaction and Intelligent Information
Processing, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Qin, Y.-Y.
        (yanyan02@iscas.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:4
Issue date:April 2006
Publication year:2006
Pages:691-702
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:Following the great improvement in interaction devices and software technologies, lots
of novel interaction technologies which are based on Post-WIMP user interface are studied. It is
crucial that the designer chooses the interaction component or the interaction technology properly
and efficiently to adapt to the various interaction devices and environments in the user interface
designing. According to the analysis of the interaction process and the design level of the
Post-WIMP user interface, an interaction-Centered Hierarchical Post-WIMP User Interface Model
is presented. It is described and analyzed from the aspects of the user, task, device, behaviors and
entity in interaction. Moreover, a Post-WIMP user interface auto-generate tool is designed and
implemented based on the model, to help the designers to insert those novel interaction
technologies into the system flexibly, and to develop and evaluate the prototype quickly and
efficiently. Experiments show that, the model can guide the process of user interface design, the
implement of prototype, and the evaluation of the result of design.
Number of references:22
Main heading:Human computer interaction
Controlled terms:Computer hardware - Evaluation - User interfaces - XML
Uncontrolled terms:Binding/lexical level - Conceptual level - Functional/semantic level -
Hierarchical model - Interaction centered - Interaction devices - Interaction technology -
Post-WIMP user interface - Prototype - Sequencing/syntactical level - Software technologies -
User interface (UI) design
Classification code:722 Computer Systems and Equipment - 723 Computer Software, Data
Handling and Applications
Treatment:Applications (APP)
DOI:10.1360/jos170691
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 160>
Accession number:20065010297320
Title:Program verification through computer algebra
Authors:Zhou, Chaochen (1)
Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of
Sciences, Beijing, China
Corresponding author:Zhou, C.
        (zcc@ios.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4260 LNCS
Monograph title:Formal Methods and Software Engineering - 8th International Conference on
Formal Engineering Methods, ICFEM 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:1
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540474609
ISBN-13:9783540474609
Document type:Journal article (JA)
Conference name:8th International Conference on Formal Engineering Methods, ICFEM 2006
Conference date:November 1, 2006 - November 3, 2006
Conference location:Macao, China
Conference code:68725
Publisher:Springer Verlag
Abstract:This is to advocate the approach to reducing program verification to the algebraic
symbolic computation. Recent advances indicate that various verification problems can be reduced
to semi-algebraic systems (SAS for short), and resolved through computer algebra tools. In this
talk, we report our encouraging attempts at applying DISCOVERER to program termination
analysis and state reachability computation. DISCOVERER is a Maple program implementing an
algorithm of real solution classification and isolation for SAS, which is based on the discovery of
complete discrimination systems of parametric polynomials. The talk also concludes that this
approach deserves further attention from the program verification community. For theoretical and
technical details of the work, we refer the reader to [1,2,3,4,5]. &copy; Springer-Verlag Berlin
Heidelberg 2006.
Number of references:5
Main heading:Digital arithmetic
Controlled terms:Algorithms - Computer programming - Parameter estimation - Polynomials -
Problem solving
Uncontrolled terms:Computer algebra tools - Program verification community - Real solution
classification - State reachability computation
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.1 Computer Programming - 723.4 Artificial Intelligence -
731.1 Control Systems - 921.1 Algebra - 921.6 Numerical Methods
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 161>
Accession number:20064110165684
Title:A PDCA-based software process control and improvement model
Authors:Wu, Zhan-Chun (1); Wang, Qing (1); Li, Ming-Shu (1)
Author affiliation:(1) Laboratory for Internet Software Technologies, Institute of Software, The
Chinese Academy of Sciences, Beijing 100080, China; (2) Graduate School, The Chinese
Academy of Sciences, Beijing 100049, China; (3) Laboratory for Computer Science, Institute of
Software, The Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Wu, Z.-C.
        (wzchun@itechs.iscas.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:8
Issue date:August 2006
Publication year:2006
Pages:1669-1680
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:CMM/CMMI (capability maturity model/CMM integration) has been accepted since
1999 by Chinese software organizations, and widely used since then. But there are limited number
of CMM/CMMI users in China. By launching a survey, problems of using CMM/CMMI are
identified, and the negative impact is analyzed. Based on the analysis, a PDCA
(plan-do-check-action)-based software process control and improvement model is presented, and
the SoftPM which is based on the model has been developed. The SoftPM has been widely used in
China, which proves the effectiveness of the model to solve the problems identified in the survey.
Software process effectiveness and efficiency are also improved for those software organizations
that are using or will use CMM/CMMI.
Number of references:21
Main heading:Computer software
Controlled terms:Algorithms - Architecture - Mathematical models - Measurements - Process
control - Project management - Quality assurance
Uncontrolled terms:Capability maturity models - CMM integration - Plan do check action -
Software process improvement - Software quality assurance - Software quality management
Classification code:723 Computer Software, Data Handling and Applications - 731 Automatic
Control Principles and Applications - 912.2 Management - 913.3 Quality Assurance and Control -
921 Mathematics
Treatment:Applications (APP); General review (GEN); Theoretical (THR)
DOI:10.1360/jos171669
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 162>
Accession number:20064210172475
Title:Semantic based approximate query across multiple ontologies
Authors:Ma, Yinglong (1); Jin, Beihong (2)
Author affiliation:(1) School of Computer Sciences and Technology, North China Electric Power
University, Beijing 102206, China; (2) Technology Center of Software Engineering, Institute of
Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Ma, Y.
        (m_y_long@otcaix.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4114 LNAI - II
Monograph title:Computational Intelligence International Conference on Intelligent Computing,
ICIC 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:431-437
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540372741
ISBN-13:9783540372745
Document type:Conference article (CA)
Conference name:International Conference on Intelligent Computing, ICIC 2006
Conference date:August 16, 2006 - August 19, 2006
Conference location:Kunming, China
Conference code:68291
Publisher:Springer Verlag
Abstract:In this paper, we propose an approach for better ontology interoperability using
approximation technology of semantic terminology across multiple ontolgies. We use description
logic language for describing ontological information and perform approximate query across
multiple ontologies. Meanwhile, we discuss system implementation, and provided some
experimental results for evaluating the method. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:12
Main heading:Semantics
Controlled terms:Approximation theory - Computer programming languages - Formal logic -
Interoperability - Terminology
Uncontrolled terms:Approximate query - Logic language - Multiple ontologies - Ontological
information
Classification code:716 Telecommunication; Radar, Radio and Television - 721.1 Computer
Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory -
723.1.1 Computer Programming Languages - 902.2 Codes and Standards - 903.2 Information
Dissemination - 921.6 Numerical Methods
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 163>
Accession number:20062910005610
Title:Towards practical computable functions on context-free languages
Authors:Chen, Haiming (1); Dong, Yunmei (1)
Author affiliation:(1) Computer Science Laboratory, Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China
Corresponding author:Chen, H.
        (chm@ios.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3959 LNCS
Monograph title:Theory and Applications of Models of Computation - Third International
Conference, TAMC 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:555-565
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540340211
ISBN-13:9783540340218
Document type:Conference article (CA)
Conference name:3rd International Conference on Theory and Applications of Models of
Computation, TAMC 2006
Conference date:May 15, 2006 - May 20, 2006
Conference location:Beijing, China
Conference code:67762
Sponsor:National Natural Sciences Foundation of China; Chinese Academy of Sciences, Institute
of Software, China
Publisher:Springer Verlag
Abstract:Many structures used in computer science and software can be represented by
context-free languages. This paper discusses computable functions on such languages, which give
a useful model for studies of computability and algorithms involving complex data structures. This
paper further tackles some practical issues for using the functions. Some practical schemes of the
functions are presented. A subclass of functions is provided, which can be implemented efficiently.
&copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:21
Main heading:Context free languages
Controlled terms:Algorithms - Computational complexity - Computer science - Data processing -
Data structures - Functions - Software engineering
Uncontrolled terms:Computability - Computable functions - Subclass
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.1.1 Computer Programming Languages - 723.2 Data
Processing and Image Processing - 921 Mathematics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 164>
Accession number:20070210351654
Title:Design of a micro-kernel based secure system architecture
Authors:Shen, Jianjun (1); Qing, Sihan (1); Shen, Qingni (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences
Corresponding author:Shen, J.
       (weishen_cu@yahoo.com.cn)

Source title:Proceedings of the 2006 IEEE Workshop on Information Assurance
Abbreviated source title:Proc. IEEE Workshop Info. Assurance
Volume:2006
Monograph title:Proceedings of the 2006 IEEE Workshop on Information Assurance
Issue date:2006
Publication year:2006
Pages:384-385
Article number:1652123
Language:English
ISBN-10:1424401305
ISBN-13:9781424401307
Document type:Conference article (CA)
Conference name:2006 IEEE Workshop on Information Assurance
Conference date:June 21, 2006 - June 23, 2006
Conference location:West Point, NY, United states
Conference code:68874
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:We describe the Trium secure system architecture. It is based on Fiasco - an
implementation of the L4 microkernel interface - and L4Env - a programming environment for L4
systems. Compared to previous work on microkernel based secure systems, such as TMach and
DTOS, Trium tries to minimize the trusted computing base (TCB) of a secure system by moving
most functions of an operating system (OS) out of the TCB, and it emphasizes on the reuse of
legacy software. We also try to achieve better isolation, privilege control and flexible
configuration of system components, taking advantage of the specific features of the L4
microkernel as a second generation microkernel. &copy; 2006 IEEE.
Number of references:4
Main heading:Systems analysis
Controlled terms:Computer architecture - Computer operating systems - Computer programming -
Computer software - Interfaces (computer) - Security of data
Uncontrolled terms:Microkernels - System components - Trusted computing base (TCB)
Classification code:722 Computer Systems and Equipment - 722.2 Computer Peripheral
Equipment - 723.1 Computer Programming - 723.2 Data Processing and Image Processing - 912.3
Operations Research
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 165>
Accession number:20070110348711
Title:DWT-domain blind watermark detection based on weak signal detection theory
Authors:Sun, Zhongwei (1); Feng, Dengguo (2); Wu, Chuankun (2)
Author affiliation:(1) Department of Information Engineering, North China Electric Power
University, Beijing 102206, China; (2) State Key Laboratory of Information Security, Institute of
Software, Chinese Acad. of Sci., Beijing 100080, China
Corresponding author:Sun, Z.
       (sunzwcn@yahoo.com.cn)

Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development
Abbreviated source title:Jisuanji Yanjiu yu Fazhan
Volume:43
Issue:11
Issue date:November 2006
Publication year:2006
Pages:1920-1926
Language:Chinese
ISSN:10001239
CODEN:JYYFEY
Document type:Journal article (JA)
Publisher:Science Press, 18,Shuangqing Street,Haidian, Beijing, 100085, China
Abstract:The performance of a watermarking scheme relies heavily on the design of the detector.
However, most of watermark detection algorithms in the literature are neither with strong
theoretical grounds, nor are they optimum. Proposed in this paper is a new discrete wavelet
transform (DWT) domain watermark detection scheme, with the theory of weak signal detection
in non-Gaussian noise as its theoretical grounds. Special attention is paid to the case where
embedding strength parameter of the watermark signal is not known at the detection stage. First,
generalized Gaussian distribution (GGD) is chosen to statistically model the wavelet coefficients
of the detailed sub-bands data. Then, the model of deterministic signal detection with unknown
parameters is utilized to formulate the watermark detection. As a result, an asymptotically optimal
detector is constructed. The performance analysis of the new detector shows that it can achieve the
constant false alarm rate property. The theoretical analysis is validated through experimental
results. And the superiority of the novel detector over conventional detection methods is also
confirmed.
Number of references:15
Main heading:Digital watermarking
Controlled terms:Algorithms - Copyrights - Cryptography - Data privacy - Mathematical
transformations - Security of data - Signal detection - Signal processing - Wavelet transforms
Uncontrolled terms:Blind watermark detection - Constant false alarm rate - Detection stage -
Detector design - Discrete wavelet transform (DWT) - Generalized Gaussian distribution - Non
Gaussian noise - Performance analysis - Sub bands data - Theoretical analysis - Theoretical
grounds - Watermark detection algorithm - Watermark signal - Watermarking scheme - Wavelet
coefficients - Weak signal detection
Classification code:716.1 Information Theory and Signal Processing - 723.2 Data Processing and
Image Processing - 903 Information Science - 921.3 Mathematical Transformations
Treatment:Applications (APP); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 166>
Accession number:2006179841571
Title:View dependent sequential point trees
Authors:Wang, Wen-Cheng (1); Wei, Feng (1); Wu, En-Hua (1)
Author affiliation:(1) State Key Lab. of Computer Science, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Department of Computer and Information
Science, Faculty of Science and Technology, University of Macau, China; (3) Graduate University,
Chinese Academy of Sciences, Beijing 100039, China; (4) Laboratory of Computer Science,
Institute of Software, CAS; (5) Institute of Software, Chinese Academy of Sciences; (6) Institute
of Software, CAS; (7) University of Macau; (8) Computer and Information Science Department,
UM; (9) IEEE; (10) ACM
Corresponding author:Wang, W.-C.
        (whn@ios.ac.cn)
Source title:Journal of Computer Science and Technology
Abbreviated source title:J Comput Sci Technol
Volume:21
Issue:2
Issue date:March 2006
Publication year:2006
Pages:181-188
Language:English
ISSN:10009000
CODEN:JCTEEM
Document type:Journal article (JA)
Publisher:Springer New York LLC
Abstract:Sequential point trees provide the state-of-the-art technique for rendering point models,
by re-arranging hierarchical points sequentially according to geometric errors running on GPU for
fast rendering. This paper presents a view dependent method to augment sequential point trees by
embedding the hierarchical tree structures in the sequential list of hierarchical points. By the
method, two kinds of indices are constructed to facilitate the points rendering in an order mostly
from near to far and from coarse to fine. As a result, invisible points can be culled
view-dependently in high efficiency for hardware acceleration, and at the same time, the
advantage of sequential point trees could be still fully taken. Therefore, the new method can run
much faster than the conventional sequential point trees, and the acceleration can be highly
promoted particularly when the objects possess complex occlusion relationship and viewed
closely because invisible points would be in a high percentage of the points at finer levels.
Number of references:25
Main heading:Trees (mathematics)
Controlled terms:Computer hardware - Computer simulation - Hierarchical systems -
Mathematical models - Program processors - Real time systems
Uncontrolled terms:GPU - Point-based rendering - Real time rendering - View dependence -
Visibility culling
Classification code:722.4 Digital Computers and Systems - 723.1 Computer Programming - 723.5
Computer Applications - 731.1 Control Systems - 921.4 Combinatorial Mathematics, Includes
Graph Theory, Set Theory
Treatment:Theoretical (THR)
DOI:10.1007/s11390-006-0181-y
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 167>
Accession number:20064510226362
Title:Intrusion detection model based on executable static analysis
Authors:Su, Pu-Rui (1); Yang, Yi (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100039, China
Corresponding author:Su, P.-R.
       (supurui@is.iscas.ac.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:9
Issue date:September 2006
Publication year:2006
Pages:1572-1578
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:Intrusion Detection based on process' behaviors is one of the mainstream techniques for
defend against intrusion and malicious code. In this paper, an intrusion detection model based on
executable static analysis has been brought forward. The model statically analyzes the executable
files of the application to construct the set of all the possible N-length system call sequences.
When monitoring in real time, it splits the system call sequence the process triggered into
N-length sequences by N-length slide window. If there is one in the N-length sequences not in the
set, the process is marked as intrusive. The model needs not source code or large numbers of
training data, and is much more universal and applicable. When the executable files of the
application are complete, the rate of false positive is 0. It's much stronger for defending against
mimicry attacks and its rate of false negative is much less.
Number of references:14
Main heading:Security systems
Controlled terms:Computer aided analysis - Computer networks - Computer viruses - Data flow
analysis - Inspection - Monitoring - Real time systems - Security of data
Uncontrolled terms:Executable file - False rate - Intrusion detection - Mainstream technique -
Malicious code - Mimicry attack - N length slide window - N length system call sequence -
Process behavior - Source code - Static analysis - System call - Training data
Classification code:722.4 Digital Computers and Systems - 723.1 Computer Programming - 723.2
Data Processing and Image Processing - 723.5 Computer Applications - 913.3.1 Inspection - 914.1
Accidents and Accident Prevention
Treatment:Applications (APP); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 168>
Accession number:20064110165637
Title:Research on dependency of flushing of pending commit transaction log in kernelized
multilevel secure database system
Authors:Xu, Zhen (1); Zhang, Min (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Acad. of Sci., Beijing 100080, China
Corresponding author:Xu, Z.
       (xuzhen@is.iscas.ac.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:8
Issue date:August 2006
Publication year:2006
Pages:1438-1446
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:In a kernelized DBMS, transactions are processed by their corresponding DBMS
instances and those instances maintain log storage and log caches of their own. During the
execution of transactions, a transaction having high security level may read data item which is
generated by low security level transaction. Suppose when the commit log record of low level
transaction is still in cache and the high level transaction has committed and the commit log has
been flushed into durable storage, the system will reach an inconsistent state after restarting. In
order to solve the problem, a trusted log coordinator is introduced to maintain the global
dependency of pending commit transactions' commit log record, to coordinate the log writing of
different DBMS instances to guarantee that the depended commit log records are written out
before the depending ones. Algorithms of the scheme are given and their correctness is proven.
Finally, the effective of the scheme is demonstrated via analysis.
Number of references:16
Main heading:Database systems
Controlled terms:Algorithms - Architecture - Data storage equipment - Graph theory -
Mathematical models - Security of data - Topology
Uncontrolled terms:Dependency graph - Kernelized architecture - Log records - Multi level secure
databases - Pending commit - Security levels - Trusted log coordinators
Classification code:722.1 Data Storage, Equipment and Techniques - 723.2 Data Processing and
Image Processing - 723.3 Database Systems - 921.4 Combinatorial Mathematics, Includes Graph
Theory, Set Theory
Treatment:Applications (APP); Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 169>
Accession number:20062910010248
Title:On mobility of software processes
Authors:Li, Mingshu (1); Yang, Qiusong (1); Zhai, Jian (1); Yang, Guowei (1)
Author affiliation:(1) Laboratory for Internet Software Technologies, Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China; (2) State Key Laboratory of Computer
Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (3)
Graduate University, Chinese Academy of Sciences, Beijing 100039, China
Corresponding author:Li, M.
       (mingshu@itechs.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3966 LNCS
Monograph title:Software Process Change - International Software Process Workshop and
International Workshop on Software Process Simulation and Modeling, SPW/ProSim 2006
Issue date:2006
Publication year:2006
Pages:105-114
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540341994
ISBN-13:9783540341994
Document type:Conference article (CA)
Conference name:International Software Process Workshop and International Workshop on
Software Process Simulation and Modeling, SPW/ProSim 2006
Conference date:May 20, 2006 - May 21, 2006
Conference location:Shanghai, China
Conference code:67767
Publisher:Springer Verlag
Abstract:In this paper, the mobility of software processes is proposed as a novel concept. It is
defined as the structural change in a software process resulting from interactions among linked
process elements. The concept addresses the essential change in a software process which brings a
high variability and unpredictability to process performance. Three categories of the mobility that
lead to the structural change are identified and expounded upon. A reference model for describing
the concept is put forward based on the polyadic &pi;-calculus. With the mobility of software
processes, it is possible to design a new POSEE and associated PML with increased flexibilities.
&copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:12
Main heading:Software engineering
Controlled terms:Artificial intelligence - Computational methods - Computer programming
languages - Computer science - Data structures - Interactive computer systems - Mathematical
models
Uncontrolled terms:Mobility - PML - POSEE - Software processes - Structural change
Classification code:722.4 Digital Computers and Systems - 723.1 Computer Programming -
723.1.1 Computer Programming Languages - 723.2 Data Processing and Image Processing - 723.4
Artificial Intelligence - 921 Mathematics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 170>
Accession number:2006259955110
Title:A development process for building OSS-based applications
Authors:Huang, Meng (1); Yang, Liguang (1); Yang, Ye (3)
Author affiliation:(1) Lab. for Internet Software Technologies, Institute of Software, Chinese
Academy of Sciences, P.O.Box 8718, Beijing, 100080, China; (2) Graduate School, Chinese
Academy of Sciences, Beijing 100039, China; (3) Center for Software Engineering, University of
Southern California, Los Angeles, CA 90089-0791, United States
Corresponding author:Huang, M.
        (hm@itechs.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3840 LNCS
Monograph title:Unifying the Software Process Spectrum - International Software Process
Workshop, SPW 2005, Revised Selected Papers
Issue date:2006
Publication year:2006
Pages:122-135
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540311122
ISBN-13:9783540311126
Document type:Conference article (CA)
Conference name:International Software Process Workshop, SPW 2005
Conference date:May 25, 2005 - May 27, 2005
Conference location:Beijing, China
Conference code:67507
Publisher:Springer Verlag
Abstract:It has become great prominence that business organizations are considering open source
software (OSS) when looking for software system solutions. However, building applications based
on open source software remains an essential issue for many software developers since the new
development process differs from traditional in-house development. In this paper, we present a
development process based on our experience on using open source software in application
development. The new process emphasizes the early assessment to improve the architecture
stability and project manageability by assessing available OSS. A set of measurable assessment
criteria is established in assessing OSS candidates and making optimal decisions in the
development process. A case study is discussed to show the application of this process. &copy;
Springer-Verlag Berlin Heidelberg 2005.
Number of references:25
Main heading:Software engineering
Controlled terms:Computer architecture - Computer science - Computer software - Information
technology - Optimization - Process engineering
Uncontrolled terms:Architecture stability - Assessment criteria - Open source software - OSS
based applications
Classification code:722 Computer Systems and Equipment - 723.1 Computer Programming -
723.5 Computer Applications - 903 Information Science - 913.1 Production Engineering - 921.5
Optimization Techniques
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 171>
Accession number:20072510656250
Title:A stochastic reward net-based performance analysis of LEO satellite networks
Authors:Hong, Zhiguo (1); Sun, Fuchun (2); Xu, Fanjiang (1); Fan, Zhihua (1); Zheng, Gang (1)
Author affiliation:(1) General Software Lab., Institute of Software, Chinese Academy of Sciences,
Beijing 100080, China; (2) Department of Computer Science and Technology, Tsinghua University,
Beijing 100084, China
Corresponding author:Hong, Z.
        (hongzhiguo1977@yahoo.com.cn)

Source title:Proceedings of the 2006 IEEE International Conference on Networking, Sensing and
Control, ICNSC'06
Abbreviated source title:Proc. IEEE Int. Conf. Netw. Sensing Contr.
Monograph title:Proceedings of the 2006 IEEE International Conference on Networking, Sensing
and Control, ICNSC'06
Issue date:2006
Publication year:2006
Pages:24-28
Article number:1673112
Language:English
ISBN-10:1424400651
ISBN-13:9781424400652
Document type:Conference article (CA)
Conference name:2006 IEEE International Conference on Networking, Sensing and Control,
ICNSC'06
Conference date:April 23, 2006 - April 25, 2006
Conference location:Ft. Lauderdale, FL, United states
Conference code:69738
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:In this paper, a Stochastic Reward Net (SRN) model is constructed to analyze the
performance of Low Earth Orbit (LEO) satellite networks in the case of packet loss. A lemma Is
proved to calculate the packet loss probability. Then, the impact of buffer size, arrival rate and
packet size on packet loss probability is also analyzed using Stochastic Petri Net Package (SPNP)
6.0. Through numerical results, some new results are derived thereby. &copy; 2006 IEEE.
Number of references:23
Main heading:Satellites
Controlled terms:Numerical methods - Packet loss - Petri nets - Theorem proving
Uncontrolled terms:Low Earth Orbit (LEO) satellite - Satellite networks - Stochastic Petri Net
Package (SPNP) - Stochastic Reward Net (SRN) model
Classification code:655.2 Satellites - 716 Telecommunication; Radar, Radio and Television - 721.1
Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming
Theory - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 921.6
Numerical Methods
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 172>
Accession number:20064110161894
Title:Partially introducing formal methods into object-oriented development: Case studies using a
metrics-driven approach
Authors:Zheng, Yujun (1); Wang, Jinquan (1); Wang, Kan (3); Xue, Jinyun (2)
Author affiliation:(1) Systems Engineering Institute of Engineer Equipment, 100093 Beijing,
China; (2) Institute of Software, Chinese Academy of Sciences, 100080 Beijing, China; (3)
Academy of Armored Force Engineering, 100072 Beijing, China; (4) College of Computer
Information and Engineering, Jiangxi Normal University, 330027 Nanchang, China
Corresponding author:Zheng, Y.
        (uchengz@yahoo.com.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4085 LNCS
Monograph title:FM 2006: Formal Methods - 14th International Symposium on Formal Methods,
Proceedings
Issue date:2006
Publication year:2006
Pages:190-204
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540372156
ISBN-13:9783540372158
Document type:Conference article (CA)
Conference name:FM 2006: 14th International Symposium on Formal Methods
Conference date:August 21, 2006 - August 27, 2006
Conference location:Hamilton, Canada
Conference code:68250
Publisher:Springer Verlag
Abstract:Among researchers and practitioners, there are disputations about whether, where, and to
which degree formal methods worth their cost. Based on our experiences of industrial software
projects over the last years, we develop an empirical approach of partially introducing formal
methods into object-oriented software development. Once an initial architecture design is
available, object-oriented metrics can be useful criteria for selecting core parts of software systems
for formal treatment. Case studies of the application of our approach show that partially adopting
formal methods could achieve a satisfying balance between investment and product quality in a
cost-effective way. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:27
Main heading:Formal logic
Controlled terms:Computer software - Cost effectiveness - Industrial applications - Investments -
Object oriented programming
Uncontrolled terms:Formal methods - Object-oriented development - Product quality
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.1 Computer Programming - 911.2 Industrial Economics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 173>
Accession number:20072510664926
Title:An adaptive feedback scheduling algorithm for robot assembly and real-time control systems
Authors:Yuan, Peijiang (1)
Author affiliation:(1) Dept. of Electrical and Computer Engineering, University of Western
Ontario, London, Ont. N6A 5B8; (2) Institute of Software, Chinese Academy of Science, Beijing,
100080, China
Corresponding author:Yuan, P.
       (pyuan3@uwo.ca)

Source title:IEEE International Conference on Intelligent Robots and Systems
Abbreviated source title:IEEE Int Conf Intell Rob Syst
Monograph title:2006 IEEE/RSJ International Conference on Intelligent Robots and Systems,
IROS 2006
Issue date:2006
Publication year:2006
Pages:2226-2231
Article number:4058715
Language:English
CODEN:85RBAH
ISBN-10:142440259X
ISBN-13:9781424402595
Document type:Conference article (CA)
Conference name:2006 IEEE/RSJ International Conference on Intelligent Robots and Systems,
IROS 2006
Conference date:October 9, 2006 - October 15, 2006
Conference location:Beijing, China
Conference code:69773
Sponsor:IEEE Robotics and Automation Society; Robotics Society of Japan; IEEE Industrial
Electronics Society; Society of Instruments and Control Engineers; New Technology Foundation
Publisher:Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:In this paper, we present an adaptive feedback controller for nonlinear multi-robot
systems with unknown execution times and task dependencies. An adaptive self-tuning PID
controller is discussed. A real-time force/torque leading controller for industrial multi-robot
cooperation is addressed. Previously reported impedance control and hybrid control approaches
are reviewed. Trajectory and velocity following issues for industrial manipulators are considered
by using an error-reduction admittance control method. A number of experiments are presented.
Experimental results show that this adaptive feedback controller can be used in industrial
multi-robot coordination and force-guided assembly. With the proposed adaptive feedback
scheduling algorithm, the system performance and the deadline miss ratio can be improved
compared with the traditional feedback scheduling algorithm. &copy; 2006 IEEE.
Number of references:19
Main heading:Adaptive algorithms
Controlled terms:Control system analysis - Feedback control - Industrial robots - Nonlinear
systems - Real time control - Robotics
Uncontrolled terms:Adaptive feedback controller - Adaptive feedback scheduling algorithms -
Nonlinear multi robot systems - Robot assembly
Classification code:723 Computer Software, Data Handling and Applications - 731.1 Control
Systems - 731.5 Robotics - 731.6 Robot Applications - 961 Systems Science
Treatment:Theoretical (THR)
DOI:10.1109/IROS.2006.282565
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 174>
Accession number:20064310193826
Title:Progress and prospect of some fundamental research on information security in China
Authors:Feng, Deng-Guo (1); Wang, Xiao-Yun (2)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) School of Mathematics and System Science,
Shandong University, Jinan 250100, China
Corresponding author:Feng, D.-G.
       (fengdg@263.net)

Source title:Journal of Computer Science and Technology
Abbreviated source title:J Comput Sci Technol
Volume:21
Issue:5
Monograph title:Special Issue Dedicated to the 20th Anniversary of NFSC
Issue date:September 2006
Publication year:2006
Pages:740-755
Language:English
ISSN:10009000
CODEN:JCTEEM
Document type:Journal article (JA)
Publisher:Springer New York LLC
Abstract:With the development of network and information technologies, information security is
more and more widely researched in China. To know where the work is and where it goes, we
focus on comprehensively surveying the twenty years of important fundamental research by
Chinese scholars, and giving, from our point of view, the significance as well as the outlook of
future work. Some of the reviewed work, including the researches on fundamental theory of
cryptography, cryptographic algorithm, security protocol, security infrastructure and information
hiding, greatly advances the related sub-fields, and is highly recognized in and outside of China.
Nevertheless, the overall work, we think, is still facing the problems of unbalanced development
of sub-areas, limited scope of research, lack of systematic work and application, etc., leaving
much room for improvement in the near future. &copy; Springer Science + Business Media, Inc.
2006.
Number of references:207
Main heading:Security of data
Controlled terms:Algorithms - Computer networks - Cryptography - Data privacy - Information
technology - Network protocols - Surveying
Uncontrolled terms:Cryptographic algorithm - Cryptology - Security infrastructure - Security
protocol
Classification code:716 Telecommunication; Radar, Radio and Television - 723.2 Data Processing
and Image Processing - 723.5 Computer Applications
Treatment:Literature review (LIT); Theoretical (THR)
DOI:10.1007/s11390-006-0740-2
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 175>
Accession number:20070310372262
Title:Improvement in public-key encryption and key exchange scheme based on Chebyshev
polynomials
Authors:Wang, Da-Hu (1); Wei, Xue-Ye (1); Li, Qing-Jiu (3); Liu, Yan-Hong (1)
Author affiliation:(1) School of Electronics and Information Engineering, Beijing Jiaotong
University, Beijing 100044, China; (2) State Key Laboratory of Information Security, Institute of
Software, Chinese Academy of Sciences, Beijing 100080, China; (3) Jiaozuo Tianfang Building
Material Company Ltd., Jiaozuo 454002, China
Corresponding author:Wang, D.-H.
       (dahuwang@126.com)

Source title:Tiedao Xuebao/Journal of the China Railway Society
Abbreviated source title:Tiedao Xuebao
Volume:28
Issue:5
Issue date:October 2006
Publication year:2006
Pages:95-98
Language:Chinese
ISSN:10018360
CODEN:TIXUF5
Document type:Journal article (JA)
Publisher:Science Press, 18,Shuangqing Street,Haidian, Beijing, 100085, China
Abstract:It is essential to discover a one-way trap-door function in constructing a public-key
encryption scheme. Kocarev invented an encryption scheme based on the semi-group property of
Chebyshev mapping. The scheme was found insecure. Due to the inherent periodicity of the
trigonometric function, an attacker can easily decode the scheme when some ciphers are given. In
the paper we extend the state space of Chebyshev polynomials to the real number domain, employ
the semi-group property of Chebyshev polynomials to construct a one-way door-trap function, and
avoid the attack. A new scheme based on the extended Chebyshev polynomials is given. Moreover,
the relative public-key encryption and key exchange schemes are presented. The encrypt systems
show themselves to be practical and secure.
Number of references:7
Main heading:Cryptography
Controlled terms:Chaos theory - Mapping - Security of data - Security systems
Uncontrolled terms:Chaotic mapping - Chebyshev polynomials - Key exchange scheme - Public
key encryption
Classification code:723 Computer Software, Data Handling and Applications - 914.1 Accidents
and Accident Prevention - 921 Mathematics
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 176>
Accession number:20062910010416
Title:An ontology definition framework for model driven development
Authors:Duan, Yucong (1); Fu, Xiaolan (2); Hu, Qingwu (3); Gu, Yuqing (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China;
(2) State Key Laboratory of Brain and Cognitive Science, Institute of Psychology, Chinese
Academy of Sciences, Beijing 100101, China; (3) China Development Center for NEC Telecom
System, 100044, China
Corresponding author:Duan, Y.
       (duanyucong@263.net)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3983 LNCS
Monograph title:Computational Science and Its Applications - ICCSA 2006: International
Conference, Proceedings - Part IV
Issue date:2006
Publication year:2006
Pages:746-755
Language:English
ISSN:03029743
E-ISSN:16113349
Document type:Conference article (CA)
Conference name:ICCSA 2006: International Conference on Computational Science and Its
Applications
Conference date:May 8, 2006 - May 11, 2006
Conference location:Glasgow, United kingdom
Conference code:67786
Sponsor:Institute of Electrical Engineering, IEE, UK; University of Perugia, Italy; University of
Calgary, Canada; University of Minnesota, MN, ISA; Queens' University of Belfast, UK
Publisher:Springer Verlag
Abstract:Ontologies are increasingly adopted to facilitate the model driven software development
(MDSD). The issue of intertransformations among various ontologies is quickly growing
prominent. Some explain that variation of ontology definition should be accepted as a must. We
would agree with the point that the definition of ontology for the MDSD should be further
standardized with tools. In this paper, the ontology definition for the MDSD is systematically
analyzed from the philosophical and human cognitional views. Based on a few metaconcepts,
ontology creation and evaluation modes are proposed. By providing general precise and consistent
semantics for development elements, this framework will considerably improve the development
of models of automation oriented development MDSD processes. Experimental applications on
intertransformations and unifications of semantics of existing modeling languages are very
encouraging. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:30
Main heading:Software engineering
Controlled terms:Computer aided software engineering - Computer simulation - Mathematical
transformations - Semantics
Uncontrolled terms:Intertransformations - Model driven software development (MDSD) -
Ontology - Unifications
Classification code:723.1 Computer Programming - 723.5 Computer Applications - 903.2
Information Dissemination - 921.3 Mathematical Transformations
Treatment:Theoretical (THR)
DOI:10.1007/11751632_81
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 177>
Accession number:20062910005391
Title:An improved case-based approach to LTL model checking
Authors:Pu, Fei (1); Zhang, Wenhui (1); Wang, Shaochun (1)
Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of
Sciences, P.O.Box 8718, 100080 Beijing, China
Corresponding author:Pu, F.
       (pufei@ios.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3943 LNCS
Monograph title:Rapid Integration of Software Engineering Techniques: Second International
Workshop, RISE 2005, Revised Selected Papers
Issue date:2006
Publication year:2006
Pages:190-202
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540340637
ISBN-13:9783540340638
Document type:Conference article (CA)
Conference name:2nd International Workshop on Rapid Integration of Software Engineering
Techniques, RISE 2005
Conference date:September 8, 2005 - September 9, 2005
Conference location:Heraklion, Crete, Greece
Conference code:67737
Sponsor:Found. for Res. and Technol. - Hellas, FORTH, ICS, Greece; ERCIM
Publisher:Springer Verlag
Abstract:The state space explosion is the key obstacle of model checking. Even a relatively small
system specification may yield a very large state space. The case-based approach based on search
space partition has been proposed in [18, 19] for reducing model checking complexity. This paper
extends the approach by considering wider ranges of case-bases of models and multiple case-bases
such that it can be applied to more types of applications. The improved approach also combines
the search space partition and static analysis or expert knowledge for guaranteeing the
completeness of the cases. The case study demonstrates the potential advantages of the strategy
and show that the strategy may improve the efficiency of system verification and therefore scale
up the applicability of the verification approach. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:19
Main heading:Computer systems
Controlled terms:Computational complexity - Data storage equipment - Knowledge acquisition -
Mathematical models - Search engines - Static random access storage
Uncontrolled terms:Case-based approach - Expert knowledge - Search space partition - Static
analysis
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 722 Computer Systems and Equipment - 722.1 Data Storage,
Equipment and Techniques - 723 Computer Software, Data Handling and Applications - 723.4
Artificial Intelligence - 921 Mathematics
Treatment:Theoretical (THR)
DOI:10.1007/11751113_14
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 178>
Accession number:20062910005059
Title:Integral cryptanalysis of reduced FOX block cipher
Authors:Wu, Wenling (1); Zhang, Wentao (2); Feng, Dengguo (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) State Key Laboratory of Information Security,
Graduate University, Chinese Academy of Sciences, Beijing 100049, China
Corresponding author:Wu, W.
        (wwl@is.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3935 LNCS
Monograph title:Information Security and Cryptology, ICISC 2005 - 8th International Conference,
Revised Selected Papers
Issue date:2006
Publication year:2006
Pages:229-241
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540333541
ISBN-13:9783540333548
Document type:Conference article (CA)
Conference name:8th International Conference on Information Security and Cryptology, ICISC
2005
Conference date:December 1, 2005 - December 2, 2005
Conference location:Seoul, Korea, Republic of
Conference code:67732
Sponsor:Ministry of Information and Communication, Korea; Institute of Information Technology
Assessment, Korea; Solmaze Co., Ltd., Korea; K-Bell Co., Ltd., Korea; HAN Infocomm,, Co.,
Ltd., Korea
Publisher:Springer Verlag
Abstract:FOX is a family of block ciphers presented recently, which is based upon some results of
provable security and has high performances on various platforms. In this paper, we construct
some distinguishers between 3-rouncl FOX and a random permutation of the blocks space. By
using integral attack and collision-searching techniques, the distinguishers are used to attack 4, 5,
6 and 7-round FOX64, 4 and 5-round FOX128. The attack is more efficient than previous integral
attacks on FOX. The complexity of improved integral attack is 2<sup>77.6</sup> on 4-round
FOX128, 2<sup>205.6</sup> against 5-round FOX128 respectively. For FOX64, the complexity
of improved integral attack is 2 <sup>45.4</sup> on 4-round FOX64, 2<sup>109.4</sup> against
5-round FOX64, 2<sup>173.4</sup> against 6-round FOX64, 2<sup>237.4</sup> against
7-round FOX64 respectively. Therefore, 4-round FOX64/64, 5-round FOX64/128, 6-round
FOX64/192, 7-round FOX64/256 and 5-round FOX128/256 are not immune to the attack in this
paper. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:23
Main heading:Cryptography
Controlled terms:Computational complexity - Integral equations - Search engines - Security
systems
Uncontrolled terms:FOX block cipher - Integral attacks - Integral cryptanalysis - Random
permutation
Classification code:716 Telecommunication; Radar, Radio and Television - 721.1 Computer
Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723
Computer Software, Data Handling and Applications - 914.1 Accidents and Accident Prevention -
921.2 Calculus
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 179>
Accession number:20070410389501
Title:Line clipping against a polygon through convex segments
Authors:Sun, Chunjuan (0); Wang, Wencheng (0); Li, Jing (0); Wu, Enhua (0)
Corresponding author:Sun, C.
        (suncj@ios.ac.cn)

Corr. author affiliation:State Key Laboratory of Computer Science, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and
Computer Graphics
Abbreviated source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao
Volume:18
Issue:12
Issue date:December 2006
Publication year:2006
Pages:1799-1805
Language:Chinese
ISSN:10039775
CODEN:JFTXFX
Document type:Journal article (JA)
Publisher:Institute of Computing Technology, Beijing, China
Abstract:A novel algorithm is proposed in the paper for line clipping against a general polygon.
By the algorithm, the polygon edges are decomposed sequentially into certain segments, under the
constraint that each segment is able to form a local convex polygon. These segments are called
convex segments, and a BSP tree is constructed for the segments. During the line clipping process,
the BSP tree is employed to search for the convex segments in intersection with the line, and then
calculate the clipped line against the convex segments. The algorithm shows nice performance by
experiments that the time complexity of the algorithm is in between O(log N) and O(N) adaptively,
and better than O(N) in most cases.
Number of references:7
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 180>
Accession number:20070310362232
Title:Power graded data gathering mechanism for wireless sensor networks
Authors:Bi, Yan-Zhong (1); Yan, Ting-Xin (1); Sun, Li-Min (1); Wu, Zhi-Mei (1)
Author affiliation:(1) Institute of Software, Chinese Acad. of Sci., Beijing 100080, China; (2)
Graduate School, Chinese Acad. of Sci., Beijing 100039, China
Corresponding author:Bi, Y.-Z.
        (yanzhong02@ios.cn)

Source title:Zidonghua Xuebao/Acta Automatica Sinica
Abbreviated source title:Zidonghua Xuebao
Volume:32
Issue:6
Issue date:November 2006
Publication year:2006
Pages:881-891
Language:English
ISSN:02544156
CODEN:ZIXUDZ
Document type:Journal article (JA)
Publisher:Science Press, 18,Shuangqing Street,Haidian, Beijing, 100085, China
Abstract:The data gathering manner of wireless sensor networks, in which data is forwarded
towards the sink node, would cause the nodes near the sink node to transmit more data than those
far from it. Most data gathering mechanisms nowdo not do well in balancing the energy
consumption among nodes with different distances to the sink, thus they can hardly avoid the
problem that nodes near the sink consume energy more quickly, which may cause the network
rupture from the sink node. This paper presents a data gathering mechanism called PODA, which
grades the output power of nodes according to their distances from the sink node. PODA balances
energy consumption by setting the nodes near the sink with lower output power and the nodes far
from the sink with higher output power. Simulation results show that the PODA mechanism can
achieve even energy consumption in the entire network, improve energy efficiency and prolong
the network lifetime.
Number of references:15
Main heading:Sensors
Controlled terms:Energy efficiency - Energy utilization
Uncontrolled terms:Data gathering - Energy balance - Energy consumption - Power grade -
Wireless sensor network
Classification code:525.2 Energy Conservation - 525.3 Energy Utilization - 732.2 Control
Instrumentation
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 181>
<RECORD 1>
Accession number:20064310193828
Title:Model checking data consistency for cache coherence protocols
Authors:Pan, Hong (1); Lin, Hui-Min (1); Lv, Yi (1)
Author affiliation:(1) Laboratory for Computer Science, Institute of Software, Chinese Academy
of Sciences, Beijing 100080, China
Corresponding author:Pan, H.
       (ph@ios.ac.cn)

Source title:Journal of Computer Science and Technology
Abbreviated source title:J Comput Sci Technol
Volume:21
Issue:5
Monograph title:Special Issue Dedicated to the 20th Anniversary of NFSC
Issue date:September 2006
Publication year:2006
Pages:765-775
Language:English
ISSN:10009000
CODEN:JCTEEM
Document type:Journal article (JA)
Publisher:Springer New York LLC
Abstract:A method for automatic verification of cache coherence protocols is presented, in which
cache coherence protocols are modeled as concurrent value-passing processes, and control and
data consistency requirement are described as formulas in first-order &mu;-calculus. A model
checker is employed to check if the protocol under investigation satisfies the required properties.
Using this method a data consistency error has been revealed in a well-known cache coherence
protocol. The error has been corrected, and the revised protocol has been shown free from data
consistency error for any data domain size, by appealing to data independence technique. &copy;
Springer Science + Business Media, Inc. 2006.
Number of references:17
Main heading:Data reduction
Controlled terms:Cache memory - Concurrent engineering - Data processing - Error analysis -
Graph theory - Mathematical models - Network protocols
Uncontrolled terms:Cache coherence protocols - Concurrent systems - Model checking - Symbolic
transition graphs - Value passing
Classification code:722.1 Data Storage, Equipment and Techniques - 723.2 Data Processing and
Image Processing - 723.5 Computer Applications - 921.4 Combinatorial Mathematics, Includes
Graph Theory, Set Theory - 921.6 Numerical Methods
Treatment:Theoretical (THR)
DOI:10.1007/s11390-006-0765-6
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 182>
Accession number:2006229911971
Title:Cluster based security scheme in wireless Ad Hoc networks
Authors:Zhang, Xiaoning (1); Feng, Dengguo (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Zhang, X.
        (zxnmail@21cn.com)

Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development
Abbreviated source title:Jisuanji Yanjiu yu Fazhan
Volume:43
Issue:2
Issue date:February 2006
Publication year:2006
Pages:238-243
Language:Chinese
ISSN:10001239
CODEN:JYYFEY
Document type:Journal article (JA)
Publisher:Science Press
Abstract:Wireless ad hoc networks are a kind of networks that do not need communication
infrastructure. Such networks are being used in more and more areas. The security of ad hoc
networks has become a hot research point in the latest years. The security of cluster based ad hoc
networks is analyzed and a new scheme is proposed to solve the security problems existing in such
networks. The main contributions of the scheme are as follows: (1) presenting a security
mechanism to secure the cluster heads; and (2) proposing a mechanism to remove the security
defects in the roaming of mobile nodes, and providing a related algorithm. Simulation is
performed to test the scheme. The experiment results show that the scheme is feasible. Compared
with related security schemes for cluster based ad hoc networks, the proposed scheme is more
secure, and has a better network performance.
Number of references:8
Main heading:Security of data
Controlled terms:Algorithms - Communication - Computer simulation - Information technology
Uncontrolled terms:Ad hoc networks - Certificate - Cluster head - Cluster network - Mobile nodes
- Network performance - Security defects - Security scheme - Wireless security
Classification code:716 Telecommunication; Radar, Radio and Television - 723.2 Data Processing
and Image Processing - 723.5 Computer Applications - 903 Information Science - 921
Mathematics
Treatment:Applications (APP)
DOI:10.1360/crad20060208
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 183>
Accession number:2006249938158
Title:Design and analysis of cryptographic protocols for RFID
Authors:Zhou, Yong-Bin (1); Feng, Deng-Guo (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Zhou, Y.-B.
       (zhouyongbin@sina.com)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:4
Issue date:April 2006
Publication year:2006
Pages:581-589
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:Recently, RFID system is being widely considered as a main technology to realize
ubiquitous computing environment, but the features of the RFID systems and the constraints of
RFID devices may bring about various privacy problems. The biggest challenge for RFID
technology is to provide benefits without threatening the privacy of consumers. This paper
reviews the existing RFID system security mechanisms, with a focus on cryptographic protocols.
Weaknesses or flaws in these protocols are examined. Then a theoretical model and method to
design and analyze RFID protocols within the provable security framework is discussed.
Number of references:28
Main heading:Cryptography
Controlled terms:Communication channels (information theory) - Communication systems -
Network protocols
Uncontrolled terms:Cryptographic protocol - Hash lock protocol - Provable security - Radio
frequency identification (RFID) - Reencryption - Security model
Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer
Software, Data Handling and Applications
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 184>
Accession number:20070310361764
Title:New message authentication code and its security proof
Authors:Wang, Da-Yin (1); Lin, Dong-Dai (1); Wu, Wen-Ling (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Wang, D.-Y.
       (wdy@is.iscas.ac.cn)

Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica
Abbreviated source title:Tien Tzu Hsueh Pao
Volume:34
Issue:10
Issue date:October 2006
Publication year:2006
Pages:1812-1816
Language:Chinese
ISSN:03722112
CODEN:TTHPAG
Document type:Journal article (JA)
Publisher:Chinese Institute of Electronics, P.O. Box 165, Beijing, 100036, China
Abstract:The most important tool to protect data integrity is Message Authentication Code (MAC),
which is widely used in many kinds of secure systems. With the development of the theory of
provable security, the MACs, which have security proof, are the first choice of many people.
Based on the constructions of XOR MAC and PMAC, we define a deterministic fully
parallelizable block-cipher mode of operation for message authentication-DXOR MAC
(Deterministic XOR MAC). We prove its security, quantifying an adversary's forgery probability
in terms of the quality of the block cipher as a pseudo-random permutation.
Number of references:10
Main heading:Security of data
Controlled terms:Communication channels (information theory) - Cryptography - Public key
cryptography - Security systems
Uncontrolled terms:Block cipher mode - Data integrity - Forgery probability - Game playing -
Message authentication code (MAC) - PMAC - Provable security - Pseudo random permutation -
Secure system - Security proof - XOR MAC
Classification code:716.1 Information Theory and Signal Processing - 723.2 Data Processing and
Image Processing - 914.1 Accidents and Accident Prevention
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 185>
Accession number:20064110165687
Title:A multi-dimensional separation of concerns approach for model driven process framework
modeling
Authors:Duan, Yu-Cong (1); Gu, Yu-Qing (1)
Author affiliation:(1) Institute of Software, The Chinese Academy of Sciences, Beijing 100080,
China; (2) Graduate School, The Chinese Academy of Sciences, Beijing 100049, China
Corresponding author:Duan, Y.-C.
       (duanyucong@263.net)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:8
Issue date:August 2006
Publication year:2006
Pages:1707-1716
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:Currently, model driven software development processes largely take the form of the
integration of several developing approaches. However comparing, selecting, composing of
developing approaches usually rely on experiences lacking systemic guidelines. In this paper, a
multi-dimensional separation of concerns approach for process frameworks constructing is
proposed. Taking abstraction, generality, behaviorism as meta concerns, developing approaches
are compared. Incorporated with the expected evolving curves of these meta concerns,
implementing frameworks of developing processes are constructed. This work will be beneficial
to meet nonfunctional requirements on model driven development processes like improving
efficiency, traceability and ensuring consistency.
Number of references:33
Main heading:Software engineering
Controlled terms:Computer simulation - Integration - Mathematical models - Process control -
Requirements engineering - Separation
Uncontrolled terms:Abstraction - Behaviorism - Generality - Model driven development - Multi
dimensional - Nonfunctional requirements - Process frameworks - Separation of concerns
Classification code:723.1 Computer Programming - 723.5 Computer Applications - 731 Automatic
Control Principles and Applications - 921 Mathematics
Treatment:Applications (APP)
DOI:10.1360/jos171707
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 186>
Accession number:2006259955124
Title:Software process management: Practices in China
Authors:Wang, Qing (1); Li, Mingshu (1)
Author affiliation:(1) Lab. for Internet Software Technologies, Institute of Software, Chinese
Academy of Sciences, South Fourth Street, Zhong Guan Cun, Beijing 10 00 80, China; (2) State
Key Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences, South Fourth
Street, Zhong Guan Cun, Beijing 10 00 80, China
Corresponding author:Wang, Q.
        (wq@itechs.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3840 LNCS
Monograph title:Unifying the Software Process Spectrum - International Software Process
Workshop, SPW 2005, Revised Selected Papers
Issue date:2006
Publication year:2006
Pages:317-331
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540311122
ISBN-13:9783540311126
Document type:Conference article (CA)
Conference name:International Software Process Workshop, SPW 2005
Conference date:May 25, 2005 - May 27, 2005
Conference location:Beijing, China
Conference code:67507
Publisher:Springer Verlag
Abstract:Software process management has been proven a useful means to help software
organizations improve their development processes and produce high quality products. It focuses
on providing process-related products and services to software developer. Chinese software
industry is developing rapidly, Effective software process methods, technology and tools that help
them produce quality products while reducing the costs are in desperate need. This paper discusses
the current state of project management in Chinese software companies and presents a solution
and practices meeting this need. &copy; Springer-Verlag Berlin Heidelberg 2005.
Number of references:14
Main heading:Process control
Controlled terms:Computer software - Quality control - Societies and institutions - Software
engineering - Technology
Uncontrolled terms:Chinese software companies - Software organizations - Software process
management
Classification code:723 Computer Software, Data Handling and Applications - 723.1 Computer
Programming - 731 Automatic Control Principles and Applications - 901.1.1 Societies and
Institutions - 913.3 Quality Assurance and Control
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 187>
Accession number:20072610672076
Title:A test data generation tool for unit testing of C programs
Authors:Xu, Zhongxing (1); Zhang, Jian (2)
Author affiliation:(1) State Key Laboratory of Computer Science, Chinese Academy of Sciences,
Graduate University; (2) State Key Laboratory of Computer Science, Institute of Software,
Chinese Academy of Sciences
Corresponding author:Xu, Z.
        (xzx@ios.ac.cn)

Source title:Proceedings - International Conference on Quality Software
Abbreviated source title:Proc. Int. Conf. Qual. Softw.
Monograph title:Proceedings - Sixth International Conference on Quality Software, QSIC 2006
Issue date:2006
Publication year:2006
Pages:107-114
Article number:4032275
Language:English
ISSN:15506002
ISBN-10:0769527183
ISBN-13:9780769527185
Document type:Conference article (CA)
Conference name:6th International Conference on Quality Software, QSIC 2006
Conference date:October 27, 2006 - October 28, 2006
Conference location:Beijing, China
Conference code:69805
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:This paper describes a prototype tool, called SimC, which automatically generates test
data for unit testing of C programs. The tool symbolically simulates the execution of the given
program. It simulates pointer operations precisely. This makes it capable of generating test data for
programs involving pointer and structure operations. Experiments on real-world programs
including the GNU coreutils are presented. Some trade-offs of simulation schemes are also
discussed. &copy; 2006 IEEE.
Number of references:19
Main heading:Computer programming languages
Controlled terms:Codes (symbols) - Computer simulation - Data reduction - Real time systems
Uncontrolled terms:Pointer operation - Symbolic execution - Test data generation - Unit testing
Classification code:722.4 Digital Computers and Systems - 723.1.1 Computer Programming
Languages - 723.2 Data Processing and Image Processing - 723.5 Computer Applications
Treatment:Theoretical (THR)
DOI:10.1109/QSIC.2006.7
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 188>
Accession number:20080611078641
Title:Context-aware caching for wireless internet applications
Authors:Feng, Wenlan (1); Zhang, Liang (1); Jin, Beihong (1); Fan, Zhihua (1)
Author affiliation:(1) Technology Center for Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing 100080
Corresponding author:Feng, W.
       (Wenlanfeng@hotmail.com)

Source title:Proceedings - IEEE International Conference on e-Business Engineering, ICEBE
2006
Abbreviated source title:Proc. IEEE Int. Conf. e-Bus. Eng. ICEBE
Monograph title:Proceedings - IEEE International Conference on e-Business Engineering, ICEBE
2006
Issue date:2006
Publication year:2006
Pages:450-455
Article number:4031686
Language:English
ISBN-10:0769526454
ISBN-13:9780769526454
Document type:Conference article (CA)
Conference name:IEEE International Conference on e-Business Engineering, ICEBE 2006
Conference date:October 24, 2006 - October 26, 2006
Conference location:Shanghai, China
Conference code:71267
Sponsor:IEEE Computer Society Technical Committee on Electronic Commerce
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:The recent advances in wireless networking technologies and the growing success of
mobile computing devices, such as PDA, pocket PC and third generation mobile phone, are
enabling new classes of applications that present challenging problems to designers. The intrinsic
constraints from limited device resources and frequent mobile disconnections cause that wireless
applications can not be working smoothly as those in the traditional wired internet. Context-aware
caching is a suitable approach to improve the quality of services in wireless applications. In this
paper, we describe a context model, by which all contexts is divided into three categories as
sensed, defined and derived. For the context prediction and selection in caching, we propose a
weight-based data hoarding algorithm to select or update cached data objects. Two applications
are introduced throughout in this paper to illustrate the effectiveness of context-aware caching.
&copy; 2006 IEEE.
Number of references:11
Main heading:Internet
Controlled terms:Buffer storage - Constraint theory - Information management - Mobile devices -
Quality of service - Wireless networks
Uncontrolled terms:Context aware caching - Data hoarding algorithm
Classification code:716.3 Radio Systems and Equipment - 722.1 Data Storage, Equipment and
Techniques - 723 Computer Software, Data Handling and Applications - 912.2 Management - 961
Systems Science
Treatment:Theoretical (THR)
DOI:10.1109/ICEBE.2006.33
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 189>
Accession number:20075110977064
Title:Simulation of fluid dynamics and interactions
Authors:Wu, Enhua (1); Zhu, Hongbin (2); Liu, Xuehui (3); Liu, Youquan (4)
Author affiliation:(1) Department of Computer and Information Science, University of Macau,
Chinese Academy of Sciences; (2) State Key Lab. of Computer Science, Chinese Academy of
Sciences, Graduate School; (3) State Key Lab. of Computer Science, Institute of Software,
Chinese Academy of Sciences; (4) Ageia Technologies Inc.
Corresponding author:Wu, E.
       (ehwu@umac.mo)

Source title:2006 International Conference on Cyberworlds, CW'06
Abbreviated source title:Int Conf Cyberworlds
Monograph title:2006 International Conference on Cyberworlds, CW'06
Issue date:2006
Publication year:2006
Pages:3-11
Article number:4030820
Language:English
ISBN-10:0769526713
ISBN-13:9780769526713
Document type:Conference article (CA)
Conference name:2006 International Conference on Cyberworlds, CW'06
Conference date:November 28, 2006 - November 29, 2006
Conference location:Lausanne, Switzerland
Conference code:70712
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Through interaction with surroundings, the fluids may change their properties such as
shapes, temperature vastly, and the same would happen to the surroundings simultaneously. On the
other hand, different surroundings characterize different interactions, and may change the shapes
and motions of the fluids in different ways. Therefore, it is of importance in physically-based
simulation of fluids to build physically correct models to represent the varying interactions
between fluids and the environments. In this paper, we will make a simple summation on the
interactions, and in particular focus on those most interesting to us, and model them with various
physical solutions. In some of the methods, advantage is taken with the Graphics Processing Unit
(GPU) to achieve real-time computation for medial-scale simulation. &copy; 2006 IEEE.
Number of references:28
Main heading:Flow interactions
Controlled terms:Computer simulation - Equations of motion - Fluid dynamics - Graphic methods
- Problem solving - Real time systems
Uncontrolled terms:Graphics Processing Unit (GPU) - Motions of fluids - Simulation of fluids
Classification code:631.1 Fluid Flow, General - 722.4 Digital Computers and Systems - 723.4
Artificial Intelligence - 723.5 Computer Applications - 921.2 Calculus - 931.1 Mechanics
Treatment:Theoretical (THR)
DOI:10.1109/CW.2006.35
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 190>
Accession number:20062910005571
Title:An ACO-based approach for task assignment and scheduling of multiprocessor control
systems
Authors:Jin, Hong (1); Wang, Hui (1); Wang, Hongan (1); Dai, Guozhong (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080
Corresponding author:Jin, H.
       (hjin@iel.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3959 LNCS
Monograph title:Theory and Applications of Models of Computation - Third International
Conference, TAMC 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:138-147
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540340211
ISBN-13:9783540340218
Document type:Conference article (CA)
Conference name:3rd International Conference on Theory and Applications of Models of
Computation, TAMC 2006
Conference date:May 15, 2006 - May 20, 2006
Conference location:Beijing, China
Conference code:67762
Sponsor:National Natural Sciences Foundation of China; Chinese Academy of Sciences, Institute
of Software, China
Publisher:Springer Verlag
Abstract:In order to solve whether a set of periodic tasks can be assigned to a set of identical
processors in such a way that all timing constraints can be met, the model of travelling salesman
problem is used to describe the task assignment and scheduling in real-time multiprocessor control
systems. Combined with the scheduling characteristics of multiprocessor systems, a new feasible
algorithm based on ant colony optimization metaheuristic is presented for solving this problem.
Both the scheduling performance index and the control performance index are proposed and used
as fitness functions of optimization. Simulation results show that the proposed approach can solve
the task assignment and scheduling problem in multiprocessor control systems. &copy;
Springer-Verlag Berlin Heidelberg 2006.
Number of references:12
Main heading:Multiprocessing systems
Controlled terms:Constraint theory - Control systems - Problem solving - Real time systems -
Time varying systems
Uncontrolled terms:Metaheuristic - Multiprocessor control systems
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 722.4 Digital Computers and Systems - 723.4 Artificial
Intelligence - 731.1 Control Systems
Treatment:Theoretical (THR)
DOI:10.1007/11750321_13
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 191>
Accession number:20064710258473
Title:Topological dynamics analysis of Walker constellation satellite networks
Authors:She, Chun-Dong (1); Wang, Jun-Feng (2); Liu, Li-Xiang (3); Zhou, Ming-Tian (4)
Author affiliation:(1) Academy of Opto-Electronics, Chinese Academy of Sciences, Beijing
100080, China; (2) School of Computer Science and Engineering, Sichuan University, Chengdu
610064, China; (3) National Key Laboratory of Integrated Information System Technology,
Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (4) School of
Computer Science and Engineering, University of Electronic Science and Technology of China,
Chengdu 610054, China
Corresponding author:She, C.-D.
Source title:Tongxin Xuebao/Journal on Communication
Abbreviated source title:Tongxin Xuebao
Volume:27
Issue:8
Issue date:August 2006
Publication year:2006
Pages:45-51
Language:Chinese
ISSN:1000436X
Document type:Journal article (JA)
Publisher:Editorial Board of Journal on Communications
Abstract:The dynamical activates of low earth orbit (LEO) Walker constellation satellite network
topologies was quantified. The number and length of network snapshots were formulated
concisely. It compensates for the simplified topological assumptions in many LEO satellite
network related investigations. The thorough understanding of this basic feature not only provides
for an accurate quantification of network behavior, but also guides future constellation design for
satellite networks.
Number of references:21
Main heading:Satellite links
Controlled terms:Communication satellites - Geostationary satellites - Mobile telecommunication
systems - Satellite communication systems - Telecommunication networks - Topology - Wireless
telecommunication systems
Uncontrolled terms:Low earth orbit (LEO) - Network snapshots - Satellite network topology -
Topological dynamics - Walker constellation
Classification code:655.2.1 Communication Satellites - 716 Telecommunication; Radar, Radio and
Television - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory
Treatment:Applications (APP); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 192>
Accession number:20065010297329
Title:User-defined atomicity constraint: A more flexible transaction model for reliable service
composition
Authors:Xiaoning, Ding (1); Jun, Wei (1); Tao, Huang (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, China; (2)
Graduate School of Chinese Academy of Sciences, Beijing, China
Corresponding author:Xiaoning, D.
       (dxn@otcaix.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4260 LNCS
Monograph title:Formal Methods and Software Engineering - 8th International Conference on
Formal Engineering Methods, ICFEM 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:168-184
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540474609
ISBN-13:9783540474609
Document type:Journal article (JA)
Conference name:8th International Conference on Formal Engineering Methods, ICFEM 2006
Conference date:November 1, 2006 - November 3, 2006
Conference location:Macao, China
Conference code:68725
Publisher:Springer Verlag
Abstract:Transaction is the key mechanism to make service composition reliable. To ensure the
relaxed atomicity of transactional composite service (TCS), existing research depends on the
analysis to composition structure and exception handling mechanism. However, this approach can
not handle various application-specific requirements, and causes lots of unnecessary failure
recoveries or even aborts. In this paper, we propose a relaxed transaction model, including system
mode, relaxed atomicity criterion, static checking algorithm and dynamic enforcement algorithm.
Users can define different relaxed atomicity constraint for different TCS according to the specific
application requirements, including accepted configurations and the preference order. The
checking algorithm determines whether the constraint can be satisfied. The enforcement algorithm
monitors the execution and performs transaction management works according to the constraint.
Compared to existing work, our approach is flexible enough to handle complex application
requirements and performs the transaction management works automatically. We apply the
approach into web service composition language WS-BPEL and illustrate the above advantages
through a concrete example. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:17
Main heading:Constraint theory
Controlled terms:Algorithms - Computer system recovery - Data reduction - Data structures -
Interactive computer systems
Uncontrolled terms:Atomicity constraint - Failure recoveries - Service composition - Transactional
composite service (TCS)
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 722.4 Digital Computers and Systems - 723.2 Data Processing and
Image Processing
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 193>
Accession number:20063210056159
Title:Architectural level performance modeling of component system based on container
middleware
Authors:Zhang, Yong (1); Huang, Tao (1); Wei, Jun (1); Chen, Ning-Jiang (3)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Key Laboratory of Computer Sciences, Institute
of Software, Chinese Academy of Sciences, Beijing 100080, China; (3) College of Computer,
Electronic, and Information, Guangxi University, Nanning 530004, China
Corresponding author:Zhang, Y.
       (yzhang@otcaix.iscas.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:6
Issue date:June 2006
Publication year:2006
Pages:1328-1337
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:This paper analyzes the effect of Container style middleware on the structure and
performance of Component-based system based on architectural patterns, and proposes an
approach integrating Container style middleware components and their interaction relation into the
application UML (unified modeling language) models. The performance model derived from the
integrated UML models can reflect the impact of middleware. So, analysts do not have to know
the internal details of middleware at performance modeling. The architectural pattern-based
method can be extended to deal with various style middlewares. In the paper, the proposed
approach is illustrated by a case study.
Number of references:19
Main heading:Software engineering
Controlled terms:Architecture - Components - Containers - Middleware - Performance - Petri nets
- Queueing networks
Uncontrolled terms:Architecture pattern - Component based system - Container style middleware
- Layered queueing network (LQN) - Performance modeling - Software performance engineering -
Unified modeling language (UML)
Classification code:723 Computer Software, Data Handling and Applications - 921.4
Combinatorial Mathematics, Includes Graph Theory, Set Theory
Treatment:Applications (APP)
DOI:10.1360/jos171328
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 194>
Accession number:20064710251857
Title:Polar LEO satellite constellation measurement by delay probing
Authors:Wang, Junfeng (1); Zhou, Hongxia (3); Xu, Fanjiang (1); Zhou, Mingtian (2)
Author affiliation:(1) National Key Laboratory of Integrated Information System Technology,
Institute of Software, Chinese Academy of Sciences, Beijing, 100080, China; (2) College of
Computer Science and Engineering, University of Electronic Science and Technology of China,
Chengdu 610054, China; (3) Chongqing Communication Institute, Chongqing 400035, China
Corresponding author:Wang, J.
        (mailwangjf@yahoo.com.cn)

Source title:Conference Proceedings of the IEEE International Performance, Computing, and
Communications Conference
Abbreviated source title:Conf. Proc. IEEE Int. Perform. Comput. Commun. Conf.
Volume:2006
Monograph title:25th IEEE International Performance, Computing, and Communications
Conference, 2006, IPCCC 2006
Issue date:2006
Publication year:2006
Pages:303-310
Article number:1629421
Language:English
ISBN-10:1424401976
ISBN-13:9781424401970
Document type:Conference article (CA)
Conference name:25th IEEE International Performance, Computing, and Communications
Conference, 2006, IPCCC 2006
Conference date:April 10, 2006 - April 12, 2006
Conference location:Phoenix, AZ, United states
Conference code:68530
Publisher:Institute of Electrical and Electronics Engineers Inc.
Abstract:Low Earth Orbit (LEO) satellite networks are capable of providing wireless connectivity
seamlessly and continuously to any part of the world with guaranteed short round-trip propagation
delay. As a key part of Next Generation Network (NGN) infrastructure, next generation satellite
networks are expected to support a variety of applications with diverse performance requirements.
This paper argues that the constellation tomography for the LEO satellite network is a preliminary
step for efficient satellite network monitoring and performance promotion. To measure the
constellation, a divide-and-conquer mechanism is developed for each parameter estimation by
delay probing. The delay measurement is only carried out between two terminals located at the
same geographic positions. Performance evaluation on several popular polar LEO constellations
proves the accuracy and efficiency of the developed constellation tomography algorithms in
divide-and-conquer manner. The geographic position limitation of the delay probing terminals for
valid constellation inference is also analyzed in the paper. &copy; 2006 IEEE.
Number of references:18
Main heading:Satellite communication systems
Controlled terms:Algorithms - Parameter estimation - Telecommunication networks - Tomography
- Wireless telecommunication systems
Uncontrolled terms:Delay probing - Low Earth Orbit (LEO) satellite networks - Next Generation
Network (NGN) infrastructure
Classification code:655.2.1 Communication Satellites - 716 Telecommunication; Radar, Radio and
Television - 723.5 Computer Applications - 731.1 Control Systems
Treatment:Theoretical (THR)
DOI:10.1109/.2006.1629421
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 195>
Accession number:20063410082599
Title:Analysis and improvement of a multisecret sharing authenticating scheme
Authors:Wang, Gui-Lin (1); Qing, Si-Han (2)
Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China; (2) Engineering Research Center for Information Security
Technology, Chinese Academy of Sciences, Beijing 100080, China; (3) Institute for Infocomm
Research, Singapore 119613, Singapore
Corresponding author:Wang, G.-L.
Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:7
Issue date:July 2006
Publication year:2006
Pages:1627-1632
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:In a (t,n) secret sharing scheme, a dealer splits a secret into n shares and sends a share to
each of n participants. If necessary, any t members can provide their secret shares together and
recover the secret by using a publicly specified algorithm. Multisecret sharing schemes allow a
dealer to share multiple secrets among a group of participants securely and efficiently. In recent,
Shi proposed an efficient multisecret sharing authenticating scheme. In his scheme, not only the
shares held by the participants are reusable, but also the shares distributed by the dealer and the
shadow shares provided by the participants are verifiable. This paper analyzes the security of Shi's
scheme. It first points out a design error in his scheme, and then demonstrates an attack to show
that both of his share-authenticating and shadow-key-authenticating methods are insecure.
Specifically, using the attacks, a dishonest dealer can distribute false shares to participants, and
malicious participants can easily forge false shadow shares such that the authenticating equality is
satisfied. The result is that honest participants will be cheated and misled to believe that the
recovered secret is correct. In addition, improvements are provided to avoid the identified design
error and attacks.
Number of references:17
Main heading:Public key cryptography
Controlled terms:Cryptography - Security of data
Uncontrolled terms:Information security - Multisecret sharing - Publicly specified algorithm -
Secret sharing - Shadow key authenticating methods - Share authenticating
Classification code:723 Computer Software, Data Handling and Applications
Treatment:Applications (APP)
DOI:10.1360/jos171627
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 196>
Accession number:20081811228591
Title:Performance analysis and enhancement for priority based IEEE 802.11 network
Authors:Sheng, Lingzhi (1); Lei, Wen (1); Huangfu, Wei (1); Zhou, Xinyun (1); Cheng, Weiming
(1); Wu, Zhimei (1); Sun, Limin (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Science, Beijing 100080, China
Corresponding author:Sheng, L.
        (lingzhi02@ios.cn)

Source title:IEEE International Conference on Communications
Abbreviated source title:IEEE Int Conf Commun
Volume:10
Monograph title:2006 IEEE International Conference on Communications, ICC 2006
Issue date:2006
Publication year:2006
Pages:4768-4773
Article number:4024792
Language:English
ISSN:05361486
ISBN-10:1424403553
ISBN-13:9781424403554
Document type:Conference article (CA)
Conference name:2006 IEEE International Conference on Communications, ICC 2006
Conference date:July 11, 2006 - July 15, 2006
Conference location:Istanbul, Turkey
Conference code:71917
Publisher:Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:In this paper, a novel non-saturation analytical model for priority based IEEE 802.11
network is introduced. Unlike previous work that is focused on MAC backoff for saturation
stations, this model uses Markov and M/M/1/K theories to predict MAC and queuing service time
and loss. Then a performance prediction based enhancement scheme is proposed. By dynamic
tuning of protocol options, this proposed scheme limits end-to-end delay and loss rate of real-time
traffic and maximizes throughput. Consequently, call admission control is taken to protect existing
traffics when the channel is saturated. Simulations validate this model and the comparison with
IEEE802.11e EDCA shows that our mechanism can guarantee quality of service more efficiently.
&copy; 2006 IEEE.
Number of references:18
Main heading:Medium access control
Controlled terms:Network protocols - Quality of service - Queueing theory - Wireless local area
networks (WLAN)
Uncontrolled terms:Performance analysis - Real time traffic
Classification code:716 Telecommunication; Radar, Radio and Television - 722.3 Data
Communication, Equipment and Techniques - 723 Computer Software, Data Handling and
Applications - 922.1 Probability Theory
Treatment:Theoretical (THR)
DOI:10.1109/ICC.2006.255394
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 197>
Accession number:20064210177595
Title:Using Haj&#243;s' construction to generate hard graph 3-colorability instances
Authors:Liu, Sheng (1); Zhang, Jian (1)
Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China; (2) Graduate University, Chinese Academy of Sciences, Beijing
100049, China
Corresponding author:Liu, S.
       (lius@ios.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4120 LNAI
Monograph title:Artificial Intelligence and Symbolic Computation - 8th International Conference,
AISC 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:211-225
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540397280
ISBN-13:9783540397281
Document type:Conference article (CA)
Conference name:8th International Conference on Artificial Intelligence and Symbolic
Computation, AISC 2006
Conference date:September 20, 2006 - September 22, 2006
Conference location:Beijing, China
Conference code:68305
Publisher:Springer Verlag
Abstract:In this paper we propose a constructive algorithm using constraint propagation to
generate 4-critical graph units (4-CGUs) which have only one triangle as subgraph. Based on
these units we construct 4-critical graphs using Hajo&acute;s' join construction. By choosing
Grotztsch graph as the initial graph and carefully selecting the edge to be joined, we make sure
that the generated graphs are 4-critical and triangle-free. Experiments show that these graphs are
exceptionally hard for backtracking algorithms adopting Bre&acute;laz's heuristics. We also give
some preliminary analysis on the source of hardness. &copy; Springer-Verlag Berlin Heidelberg
2006.
Number of references:17
Main heading:Graph theory
Controlled terms:Algorithms - Constraint theory - Hardness - Heuristic methods
Uncontrolled terms:Backtracking algorithms - Colorability - Constraint propagation
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723 Computer Software, Data Handling and Applications - 921.4
Combinatorial Mathematics, Includes Graph Theory, Set Theory
Treatment:Theoretical (THR); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 198>
Accession number:20062910005625
Title:Universal cupping degrees
Authors:Li, Angsheng (0); Song, Yan (0); Wu, Guohua (0)
Corr. author affiliation:Institute of Software, Chinese Academy of Sciences, Beijing 100080,
China
Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3959 LNCS
Monograph title:Theory and Applications of Models of Computation - Third International
Conference, TAMC 2006, Proceedings
Publication year:2006
Pages:721-730
Language:English
ISSN:03029743
E-ISSN:16113349
Document type:Conference article (CA)
Conference name:3rd International Conference on Theory and Applications of Models of
Computation, TAMC 2006
Conference date:May 15 - 20 2006
Conference location:Beijing, China
Conference code:67762
Sponsor:National Natural Sciences Foundation of China; Chinese Academy of Sciences, Institute
of Software, China
Publisher:Springer Verlag, Heidelberg, Germany
Abstract:No abstract available
Number of references:16
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 199>
Accession number:20063110043082
Title:Curvature detail representation of triangular surfaces
Authors:Wu, Jin-Zhong (1); Liu, Xue-Hui (1); Wu, En-Hua (1)
Author affiliation:(1) State Key Lab. of Computer Science, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Department of Computer and Information
Science, University of Macau, Macau, China; (3) Graduate University, Chinese Academy of
Sciences, Beijing 100039, China
Corresponding author:Wu, J.-Z.
       (wjz@ios.ac.cn)

Source title:Journal of Zhejiang University: Science
Abbreviated source title:J Zhejiang Univ: Sci
Volume:7
Issue:7
Issue date:July 2006
Publication year:2006
Pages:1210-1214
Language:English
ISSN:10093095
CODEN:JZUSFR
Document type:Journal article (JA)
Publisher:Zhejiang University
Abstract:Curvature tells much about details of surfaces and is studied widely by researchers in the
computer graphics community. In this paper, we first explain the mean-curvature view of Dirichlet
energy of triangular surfaces and introduce a curvature representation of details, and then present
surfaces editing applications based on their curvature representation. We apply our method to
surfaces with complex boundaries and rich details. Results show the validity and robustness of our
method and demonstrate curvature map can be a helpful surfaces detail representation.
Number of references:19
Main heading:Computer graphics
Controlled terms:Data processing - Geometry - Optimization
Uncontrolled terms:Curvature - Detail representation - Dirichlet energy - Mesh editing - Shape
editing
Classification code:723.2 Data Processing and Image Processing - 723.5 Computer Applications -
921 Mathematics
Treatment:Applications (APP)
DOI:10.1631/jzus.2006.A1210
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 200>
Accession number:20063210056164
Title:QoS benefit driven scheduling framework for middleware
Authors:Zhang, Wen-Bo (1); Chen, Ning-Jiang (4); Wei, Jun (1); Huang, Tao (1)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Key Laboratory of Computer Science, Institute
of Software, Chinese Academy of Sciences, Beijing 100080, China; (3) Graduate School, Chinese
Academy of Sciences, Beijing 100049, China; (4) College of Computer, Electronic, and
Information, Guangxi University, Nanning 530004, China
Corresponding author:Zhang, W.-B.
       (wellday@otcaix.iscas.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:6
Issue date:June 2006
Publication year:2006
Pages:1381-1390
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:The first-come first-served scheduling framework adopted by most application servers
has been proved to be inappropriate for dealing with unexpected overload for Internet-oriented
Web applications. Considering the deficiency of the existing work from the architecture view, this
paper presents a scheduling framework based on the notion of QoS benefits, which contains
several cooperating components to guarantee the QoS requirements of the applications. The QoS
benefits used to evaluate the QoS guarantee provided by the server according to the QoS
requirements of the applications and the resource management based on the QoS benefits will help
to provide a better QoS guarantee. Experimental results confirm the efforts on the OnceAS
application Server.
Number of references:13
Main heading:Quality of service
Controlled terms:Applications - Components - Internet - Middleware - Scheduling - Servers
Uncontrolled terms:First come first served - Quality of service (QoS) benefit - Resource
management - Scheduling framework - Web application server
Classification code:717 Optical Communication - 722 Computer Systems and Equipment - 723.1
Computer Programming
Treatment:Applications (APP)
DOI:10.1360/jos171381
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 201>
<RECORD 1>
Accession number:20064110162028
Title:Completing UML model of component-based system with middleware for performance
evaluation
Authors:Zhang, Yong (1); Chen, Ningjiang (1); Wei, Jun (1); Huang, Tao (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences
Corresponding author:Zhang, Y.
       (yzhang@otcaix.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4097 LNCS
Monograph title:Emerging Directions in Embedded and Ubiquitous Computing - EUC 2006
Workshops: NCUS, SecUbiq, USN, TRUST, ESO, and MSA, Proceedings
Issue date:2006
Publication year:2006
Pages:72-82
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540368507
ISBN-13:9783540368502
Document type:Conference article (CA)
Conference name:EUC 2006: Embedded and Ubiquitous Computing Workshops
Conference date:August 1, 2006 - August 4, 2006
Conference location:Seoul, Korea, Republic of
Conference code:68259
Publisher:Springer Verlag
Abstract:To free analysts from knowing about the internal details of middleware when evaluating
the performance of component-based system (CBS), this paper proposes a framework to
automatically integrate middleware component interactions and their performance attributes to
application Unified Model Language (UML) model. The framework defines a general sub-model
template library of middleware, a middleware usage description file, and an approach to
compositing application-specific sub-model instances and application UML models. The process
is illustrated by a case study. &copy; IFIP International Federation for Information Processing
2006.
Number of references:18
Main heading:Computer programming languages
Controlled terms:Artificial intelligence - Data processing - File organization - Libraries -
Mathematical models - Middleware
Uncontrolled terms:Component based systems (CBS) - Performance evaluation - Sub model
template libraries - Unified Model Languages (UML)
Classification code:723.1.1 Computer Programming Languages - 723.2 Data Processing and
Image Processing - 723.4 Artificial Intelligence - 903.4.1 Libraries - 921 Mathematics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 202>
Accession number:20064110162203
Title:Segmental semi-Markov model based online series pattern detection under arbitrary time
scaling
Authors:Ling, Guangjie (1); Qian, Yuntao (1); Jia, Sen (1)
Author affiliation:(1) College of Computer Science, Zhejiang University, Hangzhou, 310027,
China; (2) State Key Laboratory of Information Security, Institute of Software, Chinese Academy
of Sciences, Beijing, 100049, China
Corresponding author:Ling, G.
       (balley_ling@163.com)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4093 LNAI
Monograph title:Advanced Data Mining and Applications - Second International Conference,
ADMA 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:731-740
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540370250
ISBN-13:9783540370253
Document type:Conference article (CA)
Conference name:2nd International Conference on Advanced Data Mining and Applications,
ADMA 2006
Conference date:August 14, 2006 - August 16, 2006
Conference location:Xi'an, China
Conference code:68257
Publisher:Springer Verlag
Abstract:Efficient online detection of similar patterns under arbitrary time scaling of a given time
sequence is a challenging problem in the real-time application field of time series data mining.
Some methods based on sliding window have been proposed. Although their ideas are simple and
easy to realize, their computational loads are very expensive. Therefore, model based methods are
proposed. Recently, the segmental semi-Markov model is introduced into the field of online series
pattern detection. However, it can only detect the matching sequences with approximately equal
length to that of the query pattern. In this paper, an improved segmental semi-Markov model,
which can solve this challenging problem, is proposed. And it is successfully demonstrated on real
data sets. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:12
Main heading:Mathematical models
Controlled terms:Data mining - Markov processes - Online systems - Problem solving - Query
languages - Real time systems - Time series analysis
Uncontrolled terms:Online series pattern detection - Semi-Markov model - Time series data
mining
Classification code:922.2 Mathematical Statistics - 922.1 Probability Theory - 921 Mathematics -
723.4 Artificial Intelligence - 723.2 Data Processing and Image Processing - 723.1.1 Computer
Programming Languages - 722.4 Digital Computers and Systems
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 203>
Accession number:2006129773015
Title:Domain model of pen-based user interface software and its usage
Authors:Qin, Yan-Yan (1); Tian, Feng (1); Wang, Xiao-Chun (1); Dai, Guo-Zhong (1)
Author affiliation:(1) Laboratory of Human-Computer Interaction and Intelligent Information
Processing, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Qin, Y.-Y.
       (yanyan02@iscas.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:1
Issue date:January 2006
Publication year:2006
Pages:69-78
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:Pen-Based user interface software is widely applicable due to its natural and efficient
interaction style, whose important characteristics are interaction-centered and individual by
user-required. In order to map the intention of users into the designs exactly and efficiently,
PUIDM (Pen based User Interfaces software Domain Model) is presented, which is described and
analyzed from the aspects of context, component, UI features and architecture, and implemented
based on XML. Moreover, a user-centered design process based on the PUIDM is introduced.
Experiments show that PUIDM can guide the process of design exactly and efficiently and make
the designed software achieve the demand of usability.
Number of references:25
Main heading:Software engineering
Controlled terms:Components - Computer architecture - Design - Mathematical models - User
interfaces - XML
Uncontrolled terms:Context analysis - Domain models - End users - Pen based user interface
software - User centered design
Classification code:722.2 Computer Peripheral Equipment - 723.1 Computer Programming - 921
Mathematics
Treatment:Applications (APP)
DOI:10.1360/jos170069
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 204>
Accession number:20065110317325
Title:An event composite matching approach based on the OBDD graphs
Authors:Xu, Gang (1); Ma, Jiangang (1); Huang, Tao (1)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Xu, G.
       (xugang@otcaix.iscas.ac.cn)

Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development
Abbreviated source title:Jisuanji Yanjiu yu Fazhan
Volume:43
Issue:10
Issue date:October 2006
Publication year:2006
Pages:1751-1759
Language:Chinese
ISSN:10001239
CODEN:JYYFEY
Document type:Journal article (JA)
Publisher:Science Press
Abstract:One crucial issue of content-based Pub/Sub systems is the content-based event matching.
The existing approaches that utilize simple constraints to match the contents of events are not
enough. For example, in the enterprise application integration scenarios, the event matching is
often 'many-to-one' matching or 'one-to-many' matching. Therefore, traditional matching
approaches should be extended to solve the complex matching problems. After analyzing
information matching patterns in enterprise application integration, three matching models are
proposed, the simple matching is extended to the multi-semantic matching, and the temporal
constraint variable is introduced. The operations differ in accordance with the different semantics;
the discrete events are supported by the temporal constraint variable. Then, OBDD graphs are
extended into hierarchy colored OBDD graphs and the equality of the transformation is further
proved. Based on the extended OBDD graphs, the composite matching algorithms are presented
and analyzed. Experiments show that the proposed algorithms are effectual.
Number of references:25
Main heading:Enterprise resource planning
Controlled terms:Algorithms - Boolean algebra - Constraint theory - Content based retrieval -
Data processing - Data structures - Information analysis - Information management - Semantics
Uncontrolled terms:Complex matching - Composite matching - Discrete events - Enterprise
application integration - Event matching - Extended OBDD graphs - Hierarchy colored OBDD
graphs - Information matching pattern - Many one matching - Matching algorithm - Multi
semantic matching - One many matching - Pub Sub system - Simple constraint - Temporal
constraint variable - Transformation equality
Classification code:921.1 Algebra - 912.2 Management - 903.2 Information Dissemination - 903.1
Information Sources and Analysis - 723.3 Database Systems - 723.2 Data Processing and Image
Processing - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory,
Programming Theory
Treatment:Applications (APP); Experimental (EXP)
DOI:10.1360/crad20061012
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 205>
Accession number:20064510226363
Title:Verifiable partial key escrow for PKI
Authors:Zhuang, Yong (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Zhuang, Y.
        (zhuangyong00@ios.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:9
Issue date:September 2006
Publication year:2006
Pages:1584-1589
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:Verifiable partial key escrow scheme for PKI balances the needs of individuals with the
needs of the trustees. It's verifiable therefore users can not cheat the trustees, and partial key
escrow scheme limits the possibility of the trustees to abuse their power. At the same time, it
implements a distributed algorithm to generate user's key and never leaks any information of
user's partial key. So it can also avoid the danger of 'subliminal attack' and 'early recovery'.
Number of references:13
Main heading:Public key cryptography
Controlled terms:Algorithms - Identification (control systems) - Information management -
Requirements engineering - Security of data - Threshold logic
Uncontrolled terms:Early recovery - Individual need - Partial key escrow - PKI - RSA -
Subliminal attack - Trustee need - Verifiable
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.2 Data Processing and Image Processing - 731.1 Control
Systems - 912.2 Management - 921 Mathematics
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 206>
Accession number:20070610415138
Title:Design of intelligent dynamic geometric software based on the enhanced LIMD arithmetic
Authors:Lin, Qiang (1); Ren, Lei (1); Chen, Ying (2); Fan, Ke-Feng (3); Dai, Guo-Zhong (1)
Author affiliation:(1) Intelligence Engineering Laboratory, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) National Laboratory of Pattern Recognition,
Institute of Automation, Chinese Academy of Sciences, Beijing 100080, China; (3) Chinese
Electronics Standardization Institute, Beijing 100007, China
Corresponding author:Lin, Q.
        (nine_suns@sina.com)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:12
Issue date:December 2006
Publication year:2006
Pages:2163-2171
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press, 18,Shuangqing Street,Haidian, Beijing, 100085, China
Abstract:Geometric constraint solving (GCS) is one of the key techniques of the current work of
developing a new generation of intelligent and parametric CAD systems. It is used to give
designers a way to generate the engineering drawings automatically. It has many properties, for
example; Dragging the object freely, dynamic generation, the dynamic measure, and the dynamic
locus generation. Locus Intersection Method of dimension d(LIMD) is a typical algorithm used in
the area in GCS, This paper extended this algorithm and have the widen range to solve problem,
and get the satisfaction effect.
Number of references:15
Main heading:Computer aided design
Controlled terms:Algorithms - Computer graphics - Constraint theory - Geometry
Uncontrolled terms:Dynamic generation - Dynamic measure - Engineering drawing - Freely
dragging - Geometric constraint solving (GCS) - Intelligent dynamic geometric software - Locus
intersection method dimension (LIMD) - Parametric computer aided design (CAD)
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.5 Computer Applications - 921.4 Combinatorial Mathematics,
Includes Graph Theory, Set Theory
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 207>
Accession number:2006239925225
Title:Cryptanalysis of the TAE mode and its improvement
Authors:Wang, Peng (1); Feng, Deng-Guo (1)
Author affiliation:(1) State Key Laboratory of Information Security, Graduate School, Chinese
Academy of Sciences, Beijing 100049, China; (2) State Key Laboratory of Information Security,
Institution of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Wang, P.
         (zrockingz@yahoo.com.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:2
Issue date:February 2006
Publication year:2006
Pages:333-338
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:The TAE (tweakable authenticated encryption) mode is an authenticated encryption
mode which is based on a tweakable block cipher. Previous research results show that the secure
tweakable block cipher is not sufficient for the security of the authenticated encryption TAE mode.
Only when the tweakable block cipher is strong will the TAE be secure. Some improvements to
the TAE mode are also given in this paper, resulting in a MTAE (modified tweakable authenticated
encryption) mode with security proof.
Number of references:5
Main heading:Security of data
Controlled terms:Algorithms - Cryptography - Improvement - Theorem proving
Uncontrolled terms:Cryptanalysis - Diversification parameter - Mode improvement - Randomiser
- Security analysis - Security proof - Tweakable authenticated encryption (TAE) mode -
Tweakable block cipher
Classification code:716 Telecommunication; Radar, Radio and Television - 717 Optical
Communication - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.2 Data Processing and Image Processing - 723.4 Artificial
Intelligence - 921 Mathematics
Treatment:Applications (APP)
DOI:10.1360/jos170333
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 208>
Accession number:2006229911999
Title:Design of Mongolian operating system within the framework of internationalization
Authors:Rui, Jianwu (1); Wu, Jian (1); Sun, Yufang (1)
Author affiliation:(1) Open System and Chinese Information Processing Center, Institute of
Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Rui, J.
       (jianwu02@iscas.cn)

Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development
Abbreviated source title:Jisuanji Yanjiu yu Fazhan
Volume:43
Issue:4
Issue date:April 2006
Publication year:2006
Pages:716-721
Language:Chinese
ISSN:10001239
CODEN:JYYFEY
Document type:Journal article (JA)
Publisher:Science Press
Abstract:To implement traditional Mongolian operating system is more difficult and more costly.
It lies in two issues: (1) Mongolian characters always transform their shapes within different
context of text; (2) Mongolian text is written from top to bottom and all columns are arranged
from left to right. The first issue involves many characteristics of this script, which make the
display of Mongolian text rather complex. The second issue results in special requirements for
human-computer interaction, which are not supported by operating systems currently. First, some
characteristics of Mongolian script are analyzed. Second, technical details to design a traditional
Mongolian operating system are discussed, which include character set and its encoding scheme,
transformation of traditional Mongolian characters, text display in a vertical style and graphical
user interface special to Mongolian users. Some challenges are discussed and related solutions are
presented. Third, an implementation example of operating system to support traditional
Mongolian based on Qt/KDE is described in brief. Finally, some work to be done is proposed.
Number of references:7
Main heading:Computer operating systems
Controlled terms:Character sets - Feature extraction - Graphical user interfaces - Human computer
interaction - Technical writing
Uncontrolled terms:Encoding scheme - Internationalization - Metaphor - Mongolian characters -
Traditional mongolian - Transformed forms - Unicode - Vertical writing
Classification code:716 Telecommunication; Radar, Radio and Television - 722.2 Computer
Peripheral Equipment - 723.5 Computer Applications - 903.2 Information Dissemination
Treatment:Applications (APP)
DOI:10.1360/crad20060422
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 209>
Accession number:20070410388912
Title:Research of observer sitting based on multi-resolution grid data
Authors:Lu, Pin (0); Zhang, Jin-Fang (0); Lu, Min (0)
Corresponding author:Lu, P.
Corr. author affiliation:National Key Laboratory of Integrated Information System Technology,
Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Source title:Xitong Fangzhen Xuebao / Journal of System Simulation
Abbreviated source title:Xitong Fangzhen Xuebao
Volume:18
Issue:12
Issue date:December 2006
Publication year:2006
Pages:3444-3447+3462
Language:Chinese
ISSN:1004731X
CODEN:XFXUFS
Document type:Journal article (JA)
Publisher:Acta Simulata Systematica Sinica, Beijing, China
Abstract:The observer sitting problem is important in terrain visibility analysis and it is widely
used in military, telecom, animal protection and so on. Based on problem modeling and analysis of
simulation computing complexity, through the analysis of the multi-resolution terrain data's
influence on observer sitting problem, combined with the simulated annealing algorithm, an
optimal solution was developed based on the multi-resolution terrain grid data. Experiment results
show that without loss of precision, the simulation time cost reduces by 50%-60% when compared
with the one only using the traditional SA.
Number of references:8
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 210>
Accession number:20062910005903
Title:Simulation of miscible binary mixtures based on lattice Boltzmann method
Authors:Zhu, Hongbin (1); Liu, Xuehui (2); Liu, Youquan (6); Wu, Enhua (2)
Author affiliation:(1) State Key Laboratory of Computer Science, Institute of Software, Chinese
Academy of Sciences, Beijing, China; (2) Institute of Software, Chinese Academy of Sciences; (3)
University of Macao; (4) Computer and Information Science Department, UM; (5) IEEE; (6)
ACM
Corresponding author:Zhu, H.
        (zhuhb@ios.ac.cn)

Source title:Computer Animation and Virtual Worlds
Abbreviated source title:Comput. Anim. Virtual Worlds
Volume:17
Issue:3-4
Issue date:July 2006
Publication year:2006
Pages:403-410
Language:English
ISSN:15464261
E-ISSN:1546427X
Document type:Journal article (JA)
Publisher:John Wiley and Sons Ltd
Abstract:Miscible fluid mixtures, like pouring honey into water, Coca Cola into strong wine, are
common phenomena in our daily life. While two miscible fluids are mixed together, their
appearances in terms of colors and shapes will change due to their mixing interaction. The
interaction between the mixture components could be regarded as a combination of the diffusing
process and demixing process. If the former dominates the interaction, it is miscible; otherwise, it
is immiscible. The complex microscopic interplay between the mixture components makes the
simulation highly challenging. So far, there have been some dedicated research in computer
graphics dealing with immiscible mixtures, but few works have been done focusing on miscible
mixtures. In this paper, for the first time, we introduce a two-fluid lattice Boltzmann method
(LBM), called TFLBM, applied to miscible binary mixtures. Different from other similar methods,
the viscous and diffusing properties of the fluid in our work are considered separately, so that the
physical insight is exposed more clearly and rationally. In addition, the operation of LBM is
mostly a linear local computation, and graphics processing unit (GPU) has been utilized to achieve
real-time simulation. Copyright &copy; 2006 John Wiley &amp; Sons, Ltd.
Number of references:29
Main heading:Binary mixtures
Controlled terms:Computation theory - Computer simulation - Diffusion - Graphic methods -
Mixing - Solubility - Viscosity
Uncontrolled terms:Graphics processing unit - Lattice boltzmann model - Miscible binary mixture
Classification code:931.1 Mechanics - 804 Chemical Products Generally - 802.3 Chemical
Operations - 801.4 Physical Chemistry - 723.5 Computer Applications - 721.1 Computer Theory,
Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 631.1 Fluid
Flow, General
Treatment:Theoretical (THR)
DOI:10.1002/cav.143
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 211>
Accession number:20064310201255
Title:New cheating immune secret sharing function
Authors:Zhang, Wen-Ying (1); Wu, Chuan-Kun (1); Lei, Hong (2)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) School of Mathematics and System Sciences,
Shandong University, Jinan 250100, China
Corresponding author:Zhang, W.-Y.
       (wenyingzh@sohu.com)

Source title:Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and
Telecommunications
Abbreviated source title:Beijing Youdian Daxue Xuebao
Volume:29
Issue:4
Issue date:August 2006
Publication year:2006
Pages:54-56
Language:Chinese
ISSN:10075321
CODEN:BYXBEV
Document type:Journal article (JA)
Publisher:Beijing University of Posts and Telecommunications
Abstract:The cryptographic model of cheating immune secret sharing function is introduced. By
using injective functions, it proposes a new method for the construction of cheating-immune secret
sharing which has the form f(x,y) = x&middot&pi;(y). It gives a sufficient and necessary
condition for a quadratic Boolean function to be cheating-immune. It improves the conclusions
given by Josef Pieprzyk.
Number of references:7
Main heading:Cryptography
Controlled terms:Boolean functions - Construction
Uncontrolled terms:Cheating immune - Injective functions - Josef Pieprzyk - Quadratic Boolean
function - Resilient function - Secret sharing
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723 Computer Software, Data Handling and Applications
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 212>
Accession number:2006219897358
Title:GPU-based realistic fur rendering
Authors:Yang, Gang (1); Sun, Han-Qiu (2); Wang, Wen-Cheng (1); Wu, En-Hua (1)
Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China; (2) Department of Computer Science and Engineering, Chinese
University of Hong Kong, Hong Kong, Hong Kong; (3) Department of Computer and Information
Science, Faculty of Science and Technology, University of Macau, Macao, China; (4) Graduate
School, Chinese Academy of Sciences, Beijing 100049, China
Corresponding author:Yang, G.
       (yg@ios.ac.cn)
Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:3
Issue date:March 2006
Publication year:2006
Pages:577-586
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:Based on the multi-layer textures approach, a new method of rendering real-time fur is
proposed. The method takes full advantage of the new features of current Graphic Processing
Units to compute the lighting of fur precisely and fast. More importantly, the self-shadow effect of
fur and the soft shadow phenomenon over fur are simulated successfully, which enhances the
rendering effects greatly. Experiments show that the method can deal with moderate models in
real-time, which is very valuable for the applications of fur in many fields, such as cinema, video
game and virtual reality etc.
Number of references:18
Main heading:Graphic methods
Controlled terms:Computer graphics - Lighting - Textures - Virtual reality
Uncontrolled terms:Cinema - Fragment shader - Fur - Graphic Processing Units - Hardware based
rendering - Opacity shadow maps - Real time - Realistic image synthesis - Soft shadow - Video
game
Classification code:707 Illuminating Engineering - 723 Computer Software, Data Handling and
Applications - 933 Solid State Physics
Treatment:Applications (APP)
DOI:10.1360/jos170577
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 213>
Accession number:20074210870938
Title:Jenova: New approach on concurrency control in web service transaction management
Authors:Guan, Heqing (1); Wan, ShuChao (1); Wei, Jun (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, China; (2)
Graduate School, Chinese Academy of Sciences, Beijing, China
Corresponding author:Guan, H.
        (ghq@otcaix.iscas.ac.cn)

Source title:Proceedings - Second IEEE International Symposium on Service-Oriented System
Engineering, SOSE 2006
Abbreviated source title:Proc. Second IEEE Int. Symp. Serv.-Oriented Syst. Eng.
Monograph title:Proceedings - Second IEEE International Symposium on Service-Oriented
System Engineering, SOSE 2006
Issue date:2006
Publication year:2006
Pages:134-140
Article number:4027129
Language:English
ISBN-10:0769527264
ISBN-13:9780769527260
Document type:Conference article (CA)
Conference name:2nd IEEE International Symposium on Service-Oriented System Engineering,
SOSE 2006
Conference date:October 25, 2006 - October 26, 2006
Conference location:Shanghai, China
Conference code:70356
Sponsor:IEEE Computer Society Technical Committee
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:The existed web service transaction (WST) models and protocols depend too much on
web service providers when solving concurrent conflicts or performing rollback, which make
individual service providers bear big burden, and the cost for rolling back a WST may be very
high. In this paper, we present a novel concurrency control mechanism named Jenova, which
incorporates two enhancements to support WSTs: nested transactions and admission control.
Jenova can provide a higher degree of concurrency for WSTs and the cost of rollback can be
greatly decreased. The prototypal framework on the J2EE platform and the experiments prove the
efficiency of the mechanism. &copy; 2006 IEEE.
Number of references:18
Main heading:Web services
Controlled terms:Access control - Concurrency control - Cost effectiveness - Information
management - Internet service providers
Uncontrolled terms:Rollbacks - Web service providers
Classification code:723 Computer Software, Data Handling and Applications - 723.3 Database
Systems - 911.2 Industrial Economics - 912.2 Management
Treatment:Theoretical (THR)
DOI:10.1109/SOSE.2006.18
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 214>
Accession number:2006129772961
Title:State-of-the-art of research on block cipher mode of operation
Authors:Wu, Wen-Ling (1); Feng, Deng-Guo (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Wu, W.-L.
       (wwl@is.iscas.ac.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:1
Issue date:January 2006
Publication year:2006
Pages:21-36
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:A mode of operation, or mode, for short, is an algorithm that features the use of a
symmetric key block cipher algorithm to provide an information service, such as confidentiality or
authentication. A good mode can remedy some weaknesses of block cipher, on the other hand, a
poorly designed mode may be insecure even though the underlying block cipher is good. The
research of mode always goes with the development of block cipher. With the advent of new block
ciphers, there is a need to update long-standing modes of operation and an opportunity to consider
the development of new modes. From the ECB, CBC, CFB and OFB modes of DES to CTR,
CCM, CMAC, GCM and AESKW modes of AES, the authors introduce the design rationales,
security model, research results and the state-of-the-art of research on block cipher mode of
operation in this paper.
Number of references:108
Main heading:Cryptography
Controlled terms:Functions - Information services - Security systems
Uncontrolled terms:Authentication - Block cipher - Encryption - Hash function - Mode of
operation
Classification code:723 Computer Software, Data Handling and Applications - 903.4 Information
Services - 914.1 Accidents and Accident Prevention - 921 Mathematics
Treatment:General review (GEN)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 215>
Accession number:2006209882909
Title:Improved role based access control
Authors:Gan, Quan (0); He, Yeping (0); Han, Naiping (0)
Corr. author affiliation:Engineering and Research Center for Information Security Technology,
Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Source title:Jisuanji Gongcheng/Computer Engineering
Abbreviated source title:Jisuanji Gongcheng
Volume:32
Issue:7
Issue date:Apr 5 2006
Publication year:2006
Pages:140-142+168
Language:Chinese
ISSN:10003428
CODEN:JISGEV
Document type:Journal article (JA)
Publisher:Shanghai Computer Society, Shanghai, China
Abstract:This paper introduces the basic concept of RBAC by the exemplification of four level
models, then analyzes the shortcomings of traditional RBAC in the background of gradual
enlargement of enterprise scale. Finally it refers the idea of domain and type of the DTE model
and shows a way to solve it by introducing the parameters of subject's attribute and object's
attribute. This way can reduce the number of the role and the complexity of role's management
and it can establish the foundation for further solving such problems as the role conflict.
Number of references:6
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 216>
Accession number:20062910011057
Title:Using a neural networking method to predict the protein phosphorylation sites with specific
kinase
Authors:Zhang, Kunpeng (1); Xu, Yun (1); Shen, Yifei (1); Chen, Guoliang (1)
Author affiliation:(1) Department of Computer Science, University of Science and Technology of
China, 230026 Hefei, China; (2) Laboratory of Computer Science, Institute of Software, Chinese
Academy of Sciences, 100080 Beiing, China
Corresponding author:Zhang, K.
       (kpzhang@mail.ustc.edu.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3973 LNCS
Monograph title:Advances in Neural Networks - ISNN 2006: Third International Symposium on
Neural Networks, ISNN 2006, Proceedings - Part III
Issue date:2006
Publication year:2006
Pages:682-689
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540344829
ISBN-13:9783540344827
Document type:Conference article (CA)
Conference name:3rd International Symposium on Neural Networks, ISNN 2006 - Advances in
Neural Networks
Conference date:May 28, 2006 - June 1, 2006
Conference location:Chengdu, China
Conference code:67771
Publisher:Springer Verlag
Abstract:Protein phosphorylation at Serine(S), Threonine(T) or Tyrosine(Y) residues is an
important reversible post-translational modification, and it is an important mechanism for
modulating(regulating) many cellular processes such as proliferation, differentiation and apoptosis.
Experimental identification of phosphorylation site is labor-intensive and often limited by the
availability and optimization of enzymatic reaction. In silico prediction methods may facilitate the
identification of potential phosphorylation sites with ease. Methods based on primary protein
sequences is much desirable and popular for its convenience and fast speed. It is obvious that
structural-based methods show excellent performance, however, the 3-D structure information of
protein is very limited compared to the huge number of protein in the public databases. Here we
present a novel and accurate computational method named NNPhosPhoK: sequence and
structural-based neural network method of protein phosphorylation sites prediction with
considering specific kinase. The data in this paper is from Phospho.ELM[1].We test NNPhosPhoK
with both simulational and real data, whatever in speed or in accuracy, we can realize that
NNPhosPhoK shows greater computational ability with superior performance compared to two
existing phosphorylation sites prediction system: ScanSite 2.0[2] and PredPhospho[3]. &copy;
Springer-Verlag Berlin Heidelberg 2006.
Number of references:21
Main heading:Neural networks
Controlled terms:Cells - Chemical reactions - Computer simulation - Database systems - Enzymes
- Proteins
Uncontrolled terms:IKK - Phosphorylation site predicting - PKA - Protein kinase - Protein
structure
Classification code:461.2 Biological Materials and Tissue Engineering - 723.3 Database Systems -
723.4 Artificial Intelligence - 723.5 Computer Applications - 802.2 Chemical Reactions - 804.1
Organic Compounds
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 217>
Accession number:20070610415150
Title:Determination of stress field on the cylindrical bar by parallel CG_DY
Authors:Wang, Jian (1); Chi, Xue-Bin (2); Zhang, Zhi-Yue (4)
Author affiliation:(1) China Remote Sensing Satellite Ground Station, Beijing 100086, China; (2)
Supercomputing Center, Computer Network Information Center, CAS, Beijing 100080, China; (3)
Institute of Software, CAS, Beijing 100080, China; (4) Nanjing Normal University, Nanjing
210097, China
Corresponding author:Wang, J.
Source title:Jisuan Lixue Xuebao/Chinese Journal of Computational Mechanics
Abbreviated source title:Jisuan Lixue Xuebao
Volume:23
Issue:6
Issue date:December 2006
Publication year:2006
Pages:674-677
Language:Chinese
ISSN:10074708
CODEN:JLXIAB
Document type:Journal article (JA)
Publisher:Science Press, 18,Shuangqing Street,Haidian, Beijing, 100085, China
Abstract:Nonlinear conjugate gradient method proposed by Dai and Yuan, called CG_DY, is
implemented in parallel in this paper. CG_DY uses different method to compute the key parameter
&beta;. First, the algorithm principle and programming method are discussed. Second, parallel
line search and vector inner product are introduced into the algorithm implementation, which is
applied to solve the elastic plastic torsion problem which arises from the determination of the
stress field on an infinitely long cylindrical bar. A finite element approximation to the torsion
problem is used and one problem with up to 1, 048, 576 variables is generated. Finally, we show
the performance results on the Dawning 2000 and Deep Comp 6800 with the number of
processors from 1 to 64, respectively. From the results, we can see that the method has good
scalability and parallel efficiency.
Number of references:7
Main heading:Stresses
Controlled terms:Algorithms - Approximation theory - Finite element method - Gradient methods
- Optimization - Parallel processing systems - Plastics - Torsional stress - Vectors
Uncontrolled terms:Cylindrical bars - Elastic plastic torsion - Finite element approximation -
Nonlinear conjugate gradient methods - Parallel line search - Stress fields - Unconstrained
optimization - Vector inner products
Classification code:408.1 Structural Design, General - 421 Strength of Building Materials;
Mechanical Properties - 722.4 Digital Computers and Systems - 723 Computer Software, Data
Handling and Applications - 921 Mathematics
Treatment:Applications (APP); Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 218>
Accession number:20063810123786
Title:UPIM: A user-centered pen-based interactive system
Authors:Wang, Xiaochun (1); Tian, Feng (1); Qin, Yanyan (1); Dai, Guozhong (1)
Author affiliation:(1) Laboratory of Human-Computer Interaction and Intelligent Information
Processing, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Wang, X.
       (xiaochun02@iscas.cn)

Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development
Abbreviated source title:Jisuanji Yanjiu yu Fazhan
Volume:43
Issue:8
Issue date:August 2006
Publication year:2006
Pages:1337-1344
Language:Chinese
ISSN:10001239
CODEN:JYYFEY
Document type:Journal article (JA)
Publisher:Science Press
Abstract:Pen-based user interface (PUI) is a primary style in the post-WIMP world, which has
many potential advantages such as naturalness and being easy to use and to learn. However, the
application-centered software design method cannot ensure the pen-based user interface to keep
these advantages when pen-based interactive system is developed. Hence, a software design
communication model is first analyzed. Then, based on this model, a user-centered software
design method is presented, which is described in detail through the scientific diving training
management system. The evaluations of the practical systems show that the method can
effectively improve the usability of pen-based interactive systems.
Number of references:15
Main heading:Human computer interaction
Controlled terms:Communication - Software engineering - User interfaces - XML
Uncontrolled terms:Pen based interactive system - Pen based user interface (PUI) - Scientific
diving training management system - Software design - UPIM - User centered - User model
Classification code:716 Telecommunication; Radar, Radio and Television - 722.2 Computer
Peripheral Equipment - 723 Computer Software, Data Handling and Applications
Treatment:Applications (APP)
DOI:10.1360/crad20060805
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 219>
Accession number:20064710258553
Title:Design of velocity saturation servo system based on feedback-linearization and variable
structure control
Authors:Yan, Hai-Bo (1); Guo, Ke (1); Wang, Mao-Zhi (1); Mao, Wan-Biao (2); She, Chun-Dong
(3)
Author affiliation:(1) School of Management of Information, CDUT, Chengdu 610059, China; (2)
Department of Technology, XSLC, Xichang 615000, China; (3) Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (4) Xinjiang Institute of Finance and Economics,
Urumqi 830012, China
Corresponding author:Yan, H.-B.
Source title:Yuhang Xuebao/Journal of Astronautics
Abbreviated source title:Yuhang Xuebao
Volume:27
Issue:4
Issue date:July 2006
Publication year:2006
Pages:616-619
Language:Chinese
ISSN:10001328
CODEN:YUXUD6
Document type:Journal article (JA)
Publisher:China Spaceflight Society
Abstract:The Non-linear of velocity-saturation of the servo-system is very obviously for great
attitude fly of the rocket, which take the great influence of the stability of the rocket s attitude
control system. There is difficulty we analysis the non-linear of velocity-saturation of the
servo-system with the small-perturbation Theory. So, we accurately linearize the model of
velocity-saturation of the servo-system with the method of input-output feedback-linearization,
and then the variable structure control is used for the linearization system. In this way, we obtain
the robust controller of nonlinear Servo-system. Finally, the simulation results show this means is
effective.
Number of references:9
Main heading:Servomechanisms
Controlled terms:Control equipment - Feedback - Linearization - Rockets - Stability - Velocity
Uncontrolled terms:Feedback linearization - Great attitude - Robust controller - Servo system -
Sliding mode - Variable structure control - Velocity saturation
Classification code:654.1 Rockets and Missiles - 731.1 Control Systems - 732.1 Control
Equipment
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 220>
Accession number:2006219897343
Title:Using MST in handwritten Chinese characters segmentation
Authors:Han, Yong (1); Xu, De (1); Dai, Guo-Zhong (2)
Author affiliation:(1) School of Computer and Information Technology, Beijing Jiaotong
University, Beijing 100044, China; (2) Laboratory of Human-Computer Interaction and Intelligent
Information Processing, Institute of Software, Chinese Academy of Sciences, Beijing 100080,
China
Corresponding author:Han, Y.
       (hanyong_sc@hotmail.com)
Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:3
Issue date:March 2006
Publication year:2006
Pages:403-409
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:Handwritten Chinese characters segmentation is to process strokes based on its spatial
relations to form character elements for recognition. This paper introduces a method to segment
Chinese characters according to the topological relations of Chinese component and minimal span
tree of strokes. The experiment shows that this new method can achieve good performance. The
accuracy of segmentation is over 91.6%.
Number of references:11
Main heading:Character recognition
Controlled terms:Character recognition equipment - Neural networks - Topology
Uncontrolled terms:Character segmentation - Component structure - Handwritten Chinese
character - Minimal span tree (MST) - Online recognition - Process strokes - Spatial relations
Classification code:722.2 Computer Peripheral Equipment - 723 Computer Software, Data
Handling and Applications - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set
Theory
Treatment:Applications (APP)
DOI:10.1360/jos170403
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 221>
<RECORD 1>
Accession number:20062910005614
Title:Object-oriented specification composition and refinement via category theoretic
computations
Authors:Zheng, Yujun (1); Xue, Jinyun (2); Liu, Weibo (1)
Author affiliation:(1) Systems Engineering Institute of Engineer Equipment, 100093 Beijing,
China; (2) Institute of Software, Chinese Academy of Sciences, 100080 Beijing, China; (3) Jiangxi
Normal University, 330027 Nanchang, China
Corresponding author:Zheng, Y.
       (uchengz@yahoo.com.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3959 LNCS
Monograph title:Theory and Applications of Models of Computation - Third International
Conference, TAMC 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:601-610
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540340211
ISBN-13:9783540340218
Document type:Conference article (CA)
Conference name:3rd International Conference on Theory and Applications of Models of
Computation, TAMC 2006
Conference date:May 15, 2006 - May 20, 2006
Conference location:Beijing, China
Conference code:67762
Sponsor:National Natural Sciences Foundation of China; Chinese Academy of Sciences, Institute
of Software, China
Publisher:Springer Verlag
Abstract:Most of the existing formal object-oriented methods use classes or objects as the basic
unit of design, and therefore lack a precise semantics for specifying high-granularity components.
The paper presents a framework of categorical models that focus concern on the interactive
relationships between objects, and that explicitly support specification composition and
refinement at different levels of abstraction and granularity in object-oriented design. A case study
of implementing templated design patterns demonstrates the ability of category theoretic
computations to mechanize software development. &copy; Springer-Verlag Berlin Heidelberg
2006.
Number of references:16
Main heading:Object oriented programming
Controlled terms:Artificial intelligence - Computation theory - Computer science - Semantics -
Software engineering
Uncontrolled terms:Granularity components - Specification composition - Theoretic computation
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.1 Computer Programming - 723.4 Artificial Intelligence -
903.2 Information Dissemination
Treatment:Theoretical (THR)
DOI:10.1007/11750321_57
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 222>
Accession number:2006259955097
Title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics): Preface
Authors:Li, Mingshu (0); Boehm, Barry (0); Osterweil, Leon J. (0)
Corr. author affiliation:Institute of Software, Chinese Academy of Sciences, China
Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3840 LNCS
Monograph title:Unifying the Software Process Spectrum - International Software Process
Workshop, SPW 2005, Revised Selected Papers
Publication year:2006
Pages:V-VII
Language:English
ISSN:03029743
E-ISSN:16113349
Document type:Journal article (JA)
Conference name:International Software Process Workshop, SPW 2005
Conference date:May 25 - 27 2005
Conference location:Beijing, China
Conference code:67507
Publisher:Springer Verlag, Heidelberg, Germany
Abstract:No abstract available
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 223>
Accession number:20062910010260
Title:Applying Little-JIL to describe Process-Agent knowledge in SoftPM
Authors:Xiao, Junchao (1); Osterweil, Leon J. (3); Zhang, Lei (1); Wise, Alexander (3); Wang,
Qing (1)
Author affiliation:(1) Laboratory for Internet Software Technologies, Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China; (2) Graduate University, Chinese Academy
of Sciences, Beijing 100039, China; (3) Department of Computer Science, University of
Massachusetts, Amherst, MA 01003-4610, United States
Corresponding author:Xiao, J.
       (xiaojunchao@itechs.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3966 LNCS
Monograph title:Software Process Change - International Software Process Workshop and
International Workshop on Software Process Simulation and Modeling, SPW/ProSim 2006
Issue date:2006
Publication year:2006
Pages:214-221
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540341994
ISBN-13:9783540341994
Document type:Conference article (CA)
Conference name:International Software Process Workshop and International Workshop on
Software Process Simulation and Modeling, SPW/ProSim 2006
Conference date:May 20, 2006 - May 21, 2006
Conference location:Shanghai, China
Conference code:67767
Publisher:Springer Verlag
Abstract:In a software process modeling method based upon the Organization-Entity capability,
the Process-Agent is a well-defined unit whose role is to encapsulate an entity's knowledge, skill
etc. The Process-Agent's infrastructure comprises descriptive knowledge, process knowledge and
an experience library. The process knowledge is represented by process steps, whose execution
determines the behaviors of the Process-Agent. This causes Process-Agent knowledge to be
precisely described and well organized. In this paper, Little-JIL, a well-known process modeling
language, is used to define a Process-Agent's process knowledge. Benefits for process element
knowledge representation arising from Little-JIL's simplicity, semantic richness, expressiveness,
formal and precise yet graphical syntax etc., are described. &copy; Springer-Verlag Berlin
Heidelberg 2006.
Number of references:8
Main heading:Knowledge engineering
Controlled terms:Computer graphics - Computer programming languages - Knowledge acquisition
- Mathematical models - Process control - Semantics - Societies and institutions - Software
prototyping
Uncontrolled terms:Graphical syntax - Organization-entity capability - Process-Agent knowledge
- Software process modeling
Classification code:903.2 Information Dissemination - 901.1.1 Societies and Institutions - 731
Automatic Control Principles and Applications - 921 Mathematics - 723.5 Computer Applications
- 723.1.1 Computer Programming Languages - 723.1 Computer Programming - 723.4 Artificial
Intelligence
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 224>
Accession number:20070610415133
Title:Line-drawing videos for volume visualization
Authors:Wei, Feng (1); Wang, Wen-Cheng (1); Wu, En-Hua (1)
Author affiliation:(1) State Key Laboratory of Computer Science, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Department of Computer and Information
Science, Faculty of Science and Technology, University of Macau, Macao, China; (3) Graduate
University, Chinese Academy of Sciences, Beijing 100039, China
Corresponding author:Wei, F.
       (weifeng02@ios.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:12
Issue date:December 2006
Publication year:2006
Pages:2086-2095
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press, 18,Shuangqing Street,Haidian, Beijing, 100085, China
Abstract:Line drawings provide a fast and succinct approach for volume visualization. However,
due to its succinct representation, it is necessary to produce many line drawing images from
multiple viewpoints and continually so that viewers can comprehensively understand the contents
in volume data. To improve the efficiency on selecting suitable viewpoints for line drawing, this
paper presents line-drawing videos for volume visualization. On the one hand, by saliency
measurement on volume data and viewpoints, videos are produced by selecting the viewpoints that
can render images to show contents more efficiently. At the same time, with the viewpoints
changing smoothly and continually, viewers can more efficiently obtain the comprehensive
impression of the interesting contents. In comparison with the advanced visualization method by
interactive line drawing, the new method can improve the rendering speed and the ability for
images to show contents, and so use fewer images to achieve more comprehensive understanding
of contents. Of course, the method can improve the efficiency of interactive line drawings for
viewers to focus on studying their interested contents, because the results of saliency measurement
on volume data and viewpoints provide enough information for viewers to select suitable
viewpoints. This is sure to promote volume visualization considerably.
Number of references:18
Main heading:Computer graphics
Controlled terms:Computational complexity - Imaging techniques - Three dimensional computer
graphics - Virtual reality - Visualization
Uncontrolled terms:Line drawing - Rendering speed - Saliency measurement - Video - Viewer -
Viewpoint - Visualization method - Volume data
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.2 Data Processing and Image Processing - 723.5 Computer
Applications
Treatment:Applications (APP); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 225>
Accession number:20063610101511
Title:Policy-adaptive capability inheritance algorithm consistent with POSIX standard
Authors:Shen, Qing-Ni (1); Qing, Si-Han (1); He, Ye-Ping (1); Shen, Jian-Jun (1)
Author affiliation:(1) Engineering and Research Center for Information Security Technology,
Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Graduate School
of Chinese Academy of Sciences, Beijing 100039, China
Corresponding author:Shen, Q.-N.
Source title:Tongxin Xuebao/Journal on Communication
Abbreviated source title:Tongxin Xuebao
Volume:27
Issue:2
Issue date:February 2006
Publication year:2006
Pages:66-72
Language:Chinese
ISSN:1000436X
Document type:Journal article (JA)
Publisher:Editorial Board of Journal on Communications
Abstract:In order to support POSIX capability mechanism, many secure operating systems
provided individual capability inheritable algorithms. These algorithms were only applicable to
specified least privilege control policies, and had such defects as semantic conflicts and no defined
security-objectives. So they couldn't flexibly support for implementing diversified privilege
policies for different requirements. Based on the analysis of some existing algorithms, a new
capability inheritance algorithm was proposed, which introduced the policy-relevant capability
control variable and the trusted application attribution. The implementation of the algorithm in
ANSHENG secure operating system demonstrates that this algorithm provides such properties as
policy-adaptability and usability, the formal analysis and verification of this algorithm proves that
it supports a secure operating system to meet basic security theorems of the privilege policies
enforced in it.
Number of references:10
Main heading:Computer operating systems
Controlled terms:Defects - Mechanisms - Semantics - Standards
Uncontrolled terms:Capability inheritance algorithm - Capability mechanism - Flexibly support -
Least privilege - Operating system security - Policy relevant capability control variable - Semantic
conflicts
Classification code:723 Computer Software, Data Handling and Applications - 902.2 Codes and
Standards - 903.2 Information Dissemination
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 226>
Accession number:20080611082622
Title:Composing administrative scope of delegation policies based on extended XACML
Authors:Feng, Li Xiao (1); Guo, Feng Deng (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing, 100080, China
Corresponding author:Feng, L.X.
       (lxf@is.iscas.ac.cn)

Source title:Proceedings - IEEE International Enterprise Distributed Object Computing Workshop,
EDOC
Abbreviated source title:Proc IEE Int. Enterprise Distrib. Obj. Comput. Workshop EDOC
Monograph title:Proceedings - 10th IEEE International Enterprise Distributed Object Computing
Conference, EDOC 2006
Issue date:2006
Publication year:2006
Pages:467-470
Article number:4031242
Language:English
ISSN:15417719
ISBN-10:076952558X
ISBN-13:9780769525587
Document type:Conference article (CA)
Conference name:10th IEEE International Enterprise Distributed Object Computing Conference,
EDOC 2006
Conference date:October 16, 2006 - October 20, 2006
Conference location:Hong Kong, China
Conference code:71260
Publisher:Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:XACML as a language of access policy and access context request based on attributes is
widely accepted. Current XACML specification's main shortcoming is not considering delegation.
A TC in OASIS proposed a draft about administrative policy, which extended XACML to describe
delegation policies and stated how to process delegation policies in access decisions. In some
cases, a supervisor may need to know administration authorities possessed by a manager who gets
them through delegation policies. For providing such information, access control management
systems should calculate total administration authority of a manager according to related
delegation policies. Current XACML related works haven't addressed this topic. In this paper we
define basic administrative scope and its simple XML schema, use a set of administrative scope
representing administrative authority. Using these definitions, we formally describe the calculation
of a manager's total administrative scope. &copy; 2006 IEEE.
Number of references:12
Main heading:Computer programming languages
Controlled terms:Access control - Administrative data processing - Public policy - Specifications
Uncontrolled terms:Administrative policy - Delegation policies - XACML
Classification code:723.1.1 Computer Programming Languages - 723.2 Data Processing and
Image Processing - 902.2 Codes and Standards
Treatment:Theoretical (THR)
DOI:10.1109/EDOC.2006.23
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 227>
Accession number:20071710565363
Title:BSR: A statistic-based approach for establishing and refining software process performance
baseline
Authors:Wang, Qing (1); Jiang, Nan (1); Gou, Lang (1); Liu, Xia (1); Li, Mingshu (1); Wang,
Yongji (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, 4# South Fourth Street,
Zhong Guan Cun Beijing 100080, China; (2) Graduate University, Chinese Academy of Sciences,
19# Yuquan Rd., Shijingshan District, Beijing 100039, China
Corresponding author:Wang, Q.
       (wq@itechs.iscas.ac.cn)

Source title:Proceedings - International Conference on Software Engineering
Abbreviated source title:Proc Int Conf Software Eng
Volume:2006
Monograph title:Proceeding of the 28th International Conference on Software Engineering 2006,
ICSE '06
Issue date:2006
Publication year:2006
Pages:585-594
Language:English
ISSN:02705257
CODEN:PCSEDE
ISBN-10:1595933751
ISBN-13:9781595933751
Document type:Conference article (CA)
Conference name:28th International Conference on Software Engineering 2006, ICSE '06
Conference date:May 20, 2006 - May 28, 2006
Conference location:Shanghai, China
Conference code:69469
Sponsor:ACM Special Interest Group on Software Engineering, SIGSOFT
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:High-level process management is quantitative management. The Process Performance
Baseline (PPB) of process or subprocess under statistical management is the most important
concept. It is the basis of process control and improvement. The existing methods for establishing
process baseline are too coarse-grained or have some limitation, which lead to inaccurate or
ineffective quantitative management. In this paper, we propose an approach called BSR
(Baseline-Statistic-Refinement) for establishing and refining software process performance
baseline, and present the experience result to validate its effectiveness for quantitative process
management. Copyright 2006 ACM.
Number of references:24
Main heading:Software engineering
Controlled terms:Computational methods - Quality management - Statistical methods - Statistical
process control
Uncontrolled terms:Process performance baseline - Quantitative process management - Software
process improvement - Statistical management
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.1 Computer Programming - 731.1 Control Systems - 912.2
Management - 922.2 Mathematical Statistics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 228>
Accession number:20080811106685
Title:A new variant of the self-shrinking generator
Authors:Zhang, Bin (1); Feng, Dengguo (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing, China
Corresponding author:Zhang, B.
        (martin_zhangbin@yahoo.com.cn)

Source title:IEEE International Symposium on Information Theory - Proceedings
Abbreviated source title:IEEE Int Symp Inf Theor Proc
Monograph title:Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT
2006
Issue date:2006
Publication year:2006
Pages:1619-1622
Article number:4036241
Language:English
CODEN:PISTFZ
ISBN-10:1424405041
ISBN-13:9781424405046
Document type:Conference article (CA)
Conference name:2006 IEEE International Symposium on Information Theory, ISIT 2006
Conference date:July 9, 2006 - July 14, 2006
Conference location:Seattle, WA, United states
Conference code:71407
Sponsor:Information Theory Society of the IEEE
Publisher:Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:In this paper, we present a new variant of the self-shrinking generator (SSG). The new
construction inherits the conceptual simplicity and indispensable security properties of the SSG
and all the known attacks on the SSG can be frustrated by the new model. Besides, its keystream
has ideal run distribution and the flexibility of the new construction allows for efficient practical
implementations at a large scale. &copy; 2006 IEEE.
Number of references:16
Main heading:Information theory
Controlled terms:Mathematical models - Security of data
Uncontrolled terms:Conceptual simplicity - Practical implementations - Self-shrinking generator
Classification code:716.1 Information Theory and Signal Processing - 723.2 Data Processing and
Image Processing - 921 Mathematics
Treatment:Theoretical (THR)
DOI:10.1109/ISIT.2006.261550
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 229>
Accession number:20064110162104
Title:An ID-based watermarking scheme for Java programs
Authors:Yuan, Zheng (1); Wen, Qiaoyan (1); Wu, Wenling (3); Zhang, Qing (1)
Author affiliation:(1) School of Science, Beijing University of Posts and Telecommunications,
Beijing, 100876, China; (2) Beijing Electronic Science and Technology Institute, Beijing, 100036,
China; (3) State Key Laboratory of Information Security, Institute of Software, Chinese Academy
of Sciences, Beijing, 100080, China
Corresponding author:Yuan, Z.
       (sxzyyz5318@163.com)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4097 LNCS
Monograph title:Emerging Directions in Embedded and Ubiquitous Computing - EUC 2006
Workshops: NCUS, SecUbiq, USN, TRUST, ESO, and MSA, Proceedings
Issue date:2006
Publication year:2006
Pages:848-857
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540368507
ISBN-13:9783540368502
Document type:Conference article (CA)
Conference name:EUC 2006: Embedded and Ubiquitous Computing Workshops
Conference date:August 1, 2006 - August 4, 2006
Conference location:Seoul, Korea, Republic of
Conference code:68259
Publisher:Springer Verlag
Abstract:In this paper, we propose an identities(JD) based watermarking scheme for Java
programs. In our scheme, the watermark is generated by participants' identities, embedded via the
watermarked opaque predicates, and verified using zero-knowledge proof. We also present a
construction of a family of opaque predicates by Legendre symbol, which is resilient, cheap, and
stealthy. The order of the watermark is encoded and embedded into the watermarked opaque
predicates, and the watermarked opaque predicates are treated as threads of a Java program. Thus,
the embedded watermark is dynamic and secure against all usual types of watermarks algorithms
attacks and watermarks protocols attacks, and also secure against static and dynamic attacks.
&copy; IFIP International Federation for Information Processing 2006.
Number of references:13
Main heading:Digital watermarking
Controlled terms:Algorithms - Embedded systems - Identification (control systems) - Java
programming language - Network protocols - Security systems
Uncontrolled terms:Aggregate signatures - Java programs - Watermarked opaque predicates -
Watermarking scheme
Classification code:722 Computer Systems and Equipment - 723.1.1 Computer Programming
Languages - 723.2 Data Processing and Image Processing - 731.1 Control Systems - 914.1
Accidents and Accident Prevention
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 230>
Accession number:2006069682835
Title:Identity based threshold proxy signature
Authors:Xu, Jing (1); Zhang, Zhenfeng (1); Feng, Dengguo (1)
Author affiliation:(1) State Key Laboratory of Information Security, Beijing 100080, China; (2)
Graduate School, Chinese Academy of Sciences, Beijing 100039, China; (3) Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China; (4) Graduate School, Chinese Academy of
Sciences; (5) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences; (6) Institute of Software, Chinese Academy of Sciences
Corresponding author:Xu, J.
Source title:Chinese Journal of Electronics
Abbreviated source title:Chin J Electron
Volume:15
Issue:1
Issue date:January 2006
Publication year:2006
Pages:183-186
Language:English
ISSN:10224653
CODEN:CHJEEW
Document type:Journal article (JA)
Publisher:Chinese Institute of Electronics
Abstract:Identity-based (ID-based) public key cryptosystem can be a good alternative for
certificate-based public key setting, especially when efficient key management and moderate
security are required. In a (t, n) threshold proxy signature scheme, the original signer delegates the
power of signing messages to a designated proxy group of n members. Any t or more proxy
signers of the group can cooperatively issue a proxy signature on behalf of the original signer, but
t-1 or less proxy signers cannot. In this paper, we present an ID-based threshold proxy signature
scheme using bilinear pairings. We show the scheme satisfies all security requirements in the
random oracle model. To the best of authors' knowledge, our scheme is the first ID-based
threshold proxy signature scheme.
Number of references:16
Main heading:Electronic document identification systems
Controlled terms:Identification (control systems) - Knowledge acquisition - Mathematical models
- Public key cryptography - Security of data
Uncontrolled terms:Bilinear pairings - Identity-based (ID-based) signatures - Proxy group -
Threshold proxy signatures
Classification code:716 Telecommunication; Radar, Radio and Television - 723.2 Data Processing
and Image Processing - 723.4 Artificial Intelligence - 723.5 Computer Applications - 731.1
Control Systems - 921 Mathematics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 231>
Accession number:20064910289384
Title:Time-division QoS routing protocol for three-layered satellite networks
Authors:Zhou, Yun-Hui (1); Sun, Fu-Chun (1); Zhang, Bo (1); Wang, Jun-Feng (2); Wang, Bin (2)
Author affiliation:(1) Department of Computer Science and Technology, Tsinghua University,
Beijing 100084, China; (2) Institute of Software, Chinese Acad. of Sci., Beijing 100080, China
Corresponding author:Zhou, Y.-H.
        (zhouyh03@mails.tsinghua.edu.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:10
Issue date:October 2006
Publication year:2006
Pages:1813-1822
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:A novel onboard QoS routing protocol (TDRP) is developed in this paper, based on a
three layered satellite network architecture (TLSN) which consists of low Earth orbit (LEO),
medium Earth orbit (MEO), and geostationary Earth orbit (GEO) satellites, and the idea of
time-space division. The method of time-slot optimization and the idea of time-space division are
expatiated. The framework of QoS routing gains emphatically research. In addition, the
implementation principle of the routing algorithm (BDA) is also discussed. The performance of
the proposed satellite network architecture and QoS routing protocol is evaluated efficiently
through simulations and analysis. On condition of the same network load, TLSN perform better
than LEO satellite networks in end-to-end delays and delay jitters; BDA can provide more QoS
guarantees than Dijkstra algorithm in end-to-end delays, delay jitters, package loss probability and
throughput.
Number of references:11
Main heading:Quality of service
Controlled terms:Network protocols - Optimization - Probability - Satellite links - Throughput
Uncontrolled terms:Delay jitters - End-to-end delays - Geostationary earth orbit (GEO) -
Inter-satellite links - Low earth orbit (LEO) - Medium earth orbit (MEO) - Package loss
probability - Routing algorithm - Routing protocol - Three layered satellite network architecture
(TLSN) - Time slot division - Time space division
Classification code:655.2.1 Communication Satellites - 716 Telecommunication; Radar, Radio and
Television - 723 Computer Software, Data Handling and Applications - 921.5 Optimization
Techniques - 922.1 Probability Theory
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 232>
Accession number:20072610672066
Title:An event-driven adaptive differentiated service Web container architecture
Authors:Li, Yang (1); Chen, Ningjiang (2); Huang, Tao (1)
Author affiliation:(1) Center of Software Engineering, Institute of Software, Chinese Academy of
Sciences, Beijing, 100080, China; (2) College of Computer, Electronic and Information, Guangxi
University, Nanning, 530004, China
Corresponding author:Li, Y.
       (fallingboat@otcaix.iscas.ac.cn)

Source title:Proceedings - International Conference on Quality Software
Abbreviated source title:Proc. Int. Conf. Qual. Softw.
Monograph title:Proceedings - Sixth International Conference on Quality Software, QSIC 2006
Issue date:2006
Publication year:2006
Pages:22-29
Article number:4032265
Language:English
ISSN:15506002
ISBN-10:0769527183
ISBN-13:9780769527185
Document type:Conference article (CA)
Conference name:6th International Conference on Quality Software, QSIC 2006
Conference date:October 27, 2006 - October 28, 2006
Conference location:Beijing, China
Conference code:69805
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Web container conforming to J2EE specification is adopted by more and more web
servers to provide dynamic content services for internet-based applications. Web applications with
complex business require web container to provide differentiated services for requests from
different clients according to role or payment etc. However, most traditional web containers still
adopt the best-effort service mode. Some approaches such as admission control and priority
scheduling have been provided to do with the problem, but they do not solve the problem
completely for lack of the considerations in the architecture. This paper brings forward an
event-driven adaptive differentiated service web container architecture named EADWA. In
EADWA, requests from clients are encapsulated into request events which connect a group of
self-management units (SMU) to compose request process flow that is called SMU chain.
EADWA provides both SMU-based and SMU chain-based differentiated services for requests
from different clients according to SLA (Service Level Agreement) defined by application
developer. In addition, SMU-based differentiated services can select proper differentiated service
strategies adaptively. The experiments on prototype show the effect of EADWA. &copy; 2006
IEEE.
Number of references:21
Main heading:World Wide Web
Controlled terms:Adaptive systems - Information services - Problem solving - Servers
Uncontrolled terms:Differentiated services - Service Level Agreement (SLA) - Web container
architecture
Classification code:716 Telecommunication; Radar, Radio and Television - 722 Computer
Systems and Equipment - 723.4 Artificial Intelligence - 903.4 Information Services
Treatment:Theoretical (THR)
DOI:10.1109/QSIC.2006.12
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 233>
Accession number:20064110165619
Title:Identity-based authentication model for multi-domain
Authors:Peng, Hua-Xi (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Acad. of Sci., Beijing 100080, China
Corresponding author:Peng, H.-X.
        (huaxi01@ios.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:8
Issue date:August 2006
Publication year:2006
Pages:1271-1281
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:In this paper, the authors considers the especial requirements of the authentication model
in multi-domain environments. He analyzes the problems of existing authentication frameworks,
and proposes an identity-based authentication model for multi-domain. The model is based on
identity-based public key cryptography, so as to overcome some problems posed by traditional
authentication model based on PKI. Moreover, entity authentication for cross-domain and
anonymity for subject is supported in the model. Especially, by using the modular approach under
the CK-model, the security of entity authentication and anonymity is analyzed. It is showed that
the proposed model is secure and could achieve the security requirements.
Number of references:12
Main heading:Public key cryptography
Controlled terms:Computer networks - Distributed computer systems - Enterprise resource
planning - Mathematical models - Network protocols - Probability - Security of data - Theorem
proving
Uncontrolled terms:Anonymity - Authentication models - Canetti Krawczyk models - Identity
based authentication - Identity based public key cryptography - Multi trust domains
Classification code:716 Telecommunication; Radar, Radio and Television - 722.4 Digital
Computers and Systems - 723 Computer Software, Data Handling and Applications - 912.2
Management - 921 Mathematics - 922.1 Probability Theory
Treatment:Applications (APP); Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 234>
Accession number:20073210753931
Title:Achieving flexible cache consistency for pervasive internet access
Authors:Huang, Yu (1); Cao, Jiannong (1); Wang, Zhijun (1); Jin, Beihong (2); Feng, Yulin (2)
Author affiliation:(1) Internet and Mobile Computing Lab, Dept. of Computing, Hong Kong
Polytechnic Univ., Kowloon, Hong Kong; (2) Technology Center of Software Engineering,
Institute of Software, Chinese Academy of Sciences, Beijing, China
Corresponding author:Huang, Y.
        (alberthuang@ustc.educsjcao)

Source title:Proceedings - Fifth Annual IEEE International Conference on Pervasive Computing
and Communications, PerCom 2007
Abbreviated source title:Proc. Fifth Annu. IEEE Int. Conf. Pervasive Comput. Commun.
Monograph title:Proceedings - Fifth Annual IEEE International Conference on Pervasive
Computing and Communications, PerCom 2007
Issue date:2006
Publication year:2006
Pages:239-248
Article number:4144769
Language:English
ISBN-10:0769527876
ISBN-13:9780769527871
Document type:Conference article (CA)
Conference name:5th Annual IEEE International Conference on Pervasive Computing and
Communications, PerCom 2007
Conference date:March 19, 2007 - March 23, 2007
Conference location:White Plains, NY, United states
Conference code:70054
Sponsor:IEEE Computer Society; Univ. of Texas at Arlington, Dep. of Computer Sci. and Eng.
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Caching is an important technique to support pervasive Internet access. Cache
consistency measures the deviation between the cached data and the source data. In mobile
computing environments, especially with ad hoc networks, users are in great need of the flexibility
in tuning their consistency requirements, in order to make tradeoffs between the specified cache
consistency and the cost incurred. Existing works have used Delta Consistency (DC) and
Probabilistic Consistency (PC) which, to some extent, provide the users with such flexibility. In
this paper, we propose a general consistency model called Probabilistic Delta Consistency (PDC).
PDC covers all existing consistency models including DC and PC, and integrates the flexibility
granted by both DC and PC. Thus, PDC enables the users to flexibly specify their consistency
requirements in two orthogonal dimensions, namely the deviation in time/value and the ratio of
queries gaining the specified consistency. We also propose a consistency maintenance algorithm,
called Flexible Combination of Push and Pull (FCPP), which can meet users' consistency
requirements specified under the PDC model. An analytical model is derived to achieve the
optimized combination of push and pull, so as to ensure the user-specified consistency
requirements, while minimizing the consistency maintenance overhead. Extensive simulations are
conducted to evaluate the performance of the FCPP algorithm. Evaluation results show that,
compared with the widely used Dynamic TTR algorithm, FCPP can save up to 68% of the traffic
overhead and reduce the query delay by up to 84%. &copy; 2007 IEEE.
Number of references:18
Main heading:Ubiquitous computing
Controlled terms:Algorithms - Buffer storage - Computer simulation - Cost effectiveness - Internet
- Mathematical models - Mobile computing - Probability
Uncontrolled terms:Cached data - Tradeoffs - User-specified consistency
Classification code:922.1 Probability Theory - 921 Mathematics - 911.2 Industrial Economics -
723.5 Computer Applications - 722.1 Data Storage, Equipment and Techniques - 716
Telecommunication; Radar, Radio and Television - 461.4 Ergonomics and Human Factors
Engineering
Treatment:Theoretical (THR)
DOI:10.1109/PERCOM.2007.6
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 235>
Accession number:20080611078465
Title:A semantic publish/subscribe system for selective dissemination of the RSS documents
Authors:Ma, Jiangang (1); Xu, Gang (1); Wang, Jinling (1); Huang, Tao (1)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Graduate School, Chinese Academy of Sciences,
Beijing 100049, China
Corresponding author:Ma, J.
        (mjg@otcaix.iscas.ac.cn)

Source title:Proceedings - Fifth International Conference on Grid and Cooperative Computing,
GCC 2006
Monograph title:Proceedings - Fifth International Conference on Grid and Cooperative Computing,
GCC 2006
Issue date:2006
Publication year:2006
Pages:432-439
Article number:4031493
Language:English
ISBN-10:0769526942
ISBN-13:9780769526942
Document type:Conference article (CA)
Conference name:5th International Conference on Grid and Cooperative Computing, GCC 2006
Conference date:October 21, 2006 - October 23, 2006
Conference location:Hunan, China
Conference code:71265
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Content-based publish/subscribe systems as a cooperation and integration middleware
are gaining increasing popularity due to its loose coupling and scalable integration capability.
Recently Web-based collaboration develops very fast. RDF as a standard for information exchange
in the semantic web and RDF Site Summary (RSS) based on RDF is becoming popular on the web,
however the RSS systems based on pull architecture do not scale well because the websites
hosting the popular RSS feeds face high loads imposed by active polling and clients don't detect
updates in time. It needs a novel architecture as publish/subscribe system to improve its scalability
and efficiency. However existing publish/subscribe systems only have the simple subscription
mechanism, and lack of supporting the RDF data. In the paper we introduce a scalable semantic
publish/subscribe system for efficient dissemination of the RSS documents. Our system adopts
RDF and OWL ontology language to understand the semantic of events. We also propose a highly
efficient event matching algorithm based on RDF graph. The prototype of SPS (Semantic
Publish/subscribe System) was developed to selectively disseminate the RSS documents, and the
performance tests demonstrated its efficiency and scalability. &copy; 2006 IEEE.
Number of references:20
Main heading:Semantic Web
Controlled terms:Algorithms - Middleware - Ontology - Software prototyping - Web services
Uncontrolled terms:Content based cooperation - Publish/subscribe
Classification code:723 Computer Software, Data Handling and Applications - 723.1 Computer
Programming - 903 Information Science
Treatment:Theoretical (THR); Experimental (EXP)
DOI:10.1109/GCC.2006.19
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 236>
Accession number:20070110348910
Title:Research on multi-modal interaction model in pervasive computing
Authors:Ma, Cui-Xia (1); Dai, Guo-Zhong (1); Wang, Hong-An (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Ma, C.-X.
       (cuixia@ios.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:SUPPL.
Issue date:November 2006
Publication year:2006
Pages:243-248
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences, P.O. Box 8718, Beijing, 100080, China
Abstract:As technologies are rapidly evolving in the area of storage, recognition and displays, the
vision of multi-modal interaction is positioning the human needs central to pervasive access to
services. Users expect better looking interfaces that are also easy to use to improve high efficiency
and productivity and to focus on task itself instead of tools as providing the invisibility in
pervasive computing. However, it is hard to obtain the right service at the right time naturally in
the multimedia environment based on current interaction approaches. In this paper, a framework is
proposed for multi-modal interaction which offers the sketch and speech interactive models
without limitation of the diversity and richness of the provided services in the pervasive
computing environment. Furthermore, it is applied to describe sample application and shows how
it is used to create a new interface with high performance.
Number of references:14
Main heading:Software engineering
Controlled terms:Computer vision - Graphical user interfaces - Human computer interaction -
Interactive devices - User interfaces
Uncontrolled terms:Context aware - Current interaction approach - Diversity limitation - Human
needs - Invisibility - Looking interface - Multimedia environment - Multimodal interaction - Pen
and speech - Pervasive access - Pervasive computing - Service richness - Sketch - Speech
interactive model
Classification code:722.2 Computer Peripheral Equipment - 723.1 Computer Programming -
723.5 Computer Applications
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 237>
Accession number:20065210332297
Title:Group signatures with reduced bandwidth
Authors:Zhou, S. (1); Lin, D. (1)
Author affiliation:(1) Chinese Academy of Sciences, SKLOIS Lab., Institute of Software, Beijing,
China
Corresponding author:Zhou, S.
       (zhousujing@is.iscas.ac.cn)

Source title:IEE Proceedings: Information Security
Abbreviated source title:IEE Proc. Inf. Secur.
Volume:153
Issue:4
Issue date:2006
Publication year:2006
Pages:146-152
Language:English
ISSN:17470722
E-ISSN:17470730
Document type:Journal article (JA)
Publisher:Institution of Engineering and Technology
Abstract:Group signatures are generalised credential/member authentication schemes with wide
applications. Membership revocation problem is a major issue of group signatures, and is often
resolved through an additional protocol which would encumber the whole group signature both in
computation and storage, as Camenisch et al. did to ACJT's group signature scheme (the first ever
practical group signature based on RSA problem put forward by Ateniese et al. at Crypto'00) by
dynamic accumulator. Boneh et al. applied Camenisch et al.'s dynamic accumulator based
revocation reversely, resulted in short group signature. We formally define the method used by
Boneh et al., named reversed dynamic accumulator in this paper, and apply it on some previous
group signatures to obtain improved ones with revocation capability, reduced bandwidth
(signature size) and less signature generation computations. We also address the problems
unsolved in Boneh et al.'s work, e.g. how to open a group signature since the current certificate
may no longer be the one stored when it is firstly generated. &copy; The Institution of
Engineering and Technology 2006.
Number of references:13
Main heading:Electronic document identification systems
Controlled terms:Bandwidth - Cryptography - Information theory - Network protocols - Security
of data
Uncontrolled terms:Group signature scheme - Membership revocation problem - Signature
generation computations
Classification code:716.1 Information Theory and Signal Processing - 723.2 Data Processing and
Image Processing - 723.5 Computer Applications
Treatment:Theoretical (THR)
DOI:10.1049/ip-ifs:20055141
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 238>
Accession number:2006199868407
Title:On the annihilators of cryptographic Boolean functions
Authors:Zhang, Wen-Ying (1); Wu, Chuan-Kun (1); Yu, Jing-Zhi (3)
Author affiliation:(1) State Key Lab. of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Graduate School, Chinese Academy of Sciences,
Beijing 100080, China; (3) Shandong Medical College, Jinan 250002, China
Corresponding author:Zhang, W.-Y.
       (wenyingzh@is.iscas.ac.cn)

Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica
Abbreviated source title:Tien Tzu Hsueh Pao
Volume:34
Issue:1
Issue date:January 2006
Publication year:2006
Pages:51-54
Language:Chinese
ISSN:03722112
CODEN:TTHPAG
Document type:Journal article (JA)
Publisher:Chinese Institute of Electronics
Abstract:Annihilators of cryptographic Boolean functions have been shown to be closely related to
algebraic attacks to stream ciphers. However how to construct annihilators of a given Boolean
function remains a hard problem. As an approach to this problem, it gives an important
characterization of annihilators with low degrees of a given Boolean function in terms of the set of
x values on which f(x) = 0. This gives a way to find annihilators of a given Boolean function,
however how to find an annihilator of the lowest algebraic degree still remains unsolved.
Number of references:7
Main heading:Cryptography
Controlled terms:Boolean functions - Security of data
Uncontrolled terms:Algebraic attack - Annihilator of Boolean functions
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723 Computer Software, Data Handling and Applications
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 239>
Accession number:20063110036375
Title:Key replacement attack against a generic construction of certificateless signature
Authors:Hu, Bessie C. (1); Wong, Duncan S. (1); Zhang, Zhenfeng (2); Deng, Xiaotie (1)
Author affiliation:(1) Department of Computer Science, City University of Hong Kong, Hong
Kong, Hong Kong; (2) State Key Laboratory of Information Security, Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Hu, B.C.
       (bessiehu@cs.cityu.edu.hk)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4058 LNCS
Monograph title:Information Security and Privacy: 11th Australasian Conference, ACISP 2006,
Proceedings
Issue date:2006
Publication year:2006
Pages:235-246
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540354581
ISBN-13:9783540354581
Document type:Conference article (CA)
Conference name:11th Australasian Conference on Information Security and Privacy, ACISP 2006
Conference date:July 3, 2006 - July 5, 2006
Conference location:Melbourne, Australia
Conference code:67917
Publisher:Springer Verlag
Abstract:Certificateless cryptography involves a Key Generation Center (KGC) which issues a
partial key to a user and the user also independently generates an additional public/secret key pair
in such a way that the KGC who knows only the partial key but not the additional secret key is not
able to do any cryptographic operation on behalf of the user; and a third party who replaces the
public/secret key pair but does not know the partial key cannot do any cryptographic operation as
the user either. We call this attack launched by the third party as the key replacement attack. In
ACISP 2004, Yutn and Lee proposed a generic construction of digital signature schemes under the
framework of certificateless cryptography. In this paper, we show that their generic construction is
insecure against key replacement attack. In particular, we show that the security requirements of
their generic building blocks are insufficient to support some security claim stated in their paper.
We then propose a modification of their scheme and show its security in a new and simplified
security model. We show that our simplified definition and adversarial model not only capture all
the distinct features of certificateless signature but are also more versatile when compared with all
the comparable ones. We believe that the model itself is of independent interest. &copy;
Springer-Verlag Berlin Heidelberg 2006.
Number of references:12
Main heading:Electronic document identification systems
Controlled terms:Artificial intelligence - Computer crime - Computer science - Cryptography -
Security of data - Security systems
Uncontrolled terms:Certificateless signature - Key Generation Center (KGC) - Security claim -
Security model
Classification code:721 Computer Circuits and Logic Elements - 723.2 Data Processing and
Image Processing - 723.4 Artificial Intelligence - 723.5 Computer Applications - 914.1 Accidents
and Accident Prevention
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 240>
Accession number:20073110739682
Title:Spatial context in role-based access control
Authors:Zhang, Hong (1); He, Yeping (1); Shi, Zhiguo (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China;
(2) Graduate School, Chinese Academy of Sciences, Beijing 100049, China
Corresponding author:Zhang, H.
        (hong@ercist.iscas.ac.cn)
Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4296 LNCS
Monograph title:Information Security and Cryptology - ICISC 2006: 9th International Conference,
Proceedings
Issue date:2006
Publication year:2006
Pages:166-178
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540491120
ISBN-13:9783540491125
Document type:Conference article (CA)
Conference name:ICISC 2006: 9th International Conference on Information Security and
Cryptology
Conference date:November 30, 2006 - December 1, 2006
Conference location:Busan, Korea, Republic of
Conference code:69983
Sponsor:Redgate, Korea; SECUi.COM, Korea; MarkAny, Korea; EK Manpower, Korea
Publisher:Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany
Abstract:Controlling access to resources in location-based services and mobile applications
require the definition of spatially aware access control systems. However, traditional RBAC
model does not specify these requirements. In this paper, we present an extension of the RBAC
model to deal with spatial and location-based information, which called LRBAC. In LRBAC, the
final permission set of a user depends on the physical location in which a user is situated. The
ability to specify the spatial boundary of the role allows LRBAC to be flexible and express a
variety of access policies that can provide tight and just-in-time role activation. Besides a real
position obtained from a specific mobile terminal, users are also assigned a logical location
domain that is application dependent. Then, we extend LRBAC to deal with hierarchies and
present how complex spatial role hierarchies in the location-dependent case can be generated by
applying Cartesian products as an arithmetic operation over role hierarchies and logical location
domain hierarchies. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:20
Main heading:Resource allocation
Controlled terms:Algorithms - Hierarchical systems - Mathematical models - Medium access
control - Mobile telecommunication systems
Uncontrolled terms:Location-based information - Role-based access control - Spatial boundary
Classification code:716 Telecommunication; Radar, Radio and Television - 722.3 Data
Communication, Equipment and Techniques - 723 Computer Software, Data Handling and
Applications - 912.2 Management - 921 Mathematics - 961 Systems Science
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 241>
Accession number:2006069682830
Title:Fault diagnosis by passive testing
Authors:Qian, Lan (1); Zhao, Baohua (1); Guo, Xionghui (1)
Author affiliation:(1) Department of Computer Science, University of Science and Technology of
China, Hefei 230027, China; (2) Laboratory of Computer Science, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (3) Department of Computer Science, University of
Science and Technology of China; (4) University of Science and Technology of China
Corresponding author:Qian, L.
Source title:Chinese Journal of Electronics
Abbreviated source title:Chin J Electron
Volume:15
Issue:1
Issue date:January 2006
Publication year:2006
Pages:160-164
Language:English
ISSN:10224653
CODEN:CHJEEW
Document type:Journal article (JA)
Publisher:Chinese Institute of Electronics
Abstract:In this paper, fault diagnosis in passive testing is investigated. First, the fault detection
algorithm and an existing fault diagnosis algorithm in passive testing are introduced. Then, two
more efficient fault diagnosis algorithms which can produce fewer possible faults than the existing
one are proposed. One combines passive testing with active testing, the other adopts further
passive testing. An experiment on a practical routing protocol BGP is used to compare the
improved algorithms with the original one.
Number of references:8
Main heading:Fault tolerant computer systems
Controlled terms:Algorithms - Network protocols - Routers
Uncontrolled terms:Fault detection - Fault diagnosis - Finite state machine - Passive testing
Classification code:716 Telecommunication; Radar, Radio and Television - 722.4 Digital
Computers and Systems - 723 Computer Software, Data Handling and Applications
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 242>
Accession number:20070210352382
Title:OPMAC: One-key Poly1305 MAC
Authors:Dayin, Wang (1); Dongdai, Lin (1); Wenling, Wu (1)
Author affiliation:(1) Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Dayin, W.
       (wdy@is.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4318 LNCS
Monograph title:Information Security and Cryptology - Second SKLOIS Conference, Inscrypt
2006, Proceedings
Issue date:2006
Publication year:2006
Pages:78-87
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540496084
ISBN-13:9783540496083
Document type:Conference article (CA)
Conference name:2nd SKLOIS Conference on Information Security and Cryptology, Inscrypt
2006
Conference date:November 29, 2006 - December 1, 2006
Conference location:Beijing, China
Conference code:68899
Publisher:Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany
Abstract:In this paper, we present One-Key Poly1305 MAC(OPMAC) and prove its security for
arbitrary length message. OPMAC is deterministic and takes only one 16-byte key. Previously,
Poly1305 MAC is nonce-based and requires two 16-byte keys and a 16-byte nonce, 48-byte in
total. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:13
Main heading:Security of data
Controlled terms:Computer crime - Information analysis - Public key cryptography
Uncontrolled terms:Block cipher - Carter-Wegman MAC - Message authentication code -
Pseudorandom function - Pseudorandom permutation
Classification code:723.2 Data Processing and Image Processing - 903.1 Information Sources and
Analysis
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 243>
<RECORD 1>
Accession number:20070310372711
Title:Risk-driven method for prioritizing requirements in iteration development
Authors:Huang, Meng (1); Shu, Feng-Di (1); Li, Ming-Shu (1)
Author affiliation:(1) Laboratory for Internet Software Technologies, Institute of Software,
Chinese Acad. of Sci., Beijing 100080, China; (2) Graduate School, Chinese Acad. of Sci., Beijing
100049, China; (3) Key Laboratory for Computer Science, Institute of Software, Chinese Acad. of
Sci., Beijing 100080, China
Corresponding author:Huang, M.
        (hm@itechs.iscas.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:12
Issue date:December 2006
Publication year:2006
Pages:2450-2460
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences, P.O. Box 8718, Beijing, 100080, China
Abstract:Prioritizing requirements priority is the action that stakeholders assign the orders of
requirements to he implemented. It is the basement of the iteration plan. Existent methods of
prioritizing requirements are inadequate to support stakeholders' negotiation or the adjustment of
requirements' priorities. These shortages always lead to a rigid iteration plan that is difficult to be
adjusted to adapt changes of requirements and environments. In this paper, a risk-driven adaptive
method is put forward for prioritizing requirements which combines adaptive planning and
risk-driven methodologies. Requirements are prioritized adaptively, and risks are used as the
foundation of priorities decisions. The negotiability and adjustability of requirements priorities can
be enhanced by the method. The negotiable and adjustable requirements priorities improve the
developers' capability of controlling requirements and reduce the faults of software project caused
by requirements.
Number of references:28
Main heading:Requirements engineering
Controlled terms:Iterative methods - Quality function deployment - Software engineering
Uncontrolled terms:Adaptive method - Adaptive planning - Developer capability - Iteration
development - Iteration plan - Priority decision - Requirement negotiation - Requirement order -
Requirement priority - Stakeholder - Stakeholder negotiation
Classification code:723.1 Computer Programming - 913.3 Quality Assurance and Control - 921.6
Numerical Methods
Treatment:Applications (APP)
DOI:10.1360/jos172450
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 244>
Accession number:20064010142214
Title:Scheduling design of controllers with fuzzy deadline
Authors:Jin, Hong (1); Wang, Hongan (1); Wang, Hui (1); Wang, Danli (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080
Corresponding author:Jin, H.
        (hjin@iel.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3613 LNAI
Monograph title:Fuzzy Systems and Knowledge Discovery - Second International Conference,
FSKD 2005, Proceedings
Issue date:2006
Publication year:2006
Pages:861-864
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-13:9783540283126
Document type:Conference article (CA)
Conference name:2nd International Conference on Fuzzy Systems and Knowledge Discovery,
FSKD 2005
Conference date:August 27, 2005 - August 29, 2005
Conference location:Changsa, China
Conference code:68199
Publisher:Springer Verlag
Abstract:Because some timing-constraints of a controller task may be not determined as a
real-time system engineer thinks of, its scheduling with uncertain attributes can not be usually and
simply dealt with according to classic manners used in real-time systems. The model of a
controller task with fuzzy deadline and its scheduling are studied. The dedication concept and the
scheduling policy of largest dedication first are proposed first. Simulation shows that the
scheduling of controller tasks with fuzzy deadline can be implemented by using the proposed
method, whilst the control performance cost gets guaranteed. &copy; Springer-Verlag Berlin
Heidelberg 2005.
Number of references:6
Main heading:Control equipment
Controlled terms:Computer simulation - Constraint theory - Fuzzy sets - Real time systems -
Scheduling
Uncontrolled terms:Control performance - Controller tasks - Scheduling design - Scheduling
policy
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 722.4 Digital Computers and Systems - 723.5 Computer
Applications - 732.1 Control Equipment - 912.2 Management - 921 Mathematics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 245>
Accession number:20070110348895
Title:Classifications and experimental evaluation of meaningful pen gestures
Authors:Xu, Li-Shuang (1); Cheng, Tie-Gang (1); Tian, Feng (1); Dai, Guo-Zhong (1)
Author affiliation:(1) Intelligence Engineering Laboratory, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Xu, L.-S.
        (lishuang03@ios.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:SUPPL.
Issue date:November 2006
Publication year:2006
Pages:46-56
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences, P.O. Box 8718, Beijing, 100080, China
Abstract:In this paper, the characteristics and classifications of current used pen gestures are
investigated. And characteristics with 'good' and learnable pen gestures are analyzed through
literatures and a questionnaire. Afterwards, the concept of 'meaningful pen gesture' is presented
according to the consideration whether there are tight relationships between a pen gesture and the
corresponding command existing. And the meaningful pen gesture is divided into three categories:
directive, object-metaphor and conventional. At last, an experiment is performed to validate the
advantage of the meaningful pen gestures designed in this paper. The results show that the
meaningful pen gestures are easier to learn and to use. These results can be interpreted by the
dual-coding theory, and can be one of the basic guidelines for designing pen gestures.
Number of references:29
Main heading:Pattern recognition
Controlled terms:Computer aided design - Gesture recognition - Human computer interaction -
Interactive computer graphics - User interfaces
Uncontrolled terms:Basic guideline - Conventional pen gesture - Directive pen gesture - Dual
coding theory - Experimental evaluation - Learnability - Literature - Meaningful pen gesture -
Object metaphor pen gesture - Questionnaire
Classification code:722.2 Computer Peripheral Equipment - 723.5 Computer Applications - 921.4
Combinatorial Mathematics, Includes Graph Theory, Set Theory
Treatment:Applications (APP); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 246>
Accession number:20071810584897
Title:ARIMAmmse: An improved ARIMA-based software productivity prediction method
Authors:Li, Ruan (1); Yongji, Wang (1); Qing, Wang (1); Fengdi, Shu (1); Haitao, Zeng (1); Shen,
Zhang (1)
Author affiliation:(1) Laboratory for Internet Software Technologies, Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China; (2) Graduate University, Chinese Academy
of Sciences, Beijing 100039, China; (3) Key Laboratory for Computer Science, Chinese Academy
of Sciences, Beijing 100080, China
Corresponding author:Li, R.
       (ruanli@itechs.iscas.ac.cn)

Source title:Proceedings - International Computer Software and Applications Conference
Abbreviated source title:Proc Int Comput Software Appl Conf
Volume:2
Monograph title:Proceedings - 30th Annual International Computer Software and Applications
Conference, COMPSAC 2006 - Short Papers/Workshops/Fast Abstracts/Doctoral Symposium
Issue date:2006
Publication year:2006
Pages:135-138
Article number:4020157
Language:English
ISSN:07303157
CODEN:PSICD2
ISBN-10:0769526551
ISBN-13:9780769526553
Document type:Conference article (CA)
Conference name:30th Annual International Computer Software and Applications Conference,
COMPSAC 2006
Conference date:September 17, 2006 - September 21, 2006
Conference location:Chicago, IL, United states
Conference code:69546
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Productivity is a critical performance index of process resources. As successive history
productivity data tends to be auto-correlated, time series prediction method based on
Auto-Regressive Integrated Moving Average (ARIMA) model was introduced into software
productivity prediction by Humphrey et al. In this paper, a variant of their prediction method
named ARIMAmmse is proposed. This variant formulates the ARIMA parameter estimation issue
as a minimum mean square error (MMSE) based constrained optimization problem. The ARIMA
model is used to describe constraints of the parameter estimation problem, while MMSE is used as
the objective function of the constrained optimization problem. According to the optimization
theory, ARIMAmmse will definitely achieve a higher MMSE prediction precision than Humphrey
et al's which is based on the Yule-Walk estimation technique. Two comparative experiments are
also presented. The experimental results further confirm the theoretical superiority of
ARIMAmmse. &copy; 2006 IEEE.
Number of references:7
Main heading:Software testing
Controlled terms:Autocorrelation - Data reduction - Mathematical models - Optimization -
Parameter estimation - Time series analysis
Uncontrolled terms:Auto Regressive Integrated Moving Average (ARIMA) models - Optimization
theory - Yule Walk estimation techniques
Classification code:723.2 Data Processing and Image Processing - 723.5 Computer Applications -
921 Mathematics - 921.5 Optimization Techniques - 922.2 Mathematical Statistics
Treatment:Theoretical (THR)
DOI:10.1109/COMPSAC.2006.115
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 247>
Accession number:20062910015208
Title:Perception-guided simplification for real time navigation of very large-scale terrain
environments
Authors:Li, Sheng (1); Ji, JunFeng (2); Liu, XueHui (2); Wang, GuoPing (1); Wu, EnHua (2)
Author affiliation:(1) School of Electronics Engineering and Computer Science, Peking University,
China; (2) State Key Lab. of Computer Science, Institute of Software, CAS, China; (3) Dept. of
Computer and Information Science, University of Macau, China; (4) State Information Center of
China, Beijing, China
Corresponding author:Li, S.
        (lisheng@graphics.pku.edu.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3980 LNCS
Monograph title:Computational Science and Its Applications - ICCSA 2006: International
Conference, Proceedings - Part I
Issue date:2006
Publication year:2006
Pages:420-430
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:354034070X
ISBN-13:9783540340706
Document type:Conference article (CA)
Conference name:ICCSA 2006: International Conference on Computational Science and Its
Applications
Conference date:May 8, 2006 - May 11, 2006
Conference location:Glasgow, United kingdom
Conference code:67786
Sponsor:Institute of Electrical Engineering, IEE, UK; University of Perugia, Italy; University of
Calgary, Canada; University of Minnesota, MN, ISA; Queens' University of Belfast, UK
Publisher:Springer Verlag
Abstract:Interactive navigation over very large-scale terrain environments is a highly challenging
topic since the model involved often contains huge amount of geometries and textures, even
exceeds the capacity of system memory. In this paper, we put forward a high-performance
technique for real-time walkthrough in very large-scale terrain environments. By the technique,
perception-guided simplification is adopted through application of a new error metric-Constrained
Normal Cone in the preprocessing stage. Both silhouette-preserving and shading-preserving
criteria are satisfied in our navigation system. Furthermore, the pre-extracted Potential Silhouette
from each block can be used to construct the incremental horizon at run time for delicate visibility
testing. The consequent visibility information then can prevent the unnecessary data from loading
into the main memory, so that the workload of out-of-core data paging and the number of triangles
rendered are substantially reduced, and the frame rates are highly increased. Experiment results
show the high performance of our novel approach. &copy; Springer-Verlag Berlin Heidelberg
2006.
Number of references:19
Main heading:Large scale systems
Controlled terms:Artificial intelligence - Constraint theory - Geometry - Information analysis -
Navigation - Textures
Uncontrolled terms:Large-scale terrain environments - Performance technique -
Silhouette-preserving - System memory
Classification code:933 Solid State Physics - 921 Mathematics - 903.1 Information Sources and
Analysis - 723.4 Artificial Intelligence - 721.1 Computer Theory, Includes Formal Logic,
Automata Theory, Switching Theory, Programming Theory - 461.1 Biomedical Engineering -
431.5 Air Navigation and Traffic Control
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 248>
Accession number:20062910005579
Title:A new approximation algorithm for the k-facility location problem
Authors:Zhang, Peng (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, P.O. Box 8718, Beijing,
100080, China; (2) Graduate University, Chinese Academy of Sciences, Beijing, China
Corresponding author:Zhang, P.
       (zhp@gcl.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3959 LNCS
Monograph title:Theory and Applications of Models of Computation - Third International
Conference, TAMC 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:217-230
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540340211
ISBN-13:9783540340218
Document type:Conference article (CA)
Conference name:3rd International Conference on Theory and Applications of Models of
Computation, TAMC 2006
Conference date:May 15, 2006 - May 20, 2006
Conference location:Beijing, China
Conference code:67762
Sponsor:National Natural Sciences Foundation of China; Chinese Academy of Sciences, Institute
of Software, China
Publisher:Springer Verlag
Abstract:The k-facility location problem is a common generalization of the facility location and
the k-median problems. For the metric uncapacitated k-facility location problem, we propose a
polynomial-time 2 + &radic;3 + &isin;-approximation algorithm using the local search approach,
which significantly improves the previously known approximation ratio 4, given by Jain et al.
using the greedy method (J. ACM 50 (2003) 795-824). &copy; Springer-Verlag Berlin Heidelberg
2006.
Number of references:14
Main heading:Algorithms
Controlled terms:Approximation theory - Polynomials - Problem solving - Search engines
Uncontrolled terms:Approximation algorithms
Classification code:723.4 Artificial Intelligence - 921 Mathematics - 921.1 Algebra - 921.6
Numerical Methods
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 249>
Accession number:20063610099085
Title:Progressive out-of-core compression based on multi-level adaptive octree
Authors:Cai, Kangying (1); Liu, Ying (1); Wang, Wencheng (1); Sun, Hanqiu (2); Wu, Enhua (3)
Author affiliation:(1) Inst. of Software, Chinese Academy of Sci.; (2) Dept. of Comp. Sci. and
Engi., Chinese Univ. of Hong Kong; (3) Dept. of Comp. and Information Sci., Univ. of Macau,
Chinese Academy of Sci.
Corresponding author:Cai, K.
        (cky@ios.ac.cn)

Source title:Proceedings - VRCIA 2006ACM International Conference on Virtual Reality
Continuum and its Applications
Abbreviated source title:Proc. VRCIA Int. Conf. Virtual Reality Continuum Applic.
Volume:2006
Monograph title:Proceedings - VRCIA 2006: ACM International Conference on Virtual Reality
Continuum and its Applications
Issue date:2006
Publication year:2006
Pages:83-89
Language:English
Document type:Conference article (CA)
Conference name:VRCIA 2006: ACM International Conference on Virtual Reality Continuum and
its Applications
Conference date:June 14, 2006 - June 17, 2006
Conference location:Hong Kong, China
Conference code:68059
Sponsor:ACM SIGGRAPH; Eurographics Association
Publisher:Association for Computing Machinery
Abstract:In this paper, we present an efficient progressive out-of-core compression algorithm,
called POoCC, for the gigantic models thin already exceed the capacity of physical main memory.
To our knowledge, the scheme is the first solution of progressive out-of-core encoding. The
primary obstacle of extending current in-core progressive encoders to their out-of-core versions is
that the necessary global data structure cannot be built and kept in-core for gigantic meshes. We
partition the model space into small blocks and use a multi-level adaptive tree to organize the
whole input gigantic mesh. Using the multi-level adaptive tree, most of the progressive encoders
based on tree structure can be easily adapted to deal with gigantic meshes. Because of its high
performance, we choose to extend the in-core encoder for complex isosurfaces [Lee et al. 2003] to
handle gigantic meshes. Our POoCC algorithm achieves the similar rate distortion performance as
the state-of-the-art in-core encoders and performs better than the existing single rate out-of-core
compression algorithms, especially for those watertight gigantic meshes. The gigantic meshes are
reconstructed using the Extended Marching Cubes (EMC) algorithm[Kobbelt et al. 2001]. Thus,
they can be progressively compressed in one piece and no artificial discontinuity is introduced
even the partitioning procedure is necessary, which makes our POoCC encoder outperform other
model splitting based out-of-core processing algorithms. POoCC is carefully designed to be
cache-friendly and can handle meshes with arbitrary size on low-cost off-the-shelf PCs. Copyright
&copy; 2006 by the Association for Computing Machinery, Inc.
Number of references:19
Main heading:Computational methods
Controlled terms:Adaptive algorithms - Cost effectiveness - Data structures - Knowledge
acquisition - Mathematical models - Problem solving - Trees (mathematics)
Uncontrolled terms:Multilevel adaptive octree - Out-of-core compression - Physical main memory
- Progressive compression
Classification code:723 Computer Software, Data Handling and Applications - 723.2 Data
Processing and Image Processing - 723.4 Artificial Intelligence - 911.2 Industrial Economics - 921
Mathematics - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 250>
Accession number:2006119755551
Title:Coordinated route planning via nash equilibrium and evolutionary computation
Authors:Yan, Ping (1); Ding, Ming-Yue (2); Zheng, Chang-Wen (3)
Author affiliation:(1) Department of Weaponry Engineering, Naval University of Engineering,
Wuhan 430033, China; (2) Institute of Pattern Recognition and Artificial Intelligence, Huazhong
University of Science and Technology, Wuhan, 430074, China; (3) Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (4) Huazhong University of Science and
Technology
Corresponding author:Yan, P.
       (davidyp2002@yahoo.com.cn)

Source title:Chinese Journal of Aeronautics
Abbreviated source title:Chin J Aeronaut
Volume:19
Issue:1
Issue date:February 2006
Publication year:2006
Pages:18-23
Language:English
ISSN:10009361
CODEN:CJAEEZ
Document type:Journal article (JA)
Publisher:Chinese Journal of Aeronautics
Abstract:The coordinated route-planning problem for multiple unmanned air vehicles (UAVs), a
cooperative optimization problem, also a non-cooperative game, is addressed in the framework of
game theory. A Nash equilibrium based route planner is proposed. The rational is that the structure
of UAV subteam usually provides some inherent and implicit preference information, which help
to find the optimum coordinated routes and the optimum combination of the various objective
functions. The route planner combines the concepts of evolutionary computation with
problem-specific chromosome structures and evolutionary operators and handles different kinds of
mission constraints in hierarchical style. Cooperation and competition among UAVs are reflected
by the definition of fitness function. Simulations validate the feasibility and superiority of the
game-theoretic coordinated routes planner.
Number of references:8
Main heading:Unmanned vehicles
Controlled terms:Competition - Constraint theory - Evolutionary algorithms - Game theory -
Problem solving
Uncontrolled terms:Route planning - UAV team
Classification code:472 Ocean Engineering - 721.1 Computer Theory, Includes Formal Logic,
Automata Theory, Switching Theory, Programming Theory - 723.4 Artificial Intelligence - 911.2
Industrial Economics - 922.1 Probability Theory
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 251>
Accession number:20082511328943
Title:Query division and reformulation in ontology-based heterogeneous information integration
Authors:Jian, Li (1); Beihong, Jin (1)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Jian, L.
       (lijian@otcaix.iscas.ac.cn)

Source title:Proceedings - 15th International Conference on Computing, CIC 2006
Abbreviated source title:Proc. Int. Conf. Comput. CIC
Monograph title:Proceedings - 15th International Conference on Computing, CIC 2006
Issue date:2006
Publication year:2006
Pages:186-193
Article number:4023808
Language:English
ISBN-10:0769527086
ISBN-13:9780769527086
Document type:Conference article (CA)
Conference name:15th International Conference on Computing, CIC 2006
Conference date:November 21, 2006 - November 24, 2006
Conference location:Mexico City, Mexico
Conference code:72235
Publisher:Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:People could obtain information from heterogeneous data resources by semantic
querying based on ontologies. In ontology-based heterogeneous information integration, dividing
and reformulating a global query for ontology concepts' instances into multiple sub-queries over
those local information sources is a fundamental challenge. This paper presents a kind of uniform
expression for concept instances ' queries and a method to divide the global query into local ones.
All local query results could be integrated as answers of the global query according to the
integration expression got by query division. &copy; 2006 IEEE.
Number of references:16
Main heading:Ontology
Controlled terms:Computational methods - Information analysis - Information retrieval -
Information theory - Ketones
Uncontrolled terms:Global query - Heterogeneous data - Heterogeneous information -
international conferences - Local information - Ontology concepts - Query results - Sub-queries
Classification code:716.1 Information Theory and Signal Processing - 721.1 Computer Theory,
Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723
Computer Software, Data Handling and Applications - 804.1 Organic Compounds - 903.1
Information Sources and Analysis - 903.3 Information Retrieval and Use
DOI:10.1109/CIC.2006.56
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 252>
Accession number:20070310362241
Title:Parking management system based on wireless sensor network
Authors:Bi, Yan-Zhong (1); Sun, Li-Min (1); Zhu, Hong-Song (1); Yan, Ting-Xin (1); Luo,
Zheng-Jun (1)
Author affiliation:(1) Institute of Software, Chinese Acad. of Sci., Beijing 100080, China; (2)
Graduate School, Chinese Acad. of Sci., Beijing 100039, China
Corresponding author:Bi, Y.-Z.
        (yanzhong02@ios.cn)

Source title:Zidonghua Xuebao/Acta Automatica Sinica
Abbreviated source title:Zidonghua Xuebao
Volume:32
Issue:6
Issue date:November 2006
Publication year:2006
Pages:968-977
Language:English
ISSN:02544156
CODEN:ZIXUDZ
Document type:Journal article (JA)
Publisher:Science Press, 18,Shuangqing Street,Haidian, Beijing, 100085, China
Abstract:This paper introduces a parking management system based on a wireless sensor network
developed by our group. The system consists of a large amount of parking space monitoring nodes,
a few parking guiding nodes, a sink node and a management station. All the nodes exchange
information with each other through wireless communication. The prototype of the parking
management system has been implemented and the preliminary test results show that the
performance of the system can satisfy the requirements of the application.
Number of references:3
Main heading:Sensors
Controlled terms:Communication - Monitoring - Parking
Uncontrolled terms:Parking guidance - Parking management - Wireless communication - Wireless
sensor network
Classification code:432.4 Highway Traffic Control - 716 Telecommunication; Radar, Radio and
Television - 732.2 Control Instrumentation
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 253>
Accession number:20064610239580
Title:Fault diagnosis algorithm based on finite state machine
Authors:Zhao, Bao-Hua (1); Qian, Lan (1); Zhou, Hao (1); Guo, Xiong-Hui (1)
Author affiliation:(1) Computer Science and Technology Department, Laboratory of Computer
Science Institute of Software Chinese Academy of SciencesUSTC, Hefei 230027, China
Corresponding author:Zhao, B.-H.
Source title:Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology
Abbreviated source title:Dianzi Yu Xinxi Xuebao
Volume:28
Issue:9
Issue date:September 2006
Publication year:2006
Pages:1679-1683
Language:Chinese
ISSN:10095896
CODEN:DKXUEC
Document type:Journal article (JA)
Publisher:Science Press
Abstract:A lot of research work has been done for conformance testing of protocols based on the
FSM model. After a fault has been detected, it arises the problem that how to diagnose the fault. In
this paper, it is assumed that IUT (Implementation Under Testing) exists only one single fault and
a fault diagnosis algorithm is proposed. The diagnosis algorithm makes full use of transitions
confirmed to be correct and head states set of the next observed input/output pair to the symptom
transition and guarantees the diagnostic of any single fault in an FSM. In this paper, the
comparison of time complexity with other existing fault diagnosis algorithms is given and an
example to demonstrate the algorithm is presented.
Number of references:10
Main heading:Algorithms
Controlled terms:Computational complexity - Diagnosis - Testing
Uncontrolled terms:Conformance testing - Fault diagnosis - Finite State Machine (FSM) - Single
fault
Classification code:423.2 Test Methods - 721.1 Computer Theory, Includes Formal Logic,
Automata Theory, Switching Theory, Programming Theory - 723 Computer Software, Data
Handling and Applications
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 254>
Accession number:20073110741862
Title:Traversal fields for ray tracing dynamic scenes
Authors:Huang, Peijie (1); Wang, Wencheng (1); Yang, Gang (1); Wu, Enhua (1)
Author affiliation:(1) State Key Lab. of Computer Science, Institute of Software, Chinese
Academy of Sciences, Post Box: 8718, Beijing, 100080, China; (2) Graduate University, Chinese
Academy of Sciences, Beijing, China; (3) Beijing Forestry University, Beijing, China; (4)
Department of Computer and Information Science, University of Macau, Macau, China
Corresponding author:Huang, P.
        (hpj@ios.ac.cn)

Source title:Proceedings of the ACM Symposium on Virtual Reality Software and Technology,
VRST
Abbreviated source title:Proc. ACM Symp. Virtual Reality Softw. Technol. VRST
Monograph title:VRST'06: ACM Symposium Virtual Reality Software and Technology
Issue date:2006
Publication year:2006
Pages:65-74
Language:English
ISBN-10:1595933212
ISBN-13:9781595933218
Document type:Conference article (CA)
Conference name:13th ACM Symposium Virtual Reality Software and Technology, VRST'06
Conference date:November 1, 2006 - November 3, 2006
Conference location:Limassol, Cyprus
Conference code:70005
Sponsor:ACM SIG on Computer Graphics and Interactive Techniques, SIGGRAPH; ACM Special
Interest Group on Computer-Human Interaction, SIGCHI
Publisher:Association for Computing Machinery, 1515 Broadway, 17th Floor, New York, NY
10036-5701, United States
Abstract:This paper presents a novel scheme for accelerating ray traversal computation in ray
tracing. By the scheme, a pre-computed stage is applied to constructing what is called a traversal
field for each rigid object that records the destinations for all possible incoming rays. The field
data, which could be efficiently compressed offline, is stored in a small number of big rectangles
called ray-relays that enclose each approximate convex segment of an object. In the ray-tracing
stage, the records on relays are retrieved in a constant time, so that a ray traversal is implemented
as a simple texture lookup on GPU. Thus, the performance of our approach is only related to the
number of relays rather than scene size, while the number of relays is quite small. In addition,
because the traversal fields only depend on the internal construction of each convex segment, they
can be used to ray trace objects undergoing rigid motions at a negligible extra cost. Experimental
results show that interactive rates could be achieved for dynamic scenes with the effects of
specular reflections and refractions on an ordinary desk PC with GPU. Copyright 2006 ACM.
Number of references:26
Main heading:Ray tracing
Controlled terms:Computational methods - Graphic methods - Image segmentation - Interfaces
(computer)
Uncontrolled terms:Convex segments - Graphics processing units (GPU)
Classification code:722.2 Computer Peripheral Equipment - 723.2 Data Processing and Image
Processing - 723.5 Computer Applications - 741.1 Light/Optics - 921 Mathematics
Treatment:Theoretical (THR); Experimental (EXP)
DOI:10.1145/1180495.1180510
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 255>
Accession number:20063410082330
Title:Framework for supporting extended transaction models in J2EE platform
Authors:Zhang, Xin (1); Ding, Xiaoning (1); Jin, Beihong (1); Li, Jing (1)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Key Laboratory of Computer Science, Institute
of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Zhang, X.
        (zhangxin@otcaix.iscas.ac.cn)

Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development
Abbreviated source title:Jisuanji Yanjiu yu Fazhan
Volume:43
Issue:7
Issue date:July 2006
Publication year:2006
Pages:1273-1279
Language:Chinese
ISSN:10001239
CODEN:JYYFEY
Document type:Journal article (JA)
Publisher:Science Press
Abstract:As for the development of the Internet applications and distributed computing, the need
for supporting these distributed, collaborative, loosely coupled and complex applications emerges.
Although powerful, the flat model is found lacking functionality and efficiency when used for
these new applications. Aiming at getting more flexible models, various extensions to the
traditional transaction model have been proposed. However, these researches focus on relaxing the
constraints of ACID properties and increasing the concurrency and flexibility in specific
environments, and the restriction of data source interfaces leads to the difficulties in implementing
the extended transaction primitives. A novel framework for supporting extended transaction
models in the J2EE platform is presented by enforcing the transaction manager to control the
concurrency. In this way, the transaction manager holds a full control of access from applications
to data sources, and thus gives supports for common extended transaction models.
Number of references:19
Main heading:Middleware
Controlled terms:Concurrency control - Data communication systems - Distributed computer
systems - Java programming language - Security of data
Uncontrolled terms:Extended transaction model - J2EE - Transaction primitive
Classification code:722.4 Digital Computers and Systems - 723.1 Computer Programming - 723.2
Data Processing and Image Processing - 723.3 Database Systems
Treatment:Applications (APP)
DOI:10.1360/crad20060721
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 256>
Accession number:20073310758950
Title:A novel SOAP attachment-oriented security model
Authors:Cui, Xiaoling (1); Li, Lei (1); Wei, Jun (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences; (2) Department of
Computer Science, University of Science and Technology of China
Corresponding author:Cui, X.
        (xlcui@otcaix.iscas.ac.cn)

Source title:Proceedings - International Symposium on Software Reliability Engineering, ISSRE
Abbreviated source title:Proc. Int. Symp. Softw. Reliab. Eng.
Monograph title:Proceedings - 17th International Symposium on Software Reliability Engineering,
ISSRE 2006
Issue date:2006
Publication year:2006
Pages:127-135
Article number:4021978
Language:English
ISSN:10719458
CODEN:PSSRFV
ISBN-10:0769526845
ISBN-13:9780769526843
Document type:Conference article (CA)
Conference name:17th International Symposium on Software Reliability Engineering, ISSRE
2006
Conference date:November 7, 2006 - November 10, 2006
Conference location:Raleigh, NC, United states
Conference code:70041
Sponsor:IEEE Computer Society; IEEE Computer Society Tech. Council on Software Eng.
(TCSE); IEEE Reliability Society
Publisher:IEEE Computer Society, 10662 Los Vaqueros Circle - P.O. Box 3014, Los Alamitos, CA
90720-1314, United States
Abstract:Security is playing an increasingly important role in nowadays business. However, at
present there isn't an effective method to secure SOAP attachments. This paper proposes a novel
security model for SOAP attachments, which encrypts the attachments and provides digital
signature without changing client's and server's implementations. In the multi-intermediaries
scenario, the whole message is divided into two parts and sent respectively: the primary part goes
through as the original message path via intermediaries, while the attachments are sent directly
from client to server via no intermediary. Therefore, it improves the efficiency of services and
reduces the probability of the attachments' being attacked. A prototype of this security model is
implemented on the Web application server and the experiment results show the feasibility of
secure attachments in enterprise applications. &copy; 2006 IEEE.
Number of references:15
Main heading:Security of data
Controlled terms:Client server computer systems - Cryptography - Electronic document
identification systems - Mathematical models - Message passing - Probability - Servers
Uncontrolled terms:Intermediaries - Security models - Web application servers
Classification code:722.4 Digital Computers and Systems - 723.1 Computer Programming - 723.2
Data Processing and Image Processing - 723.5 Computer Applications - 921 Mathematics - 922.1
Probability Theory
Treatment:Theoretical (THR); Experimental (EXP)
DOI:10.1109/ISSRE.2006.7
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 257>
Accession number:20070310373297
Title:Interactively rendering dynamic refraction on GPU
Authors:Liu, Baoquan (0); Wu, Enhua (0); Liu, Xuehui (0)
Corresponding author:Liu, B.
        (lbq@ios.ac.cn)

Corr. author affiliation:Key Laboratory of Computer Science, Institute of Software, Chinese Acad.
of Sciences, Beijing 100080, China
Source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and
Computer Graphics
Abbreviated source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao
Volume:18
Issue:11
Issue date:November 2006
Publication year:2006
Pages:1652-1657
Language:Chinese
ISSN:10039775
CODEN:JFTXFX
Document type:Journal article (JA)
Publisher:Institute of Computing Technology, Beijing, China
Abstract:A more accurate refraction rendering algorithm, which runs entirely on GPU, is presented
in this paper. The algorithm can directly render complex objects represented by polygonal meshes
without any pre-calculating, and allows the objects to be deformed dynamically through the
interaction of users. The rendering method allows refraction or totally internal reflection (TIR)
through two or more interfaces. Our method traces the accurate paths of both refraction and TIR
rays going through the transparent object, and computes the ray-surface intersection in orthogonal
projection space on GPU to produce realistic image including both refraction and TIR. We also
simulated the object's translucency by adopting the scattering and absorbing model in volume
rendering method during the ray passing through the object.
Number of references:10
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 258>
Accession number:2006279982265
Title:MIMO techniques in cluster-based wireless sensor networks
Authors:Li, Jing (1); Gu, Yu (1); Zhang, Wei (1); Zhao, Baohua (1)
Author affiliation:(1) Department of Computer Science, University of Science Andtechnology of
China, Hefei, Anhui, 230027, China; (2) Laboratory of Computer Science, Institute of Software,
Chinese Academy of Sciences
Corresponding author:Li, J.
       (ajing@mail.ustc.edu.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3842 LNCS
Monograph title:Advanced Web and Network Technologies, and Applications - APWeb 2006
International Workshops: XRA, IWSN, MEGA, and ICSE, Proceedings
Issue date:2006
Publication year:2006
Pages:291-296
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540311580
ISBN-13:9783540311584
Document type:Conference article (CA)
Conference name:APWeb 2006 International Workshops: XRA, IWSN, MEGA, and ICSE
Conference date:January 16, 2006 - January 18, 2006
Conference location:Harbin, China
Conference code:67605
Publisher:Springer Verlag
Abstract:Advances in microsensor and radio technology will enable small but smart sensors to be
deployed for a wide range of environment monitoring applications. Most architectures of wireless
sensor networks (WSN) are built as homogeneous networks, where all sensor nodes have the same
structure. But it is not suitable for cluster-based WSN. By using multi-antenna sensor node
(MASN) as the cluster head (CH), we import multi-input-multi-output (MIMO) and
single-input-multi- output (SIMO) communication modes into WSN. In this network scenario,
tremendous energy saving is possible when transmission range is larger than a given threshold.
This paper motivates and describes the realization of the inhomogeneous network, special
communication scheme and simulation of energy consumption and delay model of it. &copy;
Springer-Verlag Berlin Heidelberg 2006.
Number of references:6
Main heading:Wireless telecommunication systems
Controlled terms:Antennas - Computer networks - Energy utilization - Mathematical models -
Microsensors - Radio communication
Uncontrolled terms:Multi-input-multi-output (MIMO) - Single-input-multi- output (SIMO) -
Wireless sensor networks (WSN)
Classification code:525.3 Energy Utilization - 716 Telecommunication; Radar, Radio and
Television - 716.3 Radio Systems and Equipment - 732.2 Control Instrumentation - 921
Mathematics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 259>
<RECORD 1>
Accession number:20064310195629
Title:Drag and Drop by Laser Pointer: Seamless interaction with multiple large displays
Authors:Zhang, Liang (1); Shi, Yuanchun (1); Chen, Jichun (2)
Author affiliation:(1) Key Laboratory of Pervasive Computing, Department of Computer Science
and Technology, Tsinghua University, Beijing 100084, China; (2) Institute of Software, Chinese
Academy of Sciences, Beijing 100084, China
Corresponding author:Zhang, L.
       (blinkzhangpaul@gmail.com)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4159 LNCS
Monograph title:Ubiquitous Intelligence and Computing - Third International Conference, UIC
2006, Proceedings
Issue date:2006
Publication year:2006
Pages:12-20
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540380914
ISBN-13:9783540380917
Document type:Conference article (CA)
Conference name:3rd International Conference on Ubiquitous Intelligence and Computing, UIC
2006
Conference date:September 3, 2006 - September 6, 2006
Conference location:Wuhan, China
Conference code:68350
Publisher:Springer Verlag
Abstract:This paper presents a novel interaction technique with multiple large displays in smart
space. We call it D2LP, short for Drag and Drop by Laser Pointer, where a specially designed laser
pointer uPen is a handheld interactive device for users. By D2LP, large displays driven by
different computers can be made as one seamless integrated uniform system. With a uPen in hand
users can directly point and draw on the surface of displays, drag and drop digital objects among
multiple displays continuously and smoothly. Report on evaluation experiments shows that D2LP
can effectively support the freely interacting with multiple wallsized displays and it is preferred
over the conventional mouse-driven cursor based system for the application in smart spaces with
rich information displays. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:12
Main heading:Laser applications
Controlled terms:Computer science - Data processing - Display devices - Information technology -
Interactive computer systems - User interfaces
Uncontrolled terms:Information displays - Mouse-driven cursor based systems - Multiple
wallsized displays - Seamless integrated uniform systems
Classification code:903 Information Science - 744.9 Laser Applications - 723.5 Computer
Applications - 723.2 Data Processing and Image Processing - 722.4 Digital Computers and
Systems - 722.2 Computer Peripheral Equipment - 721 Computer Circuits and Logic Elements
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 260>
Accession number:2006279982254
Title:Behavior-based trust in wireless sensor network
Authors:Huang, Lei (1); Li, Lei (1); Tan, Qiang (2)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences; (2) Chinese Academy
of Space Technology
Corresponding author:Huang, L.
       (huanglei04@ios.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3842 LNCS
Monograph title:Advanced Web and Network Technologies, and Applications - APWeb 2006
International Workshops: XRA, IWSN, MEGA, and ICSE, Proceedings
Issue date:2006
Publication year:2006
Pages:214-223
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540311580
ISBN-13:9783540311584
Document type:Conference article (CA)
Conference name:APWeb 2006 International Workshops: XRA, IWSN, MEGA, and ICSE
Conference date:January 16, 2006 - January 18, 2006
Conference location:Harbin, China
Conference code:67605
Publisher:Springer Verlag
Abstract:The resource constraints of wireless sensor network make it easy to attack and hard to
protect. Although carefully designed cryptography and authentication help to make WSN securer,
they are not good at dealing with compromised node and ageing node, whose misbehavior may
impair the function of WSN. Behavior-based trust mechanism, which is a variant of
reputation-based trust in eCommerce, can be used to address this problem. The framework and
related techniques of behavior-based trust are discussed in this paper. &copy; Springer-Verlag
Berlin Heidelberg 2006.
Number of references:27
Main heading:Wireless telecommunication systems
Controlled terms:Computer networks - Constraint theory - Cryptography - Electronic commerce -
Resource allocation - Sensors
Uncontrolled terms:Ageing nodes - Resource constraints - Wireless sensor networks - WSN
securers
Classification code:716 Telecommunication; Radar, Radio and Television - 721.1 Computer
Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory -
723.5 Computer Applications - 732.2 Control Instrumentation - 912.2 Management
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 261>
Accession number:2006229912000
Title:Priority mapping problem in static real-time middleware
Authors:Wang, Baojin (1); Li, Mingshu (2); Wang, Zhigang (1)
Author affiliation:(1) Institute of Information and Engineering, PLA Information and Engineering
University, Zhengzhou 450002, China; (2) Laboratory for Internet Software Technologies,
Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Wang, B.
        (baojin_wang@itechs.iscas.ac.cn)

Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development
Abbreviated source title:Jisuanji Yanjiu yu Fazhan
Volume:43
Issue:4
Issue date:April 2006
Publication year:2006
Pages:722-728
Language:Chinese
ISSN:10001239
CODEN:JYYFEY
Document type:Journal article (JA)
Publisher:Science Press
Abstract:The deadline monotonic (DM) priority assignment scheme and distributed priority
ceiling resource access protocol (DPCP) work well with real-time CORBA. In practice, a
potentially large number of global unique priorities must be mapped to the restricted number of
local priorities provided by the operating systems. Most operating systems use first-in-first-out
(FIFO) scheduling within the same priority. So, a high global priority task could be blocked by
lower global priority tasks ahead of it in the local priority FIFO queue. This causes priority
inversion and affects the schedulability of tasks with higher global priority. In addition, the
optimal priority assignment requires a search of exponential complexity. This is the priority
mapping problem. To solve it, necessary and sufficient conditions are presented for analyzing the
schedulability of a task which global priority has been mapped to a local priority. The decreasing
global priority mapping (DGPM) algorithm is also provided. It can schedule a task and global
critical section (GCS) set that is schedulable under any other direct priority mapping algorithms.
DGPM can overlap tasks (map two or more tasks to the same local priority) while not allowing the
system to become non-schedulable, or prove that the system is no-schedulable after overlapping.
The. conditions and algorithm are used in the projects.
Number of references:7
Main heading:Scheduling
Controlled terms:Algorithms - Computer simulation - Mapping - Network protocols - Real time
systems
Uncontrolled terms:Deadline monotonic (DM) priority assignment scheme - Distributed priority
ceiling resource access protocol (DPCP) - First in first out (FIFO) scheduling - Global critical
section (GCS) - Priority inversion - Priority mapping problem - Task number - Task scheduling
Classification code:405.3 Surveying - 722.4 Digital Computers and Systems - 723.5 Computer
Applications - 912.2 Management - 921 Mathematics
Treatment:Applications (APP)
DOI:10.1360/crad20060423
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 262>
Accession number:20064210172161
Title:A network event correlation algorithm based on fault filtration
Authors:Zheng, Qiuhua (1); Qian, Yuntao (1); Yao, Min (1)
Author affiliation:(1) Computational Intelligence Research Laboratory, College of Computer
Science, Zhejiang University, China; (2) State Key Laboratory of Information Security, Institute of
Software, Chinese Academy of Sciences, Beijing, China
Corresponding author:Zheng, Q.
        (zheng_qiuhua@163.com)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4099 LNAI
Monograph title:PRICAI 2006: Trends in Artificial Intelligence - 9th Pacific Rim International
Conference on Artificial Intelligence, Proceedings
Issue date:2006
Publication year:2006
Pages:864-869
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540366679
ISBN-13:9783540366676
Document type:Conference article (CA)
Conference name:9th Pacific Rim International Conference on Artificial Intelligence
Conference date:August 7, 2006 - August 11, 2006
Conference location:Guilin, China
Conference code:68284
Publisher:Springer Verlag
Abstract:This paper proposed a new event correlation technique to enhance the heuristic of the
increment hypothesis updating (IHU) algorithm. This approach estimates the likelihood of each
fault in the faults set and removes these faults with less likelihood. By this approach we also can
determine whether an event is spurious or not. Simulation shows that this approach can get a high
accuracy and fast speed of correlation even if the network has a high event loss and spuriousness.
&copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:8
Main heading:Correlation methods
Controlled terms:Algorithms - Computer simulation - Failure analysis - Heuristic methods -
Maximum likelihood estimation
Uncontrolled terms:Event correlation - Fault filtration - Increment hypothesis updating (IHU)
algorithms
Classification code:723 Computer Software, Data Handling and Applications - 723.5 Computer
Applications - 921 Mathematics - 922.2 Mathematical Statistics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 263>
Accession number:20072210630792
Title:PSO-PID: A novel controller for AQM routers
Authors:Wang, Xiuli (2); Wang, Yongji (3); Zhou, Hui (2); Huai, Xiaoyong (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences; (2) Graduate University,
Chinese Academy of Sciences; (3) Key Laboratory for Computer Science, Chinese Academy of
Sciences
Corresponding author:Wang, X.
        (wxl@itechs.iscas.ac.cn)

Source title:2006 IFIP International Conference on Wireless and Optical Communications
Networks
Abbreviated source title:Int. Conf. Wireless Optic. Com. Netw.
Monograph title:2006 IFIP International Conference on Wireless and Optical Communications
Networks
Issue date:2006
Publication year:2006
Language:English
ISBN-10:1424403405
ISBN-13:9781424403400
Document type:Conference article (CA)
Conference name:2006 IFIP International Conference on Wireless and Optical Communications
Networks
Conference date:April 11, 2006 - April 13, 2006
Conference location:Bangalore, India
Conference code:69665
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:This paper presents an improved TCP/Active Queue Management (AQM) model and a
novel AQM control system, called Particle Swarm Optimization (PSO) -
Proportional-Integral-Differential (PID) controller, under large-delay network situations. First, we
present the improved model including the delay term ignored by the previous simplified version.
Using this model, we next design an AQM router applying PSO to tune efficiently the PID
controller parameters. A simulation study shows that the PSO-PID controller controls congestion
effectively and predictively and outperforms the Random Early Detection (RED) and
Proportional-Integral (PI) algorithms in terms of the packet loss rate, the link utilization, and so on.
&copy; 2006 IEEE.
Number of references:23
Main heading:Queueing networks
Controlled terms:Congestion control (communication) - Mathematical models - Optimization -
Parameter estimation - Routers - Three term control systems
Uncontrolled terms:Link utilization - Particle Swarm Optimization - Random Early Detection
(RED)
Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer
Software, Data Handling and Applications - 731.1 Control Systems - 921.5 Optimization
Techniques
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 264>
Accession number:2006209883708
Title:3-dimensional sensor model in the sensor network
Authors:Lin, Zhiting (1); Ou, Yugui (1); Zhai, Yujia (1); Zhao, Baohua (1)
Author affiliation:(1) Department of Electronic Engineering and Information Science, University
of Science and Technology of China, Hefei 230027, China; (2) Laboratory of Computer Science,
Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (3) Department of
Electronic Engineering and Information Science, University of Science and Technology of China;
(4) University of Science and Technology of China
Corresponding author:Lin, Z.
Source title:Chinese Journal of Electronics
Abbreviated source title:Chin J Electron
Volume:15
Issue:2
Issue date:April 2006
Publication year:2006
Pages:324-328
Language:English
ISSN:10224653
CODEN:CHJEEW
Document type:Journal article (JA)
Publisher:Chinese Institute of Electronics
Abstract:Sensor webs consisting of nodes with limited battery power and wireless communication
are deployed to collect useful information from a variety of environments. One fundamental issue
in sensor networks is the coverage problem, which reflects how well a sensor network is
monitored or tracked by sensors. In this paper, a new 3-dimensional model is proposed to adapt to
the practicality, which distinguishes it from other general existing models. Not only the issue of
sensor characteristic, terrain and preferential coverage of grid points are modeled but also the
perceive limit is taken into account in this 3-dimensional model and the feasibility is tested by
simulations. Specially, we assume there are three types of obstacles in the 3-dimensional sensor
field, Non-grid obstacles (NGO), Grid obstacles with sufficient height (GOS), and Grid obstacles
with insufficient height (GOI). And here, we propose an algorithm for the efficient coverage in a
3-dimensional sensor field. After finding the grid point which is covered least effectively, we find
out not one but a number of nodes, which are eager to be improved. So these weaker nodes will be
meliorated via algorithm INTEGER_LOCAL_COV, which has been compared with the primary
algorithms via simulations and been shown to exhibit excellent performance.
Number of references:7
Main heading:Sensors
Controlled terms:Algorithms - Computer simulation - Electric batteries - Problem solving -
Wireless telecommunication systems
Uncontrolled terms:3-Dimension sensor model - Coverage problem - Wireless sensor networks
Classification code:702.1 Electric Batteries - 716 Telecommunication; Radar, Radio and
Television - 723.4 Artificial Intelligence - 723.5 Computer Applications - 732.2 Control
Instrumentation
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 265>
Accession number:20062910010251
Title:COCOMO-U: An extension of COCOMO II for cost estimation with uncertainty
Authors:Yang, Da (1); Wan, Yuxiang (1); Tang, Zinan (1); Wu, Shujian (1); He, Mei (1); Li,
Mingshu (1)
Author affiliation:(1) Laboratory for Internet Software Technologies, Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China; (2) Graduate University, Chinese Academy
of Sciences, Beijing 100039, China; (3) State Key Lab of Computer Science, Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Yang, D.
       (yangda@itechs.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3966 LNCS
Monograph title:Software Process Change - International Software Process Workshop and
International Workshop on Software Process Simulation and Modeling, SPW/ProSim 2006
Issue date:2006
Publication year:2006
Pages:132-141
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540341994
ISBN-13:9783540341994
Document type:Conference article (CA)
Conference name:International Software Process Workshop and International Workshop on
Software Process Simulation and Modeling, SPW/ProSim 2006
Conference date:May 20, 2006 - May 21, 2006
Conference location:Shanghai, China
Conference code:67767
Publisher:Springer Verlag
Abstract:It is well documented that the software industry suffers from frequent cost overruns, and
the software cost estimation remains a challenging issue. A contributing factor is, we believe, the
inherent uncertainty of assessment of cost. Considering the uncertainty with cost drivers and
representing the cost as*/ distribution of values can help us better understand the uncertainty of
cost estimations and provide decision support for budge setting or cost control. In this paper, we
use Bayesian belief networks to extend the COCOMOII for cost estimation with uncertainty, and
construct the probabilistic cost model COCOMO-U. This model can be used to deal with the
uncertainties of cost factors and estimate the cost probability distribution. We also demonstrate
how the COCOMO-U is used to provide decision support for software development budget setting
and cost control in a case study. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:13
Main heading:Cost accounting
Controlled terms:Budget control - Computer science - Computer software - Decision making -
Estimation - Industrial economics - Probabilistic logics - Software engineering
Uncontrolled terms:Bayesian belief networks - Budge setting - Cost estimation - Probability
distribution
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723 Computer Software, Data Handling and Applications - 723.1
Computer Programming - 911.1 Cost Accounting - 912.2 Management - 921 Mathematics
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 266>
Accession number:20063210053567
Title:SAQA: Spatial and attribute based query aggregation in wireless sensor networks
Authors:Jie, Yang (1); Bo, Yan (2); Lee, Sungyoung (1); Cho, Jinsung (1)
Author affiliation:(1) Department of Computer Engineering, Kyung Hee University, Korea,
Republic of; (2) Intelligent Engineering Lab., Institute of Software, Chinese Academy of Sciences,
China
Corresponding author:Lee, S.
       (sylee@oslab.khu.ac.kr)
Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4096 LNCS
Monograph title:Embedded and Ubiquitous Computing - International Conference, EUC 2006,
Proceedings
Issue date:2006
Publication year:2006
Pages:15-24
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540366792
ISBN-13:9783540366799
Document type:Conference article (CA)
Conference name:International Conference on Embedded and Ubiquitous Computing, EUC 2006
Conference date:August 1, 2006 - August 4, 2006
Conference location:Seoul, Korea, Republic of
Conference code:67985
Publisher:Springer Verlag
Abstract:In most wireless sensor networks, applications submit their requests as queries and
wireless sensor network transmits the requested data to the applications. However, most existing
work in this area focuses on data aggregation, not much attention has been paid to query
aggregation. For many applications, especially ones with high query rates, query aggregation is
very important. In this paper, we design an effective query aggregation algorithm SAQA to reduce
the number of duplicate/overlapping queries and save overall energy consumption in the wireless
sensor networks. This new aggregation algorithm focuses on the duplicate/overlapping spatial and
attribute information in the original queries submitted by the applications. Our performance
evaluations show that by applying our query aggregation algorithm, the overall energy
consumption can be significantly reduced and the sensor network lifetime can be prolonged
correspondingly. &copy; IFIP International Federation for Information Processing 2006.
Number of references:9
Main heading:Wireless telecommunication systems
Controlled terms:Algorithms - Data acquisition - Data reduction - Energy utilization
Uncontrolled terms:Overlapping queries - Query aggregation - Wireless sensor network
Classification code:525.3 Energy Utilization - 716 Telecommunication; Radar, Radio and
Television - 723.2 Data Processing and Image Processing
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 267>
Accession number:20064710256397
Title:Formal automatic verification of security protocols
Authors:Xiao, Meihua (1); Xue, Jinyun (2)
Author affiliation:(1) State Key Laboratory for Computer Science, Institute of Software, Chinese
Academy of Science, Beijing, 100080, China; (2) Institute of Software, CAS; (3) College of
Computer Information, Jiangxi Normal University, Nanchang, 330027, China
Corresponding author:Xiao, M.
       (xiao_mh@263.net)

Source title:2006 IEEE International Conference on Granular Computing
Abbreviated source title:2006 IEEE Int. Conf. Granular Comp.
Monograph title:2006 IEEE International Conference on Granular Computing
Issue date:2006
Publication year:2006
Pages:566-569
Article number:1635866
Language:English
ISBN-10:1424401348
ISBN-13:9781424401345
Document type:Conference article (CA)
Conference name:2006 IEEE International Conference on Granular Computing
Conference date:May 10, 2006 - May 12, 2006
Conference location:Atlanta, GA, United states
Conference code:68572
Sponsor:IEEE Computational Intelligence Society; Georgia State University, Atlanta, USA
Publisher:Institute of Electrical and Electronics Engineers Computer Society
Abstract:Security protocols flaws are notoriously difficult to detect. Comparatively little attention
has been given to logics of knowledge, although such logics have been proven to be very useful In
the specifications of protocols for communication systems. We address ourselves to the analysis of
security protocols under the Dolev-Yao model by using a logic of algorithmic knowledge, and
propose a general method to describe formally the data structures used In the verification, such as
messages, traces, intruders, and so on. We explore the use of our methodology for the verification
of security protocols. The Horng-Hsu attack to Helsinki protocol has been found successfully in
this setting by using SPIN. &copy; 2006 IEEE.
Number of references:13
Main heading:Network protocols
Controlled terms:Cryptography - Data structures - Electronic document identification systems -
Formal logic - Knowledge engineering - Security of data
Uncontrolled terms:Algorithmic knowledge - Cryptographic protocols - Helsinki protocol -
Intruder model
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723 Computer Software, Data Handling and Applications - 723.2
Data Processing and Image Processing - 723.4 Artificial Intelligence - 723.5 Computer
Applications
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 268>
Accession number:2006099728298
Title:Structure of proofs and the complexity of cut elimination
Authors:Zhang, Wenhui (1)
Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of
Sciences, P.O. Box 8718, Beijing 100080, China
Corresponding author:Zhang, W.
        (zwh@ios.ac.cn)

Source title:Theoretical Computer Science
Abbreviated source title:Theor Comput Sci
Volume:353
Issue:1-3
Issue date:March 14, 2006
Publication year:2006
Pages:63-70
Language:English
ISSN:03043975
CODEN:TCSCDI
Document type:Journal article (JA)
Publisher:Elsevier
Abstract:The importance of the structure of cut-formulas with respect to proof length and proof
depth has been studied in various occasions. It has been illustrated that a quantifier may be more
powerful than a binary connective in cut-formulas with respect to the reduction (or increase) of
proof length and proof depth, and a sequence of quantifiers of the same type (existential or
universal) may be less powerful than a sequence of quantifiers of alternating types. This paper
provides a refined view on cut-elimination through an analysis of the structure of proofs, brings
new insight into the relation between cut-formulas and short proofs, and illustrates that a mixture
of quantifiers and binary connectives could be important for achieving the maximal benefit of
cut-formulas for obtaining short proofs. &copy; 2005 Elsevier B.V. All rights reserved.
Number of references:21
Main heading:Computational complexity
Controlled terms:Computer science
Uncontrolled terms:Balanced proofs - Cut elimination - Proof complexity - Proof structure
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory
Treatment:Theoretical (THR)
DOI:10.1016/j.tcs.2005.07.042
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 269>
Accession number:2006069682805
Title:Power consumption model in two-tiered Wireless sensor networks
Authors:Zhang, Wei (1); Liu, Hengchang (1); Zhao, Baohua (1); Qu, Yugui (1)
Author affiliation:(1) Department of Computer Science, University of Science and Technology of
China, Hefei 230027, China; (2) Laboratory of Computer Science, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (3) Department of Computer Science, University of
Science and Technology of China; (4) University of Science and Technology of China
Corresponding author:Zhang, W.
Source title:Chinese Journal of Electronics
Abbreviated source title:Chin J Electron
Volume:15
Issue:1
Issue date:January 2006
Publication year:2006
Pages:51-54
Language:English
ISSN:10224653
CODEN:CHJEEW
Document type:Journal article (JA)
Publisher:Chinese Institute of Electronics
Abstract:In practical applications of Wireless sensor networks (WSN), since sensors are generally
constrained in on-board energy supply, power-efficient management of the network is crucial to
extend the lifetime of the sensors and the analysis on power consumption is its key issue. This
paper has proposed an analysis based on two-tiered structure, which is more and more popular.
Current power analyses make the power consumption between the Cluster-head sensor node
(CHSN) and the Base station (BS) an approximation to the whole network's power consumption.
We verify the feasibility of the approximating approach through results of simulation ignoring
handling factor, setup the power consumption model considering the factor and reach several
conclusions on the factor, providing theoretical bases and experimental foundations for future
research.
Number of references:8
Main heading:Wireless telecommunication systems
Controlled terms:Approximation theory - Computer simulation - Electric power utilization -
Mathematical models - Network protocols - Sensors
Uncontrolled terms:Lifetime - Power consumption - Two-tiered structure - Wireless sensor
networks
Classification code:921.6 Numerical Methods - 921 Mathematics - 732.2 Control Instrumentation
- 723.5 Computer Applications - 723 Computer Software, Data Handling and Applications - 716
Telecommunication; Radar, Radio and Television - 706.1 Electric Power Systems
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 270>
Accession number:20082511321853
Title:Performance analysis and resource allocation for IEEE 802.11 based wireless networks
Authors:Lingzhi, Sheng (1); Limin, Sun (1); Xinyun, Zhou (1); Jian, Ma (2)
Author affiliation:(1) Institute of Software, Chinese Academy of Science, Beijing 100080, China;
(2) Nokia Research Center, Beijing, Beijing, 100013, China
Corresponding author:Lingzhi, S.
        (lingzhi02@ios.cn)

Source title:IEEE International Symposium on Personal, Indoor and Mobile Radio
Communications, PIMRC
Abbreviated source title:IEEE Int Symp Person Indoor Mobile Radio Commun PIMRC
Monograph title:2006 IEEE 17th International Symposium on Personal, Indoor and Mobile Radio
Communications, PIMRC
Issue date:2006
Publication year:2006
Article number:4022333
Language:English
ISBN-10:1424403294
ISBN-13:9781424403295
Document type:Conference article (CA)
Conference name:2006 IEEE 17th International Symposium on Personal, Indoor and Mobile
Radio Communications, PIMRC
Conference date:September 11, 2006 - September 14, 2006
Conference location:Helsinki, Finland
Conference code:72218
Publisher:Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:In this paper, a novel performance analytical model, which uses discrete Markov and
M/M/1/K theory, is presented for IEEE 802.11 based wireless networks with finite load. Delay and
loss caused by MAC contention and buffer queuing are studied in detail. This model and analysis
give an in-depth insight and understanding to the unfairness between uplink and downlink flows
that are forwarded by access point. Futhermore, based on this model, a resource allocation scheme
for access point is proposed. This hybrid scheme uses bandwidth reservation based admission
control and priority scheduling to guarantee bounded delay and loss for real-time traffics.
Simulation results validate the analytical model and show that our scheme can avoid congestion
and provide QoS under high traffic load. &copy; 2006 IEEE.
Number of references:13
Main heading:Wireless networks
Controlled terms:Computer networks - Management - Metropolitan area networks - Modal
analysis - Multitasking - Network protocols - Planning - Resource allocation - Standards
Uncontrolled terms:(e ,2e) theory - Access point (AP) - Admission control (AC) - Analytical
modelling - bandwidth reservation - Bounded delay - Downlink flows - Hybrid scheme - IEEE
802.11 (Standards) - International symposium - Mobile radio communications - performance
analyses - Priority scheduling - Real-time (RT) traffic - simulation results - Traffic loads
Classification code:921 Mathematics - 912.2 Management - 902.2 Codes and Standards - 723
Computer Software, Data Handling and Applications - 722.4 Digital Computers and Systems -
716.3 Radio Systems and Equipment - 716 Telecommunication; Radar, Radio and Television
DOI:10.1109/PIMRC.2006.254139
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 271>
Accession number:20063910131597
Title:Linear multi-secret sharing schemes based on multi-party computation
Authors:Liu, Mulan (1); Xiao, Liangliang (2); Zhang, Zhifang (1)
Author affiliation:(1) Academy of Mathematics and Systems Science, Key Laboratory of
Mathematics Mechanization, Chinese Academy of Sciences, Beijing, 100080, China; (2) Institute
of Software, Chinese Academy of Sciences, Beijing, 100080, China
Corresponding author:Liu, M.
        (mlliu@amss.ac.cn)

Source title:Finite Fields and their Applications
Abbreviated source title:Finite Fields Appl.
Volume:12
Issue:4
Issue date:November 2006
Publication year:2006
Pages:704-713
Language:English
ISSN:10715797
E-ISSN:10902465
Document type:Journal article (JA)
Publisher:Academic Press Inc.
Abstract:In multi-secret sharing schemes, publishing shares during the process of reconstructing
partial secrets may leak some information of the secrets unrecovered yet. By using a multi-party
computation (MPC) protocol, we solve this problem for any linear multi-secret sharing scheme
(MSSS). We also show that LMSSS usually involve more complicated reconstruction algorithms
than "direct sum" schemes, but from the point of reducing share expansion, the former is preferred.
&copy; 2006 Elsevier Inc. All rights reserved.
Number of references:11
Main heading:Data privacy
Controlled terms:Algorithms - Computation theory - Computer programming - Information theory
Uncontrolled terms:Linear multi-secret sharing schemes - Monotone span programs - Multi-party
computation
Classification code:716.1 Information Theory and Signal Processing - 721.1 Computer Theory,
Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723
Computer Software, Data Handling and Applications - 723.1 Computer Programming - 902.3
Legal Aspects
Treatment:Theoretical (THR)
DOI:10.1016/j.ffa.2006.05.003
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 272>
Accession number:20062910010274
Title:Practical experiences of cost/schedule measure through Earned Value Management and
Statistical Process Control
Authors:Wang, Qing (1); Jiang, Nan (1); Gou, Lang (1); Che, Meiru (1); Zhang, Ronghui (1)
Author affiliation:(1) Laboratory for Internet Software Technologies, Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China; (2) Graduate University, Chinese Academy
of Sciences, Beijing 100039, China
Corresponding author:Wang, Q.
         (wq@itechs.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3966 LNCS
Monograph title:Software Process Change - International Software Process Workshop and
International Workshop on Software Process Simulation and Modeling, SPW/ProSim 2006
Issue date:2006
Publication year:2006
Pages:348-354
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540341994
ISBN-13:9783540341994
Document type:Conference article (CA)
Conference name:International Software Process Workshop and International Workshop on
Software Process Simulation and Modeling, SPW/ProSim 2006
Conference date:May 20, 2006 - May 21, 2006
Conference location:Shanghai, China
Conference code:67767
Publisher:Springer Verlag
Abstract:Cost and schedule measures are the most important support activities for the success of a
project; it provides the basis for process improvement and project management. This paper reports
practical experiences on using EVM (Earned Value Management) and SPC(Statistical Process
Control) in cost/schedule measure. The analysis of experience data indicates the distributions of
CPI(Cost Performance Index) and SPI(Schedule Performance Index) index are generally
following the normal distribution. And consequently, it is reasonable and effective to employ SPC
in EVM. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:13
Main heading:Value engineering
Controlled terms:Cost benefit analysis - Data reduction - Normal distribution - Project
management - Scheduling - Statistical process control
Uncontrolled terms:Cost Performance Index - Cost/schedule measure - Earned Value Management
- Process improvement
Classification code:723.2 Data Processing and Image Processing - 731.1 Control Systems - 911.5
Value Engineering - 912.2 Management - 922.1 Probability Theory
Treatment:General review (GEN)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 273>
Accession number:20063610099086
Title:Double projective cylindrical texture mapping on FPGA
Authors:Li, Xiaoying (1); Liu, Baoquan (2); Wu, Enhua (3)
Author affiliation:(1) Faculty of Science and Technology, University of Macau; (2) Institute of
Software, Chinese Academy of Sciences; (3) University of Macau, Chinese Academy of Sciences
Corresponding author:Li, X.
       (ya27404@umac.mo)

Source title:Proceedings - VRCIA 2006ACM International Conference on Virtual Reality
Continuum and its Applications
Abbreviated source title:Proc. VRCIA Int. Conf. Virtual Reality Continuum Applic.
Volume:2006
Monograph title:Proceedings - VRCIA 2006: ACM International Conference on Virtual Reality
Continuum and its Applications
Issue date:2006
Publication year:2006
Pages:91-97
Language:English
Document type:Conference article (CA)
Conference name:VRCIA 2006: ACM International Conference on Virtual Reality Continuum and
its Applications
Conference date:June 14, 2006 - June 17, 2006
Conference location:Hong Kong, China
Conference code:68059
Sponsor:ACM SIGGRAPH; Eurographics Association
Publisher:Association for Computing Machinery
Abstract:Image-based modeling and rendering (IBMR) techniques have been used to construct
three-dimensional virtual scenes applied for VR applications by warping several two-dimensional
images with depth information. In this paper, a novel approach of IBMR with depth information
called double projective cylindrical texture mapping method (DPCM) is presented and
implemented on an PPGA hardware platform. By the approach, based on a virtual double
projective cylindrical camera model, the rendered scene is firstly projected onto the surface of a
cylinder with perspective projection for the top and bottom view and parallel projection for the
side view. Both color and depth images arc captured after projection. Using the double projective
cylindrical reference images (DPCI) as the source, a two-pass rendering process is conducted to
generate new views of the 3D object and scene through a horizontal and vertical pre-warping
followed by standard texture mapping. By taking the parallelism and reconfigurability of FPGA
hardware, the algorithm is optimized for the architecture of circuit and well designed for memory
management. Experimental results show that both improved rendering speed and good image
quality could be achieved on the hardware platform. Copyright &copy; 2006 by the Association
for Computing Machinery, Inc.
Number of references:32
Main heading:Field programmable gate arrays
Controlled terms:Computer hardware - Computer simulation - Information analysis -
Mathematical models - Photomapping - Textures - Virtual reality
Uncontrolled terms:Depth image - Graphics hardware - Image warping - Image-based rendering
Classification code:921 Mathematics - 903.1 Information Sources and Analysis - 742.1
Photography - 933 Solid State Physics - 723.5 Computer Applications - 722 Computer Systems
and Equipment - 721.2 Logic Elements - 723 Computer Software, Data Handling and Applications
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 274>
Accession number:20070110344994
Title:A default extension to distributed description logics
Authors:Ma, Yinglong (1); Feng, Yulin (1); Jin, Beihong (1); Wei, Jun (1)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, P.O. Box 8718, Beijing 100080, China
Corresponding author:Ma, Y.
        (m_y_long@otcaix.iscas.ac.cn)

Source title:Web Intelligence and Agent Systems
Abbreviated source title:Web Intell. Agent Syst.
Volume:4
Issue:4
Issue date:2006
Publication year:2006
Pages:371-383
Language:English
ISSN:15701263
Document type:Journal article (JA)
Publisher:IOS Press, Nieuwe Hemweg 6B, Amsterdam, 1013 BG, Netherlands
Abstract:When different agents communicate with each other, there needs to be some way to
ensure that the meaning of what one agent embodies is accurately conveyed to another agent. It
has been argued that ontologies play a key role in communication among different agents.
However, in many situations, because there exist terminological heterogeneities and
incompleteness of pieces of information among ontologies used by different agents,
communication among agents will be very complex and difficult to tackle. In this paper, we
propose a solution to the problem for these situations. We use distributed description logics (DDL)
to model the mappings between ontologies used by different agents and further make a default
extension to DDL for default reasoning. An adapted algorithm is proposed for checking default
satisfiability of ALC-concepts. Base on the default extension of the DDL model, a complete
information query can be reduced to checking default satisfiability of the complex concept
corresponding to the query. &copy; 2006 - IOS Press and the authors. All rights reserved.
Number of references:28
Main heading:Formal logic
Controlled terms:Adaptive algorithms - Formal languages - Multi agent systems - Query
languages
Uncontrolled terms:Default extension - Description logic - Distributed description logics (DDL) -
Ontology
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.1.1 Computer Programming Languages - 723.5 Computer
Applications
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 275>
Accession number:20063410082601
Title:Real-time system design based on logic OR constrained optimization
Authors:Liu, Jun-Xiang (1); Wang, Yong-Ji (1); Wang, Yuan (1); Xing, Jian-Sheng (1); Zeng,
Hai-Tao (1)
Author affiliation:(1) Laboratory for Internet Software Technologies, Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China; (2) Graduate School, Chinese Academy of
Sciences, Beijing 100049, China; (3) Laboratory for Computer Science, Institute of Software,
Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Liu, J.-X.
       (liujunxiang@itechs.iscas.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:7
Issue date:July 2006
Publication year:2006
Pages:1641-1649
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:The logic relationship among the equality and inequality constraints in a standard
constrained optimization problem (SCOP) is the logical AND. Various efficient, convergent and
robust algorithms have been developed for such a SCOP. However, a more general constrained
optimization problem (GCOP) with not only logic AND but also OR relationships exists in many
practical applications. In order to solve such a generalized problem, a new mathematical
transformations which can transfer a set of inequalities with logic OR into inequalities with logic
AND relationships is developed. This transformation provides a necessary and sufficient condition
which enables us to formulate real-time system design as a mixed Boolean-integer programming
problem. A Branch and Bound Algorithm is applied to find the optimal solution. Experimental
results have been presented to show its merits.
Number of references:18
Main heading:Real time systems
Controlled terms:Integer programming - Mathematical transformations - Nonlinear programming -
Optimization
Uncontrolled terms:Branch and bound algorithm - Inequality constraint - Mixed Boolean integer
programming (MBP) - Rate monotonic (RM) - Robust algorithms - Standard constrained
optimization problem (SCOP)
Classification code:722.4 Digital Computers and Systems - 921.3 Mathematical Transformations -
921.5 Optimization Techniques
Treatment:Applications (APP)
DOI:10.1360/jos171641
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 276>
Accession number:20064110161701
Title:Selection of materialized relations in ontology repository management system
Authors:Li, Man (1); Du, Xiaoyong (1); Wang, Shan (1)
Author affiliation:(1) School of Information, Renmin University of China; (2) Key Laboratory of
Data Engineering and Knowledge Engineering, MOE; (3) Institute of Software, Chinese Academy
of Sciences, 100872 Beijing, China
Corresponding author:Li, M.
        (liman1@ruc.edu.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4092 LNAI
Monograph title:Knowledge Science, Engineering and Management - First International
Conference, KSEM 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:241-251
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540370331
ISBN-13:9783540370338
Document type:Conference article (CA)
Conference name:1st International Conference on Knowledge Science, Engineering and
Management, KSEM 2006
Conference date:August 5, 2006 - August 8, 2006
Conference location:Guilin, China
Conference code:68256
Publisher:Springer Verlag
Abstract:With the growth of ontology scale and complexity, the query performance of Ontology
Repository Management System (ORMS) becomes more and more important. The paper proposes
materialized relations technique which speeds up query processing in ORMS by making the
implicit derived relations of ontology explicit. Here the selection of materialized relations is a key
problem, because the materialized relations technique trades off required inference time against
maintenance cost and storage space. However, the problem has not been discussed formally before.
So the paper proposes a QSS model to describe the queries set of ontology formally and gives the
benefit evaluation model and the selection algorithm of materialized relations based on QSS
model. The method in this paper not only considers the benefit in query response of the
materialization technique, but also the storage and maintenance cost of it. In the end, an
application case is introduced to prove the selection method of materialized relations is effective.
&copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:15
Main heading:Information retrieval systems
Controlled terms:Computational complexity - Computer software maintenance - Data storage
equipment - Inference engines - Information management - Information retrieval - Query
languages
Uncontrolled terms:Maintenance cost - Ontology Repository Management System (ORMS) -
Query response - Storage space
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 722.1 Data Storage, Equipment and Techniques - 723.1.1
Computer Programming Languages - 723.4.1 Expert Systems - 903.2 Information Dissemination -
903.3 Information Retrieval and Use
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 277>
Accession number:2006269966313
Title:Study on event splitting and rounding in the integrating services billing system
Authors:Zhang, Shu-Dong (1); Wu, Zhi-Mei (1); Lu, Hui-Ying (2); Han, Hong-Quan (1); Liu,
Jing-Jing (3)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China;
(2) College of Information Engineering, Capital Normal University, Beijing 100037, China; (3)
College of Economy, Central University for Nationalities, Beijing 100081, China
Corresponding author:Zhang, S.-D.
        (shudong@ios.cn)

Source title:Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and
Telecommunications
Abbreviated source title:Beijing Youdian Daxue Xuebao
Volume:29
Issue:SUPPL.
Issue date:May 2006
Publication year:2006
Pages:173-176
Language:Chinese
ISSN:10075321
CODEN:BYXBEV
Document type:Journal article (JA)
Publisher:Beijing University of Posts and Telecommunications
Abstract:Billing system is one of the most important parts of the next generation network. It
provides integrated services for consumers, including data services, voice services and video
services. Event splitting and rounding is an important problem of billing system to support flexible
rate policy. A common billing system architecture and a new spitting and rounding algorithm are
proposed. The implementation of billing system for integrated services network is introduced
based on the common billing system architecture. The spitting and rounding algorithm are
embedded.
Number of references:4
Main heading:Telecommunication services
Controlled terms:Architecture - Database systems - Quality of service
Uncontrolled terms:Billing - Data services - Event splitting - Integrated services - Next generation
network - Rounding - Usage record (UR) - Video services - Voice services
Classification code:717 Optical Communication - 723.3 Database Systems
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 278>
Accession number:20073210757375
Title:A decentralized service discovery algorithm for grid environment
Authors:Hu, Jianjun (1); Guan, Heqing (1); Zhong, Hua (1)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, P.O.Box 8718, Beijing,100080, China
Corresponding author:Hu, J.
       (hujj@otcaix.iscas.ac.cn)

Source title:ACM International Conference Proceeding Series
Abbreviated source title:ACM Int. Conf. Proc. Ser.
Volume:194
Monograph title:ACM International Conference Proceeding Series - Proceedings of the 4th
International Workshop on Middleware for Grid Computing (MGC'06) held at the
ACM/IFIP/USENIX International Middleware Conference
Issue date:2006
Publication year:2006
Pages:1186696
Language:English
ISBN-10:1595935819
ISBN-13:9781595935816
Document type:Conference article (CA)
Conference name:4th International Workshop on Middleware for Grid Computing (MGC'06) held
at the ACM/IFIP/USENIX International Middleware Conference
Conference date:November 27, 2006 - December 1, 2006
Conference location:Melbourne, Australia
Conference code:70033
Sponsor:Association for Computing Machinery
Publisher:Association for Computing Machinery, 1515 Broadway, 17th Floor, New York, NY
10036-5701, United States
Abstract:Traditional service discovery algorithms are not suitable for grid environment due to the
facts of inherited decentralization and loose coupling of grid application itself. To address this
problem, we present a novel grid oriented service discovery algorithm, namely DSDA, which is
essentially decentralized. DSDA also takes network latency and processing capability of service
nodes into account. &copy; 2006 ACM.
Main heading:Grid computing
Controlled terms:Algorithms - Problem solving - Quality of service
Uncontrolled terms:Decentralization - Network latency - Service discovery
Classification code:722.4 Digital Computers and Systems - 723 Computer Software, Data
Handling and Applications - 723.4 Artificial Intelligence
Treatment:Theoretical (THR)
DOI:10.1145/1186675.1186696
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 279>
<RECORD 1>
Accession number:20080311034738
Title:Novel graphical event-condition-action rules with enhanced expressiveness
Authors:Qiao, Ying (1); Zhong, Kang (1); Wang, Hongan (1); Li, Xiang (1)
Author affiliation:(1) Intelligence Engineering Lab., Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China
Corresponding author:Qiao, Y.
Source title:Proceedings of the IASTED International Conference on Intelligent Systems and
Control
Abbreviated source title:Proc. IASTED Int. Conf. Intell. Syst. Control
Monograph title:Proceedings of the Ninth IASTED International Conference on Intelligent
Systems and Control, ISC 2006
Issue date:2006
Publication year:2006
Pages:194-199
Language:English
ISSN:10258973
Document type:Conference article (CA)
Conference name:9th IASTED International Conference on Intelligent Systems and Control, ISC
2006
Conference date:August 14, 2006 - August 16, 2006
Conference location:Honolulu, HI, United states
Conference code:70931
Sponsor:The IASTED, Technical Committee on Control; The IASTED, Tech. Committee on
Intelligent Systems and Control
Publisher:Acta Press, Building B6, Suite 101, 2509 Dieppe Avenue S.W., Calgary, AB, T3E 7J9,
Canada
Abstract:To support higher level of intelligence in real-time applications, the real-time active
database (RTADB) should have powerful reasoning capability to solve complicated problems,
especially the problems with temporal properties. This consequently requires the
event-condition-action (ECA) rules in RTADB to have strong expressiveness for complicated
temporal information in the system. In this paper, we present a novel graphical ECA rule to
describe high-level complicated temporal information that is close to user's view. Furthermore,
smart home applications are used to validate the proposed rule.
Number of references:11
Main heading:Graphic methods
Controlled terms:Database systems - Graphical user interfaces - Information systems - Problem
solving - Real time systems
Uncontrolled terms:Event condition action rules - Real time active database - Temporal
information
Classification code:903.3 Information Retrieval and Use - 903.2 Information Dissemination -
723.5 Computer Applications - 723.4 Artificial Intelligence - 723.3 Database Systems - 722.4
Digital Computers and Systems - 722.2 Computer Peripheral Equipment
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 280>
Accession number:20074210865424
Title:A decentralized services choreography approach for business collaboration
Authors:Qiao, Xiaoqiang (1); Wei, Jun (1)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Qiao, X.
        (qxq@otcaix.iscas.ac.cn)

Source title:Proceedings - 2006 IEEE International Conference on Services Computing, SCC 2006
Abbreviated source title:Proc. IEEE Int. Conf. Serv. Comput.
Monograph title:Proceedings - 2006 IEEE International Conference on Services Computing, SCC
2006
Issue date:2006
Publication year:2006
Pages:190-197
Article number:4026921
Language:English
ISBN-10:0769526705
ISBN-13:9780769526706
Document type:Conference article (CA)
Conference name:2006 IEEE International Conference on Services Computing, SCC 2006
Conference date:September 18, 2006 - September 22, 2006
Conference location:Chicago, IL, United states
Conference code:70353
Sponsor:IEEE Computer Society, Technical Committee on Services Computing
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:In E-service environment, enterprises need to collaborate to achieve a common business
goal in loose-coupling manner. Therefore, it is of great necessity to develop a service
interoperation technique that is capable of handling the collaboration among distributed business
processes. The Web services architecture defines separate specifications for the choreography and
orchestration of Web services. This paper proposes a service choreography solution for business
collaboration across organizations boundaries while preserving the local autonomy of their own
business processes. A centralized service choreography process is built for specification of the
global business process, and then it is transformed to decentralized choreography processes
amongst the participants for peer-to-peer interaction. For each participant, a data dependency
based process mediation model is developed to facilitate the adaptation between the local
pre-established business process and its corresponding decentralized choreography process. This
mediation means can ensure the privacy and autonomy of local business process and the
adaptability of choreography process. A system architecture is implemented to support our
solution in ONCE PI project. &copy; 2006 IEEE.
Number of references:16
Main heading:Multimedia services
Controlled terms:Computer supported cooperative work - Data structures - Distributed computer
systems - Industrial economics - Mathematical models - Problem solving
Uncontrolled terms:Choreography - Global business process - Peer-to-peer interaction - System
architecture
Classification code:921 Mathematics - 911.2 Industrial Economics - 723.5 Computer Applications
- 723.4 Artificial Intelligence - 723.2 Data Processing and Image Processing - 722.4 Digital
Computers and Systems - 716 Telecommunication; Radar, Radio and Television
Treatment:Theoretical (THR)
DOI:10.1109/SCC.2006.1
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 281>
Accession number:20083611502514
Title:A Simulink-to-FPGA co-design of encryption module
Authors:Li, Xiaoying (1); Sun, Fuming (2); Wu, Enhua (1)
Author affiliation:(1) Department of Computer and Information Science, FST, University of
Science and Technology, Beijing, China; (2) School of Information Engineering, Univesity of
Science and Technology, Beijing, China; (3) State Key Lab. of Computer Science, Institute of
Software, Chinese Academy of Science, Beijing, China
Corresponding author:Li, X.
        (ya27404@umac.mo)

Source title:IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS
Abbreviated source title:IEEE Aisa Pac. Conf. Circuits Syst. Proc. APCCAS
Monograph title:APCCAS 2006 - 2006 IEEE Asia Pacific Conference on Circuits and Systems
Issue date:2006
Publication year:2006
Pages:2008-2011
Article number:4145813
Language:English
ISBN-10:1424403871
ISBN-13:9781424403875
Document type:Conference article (CA)
Conference name:APCCAS 2006 - 2006 IEEE Asia Pacific Conference on Circuits and Systems
Conference date:December 4, 2006 - December 6, 2006
Conference location:Singapore
Conference code:73083
Publisher:Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:In this paper, circuit design of an arithmetic module applied to cryptography - Modulo
Multiplicative Inverse is presented and implemented using FPGA hardware technology. This
modular arithmetic function contains iterative computations of division, multiplication and
accumulation with variable loop times. Besides standard HDL programming and schematic input,
Simulink-to-FPGA has been tried as a different design flow. Experimental results are compared
between different design methods with discussion of their pros and cons. &copy;2006 IEEE.
Number of references:7
Main heading:Integrated circuit manufacture
Controlled terms:Computer hardware description languages - Cryptography - Digital arithmetic -
Digital signal processing - Field programmable gate arrays (FPGA) - Networks (circuits) -
Number theory - Standards
Uncontrolled terms:Arithmetic unit - Asia-Pacific - Circuit designs - Co designs - Design flows -
Design methods - Encryption module - FPGA - Hardware technology - Iterative computations -
Modular arithmetic - Modulo - Simulink
Classification code:921 Mathematics - 902.2 Codes and Standards - 723.1.1 Computer
Programming Languages - 723 Computer Software, Data Handling and Applications - 721.2 Logic
Elements - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory,
Programming Theory - 716.1 Information Theory and Signal Processing - 714.2 Semiconductor
Devices and Integrated Circuits - 703.1 Electric Networks
DOI:10.1109/APCCAS.2006.342282
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 282>
Accession number:2006279981429
Title:Research on collaborative editing environment for conceptual design of 3D object
Authors:Teng, Dongxing (1); Ma, CuiXia (1); Zhou, Mingjun (1); Wang, Hongan (1); Dai,
Guozhong (1); Dong, Xinghui (2); Wu, Huiyue (3)
Author affiliation:(1) Intelligence Engineering Lab., Institute of Software, Chinese Academy of
Sciences, Beijing, China; (2) Department of Science and Technology, North China Electric Power
University, China; (3) Information Engineering College, Capital Normal University, Beijing,
China
Corresponding author:Teng, D.
       (tengdongxing@tsinghua.org.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3865 LNCS
Monograph title:Computer Supported Cooperative Work in Design II - 9th International
Conference, CSCWD 2005, Revised Selected Papers
Issue date:2006
Publication year:2006
Pages:445-454
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540329692
ISBN-13:9783540329695
Document type:Conference article (CA)
Conference name:9th International Conference on Computer Supported Cooperative Work in
Design, CSCWD 2005
Conference date:May 24, 2005 - May 26, 2005
Conference location:Coventry, United kingdom
Conference code:67619
Publisher:Springer Verlag
Abstract:Effective editing tools are very important to innovative design of 3D object. The
technologies for designing tools presented in this paper mainly involve collaborative mechanism
and natural interaction for collaborative editing environment. For collaborative mechanism, three
aspects are covered in this paper: one aspect is 3D object attributes analysis which is essential to
the conflict solution of collaborative design process. Interaction transaction log of 3D
collaborative editing environment and the system architecture are put forward and addressed as
another two aspects. Furthermore, based on interactive transaction log, the collaborative editing
mechanism is constructed and the conflict detection strategy during multi-user concurrency
editing process is also discussed. As for interaction naturalness, the pen-based gestures appropriate
to manipulating 3D model are covered briefly. Finally a prototype system has been built to fully
explore the above technologies. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:10
Main heading:Computer supported cooperative work
Controlled terms:Computer architecture - Mathematical models - Product design - Three
dimensional
Uncontrolled terms:3D collaborative editing - Designing tools - Effective editing tools
Classification code:722 Computer Systems and Equipment - 723.5 Computer Applications - 913.1
Production Engineering - 921 Mathematics
Treatment:Theoretical (THR)
DOI:10.1007/11686699_45
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 283>
Accession number:20064110165635
Title:Administration of multiple roles in the hybrid RBAC-DTE policy
Authors:Tang, Liu-Ying (1); Qing, Si-Han (2)
Author affiliation:(1) National Engineering Research Center for Fundamental Software, Institute
of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Engineering Research Center for
Information Security Technology, Institute of Software, Chinese Acad. of Sci., Beijing 100080,
China; (3) Beijing Zhongke Ansheng Corporation of Information Technology, Beijing 100086,
China; (4) Graduate University, Chinese Acad. of Sci., Beijing 100049, China
Corresponding author:Tang, L.-Y.
       (tangly@ercist.iscas.ac.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers
Abbreviated source title:Jisuanji Xuebao
Volume:29
Issue:8
Issue date:August 2006
Publication year:2006
Pages:1419-1426
Language:Chinese
ISSN:02544164
CODEN:JIXUDT
Document type:Journal article (JA)
Publisher:Science Press
Abstract:The hybrid Role Based Access Control-Domain and Type Enforcement (RBAC-DTE)
access control model has recently been given much attention due to its different level of protect
mechanisms. But no published literature has discussed administration of multiple roles in the
hybrid RBAC-DTE policy. From the aspect of privilege and access right, this paper proposes an
approach to dividing roles and domains that roles are more coarse-grained than domains, and
introduces a static-inheritance relationship between domains. This method for multirole
administration in the hybrid RBAC-DTE policy solves the problem of sharing access right set
among processes in different domains and the problem of controlling policy code size, especially,
supports the principle of least privilege sufficiently.
Number of references:12
Main heading:Network protocols
Controlled terms:Codes (symbols) - Management - Mathematical models - Security of data -
Theorem proving
Uncontrolled terms:Access rights - Capability mechanisms - Domain and type enforcement access
control - Hybrid RBAC-DTE access control - Least privilege principles - Multiple roles - Privilege
- Role based access control - Security policy
Classification code:716 Telecommunication; Radar, Radio and Television - 721.1 Computer
Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723
Computer Software, Data Handling and Applications - 912.2 Management - 921 Mathematics
Treatment:Applications (APP); Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 284>
Accession number:2006289986255
Title:Integrating grid with cryptographic computing
Authors:Jiang, Zhonghua (1); Lin, Dongdai (1); Xu, Lin (1); Lin, Lei (1)
Author affiliation:(1) State Key Laboratory Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Graduate School, Chinese Academy of Sciences,
Beijing 100039, China
Corresponding author:Jiang, Z.
        (jzh@cis.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3903 LNCS
Monograph title:Information Security Practice and Experience - Second International Conference,
ISPEC 2006, Proceedings
Issue date:2006
Publication year:2006
Pages:321-331
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540330526
ISBN-13:9783540330523
Document type:Conference article (CA)
Conference name:2nd International Conference on Information Security Practice and Experience,
ISPEC 2006
Conference date:April 11, 2006 - April 14, 2006
Conference location:Hangzhou, China
Conference code:67679
Sponsor:Singapore Management University, Singapore; Shanghai Jiaotong University, China;
Institute for Infocomm Research, Singapore
Publisher:Springer Verlag
Abstract:Cryptographic and information security applications often involve many time-consuming
computations, which need to be completed over heterogenous and geographically distributed
computers. However, there lacks a general-purpose cryptographic computing environment. Grid
technology can play a significant role in providing an efficient computational support for
cryptographic applications. In this paper, we describe a general-purpose software architecture
called Crypto-Grid for distributed high-performance cryptographic computing, which is designed
on the top level of computational grid mechanisms, supported by grid environments such as
Globus. The prototype implementation of Crypto-Grid under GT4 and experiment evaluation are
also revealed. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:15
Main heading:Security of data
Controlled terms:Computation theory - Computational methods - Computer science - Data privacy
- Information management - Public key cryptography
Uncontrolled terms:Cryptographic applications - Grid technology - High-performance
cryptographic computing - Time-consuming computations
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.2 Data Processing and Image Processing - 903.2 Information
Dissemination
Treatment:Theoretical (THR)
DOI:10.1007/11689522_30
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 285>
Accession number:20070510400303
Title:An encryption scheme based on DNA
Authors:Lu, Ming-Xin (1); Chen, Yuan (1); Qin, Lei (3); Xiao, Guo-Zhen (1)
Author affiliation:(1) State Key Lab. of Integrated Service Networks, Xidian Univ., Xi'an 710071,
China; (2) State Key Lab. of Information Security, Inst. of Software of Chinese Academy of
Sciences, Beijing 100049, China; (3) Cancer Research Inst., Queen's Univ., Kingston ON K7L3N6,
Canada
Corresponding author:Lu, M.-X.
Source title:Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University
Abbreviated source title:Xi'an Dianzi Keji Daxue Xuebao
Volume:33
Issue:6
Issue date:December 2006
Publication year:2006
Pages:939-942
Language:Chinese
ISSN:10012400
CODEN:XDKXEP
Document type:Journal article (JA)
Publisher:Science Press, 18,Shuangqing Street,Haidian, Beijing, 100085, China
Abstract:Using the technologies of DNA synthesis, DNA clone, PCR and DNA chip and the
theory of computational complexity, an encryption scheme is formed. In the scheme, encryption is
to confect a specially designed DNA mixture and decryption is the hybridization of DNA
sequances on a DNA chip (microarray). Thousands of billions of DNA probes are hybridized and
identified according to the Watson-Crick complementarity on a DNA chip simultaneously. The
great potential of DNA in vast parallelism computation and extraordinary information density is
shown in this scheme to some degree. The limitations of current DNA technology and
computational technology are the double guarantee for this scheme.
Number of references:9
Main heading:Cryptography
Controlled terms:Computational complexity - DNA - DNA sequences - Parallel processing
systems - Public key cryptography - Security of data - Signal processing
Uncontrolled terms:Computational technology - Decryption - DNA chip - DNA clone - DNA
computing - DNA cryptography - DNA mixture - DNA probes - DNA sequances hybridization -
DNA synthesis - DNA technology - Encryption - Encryption scheme - Information density -
Microarray - Parallelism computation - PCR - Watson Crick complementarity
Classification code:716.1 Information Theory and Signal Processing - 721.1 Computer Theory,
Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722.4 Digital
Computers and Systems - 723.2 Data Processing and Image Processing
Treatment:Applications (APP); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 286>
Accession number:20062910005062
Title:Weaknesses of COSvd (2,128) stream cipher
Authors:Zhang, Bin (1); Wu, Hongjun (2); Feng, Dengguo (1); Wang, Hong (3)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Katholieke Universiteit Leuven, Dept.
ESAT/COSIC, Belgium; (3) State Key Laboratory of Information Security, Graduate School,
Chinese Academy of Sciences, Beijing 100039, China
Corresponding author:Zhang, B.
       (martin.zhangbin@yahoo.com.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:3935 LNCS
Monograph title:Information Security and Cryptology, ICISC 2005 - 8th International Conference,
Revised Selected Papers
Issue date:2006
Publication year:2006
Pages:270-283
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540333541
ISBN-13:9783540333548
Document type:Conference article (CA)
Conference name:8th International Conference on Information Security and Cryptology, ICISC
2005
Conference date:December 1, 2005 - December 2, 2005
Conference location:Seoul, Korea, Republic of
Conference code:67732
Sponsor:Ministry of Information and Communication, Korea; Institute of Information Technology
Assessment, Korea; Solmaze Co., Ltd., Korea; K-Bell Co., Ltd., Korea; HAN Infocomm,, Co.,
Ltd., Korea
Publisher:Springer Verlag
Abstract:The COSvd (2,128) cipher was proposed at the ECRYPT SASC'2004 workshop by Filiol
et. al to strengthen the past COS (2,128) stream cipher. It uses clock-controlled non-linear
feedback registers filtered by a highly non-linear output function and was claimed to prevent any
existing attacks. However, as we will show in this paper, there are some serious security
weaknesses in COSvd (2,128). The poorly designed S-box generates biased keystrearn and the
message could be restored by a ciphertext-only attack in some broadcast applications. Besides, we
launch a divide-and-conquer attack to recover the secret keys from O(2<sup>26</sup>)-byte
known plaintext with high success rate and complexity O(2<sup>113</sup>), which is much
lower than 2<sup>512</sup>, the complexity of exhaustive search. &copy; Springer-Verlag
Berlin Heidelberg 2006.
Number of references:10
Main heading:Information analysis
Controlled terms:Computational complexity - Feedback - Function evaluation - Security systems -
Shift registers - Text processing
Uncontrolled terms:COS cipher - Divide-arid-Conquer - Non-linear feedback shift register -
Stream cipher
Classification code:921.6 Numerical Methods - 914.1 Accidents and Accident Prevention - 903.1
Information Sources and Analysis - 731.1 Control Systems - 723.5 Computer Applications - 721.3
Computer Circuits - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 287>
Accession number:2006219897354
Title:High performance navigation of very large-scale terrain environment
Authors:Li, Sheng (1); Ji, Jun-Feng (1); Liu, Xue-Hui (1); Wu, En-Hua (1)
Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China; (2) Department of Computer and Information Science,
University of Macau, Macao, China; (3) School of Electronics Engineering and Computer Science,
Peking University, Beijing 100871, China; (4) State Information Center, Beijing 100045, China
Corresponding author:Li, S.
        (lisheng@graphics.pku.edu.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:3
Issue date:March 2006
Publication year:2006
Pages:535-545
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:Interactive navigation of very large-scale terrain environment involves many difficulties
because of its out-of-core geometric data and texture, which can not be wholly loaded into the
internal memory. This paper puts forward a high performance technique for real-time walkthrough
of the large-scale terrain environments. It performs geometric simplification within each terrain
chunk during preprocessing and then generates a view-dependent continuous LOD of the whole
scene with geomorphing at runtime. Both silhouette preserving and shading preserving criteria are
satisfied by applying a new error metric-constrained normal cone to view-independent
simplification. The generated models for rendering is more suitable to human's perception than
those by traditional geometric simplification criterion. Furthermore, the pre-extracted potential
silhouette of each chunk can be used to construct the incremental horizon dynamically. This can
prevent the ineffectual data from loading into the main memory and reduce the out-of-core paging
and the number of triangles feeding to the renderer, thus lead to significant saving in interactive
rendering. This paper also makes use of the advantage of GPU to generate lighting and shadow for
large-scale outdoor environment, and balances the tradeoff between GPU, CPU and I/O through
multi-thread.
Number of references:24
Main heading:Computer graphics
Controlled terms:Geomorphology - Lighting - Navigation - Textures - Virtual reality
Uncontrolled terms:Constrained normal cone - Geometric data - Geometric simplification -
Graphic processing units (GPU) - Incremental horizon - Interactive navigation - Interactive
walkthrough - Potential silhouette - Progressive mesh - Real time walkthrough - Shadow map -
Triangles feeding - Very large scale terrain - View dependent
Classification code:431.5 Air Navigation and Traffic Control - 481.1.1 Geomorphology - 707
Illuminating Engineering - 723 Computer Software, Data Handling and Applications - 933 Solid
State Physics
Treatment:Applications (APP)
DOI:10.1360/jos170535
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 288>
Accession number:2006219897341
Title:Fault identification algorithm for satellite networks based on system level diagnosis
Authors:Hou, Xia (1); Fan, Zhi-Hua (1); Hu, Gang (1); Li, Lei (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Hou, X.
        (helenhou0927@hotmail.com)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:3
Issue date:March 2006
Publication year:2006
Pages:388-395
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:It is a challenge to support the fault tolerance for satellite networks, in which fault
identification is primary. After modeling satellite networks with two-level-node graph, a fault
identification algorithm based on PMC test invalidation model is presented and proved to be
correct. The effectiveness of the algorithm in different types of satellite networks is compared and
studied by simulations. The results of experiments illustrate that the algorithm adapts to arbitrary
network topology and has robustness.
Number of references:8
Main heading:Satellite communication systems
Controlled terms:Diagnosis - Identification (control systems) - Robustness (control systems) -
Topology
Uncontrolled terms:Ad hoc network - Fault identification - Fault tolerance - Inter satellite links
(ISLs) - Network topology - Satellite network - System level diagnosis - Two level node graph
Classification code:461.6 Medicine and Pharmacology - 655.2.1 Communication Satellites - 731.1
Control Systems - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory
Treatment:Applications (APP)
DOI:10.1360/jos170388
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 289>
Accession number:2006269966275
Title:Performance model and simulation on the wireless local area network
Authors:Huangfu, Wei (1); Lei, Wen (1); Sheng, Ling-Zhi (1); Zhou, Xin-Yun (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China;
(2) Graduate School, Chinese Academy of Sciences, Beijing 100039, China
Corresponding author:Huangfu, W.
        (huangfuwei@ios.cn)

Source title:Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and
Telecommunications
Abbreviated source title:Beijing Youdian Daxue Xuebao
Volume:29
Issue:SUPPL.
Issue date:May 2006
Publication year:2006
Pages:1-5
Language:Chinese
ISSN:10075321
CODEN:BYXBEV
Document type:Journal article (JA)
Publisher:Beijing University of Posts and Telecommunications
Abstract:A stochastic service system model based on the media access control protocol is provided
for the performance estimation, and the connection admission control algorithm design of wireless
local area networks. The network performances for various numbers of stations and various traffic
loads are obtained based on the model and queue theory. Furthermore, it is presented that the
network performances will deteriorate seriously when the traffic exceeds the saturated threshold in
the wireless network with numerous stations and thus it provides theoretically results for the
connection admission control algorithm. The model and conclusions are verified by simulations.
Number of references:11
Main heading:Local area networks
Controlled terms:Computer simulation - Estimation - Markov processes - Performance - Queueing
theory - Wireless telecommunication systems
Uncontrolled terms:Connection admission control - Distributed coordination function (DCF) -
Markov chain - Media access control - Network performances - Point coordination function (PCF)
- Short interframe space (SIFS) - Stochastic service system model - Traffic loads - Wireless local
area network
Classification code:717 Optical Communication - 723.5 Computer Applications - 921
Mathematics - 922.1 Probability Theory
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 290>
Accession number:2006069682834
Title:Placement algorithm for the wireless sensor network
Authors:Lin, Zhiting (1); Qu, Yugui (1); Zhai, Yujia (1); Zhao, Baohua (1)
Author affiliation:(1) Department of Electronic Engineering and Information Science, University
of Science and Technology of China, Hefei 230027, China; (2) Laboratory of Computer Science,
Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (3) Department of
Electronic Engineering and Information Science, University of Science and Technology of China;
(4) University of Science and Technology of China
Corresponding author:Lin, Z.
Source title:Chinese Journal of Electronics
Abbreviated source title:Chin J Electron
Volume:15
Issue:1
Issue date:January 2006
Publication year:2006
Pages:179-182
Language:English
ISSN:10224653
CODEN:CHJEEW
Document type:Journal article (JA)
Publisher:Chinese Institute of Electronics
Abstract:Wireless sensor networks (WSN) are deployed to monitor the physical world and to
provide relevant data to the users. The coverage problem of WSN is one of the hot topics of
research. Deploying insufficient nodes might leave blind spots or sensing holes, which can allow
the object such as enemy to pass through. In this paper, a new algorithm MIN_STD_COV is
proposed for the efficient coverage in the sensor field, which is designed to optimize the number
of sensors and find out their placement to support distributed sensor networks. The
MIN_STD_COV chases down the grid point which makes the wireless sensor network have the
minimum Standard deviation (STD) during iteration. What should be emphasized is that the
redundant coverage is taken into account in the new algorithm MIN_STD_COV. It's important for
the algorithm to perform well in some conditions, i.e. preferential coverage. At the same time, we
demonstrate that the placement problem can be translated into Integer Programming problem (IP)
in order to obtain the global optimum value. In other words, two different solutions are presented
in this paper. MIN_STD_COV would be compared to MAX_AVG_COV as well as to
MAX_MIN_COV. Whether the preferential coverage is considered or not, it would be shown to
exhibit excellent performance via simulations.
Number of references:7
Main heading:Wireless telecommunication systems
Controlled terms:Algorithms - Integer programming - Network protocols - Optimization -
Problem solving - Sensors
Uncontrolled terms:Coverage - Placement algorithm - Standard deviation (STD) - Wireless sensor
networks
Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer
Software, Data Handling and Applications - 732.2 Control Instrumentation - 921 Mathematics -
921.5 Optimization Techniques
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 291>
Accession number:20072610672114
Title:LTL model checking via search space partition
Authors:Pu, Fei (1); Zhang, Wenhui (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Laboratory of
Computer Science, P.O.Box 8718, 100080 Beijing, China
Corresponding author:Pu, F.
        (pufei@amss.ac.cn)

Source title:Proceedings - International Conference on Quality Software
Abbreviated source title:Proc. Int. Conf. Qual. Softw.
Monograph title:Proceedings - Sixth International Conference on Quality Software, QSIC 2006
Issue date:2006
Publication year:2006
Pages:418-425
Article number:4032313
Language:English
ISSN:15506002
ISBN-10:0769527183
ISBN-13:9780769527185
Document type:Conference article (CA)
Conference name:6th International Conference on Quality Software, QSIC 2006
Conference date:October 27, 2006 - October 28, 2006
Conference location:Beijing, China
Conference code:69805
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:The applicability of model checking is often limited by the size of the industrial system.
This is known as state space explosion problem. Compositional verification has been particularly
successful in this regard. This paper presents an approach based on a refinement of search space
partition for reducing the complexity in verification of models with non-deterministic choices and
open environment. The refinement depends on the representation of each portion of search space.
Especially, search space can be refined stepwise to get better reduction. As reported in the case
studies, search space partition improves the efficiency of verification with respect to the
requirement of memory and obtains significant advantage over the use of the original one. &copy;
2006 IEEE.
Number of references:15
Main heading:Model checking
Controlled terms:Computational complexity - Mathematical models - State space methods
Uncontrolled terms:Industrial systems - Search space partition - State space explosion
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 921 Mathematics
Treatment:Theoretical (THR)
DOI:10.1109/QSIC.2006.37
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 292>
Accession number:20071410531384
Title:An entity-relationship model based conceptual framework for model driven development
Authors:Duan, Yucong (1); Cheung, Shing-Chi (2); Fu, Xiaolan (3); Gu, Yuqing (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, China; (2) Department
of Computer Science, Hong Kong University of Science and Technology, China; (3) State Key
Laboratory of Brain and Cognitive Science, Institute of Psychology, Chinese Academy of Sciences,
China
Corresponding author:Duan, Y.
       (duanyucong@263.net)

Source title:Proceedings of the IASTED International Conference on Software Engineering, as
part of the 24th IASTED International Multi-Conference on APPLIED INFORMATICS
Abbreviated source title:Proc. IASTED Int. Conf. Softw. Eng. 24th Int. Multi-Conf. Applied
Informatics
Volume:2006
Monograph title:Proceedings of the IASTED International Conference on Software Engineering,
as part of the 24th IASTED International Multi-Conference on APPLIED INFORMATICS
Issue date:2006
Publication year:2006
Pages:200-205
Language:English
ISBN-10:0889865744
ISBN-13:9780889865747
Document type:Conference article (CA)
Conference name:IASTED International Conference on Software Engineering, as part of the 24th
IASTED International Multi-Conference on APPLIED INFORMATICS
Conference date:Febrary 14, 2006 - Febrary 16, 2006
Conference location:Innsbruck, Austria
Conference code:69410
Sponsor:IASTED Technical Committee on Software Engineering; World Modelling and
Simulation Forum (WMSF)
Publisher:Int. Assoc. of Science and Technology for Development, 4500 16th Ave. N.W. - Suite 80,
Calgery - Alberta, T3B OM6, Canada
Abstract:The Unified Modeling Language (UML) is a defacto notation for model driven software
development (MDSD), emphasizing on model to model refinements and transformations.
However UML may not be expressive enough to describe all aspects as required by recent MDSD
models. A noticeable weakness is its inability to express the ontological concepts often
encountered in MDSD. In this paper, we propose an extended Entity-Relationship (ER) model
called Runtime Entity-Relationship model (RER) for ontological modeling of common MDSD
concepts. Different layers of the UML metamodel hierarchy are analyzed in the context of
modeling the MDSD using the RER model. Modifications of the UML architecture for more
precise modeling of MDSD are suggested.
Number of references:42
Main heading:Unified Modeling Language
Controlled terms:Computer architecture - Hierarchical systems - Mathematical transformations -
Metadata - Ontology - Software engineering
Uncontrolled terms:Entity-Relationship (ER) model - Model driven software development
(MDSD) - Runtime Entity-Relationship model (RER)
Classification code:722 Computer Systems and Equipment - 723.1.1 Computer Programming
Languages - 921.3 Mathematical Transformations - 961 Systems Science
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 293>
Accession number:20063410082589
Title:3D interaction techniques based on semantics in virtual environments
Authors:Ji, Lian-En (1); Zhang, Feng-Jun (1); Fu, Yong-Gang (1); Dai, Guo-Zhong (1)
Author affiliation:(1) Laboratory of Human-Computer Interaction and Intelligent Information
Processing, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2)
Graduate School, Chinese Academy of Sciences, Beijing 100049, China
Corresponding author:Ji, L.-E.
       (lianen03@ios.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:7
Issue date:July 2006
Publication year:2006
Pages:1535-1543
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:Natural and efficient 3D interaction techniques play one of the key roles in the
development of virtual reality systems. Most of these techniques, which are used currently, mainly
aim at supporting the implementation of interaction tasks in geometric level. As a result, they
usually lack of the sufficient ability for executing those interaction tasks that orient to high-level
application. Based on the cognitive principles in the real world, interaction objects in virtual
environments not only include some geometric attributes in the visual view, but also own some
specific semantic attributes such as interaction rules, constraints and affordances, which are
related with interaction process tightly. In this paper these objects are called semantic objects, in
the sense that they know how the user can interact with them, giving clues to aid the interaction.
Through parsing and interpreting interaction semantics, these semantic objects can help to realize
high-level interaction metaphors above 'direct manipulation'. Because they hide low-level details
about the implementation of interaction techniques, this kind of metaphors evidently improve the
efficiency and usability of interaction techniques, and enable user to concentrate more on the
high-level interaction control directly related with the special applications.
Number of references:15
Main heading:Virtual reality
Controlled terms:Feedback - Navigation - Semantics
Uncontrolled terms:3D interaction technique - Cognitive principles - Object manipulation -
Semantic object - System control - Virtual environment - Visual view
Classification code:723 Computer Software, Data Handling and Applications - 731.1 Control
Systems - 903.2 Information Dissemination
Treatment:Applications (APP)
DOI:10.1360/jos171535
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 294>
Accession number:2006229911979
Title:Negotiation-based approach for software process collaboration
Authors:Zhao, Xinpei (1); Li, Mingshu (1); Chan, Keith (3); Wang, Qing (1)
Author affiliation:(1) Laboratory for Internet Software Technology, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) State Key Laboratory of Computer Science,
Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (3) Department of
Computing, Hong Kong Polytechnic University, Hong Kong, Hong Kong
Corresponding author:Zhao, X.
        (xinpei@itechs.iscas.ac.cn)

Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development
Abbreviated source title:Jisuanji Yanjiu yu Fazhan
Volume:43
Issue:2
Issue date:February 2006
Publication year:2006
Pages:314-320
Language:Chinese
ISSN:10001239
CODEN:JYYFEY
Document type:Journal article (JA)
Publisher:Science Press
Abstract:Large-scale software development typically requires participation of multiple people.
One motivation of the participants to collaborate with others is to maximize the profit they may
gain from the software development. Therefore, the collaborative relations between the
participants should be established through negotiation in order to ensure that all the participants
can gain profit. Traditional software process modeling approaches model software collaboration as
a set of rules or transactions. When entry criteria are satisfied or operations are explicitly invoked,
the collaborations will take place necessarily and are performed in a predefined manner.
Negotiation issues are mostly overlooked by these approaches. A negotiation-based approach for
software process collaboration is proposed, In this approach, software process is modeled as a
group of independent, autonomous, rational, and collaborative process agents. The collaborative
relations between the process agents are established through negotiation. Using this approach,
software organizations can carry out software development more efficiently and effectively.
Number of references:12
Main heading:Software engineering
Controlled terms:Artificial intelligence - Computer simulation - Computer software - Information
management
Uncontrolled terms:Modeling approaches - Negotiation - Process agents - Resource payment -
Software development - Software organizations - Software process collaboration - Software
process modeling
Classification code:723.1 Computer Programming - 723.4 Artificial Intelligence - 723.5 Computer
Applications - 903.2 Information Dissemination - 912.2 Management
Treatment:Applications (APP)
DOI:10.1360/crad20060219
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 295>
Accession number:20064210187291
Title:Multi-continued fraction algorithms and their applications to sequences
Authors:Dai, Zongduo (0)
Corr. author affiliation:State Key Laboratory of Information Security, Institute of Software,
Chinese Academy of Sciences, Beijing, 100080, China
Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4086 LNCS
Monograph title:Sequences and Their Applications, SETA 2006 - 4th International Conference,
Proceedings
Publication year:2006
Pages:17-33
Language:English
ISSN:03029743
E-ISSN:16113349
Document type:Conference article (CA)
Conference name:4th International Conference on Sequences and Their Applications, SETA 2006
Conference date:Sep 24 - 28 2006
Conference location:Beijing, China
Conference code:68303
Publisher:Springer Verlag, Heidelberg, Germany
Abstract:No abstract available
Number of references:26
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 296>
Accession number:20064110165445
Title:Performance study of real-time traffic in wireless local area network with different kind of
stations
Authors:Sheng, Ling-Zhi (1); HuangFu, Wei (1); Lei, Wen (1); Wu, Zhi-Mei (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Science, Beijing 100080, China;
(2) Graduate School, Chinese Academy of Science, Beijing 100039, China
Corresponding author:Sheng, L.-Z.
Source title:Tongxin Xuebao/Journal on Communication
Abbreviated source title:Tongxin Xuebao
Volume:27
Issue:4
Issue date:April 2006
Publication year:2006
Pages:16-22
Language:Chinese
ISSN:1000436X
Document type:Journal article (JA)
Publisher:Editorial Board of Journal on Communications
Abstract:For IEEE 802.11 DCF wireless local area network with different MAC options and
applications, a novel model was proposed to analyze the contention performance in saturation
channel state. By making use of discrete Markov chain, the performance of throughput, delay and
frame dropping ratio was studied in detail. Then this model was validated by simulation results.
Furthermore, the model and analysis prove that better performance could be achieved by changing
minimum contention window or maximum backoff counter for the real-time flows, which gives an
in-depth understanding and insights into the effects of different parameters on the performance.
Number of references:9
Main heading:Local area networks
Controlled terms:Communication channels (information theory) - Computer aided analysis -
Markov processes - Performance - Radio - Real time systems - Simulation - Standards -
Telecommunication traffic - Wireless telecommunication systems
Uncontrolled terms:Delay - Discrete Markov chain - Frame dropping ratio - IEEE 802.11 DCF -
Media access control (MAC) - Performance analysis - Real time traffic - Saturation state -
Throughput performance - Wireless local area network
Classification code:716.1 Information Theory and Signal Processing - 716.3 Radio Systems and
Equipment - 723.5 Computer Applications - 912.2 Management - 922.1 Probability Theory
Treatment:Applications (APP); Experimental (EXP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 297>
Accession number:2006259948878
Title:Efficient translation from transition-based generalized Buchi automata to Buchi automata
Authors:Yi, Jin (1); Zhang, Wen-Hui (1)
Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China; (2) School of Information Science and Engineering, Graduate
School, Chinese Academy of Sciences, Beijing 100049, China
Corresponding author:Yi, J.
        (yijin@ios.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:4
Issue date:April 2006
Publication year:2006
Pages:720-728
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:The automata-theoretic approach is one of the state-of-the-art model-checking methods,
which consists of the following steps: use a Buchi automaton to represent the abstract system
model; use an LTL formula to express the properties to be verified; translate the negation of the
LTL formula to a Buchi automaton and check whether the intersection of sentences accepted by
the two automata is non-empty. One type of methods for translating LTL formulas to Buchi
automata has one step for calculating transition-based generalized Buchi automata (TGBA) and
another step for translating TGBA to Buchi automata. This paper redefines the product operation
of TGBA according to the characteristics of the accepting language of Buchi automata. This leads
to the reduction of the number of states that need to be copied and therefore smaller Buchi
automata. The experimental results given at the end of this paper demonstrate the advantage of the
approach based on test cases with randomly generated formulas.
Number of references:16
Main heading:Automata theory
Controlled terms:Automation - Calculations - Computer science - Formal languages - Formal
logic - Intersections
Uncontrolled terms:Abstract system model - Atomic proposition - Buchi automata - Linear
temporal logic (LTL) - Model checking - Negation normal form (NNF) - Transition based
generalized Buchi automaton (TGBA) - Very weak alternating Co-Buchi automaton (VWAA)
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723 Computer Software, Data Handling and Applications - 731
Automatic Control Principles and Applications
Treatment:Applications (APP)
DOI:10.1360/jos170720
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 298>
Accession number:2006279980626
Title:Analysis and design on a framework of Portlet cooperation
Authors:Chen, Yulin (0); Xu, Shuren (0); Song, Jingyu (0); Wan, Shuchao (0)
Corr. author affiliation:Institute of Software, Chinese Academy of Sciences, Beijing 100080,
China
Source title:Jisuanji Gongcheng/Computer Engineering
Abbreviated source title:Jisuanji Gongcheng
Volume:32
Issue:11
Issue date:Jun 5 2006
Publication year:2006
Pages:86-88
Language:Chinese
ISSN:10003428
CODEN:JISGEV
Document type:Journal article (JA)
Publisher:Shanghai Computer Society, Shanghai, China
Abstract:Portal is universally deployed and used for publishing information in more and more
J2EE applications. Portlet is the component of Portal. In development of Portlet, Portlet
cooperation is strongly needed. However, the current Java Portlet specification (version 1.0),
doesn't provide a usable framework of inter-Portlet communication, which doesn't satisfy the
demands of portal application. Based on the standard Portlet specification, the paper proposes a
framework of Portlet cooperation, and the different implementations based on two kinds of
communication mechanisms are further introduced. The framework has been successfully applied
in ONCEPortal system.
Number of references:5
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 299>
Accession number:2006129773009
Title:Petri net refinement and its application in system design
Authors:Xia, Chuan-Liang (1); Jiao, Li (2); Lu, Wei-Ming (1)
Author affiliation:(1) Department of Computer Science, Academy of Mathematics and System
Sciences, Chinese Academy of Sciences, Beijing 100080, China; (2) Laboratory of Computer
Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Xia, C.-L.
        (xcl@amss.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software
Abbreviated source title:Ruan Jian Xue Bao
Volume:17
Issue:1
Issue date:January 2006
Publication year:2006
Pages:11-19
Language:Chinese
ISSN:10009825
CODEN:RUXUEW
Document type:Journal article (JA)
Publisher:Chinese Academy of Sciences
Abstract:A scheme is obtained by using some kinds of Petri net refinement, according to the
design of flexible manufacturing system. Two kinds of refinement are obtained. Dynamic
properties have been investigated. The sufficient and necessary conditions of liveness preservation,
boundedness preservation and reversibility preservation are presented. A flexible manufacturing
system has been designed and verified. These results are useful for studying the static and
dynamic properties of Petri nets and analyzing properties of large complex system. The refinement
method is especially fit for the design of flexible manufacturing system and practical to use in
reality.
Number of references:13
Main heading:Flexible manufacturing systems
Controlled terms:Industrial robots - Large scale systems - Mathematical models - Petri nets -
Systems analysis - Theorem proving
Uncontrolled terms:Boundedness preservation - Liveness preservation - Petri net refinement -
Reversibility preservation - Subnet systems - Target net systems
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.4 Artificial Intelligence - 731.1 Control Systems - 912.3
Operations Research - 913.4.1 Flexible Manufacturing Systems - 921.4 Combinatorial
Mathematics, Includes Graph Theory, Set Theory
Treatment:Applications (APP); Theoretical (THR)
DOI:10.1360/jos170011
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 300>
Accession number:20073310758966
Title:Combining replication with transaction processing for enhanced reliability in J2EE
Authors:Zuo, Lin (1); Liu, Shaohua (1); Wei, Jun (1)
Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, China; (2)
Graduate School, Chinese Academy of Sciences, Beijing, China
Corresponding author:Zuo, L.
       (martin_zl@otcaix.iscas.ac.cn)

Source title:Proceedings - International Symposium on Software Reliability Engineering, ISSRE
Abbreviated source title:Proc. Int. Symp. Softw. Reliab. Eng.
Monograph title:Proceedings - 17th International Symposium on Software Reliability Engineering,
ISSRE 2006
Issue date:2006
Publication year:2006
Pages:279-288
Article number:4021994
Language:English
ISSN:10719458
CODEN:PSSRFV
ISBN-10:0769526845
ISBN-13:9780769526843
Document type:Conference article (CA)
Conference name:17th International Symposium on Software Reliability Engineering, ISSRE
2006
Conference date:November 7, 2006 - November 10, 2006
Conference location:Raleigh, NC, United states
Conference code:70041
Sponsor:IEEE Computer Society; IEEE Computer Society Tech. Council on Software Eng.
(TCSE); IEEE Reliability Society
Publisher:IEEE Computer Society, 10662 Los Vaqueros Circle - P.O. Box 3014, Los Alamitos, CA
90720-1314, United States
Abstract:The multi-tier architecture of J2EE provides good modularity and scalability by
partitioning an application into several tiers, and becomes the mainstream for distributed
applications development on Internet/Intranet. Current reliability solutions in this architecture are
typically dependent on either replication, which provides at-least-once guarantee, or transaction
processing, which guarantees at-most-once semantics. In practice, the end-to-end reliability
guarantee of exactly-once semantics is necessary, especially for some complex transaction
scenarios, such as client transaction or nested transaction. In this paper, we describe a
fault-tolerant algorithm that can provide this enhanced reliability support through combining
replication and transaction processing. We use passive replication to protect business processing at
middle-tier application server. A client stub transparently intercepts client request and
automatically resubmits it in the case of failure. In addition, transaction coordinator is passively
replicated to prevent the blocking problem of distributed transaction. Also, different application
scenarios are discussed to illustrate the effectivity of this algorithm, and a performance study
based on our implementation in J2EE application server, OnceAS, shows the overhead of it is
acceptable. &copy;2006 IEEE.
Number of references:24
Main heading:Java programming language
Controlled terms:Algorithms - Semantics - Servers - Software architecture - Software reliability
Uncontrolled terms:Business processing - End-to-end reliability - Transaction coordinator -
Transaction processing
Classification code:722 Computer Systems and Equipment - 723.1.1 Computer Programming
Languages - 723.5 Computer Applications - 903.2 Information Dissemination
Treatment:Theoretical (THR)
DOI:10.1109/ISSRE.2006.20
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 301>
Accession number:20071210494149
Title:CATSMLP: Toward a robust and interpretable multilayer perceptron with sigmoid activation
functions
Authors:Chung, Fu-Lai (1); Wang, Shitong (1); Deng, Zhaohong (1); Hu, Dewen (4)
Author affiliation:(1) Department of Computing, Hong Kong Polytechnic University, Kowloon,
Hong Kong; (2) School of Information Technology, Southern Yangtse University, Wuxi 214036,
China; (3) National Key Laboratory of Computer Science, Institute of Software, Chinese Academy
of Sciences, Beijing 100080, China; (4) School of Automation, National Defense University of
Science and Technology, Changsha 410073, China
Corresponding author:Chung, F.-L.
       (cskchung@comp.polyu.edu.hk)

Source title:IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Abbreviated source title:IEEE Trans Syst Man Cybern Part B Cybern
Volume:36
Issue:6
Issue date:December 2006
Publication year:2006
Pages:1319-1331
Language:English
ISSN:10834419
CODEN:ITSCFI
Document type:Journal article (JA)
Publisher:Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Enhancing the robustness and interpretability of a multilayer perceptron (MLP) with a
sigmoid activation function is a challenging topic. As a particular MLP, additive TS-type, MLP
(ATSMLP) can be interpreted based on single-stage fuzzy IF-THEN rules, but its robustness will
be degraded with the increase in the number of intermediate layers. This paper presents a new
MLP model called cascaded ATSMLP (CATSMLP), where the ATSMLPs are organized in a
cascaded way. The proposed CATSMLP is a universal approximator and is also proven to be
functionally equivalent to a fuzzy inference system based on syllogistic fuzzy reasoning.
Therefore, the CATSMLP may be interpreted based on syllogistic fuzzy reasoning in a theoretical
sense. Meanwhile, due to the fact that syllogistic fuzzy reasoning has distinctive advantage over
single-stage IF-THEN fuzzy reasoning in robustness, this paper proves in an indirect way that the
CATSMLP is more robust than the ATSMLP in an upper-bound sense. Several experiments were
conducted to confirm such a claim. &copy; 2006 IEEE.
Number of references:32
Main heading:Multilayer neural networks
Controlled terms:Approximation theory - Cascade control systems - Fuzzy inference - Fuzzy
neural networks - Fuzzy systems - Mathematical models - Robustness (control systems)
Uncontrolled terms:Approximators - Cascaded multilayer perceptron (MLP) - Interpretability -
Sigmoid activation functions - Syllogistic fuzzy reasoning - Universal approximation
Classification code:961 Systems Science - 921.6 Numerical Methods - 921 Mathematics - 731.1
Control Systems - 723.4.1 Expert Systems - 723.4 Artificial Intelligence - 721.1 Computer Theory,
Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory
Treatment:Theoretical (THR); Experimental (EXP)
DOI:10.1109/TSMCB.2006.875871
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 302>
Accession number:2006129770212
Title:Extraction of line segments and circular arcs from freehand strokes based on segmental
homogeneity features
Authors:Zhang, Xiwen (1); Song, Jiqiang (3); Dai, Guozhong (1); Lyu, Michael R. (2)
Author affiliation:(1) Laboratory of Human-Computer Interaction and Intelligent Information
Processing, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2)
Department of Computer Science and Engineering, Chinese University of Hong Kong, Shatin,
N.T., Hong Kong; (3) Hong Kong Applied Science and Technology Research Institute, Science
Park, Shatin, N.T., Hong Kong
Corresponding author:Zhang, X.
        (xwzhang@cse.cuhk.edu.hk)

Source title:IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Abbreviated source title:IEEE Trans Syst Man Cybern Part B Cybern
Volume:36
Issue:2
Issue date:April 2006
Publication year:2006
Pages:300-311
Language:English
ISSN:10834419
CODEN:ITSCFI
Document type:Journal article (JA)
Publisher:Institute of Electrical and Electronics Engineers Inc.
Abstract:The extraction of component line segments and circular arcs from freehand strokes along
with their relations is a prerequisite for sketch understanding. Existing approaches usually take
three stages to segment a stroke: first identifying segmentation points, then classifying the
substroke between each pair of adjacent segmentation points, and, finally, obtaining graphical
representations of substrokes by fitting graphical primitives to them. Since a stroke inevitably
contains noises, the first stage may produce wrong or inaccurate segmentation points, resulting in
the wrong substroke classification in the second stage and inaccurately fitted parameters in the
third stage. To overcome the noise sensitivity of the three-stage method, the segmental
homogeneity feature is emphasized in this paper. We propose a novel approach, which first
extracts graphical primitives from a stroke by a connected segment growing from a seed-segment
and then utilizes relationships between the primitives to refine their control parameters. We have
conducted experiments using real-life strokes and compared the proposed approach with others.
Experimental results demonstrate that the proposed approach is effective and robust. &copy; 2006
IEEE.
Number of references:23
Main heading:Pattern recognition systems
Controlled terms:Feature extraction - Graphic methods - Image analysis - Image segmentation
Uncontrolled terms:Segment homogeneity feature - Sketch understanding - Stroke recognition -
Stroke segmentation
Classification code:723.2 Data Processing and Image Processing - 723.5 Computer Applications
Treatment:Experimental (EXP)
DOI:10.1109/TSMCB.2005.857288
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 303>
Accession number:20072610672111
Title:Reconstruct the distributed transaction monitor OnceTX
Authors:Jin, Beihong (1); Li, Gang (1); Zhang, Liang (1)
Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Hai Dian, Beijing, China
Corresponding author:Jin, B.
       (jbh@otcaix.iscas.ac.cn)

Source title:Proceedings - International Conference on Quality Software
Abbreviated source title:Proc. Int. Conf. Qual. Softw.
Monograph title:Proceedings - Sixth International Conference on Quality Software, QSIC 2006
Issue date:2006
Publication year:2006
Pages:393-400
Article number:4032310
Language:English
ISSN:15506002
ISBN-10:0769527183
ISBN-13:9780769527185
Document type:Conference article (CA)
Conference name:6th International Conference on Quality Software, QSIC 2006
Conference date:October 27, 2006 - October 28, 2006
Conference location:Beijing, China
Conference code:69805
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Distributed transaction monitor is the fundamental software for critical transactional
applications across network. We concern its quality from the point of view of practicality. This
paper presents the key technologies during the reconstruction of the distributed transaction
monitor OnceTX1.0 to OnceTX2.0, including scalable architecture, multi-phase concurrency
control, dynamic configuration and access for system services, and optimization of message
organization and processing. OnceTX2.0 is now applicable to not only small-scale and
tight-coupling transaction applications, but also geographically dispersed applications with
transaction demands. Its performance has also been enhanced, which is proved by the benchmark
results. Moreover, extensibility and maintainability are achieved. &copy; 2006 IEEE.
Number of references:13
Main heading:Distributed computer systems
Controlled terms:Computer architecture - Concurrency control - Data processing - Optimization -
Scalability
Uncontrolled terms:Distributed transaction monitor - Dynamic configuration - Message
organization - Tight-coupling transaction
Classification code:722.4 Digital Computers and Systems - 723.2 Data Processing and Image
Processing - 723.3 Database Systems - 921.5 Optimization Techniques - 961 Systems Science
Treatment:Theoretical (THR)
DOI:10.1109/QSIC.2006.52
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 304>
Accession number:20080711094611
Title:High performance Web services based on service-specific SOAP processor
Authors:Li, Lei (1); Niu, Chunlei (2); Chen, Ningjiang (3); Wei, Jun (2)
Author affiliation:(1) Department of Computer Science, University of Science and Technology of
China; (2) Institute of Software, Chinese Academy of Sciences; (3) College of Computer,
Electronic and Information, Guangxi University
Corresponding author:Li, L.
        (lilei@otcaix.iscas.ac.cn)

Source title:Proceedings - ICWS 2006: 2006 IEEE International Conference on Web Services
Abbreviated source title:Proc. ICWS IEEE Int. Conf. Web Serv.
Monograph title:Proceedings - ICWS 2006: 2006 IEEE International Conference on Web Services
Issue date:2006
Publication year:2006
Pages:603-610
Article number:4032074
Language:English
ISBN-10:0769526691
ISBN-13:9780769526690
Document type:Conference article (CA)
Conference name:ICWS 2006: 2006 IEEE International Conference on Web Services
Conference date:September 18, 2006 - September 22, 2006
Conference location:Chicago, IL, United states
Conference code:71350
Sponsor:IEEE Computer Society, Technical Committee on Services Computing
Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane - P.O.Box 1331,
Piscataway, NJ 08855-1331, United States
Abstract:Web services, with an emphasis on open standards and flexibility, can provide benefits
over existing capital markets integration practices. However, Web services must first meet certain
technical requirements including performance, security and so on. SOAP, based on Extensible
Markup Language (XML), inherits not only the advantages of XML, but its relatively poor
performance. This makes SOAP a poor choice for many highperformance web services. In this
paper, we propose a new approach to improve Web services performance. Focusing on avoiding
traditional XML parsing and Java reflection at runtime, we create a service-specific SOAP
processor to accelerate execution. Through our experiments in this paper, we observed that our
approach obtained about a treble performance gain (maximum) by incorporating the SOAP
processor into the SOAP engine. &copy; 2006 IEEE.
Number of references:19
Main heading:Web services
Controlled terms:Java programming language - Security of data - XML
Uncontrolled terms:Capital markets - Extensible Markup Language (XML) - Performance gain
Classification code:723 Computer Software, Data Handling and Applications - 723.1.1 Computer
Programming Languages - 723.2 Data Processing and Image Processing
Treatment:Theoretical (THR)
DOI:10.1109/ICWS.2006.70
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 305>
Accession number:20064710251888
Title:Portal monitoring based anti-malware framework: Design and implementation
Authors:Yanjun, Wu (1); Wenchang, Shi (2)
Author affiliation:(1) Institute of Software, CAS, Graduate School of CAS, P.O.Box 8718, Beijing,
China; (2) Institute of Software, CAS, P.O.Box 8718, Beijing, China
Corresponding author:Yanjun, W.
        (wuyanjun@gmail.com)

Source title:Conference Proceedings of the IEEE International Performance, Computing, and
Communications Conference
Abbreviated source title:Conf. Proc. IEEE Int. Perform. Comput. Commun. Conf.
Volume:2006
Monograph title:25th IEEE International Performance, Computing, and Communications
Conference, 2006, IPCCC 2006
Issue date:2006
Publication year:2006
Pages:553-557
Article number:1629452
Language:English
ISBN-10:1424401976
ISBN-13:9781424401970
Document type:Conference article (CA)
Conference name:25th IEEE International Performance, Computing, and Communications
Conference, 2006, IPCCC 2006
Conference date:April 10, 2006 - April 12, 2006
Conference location:Phoenix, AZ, United states
Conference code:68530
Publisher:Institute of Electrical and Electronics Engineers Inc.
Abstract:Most malware are introduced into a computer system by applications that communicate
with the outside world. These applications (called portals) are key components for system security.
This paper presents an efficient anti-malware framework under Linux by monitoring the behavior
of these portals and isolating the files they induced. The files created or modified by the monitored
applications will be marked with a suspicious label; when a file with suspicious label is accessed,
a predefined scanning tool or other mechanisms in user-land will be invoked to check the file. The
file labeling and access mediation are done in kernel, thus is mandatory and transparent to user
applications; the scanning mechanisms are implemented in user land, thus flexible for user to
customize. Experiment result under Linux shows the framework can prevent malware's intrusion
with small performance penalty. &copy; 2006 IEEE.
Number of references:16
Main heading:Portals
Controlled terms:Computer applications - Computer software - Computer viruses - Scanning -
Security of data
Uncontrolled terms:Access control - Anti malware - Linux kernel - Virus scanning
Classification code:716 Telecommunication; Radar, Radio and Television - 723.2 Data Processing
and Image Processing - 723.5 Computer Applications - 741.3 Optical Devices and Systems
Treatment:Theoretical (THR)
DOI:10.1109/.2006.1629452
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 306>
Accession number:20064210182280
Title:The algebraic normal form, linear complexity and k-error linear complexity of single-cycle
T-function
Authors:Zhang, Wenying (1); Wu, Chuan-Kun (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing, 100080, China
Corresponding author:Zhang, W.
        (wenyingzh@is.iscas.ac.cn)

Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)
Abbreviated source title:Lect. Notes Comput. Sci.
Volume:4086 LNCS
Monograph title:Sequences and Their Applications, SETA 2006 - 4th International Conference,
Proceedings
Issue date:2006
Publication year:2006
Pages:391-401
Language:English
ISSN:03029743
E-ISSN:16113349
ISBN-10:3540445234
ISBN-13:9783540445234
Document type:Conference article (CA)
Conference name:4th International Conference on Sequences and Their Applications, SETA 2006
Conference date:September 24, 2006 - September 28, 2006
Conference location:Beijing, China
Conference code:68303
Publisher:Springer Verlag
Abstract:In this paper, we study single-cycle T-functions which have important applications in
new cryptographic algorithms. We present the algebraic normal form (ANF) of all single-cycle
T-functions and the enumeration of single-cycle functions, which reveal many mysterious aspects
of such functions. We also investigate the linear complexity and the kerror complexity of
single-cycle T-functions when n = 2<sup>t</sup>, the results also reflect the good stability of
single-cycle T-functions. &copy; Springer-Verlag Berlin Heidelberg 2006.
Number of references:12
Main heading:Linear algebra
Controlled terms:Algorithms - Cryptography - Error analysis - Functions
Uncontrolled terms:Algebraic normal forms (ANF) - K-error complexity - Linear complexity -
Single-cycle T-functions
Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer
Software, Data Handling and Applications - 921.1 Algebra - 921.6 Numerical Methods
Treatment:Theoretical (THR)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 307>
Accession number:20064810278805
Title:OnceSAXParser: an efficient and light-weighted XML parser
Authors:Cao, Donglei (0); Tian, Sihua (0); Jin, Beihong (0)
Corresponding author:Cao, D.
Corr. author affiliation:Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Source title:Jisuanji Gongcheng/Computer Engineering
Abbreviated source title:Jisuanji Gongcheng
Volume:32
Issue:19
Issue date:Oct 5 2006
Publication year:2006
Pages:49-50+53
Language:Chinese
ISSN:10003428
CODEN:JISGEV
Document type:Journal article (JA)
Publisher:Shanghai Computer Society, Shanghai, China
Abstract:Xerces is the most popular and best performed parser till now. But its architecture is so
complicated that it limits its performance. By optimizing lexical and syntax processing for XML,
along with constructing the light-weighted architecture, an efficient XML parser--
OnceSAXParser is implemented. The paper compares it with Xerces which is a most popular
XML parser from the view of structure analysis and performance test. The results of performance
tests are given to show that OnceSAXParser is 27% faster than Xerces on the average.
Number of references:6
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 308>
Accession number:20064710258506
Title:Security flaws and improvement to a wireless authentication protocol with anonymity
Authors:Peng, Hua-Xi (1); Feng, Deng-Guo (1)
Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China
Corresponding author:Peng, H.-X.
Source title:Tongxin Xuebao/Journal on Communication
Abbreviated source title:Tongxin Xuebao
Volume:27
Issue:9
Issue date:September 2006
Publication year:2006
Pages:78-85
Language:Chinese
ISSN:1000436X
Document type:Journal article (JA)
Publisher:Editorial Board of Journal on Communications
Abstract:The anonymous security flaw of an authentication protocol with anonymity for wireless
networks which was proposed by Zhu, et al. was analyzed, and an improved protocol to a wireless
authentication protocol with anonymity (IWAA) was proposed. The anonymous security of the
improved protocol was analyzed in a formal way. The research results reveal that the improvement
can not only achieve authentication but also have a good anonymous property and achieve the
ideal security requirements of anonymity for wireless network.
Number of references:9
Main heading:Security of data
Controlled terms:Computer networks - Improvement - Network protocols - Requirements
engineering - Wireless telecommunication systems
Uncontrolled terms:Anonymity - Anonymous property - Authentication - Security analysis
Classification code:716.1 Information Theory and Signal Processing - 723.2 Data Processing and
Image Processing - 723.5 Computer Applications
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.
<RECORD 309>
Accession number:2006229906973
Title:Multi-continued fraction algorithm and generalized B-M algorithm over F<inf>q</inf>
Authors:Dai, Zongduo (1); Yang, Junhui (2)
Author affiliation:(1) State Key Laboratory of Information Security, Graduate School, Chinese
Academy of Sciences, Beijing, 100039, China; (2) Software Institute, Chinese Academy of
Sciences, Beijing, 100080, China
Corresponding author:Dai, Z.
       (yangdai@public.bta.net.cn)

Source title:Finite Fields and their Applications
Abbreviated source title:Finite Fields Appl.
Volume:12
Issue:3
Issue date:July 2006
Publication year:2006
Pages:379-402
Language:English
ISSN:10715797
E-ISSN:10902465
Document type:Journal article (JA)
Publisher:Academic Press Inc.
Abstract:An iterative algorithm in solving the linear synthesis problem on multi-sequences over
finite fields is derived from the multi-strict continued fraction algorithm (m-SCFA in short). It is
interesting that the derived iterative algorithm is the same as the generalized Berlekamp-Massey
algorithm (GBMA in short), though the computations in the m-SCFA and the GBMA are
completely different. As a consequence, the minimal polynomials and the discrepancy sequence
obtained by acting GBMA on a multi-sequence under(r, {combining low line}) are expressed
explicitly by data associated to the multi-strict continued fraction expansion of under(r,
{combining low line}). &copy; 2005 Elsevier Inc. All rights reserved.
Number of references:15
Main heading:Iterative methods
Controlled terms:Algorithms - Polynomials - Problem solving
Uncontrolled terms:Generalized Berlekamp-Massey algorithm - Multi-continued fraction -
Multi-sequences over finite fields
Classification code:723 Computer Software, Data Handling and Applications - 723.4 Artificial
Intelligence - 921.1 Algebra - 921.6 Numerical Methods
Treatment:Theoretical (THR)
DOI:10.1016/j.ffa.2005.06.008
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 310>
Accession number:2006259949029
Title:Time constraint and test case generation in conformance testing
Authors:Zhao, Baohua (1); Ke, Yao (1)
Author affiliation:(1) Department of Computer Science and Technology, University of Science and
Technology of China, Hefei 230027, China; (2) Laboratory of Computer Science, Software
Institute, Chinese Academy of Sciences, Beijing 100080, China
Corresponding author:Zhao, B.
Source title:Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University
Abbreviated source title:Hsi An Chiao Tung Ta Hsueh
Volume:40
Issue:4
Issue date:April 2006
Publication year:2006
Pages:381-385
Language:Chinese
ISSN:0253987X
CODEN:HCTPDW
Document type:Journal article (JA)
Publisher:Xi'an Jiaotong University
Abstract:Focusing on the time constraint problem in protocol testing theories, a strict constraint
over time parameters in protocol testing was presented from several conformance testing methods,
and a test case generation algorithm was given under the strict time constraint based on waiting,
coordination and synchronizing time. In control flow testing, homing sequence is created first,
then the waiting time is set in homing and checking sequence according to the network topologies
and events. In data flow testing, the waiting time is set only according to requirement description
and constraint. Test result of BGP (border gateway protocol) indicates that this algorithm can
adapt different network topologies, and the test cases created by the algorithm can effectively
reduce test costs.
Number of references:9
Main heading:Program diagnostics
Controlled terms:Algorithms - Computer networks - Constraint theory - Costs - Data flow analysis
- Gateways (computer networks) - Network protocols - Program debugging - Structured
programming - Synchronization - Topology
Uncontrolled terms:Border gateway protocol - Conformance testing - Test case generation - Time
constraint
Classification code:921.6 Numerical Methods - 921.4 Combinatorial Mathematics, Includes Graph
Theory, Set Theory - 911.1 Cost Accounting - 731.1 Control Systems - 723.1 Computer
Programming - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 716.1 Information Theory and Signal Processing
Treatment:Applications (APP)
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

<RECORD 311>
Accession number:20064210174854
Title:An Effective Coalgebraic Bisimulation Proof Method
Authors:Luo, Lingyun (1)
Author affiliation:(1) Laborotory of Computer Science, Software Institute, Chinese Academy of
Sciences, P.O.Box 8718, Beijing, 100080, China; (2) Graduate University, the Chinese Academy
of Sciences, 19 Yuquan Street, Beijing, 100039, China
Corresponding author:Luo, L.
       (luoly@ios.ac.cn)

Source title:Electronic Notes in Theoretical Computer Science
Abbreviated source title:Electron. Notes Theor. Comput. Sci.
Volume:164
Issue:1
Issue date:October 20, 2006
Publication year:2006
Pages:105-119
Language:English
ISSN:15710661
Document type:Journal article (JA)
Publisher:Elsevier
Abstract:The bisimulation "up-to-..." technique provides an effective way to relieve the amount of
work in proving bisimilarity of two processes. This paper develops a fresh and direct approach to
generalize this set-theoretic "up-to-..." principle to the setting of coalgebra theory. The notion of
consistent function is introduced, as a generalization of Sangiorgi's sound function. Then, in order
to prove that there are only bisimilar pairs in a relation, it is sufficient to find a morphism from it
to the "lifting" of its image under some consistent function. One example is given showing that
every self-bisimulation in normed BPA is just such a relation. What's more, we investigate the
connection between span-bisimulation and ref-bisimulation. As a result, &lambda;-bisimulation
turns out to be covered by our new principle. &copy; 2006 Elsevier B.V. All rights reserved.
Number of references:11
Main heading:Linear algebra
Controlled terms:Computer science - Computer simulation - Function evaluation - Image
processing - Set theory - Theorem proving
Uncontrolled terms:Bisimulation - BPA - Coalgebra - Sangiorgi's sound function
Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory - 723.2 Data Processing and Image Processing - 723.5 Computer
Applications - 921.1 Algebra - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set
Theory - 921.6 Numerical Methods
Treatment:Theoretical (THR)
DOI:10.1016/j.entcs.2006.06.007
Database:Compendex
Compilation and indexing terms, Copyright 2009 Elsevier Inc.

								
To top