<RECORD 1> Accession number:2003427673796 Title:Genetic design of drugs without side-effects Authors:Deng, Xiaotie (1); Li, Guojun (2); Li, Zimao (4); Ma, Bin (5); Wang, Lusheng (1) Author affiliation:(1) Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong; (2) Sch. of Math. and System Sciences, Shandong University, Jinan 250100, China; (3) Institute of Software, Chinese Academy of Science, Beijing 100080, China; (4) Sch. of Comp. Science and Technology, Shandong University, Jinan 250100, China; (5) Department of Computer

bigskymanAI and Robotics

Oct 24, 2013 (3 years and 9 months ago)

892 views

<RECORD 1>

Accession number:2003427673796

Title:Genetic design of drugs without side
-
effects

Authors:Deng, Xiaotie (1); Li, Guojun (2); Li, Zimao (4); Ma, Bin (5); Wang, Lusheng (1)

Author affiliation:(1) Department of Computer Science, City University of

Hong Kong, Kowloon,
Hong Kong; (2) Sch. of Math. and System Sciences, Shandong University, Jinan 250100, China;
(3) Institute of Software, Chinese Academy of Science, Beijing 100080, China; (4) Sch. of Comp.
Science and Technology, Shandong University, Ji
nan 250100, China; (5) Department of Computer
Science, University of Western Ontario, London, Ont. N6A 5B7, Canada

Corresponding author:Deng, X.




(deng@cs.cityu.edu.hk)




Source title:SIAM Journal on Computing

Abbreviated source title:SIAM J Compu
t

Volume:32

Issue:4

Issue date:June/July 2003

Publication year:2003

Pages:1073
-
1090

Language:English

ISSN:00975397

CODEN:SMJCAT

Document type:Journal article (JA)

Publisher:Society for Industrial and Applied Mathematics Publications

Abstract:Consider two s
ets of strings, &Bscr; (bad genes) and script G sign (good genes), as well
as two integers d<inf>b</inf> and d<inf>g</inf> (d<inf>b</inf> &le d<inf>g</inf>). A
frequently occurring problem in computational biology (and other fields) is to find a
(distingui
shing) substring s of length L that distinguishes the bad strings from good strings, i.e.,
such that for each string s<inf>i</inf> &isin; &Bscr; there exists a length
-
L substring t
<inf>i</inf> of s<inf>i</inf> with d(s, t<inf>i</inf>) &le d<inf>b</inf> (c
lose to bad strings),
and for every substring u<inf>i</inf> of length L of every string g<inf>i</inf> &isin; script G
sign, d(s, u<inf>i</inf>) &ge; d <inf>g</inf> (far from good strings). We present a polynomial
time approximation scheme to settle the pro
blem; i.e., for any constant &Epsilon; &gt; 0, the
algorithm finds a string s of length L such that for every s<inf>i</inf> &isin; &Bscr; there is a
length
-
L substring t<inf>i</inf> of s<inf>i</inf> with d(t<inf>i</inf>, s) &le (1 +
&Epsilon;)d<inf>b</inf>
, and for every substring u<inf>i</inf> of length L of every
g<inf>i</inf> &isin; script G sign, d(u <inf>i</inf>, s) &ge; (1
-

&Epsilon;)d<inf>g</inf> if a
solution to the original pair (d<inf>b</inf> &le d<inf>g</inf>) exists. Since there is a polynomial

number of such pairs (d<inf>b</inf>, d<inf>g</inf>), we can exhaust all the possibilities in
polynomial time to find a good approximation required by the corresponding application
problems.

Number of references:12

Main heading:Genetic algorithms

Controlle
d terms:Approximation theory
-

Computational complexity
-

Drug products
-

Molecular
biology

Uncontrolled terms:Genetic design

Classification code:461.6 Medicine and Pharmacology
-

461.9 Biology
-

721.1 Computer Theory,
Includes Formal Logic, Automata Theor
y, Switching Theory, Programming Theory
-

723
Computer Software, Data Handling and Applications
-

921.6 Numerical Methods

Treatment:Theoretical (THR)

DOI:10.1137/S0097539701397825

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier I
nc.


<RECORD 2>

Accession number:2003307563100

Title:Specification and verification of the triple
-
modular redundancy fault
-
tolerant system

Authors:Guo, Liang (1); Tang, Zhi
-
Song (1)

Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Aca
d. of Sci., Beijing 100080,
China

Corresponding author:Guo, L.




(gls@ios.ac.cn)




Source title:Ruan Jian Xue Bao/Journal of Software

Abbreviated source title:Ruan Jian Xue Bao

Volume:14

Issue:1

Issue date:January 2003

Publication year:2003

Pages:5
4
-
61

Language:Chinese

ISSN:10009825

CODEN:RUXUEW

Document type:Journal article (JA)

Publisher:Chinese Academy of Sciences

Abstract:XYZ/E is used to specify and verify the triple
-
modular redundancy fault
-
tolerant system.
Assuming that each computer is loade
d with a determined sequential program P which
continuously outputs data to the outer environment, the case P running on single processor is
illustrated by an XYZ/E program SingleProcess<inf>P</inf>, and the property of program P is
specified by a temporal

logical formula Spec<inf>P</inf>. Finally, it is proved that the program
TripleProcessors<inf>p</inf> obtained from the triple
-
modular redundancy way can still satisfy
Spec<inf>p</inf> in spite of hardware errors.

Number of references:9

Main heading:Fault

tolerant computer systems

Controlled terms:Algorithms
-

Computer programming
-

Redundancy

Uncontrolled terms:Temoeral logic language
-

Triple modular redundancy

Classification code: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 3>

Accession number:2003307563104

Title:Analysis for scheduling theory and approach of open real
-
time system

Authors:Zou,

Yong (1); Li, Ming
-
Shu (1); Wang, Qing (1)

Author affiliation:(1) Lab. for Internet Software Technol., Inst. of Software, Chinese Acad. of Sci.,
Beijing 100080, China

Corresponding author:Zou, Y.




(zouy@intec.iscas.ac.cn)




Source title:Ruan Jia
n Xue Bao/Journal of Software

Abbreviated source title:Ruan Jian Xue Bao

Volume:14

Issue:1

Issue date:January 2003

Publication year:2003

Pages:83
-
90

Language:Chinese

ISSN:10009825

CODEN:RUXUEW

Document type:Journal article (JA)

Publisher:Chinese Academy of

Sciences

Abstract:Firstly, the basic concepts and theories of open real
-
time system are described. And then,
a hierarchy model for scheduling objects is presented. It adapts to the scheduling environment of
open real
-
time system. Several related schedulin
g approaches are compared in detail, and their
functional features, the applying scope, and some of their common characters are pointed out. The
result come out that it is feasible to integrate different kinds of approaches, and this would be a
direction.
In the integrated scheduling mechanism, the advantages of each approach can be kept,
and therefore, the application requirements of open real
-
time system can be met better.

Number of references:10

Main heading:Real time systems

Controlled terms:Algorithms
-

Open systems
-

Servers

Uncontrolled terms:Scheduling algorithms

Classification code:722 Computer Systems and Equipment
-

723 Computer Software, Data
Handling and Applications

Treatment:Theoretical (THR)

Database:Compendex

Compilation and indexing terms,
Copyright 2009 Elsevier Inc.


<RECORD 4>

Accession number:2003317580685

Title:Integrated design method of task priority

Authors:Jin, Hong (1); Wang, Hong
-
An (1); Wang, Qiang (1); Dai, Guo
-
Zhong (1)

Author affiliation:(1) Human Comp. Interaction Lab., Inst
. of Software, Chinese Acad. of Sci.,
Beijing 100080, China

Corresponding author:Jin, H.




(hjin@iel.iscas.ac.cn)




Source title:Ruan Jian Xue Bao/Journal of Software

Abbreviated source title:Ruan Jian Xue Bao

Volume:14

Issue:3

Issue date:March 200
3

Publication year:2003

Pages:376
-
382

Language:Chinese

ISSN:10009825

CODEN:RUXUEW

Document type:Journal article (JA)

Publisher:Chinese Academy of Sciences

Abstract:A scheduling algorithm based on priority table design is presented. Any two
characteristic p
arameters (e.g., relative deadline and slack) is a task are combined to design its
priority so that the deadline is nearer or the slack of shorter, the priority is higher. The priority of a
task is uniquely determined by its relative deadline and slack. Fo
r any task, its unique priority can
be obtained by using Lagrange interposing algorithm on the designed priority table. Compared
with the classical EDF and LSF policies, simulated results show that the proposed algorithm
improves the efficiency of task sch
eduling, i.e., to designate the priority of a task, increases the
succeed ratio of task scheduling, and decreases the missed deadline percentage. The proposed
algorithm can be applied to dynamically schedule real
-
time tasks in real
-
time systems.

Abstract t
ype:(Edited Abstract)

Number of references:10

Main heading:Real time systems

Controlled terms:Algorithms
-

Computer simulation
-

Scheduling

Uncontrolled terms:Dynamic scheduling
-

Lagrange interposing algorithms
-

Relative deadline
-

Scheduling success rat
io
-

Slack time
-

Task priority

Classification code:722.4 Digital Computers and Systems
-

723 Computer Software, Data
Handling and Applications
-

912.2 Management
-

921 Mathematics

Treatment:Applications (APP); Theoretical (THR)

Database:Compendex

Compilat
ion and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 5>

Accession number:2003307563096

Title:Diagnostic information generation in model checking value
-
passing processes

Authors:Liu, Jian (1); Lin, Hui
-
Min (1)

Author affiliation:(1) Lab. of Comp.
Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080,
China

Corresponding author:Liu, J.




(ljian@ios.ac.cn)




Source title:Ruan Jian Xue Bao/Journal of Software

Abbreviated source title:Ruan Jian Xue Bao

Volume:14

Issue:1

Issue date:Janu
ary 2003

Publication year:2003

Pages:1
-
8

Language:Chinese

ISSN:10009825

CODEN:RUXUEW

Document type:Journal article (JA)

Publisher:Chinese Academy of Sciences

Abstract:Automatic diagnostic information generation is one of the remarkable advantages of
model
checking methods. It is very important to understand the reason for the failure and fix the
problem. In this paper, how to generate effective diagnosis in model checking value
-
passing
processes is discussed. Two diagnostic forms, proof graph and witness, a
re defined. Moreover,
algorithms are proposed to construct them from the search states space in model checking process.
By this way, useful diagnoses are generated from the existing information by less calculation.
Besides above, the algorithms have been i
mplemented and used to analyze several cases. The
experimental results show that this method is efficient.

Number of references:10

Main heading:Software engineering

Controlled terms:Algorithms
-

Data transfer

Uncontrolled terms:Diagnosis generation
-

Model

checking
-

Process algebra
-

Proof graph

Classification code:723 Computer Software, Data Handling and Applications

Treatment:Theoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 6>

Accession number:200
3317580697

Title:Security evaluation for a class of block ciphers based on chaotic maps

Authors:Zhang, Wen
-
Tao (1); Qing, Si
-
Han (1); Wu, Wen
-
Ling (1)

Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China

Corresponding au
thor:Zhang, W.
-
T.




(zhangwt@ercist.iscas.ac.cn)




Source title:Ruan Jian Xue Bao/Journal of Software

Abbreviated source title:Ruan Jian Xue Bao

Volume:14

Issue:3

Issue date:March 2003

Publication year:2003

Pages:512
-
517

Language:Chinese

ISSN:100098
25

CODEN:RUXUEW

Document type:Journal article (JA)

Publisher:Chinese Academy of Sciences

Abstract:The security evaluation of a class of block ciphers based on chaotic maps against
differential and linear attacks is studied. If the round function is bijecti
ve and its maximum
differential and linear characteristic probabilities are p and q respectively, the upper bounds of
maximum differential and linear characteristic probabilities for r rounds are p<sup>r
-
1</sup> and
q<sup>r
-
1</sup> respectively.

Number of
references:6

Main heading:Cryptography

Controlled terms:Algorithms
-

Boundary conditions
-

Chaos theory
-

Evaluation
-

Functions
-

Probability
-

Security of data

Uncontrolled terms:Block cipher
-

Chaotic maps
-

Differential cryptanalysis
-

Linear cryptanal
ysis
-

Round functions
-

Security evaluation

Classification code:716 Telecommunication; Radar, Radio and Television
-

723 Computer
Software, Data Handling and Applications
-

921 Mathematics
-

922 Statistical Methods

Treatment:Applications (APP); Theoretica
l (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 7>

Accession number:2003317580698

Title:Security analysis and improvement of TLS

Authors:Sun, Lin
-
Hong (1); Ye, Ding
-
Feng (1); Lu, Shu
-
Wang (1); Feng, Deng
-
Guo

(1)

Author affiliation:(1) Lab. of Info. Security, Graduate Sch., Chinese Acad. of Sci., Beijing 100039,
China; (2) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China

Corresponding author:Sun, L.
-
H.




(sun_lin_ho
ng@sohu.com)




Source title:Ruan Jian Xue Bao/Journal of Software

Abbreviated source title:Ruan Jian Xue Bao

Volume:14

Issue:3

Issue date:March 2003

Publication year:2003

Pages:518
-
523

Language:Chinese

ISSN:10009825

CODEN:RUXUEW

Document type:Journal ar
ticle (JA)

Publisher:Chinese Academy of Sciences

Abstract:The analysis of security about TLS (transport layer security) protocol is proposed, based
on once encipherment, access control and dual certificate. Upon the analysis, extensions are given
for messa
ge process and content of TLS, the improved protocol is more secure and practical.

Abstract type:(Edited Abstract)

Number of references:5

Main heading:Network protocols

Controlled terms:Algorithms
-

Cryptography
-

Numerical analysis
-

Security of data

Unco
ntrolled terms:Access control
-

Dual certificates
-

Once encipherment
-

Transport layer
security

Classification code:716 Telecommunication; Radar, Radio and Television
-

723 Computer
Software, Data Handling and Applications
-

921 Mathematics

Treatment:Appl
ications (APP); Theoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 8>

Accession number:2004068009278

Title:Modeling and analysis of transactional workflows

Authors:Ding, Ke (1); Jin, Bei
-
Hong (1); Fen
g, Yu
-
Lin (1)

Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080,
China; (2) Software Eng. Technol. Ctr., Inst. of Software, Chinese Acad. of Sci., Beijing 100080,
China

Corresponding author:Ding, K.





(dingke@otcaix.iscas.ac.cn)




Source title:Jisuanji Xuebao/Chinese Journal of Computers

Abbreviated source title:Jisuanji Xuebao

Volume:26

Issue:10

Issue date:October 2003

Publication year:2003

Pages:1304
-
1311

Language:Chinese

ISSN:02544164

CODEN:JIXUD
T

Document type:Journal article (JA)

Publisher:Science Press

Abstract:A transactional workflow is composed of traditional flat transactions, and its execution
has relaxed transactional atomicity. Due to different termination characteristics of transactions
, a
large transactional workflow with complex structures may not be well
-
formed because of
composition mismatch. In this paper, we present a transactional workflow model and formally
define the concept of well
-
formedness. We then propose a well
-
formedness
determination theorem.
We also design a transactional workflow description language ISWDL in context
-
free grammar
and implement a parser to check the well
-
formedness of workflows in ISWDL.

Number of references:10

Main heading:Distributed computer systems

C
ontrolled terms:Computer supported cooperative work
-

Data flow analysis
-

Models

Uncontrolled terms:Atomicity
-

Relaxed atomicity
-

Transactional workflow
-

Well formedness

Classification code:722.4 Digital Computers and Systems
-

723.1 Computer Programmi
ng
-

723.5
Computer Applications

Treatment:Applications (APP); Theoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 9>

Accession number:2003317580702

Title:Design and implementation of a security label
common framework

Authors:Liang, Hong
-
Liang (1); Sun, Yu
-
Fang (1); Zhao, Qing
-
Song (1); Zhang, Xiang
-
Feng (1);
Sun, Bo (1)

Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China

Corresponding author:Liang, H.
-
L.




(holl
ace@sonata.iscas.ac.cn)




Source title:Ruan Jian Xue Bao/Journal of Software

Abbreviated source title:Ruan Jian Xue Bao

Volume:14

Issue:3

Issue date:March 2003

Publication year:2003

Pages:547
-
552

Language:Chinese

ISSN:10009825

CODEN:RUXUEW

Document type
:Journal article (JA)

Publisher:Chinese Academy of Sciences

Abstract:Labels are the foundation for implementing multilevel and the prerequisite of enforcing
mandatory access control in secure systems. How to define and enforce label functions which
support

multiple security policies is the focus here. A security label common framework (SLCF)
based on static object label and dynamic subject label is put forward. SLCF introduces the
notation of access history and provides a complete label functions set. Based

on SLCF, both
multilevel confidential policy and multilevel integrity policy can be expressed and enforced.
SLCF is implemented in a secure operating system based on Linux, the experimental results show
that the system based on SLCF is flexible and practi
cable.

Number of references:12

Main heading:Computer systems

Controlled terms:Computer operating systems
-

Functions
-

Labels
-

Security systems

Uncontrolled terms:Information flow control
-

Label framework
-

Label functions
-

Multilevel
confidentiality
-

Multilevel integrity
-

Multilevel security systems
-

Security labels
-

Security
operating systems

Classification code:722 Computer Systems and Equipment
-

723 Computer Software, Data
Handling and Applications
-

914.1 Accidents and Accident Prevention
-

921

Mathematics

Treatment:Applications (APP); Theoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 10>

Accession number:2003317580877

Title:Research on dynamic optimization technique for enterprise process

and integrated support
tool

Authors:Tan, Wen
-
An (1); Tang, An
-
Qiong (1)

Author affiliation:(1) Coll. of Comp. Sci. and Eng., Zhejiang Normal Univ., Jinhua 321004, China;
(2) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (3) SINO
-
SUNSHI
NE Info.
Automat. Co., Beijing 100088, China

Corresponding author:Tan, W.
-
A.




(twajsj@sohu.com)




Source title:Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS

Abbreviated source title:Jisuanji Jicheng Zhizao Xitong

V
olume:9

Issue:2

Issue date:February 2003

Publication year:2003

Pages:137
-
142

Language:Chinese

ISSN:10065911

CODEN:JJZXFN

Document type:Journal article (JA)

Publisher:CIMS

Abstract:Based on the methodology about enterprise process dynamic optimization, ente
rprise
process dynamic optimal techniques, such as the enterprise modeling, process simulation, dynamic
optimization and process enactmenting etc., were discussed in detail. The architecture and
functions of the integrated support tool EPDOST were introduc
ed. It will be widely generalized as
a crucial function in enterprise management information system for implementing the integration
of management information system and process management, and improving the adaptation for
the changing market. EPDOT is val
ued for accelerating the enterprise information engineering in
China.

Number of references:14

Main heading:Virtual corporation

Controlled terms:Computer integrated manufacturing
-

Dynamics
-

Information management
-

Optimization

Uncontrolled terms:Dynamic
optimization technique
-

Enterprise modeling
-

Enterprise process
-

Support tool

Classification code:912.2 Management
-

913.4.2 Computer Aided Manufacturing
-

921.5
Optimization Techniques
-

931.1 Mechanics

Treatment:Applications (APP)

Database:Compendex

C
ompilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 11>

Accession number:2003247505780

Title:Multifractal analysis and model of the MPEG
-
4 video traffic

Authors:Fei, Hong (1); Zhimei, Wu (1)

Author affiliation:(1) Multimedia and Network R
es. Ctr., Institute of Software, Chinese Academy
of Sciences, P.O. Box 8718, Beijing 100080, China

Corresponding author:Fei, H.




(hongfei@isdn.iscas.ac.cn)




Source title:IEEE International Performance, Computing and Communications Conference,
Pro
ceedings

Abbreviated source title:IEEE Int Perform Comput Commun Conf Proc

Issue date:2003

Publication year:2003

Pages:463
-
467

Language:English

Document type:Conference article (CA)

Conference name:22nd IEEE International Performance, Computing, and Commun
ications
Conference

Conference date:April 9, 2003
-

April 11, 2003

Conference location:Phoenix, AZ, United states

Conference code:61065

Sponsor:IEEE Computer Society; IEEE Computer Society Technical Committee on the Internet;
IEEE Communications Society

Pu
blisher:Institute of Electrical and Electronics Engineers Inc.

Abstract:MPEG
-
4 encoded video is expected to account for a large portion of the traffic in future
wireline and wireless networks. But there are only few studies that evaluate networking protoco
ls
and resource management schemes with such new object
-
based encoded video. In this paper, we
explore the viability of multifractal analysis in modeling the MPEG
-
4 video traffic. First, we
prove that the MPEG
-
4 video traffic exhibit the multifractal chara
cteristic through multifractal
formalism and spectra analysis. Then we apply the multifractal wavelet model to the MPEG
-
4
video traffic analysis and synthesis. This model uses the Haar wavelet transform and puts a
constraint on the wavelet coefficients to
guarantee positivity, which results in a swift O(N)
algorithm to synthesize N
-
point data sets. The statistical numeric results and fit procedure show
this model's flexibility and accuracy in the MPEG
-
4 video modelling.

Number of references:11

Main heading:
Telecommunication traffic

Controlled terms:Algorithms
-

Fractals
-

Image coding
-

Image compression
-

Network protocols
-

Numerical methods
-

Resource allocation
-

Spectrum analysis
-

Statistical methods
-

Video signal
processing
-

Wavelet transforms
-

Wi
reless telecommunication systems

Uncontrolled terms:Haar wavelet transform
-

Motion picture experts group
-

Multifractal analysis
-

Multifractal model
-

Multifractal wavelet model
-

Video traffic

Classification code:716.1 Information Theory and Signal Proc
essing
-

723.2 Data Processing and
Image Processing
-

723.5 Computer Applications
-

921.3 Mathematical Transformations
-

921.6
Numerical Methods

Treatment:Theoretical (THR); Experimental (EXP)

Database:Compendex

Compilation and indexing terms, Copyright 20
09 Elsevier Inc.


<RECORD 12>

Accession number:2003357612339

Title:Security on Korean encryption standard

Authors:Wu, Wen
-
Ling (1); Ma, Heng
-
Tai (1); Feng, Deng
-
Guo (1)

Author affiliation:(1) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci
., Beijing
100080, China; (2) Eng. Res. Ctr., Chinese Acad. of Sci., Beijing 100080, China

Corresponding author:Wu, W.
-
L.

Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica

Abbreviated source title:Tien Tzu Hsueh Pao

Volume:31

Issue:4

Issue date:Apri
l 2003

Publication year:2003

Pages:585
-
588

Language:Chinese

ISSN:03722112

CODEN:TTHPAG

Document type:Journal article (JA)

Publisher:Chinese Institute of Electronics

Abstract:SEED is the Korean encryption standard. It was pointed by designers that the compl
exity
for the linear cryptanalysis of SEED is 2<sup>335.4</sup>. Using the linear approximations in
this paper, the complexity for the linear cryptanalysis of SEED is 2<sup>328</sup>. To analyze
the differential cryptanalysis of SEED, the modified SEED was

considered. It was pointed out that
9
-
round modified SEED was secure against the differential cryptanalysis. There are 9
-
round
truncated differentials available to the truncated differential cryptanalysis in the modified SEED.
Hence, 10
-
round modified SEE
D is not immune to truncated differential cryptanalysis. Although
the results can not threaten the application of SEED, they show the security of SEED is not as
strong as that designers predicted.

Number of references:5

Main heading:Cryptography

Controlled

terms:Security of data
-

Standards

Uncontrolled terms:Block cipher
-

Differential cryptanalysis
-

Korean encryption standard
-

Linear
cryptanalysis
-

Truncated differential cryptanalysis

Classification code:723 Computer Software, Data Handling and Applica
tions
-

902.2 Codes and
Standards

Treatment:Applications (APP); Experimental (EXP)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 13>

Accession number:2003527793465

Title:Combining static analysis and case
-
based se
arch space partitioning for reducing peak
memory in model checking

Authors:Zhang, WenHui (1)

Author affiliation:(1) Laboratory of Computer Science, Institute of Software, The Chinese
Academy of Sciences, Beijing 100080, China

Corresponding author:Zhang,
W.H.




(zwh@ios.ac.cn)




Source title:Journal of Computer Science and Technology

Abbreviated source title:J Comput Sci Technol

Volume:18

Issue:6

Issue date:November 2003

Publication year:2003

Pages:762
-
770

Language:English

ISSN:10009000

CODEN:JCTEEM

Document type:Journal article (JA)

Publisher:Allerton Press Inc.

Abstract:Memory is one of the critical resources in model checking. This paper discusses a
strategy for reducing peak memory in model checking by case
-
based partitioning of the search
space.

This strategy combines model checking for verification of different cases and static analysis
or expert judgment for guaranteeing the completeness of the cases. Description of the static
analysis is based on using PROMELA as the modeling language. The str
ategy is applicable to a
subset of models including models for verification of certain aspects of protocols.

Number of references:25

Main heading:Computer programming languages

Controlled terms:Algorithms
-

Computational complexity
-

Cryptography
-

Formal
languages
-

Network protocols
-

Storage allocation (computer)
-

Theorem proving

Uncontrolled terms:Case
-
based search space partitioning
-

Model checking
-

Protocol verification
-

Static analysis

Classification code:721.1 Computer Theory, Includes Formal Lo
gic, Automata Theory, Switching
Theory, Programming Theory
-

722.1 Data Storage, Equipment and Techniques
-

723.1 Computer
Programming
-

723.1.1 Computer Programming Languages
-

723.2 Data Processing and Image
Processing

Treatment:Theoretical (THR)

Databas
e:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 14>

Accession number:2003407659552

Title:Circular AMDF and pitch estimation based on it

Authors:Zhang, Wen
-
Yao (1); Xu, Gang (1); Wang, Yu
-
Guo (1)

Author affiliation:(1) Ins
t. of Software, Chinese Acad. of Sci., Beijing 100080, China

Corresponding author:Zhang, W.
-
Y.

Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica

Abbreviated source title:Tien Tzu Hsueh Pao

Volume:31

Issue:6

Issue date:June 2003

Publication year:2003

Pages:886
-
890

Language:Chinese

ISSN:03722112

CODEN:TTHPAG

Document type:Journal article (JA)

Publisher:Chinese Institute of Electronics

Abstract:Pitch period is a key parameter in speech compression, synthesis and recognition. The
well
-
known AMDF is often

used to determine this parameter. But it is easy to make the estimated
pitch doubled. With the problem, this paper analyses the features of the AMDF and its
disadvantages that occur in pitch detection. And a new function, Circular AMDF (CAMDF), is
propose
d. The CAMDF conquers the defect of the AMDF effectively, and simplifies the process
of pitch detection. With the properties of CAMDF, a new pitch detection algorithm based on
CAMDF is described. The algorithm not only simplifies the pitch detection, but a
lso efficiently
decreases the estimation errors and improves the precision of estimated values. Lots of
experiments show that the performance of the algorithm is better than other methods that are
based on the AMDF or the LVAMDF.

Number of references:7

Mai
n heading:Speech processing

Controlled terms:Algorithms
-

Estimation
-

Functions
-

Signal detection

Uncontrolled terms:Circular average magnitude difference function
-

Estimation error
-

Pitch
detection
-

Pitch period estimation

Classification code:716.1 I
nformation Theory and Signal Processing
-

751.5 Speech
-

921
Mathematics

Treatment:Experimental (EXP)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 15>

Accession number:2004108052702

Title:Adaptive equalization al
gorithm based on wavelet packet transform

Authors:Huang, Kui (1); Lv, Rui (2)

Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Beijing
Broadcasting Inst., Beijing 100024, China

Corresponding author:Huang, K.




(hk@iscas.ac.cn)




Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica

Abbreviated source title:Tien Tzu Hsueh Pao

Volume:31

Issue:8

Issue date:August 2003

Publication year:2003

Pages:1205
-
1208

Language:Chinese

ISSN:03722112

CODEN:TTHPAG

Document

type:Journal article (JA)

Publisher:Chinese Institute of Electronics

Abstract:Adaptive equalization algorithm based on wavelet packet transform is proposed in the
paper, upon the basis given orthogonal matrices corresponding to discrete orthogonal wavelet

packet transform. The performance of the algorithm is an and we prove the analysis results, from
computer simulation. Additionally, in order to apply wavelet packet transform based adaptive
equalization algorithm to various fields, the approach to minimiz
e computational complexity is
given.

Number of references:9

Main heading:Adaptive algorithms

Controlled terms:Computer simulation
-

Wavelet transforms

Uncontrolled terms:Adaptive equalization algorithms
-

Optimized algorithms
-

Orthogonal
matrices
-

Wavele
t packet transforms

Classification code: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 16>

Acc
ession number:2003447707749

Title:Dispute on the dimension problem of optimal discriminant features

Authors:Li, Zhao
-
Yang (1); Wang, Yuan
-
Quan (2); Xia, De
-
Shen (2)

Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2
) Dept. of
Comp. Sci., Nanjing Univ. of Sci. and Technol., Nanjing 210094, China

Corresponding author:Li, Z.
-
Y.




(lzy@iel.iscas.ac.cn)




Source title:Jisuanji Xuebao/Chinese Journal of Computers

Abbreviated source title:Jisuanji Xuebao

Volume:26

I
ssue:7

Issue date:July 2003

Publication year:2003

Pages:825
-
830

Language:Chinese

ISSN:02544164

CODEN:JIXUDT

Document type:Journal article (JA)

Publisher:Science Press

Abstract:This paper makes a detail discussion on the optimal dimension problem of optimal

discriminant feature set, gives the condition under which the dimension of optimal features sets is
c
-
1. That is the optimal features set which optimizes the discriminant criterion with the form
f(M<inf>1</inf>, &mellip;, M<inf>c</inf>, S<inf>1</inf>, &me
llip;, S<inf>c</inf>), where
M<inf>i</inf> and S<inf>i</inf> are the first
-
and second
-
order moments, and the optimal
features set which optimizes the error rate of some special classifiers, such as Bayesian linear
classifier, minimum
-
distance classifier. B
oth of the optimal features are the posterior probabilities
or their function. At last, variance analysis is introduced against estimation error to select the
optimal discriminant features that minimize the error rate of minimum
-
distance classifier. This
m
ethod can also be used in other feature selection problems.

Number of references:8

Main heading:Pattern recognition

Controlled terms:Algorithms
-

Error analysis
-

Feature extraction
-

Functions
-

Optimization
-

Probability

Uncontrolled terms:Error rate
-

F
eature selection
-

Minimum distance classifiers
-

Optimal
dimension problems
-

Optimal discriminant features
-

Optimal features
-

Posterior probability
-

Variance analysis

Classification code:716 Telecommunication; Radar, Radio and Television
-

723 Compute
r
Software, Data Handling and Applications
-

741.1 Light/Optics
-

921 Mathematics
-

922.1
Probability Theory

Treatment:Applications (APP); Theoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 17>

Access
ion number:2003227490393

Title:Construction of a class of linear codes with good parameters

Authors:Li, Chao (1); Feng, Ke
-
Qin (3); Hu, Wei
-
Qun (4)

Author affiliation:(1) Dept. of Math. and Syst. Sci., Natl. Univ. of Defense Technol., Changsha
410073, Chi
na; (2) Lab. of Comp. Sci., Inst.of Software, Chinese Acad. of Sci., Beijing 100080,
China; (3) Dept. of Math. Sci., Tsinghua Univ., Beijing 100084, China; (4) Dept. of Fundamental
Sci., Nanjing Agric. Sch., Nanjing 210038, China

Corresponding author:Li,
C.

Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica

Abbreviated source title:Tien Tzu Hsueh Pao

Volume:31

Issue:1

Issue date:January 2003

Publication year:2003

Pages:51
-
53

Language:Chinese

ISSN:03722112

CODEN:TTHPAG

Document type:Journal article (JA
)

Publisher:Chinese Institute of Electronics

Abstract:Based on the factorization properties of cyclotomic polynomials over finite field Fq, we
construct a class of linear codes which are the generation of Reed
-
Solomon codes and the codes
constructed by Cha
oping Xing and San Ling. More new codes can be obtained by using our
construction methods.

Number of references:5

Main heading:Encoding (symbols)

Controlled terms:Polynomials

Uncontrolled terms:Cyclotomic polynomial
-

Dimension
-

Linear code
-

Minimal dist
ances

Classification code:723.2 Data Processing and Image Processing
-

921.1 Algebra

Treatment:Theoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 18>

Accession number:2003477740786

Title:Correlation a
nalysis of summation generator

Authors:Feng, Deng
-
Guo (1); Ma, Wei
-
Ju (2)

Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Lab. of
Info. Security, Graduate Sch., Chinese Acad. of Sci., Beijing 100039, China

Corr
esponding author:Feng, D.
-
G.




(fengdg@263.net)




Source title:Ruan Jian Xue Bao/Journal of Software

Abbreviated source title:Ruan Jian Xue Bao

Volume:14

Issue:8

Issue date:August 2003

Publication year:2003

Pages:1463
-
1469

Language:English

ISSN:1000
9825

CODEN:RUXUEW

Document type:Journal article (JA)

Publisher:Chinese Academy of Sciences

Abstract:Applying linear sequential circuit approximation (LSCA) method to analyze the
summation generator with an arbitrary number of inputs, J. Dj. Golic&prime; co
njectured that all
pairs of mutually correlated input and output linear functions with the maximum possible absolute
value of the correlation coefficient couldbe obtained, but no proof was given proof. By using
Walsh Transformation technique, the conjectur
e is proved for even n in this paper. The total
correlation of summation generator is studied which is very similar to that of combiners with one
bit memory.

Abstract type:(Edited Abstract)

Number of references:12

Main heading:Cryptography

Controlled terms
:Approximation theory
-

Correlation theory
-

Data storage equipment
-

Functions
-

Linear equations
-

Sequential circuits
-

Summing circuits
-

Theorem proving

Uncontrolled terms:Correlation coefficients
-

One bit memories
-

Stream ciphers
-

Summation
genera
tors
-

Walsh transformations

Classification code:716 Telecommunication; Radar, Radio and Television
-

721 Computer Circuits
and Logic Elements
-

722.1 Data Storage, Equipment and Techniques
-

723 Computer Software,
Data Handling and Applications
-

921 Math
ematics
-

922.2 Mathematical Statistics

Treatment:Applications (APP); Theoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 19>

Accession number:2003517785145

Title:Towards Dynamic Process with Variable
Structure by Reflection

Authors:Liu, Shaohua (1); Wei, Jun (1); Xu, Wei (1)

Author affiliation:(1) Technol. Ctr. of Software Eng., Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China

Corresponding author:Liu, S.




(ham_liu@otcai
x.iscas.ac.cn)




Source title:Proceedings
-

IEEE Computer Society's International Computer Software and
Applications Conference

Abbreviated source title:Proc IEEE Comput Soc Int Comput Software Appl Conf

Issue date:2003

Publication year:2003

Pages:120
-
1
25

Language:English

ISSN:07303157

CODEN:PSICD2

Document type:Conference article (CA)

Conference name:Proceedings: 27th Annual International Computer Software and Applications
Conference, COMPSAC 2003

Conference date:November 3, 2003
-

November 6, 2003

Conf
erence location:Dallas, TX, United states

Conference code:61998

Sponsor:IEEE Computer Society

Publisher:Institute of Electrical and Electronics Engineers Computer Society

Abstract:Advancing information technologies are increasing the evolution and variatio
n of
software resources. Applications that cannot adapt to dynamic environments will decrease their
usefulness, particularly to business process systems that face requirements changed frequently.
After surveying related work, we propose a new formalism for

modeling Dynamic Process in
which the state space and transition function are enriched so that one model can transit to another
model at runtime by the computational reflection that aims to represent and modify its own design.
Such goal necessitates an ap
propriate runtime environment. We introduce the Service Cooperation
Middleware (SCM) because it is service
-
oriented, into which the reflection mechanism is easily
attached to support structural and behavioural changes on processes at runtime.

Number of ref
erences:10

Main heading:Electronic commerce

Controlled terms:Middleware
-

Object oriented programming
-

World Wide Web

Uncontrolled terms:Service cooperation middleware (SCM)

Classification code:723.1 Computer Programming
-

723.5 Computer Applications

Trea
tment:Theoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 20>

Accession number:2003287540865

Title:Linear cryptanalysis of Q block cipher

Authors:Wu, Wen
-
Ling (1)

Author affiliation:(1) State Key Lab.

of Info. Security, Inst. of Software, Chinese Acad. of Sci.,
Beijing 100080, China

Corresponding author:Wu, W.
-
L.




(ww1369@yahoo.com.cn)




Source title:Jisuanji Xuebao/Chinese Journal of Computers

Abbreviated source title:Jisuanji Xuebao

Volume:2
6

Issue:1

Issue date:January 2003

Publication year:2003

Pages:55
-
59

Language:Chinese

ISSN:02544164

CODEN:JIXUDT

Document type:Journal article (JA)

Publisher:Science Press

Abstract:Q is a block cipher as a candidate for NESSIE. Q is analyzed by linear crypt
analysis. The
data complexity of the attack with 0.785 success rate is less than 2<sup>118</sup>, the storage
complexity of the attack is less than
2<sup>33</sup>+2<sup>19</sup>+2<sup>18</sup>+2<sup>12</sup> +2<sup>11</sup>
+2<sup>10</sup>. The result show
s that Q is not immune to linear cryptanalysis.

Abstract type:(Edited Abstract)

Number of references:5

Main heading:Cryptography

Controlled terms:Algorithms
-

Approximation theory
-

Computational complexity
-

Probability

Uncontrolled terms:Block ciphers
-

Key cryptography
-

Linear approximation
-

Linear
cryptanalysis

Classification code:716 Telecommunication; Radar, Radio and Television
-

721.1 Computer
Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory
-

723.2 Data Process
ing 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 21>

Accession number:2003257507916

Title:Decom
posing a kind of weakly invertible finite automata with delay 2

Authors:Yao, Gang (1)

Author affiliation:(1) Laboratory of Computer Science, Institute of Software, The Chinese
Academy of Sciences, Beijing 100080, China; (2) Graduate School Chinese Acad. S
ci., Beijing
100039, China

Corresponding author:Yao, G.

Source title:Journal of Computer Science and Technology

Abbreviated source title:J Comput Sci Technol

Volume:18

Issue:3

Issue date:May 2003

Publication year:2003

Pages:354
-
360

Language:English

ISSN:1
0009000

CODEN:JCTEEM

Document type:Journal article (JA)

Publisher:Allerton Press Inc.

Abstract:Some properties of a finite automation composed of two weakly invertible finite
automata with delay 1 are given, where each of these two automata has the output
set of each state
with the same size. And for a weakly invertible finite automation M with delay 2 satisfying the
properties mentioned in this paper, two weakly invertible finite automata with delay 1 are
constructed such that M is equivalent to a sub
-
fini
te
-
automation of the composition of those two.
So a method to decompose this a kind of weakly invertible finite automata with delay 2 is
presented.

Number of references:9

Main heading:Finite automata

Controlled terms:Computer science
-

Electronic document
identification systems
-

Equivalence
classes
-

Public key cryptography

Uncontrolled terms:Finite automaton public key cryptosystems
-

Weakly invertible finite automata

Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switc
hing
Theory, Programming Theory
-

723.5 Computer Applications

Treatment:Theoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 22>

Accession number:2003257507915

Title:A context
-
aware infrastructure for s
upporting applications with pen
-
based interaction

Authors:Li, Yang (1); Guan, ZhiWei (1); Dai, GuoZhong (1); Ren, XiangShi (2); Han, Yong (1)

Author affiliation:(1) Human
-
Comp. Interaction Laboratory, Institute of Software, The Chinese
Academy of Sciences
, Beijing 100080, China; (2) Department of Info. Systems Eng., Kochi
University of Technology, Tosayamada
-
cho, Kochi 782
-
8502, Japan

Corresponding author:Li, Y.




(ly@iel_mail.iscas.ac.cn)




Source title:Journal of Computer Science and Technology

A
bbreviated source title:J Comput Sci Technol

Volume:18

Issue:3

Issue date:May 2003

Publication year:2003

Pages:343
-
353

Language:English

ISSN:10009000

CODEN:JCTEEM

Document type:Journal article (JA)

Publisher:Allerton Press Inc.

Abstract:Pen
-
based user inte
rfaces which leverage the affordances of the pen provide users with
more flexibility and natural interaction. However, it is difficult the construct usable pen
-
based user
interfaces because of the lack of support for their development. Toolkit
-
level suppor
t has been
exploited to solve this problem, but this approach makes it hard to gain platform independence,
easy maintenance and easy extension. In this paper a context
-
aware infrastructure is created,
called WEAVER, to provide pen interaction services for
both novel pen
-
based applications and
legacy GUI
-
based applications. WEAVER aims to support the pen as another standard interactive
device along with the keyboard and mouse and present a high
-
level access interfaces to pen input.
It employs application con
text to tailor its service to different applications. By modeling the
application context and registering the relevant action adapters, WEAVER can offer services, such
as gesture recognition, continuous handwriting and other fundamental ink manipulations,
to
appropriate applications. One of the distinct features of WEAVER is that off
-
the
-
shelf GUI
-
based
software packages can be easily enhanced with pen interaction without modifying the existing
code. In this paper, the architecture and components of WEAVER
are described. In addition,
examples and feedbacks of its use are presented.

Number of references:28

Main heading:Interactive computer systems

Controlled terms:Computer keyboards
-

Encoding (symbols)
-

Gesture recognition
-

Graphical
user interfaces
-

Lega
cy systems
-

Mice (computer peripherals)
-

Software prototyping

Uncontrolled terms:Context aware infrastructure
-

High level access interface
-

Off the shelf
software package
-

Pen based interaction
-

Pen based user interfaces

Classification code:722.2 Com
puter Peripheral Equipment
-

722.4 Digital Computers and Systems
-

723.1 Computer Programming
-

723.2 Data Processing and Image Processing
-

723.5 Computer
Applications

Treatment:Theoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyrigh
t 2009 Elsevier Inc.


<RECORD 23>

Accession number:2003077361255

Title:Accelerated backward warping

Authors:Zhang, YanCi (1); Liu, XueHui (1); Wu, EnHua (1)

Author affiliation:(1) Key Laboratory of Computer Science, Institute of Software, The Chinese
Acad
emy of Sciences, Beijing 100080, China; (2) Fac. of Computer Sci. and Technology,
University of Macau, Macau, China

Corresponding author:Zhang, Y.C.




(zhangyc@ios.ac.cn)




Source title:Journal of Computer Science and Technology

Abbreviated source
title:J Comput Sci Technol

Volume:18

Issue:1

Issue date:January 2003

Publication year:2003

Pages:48
-
55

Language:English

ISSN:10009000

CODEN:JCTEEM

Document type:Journal article (JA)

Publisher:Allerton Press Inc.

Abstract:In this paper a plane
-
based backwar
d warping algorithm is proposed to generate novel
views from multiple reference images. First, depth information is employed to reconstruct space
planes from individual reference images and calculate the potential occluding relationship
between these plane
s. Then the planes which represent each identical space plane from different
reference images are compared with each other to decide the one with the best sample rate to be
preserved and used in the later warping period while the other samples are abandone
d. While the
image of a novel view is produced, traditional methods in computer graphics, such as visibility
test and clipping, are used to process the planes reconstructed. Then the planes processed are
projected onto the desired image from the knowledge
on which plane the desired image pixels are
warped from can be acquired. Finally, pixels' depth of the desired image is calculated and then a
backward warping is performed from these pixels to the reference images to obtain their colors.
The storage requir
ement in the algorithm is small and increases slowly with the number of
reference images increases. By combining the strategy of only preserving the best sample parts
and the backward warping algorithm, the sample problem could be well tackled.

Number of r
eferences:14

Main heading:Image processing

Controlled terms:Algorithms
-

Computer graphics
-

Data storage equipment
-

Three dimensional
-

Visibility

Uncontrolled terms:Accelerated backward warping
-

Image
-
based rendering
-

Layered depth
image

Classificatio
n code:722.1 Data Storage, Equipment and Techniques
-

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 24>

Accessi
on number:2003447707658

Title:RFRTOS: A real
-
time operation system based on Linux

Authors:Li, Xiao
-
Qun (1); Zhao, Hui
-
Bin (1); Ye, Yi
-
Min (1); Sun, Yu
-
Fang (1)

Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China

Corresp
onding author:Li, X.
-
Q.




(lxq@sonata.iscas.ac.cn)




Source title:Ruan Jian Xue Bao/Journal of Software

Abbreviated source title:Ruan Jian Xue Bao

Volume:14

Issue:7

Issue date:July 2003

Publication year:2003

Pages:1203
-
1212

Language:Chinese

ISSN:100
09825

CODEN:RUXUEW

Document type:Journal article (JA)

Publisher:Chinese Academy of Sciences

Abstract:Applications with real
-
time constraints are not only growing in the field of embedded
system, but gaining popularity in the desktop environment as well. In

order to satisfy the need of
users in these aspects, RFRTOS real
-
time OS based on Redflag Linux is developed. The real
-
time
support about real
-
time scheduling, preempted kernel, and fine
-
grain timer in RFRTOS is mainly
discussed. The experimental results
on RFRTOS show that the improvement gives a better result
for applications with real time constraint than original Linux kernel.

Number of references:11

Main heading:Computer operating systems

Controlled terms:Constraint theory
-

Embedded systems
-

Managem
ent
-

Real time systems
-

Scheduling

Uncontrolled terms:Fine grain timers
-

Linux kernels
-

Preempted kernels
-

Real time operating
systems
-

Timer management

Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theo
ry, Programming Theory
-

722.4 Digital Computers and Systems
-

723 Computer Software,
Data Handling and Applications
-

921.2 Calculus

Treatment:Applications (APP); Experimental (EXP)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevie
r Inc.


<RECORD 25>

<RECORD 1>

Accession number:2004298271373

Title:Efficient indexing and querying algorithm for large
-
scale XML data

Authors:Qu, Wei
-
Min (1); Zhang, Jun
-
Lin (1); Sun, Le (1); Sun, Yu
-
Fang (1)

Author affiliation:(1) Open Syst. and Chinese

Info. Proc., Inst. of Software, Chinese Acad. of Sci.,
Beijing 100080, China

Corresponding author:Qu, W.
-
M.




(qwm@sonata.iscas.ac.cn)




Source title:Ruan Jian Xue Bao/Journal of Software

Abbreviated source title:Ruan Jian Xue Bao

Volume:14

Issue:
SUPPL.

Issue date:October 2003

Publication year:2003

Pages:97
-
108

Language:Chinese

ISSN:10009825

CODEN:RUXUEW

Document type:Journal article (JA)

Publisher:Chinese Academy of Sciences

Abstract:To optimize the query evaluation of extensible markup language (
XML) data, several
indexing schemes were proposed in recent years. However, most of these schemes result in poor
performance when XML data have large size or intricate structure. To overcome these limitations,
the paper proposes I
-
index which is a novel in
dexing and querying scheme to evaluate partial
matching path queries. I
-
index constructs another index on original path indexes, and achieves the
target set of queries by filtering scratch label path candidates backwardly. The paper also builds a
cache sys
tem to accelerate the processing of queries, which is called Qcache. This paper presents
the architecture of I
-
index along with algorithms to construct I
-
index and evaluate partial
matching path queries. Experimental results confirm that I
-
index improves q
uery processing
greatly, with the performance gap increasing with the size and structure complexity of source
XML data.

Number of references:15

Main heading:Indexing (of information)

Controlled terms:Information retrieval
-

XML

Uncontrolled terms:Extensibl
e markup language
-

I
-
index
-

Qcache
-

Querying algorithm

Classification code:723.5 Computer Applications
-

903.1 Information Sources and Analysis
-

903.3 Information Retrieval and Use

Treatment:Applications (APP)

Database:Compendex

Compilation and indexin
g terms, Copyright 2009 Elsevier Inc.


<RECORD 26>

Accession number:2004078020703

Title:Asymptotically optimal successive overrelaxation methods for systems of linear equations

Authors:Bai, Zhong
-
Zhi (1); Chi, Xue
-
Bin (2)

Author affiliation:(1) ICMSEC, In
st. of Math. and Syst. Sci., Chinese Acad. of Sci., Beijing
100080, China; (2) R and D Ctr. for Parallel Software, Inst. of Software, Chinese Acad. of Sci.,
Beijing 100080, China

Corresponding author:Bai, Z.
-
Z.

Source title:Journal of Computational Mathem
atics

Abbreviated source title:J Comput Math

Volume:21

Issue:5

Issue date:September 2003

Publication year:2003

Pages:603
-
612

Language:English

ISSN:02549409

CODEN:JCMMEB

Document type:Journal article (JA)

Publisher:Inst. of Computational Mathematics and Sc.
/Eng. Computing

Abstract:A class of asymptotically optimal successive overrelaxation methods for solving the large
sparse system of linear equations are presented. Numerical computations show that these methods
are more efficient and robust than the classi
cal successive overrelaxation method.

Abstract type:(Edited Abstract)

Number of references:9

Main heading:Linear equations

Controlled terms:Errors
-

Matrix algebra

Uncontrolled terms:Iteration numbers
-

Relaxation factor
-

Residual errors
-

Successive
over
relaxation methods

Classification code:921 Mathematics

Treatment:Theoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 27>

Accession number:2003437687159

Title:Threshold
-
based design of quantized decoder

for LDPC codes

Authors:He, Yu
-
Cheng (1); Li, Hong
-
Pei (2); Sun, Shao
-
Hui (2); Li, Lei (2)

Author affiliation:(1) National Key Lab. of ISN, Xidian University, Xi'an 710071, China; (2)
General Software Lab., Institute of Software, Chinese Academy of Scienc
es, Beijing 100080,
China

Corresponding author:He, Y.
-
C.




(yuchengh@hotmail.com)




Source title:IEEE International Symposium on Information Theory
-

Proceedings

Abbreviated source title:IEEE Int Symp Inf Theor Proc

Issue date:2003

Publication year
:2003

Pages:149

Language:English

CODEN:PISTFZ

Document type:Conference article (CA)

Conference name:Proceedings 2003 IEEE International Symposium on Information Theory (ISIT)

Conference date:June 29, 2003
-

July 4, 2003

Conference location:Yokohama, Japan

Conference code:61607

Sponsor:IEEE Information Theory Society

Publisher:Institute of Electrical and Electronics Engineers Inc.

Abstract:The effects of quantization on the sum
-
product (SP) algorithm for iteratively decoding
low
-
density parity
-
check (LDPC) c
odes are investigated. Two threshold
-
based designs of the
quantized sum
-
product (Q
-
SP) algorithm are presented together with the results of the 4
-
bit
decoding for several known regular codes over the additive white Gaussian noise channel.
Nonuniform quanti
zation can significantly improve the Q
-
SP decoding performance without
increase in implementation complexity.

Number of references:3

Main heading:Decoding

Controlled terms:Algorithms
-

Codes (symbols)
-

Communication channels (information theory)
-

Computa
tional complexity
-

Gaussian noise (electronic)
-

Iterative methods
-

White noise

Uncontrolled terms:Additive white Gaussian noise
-

Low density parity check codes
-

Quantized
decoder
-

Quantized sum product algorithm

Classification code:716.1 Information
Theory and Signal Processing
-

723.2 Data Processing and
Image Processing
-

921.6 Numerical Methods

Treatment:Theoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 28>

Accession number:2003467728512

Titl
e:Nonlinear cryptanalysis of 5
-
round SAFER++

Authors:Wu, Wen
-
Ling (1); Ma, Heng
-
Tai (1); Tang, Liu
-
Ying (1); Qing, Si
-
Han (1)

Author affiliation:(1) Ctr. for Info. Security Technol., Chinese Acad. of Sci., Beijing 100080,
China; (2) Lab. of Info. Security
, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China

Corresponding author:Wu, W.
-
L.

Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica

Abbreviated source title:Tien Tzu Hsueh Pao

Volume:31

Issue:7

Issue date:July 2003

Publication year:20
03

Pages:961
-
965

Language:Chinese

ISSN:03722112

CODEN:TTHPAG

Document type:Journal article (JA)

Publisher:Chinese Institute of Electronics

Abstract:SAFER++ is selected for further evaluation in NESSIE Second Phase. The designers
claim that 2.5 rounds SAFER
++ is secure against linear cryptanalysis. J.Nakahara Jr and
B.Preneel report that an improved linear cryptanalysis reaches up to 4 rounds SAFER++ for weak
key classes of 256
-

bit keys. Based on the analysis and test of basic modules, nonlinear
cryptanalys
is on 5 rounds SAFER++ is given, data complexity is 2<sup>120</sup> and
computation complexity is 2<sup>250</sup>. This is not a real threat to the security of the
SAFER++, but it is shown that 5 rounds SAFER++ is not immune to nonlinear cryptanalysis, and

nonlinear cryptanalysis is more effective to 5 rounds SAFER++ than linear cryptanalysis and
improved linear cryptanalysis of J.Nakahara and B.Preneel.

Abstract type:(Edited Abstract)

Number of references:6

Main heading:Cryptography

Controlled terms:Algori
thms
-

Approximation theory
-

Computational complexity
-

Security of
data

Uncontrolled terms:Linear approximation
-

Linear cryptanalysis
-

Nonlinear approximation
-

Nonlinear cryptanalysis

Classification code:716 Telecommunication; Radar, Radio and Televis
ion
-

721.1 Computer
Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory
-

723
Computer Software, Data Handling and Applications
-

921 Mathematics

Treatment:Applications (APP); Theoretical (THR)

Database:Compendex

Compilati
on and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 29>

Accession number:2003427673903

Title:Probabilistic Belief Logic and Its Probabilistic Aumann Semantics

Authors:Cao, ZiNing (1); Shi, ChunYi (2)

Author affiliation:(1) Dept. of Comp. Sci. and

Technology, Tsinghua University, Beijing 100084,
China; (2) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences,
Beijing 100080, China

Corresponding author:Cao, Z.




(caozn@tsinghua.org.cn)




Source title:Journal of
Computer Science and Technology

Abbreviated source title:J Comput Sci Technol

Volume:18

Issue:5

Issue date:September 2003

Publication year:2003

Pages:571
-
579

Language:English

ISSN:10009000

CODEN:JCTEEM

Document type:Journal article (JA)

Publisher:Allerton
Press Inc.

Abstract:In this paper, we present a logic system for probabilistic belief named PBL, which
expands the language of belief logic by introducing probabilistic belief. Furthermore, we give the
probabilistic Aumann semantics of PBL. We also list so
me valid properties of belief and
probabilistic belief, which form the deduction system of PBL. Finally, we prove the soundness and
completeness of these properties with respect to probabilistic Aumann semantics.

Number of references:11

Main heading:Probab
ilistic logics

Controlled terms:Computer programming languages
-

Computer simulation
-

Functions
-

Mathematical models
-

Semantics
-

Set theory
-

Syntactics

Uncontrolled terms:Assignment functions

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
-

903.2 Information Dissemination
-

921.4 Combinatorial Mathematics, Includes
Graph Theory, Set Theory
-

922.1 Probability T
heory

Treatment:Theoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 30>

Accession number:2003427673902

Title:Study on Strand Space Model Theory

Authors:Ji, QingGuang (1); Qing, SiHan (1); Zhou, YongBin

(1); Feng, DengGuo (1)

Author affiliation:(1) Stt. Key Lab. of Info. Security, Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China; (2) Eng. Res. Ctr. Info. Secty. Technol., Institute of Software,
Chinese Academy of Sciences, Beijin
g 100080, China

Corresponding author:Ji, Q.




(qgji@ercist.iscas.ac.cn)




Source title:Journal of Computer Science and Technology

Abbreviated source title:J Comput Sci Technol

Volume:18

Issue:5

Issue date:September 2003

Publication year:2003

Pages:
553
-
570

Language:English

ISSN:10009000

CODEN:JCTEEM

Document type:Journal article (JA)

Publisher:Allerton Press Inc.

Abstract:The growing interest in the application of formal methods of cryptographic protocol
analysis has led to the development of a numbe
r of different ways for analyzing protocol. In this
paper, it is strictly proved that if for any strand, there exists at least one bundle containing it, then
an entity authentication protocol is secure in strand space model (SSM) with some small
extensions
. Unfortunately, the results of attack scenario demonstrate that this protocol and the
Yahalom protocol and its modification are de facto insecure. By analyzing the reasons of failure of
formal inference in strand space model, some deficiencies in original

SSM are pointed out. In
order to break through these limitations of analytic capability of SSM, the generalized strand
space model (GSSM) induced by some protocol is proposed. In this model, some new classes of
strands, oracle strands, high order oracle s
trands etc., are developed, and some notions are
formalized strictly in GSSM, such as protocol attacks, valid protocol run and successful protocol
run. GSSM can then be used to further analyze the entity authentication protocol. This analysis
sheds light o
n why this protocol would be vulnerable while it illustrates that GSSM not only can
prove security protocol correct, but also can be efficiently used to construct protocol attacks. It is
also pointed out that using other protocol to attack some given proto
col is essentially the same as
the case of using the most of protocol itself.

Number of references:30

Main heading:Security of data

Controlled terms:Computer crime
-

Computer simulation
-

Cryptography
-

Network protocols

Uncontrolled terms:Authentication p
rotocols

Classification code:723.2 Data Processing and Image Processing
-

723.5 Computer Applications
-

902.3 Legal Aspects

Treatment:Theoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 31>

Accession n
umber:2004158109746

Title:A Novel Estimation of Hurst Index Based On Wavelet

Authors:Hong, Fei (1); Wu, Zhimei (1)

Author affiliation:(1) Multimedia Research Center, Institute of Software, Chinese Academy of
Sciences

Source title:International Conference

on Communication Technology Proceedings, ICCT

Abbreviated source title:Int. Conf. Commun. Technol. Proc. ICCT

Volume:2

Monograph title:2003 International Conference on Communication Technology, ICCT 2003

Issue date:2003

Publication year:2003

Pages:1447
-
14
50

Language:English

Document type:Conference article (CA)

Conference name:2003 International Conference on Communication Technology, ICCT 2003

Conference date:April 9, 2003
-

April 11, 2003

Conference location:Beijing, China

Conference code:62559

Sponsor:C
hina Institute of Communications (CIC); Chinese Institute of Electronics (CIE); IEEE
COMSOC

Publisher:Institute of Electrical and Electronics Engineers Inc.

Abstract:Recent measurement studies show that the burstiness of packet traffic in LAN as well as
WA
N is associated with self
-
similar and long
-
range dependent. In this paper, we analysis them
using discrete wavelet transform, and describe the nature of the wavelet coefficients and their
statistical properties. Then we present an adaptive, efficient unbia
sed estimation of Hurst index
based on multiresolution wavelet analysis and weighted regression. Simulation results based on
Fractal Gaussian Noise(FGN) and real traffic data reveal the proposed adaptive approach shows
more accuracy and robustness than tra
ditional methods which has only O(N)computation. Thus
our algorithm can be applied to the real
-
time application of traffic enforcement and congestion
control in high
-
speed networks.

Number of references:10

Main heading:Packet networks

Controlled terms:Cong
estion control (communication)
-

Gaussian noise (electronic)
-

Local area
networks
-

Mathematical models
-

Multimedia systems
-

Statistical methods
-

Telecommunication
traffic
-

Wavelet transforms

Uncontrolled terms:Hurst index
-

Self similar
-

Wavelets

Cl
assification code:701.1 Electricity: Basic Concepts and Phenomena
-

716 Telecommunication;
Radar, Radio and Television
-

723.5 Computer Applications
-

921.3 Mathematical
Transformations
-

922.2 Mathematical Statistics

Treatment:Theoretical (THR)

DOI:10.110
9/ICCT.2003.1209800

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 32>

Accession number:2004088024226

Title:Improved Joint Carrier and Sampling Frequency Offset Estimation Scheme for OFDM
Systems

Authors:Lei, Wen (
1); Cheng, Weiming (1); Sun, Liming (1)

Author affiliation:(1) Dept. of Multimedia Communication, Institute of Software, Chinese
Academy of Sciences, 100080 Beijing, China

Corresponding author:Lei, W.

Source title:GLOBECOM
-

IEEE Global Telecommunication
s Conference

Abbreviated source title:GLOBECOM IEEE Global Telecommun. Conf.

Volume:4

Issue date:2003

Publication year:2003

Pages:2315
-
2319

Language:English

CODEN:CRIEET

Document type:Conference article (CA)

Conference name:IEEE Global Telecommunications C
onference GLOBECOM'03

Conference date:December 1, 2003
-

December 5, 2003

Conference location:San Francisco, CA, United states

Conference code:62234

Sponsor:IEEE Communications Society; ICC GLOBECOM

Publisher:Institute of Electrical and Electronics Enginee
rs Inc.

Abstract:In this paper, we present an improved joint carrier and sampling frequency offset
estimation (JCSFOE) scheme for OFDM systems. With adaptive weighted carrier frequency offset
estimation and compensation, this improved JCSFOE scheme reduces

sensitivity of sampling
frequency offset estimation to the inter
-
carrier interference (ICI) caused by carrier frequency offset.
Moreover, by carefully combining estimates from several OFDM preambles, more accurate
sampling frequency offset estimation is a
chieved. Effects of sampling frequency offset and
frequency selective fading on the improved JCSFOE scheme are analyzed. Simulation results
show that the proposed scheme significantly improves the system performance compared with
existing methods.

Number o
f references:7

Main heading:Orthogonal frequency division multiplexing

Controlled terms:Bandwidth
-

Computer simulation
-

Fading (radio)
-

Fast Fourier transforms
-

Frequency response
-

Radio interference
-

Signal to noise ratio
-

Synchronization

Uncontrol
led terms:Carrier frequency offset
-

Inter
-
carrier interference (ICI)

Classification code:716 Telecommunication; Radar, Radio and Television
-

716.1 Information
Theory and Signal Processing
-

716.3 Radio Systems and Equipment
-

723.5 Computer
Applications
-

921.3 Mathematical Transformations

Treatment:Theoretical (THR)

DOI:10.1109/GLOCOM.2003.1258648

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 33>

Accession number:2003437694352

Title:A doctrine
-
oriented MRM metho
d in HLA
-
based simulation

Authors:Hu, Siquan (1); Fan, Zhihua (1)

Author affiliation:(1) General Software Laboratory, Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China

Corresponding author:Hu, S.

Source title:Chinese Journal of El
ectronics

Abbreviated source title:Chin J Electron

Volume:12

Issue:4

Issue date:October 2003

Publication year:2003

Pages:511
-
516

Language:English

ISSN:10224653

CODEN:CHJEEW

Document type:Journal article (JA)

Publisher:Chinese Institute of Electronics

Abstr
act:MRM (Multi
-
resolution modeling) is becoming more important as large complex
distributed simulations are carried out inside and out of military simulation community. Most
current distributed simulations are implemented in the framework of HLA (High leve
l
architecture), which was originally defined by US DOD (Department of defense) and has been
accepted by IEEE and OMG as an industrial simulation standard. This paper analyzes the
requirements of MRM in HLA (High level architecture)
-
based simulations. Trad
itional most
adopted practical method "aggregation/disaggregation" has temporal inconsistency problem
because it discard the other level as it's at one level. The mainstream theoretic method "MRE
(Multiple representation entity)" conquers this problem by p
ropagating changes at one resolution
to others, but it has weakness in mapping consistence. This paper suggested a doctrine
-
oriented
MRM method. This novel method has good operational easiness and keeps the consistency
problem simpler than MRE by enforcing

unidirectional map between entities in different
resolutions. A case study is also provided to illustrate its advantage to aggregation/disaggregation
method.

Number of references:10

Main heading:Computer simulation

Controlled terms:Computer architecture
-

Ground penetrating radar systems
-

Interoperability
-

Military operations
-

Simulators
-

Standards

Uncontrolled terms:Distributed simulation
-

Doctrine
-
oriented multi
-
resolution modeling
-

High
level architecture
-
based simulation

Classification code:404.1

Military Engineering
-

716.2 Radar Systems and Equipment
-

723.5
Computer Applications
-

902.2 Codes and Standards

Treatment:Applications (APP); Theoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 34>

Accession number:2004068009275

Title:Type of secure Web server system based on BLP model

Authors:Liu, Ke
-
Long (1); Qing, Si
-
Han (1); Feng, Deng
-
Guo (2)

Author affiliation:(1) Res. Ctr. for Info. Security, Chinese Acad. of Sci., Beijing 100080, China; (2)

Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China

Corresponding author:Liu, K.
-
L.

Source title:Jisuanji Xuebao/Chinese Journal of Computers

Abbreviated source title:Jisuanji Xuebao

Volume:26

Issue:10

Issue date:Octob
er 2003

Publication year:2003

Pages:1280
-
1287

Language:Chinese

ISSN:02544164

CODEN:JIXUDT

Document type:Journal article (JA)

Publisher:Science Press

Abstract:To overcome the shortcomings of the communications based on the Web, this paper
presents the conce
pt of secure Web server. And in order to achieve the goal, the authors present
and implement a secure Web server system based on BLP formal model.

Number of references:7

Main heading:Servers

Controlled terms:Client server computer systems
-

Communication s
ystems
-

Computer operating
systems
-

Data structures
-

HTTP
-

Resource allocation
-

Security of data
-

World Wide Web

Uncontrolled terms:Bell La Padula model
-

Secure operating system
-

Web server

Classification code:722 Computer Systems and Equipment
-

7
23 Computer Software, Data
Handling and Applications

Treatment:Applications (APP); Theoretical (THR); Experimental (EXP)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 35>

Accession number:2004228188619

Title:A nov
el genetic algorithm with King strategy

Authors:Wang, Hui (1); Buczak, Anna L. (2); Wang, Hongan (1)

Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, 100080, China;
(2) Advanced Technology Laboratories, Lockheed Martin,
Cherry Hill, NJ 08002

Corresponding author:Wang, H.

Source title:Intelligent Engineering Systems Through Artificial Neural Networks

Abbreviated source title:Intell Eng Syst Artif Neural Networks

Volume:13

Monograph title:Smart Engineering System Design: N
eural Networks, Fuzzy Logic, Evolutionary
Programming, Complex Systems and Artificial Life
-

Proceedings of the Artificial Neural
Networks in Engineering Conference

Issue date:2003

Publication year:2003

Pages:249
-
254

Language:English

CODEN:IEANFQ

Document
type:Conference article (CA)

Conference name:Smart Engineering System Design: Neural Networks, Fuzzy Logic,
Evolutionary Programming, Complex Systems and Artificial Life
-

Proceedings of the Artificial