Title: Study on an incomplete evaluation model and its iterative revision algorithm

��#ࡱ#�################>###�� #############�###�O##########�O#######O#######O###O###O###O###O###O###O###O###O###O###O###O###O## O##!O##"O###O##$O##%O##&O##'O##(O##)O##*O##+O##,O##-O##.O##/O##0O##1O##2O##3O##4O##5O##6O##7O##8O##9O##:O##;O##<O##=O##>O##?O##@O##AO##BO##CO##DO##EO##FO##GO##HO##IO##JO##KO##LO##MO##NO##OO##PO##QO##RO##SO##TO##UO##VO##WO##XO##YO##ZO##[O##\O##]O##^O##_O##`O##aO##bO##cO##dO##eO##fO##gO##hO##iO##jO##kO##lO##mO##nO##oO##pO##qO##rO##sO##tO##uO##vO##wO##xO##yO##zO##{O##|O##}O##~O##O##��#q` ###�R�###############�}_###bjbjqPqP######################2�t##:###:##�u_#############################��##########��##########��##################�#####z#######z###z#######z#######z#######z#######z###############�#######6s&#####6s&#####6s&#####6s&#�###�s&#�T##�#######@#)#�###��&#####��&#####��&#####��&#####��&#####}�&#####}�&#####}�&#####�#)#####�#)#####�#)#####�#)#####�#)#####�#)#####�#)#$###2#)#h###�#)#:###�#)#####################z#######�>(#####################}�&#####}�&#####�>(#####�>(#####�#)#############z#######z#######��&#############��&#�###�#)#####�#)#####�#)#####�#)#####�>(#��##z#######��&#####z#######��&#####�#)#############�#)#####################################################�>(#####�#)#############�#)#############�#)#####z#######z###############################################################�#)#####��&#####��&# ###��3[V�#########6s&#####q�(#n2##�#)#############�#)#######)#0###@#)#####�#)#####�#)#####�#)#�###�#)#####�#)#############################################################################�#)#############z#######�#)#$###}�&#�##QI'#N[##�#)#####��'# I##��'##Q##################################}�&#####}�&#####}�&#####�#)#####�#)#####################################y#)#"###################################}�&#####}�&#####}�&#####@#)#####�>(#####�>(#####�>(#####�>(#############�#######�#######�###De&#�h&#d ##�#######�#######�#######�h&#####�#######�#######�#######z#######z#######z#######z#######z#######z#######����###### ###################################################################################################################################################################################################################################################################################################################################################################################################################################################################################################################################################################################################EI 2000 <RECORD 1> Accession number:2000095313921 Title:Study on an incomplete evaluation model and its iterative revision algorithm Authors:Du, Jiang (0); Liu, Hongju (0) Corr. author affiliation:Inst of Software, Chinese Acad of Sciences, Beijing, China Source title:Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice Abbreviated source title:Xitong Gongcheng Lilum yu Shijian Volume:20 Issue:2 Issue date:Feb 2000 Publication year:2000 Pages:63-67 Language:Chinese ISSN:10006788 CODEN:XGLSE2 Document type:Journal article (JA) Publisher:Systems Engineering Society of China, China Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 2> Accession number:2001185572639 Title:Spatial data classification based on rough set Authors:Shi, Yun (1); Sun, Yufang (1); Zuo, Chun (1) Author affiliation:(1) Inst of Software, Chinese Acad of Sciences, Beijing, China Corresponding author:Shi, Yun Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:5 Issue date:May 2000 Publication year:2000 Pages:673-678 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Abstract:Recent studies for the scope of data mining have extended from relation and transactional databases to spatial databases. Spatial data mining is a promising field,where the research work on spatial data classification is still in initial stage. In this paper, the advantages and the disadvantages of several existing methods of spatial data classification are compared first. Then an effective three-step method, which is based on the rough set theory for spatial data classification, is proposed. The validity of this algorithm to the problem of incomplete spatial information is verified by pertinent experimental results. Abstract type:(Edited Abstract) Number of references:15 Main heading:Data mining Controlled terms:Algorithms - Classification (of information) - Database systems - Experiments - Reduction - Relational database systems Uncontrolled terms:Rough set - Spatial data classification - Spatial databases - Three step method - Transactional databases Classification code:723.2 Data Processing and Image Processing - 723.3 Database Systems - 723.5 Computer Applications - 921 Mathematics Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 3> Accession number:2001015500451 Title:Engine fault diagnosis using multiple neural networks based on information synthesis Authors:Cheng, Xiaochun (0); Yu, Xianchuan (0) Corr. author affiliation:Inst of Software, Chinese Acad of Sciences, Beijing, China Source title:Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence Abbreviated source title:Moshi Shibie yu Rengong Zhineng Volume:13 Issue:3 Issue date:Sep 2000 Publication year:2000 Pages:338-341 Language:Chinese ISSN:10036059 CODEN:MRZHET Document type:Journal article (JA) Publisher:J Pattern Recognit Artif Intell, China Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 4> Accession number:2004057972505 Title:A higher-order duration calculus and its completeness Authors:Zhan, Naijun (0) Corr. author affiliation:Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Source title:Science in China, Series E: Technological Sciences Abbreviated source title:Sci China Ser E Technol Sci Volume:43 Issue:6 Publication year:2000 Pages:625-640 Language:English ISSN:10069321 CODEN:SCETFO Document type:Journal article (JA) Publisher:Science in China Press Abstract:This paper studies how to -escribe the real-time behaviour of programs using duration calculus. Since program variables are interpreted as functions over time in real-time programming, and it is inevitable to introduce quantifications over program variables in order to describe local variable declaration and declare local channel and so on. Therefore to establish a higher-order duration calculus ( HDC ) is necessary, We first establish HDC, then show some real-time properties of programs in terms of HDC, and then, prove that HDC is complete on abstract domains under the assumption that all program variables vary finitely. Number of references:20 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 5> Accession number:2001185572630 Title:Research on a new type integrated security system Authors:Meng, Yang (1); Liu, Kelong (1); Qing, Sihan (1) Author affiliation:(1) Inst of Software, Chinese Acad of Sciences, Beijing, China Corresponding author:Meng, Yang Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:5 Issue date:May 2000 Publication year:2000 Pages:616-619 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Abstract:In this paper, a new Yaksha security system is presented based on ELGAMAL (NOT RSA) algorithm, The system is capable of reusing a single security infrastructure to perform various security functions-cryptography, digital signatures, distributed authentication and key exchange. At the same time, how the system can be used for key escrow is also described, one of the discussions which attract public attention. Abstract type:(Edited Abstract) Number of references:8 Main heading:Security systems Controlled terms:Algorithms - Cryptography - Electronic document identification systems Uncontrolled terms:Certification authorities - Digital signatures - Discrete logarithms - Distributed authentication - Elgamal algorithm - Integrated security systems - Key escrow - Key exchange - Security infrastructure - Yaksha security systems Classification code:723 Computer Software, Data Handling and Applications - 901.3 Engineering Research - 911.2 Industrial Economics - 914.1 Accidents and Accident Prevention - 921 Mathematics Treatment:General review (GEN); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 6> Accession number:2000095315263 Title:Flexible architecture in a measurement tool towards programs written in OO languages Authors:Ruan, Tong (0); Shen, Beijun (0); Ju, Dehua (0) Corr. author affiliation:Inst of Software, Chinese Acad of Sciences, Beijing, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:37 Issue:4 Issue date:Apr 2000 Publication year:2000 Pages:401-406 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Sci Press Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 7> Accession number:2000095317556 Title:Two-level fuzzy multi-factorial evaluation of alternative process plans Authors:Cao, Xibin (0); Cai, Ligang (0); Li, Peigen (0) Corr. author affiliation:Inst of Software, Chinese Acad of Sciences, Beijing, China Source title:Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice Abbreviated source title:Xitong Gongcheng Lilum yu Shijian Volume:20 Issue:6 Issue date:Jun 2000 Publication year:2000 Pages:25-31, 136 Language:Chinese ISSN:10006788 CODEN:XGLSE2 Document type:Journal article (JA) Publisher:Systems Engineering Society of China, China Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 8> Accession number:2001115502339 Title:Method of image synthesis for novel viewpoints based on vision constraints Authors:Liu, Xuehui (1); Sun, Hanqiu (1); Wu, Enhua (1) Author affiliation:(1) Inst of Software, Chinese Acad of Sciences, Beijing, China Corresponding author:Liu, Xuehui Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:9 Issue date:Sep 2000 Publication year:2000 Pages:1207-1213 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Acad Sci, China Abstract:Due to the visibility change and surface enlargement in the new view as viewpoint moves, 3D reprojection from just one reference image inevitably produces holes in the destination image. In tackling the problem, a common solution is to conduct image synthesis from multiple reference images. However, how to extract the needed information in the novel view from these images with plenty of redundant information becomes one of the key techniques in image-based modeling and rendering. In this paper, a new method of image synthesis from multiple (currently two) reference images is proposed. The method combines forward warping and inverse warping to fulfil the image composition task for a novel viewpoint. In the algorithm, vision constraint-epipolar constraint is employed to search the pixel from other reference images in filling the hole, so as to avoid depth comparison and re-mapping of the whole reference images. Besides, the searching process is accelerated by taking advantage of pixel ordering on pairs of epipolar lines and the information already in the destination image. Without increasing the complexity of previous warping method, this algorithm greatly reduces the computation required in image synthesis from multiple reference images. Abstract type:(Edited Abstract) Number of references:11 Main heading:Computer vision Controlled terms:Computer graphics - Constraint theory - Depth perception - Image processing - Virtual reality Uncontrolled terms:Depth image map - Epipolar constraint - Forward warping - Image based modeling and rendering - Reverse warping Classification code:723 Computer Software, Data Handling and Applications - 741.2 Vision - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 9> Accession number:2003157433844 Title:Construction of S-boxes with some cryptographic properties Authors:Liu, Xiao-Chen (1); Feng, Deng-Guo (2) Author affiliation:(1) Lab. of Info. Security, Sch. of Univ. of Sci. and Technol., Beijing 100039, China; (2) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (3) Eng. Res. Center for Info., Security Technol., Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Feng, D.-G. (fengdg@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:10 Issue date:October 2000 Publication year:2000 Pages:1299-1302 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:S-boxes are the only nonlinear component in many algorithms for encryption, whose intension decides the security strength of the whole algorithm. By theoretical analysis and statistics, there is evidence that large S-boxes have better cryptographic properties than small S-boxes. But they are harder to design and to implement. Now the 8 &times; 8 S-box is popular. In this paper, a method for constructing the 8 &times; 8 S-box and 8 &times; 6 S-box based on m-sequence is described. Through testing, some S-boxes with better nonlinearity and better difference uniformity are obtained. Finally some 4 &times; 4 S-boxes based on orthomorphic permutation are designed. These S-boxes offer the nonlinear resource for further design of cryptographic algorithms. Number of references:2 Main heading:Cryptography Controlled terms:Algorithms - Construction - Linear algebra - Mathematical transformations Uncontrolled terms:Blockciphers - Difference uniformity - M sequence - Nonlinearities - Orthomorphic permutation - S boxes Classification code:716.1 Information Theory and Signal Processing - 723 Computer Software, Data Handling and Applications - 921.1 Algebra - 921.3 Mathematical Transformations Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 10> Accession number:2000095317002 Title:Design of COSIX V1.x SCSI system Authors:Wang, Ying (0); Sun, Yufang (0) Corr. author affiliation:Inst of Software, Chinese Acad of Sciences, Beijing, China Source title:Xiaoxing Weixing Jisuanji Xitong/Mini-Micro Systems Abbreviated source title:Xiaoxing Weixing Jisuanji Xitong Volume:21 Issue:5 Issue date:May 2000 Publication year:2000 Pages:504-507 Language:Chinese ISSN:10001220 CODEN:XWJXEH Document type:Journal article (JA) Publisher:Shenyang Inst Comput Technol, China Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 11> Accession number:2001115502133 Title:Methodology for automatically constructing a multimedia synchronizer in XYZ/RE Authors:Zhao, Chen (1); Tang, Zhisong (1); Ma, Huadong (1) Author affiliation:(1) Inst of Software, Chinese Acad of Sciences, Beijing, China Corresponding author:Zhao, Chen Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:8 Issue date:Aug 2000 Publication year:2000 Pages:995-1002 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Acad Sci, China Abstract:XYZ system is a programming support system with the goal to enhance reliability and productivity of software development. It consists of a TLL (temporal logic language) XYZ/E to serve as its kernel and a suite of software engineering tools. In order to study the application of XYZ system to the multimedia field, A method for automatically generating synchronizer in XYZ/RE from the temporal specification of a multimedia program is presented. XYZ/RE is a sub-language representing real time system in XYZ/E. Compared with the related work, this method can transform not only a simple temporal specification but also a nested temporal specification, so that the generated synchronizer can be reused for different purposes. Abstract type:(Edited Abstract) Number of references:6 Main heading:Multimedia systems Controlled terms:Computational linguistics - Computer programming - Logic programming - Program compilers - Software engineering Uncontrolled terms:Synchronizer - Temporal logic language Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1 Computer Programming Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 12> Accession number:2001115502633 Title:Construction and realistic rendering of scenes with highly-complex plants Authors:Chen, Yanyun (1); Lin, Hui (1); Sun, Hanqiu (1); Wu, Enhua (1) Author affiliation:(1) Inst of Software, Chinese Acad of Sciences, Beijing, China Corresponding author:Chen, Yanyun Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:23 Issue:9 Issue date:Sep 2000 Publication year:2000 Pages:917-924 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Sci Press Abstract:Realistic rendering of complex natural scenes is a challenging research topic in computer graphics. Plant objects such as trees and grasses play an important role in the construction of virtual scenes. Plant objects are diversified to many classic types with variable complex structures and geometric shapes. Due to the complexity of types, realistic modeling and rendering of such a natural scene are usually costly and time consuming. To tackle the problem, polygons, texels, and volumetric texture are employed as effective tools to construct and render the classic types of plant objects based on type features. The method proposed in the paper simplifies the complexity and eliminates the aliasing of visual effects. The experiments show that generating realistic images of natural plant scenes using hybrid modeling and rendering techniques employed in this paper is feasible. Abstract type:(Edited Abstract) Number of references:20 Main heading:Virtual reality Controlled terms:Animation - Computer graphics - Drawing (graphics) - Image processing - Plants (botany) - Textures Uncontrolled terms:Natural scenes - Ray tracing - Realistic image synthesis - Volumetric texture Classification code:461.9 Biology - 723 Computer Software, Data Handling and Applications - 933 Solid State Physics Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 13> Accession number:2003157433850 Title:New non-repudiation protocol Authors:Qing, Si-Han (1) Author affiliation:(1) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Eng. Res. Center for Info. Security, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Qing, S.-H. (qsihan@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:10 Issue date:October 2000 Publication year:2000 Pages:1338-1343 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:A new non-repudiation protocol is presented based on the correction of an existing protocol which has some security flaws. This scheme can work on an insecure and unreliable communication channel. Besides, it can deal with cheating. Some new notions and approaches for extending the SVO logic are introduced, then the extended SVO logic is used to analyze the new protocol and prove its correctness. Number of references:6 Main heading:Network protocols Controlled terms:Algorithms - Communication channels (information theory) - Cryptography - Data processing - Formal logic - Security of data Uncontrolled terms:Adjudicators - Cipher algorithms - Modular logic - Non repudiation protocols - SVO logic - Trusted third parties 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 - 921 Mathematics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 14> Accession number:2000045125713 Title:Research on the methodology of development of DSS based on object oriented model Authors:Du, Jiang (0); Sun, Yufang (0) Corr. author affiliation:Inst of Software, Chinese Acad of Sciences, Beijing, China Source title:Gongcheng Kancha/Geotechnical Investigation and Surveying Abbreviated source title:Gongcheng Kancha Issue:1 Issue date:Jan 22 2000 Publication year:2000 Pages:1-6 Language:Chinese ISSN:10001433 CODEN:GOKAFH Document type:Journal article (JA) Publisher:China Natl Publ Ind Trading Corp, China Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 15> Accession number:2003157433848 Title:Weaknesses of some threshold group signature schemes Authors:Wang, Gui-Lin (1); Qing, Si-Han (1) Author affiliation:(1) Lab. of Info. Secuirty, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Eng. Res. Center for Info. Securtiy, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Qing, S.-H. (qsihan@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:10 Issue date:October 2000 Publication year:2000 Pages:1326-1332 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Threshold group signature is an important kind of signatures, but all of the existing threshold group schemes have weaknesses. Several properties are proposed to define a good threshold group scheme. Then, the weaknesses of three threshold group schemes are analyzed. The most serious weakness is that part of members can conspire to get system secret parameters and then forge a valid signature. In the worst situation, the total system is broken. Number of references:13 Main heading:Electronic document identification systems Controlled terms:Cryptography - Linear algebra - Security of data - Security systems - System stability Uncontrolled terms:Digital signatures - Secret parameters - Threshold group signatures Classification code:716.1 Information Theory and Signal Processing - 723.2 Data Processing and Image Processing - 723.5 Computer Applications - 731.4 System Stability - 914.1 Accidents and Accident Prevention - 921.1 Algebra Treatment:General review (GEN); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 16> Accession number:2001015500124 Title:Representation of parse tree for context-free language Authors:Chen, Haiming (0); Dong, Yunmei (0) Corr. author affiliation:Inst of Software, Chinese Acad of Sciences, Beijing, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:37 Issue:10 Issue date:Oct 2000 Publication year:2000 Pages:1179-1184 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Sci Press Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 17> Accession number:2001185572634 Title:Design and implementation of an agent-based firewall system Authors:Zhang, Lei (1); Qing, Sihan (1) Author affiliation:(1) Inst of Software, Chinese Acad of Sciences, Beijing, China Corresponding author:Zhang, Lei Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:5 Issue date:May 2000 Publication year:2000 Pages:642-645 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Abstract:In this paper, the authors first analyze the common shortcoming in the existing firewall systems, Based on these, they introduce a new concept-Agent. According to the definition of Agent, they define some Agent-based components of a firewall, and then describe the communication and collaboration of the Agents. Finally, the course of designing and deploying an Agent-based firewall is presented. Number of references:6 Main heading:Computer system firewalls Controlled terms:Communication - Components - Computer supported cooperative work Uncontrolled terms:Agent based firewalls - Agents - Application proxy - Collaboration - Firewalls - Implementation - IP filters - Security audit Classification code:716 Telecommunication; Radar, Radio and Television - 723.2 Data Processing and Image Processing - 723.5 Computer Applications Treatment:Applications (APP); General review (GEN) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 18> Accession number:2001115502138 Title:Generating sentences of CFL based on partition of CFG production set Authors:Wang, Honghao (1); Dong, Yunmei (1) Author affiliation:(1) Inst of Software, Chinese Acad of Sciences, Beijing, China Corresponding author:Wang, Honghao Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:8 Issue date:Aug 2000 Publication year:2000 Pages:1030-1034 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Acad Sci, China Abstract:A method is presented to partition productions of CFG (context-free grammar). It divides production set into two parts. The derivation with productions in one part will never terminate, while it must terminate rapidly with productions in the other part. It is proved that the procedure of generating sentences of CFL (context-free language) is using productions in one part to make the sentential form longer and more complex first, and then using productions in the other part to terminate the procedure. A general controllable method is attained for generating sentences of CFL with restricted length or depth. The time and space complexity for generating one sentence is O(r+n), where n is the restricted length or depth of sentences and r is the number of productions in given CFG. The generating strategies for different conditions are also discussed. Abstract type:(Edited Abstract) Number of references:8 Main heading:Context free languages Controlled terms:Computational linguistics - Context free grammars - Formal languages Uncontrolled terms:Sentence generation - Specification acquisition systems Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1.1 Computer Programming Languages Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 19> Accession number:2003157433863 Title:There is No minimal r.e. degree in every nonzero [a]&Epsilon;R/M Authors:Zhang, Zai-Yue (1); Sui, Yue-Fei (1) Author affiliation:(1) Dept. of Comp. Sci., Yangzhou Univ., Yangzhou 225009, China; (2) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhang, Z.-Y. (yzzzy@public.yz.jsinfo.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:11 Issue date:November 2000 Publication year:2000 Pages:1425-1429 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:It is proved that given any nonrecursive r.e. degree a, there exist r.e. degrees c&lt;a and d&Epsilon;M. Therefore, there is no minimal r.e. degree in every nonzero [a]&Epsilon;R/M, the quotient upper semilattice of the recursively enumerable degrees modulo the capable r.e. degrees, i.e., given any noncapable r.e. degrees a, there is an r.e. degree c&lt;a such that [c]=[a]. Number of references:4 Main heading:Theorem proving Controlled terms:Modula (programming language) - Numerical analysis - Set theory - Turing machines Uncontrolled terms:Minimal pair - Recursively enumerable set - Turing degree Classification code:604.2 Machining Operations - 723.4 Artificial Intelligence - 921 Mathematics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 20> Accession number:2004158105030 Title:An Approach of Novel View Generation from Images with Depth Authors:Zheng, Xin (1); Wu, Enhua (1) Author affiliation:(1) Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China; (2) Faculty of Science and Technology, University of Macao, Macao Corresponding author:Zheng, X. (zhx@ox.ios.ac.cn) Source title:Proceedings of the Joint Conference on Information Sciences Abbreviated source title:Proc. Jt. Conf. Inf. Sci. Volume:5 Issue:2 Monograph title:Proceedings of the Fifth Joint Conference on Information Sciences, JCIS 2000, Volume 2 Issue date:2000 Publication year:2000 Pages:62-65 Language:English ISBN-10:0964345692 ISBN-13:9780964345690 Document type:Conference article (CA) Conference name:Proceedings of the Fifth Joint Conference on Information Sciences, JCIS 2000 Conference date:Febrary 27, 2000 - March 3, 2000 Conference location:Atlantic City, NJ, United states Conference code:63044 Sponsor:Association for Intelligent Machinery; Duke University; Elsevier Publishing Company; US Army Research Office Publisher:Duke University/Association for Intelligent Machinery Abstract:In this paper, a backward mapping algorithm for novel view rendering is proposed and implemented based on the sprites with depth. By the algorithm, a novel view image could be generated from multiple reference images, and discontinuous space surfaces are allowed in the reference frames. The usual composite algorithms take much computation in warping all the reference images to the output image. In our three-step transformation process, only one primary reference frame is employed for warping the depth value during the forward mapping step. Under the observation that, the shape of space surfaces often changes smoothly, we propose a heuristic technique to fill the holes with proper depth value, which will be used to find correct color from another reference image during backward mapping step. By using the true depth value in our backward mapping algorithm, more accurate image may be produced. Number of references:7 Main heading:Color image processing Controlled terms:Algorithms - Computational methods - Heuristic methods - Image analysis - Image quality - Image segmentation - Photometry - Problem solving Uncontrolled terms:3D image wraping - Image with depth - Image-based rendering - Sprites Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.2 Data Processing and Image Processing - 723.4 Artificial Intelligence - 741.1 Light/Optics - 921 Mathematics - 941.4 Optical Variables Measurements Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 21> Accession number:2001396665647 Title:Improvement of RED based on estimating parameter Authors:Shi, Z.Q. (1); Wu, Z.M. (1); Liang, J. (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Shi, Z.Q. Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:28 Issue:11 SUPPL. A Issue date:November 2000 Publication year:2000 Pages:88-91 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:The flow control is vital for Internet. Random Early Detection (RED) is an active queue management based on the link, which improves efficiency, stability and impartiality, and is also advocated by IETF. It is presented by Hashem, then had been improved into rather perfection and practicality by Floyd, and further had been appended with the self-configuring by Fang to be more adaptive. After simulation, we find that both RED and the self-configuring can't effectively control the network flow while confronted with large variety of flows, because they can't figure the property of network flows accurately and stably. We give the analytic way to estimate the parameter of RED, which is more accurate and stable than the self-configuring, and then present the amendatory algorithm of RED, which is demonstrated by simulation to be more adaptive with lower transfer delay and jitter. Number of references:9 Main heading:Congestion control (communication) Controlled terms:Algorithms - Computer simulation - Efficiency - Flow control - Internet - Management - Parameter estimation - Queueing theory - Stability Uncontrolled terms:Impartiality - Network flows - Queue management - Random early detection - Transport control protocols Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer Software, Data Handling and Applications - 731 Automatic Control Principles and Applications - 921 Mathematics - 922.1 Probability Theory Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 22> <RECORD 1> Accession number:2000095314020 Title:Implementation of reliable multicast transport of continuous data stream Authors:Huang, Tao (0); Cao, Dongqi (0) Corr. author affiliation:Inst of Software, Chinese Acad of Sciences, Beijing, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:37 Issue:3 Issue date:Mar 2000 Publication year:2000 Pages:359-366 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Sci Press Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 23> Accession number:2000095315523 Title:Improving the performance of Web information caching management by adaptive mechanism Authors:Liu, Ruihong (0); Cao, Dongqi (0) Corr. author affiliation:Inst of Software, Chinese Acad of Sciences, Beijing, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:37 Issue:5 Issue date:May 2000 Publication year:2000 Pages:589-594 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Sci Press Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 24> Accession number:2003157433875 Title:Implementation of online analytical processing system for insurance business Authors:Zhan, Min (1); Sun, Yu-Fang (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhan, M. (zhanmin@.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:11 Issue date:November 2000 Publication year:2000 Pages:1510-1515 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:The wide use of database and the appearance of data warehouse technology provide new direction for decision Support System (DSS). Online Analytical Processing (OLAP) is one of these new DSS technologies based on data warehouse. The mid-database design, multidimensional data analytical models and OLAP analytical system module structure for insurance business are presented in this paper, and the implementation of OLAP function setup subsystem and main analytical subsystem are outlined. It meets the requirement of the 12 rules of E.F. Codd, and makes improvement based on practical application. Number of references:6 Main heading:Decision making Controlled terms:Data mining - Data warehouses - Database systems - Insurance - Online systems - Rotation Uncontrolled terms:Decision support - Online analytical processing - Slice Classification code:722.4 Digital Computers and Systems - 723.2 Data Processing and Image Processing - 912.2 Management Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 25> Accession number:2001185572654 Title:Real-time algorithm of 3-D shadow generation for point light sources Authors:Liu, Lieming (1); Wu, Enhua (1) Author affiliation:(1) Inst of software, Chinese Acad of Sciences, Beijing, China Corresponding author:Liu, Lieming Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:6 Issue date:Jun 2000 Publication year:2000 Pages:785-790 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Abstract:Shadow generation plays an important role in realistic image synthesis, but with the old algorithms, generation of shadows is quite time-consuming and can't be used in a real-time interactive environment. The authors present a new method to produce the real-time shadows for the point light sources in the paper. The algorithm takes advantage of the fact that in many cases, only a small number of polygons in the complex virtual environment change their shape relative to the lights resulting in a corresponding change to the shadow calculation while most of the polygons remain static relative to the light. So it is possible to process the static and dynamic objects separately and thus make the number of polygons to be calculated as less as possible. The main idea is to preprocess the static scene with &Prime;Tiling&Prime; method and decide the precise shadow-relative sets, and then use SVBSP method to calculate the dynamic shadows. All the algorithms in this paper are realized in C++, and run on the microcomputer platform of Intel Pentium II 400. The experimental results are satisfactory. Number of references:9 Main heading:Computer graphics Controlled terms:Algorithms - Image processing - Light sources - Microcomputers - Object recognition - Real time systems - Three dimensional - Virtual reality Uncontrolled terms:Image synthesis - Point light sources - Polygons - Real time interactive environment - Realistic graphics - Shadow generation - Shadow volume BSP tree - Tiling method Classification code:716 Telecommunication; Radar, Radio and Television - 722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 741 Light, Optics and Optical Devices - 921 Mathematics Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 26> Accession number:2001015500615 Title:Research and realization of OLAP technology under web environment Authors:Huang, Ruobo (0); Zuo, Chun (0); Sun, Yufang (0) Corr. author affiliation:Inst of Software, Chinese Acad of Sciences, Beijing, China Source title:Jisuanji Gongcheng/Computer Engineering Abbreviated source title:Jisuanji Gongcheng Volume:26 Issue:10 Issue date:Oct 2000 Publication year:2000 Pages:7-8, 80 Language:Chinese ISSN:10003428 CODEN:JISGEV Document type:Journal article (JA) Publisher:Shanghai Comp Soc, China Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 27> Accession number:2001185572653 Title:Role hierarchy model for role-based access control and its application Authors:Zhong, Hua (1); Feng, Yulin (1); Jiang, Hongan (1) Author affiliation:(1) Inst of Software, Chinese Acad of Sciences, Beijing, China Corresponding author:Zhong, Hua Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:6 Issue date:Jun 2000 Publication year:2000 Pages:779-784 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Abstract:One of the most challenging problems in managing large computer software systems on global network is the complexity of security administration. The RBAC (role-based access control) method shows powerful capability on access control by realizing logical separation between users and permissions and constructing role hierarchies. This paper presents a role hierarchy model EHRBAC (extended hierarchy role-based access control) based on RBAC96, which defines common permissions and private permissions and imports normal inheritance and extended inheritance. Based on EHRBAC, the authors realize the security administration for the Petrochemical Market Information System. The EHRBAC model can specify the complex inheritance of roles and simplify their hierarchies. It minimizes the role access permissions by the separation of private permissions from common permissions. Number of references:5 Main heading:Security of data Controlled terms:Computer software - Database systems - Hierarchical systems - Logic design - Management - Mathematical models - Wide area networks Uncontrolled terms:Global networks - Hierarchy models - Inheritance - Large computer software systems - Permissions - Petrochemical market information systems - Role based access control - Security administration Classification code:721.2 Logic Elements - 722.3 Data Communication, Equipment and Techniques - 723.2 Data Processing and Image Processing - 723.3 Database Systems - 723.5 Computer Applications - 912.2 Management Treatment:Applications (APP); Management aspects (MAN); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 28> Accession number:2001085472598 Title:Dynamic evaluation approach for virtual conflict decision training Authors:Zhuge, Hai (1); Shi, Xiaoqing (1) Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China; (2) Department of Systems Ecology, Center of Eco-Environment Science, Chinese Academy of Sciences, Beijing, China Corresponding author:Zhuge, Hai Source title:IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews Abbreviated source title:IEEE Trans Syst Man Cybern Pt C Appl Rev Volume:30 Issue:3 Issue date:Aug 2000 Publication year:2000 Pages:374-380 Language:English ISSN:10946977 CODEN:ITCRFH Document type:Journal article (JA) Publisher:IEEE, Piscataway, NJ, United States Abstract:Conflict decision is a continuous decision process in a dynamic conflict environment. The evaluation of the dynamic conflict situation is the basis of making proper decisions at different stages of the conflict process. Traditional evaluation approaches are static and do not consider enough impact factors in real conflict environment, so could not reflect the real conflict situation and its evolution. This paper presents a dynamic evaluation framework for supporting continuous decisions in dynamic conflict environments. The framework includes the timed evaluation models for conflict force, conflict situation, and psychological pressure, as well as a graphical trend analysis approach. The framework has been applied to a virtual military conflict decision training system. A set of dynamic curves is used to intuitively reflect the dynamic evaluation result. Decision makers can know the current conflict situation and its evolution process through these dynamic curves at any stage of the conflict process so can make more evidential decisions. Number of references:16 Main heading:Decision support systems Controlled terms:Decision making - Evaluation - Graph theory - Military applications - Personnel training - Virtual reality Uncontrolled terms:Conflict decision - Dynamic evaluation - Group decision training - Virtual conflict decision training - Virtual military conflict decision training system Classification code:404.1 Military Engineering - 723.1 Computer Programming - 723.5 Computer Applications - 912.2 Management - 912.4 Personnel - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Applications (APP) DOI:10.1109/5326.885119 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 29> Accession number:2000365261006 Title:Conflict decision training through multi-space co-operation Authors:Zhuge, Hai (1) Author affiliation:(1) Laboratory of Computer Science, Inst. Software, Chinese Acad. Sci., Beijing, China Corresponding author:Zhuge, Hai Source title:Decision Support Systems Abbreviated source title:Decis Support Syst Volume:29 Issue:2 Issue date:August 2000 Publication year:2000 Pages:111-123 Language:English ISSN:01679236 CODEN:DSSYDK Document type:Journal article (JA) Publisher:Elsevier Science Publishers B.V., Amsterdam, Netherlands Abstract:Conflict group decision training has three key characteristics: dynamic situation, continuous decision, and cognitive co-operation. Previous models and systems do not entirely reflect these characteristics. This paper proposes a cognitive-based conflict group decision training framework. The conceptual model of the framework reflects the cognitive process and behaviour co-ordination among cognitive space, method space, information space, and resource space in a conflict decision process. The computing model of the framework formalizes the conceptual model as an automata-based formalism, which is supported by a cognitive co-operation implementation mechanism and a dynamic conflict situation evaluation approach. A conflict group decision training environment ACTOR implements the framework. Decision makers can be trained in the environment that supports dynamic situation, continuous decision, and cognitive co-operation. An example shows the training process of using the environment. Number of references:24 Main heading:Decision support systems Controlled terms:Automata theory - Cognitive systems - Computer systems programming - Learning systems - Mathematical models Uncontrolled terms:Cognitive cooperation - Conflict group decision training 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 - 912.2 Management - 921 Mathematics Treatment:Theoretical (THR) DOI:10.1016/S0167-9236(00)00064-6 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 30> Accession number:2001386650871 Title:New method for deciding whether a point is in a polygon or a polyhedron Authors:Wang, W.C. (1); Wu, E.H. (1) Author affiliation:(1) Lab. of Comput. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wang, W.C. (whn@ios.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:12 Issue date:December 2000 Publication year:2000 Pages:1614-1619 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:A new method is presented to decide whether a point is in a polygon or a polyhedron. By taking a preprocessing to organize facets of polyhedrons and edges of polygons in to layers, it employs the binary searching algorithm to perform tests instead of handling all facets and edges. Experimental results show that the method is simple, robust, and easy to use. Number of references:5 Main heading:Computer graphics Controlled terms:Algorithms Uncontrolled terms:Binary searching algorithm - Inclusion test - Point - Polygon - Polyhedron - Preprocessing Classification code:723.5 Computer Applications Treatment:Applications (APP); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 31> Accession number:2001035426399 Title:Design and implementation of Java just-in-time compiler Authors:Ding, Yuxin (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Ding, Yuxin Source title:Journal of Computer Science and Technology Abbreviated source title:J Comput Sci Technol Volume:15 Issue:6 Issue date:Nov 2000 Publication year:2000 Pages:584-590 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc, New York, NY, United States Abstract:Early Java implementations relied on interpretation, leading to poor performance compared to compiled programs. Java just-in-time (JIT) compiler can compile Java programs at runtime, so it not only improves Java's performance prominently, but also preserves Java's portability. In this paper the design and implementing techniques of Java JIT compiler based on Chinese open system are discussed in detail. To enhance the portability, a translating method which combines the static simulating method and macro expansion method is adopted. The optimization technique for JIT compiler is also discussed and a way to evaluate the hotspots in Java programs is presented. Experiments have been conducted to verify JIT compilation technique as an efficient way to accelerate Java. Number of references:6 Main heading:Java programming language Controlled terms:Computer software portability - Open systems - Program compilers - Virtual reality Uncontrolled terms:Jist-in-time (JIT) compilers Classification code:722 Computer Systems and Equipment - 723 Computer Software, Data Handling and Applications - 723.1 Computer Programming - 723.1.1 Computer Programming Languages Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 32> Accession number:2000045125975 Title:Characterization of the difference distribution table of orthogonal system Authors:Feng, Dengguo (0) Corr. author affiliation:Inst of Software, Chinese Acad of Sciences, Beijing, China Source title:Dianzi Kexue Xuekan/Journal of Electronics Abbreviated source title:Dianzi Kexue Volume:22 Issue:1 Issue date:Jan 2000 Publication year:2000 Pages:160-161 Language:Chinese ISSN:0258798X CODEN:DKXUEC Document type:Journal article (JA) Publisher:Sci Press Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 33> Accession number:2000045125213 Title:Local optimization algorithms for symbolic transition graphs with assignment Authors:Fang, Hai (0); Xu, Wen (0); Lin, Huimin (0) Corr. author affiliation:Inst of Software, Chinese Acad of Sciences, Beijing, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:37 Issue:1 Issue date:Jan 2000 Publication year:2000 Pages:95-101 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Sci Press Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 34> Accession number:2000095313984 Title:Analysis of formal models and methods on mobile computing Authors:Wei, Jun (0); Feng, Yulin (0) Corr. author affiliation:Inst of Software, Chinese Acad of Sciences, Beijing, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:37 Issue:2 Issue date:Feb 2000 Publication year:2000 Pages:129-139 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Sci Press Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 35> Accession number:2003157433846 Title:Distributed model of intrusion detection system based on agent Authors:Ma, Heng-Tai (1); Jiang, Jian-Chun (1); Chen, Wei-Feng (1); Qing, Si-Han (1) Author affiliation:(1) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Eng. Res. Center for Info. Securtiy, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Ma, H.-T. (mht@ercist.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:10 Issue date:October 2000 Publication year:2000 Pages:1312-1319 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:The framework model proposed in this paper is a real time intrusion detection system based on agent, which provides an interface for intrusion detection components. Such interface can be used to detect intrusion behaviors based on both network and hosts. According to the different system or network usage patterns and environment diversity, a set of various agents will be created which cooperate to detect the anomalous aspects. The proposed model is an open system, which has good scalability. It is easy to add new cooperating hosts and agents and to expand new intrusion patterns. Agents work in a concurrent way without any central controlling module. The cooperation among Agents is implemented just by communication. Agents are independent but are capable of communicating with each other when they take their actions. The state-checking and policy of authentication mechanism ensure the security of the agents themselves and the communication among them. This model is independent of specific application environment, thus providing a general-purpose framework for intrusion detection systems. Number of references:7 Main heading:Security of data Controlled terms:Agents - Computer networks - Concurrency control - Distributed computer systems - Interfaces (computer) - Internet - Mathematical models - Telecommunication Uncontrolled terms:Authentication polity - Framework models - Intrusion detection - Real time intrusion - State checking Classification code:716 Telecommunication; Radar, Radio and Television - 722 Computer Systems and Equipment - 723.2 Data Processing and Image Processing - 723.5 Computer Applications - 731.3 Specific Variables Control - 921 Mathematics Treatment:General review (GEN); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 36> Accession number:2001015500080 Title:Simplified-unsimplified Chinese conversion and word segmentation Authors:Xin, Chunsheng (0); Sun, Yufang (0) Corr. author affiliation:Inst of Software, Chinese Acad of Sciences, Beijing, China Source title:Xiaoxing Weixing Jisuanji Xitong/Mini-Micro Systems Abbreviated source title:Xiaoxing Weixing Jisuanji Xitong Volume:21 Issue:9 Issue date:Sep 2000 Publication year:2000 Pages:982-985 Language:Chinese ISSN:10001220 CODEN:XWJXEH Document type:Journal article (JA) Publisher:Shenyang Inst Comput Technol, China Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 37> Accession number:2001115502639 Title:LoD editing based on progressive mesh Authors:Fei, Guangzheng (1); Wu, Enhua (1) Author affiliation:(1) Inst of Software, Chinese Acad of Sciences, Beijing, China Corresponding author:Fei, Guangzheng Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:23 Issue:9 Issue date:Sep 2000 Publication year:2000 Pages:953-959 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Sci Press Abstract:This paper proposes a novel approach for interactively editing a triangular mesh based on level of detail. By the approach, multiple levels of detail are first generated by using a method of improved progressive mesh to represent the original mesh. Designer then selects a level as an active level and a closed region from this level as an editing area. The idea of this approach in performing an editing operation is to embed the editing area of the active level onto a 2D rectangle and to interpolate each component of the editing information into the rectangle that is then mapped back to the editing area. The editing information at the active level could be automatically propagated onto all the coarser and finer levels. The interaction of the processes described above substantially increases the intuitivity of the editing operation. As a matter of fact, a hierarchical modeling approach is proposed in the paper for the design and implementation of mesh editing systems. Abstract type:(Edited Abstract) Number of references:14 Main heading:Computational geometry Controlled terms:Computer graphics - Hierarchical systems - Interpolation - Models - Three dimensional Uncontrolled terms:B spline interpolation - Harmonic map - Progressive mesh Classification code:723 Computer Software, Data Handling and Applications - 731.1 Control Systems - 921.6 Numerical Methods Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 38> Accession number:2000045125204 Title:New role-based access control model and its implement mechanism Authors:Qiao, Ying (0); Xu, De (0); Dai, Guozhong (0) Corr. author affiliation:Inst of Software, Chinese Acad of Sciences, Beijing, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:37 Issue:1 Issue date:Jan 2000 Publication year:2000 Pages:37-44 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Sci Press Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 39> Accession number:2000095315195 Title:Research of domain specific software architecture in insurance Authors:Xing, Li (0); Zuo, Chun (0); Sun, Yufang (0) Corr. author affiliation:Inst of Software, Chinese Acad of Sciences, Beijing, China Source title:Jisuanji Gongcheng/Computer Engineering Abbreviated source title:Jisuanji Gongcheng Volume:26 Issue:4 Issue date:Apr 2000 Publication year:2000 Pages:47-49 Language:Chinese ISSN:10003428 CODEN:JISGEV Document type:Journal article (JA) Publisher:Shanghai Comp Soc, China Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 40> Accession number:2003157433843 Title:Truncated differential-linear cryptanalysis Authors:He, Ye-Ping (1); Wu, Wen-Ling (1); Qing, Si-Han (1) Author affiliation:(1) Lab. of Info. Security Inst., Chinese Acad. of Sci., Beijing 100080, China; (2) Eng. Res. Center for Info. Scurity, Chinese Acad. of Sci., Beijing 100080, China; (3) Lab. of Comp. Sci. Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:He, Y.-P. (yphe@ercist.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:10 Issue date:October 2000 Publication year:2000 Pages:1294-1298 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:A truncated differential-linear cryptanalysis method was proposed, which extends differential-linear method. DES (data encryption standard) algorithms of 9-round and 11-round were analyzed. The analysis results show that the method is more convenient and widely applicable. In DES like cipher algorithms, the fact that the order in which S-boxes were placed would affect the security of ciphers was shown by the method. In this way, the truncated differential-linear method gives a criterion for ordering S-boxes optimally. Number of references:5 Main heading:Cryptography Controlled terms:Differential equations - Linear algebra - Security of data Uncontrolled terms:Ciphers - Date encryption standard - Differential analysis - Linear analysis - S boxes - Truncated differential Classification code:716.1 Information Theory and Signal Processing - 723 Computer Software, Data Handling and Applications - 921.2 Calculus Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 41> Accession number:2001185572643 Title:Design and implementation of user level multi-threads in Java virtual machine Authors:Ding, Yuxin (1); Cheng, Hu (1) Author affiliation:(1) Inst of Software, Chinese Acad of Sciences, Beijing, China Corresponding author:Ding, Yuxin Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:5 Issue date:May 2000 Publication year:2000 Pages:701-706 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Abstract:The authors discuss the design and implementation of Java multi-threads. A new thread scheduling algorithm, named Preemptive Round-Robin Scheduling with a Free Queue, is presented. Under this policy threads in the free queue are not assigned with a constant priority. Their priority is the same as the highest-priority threads which are in running state. The highest-priority threads and the threads in the free queue are time-sliced scheduled. This algorithm solves the scheduling problem for independent looping thread. To improve the efficiency of thread synchronization, a new design for object lock is presented. it is called the Mixed Hash Object Lock. This design is a tradeoff between the lock efficiency and its space. The experimental results have proved that the design is feasible. Compared with the traditional design. the efficiency for locking and unlocking is high and the space allocated to lock is small. Number of references:5 Main heading:Java programming language Controlled terms:Design - Efficiency - Scheduling - Synchronization - Virtual reality Uncontrolled terms:Free queue - Independent looping threads - Lock efficiency - Preemptive Round Robin scheduling - Priority - Thread scheduling - Thread synchronization - Time sliced scheduling - User level multithreads - Virtual machines Classification code:723.1 Computer Programming - 731.1 Control Systems - 912.2 Management Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 42> Accession number:2001115502137 Title:Visual architecture description language XYZ/ADL Authors:Luo, Huajun (1); Tang, Zhisong (1); Zheng, Jiandan (1) Author affiliation:(1) Inst of Software, Chinese Acad of Sciences, Beijing, China Corresponding author:Luo, Huajun Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:8 Issue date:Aug 2000 Publication year:2000 Pages:1024-1029 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Acad Sci, China Abstract:A visual language (XYZ/architecture description language) for software architecture description based on XYZ/E is proposed to support a new approach of architecture-based programming. XYZ/ADL is composed of components, connectors and ports, by which it can describe many commonly used kinds of software architectures. Since XYZ/E can represent both static and dynamic semantics in a unified form, XYZ/ADL based on XYZ/E can finish smoothly the transformation between architectures at different abstract levels in a uniform frame. Abstract type:(Edited Abstract) Number of references:10 Main heading:Computer hardware description languages Controlled terms:Computer architecture - Formal languages - Logic programming - Software engineering Uncontrolled terms:Architecture description language - Temporal logic language Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1.1 Computer Programming Languages Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 43> Accession number:2001386651684 Title:Optimal processor grid selection for parallel program independent of load balance Authors:Zhang, Y.Q. (1); Shi, W.S. (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhang, Y.Q. (zyq@mail.rdcps.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:12 Issue date:December 2000 Publication year:2000 Pages:1674-1680 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Physical processors are often viewed as a logical processor grid or process grid to ease the parallel algorithm implementation and to provide useful coordination information among parallel processes. However, the shape of processor grid has great impact on the final performance of user's parallel programs. How to select a suitable or even optimal processor grid for an parallel algorithm on certain parallel machines becomes an urgent problem. In this paper, a novel method named MDCPS (minimum degree of communication point set) is proposed, which tries to find out the optimal processor grid for parallel program independent the impaction of load balance through analysis on its communication pattern. The analysis results on ScaLAPACK parallel Cholesky factorization program match the experimental results well and show that the proposed method can select the optimal processor grid for parallel program successfully. Number of references:8 Main heading:Parallel algorithms Controlled terms:Experiments - Parallel processing systems - Program processors Uncontrolled terms:Communication point - Data distribution - Load balance - Minimum degree of communication point set - Optimal processor grid - Parallel program - Processor grid Classification code:722.4 Digital Computers and Systems - 723.1 Computer Programming Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 44> Accession number:2001115502134 Title:Optimization of function evaluation in formal specification language Authors:Zhang, Ronghua (1); Dong, Yunmei (1) Author affiliation:(1) Inst of Software, Chinese Acad of Sciences, Beijing, China Corresponding author:Zhang, Ronghua Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:8 Issue date:Aug 2000 Publication year:2000 Pages:1003-1008 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Acad Sci, China Abstract:At run-time, some parameter values may cause duplicate function calls which cannot be found at compile-time by traditional optimizer. A run-time optimization method is proposed. It can eliminate the duplicate function calls by creating function call dependency graph. Abstract type:(Edited Abstract) Number of references:6 Main heading:Formal languages Controlled terms:Computational linguistics - Context free languages - Optimization - Program compilers Uncontrolled terms:Functional language - Specification acquisition systems Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1.1 Computer Programming Languages Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 45> Accession number:2000045125203 Title:Stepwise refining method for inferring context-free grammars Authors:Zhang, Ruiling (0); Dong, Yunmei (0) Corr. author affiliation:Inst of Software, Chinese Acad of Sciences, Beijing, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:37 Issue:1 Issue date:Jan 2000 Publication year:2000 Pages:30-36 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Sci Press Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 46> <RECORD 1> Accession number:2000095315528 Title:Exception handling in Java virtual machine Authors:Ding, Yuxin (0); Cheng, Hu (0) Corr. author affiliation:Inst of Software, Chinese Acad of Sciences, Beijing, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:37 Issue:5 Issue date:May 2000 Publication year:2000 Pages:622-626 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Sci Press Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 47> Accession number:2001115501589 Title:Depth estimation and modeling of a tree from a single image Authors:Yan, Tao (1); Chen, Yanyun (1); Wu, Enhua (1) Author affiliation:(1) Inst of Software, Chinese Acad of Sciences, Beijing, China Corresponding author:Yan, Tao Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:23 Issue:4 Issue date:Apr 2000 Publication year:2000 Pages:386-392 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Sci Press Abstract:Recovering 3D shape of an object from one or a series of images is an interesting but challenging problem in computer vision and computer graphics. Single-image based shape recovery techniques, as such shape from shading, need to make a number of assumptions, most of which can hardly be satisfied in a natural scene. This paper presents a new method that recover the 3D shape of branches from a single image. By making use of more stable shading characteristics due to the special structure of trees, it removes most of the restrictions in traditional shape from shading and thus, is robust enough to deal with pictures of nature trees. Furthermore, a method of modeling a tree from its single static image is proposed. In stead of defining branches with mathematical models. it directly extract branches from the image and reconstruct them in 3D space. As a result, the approach is not only independent to the species of the tree, but also capable of producing more realistic models. Number of references:17 Main heading:Image processing Controlled terms:Computer graphics - Computer simulation - Graphic methods Uncontrolled terms:Depth estimation - Shape from shading - Tree modeling Classification code:723.2 Data Processing and Image Processing - 723.2 Data Processing and Image Processing - 723.5 Computer Applications - 902.1 Engineering Graphics - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 48> Accession number:2001115502121 Title:New methodology for user-driven domain-specific application software development Authors:Li, Mingshu (1) Author affiliation:(1) Inst of Software, Chinese Acad of Sciences, Beijing, China Corresponding author:Li, Mingshu Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:11 Issue:7 Issue date:Jul 2000 Publication year:2000 Pages:863-870 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Acad Sci, China Abstract:A new methodology for application software development, named user engineering is proposed. It is a user-driven domain-specific application software development methodology based on component-based software architecture, strengthening driving effect of users in software development, and attempting to make software development process turn into a detailed definition process rather than a coding process only. It provides an effective way to meet increasing application software requirements. Abstract type:(Edited Abstract) Number of references:50 Main heading:Software engineering Controlled terms:Computer architecture - Computer software reusability - Requirements engineering - Structured programming Uncontrolled terms:User engineering - User participation Classification code:723.1 Computer Programming Treatment:General review (GEN) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 49> Accession number:2001115502621 Title:Scalable key distribution system for multilevel security conference Authors:Meng, Yang (1); Liu, Kelong (1); Qing, Sihan (1) Author affiliation:(1) Inst of Software, Chinese Acad of Sciences, Beijing, China Corresponding author:Meng, Yang Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:23 Issue:8 Issue date:Aug 2000 Publication year:2000 Pages:793-798 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Sci Press Abstract:This paper proposes a system for key distribution in hierarchy conference. The sharing key distribution of the system is based on a point-to-point self-certifying protocol. The session key distribution and changes of session key occurred when users join or leave depend on the symmetrical cryptosystem where computing cost is lower. The system is efficient and secure. Abstract type:(Edited Abstract) Number of references:27 Main heading:Cryptography Controlled terms:Computer networks - Data communication systems - Network protocols - Security of data - Teleconferencing Uncontrolled terms:Asymmetric cryptography - Data signature - Key distribution - Multilevel security Classification code:716 Telecommunication; Radar, Radio and Television - 718 Telephone Systems and Related Technologies; Line Communications - 723 Computer Software, Data Handling and Applications Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 50> Accession number:2000245154584 Title:Problem-oriented and rule-based component repository Authors:Zhuge, Hai (1) Author affiliation:(1) Laboratory of Computer Science, Inst. Software, Chinese Acad. S., Beijing, China Corresponding author:Zhuge, Hai Source title:Journal of Systems and Software Abbreviated source title:J Syst Software Volume:50 Issue:3 Issue date:March 15, 2000 Publication year:2000 Pages:201-208 Language:English ISSN:01641212 CODEN:JSSODM Document type:Journal article (JA) Publisher:Elsevier Science Inc, New York, NY, United States Abstract:Repository-based component reuse is an important technique for raising the efficiency of software development. Traditional approaches focus only on repository organization and retrieval techniques. This paper proposes a problem-oriented component reuse framework through incorporating a problem-solving mechanism with the traditional component repository. The framework improves the traditional approaches in two aspects. Firstly, the reuse is promoted from the component level to the problem-solving level. User is encouraged to concentrate on the problem description and solving problem through top-down refinement rather than plunge into the technique details at the beginning. Secondly, the environment evolution during running the candidate components for composing an application is simulated through case-based rule reasoning. The candidate components are dynamically checked before composing an application system. We have designed a model base system for the application in scientific computing field based on the framework. The application and analysis show the approach feasible. Number of references:26 Main heading:Computer software reusability Controlled terms:Computer architecture - Computer simulation - Computer software selection and evaluation - Data structures - Database systems - Decision theory - Knowledge based systems - Mathematical models - Problem solving - Software engineering Uncontrolled terms:Case-based rule reasoning - Repository-based component reuse Classification code:723 Computer Software, Data Handling and Applications - 723.1 Computer Programming - 723.2 Data Processing and Image Processing - 723.4.1 Expert Systems - 723.5 Computer Applications - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) DOI:10.1016/S0164-1212(99)00097-7 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 51> Accession number:2000295202637 Title:Completeness of neighbourhood logic Authors:Barua, Rana (1); Roy, Suman (2); Chaochen, Zhou (3) Author affiliation:(1) Div. of Theor. Stat. and Mathematics, Indian Statistical Institute, 203 B.T. Road, Calcutta 700 035, India; (2) Dept. of Comp. Sci. and Automation, Indian Institute of Science, Bangalore 560 012, India; (3) Intl. Inst. for Software Technology, United Nations University, P.O. Box 3057, Macau, China; (4) UNU/IIST; (5) Software Institute, Chinese Academy of Sciences Corresponding author:Barua, Rana Source title:Journal of Logic and Computation Abbreviated source title:J Logic Comput Volume:10 Issue:2 Issue date:April 2000 Publication year:2000 Pages:271-295 Language:English ISSN:0955792X CODEN:JLCOEU Document type:Journal article (JA) Publisher:Oxford Univ Press, Oxford, United Kingdom Abstract:This paper presents a completeness result for a first-order interval temporal logic, called Neighbourhood Logic (NL) which has two neighbourhood modalities. NL can support the specification of liveness and fairness properties of computing systems as well as formalization of many concepts of real analysis. The two neighbourhood modalities are also adequate in the sense that they can derive other important unary and binary modalities of interval temporal logic. We prove the completeness result for NL by giving a Kripke model semantics and then mapping the Kripke models to the interval models for NL. Number of references:24 Main heading:Formal logic Controlled terms:Artificial intelligence - Computational methods - Computer programming languages - Real time systems - Set theory - Theorem proving Uncontrolled terms:First order interval logic - Kripke models - Modal logic - Neighbourhood logic Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722.4 Digital Computers and Systems - 723.1.1 Computer Programming Languages - 723.4 Artificial Intelligence - 921.1 Algebra - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 52> Accession number:2001115501594 Title:Information system design based on the dictionary database Authors:Guo, Shenghui (1); Sun, Yufang (1) Author affiliation:(1) Software Research Inst, Chinese Acad of Sciences, Beijing, China Corresponding author:Guo, Shenghui Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:23 Issue:4 Issue date:Apr 2000 Publication year:2000 Pages:414-418 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Sci Press Abstract:Based on the practice for the insurance business integrated MIS application software development project, the paper presents the database dictionary managements techniques with data-driven and the build-up of the dictionary data-base, and the MIS design techniques with some universal tools by data-driven. Finally, the paper studies the MIS common object-oriented programming model, and gives an instance for the common interface generation. Abstract type:(Edited Abstract) Number of references:2 Main heading:Database systems Controlled terms:Data processing - Information management - Management information systems - Object oriented programming Uncontrolled terms:Data dictionary - Data driven - Dictionary database Classification code:723.1 Computer Programming - 723.2 Data Processing and Image Processing - 723.3 Database Systems - 903.2 Information Dissemination - 912.2 Management Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 53> Accession number:2005169053816 Title:Minimization and error estimates for a class of the nonlinear Schr&#246;dinger eigenvalue problems Authors:Jiang, Murong (1); Sun, Jiachang (1) Author affiliation:(1) Institute of Software, Academia Sinica, Beijing 100080, China; (2) Department of Mathematics, Yunnan University, Kunming 650091, China Corresponding author:Jiang, M. (jiang@mail.rdcps.ac.cn) Source title:Communications in Nonlinear Science and Numerical Simulation Abbreviated source title:Comm. Nonlinear Sci. Numer. Simul. Volume:5 Issue:2 Issue date:2000 Publication year:2000 Pages:80-83 Language:English ISSN:10075704 Document type:Journal article (JA) Publisher:Elsevier Abstract:It is shown that the nonlinear eigenvalue problem can be transformed into a constrained functional problem. The corresponding minimal function is a weak solution of this nonlinear problem. In this paper, one type of the energy functional for a class of the nonlinear Schro&die;dinger eigenvalue problems is proposed, the existence of the minimizing solution is proved and the error estimate is given out. Number of references:4 Main heading:Problem solving Controlled terms:Constraint theory - Eigenvalues and eigenfunctions - Error analysis - Estimation Uncontrolled terms:Energy functionals - Error estimates - Nonlinear problems Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 921 Mathematics - 921.1 Algebra - 921.6 Numerical Methods Treatment:Theoretical (THR) DOI:10.1016/S1007-5704(00)90006-6 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. EI 2001 <RECORD 1> Accession number:2001366637840 Title:Research and implementation of interactive 3D architecture Authors:Lei, C. (0); Dai, G.-Z. (0) Corr. author affiliation:Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:38 Issue:5 Publication year:2001 Pages:557-562 Language:Chinese, English ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Science Press Abstract:A hierarchical model is presented based on current human-computer interaction and 3D interaction especially. The basic behaviors are analysed and an event model independent of devices is constructed. The event model embodies the ways in which the origin structures form the basic events and the basic events form the composite events to describe the more complicate semantic. Based on the general interaction model, the eight tasks on which any complicate task can be represented in 3D interaction are described and implemented in Easy3D, the prototype system. Number of references:6 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 2> Accession number:2002196945316 Title:Security limits of the LHL threshold group signature scheme Authors:Wang, Gui-Lin (1); Wang, Ming-Sheng (1); Ji, Qing-Guang (1); Qing, Si-Han (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wang, G.-L. Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:24 Issue:9 Issue date:September 2001 Publication year:2001 Pages:897-902 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:We point out two security limits of LHL threshold group signature scheme: the existence of signature forgery attack and the failure to possess anonymity and traceability at the same time. In the forgery attack, after the group secret key is controlled, part of members can forge a valid threshold group signature which looks like a signature produced by other members. But all the honest members can not discover this cheating behavior, because they can use the system normally to generate group signatures. Abstract type:(Edited Abstract) Number of references:13 Main heading:Electronic document identification systems Controlled terms:Cryptography - Security of data - Threshold logic Uncontrolled terms:Anonymity - Forgery attack - Security limits - Threshold group signature scheme - Traceability 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); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 3> Accession number:2001376642212 Title:Communication cost of cognitive co-operation for distributed team development Authors:Zhuge, Hai (1); Shi, Xiaoqing (3) Author affiliation:(1) Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, China; (2) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (3) Department of Systems Ecology, Centre of Eco-Environment Science, Chinese Academy of Sciences, Beijing, China Corresponding author:Zhuge, H. (haizhuge@) Source title:Journal of Systems and Software Abbreviated source title:J Syst Software Volume:57 Issue:3 Issue date:July 15, 2001 Publication year:2001 Pages:227-233 Language:English ISSN:01641212 CODEN:JSSODM Document type:Journal article (JA) Publisher:Elsevier Inc. Abstract:Current team development approaches only focus on work co-operation and resource sharing. Cognitive co-operation has not been paid enough attention, while it becomes more important than ever when the development team is geographically distributed. This paper identifies five types of Internet-based communication approaches for cognitive co-operation among distributed team members: the email-based approach; the blackboard-centred approach; the pure flow-based approach; the combination between the flow-based approach and the email-based approach; and the combination between the flow-based approach and the blackboard-centred approach. The communication costs of these approaches are defined and compared based on a set of assumptions. These comparisons provide the development teams or the designers of team wares the evidence and the method for choosing a suitable cognitive co-operation approach. &copy; 2001 Elsevier Science Inc. All rights reserved. Number of references:13 Main heading:Software engineering Controlled terms:Bulletin boards - Cognitive systems - Electronic communities - Electronic mail Uncontrolled terms:Cognitive cooperation - Communication cost - Team development Classification code:716 Telecommunication; Radar, Radio and Television - 723.1 Computer Programming - 723.4 Artificial Intelligence - 723.5 Computer Applications Treatment:Theoretical (THR) DOI:10.1016/S0164-1212(01)00015-2 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 4> Accession number:2001246542897 Title:Software engineering technology for the 21<sup>st</sup> century Authors:Hu, C. (0) Corr. author affiliation:Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Source title:Wuhan University Journal of Natural Sciences Abbreviated source title:Wuhan Univ J Nat Sci Volume:6 Issue:1-2 Issue date:March 2991 Publication year:2001 Pages:152-158 Language:English ISSN:10071202 CODEN:WHTHAZ Document type:Journal article (JA) Publisher:Wuhan University Abstract:In this paper we will discuss the software engineering technology for the 21<sup>st</sup> century. First we review development over the last half-century, overview application requirement and environment, accept a challenge. Then we outline following software engineering techniques: 1) Process; 2) Analysis; 3) Design; 4) UML; 5) Component; 6) Java + XML; 7) Integrated; 8) Quality (ISO9000 and CMM). Number of references:20 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 5> Accession number:2002036826691 Title:Formalization of the conditional entropy in rough set theory Authors:Sui, Y.F. (1); Wang, J. (1); Jiang, Y.C. (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Sui, Y.F. (syf@ox.ios.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:SUPPL. Issue date:June 2001 Publication year:2001 Pages:23-25 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:It is proved that under certain circumstances, the conditional entropy in rough set theory, given by Duntsch and Gediga, has a connection with roughness of the rough set, which gives a refutation to the claim by Wong, et al. in 1985 and rebuild a similar claim. Number of references:5 Main heading:Rough set theory Controlled terms:Entropy - Formal logic - Information theory - Mathematical models - Theorem proving Uncontrolled terms:Conditional entropy - Formalization - Information entropy - Roughness Classification code:716.1 Information Theory and Signal Processing - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.4 Artificial Intelligence - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 6> Accession number:2001396659462 Title:Group consistency and application in the hall for workshop Authors:Wang, D. (0); Dai, R. (0) Corr. author affiliation:Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Source title:Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics Abbreviated source title:Xi Tong Cheng Yu Dian Zi Ji Shu/Syst Eng Electron Volume:23 Issue:7 Issue date:July 2001 Publication year:2001 Pages:33-37 Language:Chinese ISSN:1001506X CODEN:XGYDEM Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Group consistency algorithms are propounded in this paper. After some candidate plans are obtained by expert group discussion, the consistency of expert group though can be achieved gradually by group consistency algorithms. Finally, the unanimity of the group can be reached, with each plan's rank and decision result. During the above procedure, the function of the chairperson is important, who conducts the expert group to obtain consistency, and enhances efficiency of group decision. Macro - Economic metasynthetic approach are propounded in this paper. In the hall for workshop of metasynthetic engineering the group consistency algorithms are used to solve the convergence of group thought. Number of references:9 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 7> Accession number:2001236531078 Title:B-splines on 3-D tetrahedron partition in four-directional mesh Authors:Sun, J. (0); Shi, X. (0) Corr. author affiliation:Parallel Comp. Div., Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Source title:Science in China, Series A: Mathematics, Physics, Astronomy Abbreviated source title:Sci China Ser A Volume:44 Issue:4 Issue date:April 2001 Publication year:2001 Pages:491-496 Language:English ISSN:10069283 CODEN:SCAAFF Document type:Journal article (JA) Publisher:Science in China Press Abstract:It is more difficult to construct 3-D splines than in 2-D case. Some results in the three directional meshes of bivariate case have been extended to 3-D case and corresponding tetrahedron partition has been constructed. The support of related B-splines and their recurrent formulas on integration and differentiation-difference are obtained. The results of this paper can be extended into higher dimension spaces, and can be also used in wavelet analysis, because of the relationship between spline and wavelets. Number of references:13 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 8> Accession number:2001296583102 Title:Design and implementation of navigation system based on GIS component MapX Authors:Li, Y.-G. (0); Dai, G.-Z. (0) Corr. author affiliation: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:13 Issue:5 Issue date:May 2001 Publication year:2001 Pages:430-433 Language:Chinese ISSN:10039775 CODEN:JFTXFX Document type:Journal article (JA) Publisher:Institute of Computing Technology Abstract:GIS components that provide specific services allow application developers to assemble them quickly to make their own business systems. Air-borne navigation system can help pilots make decision correctly, reduce flight risk, and make flight a pleasure. Surface analysis is the key of air-borne navigation system, in this paper, seed-based area expansion algorithm is proposed to speed up surface analysis. Number of references:8 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 9> Accession number:2001286575391 Title:Two online algorithms for the ambulance systems Authors:Sui, Y. (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Sui, Y. (syf@ios.ac.cn) Source title:Journal of Computer Science and Technology Abbreviated source title:J Comput Sci Technol Volume:16 Issue:2 Issue date:March 2001 Publication year:2001 Pages:176-181 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:An ambulance system consists of a collection S = {(s<inf>1</inf>,...,s<inf>m</inf>}) of emergency centers in a metric space M. Each emergency center s<inf>i</inf> has a positive integral capacity c<inf>i</inf> to denote, for example, the number of ambulances at the center. There are n = &Sigma;<inf>i=1</inf><sup>m</sup> c<inf>i</inf> patients requiring ambulances at different times t<inf>j</inf> and every patient is associated with a number b<inf>j</inf>, the longest time during which the patient can wait for ambulance. An online algorithm A will decide which emergency center sends an ambulance to serve a request for ambulance from a patient at some time. If algorithm A sends an ambulance in s<inf>i</inf> to serve a patient r<inf>j</inf>, then it must be observed that d<inf>i,j</inf>/v &lt; b<inf>j</inf>, where d<inf>i,j</inf> is the distance between emergency center s<inf>i</inf> and patient r<inf>j</inf>, and v is the velocity of ambulance. A fault of algorithm A is such that to a request for ambulance at some time t<inf>j</inf> with j &le n, for every i with d<inf>i,j</inf>/v &lt; b<inf>j</inf>, there is no ambulance available in s<inf>i</inf>. The cost of an algorithm A is the number of faults A makes. This paper gives two algorithms B and C, where B is the local greedy algorithm and C is a variant of balancing costs, and proves that both B and C have no bounded competitive ratios. Moreover, given any sequence &sigma; of requests for ambulances without optimal faults, the cost of C on &sigma; is less than or equal to [n/3] and that of B is less than or equal to [n/2]. Number of references:5 Main heading:Online systems Controlled terms:Algorithms - Ambulances - Computational complexity - Internet - Servers Uncontrolled terms:Online algorithms Classification code:462.1 Biomedical Equipment, General - 662.1 Automobiles - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 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 10> Accession number:2003137409454 Title:Implementation of audit in secure operating system based on CC Authors:Zhang, Xiangfeng (1); Sun, Yufang (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Post Code 100080 Beijing, China Corresponding author:Zhang, X. Source title:Proceedings of the Sixth International Conference for You Computer Scientist: in Computer Science and Technology in New Century Abbreviated source title:Proc. 6th Intern. Conf. for Young Comp. Sc.: In Comp. Sc. Techn. in New Century Issue date:2001 Publication year:2001 Pages:198-201 Language:English ISBN-10:7506251817 ISBN-13:9787506251815 Document type:Conference article (CA) Conference name:Proceedings of the Sixth International Conference for Young Computer Scientist: In Computer Science and Technology in New Century Conference date:October 23, 2001 - October 25, 2001 Conference location:Hangzhou, P.R., China Conference code:60508 Sponsor:China Computer Federation; Zheijang University; The 2001 West Lake Exposition Publisher:International Academic Publishers Abstract:It is very important for a secure operating system to detect potential attack and security breach. The audit subsystem of a computing system can collect many kinds of events in the system and can hence help to decide if a user ever tried to violate the security policies enforced in the system and therefor make users be accountable for their actions. Many secure operating systems implement audit subsystem in their own way. The common criteria for IT security evaluation (CC) provides the functional requirements for audit in its part 2. In this paper we suggest some methods to meet these requirements. Some of the methods have been used in our secure Linux system. Number of references:7 Main heading:Security of data Controlled terms:Computer operating systems - Computer systems - Information technology Uncontrolled terms:Security policies Classification code:722 Computer Systems and Equipment - 723.5 Computer Applications - 903 Information Science Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 11> Accession number:2002206947148 Title:New decision procedures and polynomial hierarchy for the theory of real addition with order Authors:Xue, Rui (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Xue, R. Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:7 Issue date:July 2001 Publication year:2001 Pages:1088-1093 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:A quantifier elimination method for positive real theory with order by Volker Weispfenning is extended to a decision procedure, from which a new and finer decision method for eliminentary theory of real addition with order is given. It is proved that its subclasses of fixed number of quantifiers is in corresponding polynomial hierarchy. The result is essentially an extension of the claim on positive real theory by N. Megiddo to the whole real theory, which is relatively simply induced, and comparably better than the similar result by E.D. Sontag. Number of references:10 Main heading:Formal logic Controlled terms:Computational complexity - Polynomials Uncontrolled terms:Decision procedure - Polynomial hierarchy - Positive real theory - Quantifier - Real addition Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 921.1 Algebra Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 12> Accession number:2004488689961 Title:A constraint solver and its application to path feasibility analysis Authors:Zhang, Jian (1); Wang, Xiaoxu (1) Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Zhang, J. Source title:International Journal of Software Engineering and Knowledge Engineering Abbreviated source title:Int. J. Software Engineer. Knowledge Engineer. Volume:11 Issue:2 Issue date:April 2001 Publication year:2001 Pages:139-156 Language:English ISSN:02181940 CODEN:ISEKEW Document type:Journal article (JA) Publisher:World Scientific Publishing Co. Pte Ltd Abstract:Many testing methods are based on program paths. A well-known problem with them is that some paths are infeasible. To decide the feasibility of paths, we may solve a set of constraints. In this paper, we describe constraint-based tools that can be used for this purpose. They accept constraints expressed in a natural form, which may involve variables of different types such as integers, Booleans, reals and fixed-size arrays. The constraint solver is an extension of a Boolean satisfiability checker and it makes use of a linear programming package. The solving algorithm is described, and examples are given to illustrate the use of the tools. For many paths in the testing literature, their feasibility can be decided in a reasonable amount of time. Number of references:27 Main heading:Constraint theory Controlled terms:Algorithms - Arrays - Boolean algebra - Linear programming - Problem solving - Set theory Uncontrolled terms:Constraint solving - Infeasible paths - Program testing - Test data generation Classification code:921.5 Optimization Techniques - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 921.1 Algebra - 921 Mathematics - 723.1 Computer Programming - 721.2 Logic Elements - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory Treatment:Theoretical (THR) DOI:10.1142/S0218194001000487 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 13> Accession number:2001526778857 Title:Automatic generation of database instances for white-box testing Authors:Zhang, J. (1); Xu, C. (1); Cheung, S.-C. (1) Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Zhang, J. 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:2001 Publication year:2001 Pages:161-165 Language:English ISSN:07303157 CODEN:PSICD2 Document type:Conference article (CA) Conference name:25th Annual International Computer Software and Applications Conference (COMPSAC)2001 Conference date:October 8, 2001 - October 12, 2001 Conference location:Chicago, IL, United states Conference code:58826 Sponsor:IEEE Computer Society Publisher:Institute of Electrical and Electronics Engineers Computer Society Abstract:Testing is a critical activity for database application programs as faults if undetected could lead to unrecoverable data loss. Database application programs typically contain statements written in an imperative programming language with embedded data manipulation commands, such as SQL. However relatively little study has been made in the testing of database application programs. In particular, few testing techniques explicitly consider the inclusion of database instances in the selection of test cases and the generation of test data input. In this paper, we study the generation of database instances that respect the semantics of SQL statements embedded in a database application program. The paper also describes a supporting tool which generates a set of constraints. These constraints collectively represent a property against which the program is tested. Database instances for program testing can be derived by solving the set of constraints using existing constraint solvers. Number of references:10 Main heading:Database systems Controlled terms:Computer programming languages - Constraint theory - Mathematical models - Query languages - Semantics Uncontrolled terms:Software testing - White-box testing Classification code:723.1.1 Computer Programming Languages - 723.3 Database Systems Treatment:Theoretical (THR) DOI:10.1109/CMPSAC.2001.960612 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 14> Accession number:2002126890566 Title:VLSI/PCB placement with predefined coordinate alignment constraint based on sequence pair Authors:Liu, Rui (1); Hong, Xianlong (1); Dong, Sheqin (1); Cai, Yici (1); Gu, Jun (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, China Corresponding author:Liu, R. (liurui@isdn.iscas.ac.cn) Source title:International Conference on ASIC, Proceedings Abbreviated source title:Int Conf ASIC Proc Issue date:2001 Publication year:2001 Pages:167-170 Language:English Document type:Conference article (CA) Conference name:4th International Conference on ASIC Proceedings Conference date:October 23, 2001 - October 25, 2001 Conference location:Shanghai, China Conference code:59052 Sponsor:Chinese Institute of Electronis and IEEE Beijing Section; National Natural Science Foundation of China; Science and Technology Commission of Shanghai Municipality Publisher:Shanghai Kexue Jishu Wenxian Chubanshe Abstract:In the system on a chip, some cells should be placed along a predefined coordinate within a relative small region. This constraints comes from the requirement that the data should be ready on the common bus on the same time. In this paper, we study the module placement problem where some modules have the predefined coordinate alignment (PCA) constraint. We give the relations between constrained modules, from which a necessary condition is induced. We develop a polynomial-time algorithm that can guarantee a feasible placement is always obtainable. Our algorithm is implemented and tested on ami33 and ami49. Its effectiveness is supported by the experimental results. Number of references:9 Main heading:Integrated circuit layout Controlled terms:Algorithms - Computational complexity - Printed circuit boards - Simulated annealing - Theorem proving - VLSI circuits Uncontrolled terms:Polynomial-time algorithm - Predefined coordinate alignment constraint - Sequence pair Classification code:714.2 Semiconductor Devices and Integrated Circuits - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1 Computer Programming - 921.5 Optimization Techniques Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 15> Accession number:2002036826709 Title:WebFrame: A Web application server framework Authors:Qin, F. (1); Zhang, B. (1); Li, J. (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Qin, F. (qfeng@otcaix.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:SUPPL. Issue date:June 2001 Publication year:2001 Pages:152-155 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:As a Web application server framework, WebFrame is designed to improve the availability and security for Web distributed applications, and to solve related problems such as scalability, load balancing, re-connection to database, security and performance etc. We introduce WebFrame architecture and its technological features. Abstract type:(Edited Abstract) Number of references:7 Main heading:World Wide Web Controlled terms:Client server computer systems - Computer architecture - Distributed database systems - Performance - Security of data - Servers Uncontrolled terms:Availability - Database reconnection - Load balancing - Scalability - Templates - Web application servers - Webframe Classification code:716 Telecommunication; Radar, Radio and Television - 722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 16> Accession number:2002176928170 Title:Composition and interactive computation of object systems Authors:Qian, Jun (1); Huang, Tao (1); Feng, Yu-Lin (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Qian, J. (qianjun@.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:9 Issue date:September 2001 Publication year:2001 Pages:1295-1303 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:The computation of object systems is an open and dynamic computing process with concurrent interactions, and the behavior of object systems presents the unification between internal causes and external causes, so that the research of dynamic behavior of object systems should not be separated from the discussion of static construction of object system. This paper aims at the specification of dynamic behaviors and interactions of objects, while a formal model for composite object systems is constructed to consolidate the formal abstraction and conception framework at first. A sorted CCS-like calculus named S/R is built up to clarify the computation process of object systems and to characterize the inherent properties of encapsulation, dynamic binding, interaction and concurrency, etc. It is emphasized that the behavior of each object is restricted by its environment and the behavior of each component object should be consistent with the behavior of its composite object. Abstract type:(Edited Abstract) Number of references:13 Main heading:Object oriented programming Controlled terms:Calculations - Concurrency control - Distributed computer systems - Encapsulation - Formal languages - Interactive computer systems - Mathematical models Uncontrolled terms:Component objects - Composite objects - Conception framework - Formal abstraction - Object systems - S R calculus Classification code:721 Computer Circuits and Logic Elements - 722.4 Digital Computers and Systems - 723.1 Computer Programming - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 17> Accession number:2002447172969 Title:Incompleteness of Bluetooth protocol conformance test cases Authors:Wu, Peng (1); Gao, Qiang (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, No.4 South 4 Street, Zhong Guan Cun, Hai Dian District Beijing 100081, China Corresponding author:Wu, P. (synclinux@) Source title:Proceedings of SPIE - The International Society for Optical Engineering Abbreviated source title:Proc SPIE Int Soc Opt Eng Volume:4586 Issue date:2001 Publication year:2001 Pages:266-273 Language:English ISSN:0277786X CODEN:PSISDG Document type:Conference article (CA) Conference name:Wireless and Mobile Communications Conference date:November 12, 2001 - November 15, 2001 Conference location:Beijing, China Conference code:60075 Sponsor:CSFB; China Telecom; Huawei Technologies (China); SANY; China Ministry of Science and Technologies Publisher:SPIE Abstract:This paper describes a formal method to verify the completeness of conformance testing, in which not only Implementation Under Test (IUT) is formalized in SDL, but also conformance tester is described in SDL so that conformance testing can be performed in simulator provided with CASE tool. The protocol set considered is Bluetooth, an open wireless communication technology. Our research results show that Bluetooth conformance test specification is not complete in that it has only limited coverage and many important capabilities defined in Bluetooth core specification are not tested. We also give a detail report on the missing test cases against Bluetooth core specification, and provide a guide on further test case generation in the future. Number of references:4 Main heading:Network protocols Controlled terms:Computer aided software engineering - Interoperability - Wireless telecommunication systems Uncontrolled terms:Extended finite state machines Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer Software, Data Handling and Applications - 723.1 Computer Programming - 723.5 Computer Applications Treatment:Theoretical (THR) DOI:10.1117/12.445235 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 18> Accession number:2001246542928 Title:A glance at the middleware technology Authors:Cui-Hao, Z. (0) Corr. author affiliation:Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Source title:Wuhan University Journal of Natural Sciences Abbreviated source title:Wuhan Univ J Nat Sci Volume:6 Issue:1-2 Issue date:March 2991 Publication year:2001 Pages:351-354 Language:English ISSN:10071202 CODEN:WHTHAZ Document type:Journal article (JA) Publisher:Wuhan University Abstract:After describing the concept of middleware, this paper discusses the position and value of middle-ware among modern software technologies, summarizes some kinds of common middleware. This paper also gives some proposals for developing middleware in China. Number of references:3 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 19> Accession number:2002186936898 Title:Research for key management in cryptosystem for hierarchy Authors:Meng, Yang (1); Qing, Si-Han (1); Liu, Ke-Long (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Meng, Y. (mengy@ercist.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:8 Issue date:August 2001 Publication year:2001 Pages:1147-1153 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:A key management scheme in cryptosystem for hierarchy is proposed using symmetric cryptography technology, asymmetric cryptography technology, symmetric cryptography combined with asymmetric cryptography technology. At the same time, it's security and efficiency are analyzed. Compared with the exist systems, this scheme adopts tree model, the users of different secure levels contact each other with relation parameters, the system is appropriate for not only the common environments, but also the special environments in which key changes frequently and users change dynamically. Number of references:12 Main heading:Cryptography Controlled terms:Algorithms - Hierarchical systems - Management - Mathematical models - Trees (mathematics) Uncontrolled terms:Asymmetric cryptography - Key management - Relation parameters - Symmetric cryptography Classification code:716.1 Information Theory and Signal Processing - 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 20> Accession number:2001286575389 Title:Pattern matching compilation of functions defined in context-free languages Authors:Chen, H. (1); Dong, Y. (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:Journal of Computer Science and Technology Abbreviated source title:J Comput Sci Technol Volume:16 Issue:2 Issue date:March 2001 Publication year:2001 Pages:159-167 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:LFC is a functional language based on recursive functions defined in context-free languages. In this paper, a new pattern matching algorithm for LFC is presented, which can represent a sequence of patterns as an integer by an encoding method. It is a rather simple method and produces efficient case-expressions for pattern matching definitions of LFC. The algorithm can also be used for other functional languages, but for nested patterns it may become complicated and further studies are needed. Number of references:8 Main heading:Pattern matching Controlled terms:Algorithms - Context free languages - Encoding (symbols) - Integer programming - Recursive functions Uncontrolled terms:Functional languages 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 - 723.5 Computer Applications - 921.5 Optimization Techniques Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 21> Accession number:2003137411764 Title:An object-oriented framework for multilevel transaction recovery Authors:Ding, Ke (1); Jin, Beihong (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Post Code 100080 Beijing, China Corresponding author:Ding, K. Source title:Proceedings of the Sixth International Conference for You Computer Scientist: in Computer Science and Technology in New Century Abbreviated source title:Proc. 6th Intern. Conf. for Young Comp. Sc.: In Comp. Sc. Techn. in New Century Issue date:2001 Publication year:2001 Pages:459-464 Language:English ISBN-10:7506251817 ISBN-13:9787506251815 Document type:Conference article (CA) Conference name:Proceedings of the Sixth International Conference for Young Computer Scientist: In Computer Science and Technology in New Century Conference date:October 23, 2001 - October 25, 2001 Conference location:Hangzhou, P.R., China Conference code:60508 Sponsor:China Computer Federation; Zheijang University; The 2001 West Lake Exposition Publisher:International Academic Publishers Abstract:Transactions play an important role in distributed computing environment. Resource managers need to restore previous states when transactional rollback occurs. It is difficult to develop a new transaction recovery system with traditional software construction method because recovery processing interlaces with log management, concurrency control and storage management. This paper presents ISTM, an object-oriented framework for multilevel transaction recovery. ISTM facilitates construction of transaction recovery system by leveraging a Recoverable Action design pattern to separate transaction recovery from storage management. ISTM has been successfully employed in the implementation of message queuing middleware ISMQ. Number of references:13 Main heading:Object oriented programming Controlled terms:Algorithms - Computer software - Database systems - Distributed computer systems - Queueing networks Uncontrolled terms:Transaction recovery Classification code:722.4 Digital Computers and Systems - 723.1 Computer Programming - 723.3 Database Systems Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 22> Accession number:2001286575393 Title:Leaf movement simulation Authors:Feng, J. (1); Chen, Y. (1); Yan, T. (1); Wu, E. (1) Author affiliation:(1) Computer Science Laboratory, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Feng, J. (jhfeng0175@) Source title:Journal of Computer Science and Technology Abbreviated source title:J Comput Sci Technol Volume:16 Issue:2 Issue date:March 2001 Publication year:2001 Pages:189-192 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:This paper presents a method for the animation of leaf movement. Leaves are classified into two classes: moveable and non-moveable. For moveable leaves, their movements consist of two parts: leafstalk rotation and leaf surface rotation. For each rotation, a movement model was constructed and the movement was computed based on each model, respectively. The final leaf movements were obtained by superposition of these two rotations. The method's principle is simple and easy to use. Number of references:8 Main heading:Animation Controlled terms:Computation theory - Computer simulation - Fast Fourier transforms - Mathematical models Uncontrolled terms:Leaf movement simulation Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.5 Computer Applications - 921.3 Mathematical Transformations Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 23> Accession number:2001486745001 Title:Key management for multilevel security in distributed applications Authors:Qing, S.H. (1); Meng, Y. (1); Liu, K.L. (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Qing, S.H. Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:29 Issue:2 Issue date:February 2001 Publication year:2001 Pages:269-271 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:A key management scheme for multilevel security in distributed applications is presented. The scheme adopts BELL-LaPadula model as multilevel access control policies. We use Chinese Remainder Theorem, introduce the notions of first-secret-key-el-ement, second-secret-keyelement and writing-element, and construct sharing information of session key. The scheme is efficient, secure and dynamic. At the same time, there are many practical applications, involving the scheme for key management such as meeting in the network and talking in the network etc. Number of references:8 Main heading:Security systems Controlled terms:Computer networks - Cryptography - Distributed computer systems - Internet - Management - Mathematical models Uncontrolled terms:BELL-LaPadula models - Key management - Multilevel security systems - Secret key elements - Session keys - Writing elements Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer Software, Data Handling and Applications - 912.2 Management - 914.1 Accidents and Accident Prevention - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 24> <RECORD 1> Accession number:2003137409456 Title:Configuring role-based access control to enforce Chinese wall policy Authors:Zhao, Qingsong (1); Sun, Yufang (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Post Code 100080 Beijing, China Corresponding author:Zhao, Q. Source title:Proceedings of the Sixth International Conference for You Computer Scientist: in Computer Science and Technology in New Century Abbreviated source title:Proc. 6th Intern. Conf. for Young Comp. Sc.: In Comp. Sc. Techn. in New Century Issue date:2001 Publication year:2001 Pages:206-209 Language:English ISBN-10:7506251817 ISBN-13:9787506251815 Document type:Conference article (CA) Conference name:Proceedings of the Sixth International Conference for Young Computer Scientist: In Computer Science and Technology in New Century Conference date:October 23, 2001 - October 25, 2001 Conference location:Hangzhou, P.R., China Conference code:60508 Sponsor:China Computer Federation; Zheijang University; The 2001 West Lake Exposition Publisher:International Academic Publishers Abstract:Role-based access control (RBAC) has recently received considerable attention as a promising alternative to traditional Discretionary Access Control (DAC) and Mandatory Access Control (MAC). In fact, as a policy neutral model, RBAC can be used to implement more policies than discretionary and mandatory access controls in security systems. After introducing RBAC and Chinese Wall policy, we systematically describe how to configure RBAC to enforce Chinese Wall policy in this paper, and proof the configuration. Number of references:9 Main heading:Security of data Controlled terms:Computer simulation - Control system analysis - Database systems - Security systems Uncontrolled terms:Role-based access control (RBAC) Classification code:723.2 Data Processing and Image Processing - 723.3 Database Systems - 723.5 Computer Applications - 731.1 Control Systems - 914.1 Accidents and Accident Prevention Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 25> Accession number:2001516767502 Title:Optimization and implementation of a bisimulation checking algorithm for the &pi;-calculus Authors:Xu, W. (1); Fang, H. (1); Lin, H.M. (1) Author affiliation:(1) Lab. for Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Xu, W. Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:2 Issue date:February 2001 Publication year:2001 Pages:159-166 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Bisimulation is adopted in the &pi;-calculus as the criterion to identify processes. For finite-state processes, bisimulation equivalence is decidable. An optimization technique for a bisimulation checking algorithm is presented. It works by instantiating input names only to those free names which are used in subsequent matches. The technique can significantly reduce the required time and space, as illustrated by several benchmark examples. The correctness of the optimization is also proven. Number of references:8 Main heading:Communication systems Controlled terms:Algebra - Algorithms - Benchmarking - Calculations - Optimization - Process control - Simulation - Topology Uncontrolled terms:Bisimulation check - Calculus - Free names - Istantiating input names - Process algebra Classification code:716 Telecommunication; Radar, Radio and Television - 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 26> Accession number:2002056845617 Title:Model checking value-passing processes Authors:Lin, Huimin (1) Author affiliation:(1) Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, P.O Box 8718, Beijing 10080, China Corresponding author:Lin, H. (lhm@ios.ac.cn) Source title:Proceedings of the Asia-Pacific Software Engineering Conference and International Computer Science Conference, APSEC and ICSC Abbreviated source title:Asia Pacif Software Eng Conf Int Comput Sci Conf APSEC ICSC Issue date:2001 Publication year:2001 Pages:3-10 Language:English Document type:Conference article (CA) Conference name:8th Asia Pacific Software Engineering Conference APSEC'2001 Conference date:December 4, 2001 - December 7, 2001 Conference location:Macao, China Conference code:58962 Sponsor:National Natural Science Foundation of China; Public Administration and Civil Service Bureau of Macau SAR; Companhia de Telecomunicacoes de Macau S.A.R.L.; Macau SAR Government Tourist Office Publisher:Institute of Electrical and Electronics Engineers Computer Society Abstract:An algorithm for model checking value-passing processes is presented. Processes are modeled as symbolic transition graphs with assignments. To specify properties for such processes a graphical predicate mu-calculus is introduced. It allows arbitrary nesting of the least and greatest fixpoints, and contains the propositional mu-calculus as a proper subset. The algorithm instantiates input variables on-the-fly and states are only generated when they are needed for the computation. To handle alternating fixpoints properly, a multi-stack is employed and the controlling strategy is such that a state is evaluated without depending on the default values for more deeply nested states. The algorithm is shown correct with respect to the semantics of the predicate mu-calculus. Its complexity is also analysed. Number of references:13 Main heading:Computer software selection and evaluation Controlled terms:Algorithms - Computational complexity - Computer simulation - Data structures - Formal logic - Network protocols - Semantics Uncontrolled terms:Labelled transition systems - Model checking - Mu calculus - Symbolic transition graphs - Value passing processes - Verification algorithms 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 - 903.2 Information Dissemination Treatment:Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 27> Accession number:2002216953011 Title:Notes on a simple logic for authentication protocol design Authors:Ji, Qing-Guang (1); Feng, Deng-Guo (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Ji, Q.-G. ({qgji,fengdg}@ercist.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:11 Issue date:November 2001 Publication year:2001 Pages:1581-1585 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Buttyan et al. proposed a simple logic and used it to revise Woo-Lam protocol: without proving, they claimed that revised protocol is resistant against the interaction attacks between a protocol and itself. In order to show that their results are incorrect, two different attacks on revised protocol are found out and set out in detail for their implementations. The fashions to construct the two attacks are essentially analogous to the ones described by Debbabi etc. except more complicated than them. The further analysis show that the logic of Buttyan etc. has no enough capacity to sufficiently capture protocol flaws, which stem from interaction of protocol itself. This logic needs to be improved. Abstract type:(Edited Abstract) Number of references:10 Main heading:Network protocols Controlled terms:Formal logic - Modal analysis - Security of data Uncontrolled terms:Authentication - Interaction attacks - Modal logic - Simple logic - Woo Lam protocols Classification code: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 Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 28> Accession number:2001376644757 Title:Hair image generation using connected texels Authors:Zhang, X. (1); Chen, Y. (1); Wu, E. (1) Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Zhang, X. (zxp@) Source title:Journal of Computer Science and Technology Abbreviated source title:J Comput Sci Technol Volume:16 Issue:4 Issue date:July 2001 Publication year:2001 Pages:341-350 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:Generation of photo-realistic images of human hair is a challenging topic in computer graphics. The difficulty in solving the problem in this aspect comes mainly from the extremely large number of hairs and the high complexity of the hair shapes. Regarding to the modeling and rendering of hair-type objects, Kajiya proposed a so-called texel model for producing furry surfaces. However, Kajiya's model could be only used for the generation of short hairs. In this paper, a concise and practical approach is presented to solve the problem of rendering long hairs, and in particular the method of rendering the smooth segmental texels for the generation of long hairs is addressed. Number of references:18 Main heading:Animation Controlled terms:Computer graphics - Image analysis - Mathematical models - Vectors - Visualization Uncontrolled terms:Hair image generation Classification code:723.2 Data Processing and Image Processing - 723.5 Computer Applications - 921.1 Algebra - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 29> Accession number:2004057991346 Title:A constraint solver and its application to path feasibility analysis Authors:Zhang, Jian (0); Wang, Xiaoxu (0) Corr. author affiliation:Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Source title:International Journal of Software Engineering and Knowledge Engineering Abbreviated source title:Int. J. Software Engineer. Knowledge Engineer. Volume:11 Issue:2 Issue date:April 2001 Publication year:2001 Pages:139-156 Language:English ISSN:02181940 CODEN:ISEKEW Document type:Journal article (JA) Publisher:World Scientific Publishing Co. Pte. Ltd Abstract:Many testing methods are based on program paths. A well-known problem with them is that some paths are infeasible. To decide the feasibility of paths, we may solve a set of constraints. In this paper, we describe constraint-based tools that can be used for this purpose. They accept constraints expressed in a natural form, which may involve variables of different types such as integers, Booleans, reals and fixed-size arrays. The constraint solver is an extension of a Boolean satisfiability checker and it makes use of a linear programming package. The solving algorithm is described, and examples are given to illustrate the use of the tools. For many paths in the testing literature, their feasibility can be decided in a reasonable amount of time. Number of references:27 DOI:10.1142/S0218194001000487 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 30> Accession number:2001376644758 Title:The application of the comparable corpora in Chinese-English Cross-Lingual Information Retrieval Authors:Du, L. (1); Zhang, Y. (1); Sun, L. (1); Sun, Y. (1) Author affiliation:(1) Chinese Information R and D Center, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Du, L. (ldu@sonata.iscas.ac.cn) Source title:Journal of Computer Science and Technology Abbreviated source title:J Comput Sci Technol Volume:16 Issue:4 Issue date:July 2001 Publication year:2001 Pages:351-358 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:This paper proposes a novel Chinese-English Cross-Lingual Information Retrieval (CECLIR) model PME, in which bilingual dictionary and comparable corpora are used to translate the query terms. The proximity and mutual information of the term-pairs in the Chinese and English comparable corpora are employed not only to resolve the translation ambiguities but also to perform the query expansion so as to deal with the out-of-vocabulary issues in the CECLIR. The evaluation results show that the query precision of PME algorithm is about 84.4% of the monolingual information retrieval. Number of references:10 Main heading:Information retrieval Controlled terms:Algorithms - Computational complexity - Formal languages - Query languages - Statistical methods - Translation (languages) Uncontrolled terms:Cross-lingual information retrieval - Query expressions Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1.1 Computer Programming Languages - 903.1 Information Sources and Analysis - 903.3 Information Retrieval and Use - 922.2 Mathematical Statistics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 31> Accession number:2001556801545 Title:Volume rendering for irregular grids with culling effectively occluded cells Authors:Sun, W.W. (1); Wu, E.H. (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Sun, W.W. Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:24 Issue:3 Issue date:March 2001 Publication year:2001 Pages:292-295 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:In object-order volume rendering, it is possible that some image area become opaque when some cells are projected. Those cells whose projections are within opaque image area have no contribution to result image. In this paper, an algorithm for culling cells occluded is proposed to accelerate volume rendering for irregular data set. Irregular data set is rendered by incremental slicing. During rendering we use an average opacity buffer by averaging the opacity buffer with a box filter with the size, which equals to the maximum among the distances respectively corresponding to the maximal distance from the gravity of each cell to its vertices, the value of pixel in this average opacity buffer represents the average opacity of all pixels within a neighborhood of the dimensions with the size of box filter. Then, the visibility of each cell can be determined by indexing the value of the gravity projection of the cell in the average opacity buffer. If the value of the gravity projection of a cell in the average opacity buffer equals to 1.0, the cell is fully occluded, accordingly culled, or if partially occluded, accordingly projected. Thus, the amount of data needed to be processed can be reduced and volume rendering is accelerated. Number of references:11 Main heading:Computer graphics Controlled terms:Opacity - Visibility Uncontrolled terms:Box filter - Culling - Incremental slicing - Irregular grids - Occluded cell - Opacity buffer - Projection - Volume rendering Classification code:723.5 Computer Applications - 741.1 Light/Optics - 741.2 Vision Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 32> Accession number:2002036826730 Title:Object-oriented framework for multi-level transaction recovery Authors:Ding, K. (1); Jin, B.H. (1) Author affiliation:(1) Lab. for Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Ding, K. (dingke@otcaix.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:SUPPL. Issue date:June 2001 Publication year:2001 Pages:353-358 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Transaction recovery plays an important role in the distributed transaction processing systems. All resource managers need to restore previous state when transactional rollback occurs. It is difficult to develop a new transaction recovery system, since the recovery process interlaces with log management, concurrency control and storage handler. This paper presents ISTM, an object-oriented framework for multi-level transaction recovery. ISTM facilitates construction of transaction recovery system by leveraging a recoverable action pattern to separate transaction recovery from storage processing. ISTM is successfully employed in the implementation of message queue middleware ISMQ. Abstract type:(Edited Abstract) Number of references:12 Main heading:Distributed computer systems Controlled terms:Computer networks - Computer system recovery - Management - Object oriented programming - Queueing theory - Resource allocation Uncontrolled terms:Message queueing - Middleware - Object oriented framework - Recoverable action pattern - Resource managers - Transaction recovery Classification code:722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 912.2 Management - 922.1 Probability Theory Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 33> Accession number:2001416676267 Title:Efficient 3D image warping for composing novel views Authors:Zheng, X. (1); Wu, E. (1) Author affiliation:(1) Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China Corresponding author:Zheng, X. (zhx@ox.ios.ac.cn) Source title:Proceedings of Computer Graphics International Conference, CGI Abbreviated source title:Proc Comput Graph Int Conf CGI Issue date:2001 Publication year:2001 Pages:123-130 Language:English Document type:Conference article (CA) Conference name:Computer Graphics International 2001 Conference date:June 3, 2001 - July 6, 2001 Conference location:Hong Kong, Japan Conference code:58427 Sponsor:IEEE Publisher:Institute of Electrical and Electronics Engineers Computer Society Abstract:This paper presents an efficient inverse warping algorithm for generating novel views by combining multiple reference images taken from different viewpoints. The method proceeds in three steps. Firstly, the reference images are preprocessed for extracting edge pixels. Secondly, an inverse warping is performed to render the desired image from one primary reference image. By taking advantages of epipolar line features and depth discontinuities in reference images, the inverse warping can be efficiently applied by segments, to accelerate the rendering substantially. Finally, holes in the desired image are filled up through searching the corresponding points in other reference images. At this stage, two accelerating techniques are presented. By using the proposed algorithm we can navigate a virtual environment at interactive rate. Number of references:12 Main heading:Image analysis Controlled terms:Algorithms - Feature extraction - Three dimensional computer graphics - Virtual reality Uncontrolled terms:Image wraping Classification code:723 Computer Software, Data Handling and Applications - 723.2 Data Processing and Image Processing - 723.5 Computer Applications Treatment:Theoretical (THR) DOI:10.1109/CGI.2001.934666 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 34> Accession number:2002447172966 Title:The mobile synchronization solutions in Bluetooth wireless technology Authors:Luo, Hongbo (1); Gao, Qiang (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, No.4 South 4 Street Zhong Guan Cun, Hai Dian District, Beijing 100081, China Corresponding author:Luo, H. (hongboluo@) Source title:Proceedings of SPIE - The International Society for Optical Engineering Abbreviated source title:Proc SPIE Int Soc Opt Eng Volume:4586 Issue date:2001 Publication year:2001 Pages:236-244 Language:English ISSN:0277786X CODEN:PSISDG Document type:Conference article (CA) Conference name:Wireless and Mobile Communications Conference date:November 12, 2001 - November 15, 2001 Conference location:Beijing, China Conference code:60075 Sponsor:CSFB; China Telecom; Huawei Technologies (China); SANY; China Ministry of Science and Technologies Publisher:SPIE Abstract:Bluetooth is presented as a wireless communication protocol. Data synchronization algorithm and the implementing models are analyzed with respect to Bluetooth. The problems of the models are analyzed and the synchronization solution of combining SyncML protocol and Bluetooth is described. Abstract type:(Edited Abstract) Number of references:9 Main heading:Wireless telecommunication systems Controlled terms:Algorithms - Data reduction - Mathematical models - Network protocols - Synchronization Uncontrolled terms:Data synchronization Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer Software, Data Handling and Applications - 723.2 Data Processing and Image Processing - 921 Mathematics Treatment:Theoretical (THR) DOI:10.1117/12.445232 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 35> Accession number:2001286575388 Title:An intuitive formal proof for deadline driven scheduler Authors:Zhan, N. (1) Author affiliation:(1) Lab. of Computer Sci. and Technology, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Zhan, N. (znj@ios.ac.cn) Source title:Journal of Computer Science and Technology Abbreviated source title:J Comput Sci Technol Volume:16 Issue:2 Issue date:March 2001 Publication year:2001 Pages:146-158 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:This paper presents another formal proof for the correctness of the Deadline Driven Scheduler (DDS). This proof is given in terms of Duration Calculus which provides abstraction for random preemption of processor. Compared with other approaches, this proof relies on many intuitive facts. Therefore this proof is more intuitive, while it is still formal. Number of references:6 Main heading:Multitasking Controlled terms:Algorithms - Program processors - Real time systems - Scheduling - Theorem proving Uncontrolled terms:Deadline driven scheduler (DDS) Classification code:722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 723.1 Computer Programming - 912.2 Management Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 36> Accession number:2002056843802 Title:Modeling post-WIMP user interfaces based on hybrid automata Authors:Li, Yang (1); Guan, Zhi-Wei (1); Dai, Guo-Zhong (1) Author affiliation:(1) Intelligent Eng. Lab., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Li, Y. (ly@ind.cims.edu.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:5 Issue date:May 2001 Publication year:2001 Pages:633-644 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Post-WIMP (i.e. Windows, Icons, Menus and Pointer) interface as the next generation user interface has substantial difference from WIMP interface, which has been the dominant paradigm of human-computer interaction for decades. Post-WIMP interface provides more natural and efficient interaction by utilizing the advanced interactive technology, such as virtual reality, voice technology, gesture interaction and so on. However, it is proved to be more difficult to be constructed. In order to build post-WIMP interface effectively, it is a better way to specify the interaction at an abstract level without concerning the details of the implementation before construction. The fundamental attributes of post-WIMP interface are discussed. The most distinguished property of post-WIMP interface is the hybrid interaction, which means the continuous interaction blending with discrete interaction. The post-WIMP interface is analyzed from the point of view of hybrid system, which can give more accurate and strict analysis for post-WIMP interface. Post-WIMP interface can be modeled as a set of cooperating hybrid automata which are special for hybrid system. Hybrid automta are used to model post-WIMP interface. A semi-formal specification language LEAFF is designed based on hybrid automaton for specifying post-WIMP interface by the combination of the text-based specification and graph-based specification, and it can clarify the control and temporal relationships in post-WIMP interface. Two typical instances, object manipulation in virtual reality and pen interaction, are specified by LEAFF. Some issues and the future work are also discussed, such as the specification of parallel issues in post-WIMP interaction, verification of interaction and specification-based interface construction. The modeling technology presented in this paper is useful to the research and development of post-WIMP interface. Number of references:14 Main heading:Human computer interaction Controlled terms:Interfaces (computer) - Virtual reality Uncontrolled terms:Gesture interaction - Hybrid automaton - Hybrid interaction - Language LEAFF - Post WIMP user interface Classification code:722.2 Computer Peripheral Equipment - 723 Computer Software, Data Handling and Applications Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 37> Accession number:2002036826722 Title:XML message service and its security Authors:Jin, G. (1); Li, J. (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Jin, G. (jingge@otcaix.iscas.at.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:SUPPL. Issue date:June 2001 Publication year:2001 Pages:249-254 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:The XML data exchange proposed in the paper adopts message-oriented middleware to guarantee reliability and efficiency for message delivery, and security message channel and encrypted XML message to guarantee the confidentiality, integrity, authenticity and non-repudiation. To experience with these methods and techniques, we design and implement a prototype system XBridge. It provides a kind of solution on secure data exchange platform for enterprise applications. Abstract type:(Edited Abstract) Number of references:9 Main heading:Electronic commerce Controlled terms:Communication channels (information theory) - Cryptography - Data communication systems - Information services - Security of data - Software prototyping - XML Uncontrolled terms:Extensible markup language - Message delivery - Message oriented middlewares - Message services - Prototyping system XBridge - Security channels Classification code:716.1 Information Theory and Signal Processing - 723 Computer Software, Data Handling and Applications - 903.4 Information Services - 911.2 Industrial Economics - 911.4 Marketing Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 38> Accession number:2002136902114 Title:On scheme for dynamic determination of subject's current sensitivity label Authors:Shi, Wen-Chang (1); Liang, Hong-Liang (1); Sun, Yu-Fang (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Shi, W.-C. Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:29 Issue:8 Issue date:August 2001 Publication year:2001 Pages:1046-1049 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Bell and LaPadula (BLP) model is the ground for the implementation of multilevel security (MLS) in secure operating systems. The key spirit of BLP model is to make decision on subject's request to access objects according to subject's current sensitivity label. This paper discusses a scheme for the dynamic determination of subject's current sensitivity label. First, as the basis of further exploration, the BLP model is briefly described. Then, the scheme in question is constructed based on the BLP model. Finally, the qualifying condition for the scheme is presented and its necessity and correctness are demonstrated. Number of references:8 Main heading:Security of data Controlled terms:Computer operating systems - Labels - Mathematical models - Sensitivity analysis Uncontrolled terms:Bell and LaPadula models - Computer security - Multilevel security - Qualifying conditions - Sensitivity labels - Subject request 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 39> Accession number:2001506760594 Title:Power attack of SERPENT and SAFER cipher algorithm Authors:Wu, W.L. (1); Meng, Y. (1); Feng, D.G. (1); Qing, S.H. (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. Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:29 Issue:1 Issue date:January 2001 Publication year:2001 Pages:90-92 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:SERPENT and SAFER and AES candidates, which are analyzed by power attack. It is shown that power attack needs 2<sup>159</sup>, 2<sup>119</sup> and 2<sup>79</sup> trials for 256, 192 and 128 bits key-SERPENT respectively. Although the number of trials is too big to realize, it reduces greatly the size of key. SERPENT have many weak keys for power attack. By analyzing and computing, it is received that SAFER is broken to power attack. Finally, some suggestions and two improving key scheduling of SERPENT are given. Abstract type:(Edited Abstract) Number of references:3 Main heading:Cryptography Controlled terms:Algorithms - Numerical analysis - Scheduling Uncontrolled terms:Key scheduling - Power attack - SAFER algorithms - SERPENT algorithms - Weak keys Classification code: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 40> Accession number:2002206947138 Title:Object sequence diagram based approach for specifying and analyzing component interaction protocols Authors:Wei, Jun (1); Wang, Xu (1); Li, Jing (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wei, J. (wj@otcaix.ios.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:7 Issue date:July 2001 Publication year:2001 Pages:996-1006 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:CBSD(component-based software development) becomes one of the mainstreams of software development paradigms. The essential aspects it concerns are standardization of component models and interoperability of components. Recently it is widely accepted that interactions, as non-functional properties, should be separated from functional components. As a specific part governing the coordination of components, interaction protocols become one of the focuses in CBSD paradigm. Based on OSD(object sequence diagram) notations in UML(unified modeling language), an approach for specification and analysis of component interaction protocols is achieved. In this approach, not only event causality based formalism is defined for specification of interaction protocols, but also some syntactic and dynamic analysis techniques, such as model checking, are provided for verification of OSD specification. Moreover, a framework for development of interaction protocols is sketched out, in which visual modeling and formal analysis features the approach especially. Number of references:27 Main heading:Software engineering Controlled terms:Interoperability Uncontrolled terms:Formal analysis - Interaction - Interaction protocol - Model checking - Object sequence diagram Classification code:723 Computer Software, Data Handling and Applications Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 41> Accession number:2001396665784 Title:Realistic rendering of trees based on environmental features and species Authors:Chen, Y.Y. (1); Yan, T. (1); Zhang, X.P. (1); Wu, E.H. (1) Author affiliation:(1) Lab. of Comput. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Chen, Y.Y. (cyy@ox.ios.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:1 Issue date:January 2001 Publication year:2001 Pages:65-73 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Generation of photo-realistic images of virtual nature scenes is a challenging topic in computer graphics. As a very important part of natural scenery, realistic rendering of trees has attracted much attention. Trees have various types with different shapes and due to their complex structures, realistic modeling, rendering and storage of trees are always a tedious task. To tackle the problem, different rendering strategies are employed according to different types of trees and different scenes. For broadleaf, the z-buffer shadow generation method is used based on primary functions of OpenGL, for conifer, a ray tracing algorithm including texel-rendering technique is used, and for trees in the far distance, volumetric texture mapping is employed in terms of ray tracing and volume rendering technique. The images produced show the feasibility and validity of the proposed rendering techniques. Number of references:20 Main heading:Computer graphics Controlled terms:Algorithms - Drawing (graphics) - Feature extraction - Image processing - Mapping - Mathematical models - Ray tracing - Textures - Trees (mathematics) Uncontrolled terms:Environmental features - Natural scenes - OpenGL - Realistic image synthesis - Rendering - Texels - Volumetric textures - Z buffer shadow generation Classification code:723 Computer Software, Data Handling and Applications - 741 Light, Optics and Optical Devices - 902.1 Engineering Graphics - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 42> Accession number:2001396665783 Title:Specifying and analyzing model for mobile component systems Authors:Wei, J. (1); Zhou, H. (1) Author affiliation:(1) Lab. of Comput. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wei, J. (wj@ios.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:1 Issue date:January 2001 Publication year:2001 Pages:56-64 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Mobile computing is a new computing paradigm. A main feature of this paradigm is dynamically changing the binding between computational components and computational locations, which brings new requirements to the design of distributed systems. An abstract model for mobile component systems is proposed. Not only location, component, mobility and resource access as the basic elements of mobile systems are identified in the abstract model, but modeling mobile systems by basic elements, relationships among elements and relationship changes is also characterized. Based on set theory and operational reduction rules, these elements, relationships and mobility mechanisms are specified in a formal manner. The analysis and formal specifications can be applied to the design basis of mobile systems and their specification languages. Number of references:18 Main heading:Mobile telecommunication systems Controlled terms:Components - Location - Mathematical models - Mobile computing - Set theory Uncontrolled terms:Component relationships - Computational components - Computational locations - Formal models - Mobile component systems - Mobility - Operational reduction rules - Relationship changes - Resource access Classification code:716 Telecommunication; Radar, Radio and Television - 718 Telephone Systems and Related Technologies; Line Communications - 723 Computer Software, Data Handling and Applications - 921 Mathematics Treatment:General review (GEN); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 43> Accession number:2003137409455 Title:Designing and modeling security architecture of a secure operating system Authors:Liang, Hongliang (1); Sun, Yufang (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Postalcode 100080, Beijing, China Corresponding author:Liang, H. Source title:Proceedings of the Sixth International Conference for You Computer Scientist: in Computer Science and Technology in New Century Abbreviated source title:Proc. 6th Intern. Conf. for Young Comp. Sc.: In Comp. Sc. Techn. in New Century Issue date:2001 Publication year:2001 Pages:202-205 Language:English ISBN-10:7506251817 ISBN-13:9787506251815 Document type:Conference article (CA) Conference name:Proceedings of the Sixth International Conference for Young Computer Scientist: In Computer Science and Technology in New Century Conference date:October 23, 2001 - October 25, 2001 Conference location:Hangzhou, P.R., China Conference code:60508 Sponsor:China Computer Federation; Zheijang University; The 2001 West Lake Exposition Publisher:International Academic Publishers Abstract:The design of security architecture of a secure operating system that are difficult to build is a key consideration. In this paper we provide the security architecture and model the security policies of a secure operating system that implements the Bell-LaPadula model and low-water mark Biba model, we also present the access control attributes of system entities and describe how they are used in access control decision. We design the security architecture to support multiply security policies, and model it with the Unified Modeling Language(UML) and the Higher-Order Logic(HOL) techniques. Number of references:13 Main heading:Security of data Controlled terms:Computer architecture - Computer operating systems - Object oriented programming Uncontrolled terms:Security policies Classification code:722 Computer Systems and Equipment - 723.1 Computer Programming - 723.2 Data Processing and Image Processing Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 44> Accession number:2005169053781 Title:Numerical approximation on computing partial sum of nonlinear Schr&#246;dinger eigenvalue problems Authors:Sun, Jiachang (1); Wang, Dingsheng (2); Jiang, Murong (1); Yang, Zhijie (1) Author affiliation:(1) RDCPS, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Institute of Physics, Chinese Academy of Sciences, Beijing 100080, China; (3) Department of Mathematics, Yunnan University, Kunming 650091, China Corresponding author:Sun, J. (sun@mail.rdcps.ac.cn) Source title:Communications in Nonlinear Science and Numerical Simulation Abbreviated source title:Comm. Nonlinear Sci. Numer. Simul. Volume:6 Issue:2 Issue date:2001 Publication year:2001 Pages:74-80 Language:English ISSN:10075704 Document type:Journal article (JA) Publisher:Elsevier Abstract:In computing electronic structure and energy band in the system of multiparticles, quite a large number of problems are to obtain the partial sum of the densities and energies by using "First principle". In the ordinary method, the so-called self-consistency approach, the procedure is limited to a small scale because of its high computing complexity. In this paper, the problem of computing the partial sum for a class of nonlinear Schro&die;dinger eigenvalue equations is changed into the constrained functional minimization. By space decomposition and Rayleigh-Schro&die;dinger method, one approximating formula for the minimal is provided. The numerical experiments show that this formula is more precise and its quantity of computation is smaller. Number of references:5 Main heading:Approximation theory Controlled terms:Computational complexity - Eigenvalues and eigenfunctions - Electronic structure - Nonlinear equations Uncontrolled terms:Energy band - Functional minimization - Multiparticles - Rayleigh-Schro&die;dinger method Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 921.1 Algebra - 921.6 Numerical Methods - 931.1 Mechanics Treatment:Theoretical (THR); Experimental (EXP) DOI:10.1016/S1007-5704(01)90005-X Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 45> <RECORD 1> Accession number:2002126895164 Title:Pecat: A computer-aided translation tool based on bilingual corpora Authors:Sun, Le (1); Zhang, Yibo (1); Zhang, Junlin (1); Sun, Yufang (1) Author affiliation:(1) Chinese Information Process. Ctr., Institute of Software, Chinese Academy of Science, Beijing 100080, China Corresponding author:Sun, L. (lesun@sonata.iscas.ac.cn) Source title:Proceedings of the IEEE International Conference on Systems, Man and Cybernetics Abbreviated source title:Proc IEEE Int Conf Syst Man Cybern Volume:2 Issue date:2001 Publication year:2001 Pages:927-932 Language:English ISSN:08843627 CODEN:PICYE3 Document type:Conference article (CA) Conference name:2001 IEEE International Conference on Systems, Man and Cybernetics Conference date:October 7, 2001 - October 10, 2001 Conference location:Tucson, AZ, United states Conference code:59056 Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:With the widespread use of computer in translation work and daily life, the bilingual corpora become more and more. In this paper the PECAT (Pilot English-Chinese Computer-Aided Translation) system based on bilingual corpora is described. There are mainly three modules in our system: corpus-processing module, matching module and post-edit module. In order to increase the coverage to input source sentence, the text alignment in corpus-processing module is based no chunk level. The matching algorithm of input sentence and source sentence is a three-layer Edit Distance algorithm guided by user, which include the information of word morph and word POS. Preliminary experiments show promising results. Number of references:12 Main heading:Computer aided language translation Controlled terms:Algorithms - Database systems - Knowledge based systems - Natural language processing systems - Speech - Statistical methods Uncontrolled terms:Bilingual corpora - Computer aided translation - Matching algorithm - Text alignment Classification code:723.1 Computer Programming - 723.2 Data Processing and Image Processing - 723.3 Database Systems - 723.4.1 Expert Systems - 723.5 Computer Applications - 751.5 Speech Treatment:Theoretical (THR) DOI:10.1109/ICSMC.2001.973036 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 46> Accession number:2001496752792 Title:Remarks on Gr&#246;bner basis for ideals under composition Authors:Wang, M. (1); Liu, Z. (1) Author affiliation:(1) State Key Lab. of Info. Security, Institute of Software, Chinese Academy of Sciences, P.O. Box 8718, Beijing 100080, China Corresponding author:Wang, M. (wangmsh@ercist.iscas.ac.cn) Source title:Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC Abbreviated source title:Proc Int Symp Symbol Algebraic Comput ISSAC Issue date:2001 Publication year:2001 Pages:237-244 Language:English Document type:Conference article (CA) Conference name:Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation (ISSAC 2001) Conference date:July 22, 2001 - July 25, 2001 Conference location:London, Ont., Canada Conference code:58734 Publisher:Association for Computing Machinery Abstract:Let K[x<inf>1</inf>, ..., x<inf>n</inf>] be a polynomial ring over a field K in variables x<inf>1</inf>, ..., x<inf>n</inf>, and K[y<inf>1</inf>, ..., y<inf>m</inf>] be a polynomial ring over a field K in variables y<inf>1</inf>, ..., y<inf>m</inf>, m &ge; n. Let &Theta; = (&theta;<inf>1</inf>, ..., &theta;<inf>n</inf>) be an ordered n-tuple of non-constant polynomials in K[y<inf>1</inf>, ..., y<inf>m</inf>]. For any finite set F to K[x<inf>1</inf>, ..., x<inf>n</inf>], let F &circ; &Theta; be the set obtained from F by replacing x<inf>i</inf> by &theta;<inf>i</inf>, thus for any F &sube; K[x<inf>1</inf>, ..., x<inf>n</inf>], F &circ; &Theta; &sube; K[y<inf>1</inf>, ..., y<inf>m</inf>]. With the above notations, Hong's main theorem [9] and the main theorem of [6] are generalized to general cases with some new proofs. Number of references:12 Main heading:Polynomials Controlled terms:Boundary conditions - Computational methods - Conformal mapping - Set theory - Theorem proving Uncontrolled terms:Grobner basis - Hong main theorem - Permutation - Polynomial ring Classification code:921.1 Algebra - 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 47> Accession number:2002116885861 Title:Combining multiple reference images in a backward mapping algorithm for novel view generation Authors:Zhang, Xin (1); Wu, En-Hua (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhang, X. (zkx@ios.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:10 Issue date:October 2001 Publication year:2001 Pages:1464-1471 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Based on the backward mapping technique, an efficient image-based rendering algorithm for novel view generation from multiple reference images in a static scene is presented in this paper. It successfully fills the holes in the derived image both occurred when object surfaces are magnified in the novel view and when occluded surfaces become visible. This algorithm is more efficient by the heuristic technique proposed in this paper which gets displacement values used during backward mapping process from single main reference image under the observation that, the shape of space surfaces often changes smoothly. Comparing with the usual forward mapping methods, this algorithm generates derived images with less errors and tackles the problems associated with multiple reference images. Number of references:9 Main heading:Three dimensional computer graphics Controlled terms:Algorithms - Heuristic methods - Image analysis - Mapping - Virtual reality Uncontrolled terms:Backward mapping - Forward mapping - Image based rendering Classification code:723.5 Computer Applications - 902.1 Engineering Graphics - 921 Mathematics Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 48> Accession number:2001376645422 Title:Scheduling railway freight cars Authors:Geng, G. (1); Li, L.X. (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Geng, G. Source title:Knowledge-Based Systems Abbreviated source title:Knowl Based Syst Volume:14 Issue:5-6 Issue date:August 2001 Publication year:2001 Pages:289-297 Language:English ISSN:09507051 CODEN:KNSYET Document type:Journal article (JA) Publisher:Elsevier Abstract:It is difficult to allocate the freight cars and to determine how to load the several varieties of goods into them. In order to improve efficiency, a knowledge-based system (KBS) is developed and integrated into the existing railway information system. This paper introduces the development of the system and the framework in which the KBS are integrated into the existing system environments. Under the framework, the combination of logic programming technology and database technology provides us with a practical way to solve the problems in many existing information systems. Meanwhile, developing the KBS as a distributed application benefits both the organization and users. The existing centralized database management system was maintained, and the security and the control of the database were ensured. Users can obtain the performance of a workstation with the transparency of data location in a user-friendly environment. At last, the implementation of the KBS for railway freight loading is discussed. &copy; 2001 Elsevier Science B.V. All rights reserved. Number of references:21 Main heading:Knowledge based systems Controlled terms:Database systems - Freight cars - Freight transportation - Logic programming - Resource allocation - Security of data Uncontrolled terms:Railway information systems Classification code:912.2 Management - 723.4.1 Expert Systems - 723.3 Database Systems - 723.2 Data Processing and Image Processing - 723.1 Computer Programming - 682.1.1 Railroad Cars - 433 Railroad Transportation Treatment:Theoretical (THR) DOI:10.1016/S0950-7051(01)00108-3 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 49> Accession number:2002016819047 Title:Temporal specification composition techniques for multimedia program design Authors:Zhao, C. (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhao, C. (zc@ios.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:3 Issue date:March 2001 Publication year:2001 Pages:398-404 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Composition is essential in the research of formal specifications. It facilitates the design, synthesis, testing and reuse of large programs. In order to facilitate users to specify the temporal specification at the time of authoring a multimedia program, a composition model is needed. Recently such various models have been proposed in literature, which include language-based model, graphical model, time-interval based model, object-oriented model, etc. However, most of these models are lowly abstract and it is difficult to support the composition of two multimedia programs. In this paper, by introducing a new concept unit stream and extending two temporal relations, the structuring technique is studied in order to allow complex multimedia programs to be structured, making them understandable for designers, and to allow multimedia programs to be authored in terms of composition of general purpose multimedia programs that can be re-used in authoring various different multimedia programs. Number of references:14 Main heading:Multimedia systems Controlled terms:Software engineering - Structured programming Uncontrolled terms:Multimedia program - Temporal relation - Temporal specification - Unit stream Classification code:723.1 Computer Programming - 723.5 Computer Applications Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 50> Accession number:2002066852672 Title:Formal specification for evolution of algorithm and its properties Authors:Luan, Shang-Min (1); Li, Wei (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Luan, S.-M. (lsm@mail.imd.cims.edu.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:4 Issue date:April 2001 Publication year:2001 Pages:493-498 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:The inductive process is used to specify the evolution of algorithm. The relationship between a set of sentences of first-order language and an algorithm is established and inductive rules for heuristics are presented. A probabilistic approach to algorithm analysis is also presented. This approach provides a tool for design of efficient algorithm and automatic algorithm design. Number of references:5 Main heading:Algorithms Controlled terms:Formal logic - Heuristic methods - Inference engines - Numerical analysis - Optimization - Specifications Uncontrolled terms:Algorithm analysis - Algorithm evolution - Formal specification - Inductive inference - Inductive rules - Probabilistic approach Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.4 Artificial Intelligence - 902.2 Codes and Standards - 921 Mathematics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 51> Accession number:2001526778919 Title:An XML-message based architecture description language and architectural mismatch checking Authors:Zhang, B. (1); Ding, K. (1); Li, J. (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Zhang, B. (zb@otcaix.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:2001 Publication year:2001 Pages:561-566 Language:English ISSN:07303157 CODEN:PSICD2 Document type:Conference article (CA) Conference name:25th Annual International Computer Software and Applications Conference (COMPSAC)2001 Conference date:October 8, 2001 - October 12, 2001 Conference location:Chicago, IL, United states Conference code:58826 Sponsor:IEEE Computer Society Publisher:Institute of Electrical and Electronics Engineers Computer Society Abstract:Current component interfaces, such as those defined by CORBA, are devoid of additional constraints that make helps in the task of composing software, therefore the dependent relations and interaction protocols among components are hidden within the implementations. The "implicity" reduces the composability and makes it difficult to reuse, validate and manage components. This paper presents a message based architectural model and an XML-message based Architecture Description Language (XADL). XADL promotes the description of dependent relations from the implementation level to the architectural level and enhances the interface specification by adding the sequencing, behaviour and quality constraints. Furthermore, we formulate the notion of architectural mismatch and propose a checking algorithm to prevent systems from potential mismatches. The use of XML facilitates not only the specification descriptions but also the system implementations, and increases the openness of the whole system as well. Number of references:12 Main heading:High level languages Controlled terms:Algorithms - Network protocols - Semantics - Software engineering - XML Uncontrolled terms:Software architecture Classification code:723 Computer Software, Data Handling and Applications - 723.1 Computer Programming - 723.1.1 Computer Programming Languages - 921 Mathematics Treatment:Theoretical (THR) DOI:10.1109/CMPSAC.2001.960668 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 52> Accession number:2001466730941 Title:Unique fixpoint induction for message-passing process calculi Authors:Hennessy, M. (1); Lin, H. (2); Rathke, J. (3) Author affiliation:(1) School of Cognitive and Computing Sciences, University of Sussex, Falmer Brighton BN1 9QH, United Kingdom; (2) Institute of Software, Chinese Academy of Sciences, Beijing, China; (3) School of Cognitive and Computing Sciences, University of Sussex, United Kingdom Corresponding author:Hennessy, M. (matthewh@sx.ac.uk) Source title:Science of Computer Programming Abbreviated source title:Sci Comput Program Volume:41 Issue:3 Issue date:November 2001 Publication year:2001 Pages:241-275 Language:English ISSN:01676423 CODEN:SCPGD4 Document type:Journal article (JA) Publisher:Elsevier Abstract:We present a proof system for message-passing process calculi with recursion. The key inference rule to deal with recursive processes is a version of Unique Fixpoint Induction for process abstractions. We prove that the proof system is sound and also complete for guarded regular message-passing processes. We also show that the system is incomplete for unguarded processes and discuss more powerful extensions with inductive inference rules. &copy; 2001 Elsevier Science B.V. All rights reserved. Number of references:29 Main heading:Data communication systems Controlled terms:Boolean algebra - Computer programming - Recursive functions - Security of data Uncontrolled terms:Concurrent systems - Message-passing processes 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 - 921.1 Algebra Treatment:Theoretical (THR) DOI:10.1016/S0167-6423(01)00008-9 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 53> Accession number:2002447172965 Title:Implementation architecture for group network profile in embedded systems Authors:Lin, Hong (1); Gao, Qiang (1); Ye, Dongxiang (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Lin, H. (Hong.Lin@) Source title:Proceedings of SPIE - The International Society for Optical Engineering Abbreviated source title:Proc SPIE Int Soc Opt Eng Volume:4586 Issue date:2001 Publication year:2001 Pages:226-235 Language:English ISSN:0277786X CODEN:PSISDG Document type:Conference article (CA) Conference name:Wireless and Mobile Communications Conference date:November 12, 2001 - November 15, 2001 Conference location:Beijing, China Conference code:60075 Sponsor:CSFB; China Telecom; Huawei Technologies (China); SANY; China Ministry of Science and Technologies Publisher:SPIE Abstract:Bluetooth Group Network Profile (GNP) plays a key role in Bluetooth to support an ad-hoc networking and provides the solution of communicating among the Bluetooth devices in a single Piconet. There are several challenges in implementing GNP. The paper provides the related solutions of dynamic IP address assignment, transmission of the broadcast and multicast packets, and profile security architecture. Furthermore, the implementation reduces the code size and increases the portability in the embedded environment. Number of references:5 Main heading:Embedded systems Controlled terms:Algorithms - Bandwidth - Multicasting - Network protocols Uncontrolled terms:Group network profiles (GNP) Classification code:921 Mathematics - 723 Computer Software, Data Handling and Applications - 722 Computer Systems and Equipment - 718 Telephone Systems and Related Technologies; Line Communications - 717 Optical Communication - 716.1 Information Theory and Signal Processing - 716 Telecommunication; Radar, Radio and Television Treatment:Theoretical (THR) DOI:10.1117/12.445231 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 54> Accession number:2002216953020 Title:Fast inverse warping algorithm for generating novel view Authors:Zheng, Xin (1); Wu, En-Hua (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhen, X. (zhx_zhengx@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:11 Issue date:November 2001 Publication year:2001 Pages:1667-1674 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:By taking advantages of the features of epipolar lines and depth discontinuities in reference images, an efficient inverse warping algorithm for generating images of novel views is presented by combining multiple reference images taken from different viewpoints. The method proceeds in three steps. Firstly, the reference images are preprocessed for extracting edge pixels by their displacements. Secondly, a reference image is selected as the primary reference image to be warped inversely epipolar line by epipolar line to render the novel view. Finally, holes in the desired image are filled up through searching the corresponding pixels in other reference images. At this stage, some acceleration techniques are given by utilizing the edge information and occlusion relations between objects in reference images. Number of references:12 Main heading:Computer graphics Controlled terms:Acceleration - Algorithms - Image processing Uncontrolled terms:Edge pixels - Epipolar lines - Epipoles - Hole fulling - Image based rendering - Reference image - Warping Classification code:723.5 Computer Applications - 741 Light, Optics and Optical Devices - 921 Mathematics Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 55> Accession number:2002066852673 Title:Formal language for programming with distributed resources and scopes Authors:Wang, Xu (1); Huang, Tao (1); Feng, Yu-Lin (1) Author affiliation:(1) Lab. of Comp. Sic., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wang, X. ({wx,tao}@otcaix.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:4 Issue date:April 2001 Publication year:2001 Pages:499-511 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:This paper presents a small language for distributed computation with agent mobility--Scope language. The language is different from most existing work on distributed and mobile computation, which usually take some variants of &pi;-calculus as their basis. The core of Scope language is a specially designed &lambda;-like calculus with resources. It enables Scope language to directly model memory-like resources, instead of indirectly using process/channel as in &pi;-calculus. Furthermore, Scope language gives a novel treatment to the notion of location, which is called Scope here. Scope and memory-like resources combined make Scope language complementary to most other work, and provide an alternative approach to modeling distributed and mobile systems, which feature the simplicity of implementation and the affinity with the programming model inherent in realistic language such as Obliq and Telescript. Number of references:10 Main heading:Formal languages Controlled terms:Computer programming - Computer simulation - Distributed computer systems - Location - Mathematical models - Mobile computing - Resource allocation - Software agents Uncontrolled terms:Memory like resources - Mobile agents - Realistic languages - Scopes 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.5 Computer Applications - 912.2 Management - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 56> Accession number:2001516767518 Title:Dynamic-alphabet arithmetic coding Authors:Wang, Z.X. (1); Fan, Z.H. (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wang, Z.X. (wenux@.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:2 Issue date:February 2001 Publication year:2001 Pages:283-292 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:This paper addresses the features of dynamic-alphabet model for arithmetic coding and problems pertaining to model building. Both theory analysis and experiments show that without loss time performance, the dynamic-alphabet model provides more accurate prediction and consequently has better coding efficiency. Dynamic alphabet is a fresh but key concept to the building of statistical model of text compression for any natural language of large alphabet set, such as Chinese. Number of references:13 Main heading:Data compression Controlled terms:Algorithms - Data structures - Encoding (symbols) - Forecasting - Mathematical models - Statistical methods - Text processing Uncontrolled terms:Arithmetic coding - Chinese text compression - Dynamic alphabet models - Edit distance - Local adaption - Statistical models Classification code:716.1 Information Theory and Signal Processing - 723 Computer Software, Data Handling and Applications - 921 Mathematics - 922.2 Mathematical Statistics Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 57> Accession number:2002176928173 Title:New approach for the analysis of electronic commerce protocols Authors:Zhou, Dian-Cui (1); Qing, Si-Han (1); Zhou, Zhan-Fei (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhou, D.-C. (qsihan@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:12 Issue:9 Issue date:September 2001 Publication year:2001 Pages:1318-1328 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:A new framework is proposed for the analysis of electronic commerce protocols. Comparing to the framework proposed by Kailar, it has three major improvements. Firstly, it can analyze fairness of protocols efficiently. In the analysis of fairness, it takes the reliability of communication channels into consideration. Secondly, the initial possession set depends on environment in stead of human beings. At last, by introducing the cipher text understanding rule the new framework can analyze the message which includes signed cipher text. Number of references:7 Main heading:Electronic commerce Controlled terms:Communication channels (information theory) - Cryptography - Logic design - Network protocols - Numerical analysis - Reliability Uncontrolled terms:Accountability - Cipher text - Fairness - Logic analysis Classification code:716.1 Information Theory and Signal Processing - 721.2 Logic Elements - 723 Computer Software, Data Handling and Applications - 911.4 Marketing - 913.3 Quality Assurance and Control - 921.6 Numerical Methods Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 58> Accession number:2001055453298 Title:Timed workflow process model Authors:Zhuge, Hai (1); Cheung, To-Yat (2); Pung, Hung-Keng (3) Author affiliation:(1) Laboratory of Computer Science, Inst. Software, Chinese Acad. S., Beijing, China; (2) Department of Computer Science, City University of Hong Kong, Hong Kong, Hong Kong; (3) Department of Computer Science, National University of Singapore, Singapore, Singapore Corresponding author:Zhuge, Hai Source title:Journal of Systems and Software Abbreviated source title:J Syst Software Volume:55 Issue:3 Issue date:January 15, 2001 Publication year:2001 Pages:231-243 Language:English ISSN:01641212 CODEN:JSSODM Document type:Journal article (JA) Publisher:Elsevier Science Inc, New York, NY, United States Abstract:An internet-based workflow management system (WfMS) enables business participants to work co-operatively at sites belonging to different time zones. Time-related factors have to be incorporated into the traditional workflow processes so as to adapt to the globally distributed applications. This paper proposes a timed workflow process model through incorporating the time constraints, the duration of activities, the duration of flow, and the activity distribution with respect to the multiple time axes into the conventional workflow processes. The model provides an approach for temporal consistency checking during both build-time and run-time. The proposed model and approach provide a vehicle for global business process modeling, planning and monitoring. Number of references:20 Main heading:Internet Controlled terms:Computer systems programming - Constraint theory - Distributed computer systems - Response time (computer systems) Uncontrolled terms:Consistency checking - Workflow management systems (WMS) Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 723.1 Computer Programming Treatment:Theoretical (THR) DOI:10.1016/S0164-1212(00)00073-X Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 59> Accession number:2001195588195 Title:Cryptanalysis of Wang's original and revised digital signature scheme Authors:Dai, Zong-Duo (1); Yang, Jun-Hui (3); Ye, Ding-Feng (1); Gong, Guan (2) Author affiliation:(1) State Key Lab. of Info. Security, Graduate School, Academia Sinica, Beijing 100039, China; (2) Dept. of Elec. and Comp. Engineering, University of Waterloo, Waterloo, Ont. N2L 3G1, Canada; (3) Institute of Software, Academia Sinica, Beijing 100080, China Corresponding author:Dai, Zong-Duo Source title:Electronics Letters Abbreviated source title:Electron. Lett. Volume:37 Issue:4 Issue date:Mar 2001 Publication year:2001 Pages:220 Language:English ISSN:00135194 CODEN:ELLEAK Document type:Journal article (JA) Publisher:IEE, Stevenage, United Kingdom Abstract:Wang's basic digital signature scheme and its new variation is cracked. The proposed signature forging algorithm makes no assumptions on operations of the schemes and is as efficient as the signing algorithm. Number of references:6 Main heading:Public key cryptography Controlled terms:Algorithms - Binary codes - Electronic document identification systems - Error correction - Matrix algebra - Security of data Uncontrolled terms:Cryptanalysis - Digital signature algorithm - Error correcting codes Classification code:723.1 Computer Programming - 723.2 Data Processing and Image Processing - 723.5 Computer Applications - 921.1 Algebra Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 60> Accession number:2001246537571 Title:Cryptanalysis of EIGamal/type encryption schemes based on conic curves Authors:Dai, Zong-Duo (1); Ye, Ding-Feng (1); Pei, Ding-Yi (1); Yang, Jun-Hui (2) Author affiliation:(1) University of Science and Technology of China, Graduate School, Department of Mathematics, Beijing, China; (2) Academia Sinica, Institute of Software, Beijing, China Corresponding author:Dai, Z.-D. (yangdai@mimi.cnc.ac.cn) Source title:Electronics Letters Abbreviated source title:Electron. Lett. Volume:37 Issue:7 Issue date:March 29, 2001 Publication year:2001 Pages:426 Language:English ISSN:00135194 CODEN:ELLEAK Document type:Journal article (JA) Publisher:Institution of Engineering and Technology Abstract:It is shown that the security of the EIGamal type encryption scheme based on a conic over GF(p) is not stronger than that based on GF(p<sup>2</sup>)*. Number of references:6 Main heading:Cryptography Controlled terms:Image coding - Network protocols - Numerical methods Uncontrolled terms:Discrete logarithm problem (DLP) Classification code:723 Computer Software, Data Handling and Applications - 723.2 Data Processing and Image Processing - 741 Light, Optics and Optical Devices - 921.6 Numerical Methods Treatment:Theoretical (THR) DOI:10.1049/el:20010272 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 61> Accession number:2001546794121 Title:The efficiency of various multimodal input interfaces evaluated in two empirical studies Authors:Ren, Xiangshi (1); Zhang, Gao (2); Dai, Guozhong (3) Author affiliation:(1) Department of Information Systems Engineering, Kochi University of Technology; (2) Microsoft Research, China; (3) IM and D, Software Institute, Chinese Academy of Sciences Corresponding author:Ren, X. Source title:IEICE Transactions on Information and Systems Abbreviated source title:IEICE Trans Inf Syst Volume:E84-D Issue:10 Monograph title:Autonomous Decentralized Systems and Systems Assurance Issue date:October 2001 Publication year:2001 Pages:1421-1426 Language:English ISSN:09168532 CODEN:ITISEF Document type:Journal article (JA) Publisher:Inst. of Electronics, Info. and Communications Eng. of Japan Abstract:Although research into multimodal interfaces has been around for a long time, we believe that some basic issues have not been studied yet, e.g. the choice of modalities and their combination is usually made without any quantitative evaluation. This study seeks to identify the best combinations of modalities through usability testing. How do users choose different interaction modes when they work on a particular application? Two experimental evaluations were conducted to compare interaction modes on a CAD system and a map system respectively. For the CAD system, the results show that, in terms of total manipulation time (drawing and modification time) and subjective preferences, the "pen + speech + mouse" combination was the best of the seven interaction modes tested. On the map system, the results show that the "pen + speech" combination mode is the best of fourteen interaction modes tested. The experiments also provide information on how users adapt to each interaction mode and the ease with which they are able to use these modes. Number of references:14 Main heading:Information technology Controlled terms:Computer aided design - Computer hardware - Computer software selection and evaluation - Human computer interaction - Usability engineering - User interfaces Uncontrolled terms:Interface efficiency - Map system - Multimodal input interfaces - Usability testing Classification code:722.2 Computer Peripheral Equipment - 723.5 Computer Applications - 903 Information Science Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. EI 2002 <RECORD 1> Accession number:2002447167376 Title:Role-based authorization constraint with time character Authors:Dong, Guang-Yu (1); Qing, Si-Han (1); Liu, Ke-Long (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Dong, G.-Y. (dgy@ercist.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:8 Issue date:August 2002 Publication year:2002 Pages:1521-1527 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Authorization constraint is an important part in role-based access control models. There are some methods to specify constraint formally, but they mainly focus on the static characters. A formal model is proposed to describe time character of constraint in this paper. A founded constraint model, namely a constraint specification language, is studied in detail, and is extended. The language is called RCLT (role-based constraints language with time-character) after extending. At the same time, the problems of optimizing the efficiency of RCLT system and restoring to the safe state when rules are violated are discussed. RCLT is testified to be able to express the time character of constraint well. However, there are further works need to be done for finding practical, efficient and general algorithms for optimizing efficiency and the restoration of safe state, which is the main goal of future researches. Number of references:5 Main heading:Security of data Controlled terms:Algorithms - Computer networks - Constraint theory - Mathematical models Uncontrolled terms:Access control - Authorization Classification code:721 Computer Circuits and Logic Elements - 723.2 Data Processing and Image Processing - 921 Mathematics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 2> Accession number:2002487244369 Title:Predicate &mu;-calculus for value-passing processes and complete deductive system for FO(HML) Authors:Xue, Rui (1); Lin, Hui-Min (1) Author affiliation:(1) Lab. for Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100083, China Corresponding author:Xue, R. (xuerui@) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:25 Issue:6 Issue date:June 2002 Publication year:2002 Pages:561-569 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:A predicate &mu;-calculus is proposed for describing properties of value passing processes. It is a first-order logic with fixpoints. Propositions and predicates are mutually recursively defined. Predicates are functions from values to propositions, which has three forms: predicate variables, abstractions, as well as greatest and least fixed points. Formulae are interpreted over transition systems induced by symbolic transition graphs with assignments. For the finite fragment of the logic, which is named FO(HML) and similar to the modal logic proposed by Hennessy and Liu, a Gentzen style deductive system is presented, and its completeness proved using tableau technique. Number of references:9 Main heading:Formal logic Controlled terms:Calculations Uncontrolled terms:Abstractions - Deductive completeness - Deductive system - Fixpoint - Model checking - Predicate - Symbol transition graphs - Tableau - Transition systems - Value passing processes - Variables Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723 Computer Software, Data Handling and Applications Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 3> Accession number:2002397110444 Title:Virtual assembly toolkit: A 3D interaction platform of virtual assembly Authors:Tian, Feng (1); Cheng, Cheng (1); Chen, Youdi (1); Dai, Guozhong (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Tian, F. 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:14 Issue:3 Issue date:March 2002 Publication year:2002 Pages:193-198 Language:Chinese ISSN:10039775 CODEN:JFTXFX Document type:Journal article (JA) Publisher:Institute of Computing Technology Abstract:A 3D interactive platform-Virtual Assembly Toolkit aiming at realizing customized Virtual Assembly is presented. New 3D interactive metaphor is applied and 3D interactive primitives in the assembly field are defined and encapsulated in the toolkits. The toolkit supplies programmer with the parser and semantic callback functions about these primitives. It also provides the capabilities of constraint satisfaction and collision detection about workpieces. When a programmer uses it to develop an application study about virtual assembly, the complicated tasks about 3D graphics rendering and interactive primitive manipulation are done by VAT. Number of references:6 Main heading:Computer aided design Controlled terms:Assembly - Graphic methods - Semantics - Three dimensional - Virtual reality Uncontrolled terms:Interactive metaphor - Three dimensional interaction platform - Virtual assembly toolkit Classification code:723 Computer Software, Data Handling and Applications - 903.2 Information Dissemination - 913.1 Production Engineering Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 4> Accession number:2002487245717 Title:Specification and construction of multi-agent system based on software architecture Authors:Zhan, Jian-Feng (1); Cheng, Hu (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhan, J.-F. (jfzhan@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:SUPPL. Issue date:September 2002 Publication year:2002 Pages:134-137 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Based on the software architecture, a method of specifying and constructing the multi-agent system is proposed. On four different levels such as components, agents, organization and systems, the structure, behaviors and interaction patterns of the system are studied based on CSP formalism, and role models are used to describe the static profile of dynamic organization. With the entities in the field of an agent-oriented software engineering explicitly specified, such as an agent, a role and an organization, a software architect is provided with the power of the expression of inspiration and intuition. It is also possible to automatically analyze the system properties with commercial tool such as FDR, since CSP formalism is used. Abstract type:(Edited Abstract) Number of references:6 Main heading:Multi agent systems Controlled terms:Computer architecture - Mathematical models - Software agents - Software engineering - Specifications Uncontrolled terms:Abstract organization relationship - CSP formalism - Inspiration expression - Intuition expression - Role construction - Role specification - Software architecture Classification code:723.1 Computer Programming - 723.5 Computer Applications - 902.2 Codes and Standards Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 5> Accession number:2002487244464 Title:Threshold undeniable signature scheme without a trusted party Authors:Wang, Gui-Lin (1); Qing, Si-Han (2) Author affiliation:(1) Eng. Res. Cent., Chinese Acad. of Sci., Beijing 100080, China; (2) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wang, G.-L. (glwang@ercist.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:9 Issue date:September 2002 Publication year:2002 Pages:1757-1764 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:At Auscrypt'92, Harn and Yang first proposed the conception of (t, n) threshold undeniable signature, in which only subsets with at least t members can represent a group to generate, confirm or disavow a signature. Later, several schemes are proposed, but none of them is secure. So up to now, how to design a secure (t, n) threshold undeniable signature scheme is remained an open problem. Based on discrete logarithm cryptosystem, a secure and efficient (t, n) threshold undeniable signature scheme without a trusted party is presented. This scheme has an attractive property that member's honesty is verifiable, because a publicly verifiable secret sharing scheme is used to distribute secrets and two discrete logarithm equality protocols are used to provide necessary proofs of correctness, which are proposed by Schoenmakers at Crypto'99. Abstract type:(Edited Abstract) Number of references:19 Main heading:Electronic document identification systems Controlled terms:Cryptography - Network protocols - Numerical analysis - Security of data - Theorem proving - Threshold logic Uncontrolled terms:Digital signature - Discrete logarithm equality protocols - Threshold undeniable signature Classification code:716 Telecommunication; Radar, Radio and Television - 721 Computer Circuits and Logic Elements - 723 Computer Software, Data Handling and Applications - 911.2 Industrial Economics - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 6> Accession number:2002487245703 Title:Generating nodes in concept lattice directly Authors:Hu, Ke-Yun (1); Sui, Yue-Fei (2); Lu, Yu-Chang (1); Wang, Ju (2); Shi, Chun-Yi (1) Author affiliation:(1) Dept. of Comp. Sci. and Technol., Tsinghua Univ., Beijing 100084, China; (2) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Hu, K.-Y. (kyhu@tsinghua.edu.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:SUPPL. Issue date:September 2002 Publication year:2002 Pages:36-41 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Building whole concept lattice from database is a computing intensive operation in most cases. Sometimes people need only to find certain node in concept lattices. A novel approach to compute lattice node from database without generating the whole concept lattice is presented. Given a set of objects or attributes, by exploiting unique properties of concept lattice, it is are able to find the matching node, its parent nodes and children nodes in concept lattice directly. This avoids computing and memory burden brought by lattice generation, and it is useful in concept lattice application in large data sets. Number of references:9 Main heading:Artificial intelligence Controlled terms:Calculations - Data mining - Database systems - Learning systems - Theorem proving Uncontrolled terms:Concept lattices - Irreducible element - Large data sets - Matching nodes Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.3 Database Systems - 723.4 Artificial Intelligence - 921 Mathematics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 7> Accession number:2002417138562 Title:Robot discrete adaptive control based on dynamic inversion using dynamical neural networks Authors:Sun, Fu-Chun (1); Li, Han-Xiong (2); Li, Lei (3) Author affiliation:(1) Department of Computer Science and Technology, State Key Lab of Intelligent Technology and Systems, Tsinghua University, Beijing 100084, China; (2) Department of Manufacturing Engineering and Engineering Management, City University of Hong Kong, Hong Kong, Hong Kong; (3) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Sun, F.-C. (sfc@s1000e.cs.tsinghua.edu.cn) Source title:Automatica Abbreviated source title:Automatica Volume:38 Issue:11 Issue date:November 2002 Publication year:2002 Pages:1977-1983 Language:English ISSN:00051098 CODEN:ATCAA9 Document type:Journal article (JA) Publisher:Elsevier Ltd Abstract:A stable discrete time adaptive control approach using dynamic neural networks (DNNs) is developed in this paper for the trajectory tracking of a robotic manipulator with unknown nonlinear dynamics. By using dynamic inversion constructed by a DNN, the assumption under which the system state should be on a compact set can be removed. This assumption is usually required in neuro-adaptive control. The NN-based variable structure control is designed to guarantee the stability and improve the dynamic performance of the closed-loop system. The proposed control scheme ensures the global stability and desired tracking as well. &copy; 2002 Elsevier Science Ltd. All rights reserved. Number of references:8 Main heading:Discrete time control systems Controlled terms:Adaptive control systems - Closed loop control systems - Manipulators - Neural networks - Robotics Uncontrolled terms:Dynamic inversions Classification code:691.1 Materials Handling Equipment - 723.4 Artificial Intelligence - 731.1 Control Systems - 731.5 Robotics Treatment:Theoretical (THR) DOI:10.1016/S0005-1098(02)00116-4 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 8> Accession number:2002096876047 Title:Interleaving radiosity Authors:Wu, Enhua (1); Wang, Wenping (1) Author affiliation:(1) Laboratory of Computer Science, Institute of Software, The Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Wu, E. (weh@ios.ac.cn) Source title:Journal of Computer Science and Technology Abbreviated source title:J Comput Sci Technol Volume:17 Issue:1 Issue date:January 2002 Publication year:2002 Pages:1-8 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:A system of linear equations is in general solved to approximate discretely the illumination function in radiosity computation. To improve the radiosity solution, a method that performs shooting and gathering in an interleaving manner is proposed in the paper. Besides, a criterion has been set up and tested for choosing object elements used in the gathering operation, and a criterion is established to quantify the solution errors by taking into account more reasonably of the human perception of the radiosity solution. Experimental results show that the method proposed has nice performance in improving the radiosity solution. Number of references:14 Main heading:Three dimensional computer graphics Controlled terms:Approximation theory - Computational methods - Function evaluation - Image quality - Integral equations - Linear equations Uncontrolled terms:Global illumination - Illumination function - Progressive refinement - Radiosity computation Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.5 Computer Applications - 921.2 Calculus - 921.6 Numerical Methods Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 9> Accession number:2003177450311 Title:Modeling and rendering snowy natural scenery Authors:Chen, Yan-Yun (1); Sun, Han-Qiu (3); Guo, Bai-Ning (1); Wu, En-Hua (2) Author affiliation:(1) Microsoft Res. Asia, Beijing 100080, China; (2) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (3) Dept. of Comp. Sci. and Eng., Chinese Univ. of Hong Kong, Hong Kong, Hong Kong; (4) Faculty of Sci. and Technol., Univ. of Macao, Macao, China Corresponding author:Chen, Y.-Y. (i-yachen@) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:25 Issue:9 Issue date:September 2002 Publication year:2002 Pages:916-922 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:Realistic image synthesis of high complex natural scenes has been always a challenging topic in computer graphics. Generation of snow scenes could be even more difficult due to the inconvenience of using common modeling elements, such as polygons and curved surfaces, to express the snow shape. This paper introduces an approximate method to solve the problem. By the method, displacement map is used to model snow block on near objects, constructed from polygons, while volumetric texture map is introduced to handle the objects in distance like trees. Test result shows that the method is viable in producing realistic snow scenes with comprehensive object environments, in a favorable requirement of storage and rendering computation. Number of references:21 Main heading:Computer graphics Controlled terms:Image processing - Mapping - Models - Ray tracing - Storage allocation (computer) - Textures Uncontrolled terms:Displacement mapping - Polygons - Realistic rendering - Volumetric texture Classification code:722.1 Data Storage, Equipment and Techniques - 723.2 Data Processing and Image Processing - 723.5 Computer Applications - 902.1 Engineering Graphics - 933 Solid State Physics Treatment:Applications (APP); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 10> Accession number:2004148097618 Title:A Gesture Language for Collaborative Conceptual Design Authors:Ma, Cuixia (1); Wang, Hongan (1); Dai, Guozhong (1) Author affiliation:(1) Hum. Comp. Intrac./I.I.P.L., Institute of Software, Chinese Academy of Sciences, Beijing, China Corresponding author:Ma, C. (mcx@iel_mail.iscas.ac.cn) Source title:Proceedings of the International Conference on Computer Supported Cooperative Work in Design Abbreviated source title:Proc. Intern. Conf. on Comp. Supp. Coop. Work in Des. Volume:7 Monograph title:Proceedings of the Seventh International Conference on CSCW in Design Issue date:2002 Publication year:2002 Pages:205-209 Language:English ISBN-10:8528500500 ISBN-13:9788528500509 Document type:Conference article (CA) Conference name:Proceedings of the Seventh International Conference on CSCW in Design Conference date:September 25, 2002 - September 27, 2002 Conference location:Rio de Janeiro, Brazil Conference code:62547 Sponsor:FAPERJ; SBC; UFRI; IEEE; COPPETEC FUNDACAO Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Ubiquitous computing provides the new research challenges for the next generation interactions. Natural User Interface is one of the important aspects. Pen and paper are the natural and simple tools to use in our daily life, which can fit for the imprecise and flexible design mode in conceptual design. Gestures are the useful and natural mode in the pen-based interaction which can be introduced and used through the similar mode to the existing resources in interaction. Inherent problems exist with collaborative conceptual design because the simultaneous group interaction required for users to smoothly and effectively work together in the same virtual space. In this paper, we provide solutions to these problems by devising a fast and direct gesture-based user interface, a set of visual effects that better enable a user's awareness of the operations done by other participants, and a set of tools for enhancing visual communication between participants. A gesture description language (GDL) is given to provide the useful gestures to the applications conveniently. Number of references:9 Main heading:Gesture recognition Controlled terms:Human computer interaction - Information analysis - Mathematical models - Product development - Professional aspects - User interfaces Uncontrolled terms:Collaborative conceptual design - Gesture description languages (GDL) Classification code:921 Mathematics - 913.1 Production Engineering - 903.1 Information Sources and Analysis - 901.1 Engineering Professional Aspects - 722.2 Computer Peripheral Equipment - 716 Telecommunication; Radar, Radio and Television - 461.4 Ergonomics and Human Factors Engineering Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 11> Accession number:2002487244476 Title:Recovering material for a homogeneous object in an environment from a single high dynamic rang image Authors:Sun, Qi-Min (1); Wu, En-Hua (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Comp. Sci. Dept., Qufu Normal Univ., Qufu 273165, China; (3) Faculty of Sci. and Technol., Univ. of Macau, Macau, China Corresponding author:Sun, Q.-M. (sqm@ios.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:9 Issue date:September 2002 Publication year:2002 Pages:1852-1857 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:An approach is proposed to recover material of a homogeneous object in a general environment from a single high dynamic range image. There is no limitation on the shape and illumination condition of the object. In a general environment, acquire a high dynamic range image for an object and one or a few high dynamic range environment maps as illumination of the object. Then the simulated annealing algorithm is employed to solve the inverse rendering problem. In the course of optimization, image-based lighting and ray tracing techniques are used, and inter-reflection is calculated. Finally, optimal parameter values for the reflection model are obtained. Combined with the image-based modeling techniques, a realistic model can be created from images of a real object. Number of references:12 Main heading:Computer graphics Controlled terms:Algorithms - Graphic methods - Image processing - Light reflection - Lighting - Mathematical models - Optimization - Ray tracing - Simulated annealing Uncontrolled terms:High dynamic range images - Homogeneous objects - Image based lighting - Interreflection - Inverse rendering - Light fields - Recovering material - Reflection models Classification code:723.2 Data Processing and Image Processing - 723.5 Computer Applications - 741.1 Light/Optics - 921 Mathematics Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 12> Accession number:2003427671440 Title:MPEG-4 video traffic model based on the multifractal wavelet Authors:Hong, Fei (1); Wu, Zhimei (1) Author affiliation:(1) Multimedia Research Center, Institute of Software, Chinese Academy of Sciences, P.O. Box 8718, Beijing 100080, China Corresponding author:Hong, F. (hongfei@isdn.iscas.ac.cn) Source title:Proceeding of the International Conference on Telecommunications Abbreviated source title:Proc. Internat. Conf. Telecomm. Volume:1 Issue date:2002 Publication year:2002 Pages:374-378 Language:English ISBN-10:7505377027 ISBN-13:9787505377028 Document type:Conference article (CA) Conference name:Proceedings of the International Conference on Telecommunications 2002 Conference date:June 23, 2002 - June 26, 2002 Conference location:Beijing, China Conference code:61501 Publisher:Publishing House of Electronics Industy (PHEI) Abstract:MPEG-4 encoded video is expected to account for a large portion of the traffic in future wireline and wireless networks. The long frame size traces of MPEG-4 encoded video show clear indications of long range dependence properties. Video traffic models are an invaluable asset to the network design and performance evaluations. In this paper, we apply the multifractal wavelet model to the MPEG-4 video traffic analysis and synthesis. The 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. Number of references:9 Main heading:Image coding Controlled terms:Algorithms - Image quality - Mathematical models - Probability - Telecommunication traffic - Wavelet transforms - Wireless telecommunication systems Uncontrolled terms:Haar wavelet transform - Motion Picture Experts Group - Multifractal wavelet - Video traffic model Classification code:716.1 Information Theory and Signal Processing - 723.1 Computer Programming - 723.2 Data Processing and Image Processing - 921.3 Mathematical Transformations - 921.6 Numerical Methods - 922.1 Probability Theory Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 13> Accession number:2002487245719 Title:Secret sharing schemes based on computer algebra Authors:Wang, Ming-Sheng (1); Feng, Deng-Guo (1); Wang, Gui-Lin (2) Author affiliation:(1) State Key Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Center for Info. Security Technol., Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wang, M.S. Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:SUPPL. Issue date:September 2002 Publication year:2002 Pages:143-148 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:There are great interests in applications of computer algebra to cryptology. This paper discusses a connection between secret sharing scheme and computer algebra. One of the core concepts of computer algebra, division algorithm and Gro&die;bner basis, can be used in the construction of secret sharing schemes. The authors compute an example by means of Maple software. This example shows that this scheme can be implemented easily. In fact, the authors can just finish these computations by some famous symbolic computation software, for example, Maple, Reduce, Macauly, Singular. Number of references:11 Main heading:Cryptography Controlled terms:Algebra - Algorithms - Computer software - Security of data - Theorem proving Uncontrolled terms:Computer algebra - Division algorithms - Gro&die;bner basis - Maple software - Secret sharing Classification code:716 Telecommunication; Radar, Radio and Television - 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 Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 14> Accession number:2003187454093 Title:Architecture description Language XADL and architectural mismatch checking Authors:Zhang, Bo (1); Feng, Yu-Lin (1); Huang, Tao (1) Author affiliation:(1) Lab. for Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Software Eng. Technol. Cent., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhang, B. (zb@otcaix.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:12 Issue date:December 2002 Publication year:2002 Pages:2238-2243 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:By the currently developed component models and standards, the component interfaces convey only limited semantics and the interaction protocol among components is hidden within the implementations, which may result in the problem of architectural mismatches, also make these components in difficulty to reuse, validate and manage. An XML-message based architecture description language (XADL) is outlined, which supports the description of explicit interaction protocols and the composing relations of components. Based on the XADL, the notion of architectural mismatch is introduced and shows how it can be checked. The XADL enhances the descriptive capacity of interfaces, prevents systems from potential architectural mismatches, and facilities the implementation of system monitor, performance analysis and dynamic tuning. Abstract type:(Edited Abstract) Number of references:9 Main heading:Computer programming languages Controlled terms:Components - Computer architecture - Finite automata - Interfaces (computer) - Mathematical models - Network protocols Uncontrolled terms:Architectural mismatch - Architecture description languages - Software architecture Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722.2 Computer Peripheral Equipment - 723.1 Computer Programming - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 15> Accession number:2003197463096 Title:Evaluating response time of a network management system based on mobile agents Authors:Zhang, Pu-Han (1); Sun, Yu-Fang (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhang, P.-H. (phzhang@sonata.iscas.ac.cn) Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:30 Issue:10 Issue date:October 2002 Publication year:2002 Pages:1421-1424 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:In order to reduce the response time for mobile agent-based network management system, a quantitative model to analyze the major factors that affect the response time. Various experiments were carried out to evaluate the affect on management response time: number of managed network elements, data rate between network elements and manager, data rate between network elements and task to be performed. The results show that the mobile agent is more influenced by the task to be performed and is less sensitive to the bandwidth of the bottleneck link that connects the management station to the remote LAN. A significant improvement of the response time for mobile agent is obtained when the mobile agent sends data to the management station after visiting a certain number of nodes. Abstract type:(Edited Abstract) Number of references:10 Main heading:Computer networks Controlled terms:Active networks - Local area networks - Management - Mobile computing - Response time (computer systems) Uncontrolled terms:Management station - Mobile agent - Network management Classification code:722.4 Digital Computers and Systems - 723.5 Computer Applications - 912.2 Management Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 16> Accession number:2003027308402 Title:Structure of weakly invertible semi-input-memory finite automata with delay 2 Authors:Tao, Renji (1); Tao, Jen-Chi (1); Chen, Shihua (1) Author affiliation:(1) Key Laboratory of Computer Science, Institute of Software, The Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Tao, R. (trj@ios.ac.cn) Source title:Journal of Computer Science and Technology Abbreviated source title:J Comput Sci Technol Volume:17 Issue:6 Issue date:November 2002 Publication year:2002 Pages:682-688 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:Semi-input-memory finite automata, a kind of finite automata introduced by the author of this paper for studying error propagation, are a generalization of input-memory finite automata by appending an autonomous finite automation component. This paper gives a characterization on the structure of weakly invertible semi-input-memory finite automata with delay 2 in which input alphabets and output alphabets have two elements and autonomous finite automata are cyclic. For the structure of feedforward inverse finite automata with delay 2, Zhu first gave a characterization; from a result on mutual invertibility of finite automata, the result mentioned above also leads to a different characterization on the structure of feedforward inverse finite automata with delay 2. Number of references:9 Main heading:Finite automata Controlled terms:Computational methods - Computer science - Graph theory - Set theory - Theorem proving Uncontrolled terms:Invertibility - Semi-input-memory finite automata Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1 Computer Programming - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 17> Accession number:2002487245731 Title:Open framework for heterogeneous database replication Authors:Zhe, Jing (1); Sun, Yu-Fang (1) Author affiliation:(1) Chinese Character Info. Cent., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhe, J. (jzhe@sonata.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:SUPPL. Issue date:September 2002 Publication year:2002 Pages:246-251 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Database replication is a key technique that is often used in distributed environments. To deal with the increasing heterogeneous database replication demands, this paper proposes an open framework 234-5. Two basic objects (publication and subscription) for replication are firstly abstracted. Based on them, the framework is divided into 3 layers (the connection layer, the implementation layer and the application layer), and 4 functional components (capturing manager, distributor, synchronizer and conflict manager) are defined in the implementation layer. Thus 5 advantages (fully heterogeneous, all-round functions, transplantable, expandable, and global performance) are achieved. Number of references:9 Main heading:Database systems Controlled terms:Management - Publishing - Semantics - Telecommunication networks Uncontrolled terms:Database replication - Functional components - Heterogeneous databases - Open frameworks - Open structure - Subscription Classification code:716 Telecommunication; Radar, Radio and Television - 723.3 Database Systems - 903.2 Information Dissemination - 912.2 Management Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 18> Accession number:2002487244469 Title:Image-based real time walkthrough Authors:Zhang, Yan-Ci (1); Wu, En-Hua (1); Wu, En-Hua (2) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Faculty of Sci. and Technol., Univ. of Macau, Macau, China Corresponding author:Zhang, Y.-C. (yanci_zhang@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:9 Issue date:September 2002 Publication year:2002 Pages:1796-1803 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:A hybrid representation of environment models is proposed by combining points and polygons through which a real time walkthrough of a complex environment can be achieved. Starting from multiple depth reference images, the pixels of images are classified into two categories, corresponding to the planar and non-planar surfaces in 3D space. For the pixels corresponding to the planar surfaces, the plane coefficients are reconstructed and all their appearances in the reference images are merged to form uniform-sampled texture images by a comparison of sampling rate and resampling. For the pixels corresponding to the non-planar surfaces, their point representation is kept and no 3D models are reconstructed, the redundant pixels are removed by sampling rate comparison. The remained pixels are organized by OBB-tree according to their space coordinates. At the same time, the holes that are unable to be captured by all the reference images are pre-filled in the preprocessing phase so that the probability of hole appearance in walkthrough is greatly reduced. Under this hybrid representation, texture mapping and point warping are employed to render the novel views, to take full advantages of the acceleration utility of graphics hardware. Number of references:19 Main heading:Virtual reality Controlled terms:Classification (of information) - Computer graphics - Computer hardware - Graphic methods - Image processing - Mathematical models - Sampling - Three dimensional Uncontrolled terms:Hole prefilling - Image based rendering - Image pixels - Point warping - Real time walk through - Reference images - Sampling rate - Texture mapping - Uniform sampled texture images Classification code:716.1 Information Theory and Signal Processing - 723 Computer Software, Data Handling and Applications - 741.1 Light/Optics - 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 19> Accession number:2002427142668 Title:Plane-based warping Authors:Zhang, Yan-Ci (1); Wu, En-Hua (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhang, Y.-C. (zhangyc@ios.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:7 Issue date:July 2002 Publication year:2002 Pages:1242-1249 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:A plane-based backward warping algorithm is proposed to generate novel views from multiple reference images. First the depth information is employed to reconstruct space planes from individual reference images and the potential occluding relationship between these planes is calculated. Then the planes that represent an identical space plane from different reference images are compared with each other to decide one with best sample rate preserved and used in the later warping period while the other samples are abandoned. While the image of a novel view is produced, the planes that pass the visibility test are projected onto the desired image from which people can get knowledge on the plane that the desired image pixels are warped from. 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. It is shown that the storage requirement and executing time of the proposed algorithm increases slowly with the number of reference images. Number of references:11 Main heading:Image processing Controlled terms:Algorithms - Data processing - Knowledge acquisition - Sampling - Visibility Uncontrolled terms:Backward warping - Depth information - Forward warping - Image based rendering - Plane based warping - Reference images - Sampling rate Classification code:723 Computer Software, Data Handling and Applications - 741 Light, Optics and Optical Devices - 921 Mathematics - 922.1 Probability Theory Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 20> Accession number:2003187454095 Title:Design and evaluation of an algorithm for integrated dynamic scheduling in real-time heterogeneous systems Authors:Qiao, Ying (1); Zou, Bing (1); Fang, Ting (1); Wang, Hong-An (1); Dai, Guo-Zhong (1) Author affiliation:(1) Intelligence Eng. Lab., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Qiao, Y. (lisa_qiao@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:12 Issue date:December 2002 Publication year:2002 Pages:2251-2258 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:An efficient algorithm is presented to dynamically schedule the task sets combining hard and soft real-time tasks in heterogeneous systems. The proposed algorithm improves the scheduling success ratio by introducing a new task assignment policy and a QoS (quality of service) degradation policy for soft real-time tasks. To evaluate the performance of the new algorithm, extensive simulation studies are done. These simulations apply myopic algorithm to schedule the hard and soft real-time tasks in heterogeneous systems and use it as a baseline to compare with the proposed algorithm. Simulation results show that the scheduling success ratio of the new algorithm is always higher than that of myopic algorithm in real-time heterogeneous systems for a variety of task parameters. Abstract type:(Edited Abstract) Number of references:9 Main heading:Real time systems Controlled terms:Algorithms - Computer simulation - Evaluation - Heuristic methods - Mathematical models - Quality of service - Scheduling Uncontrolled terms:Backtrack - Dynamic scheduling - Hard real time - Heterogeneous systems - Scheduling success ratio - Soft real time - Task assignment 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 Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 21> Accession number:2002497258605 Title:Formal specification language supporting specification acquisition Authors:Chen, Hai-Ming (1); Dong, Yun-Mei (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Chen, H.-M. (chm@ios.ac.cn) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:25 Issue:5 Issue date:May 2002 Publication year:2002 Pages:459-466 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:This paper presents the formal specification language LFC which is designed to support formal specification acquisition and validation of software. In order to achieve the goal, two powerful formalisms, i.e. formal languages and recursive functions, are employed in LFC. The language is based on a new kind of recursive functions, i.e. recursive functions defined on context-free languages(CFRF), and uses context-free language as data type. These enable the use of machine learning and other machine-aided techniques in specification process to reduce acquisition difficulty, while possessing strong expressiveness for representing specifications. As a result LFC supports specification acquisition at language level. The language is also executable; therefore it enables rapid prototyping. Specifications acquired are validated by prototyping and other techniques. The major novelty in the design of LFC is the utilization of formal languages and CFRF, a new and useful tool for specifying non-numeric algorithms, as the theoretical basis of the language. The main aspects of the design of language LFC are introduced, including theoretical preparations, and major features of the language. This language has been used as a constituent part of the formal specification acquisition system SAQ. Some nontrivial experiments have been conducted. The results show that LFC is powerful and easy to use, suitable for specification acquisition, as well as for some other purposes. Number of references:10 Main heading:Formal languages Controlled terms:Context free languages - Recursive functions - Software engineering Uncontrolled terms:Formal specification language - Prototyping - Specification acquisition Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1 Computer Programming Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 22> Accession number:2001556805192 Title:A federation-agent-workflow simulation framework for virtual organisation development Authors:Zhuge, Hai (1); Chen, Jian (1); Feng, Yulin (3); Shi, Xiaoqing (4) Author affiliation:(1) School of Economics and Management, Tsinghua University, Beijing 100084, China; (2) Software Division, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, China; (3) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100085, China; (4) Department of Systems Ecology, Centre of Eco-Environment Science, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Zhuge, H. (zhuge@ict.ac.cn) Source title:Information and Management Abbreviated source title:Inf Manage Volume:39 Issue:4 Issue date:January 2002 Publication year:2002 Pages:325-336 Language:English ISSN:03787206 CODEN:IMANDC Document type:Journal article (JA) Publisher:Elsevier Abstract:Traditional information system development approaches separate the domain model from the system model and then focus on the transformation between them. They are not, however, useful in rapid development of virtual organisations. This paper proposes a simulation-based development framework for establishing such organisations. It consists of a federation-agent-workflow (FAW) model, a set of rules for establishing the mapping from the domain into the virtual organisation, a set of management services, and a macro development process. Basic elements of the model are agents, which can perform active domain behaviour, and they are organised as autonomous federations. Agents within the same federation perform relevant tasks according to an overall workflow. Domain organisation is simulated by the multi-level agents whose behaviour are driven by a nested-workflow mechanism. The framework unifies the traditional domain organisation and information system model into a virtual organisation model, and this allows users to develop intuitive virtual organisations from the viewpoint of the domain. A comparison between the framework and the traditional information system approaches shows that the framework provides a simpler development process, so it meets the needs of virtual organisations for rapid and mobile development. &copy; 2002 Elsevier Science B.V. All rights reserved. Number of references:28 Main heading:Societies and institutions Controlled terms:Information management - Multi agent systems - Sustainable development Uncontrolled terms:Federation-agent-workflow (FAW) model Classification code:901.1.1 Societies and Institutions - 901.4 Impact of Technology on Society - 903.2 Information Dissemination - 912.2 Management Treatment:Theoretical (THR) DOI:10.1016/S0378-7206(01)00100-8 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 23> Accession number:2002397110359 Title:Efficient cache validation algorithm for mobile web browsing Authors:Zhou, Huan (1); Li, Jing (1); Feng, Yu-Lin (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhou, H. (feng@ios.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:3 Issue date:March 2002 Publication year:2002 Pages:370-375 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Client-proxy-server based volume callback algorithms are introduced to address two key issues that face the traditional algorithms: scalability and client disconnection. Proxies extend scalability by alleviating loading on servers. Volume based callback accelerates validation process and eliminates revalidation bottleneck when reconnected. Simulation result shows that the improved volume callback algorithms save validation messages by 86% compared with the traditional algorithms. And its overall performance is close to ATTL (adaptive time to live) algorithm. Number of references:8 Main heading:Buffer storage Controlled terms:Algorithms - Mobile computing - Mobile telecommunication systems - Web browsers Uncontrolled terms:Adaptive time to live - Cache validation algorithm - Callback - Volume Classification code:718 Telephone Systems and Related Technologies; Line Communications - 722.1 Data Storage, Equipment and Techniques - 723 Computer Software, Data Handling and Applications - 921 Mathematics Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 24> <RECORD 1> Accession number:2002487245721 Title:Analysis and implementation of information retrieval system for Chinese semi-structure documents Authors:Zhang, Yi-Bo (1); Du, Lin (1); Sun, Yu-Fang (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhang, Y.-B. (zyb@sonata.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:SUPPL. Issue date:September 2002 Publication year:2002 Pages:155-159 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:To improve the effectiveness of Chinese text retrieval system, a Chinese information retrieval system SXML is designed, which can support structured query on the aspects of structure and function. The reasons which lead to the effectiveness lost of the Chinese retrieval system whose indexing uses word-based segmentation are discussed in detail. And a PM-based method is presented to compute the association matrix and introduced into the generalized vector space model. The experimental results show that great improvement is gained on the effectiveness of the information retrieval system compared with that of the classical text retrieval system for pure-text documents. Number of references:6 Main heading:Information retrieval Controlled terms:Calculations - Data processing - Indexing (of information) - Matrix algebra - Natural language processing systems - Text processing Uncontrolled terms:Association matrixes - Chinese information processing - Proximity and mutual information - Semistructured documents - Vector space models - Work based segmentation 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.1 Information Sources and Analysis - 903.3 Information Retrieval and Use - 921 Mathematics Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 25> Accession number:2003087370172 Title:Agent logic and the true-false subset semantics Authors:Hu, Shan-Li (1); Shi, Chun-Yi (3) Author affiliation:(1) Lab. for Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Dept. of Comp. Sci. and Technol., Fuzhou Univ., Fuzhou 350002, China; (3) Dept. of Comp. Sci. and Technol., Tsinghua Univ., Beijing 100084, China Corresponding author:Hu, S.-L. (husl@fzu.edu.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:11 Issue date:November 2002 Publication year:2002 Pages:2112-2115 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Formal frameworks for the specification of rational agents are commonly based on logic of belief, desire and intention. In order to eliminate the problems with existing logic of belief, desire and intention, and to provide a proper semantic representation for non-normal modal operator, the problems with existing logic of belief, desire and intention are addressed, the true-false subset semantics, which is developed by the authors, and its application in the formalization of agent are introduced. The proposed framework invalidates the problematic properties of intention, and by imposing certain constraints on the algebraic structure of the models, it is showed that many desirable properties can be obtained. Finally the true-false subset semantics is analyzed. Thus the true-false subset semantics provides a proper semantic representation for non-normal modal operator. It is an important development of classical possible worlds semantics for normal modal operators, and is proved to be a powerful tool for the logical specification of rational agent behavior. It can be applied to establish a new proper agent logic system. Number of references:9 Main heading:Artificial intelligence Controlled terms:Algebra - Constraint theory - Formal logic - Mathematical models - Mathematical operators - Modal analysis - Multi agent systems - Semantics - Specifications Uncontrolled terms:Intention - Modal operators - Rational agents - True false subset semantics Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.4 Artificial Intelligence - 723.5 Computer Applications - 902.2 Codes and Standards - 903.2 Information Dissemination - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 26> Accession number:2003087370169 Title:Evaluating the performance of a network management system based on mobile agents Authors:Zhang, Pu-Han (1); Sun, Yu-Fang (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhang, P.-H. (phzhang@sonata.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:11 Issue date:November 2002 Publication year:2002 Pages:2090-2098 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Currently, most network management systems are centralized and therefore, the management systems present severe limitations as far as performance, scalability, and flexibility are concerned. A potential approach to the problem is to equip the management system with MA (mobile agent) capabilities. But it is difficult to identify precisely under which conditions design exploiting mobile agent is preferable over a traditional one. A quantitative model is presented to analyze the performance (traffic, response time) of mobile agent design paradigm against the traditional client-server architecture for network management. The mobile agent performance is compared with SNMP (simple network management protocol) one in several simulations. Analysis and simulations results show that the mobile agent performs better than the SNMP when the number of managed network elements exceeds a value related to the overhead of several retrievals of the SNMP. Moreover, a significant improvement of the mobile agent performance is obtained when the agent returns to the management station, after visiting a fixed number of nodes. Number of references:10 Main heading:Information management Controlled terms:Autonomous agents - Computer networks - Computer simulation - Evaluation - Network protocols - Numerical analysis - Performance - Response time (computer systems) - Telecommunication traffic Uncontrolled terms:Mobile agents - Network management - Simple network management protocols - Traffic analysis Classification code:716 Telecommunication; Radar, Radio and Television - 722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 903.2 Information Dissemination - 912.2 Management - 921.6 Numerical Methods Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 27> Accession number:2002487245700 Title:Computational complexity of propositional clause set revision and its polynomial algorithm Authors:Luan, Shang-Min (1); Dai, Guo-Zhong (1); Li, Wei (2) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Dept. of Comp. Sci. and Eng., Beijing Univ. of Aero. and Astron., Beijing 100083, China Corresponding author:Luan, S.-M. (shangmin_luan@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:SUPPL. Issue date:September 2002 Publication year:2002 Pages:12-16 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:The computational complexity of propositional clause set counterfactuals is discussed. It is proved that the computational complexity of propositional clause set counterfactuals is at the second level of the polynomial hierarchy, and computational complexity of propositional horn clause set counterfactuals is at the first level of the polynomial hierarchy. Furthermore. Some polynomial algorithms are presented for some subclasses of propositional clause set, such as the unique satisfiable clause set and the clause set of which only one subset is minimally inconsistent with the input clause whose inconsistency check can be solved in polynomial time. Number of references:25 Main heading:Artificial intelligence Controlled terms:Algorithms - Computational complexity - Formal logic - Polynomials - Theorem proving Uncontrolled terms:Belief revision - Counterfactuals - Inconsistency check - Polynomial algorithms - Propositional clause sets - Propositional logic Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.4 Artificial Intelligence - 921 Mathematics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 28> Accession number:2002287014569 Title:Pitch estimation based on circular AMDF Authors:Zhang, Wenyao (1); Xu, Gang (1); Wang, Yuguo (1) Author affiliation:(1) Institute of Software, CAS, Beijing, 100080, China Corresponding author:Zhang, W. (zhwenyao@) Source title:ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings Abbreviated source title:ICASSP IEEE Int Conf Acoust Speech Signal Process Proc Volume:1 Issue date:2002 Publication year:2002 Pages:I/341-I/344 Language:English ISSN:07367791 CODEN:IPRODJ Document type:Conference article (CA) Conference name:2002 IEEE International Conference on Acustics, Speech, and Signal Processing Conference date:May 13, 2002 - May 17, 2002 Conference location:Orlando, FL, United states Conference code:59254 Sponsor:IEEE Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Pitch period is a key parameter in speech compression, synthesis and recognition. The AMDF is often used to determine this parameter. Due to the falling trend of the AMDF curve, however, it is easy to make the estimated pitch doubled or halved. To correct these errors, the algorithm has to increase its complexity. In this paper, we propose a new function, Circular AMDF (CAMDF), and describe a new pitch detection algorithm based on it. The CAMDF conquers the defect of AMDF, and brings us some useful features, which not only simplifies the procedure of estimation, but also efficiently reduces the estimation errors and improves the estimation precision. Lots of experiment shows that the performance of CAMDF outperforms the others AMDF-based functions, such as HRAMDF and LVAMDF. Number of references:10 Main heading:Acoustic signal processing Controlled terms:Algorithms - Error correction - Feature extraction - Parameter estimation - Speech recognition - Speech synthesis - Waveform analysis Uncontrolled terms:Circular average magnitude difference function - Pitch detection algorithm - Pitch estimation Classification code:751.1 Acoustic Waves - 751.5 Speech - 921.6 Numerical Methods Treatment:Theoretical (THR); Experimental (EXP) DOI:10.1109/ICASSP.2002.1005746 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 29> Accession number:2003187454104 Title:Construction of perception mechanism in virtual assembly Authors:Cheng, Cheng (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Cheng, C. (guoguochengl@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:12 Issue date:December 2002 Publication year:2002 Pages:2324-2330 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Interaction is one of the important features of virtual assembly. In order to promote the system's interactive performance, computer and human should share in cognitive burden in reason. The realization of virtual environment's perceptual mechanism is the critical method towards this objective. A formal description of virtual assembly structure is given first, then a perceptual mechanism of compound object is put forward, lastly, a three-stage perception mode is given, and the perceptual process constructions which are needed in virtual assembly application are also analyzed. The desktop virtual assembly practices demonstrate that this perception mechanism has a good real-time interactive characteristic, and it is also a wonderful facility to help understanding user's intention. Number of references:11 Main heading:Human computer interaction Controlled terms:Assembly - Constraint theory - Object oriented programming - Virtual reality Uncontrolled terms:Feature based design - Geometric constraints - Perception mechanism - Software construction - Three-stage perception modes - Virtual assembly Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722.2 Computer Peripheral Equipment - 723 Computer Software, Data Handling and Applications - 731.1 Control Systems - 913.1 Production Engineering Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 30> Accession number:2002487245723 Title:Swarm intelligence-based algorithm for load balancing in communication networks Authors:Zhang, Pu-Han (1); Sun, Yu-Fang (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhang, P.-H. (phzhang@sonata.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:SUPPL. Issue date:September 2002 Publication year:2002 Pages:177-183 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Network load balancing aims at evenly distributing the load over a network, thus leaving no routers idle and preventing overloads for others. It is becoming increasingly difficult due to the increasing size, rapidly changing topology, and complexity of communication networks. A new class of algorithms, inspired by swarm intelligence, is currently being developed that can potentially solve numerous problems of load balancing in modern communications networks. An algorithm based on swarm intelligence of load balancing in communication networks is presented. This algorithm is an adaptive, distributed, mobile-agent-based one which extends from the AnteNet algorithm and the multiple round trip routing algorithm. It includes two classes of mobile agents: strategy agents and load agents. A network simulator is designed to validate the proposed algorithm. This algorithm is compared with the AnteNet and the multiple routing. The improved performance is proved by experiments. Abstract type:(Edited Abstract) Number of references:11 Main heading:Telecommunication networks Controlled terms:Algorithms - Computer simulation - Intelligent control - Routers - Software agents Uncontrolled terms:Load agents - Mobile agents - Network load balancing - Routing algorithms - Strategy agents - Swarm intelligence Classification code:716 Telecommunication; Radar, Radio and Television - 722.3 Data Communication, Equipment and Techniques - 723.4 Artificial Intelligence - 723.5 Computer Applications - 921 Mathematics Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 31> Accession number:2002447167360 Title:Flexible and formalized process modeling language Authors:Chen, Cheng (1); Shen, Bei-Jun (1); Gu, Yu-Qing (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Chen, C. (chen_goodwin@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:8 Issue date:August 2002 Publication year:2002 Pages:1374-1381 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:For reaching the requirement of process domain, a flexible and formalized process modeling language FLEX is proposed to support semantics richness, easy of use, flexibility, scalability, reuseness, and distribution, while it is analyzable, executable, and evolutive. Especially, the language not only can provide non-experts high level representation for easy of use, but also can allow users to define and reuse process notations at various granularities to extend the representation. So FLEX can support various levels and requirements of process modeling. Number of references:16 Main heading:Software engineering Controlled terms:Computer architecture - Computer programming languages - Mathematical models - Object oriented programming - Process engineering Uncontrolled terms:Process centered software engineering environment - Software process 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 32> Accession number:2003127405675 Title:Adaptive fuzzy control scheduling of hybrid real-time systems Authors:Huai, Xiao-Yong (1); Zou, Yong (1); Li, Ming-Shu (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, China Corresponding author:Huai, X.-Y. (huaixy@intec.iscas.ac.cn) Source title:Proceedings of 2002 International Conference on Machine Learning and Cybernetics Abbreviated source title:Proc. of 2002 Internat. Conf. on Machine Learning and Cybernetics Volume:2 Issue date:2002 Publication year:2002 Pages:810-815 Language:English ISBN-10:0780375084 ISBN-13:9780780375086 Document type:Conference article (CA) Conference name:Proceedings of 2002 International Conference on Machine Learning and Cybernetics Conference date:November 4, 2002 - November 5, 2002 Conference location:Beijing, China Conference code:60775 Sponsor:Hebei University; IEEE systems, Man and Cybernetics technical Comm. on Cybernetics Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:To meet the ever-increasing requirement of multi-task uncertainly concurring, dynamic uncertainty of tasks and system loads in open hybrid real-time systems, the paper presents a QoS model based open adaptive hybrid soft real-time systems scheduling framework. To adapt to the uncertainties of open hybrid real-time systems, we introduce fast fuzzy control mechanism to control the scheduling errors of QoS objects, so as to statistically guarantee that the accepted tasks of any QoS object can complete before their deadline. Simulation results illustrate that the scheduling framework can adapt the dynamic uncertainty of system objects, loads and tasks, and statistically guarantee the multi-constraints. It is an intelligent adaptive scheduling framework that applies to hybrid soft real-time systems. Number of references:5 Main heading:Real time systems Controlled terms:Adaptive control systems - Computer simulation - Constraint theory - Fuzzy control - Quality of service - Scheduling - Uncertain systems Uncontrolled terms:Adaptive system scheduling - Hybrid soft real time systems - Scheduling errors Classification code:722.4 Digital Computers and Systems - 731.1 Control Systems - 912.2 Management Treatment:Theoretical (THR) DOI:10.1109/ICMLC.2002.1174494 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 33> Accession number:2002397100954 Title:Numerical experiments of some Krylov subspace methods for black oil model Authors:Cao, Jianwen (1); Lai, Choi-Hong (2) Author affiliation:(1) R and D Center for Parallel Software, Institute of Software Chinese Academy of Sciences, Beijing 8718, 100080, China; (2) School of Computing and Mathematical Sciences, University of Greenwich, 30 Park Row, Greenwich, London SE10 9LS, United Kingdom Corresponding author:Cao, J. (cao@mail.rdcps.ac.cn) Source title:Computers and Mathematics with Applications Abbreviated source title:Comput Math Appl Volume:44 Issue:1-2 Issue date:July 2002 Publication year:2002 Pages:125-141 Language:English ISSN:08981221 CODEN:CMAPDK Document type:Journal article (JA) Publisher:Elsevier Ltd Abstract:This paper discusses preconditioned Krylov subspace methods for solving large scale linear systems that originate from oil reservoir numerical simulations. Two types of preconditioners, one being based on an incomplete LU decomposition and the other being based on iterative algorithms, are used together in a combination strategy in order to achieve an adaptive and efficient preconditioner. Numerical tests show that different Krylov subspace methods combining with appropriate preconditioners are able to achieve optimal performance. Number of references:30 Main heading:Numerical methods Controlled terms:Algorithms - Computer simulation - Iterative methods - Linear systems - Problem solving Uncontrolled terms:Black oil model - Effective linear solver - Krylov subspace methods - Preconditioner Classification code:723.5 Computer Applications - 921.6 Numerical Methods Treatment:Applications (APP); Theoretical (THR) DOI:10.1016/S0898-1221(02)00135-9 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 34> Accession number:2002397107854 Title:Linear temporal logic with clocks for verification of real-time systems Authors:Li, Guang-Yuan (1); Tang, Zhi-Song (1) Author affiliation:(1) Key Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Li, G.-Y. ({ligy,cst}@ios.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:1 Issue date:January 2002 Publication year:2002 Pages:33-41 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:In order to specify real-time systems, many temporal logics such as Timed Computation Tree Logic, Metric Interval Temporal Logic and Real-Time Temporal Logic have been proposed. Although these logics are good at specifying properties of real-time systems, they are not suitable for describing the implementations of such systems. Thus, the specifications and the implementations are usually described by different languages for real-time systems. A new linear temporal logic with clocks, called LTLC, is introduced. It is an extension of Manna and Pnueli's linear temporal logic. It can express both the properties and the implementations of real-time systems. With LTLC, systems can be described at many levels of abstraction, from high-level requirement specifications to low-level implementation models, and the conformance between different descriptions can be expressed by logical implication. This aspect of LTLC will be beneficial to the verification and the stepwise refinements of real-time systems. Number of references:14 Main heading:Real time systems Controlled terms:Automata theory - Clocks - Computer hardware description languages - Computer simulation - Formal logic - Mathematical models - Specifications - Time series analysis Uncontrolled terms:Implementation - Linear temporal logic - Logical implication - System description languages - Timed automata Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 921 Mathematics - 922.2 Mathematical Statistics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 35> Accession number:2003177450314 Title:Balanced tilling based out-of-core simplification Authors:Cai, Kang-Ying (1); Wang, Wen-Cheng (1); Fei, Guang-Zheng (2); Wu, En-Hua (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) MIRA Lab., Univ. of Geneva, Geneva, Switzerland; (3) Faculty of Sci. and Technol., Univ. of Macao, Macao, China Corresponding author:Cai, K.-Y. (cky@ios.ac.cn) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:25 Issue:9 Issue date:September 2002 Publication year:2002 Pages:936-944 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:All the existing adaptable out-of-core simplification algorithms need to scan the original model more than one time. So the algorithm efficiency is relatively lower comparing with uniform sampling approaches. This paper presents an adaptive clustering method, called Balanced Tiling (BT), for out-of-core simplification, which only needs one pass over the input model. The main idea behind BT is that the model surface can be recorded using surface coding and the global distribution of surface details can be obtained through quadric quantizing of the original model. The algorithm presented in this paper can position all types of detail areas, while some other out-of-core simplification approaches can only position feature edges. The detail areas will be restored while smooth areas will be further simplified. BT especially suits handling super large models because the I/O time is saved greatly. The memory requirement is small, which is only related with the size of the output model. Abstract type:(Edited Abstract) Number of references:21 Main heading:Image processing Controlled terms:Cache memory - Input output programs - Mathematical models - Vector quantization Uncontrolled terms:Adaptive cluster split - Cluster split - One pass - Quadric quantization - Surface coding Classification code:722.1 Data Storage, Equipment and Techniques - 723.3 Database Systems - 921 Mathematics Treatment:Applications (APP); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 36> Accession number:2002417130313 Title:Wipe transition detection method in MPEG compressed domain Authors:Liu, Yang (1); Wu, Zhi-Mei (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Liu, Y. Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:30 Issue:5 Issue date:May 2002 Publication year:2002 Pages:741-744 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Now many video segmentation algorithms can detect cuts efficiently, but the detection of gradual transitions is left as a challenge, which is becoming a new active research region. A new wipe transition detection method in MPEG compressed domain is presented based on the spatio-temporal distribution of the macroblock coding types in B frames and P frames. Hough transform is utilized to analyze the continuity of change regions. At last, the histogram analysis of DC-image is used to reconfirm the detection. This method can get not only the beginning and end frame number of the wipe transition, but also the transition patterns, such as the wipe direction. It requires less calculations and can distinguish wipes from other transition types and motions in some cases. Number of references:9 Main heading:Image segmentation Controlled terms:Algorithms - Hough transforms - Image coding - Image compression Uncontrolled terms:Gradual transitions - Macroblock coding - MPEG compressed domain - Wipe detection Classification code:723 Computer Software, Data Handling and Applications - 741.1 Light/Optics - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 37> Accession number:2002447167356 Title:Goal-based approach for process instance evolution Authors:Chen, Cheng (1); Gu, Yu-Qing (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Chen, C. (chen_goodwin@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:8 Issue date:August 2002 Publication year:2002 Pages:1345-1351 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Process is long-lived, distributed, heterogeneous, and always evolutive to cope with unforeseen environment. In this paper, an approach for process instance evolution is proposed, which is a formal approach that focuses on ensuring the goal-based behavior consistency between the evolved process instance and the original instance in order to avoid ad-hoc change of process model. The goal is regarded as the criterion of behavior consistency, so evolved process instance needs to be analyzed in formal methods to ensure that it can still achieve its goals. Through specifying the semantics of process model and goals as Bu&die;chi automaton, whether an executing process instance can achieve its goals or not can be decided. Number of references:9 Main heading:Process engineering Controlled terms:Computer programming languages - Constraint theory - Mathematical models - Software engineering Uncontrolled terms:Evolution - Process instance Classification code:723.1 Computer Programming - 913.1 Production Engineering - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 38> Accession number:2002397108453 Title:Timed bisimulation over timed symbolic transition graph Authors:Chen, Jing (1); Lin, Hui-Min (1) Author affiliation:(1) Lab. for Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Chen, J. Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:25 Issue:2 Issue date:February 2002 Publication year:2002 Pages:113-121 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:A new modeling language, Timed Symbolic Transition Graph(TSTG), is introduced, which can characterize both real-time and value-passing systems. An algorithm checking the timed bisimulation between TSTGs is presented. Traditionally, Labeled Transition System (LTS) is used to characterize the behavior of systems with states connected by directed edges labeled by some actions. Since LTSs do not contain variables, they are not suitable for explicit manipulation of data transfer between systems. TSTG is used to model value-passing processes where processes can communicate with each other by exchanging messages (data) via channels. Another capability of TSTG is that it can model real-time processes. To model the behavior of real-time processes, it uses some clock variables with values ranging over non-negative real numbers, where all the clocks will increment at the same speed in order to model time elapse. As value-passing systems and real-time systems are studied separately generally, TSTG is the first modeling language which can model such mixed systems under the unified framework. Bisimulation checking is a very important method in automatic verification of software and hardware systems, where timed bisimulation is a kind of equivalence relation between real-time systems. An algorithm for the timed bisimulation checking between TSTGs together with its correctness proof also is presented. Number of references:19 Main heading:Parallel processing systems Controlled terms:Algorithms - Data transfer - Mathematical models - Real time systems Uncontrolled terms:Bisimulation - Concurrency - Time symbolic transition graph - Value passing Classification code:722.4 Digital Computers and Systems - 723.2 Data Processing and Image Processing - 921 Mathematics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 39> Accession number:2002487245710 Title:Formal analysis of Needham-Schroeder protocol Authors:Wang, Gui-Lin (1); Qing, Si-Han (1); Zhou, Zhan-Fei (3) Author affiliation:(1) State Key Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Cent. for Info. Security Technol., Chinese Acad. of Sci., Beijing 100080, China; (3) Dept. of Math., Nihon Univ., Tokyo 101-8308, Japan Corresponding author:Wang, G.-L. (glwang@ercist.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:SUPPL. Issue date:September 2002 Publication year:2002 Pages:86-92 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Authentication protocol is an important kind protocol in network environment, and formal analysis is the key method to guarantee its security properties. Needham-Schroeder shared-key protocol and its improvement are analyzed by using BAN logic. The research results show that the original protocol has only limited security, but the improvement achieves the expectative authentication goals. Number of references:12 Main heading:Security of data Controlled terms:Cryptography - Formal logic - Network protocols - Semantics Uncontrolled terms:Authentication protocols - Burrows Abadi and Needham logic - Formal analysis - Needham Schuroeder protocols - Reasoning rules - Shared keys 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 Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 40> Accession number:2002487244475 Title:Multimodal interaction system for children Authors:Li, Jie (1); Tian, Feng (1); Wang, Wei-Xin (1); Dai, Guo-Zhong (1) Author affiliation:(1) Lab. of Human-Comp. Interaction, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Li, J. (lijie@iel.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:9 Issue date:September 2002 Publication year:2002 Pages:1846-1851 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:A pen/speech multimodal interaction system for children is designed and implemented. The system contains an integration framework used to integrate the information input by children from pen and speech. Children can communicate with the computer in a natural way via the support of several pen/speech interaction techniques, which are defined by the system. Children can draw 3D scenes and creative animals through the use of pen and communicate with the scene and the entity via pen and speech detection. Number of references:7 Main heading:Interactive computer systems Controlled terms:Communication - Computer aided design - Gesture recognition - Light pens - Speech recognition Uncontrolled terms:Children - Creative animals - Interaction primitive - Interaction primitive tasks - Multimodal interaction systems - Pen/speech interaction techniques Classification code:716 Telecommunication; Radar, Radio and Television - 722.4 Digital Computers and Systems - 723.5 Computer Applications - 741.1 Light/Optics - 751.5 Speech Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 41> Accession number:2003127405601 Title:A UML extension of distributed system Authors:Dong, Ying (1); Li, Mingshu (1); Wang, Qing (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Shenyang, China Corresponding author:Dong, Y. (ying@intec.iscas.ac.cn) Source title:Proceedings of 2002 International Conference on Machine Learning and Cybernetics Abbreviated source title:Proc. of 2002 Internat. Conf. on Machine Learning and Cybernetics Volume:1 Issue date:2002 Publication year:2002 Pages:476-480 Language:English ISBN-10:0780375084 ISBN-13:9780780375086 Document type:Conference article (CA) Conference name:Proceedings of 2002 International Conference on Machine Learning and Cybernetics Conference date:November 4, 2002 - November 5, 2002 Conference location:Beijing, China Conference code:60774 Sponsor:Hebei University; IEEE systems, Man and Cybernetics technical Comm. on Cybernetics Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:UML is lack of the efficient support for the distributed feature. This paper provides an extension of UML to solve this problem. The extension changes Use Case Diagram to be active and multi-level for requirement engineering of distributed system, and adds the control of time and the support for complex message mechanism in order to model the distributed applications related with real-time and multimedia. The thoughts derived from the paper make progress in the software engineering over the Internet. Number of references:7 Main heading:Learning systems Controlled terms:Computational complexity - Computer aided software engineering - Computer simulation languages - Distributed computer systems - Finite automata - Multimedia systems - Quality of service - Real time systems - Requirements engineering - Time sharing systems Uncontrolled terms:Time automata - Unified modeling language Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722.4 Digital Computers and Systems - 723.1.1 Computer Programming Languages - 723.5 Computer Applications Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) DOI:10.1109/ICMLC.2002.1176800 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 42> Accession number:2002287011248 Title:Module placement with boundary constraints using O-tree representation Authors:Liu, Rui (1); Hong, Xianlong (1); Dong, Sheqin (1); Cai, Yici (1); Gu, Jun (1); Cheng, Chung-Kuan (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, China Corresponding author:Liu, R. (liurui@isdn.iscas.ac.cn) Source title:Proceedings - IEEE International Symposium on Circuits and Systems Abbreviated source title:Proc IEEE Int Symp Circuits Syst Volume:2 Issue date:2002 Publication year:2002 Pages:II/871-II/874 Language:English ISSN:02714310 CODEN:PICSDI Document type:Conference article (CA) Conference name:2002 IEEE International Symposium on Circuits and Systems Conference date:May 26, 2002 - May 29, 2002 Conference location:Phoenix, AZ, United states Conference code:59248 Sponsor:IEEE Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:The O-tree representation needs linear computation effort to generate a corresponding layout, and exhibits a smaller upper bound of possible configurations. This paper addresses the problem of handling boundary constraints in the context of O-tree representation. This problem is raised in some modules need to be placed on the boundary of chip so that they can connected to I/O pad. We derive several theory results and several polynomial methods to transform the O-tree into feasible one and guarantee the following compaction not to destroy the feasibility. We also design a simulated annealing based algorithm to explore much more solution space. The experiment results on benchmark are given. Number of references:5 Main heading:Integrated circuit layout Controlled terms:Algorithms - Computer aided design - Mathematical transformations - Polynomials - Simulated annealing - VLSI circuits Uncontrolled terms:Boundary constraints - Module placement - O tree representation Classification code:714.2 Semiconductor Devices and Integrated Circuits - 723.1 Computer Programming - 723.5 Computer Applications - 921.1 Algebra - 921.3 Mathematical Transformations - 921.6 Numerical Methods Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 43> Accession number:2002487245724 Title:Formal analysis of MTI A(0) protocol Authors:Wang, Gui-Lin (1); Qing, Si-Han (1) Author affiliation:(1) State Key Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Cent. for Info. Security Technol., Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wang, G.-L. (glwang@ercist.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:SUPPL. Issue date:September 2002 Publication year:2002 Pages:192-198 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:The design and formal analysis of authentication protocol is one key focus in the information security researching areas. MTI A(0) protocol and an improvement of it are analyzed by using SVO logic. The research results reveal that the original protocol can only achieve implicit key authentication, but the improvement completes the ideal authentication goals through the definite key authentication. Number of references:13 Main heading:Network protocols Controlled terms:Cryptography - Formal logic - Numerical analysis - Security of data Uncontrolled terms:Authentication protocols - Formal analysis - Key authentication - MTI A(O) protocols - SVO logic 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 - 921.6 Numerical Methods Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 44> Accession number:2004148102021 Title:A heuristic quasi-physical strategy for solving disks packing problem Authors:Wenqi, Huang (1); Yan, Kang (1) Author affiliation:(1) Theor. Computer Science Institute, School of Computer, Huazhong Univ. of Sci./Technology, Wuhan 430074, China; (2) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Yan, K. (kangyan1972@) Source title:Simulation Modelling Practice and Theory Abbreviated source title:Simul. Model. Pract. Theory Volume:10 Issue:3-4 Issue date:November 15, 2002 Publication year:2002 Pages:195-207 Language:English ISSN:1569190X Document type:Journal article (JA) Publisher:Elsevier Abstract:By elaborately simulating the movement of the smooth elastic disks in the container in the physical world, we can find the solution for the disks packing problem. This problem is a classical one that arises in many scientific and engineering fields, and it is also one of the NP hard problems. Based on the simulated annealing, i.e., imitating the displacements of the objects under different temperature, the calculation speed is improved. The performance of the algorithm is demonstrated by actual calculations. &copy; 2002 Elsevier Science B.V. All rights reserved. Number of references:35 Main heading:Disks (structural components) Controlled terms:Algorithms - Computer simulation - Elasticity - Engineering research - Heuristic programming - Packing - Problem solving - Simulated annealing Uncontrolled terms:NP hard - Packing problem - Quasi-physical methods Classification code:901.3 Engineering Research - 723.5 Computer Applications - 723.4 Artificial Intelligence - 723.1 Computer Programming - 537.1 Heat Treatment Processes - 421 Strength of Building Materials; Mechanical Properties - 408.2 Structural Members and Shapes Treatment:Theoretical (THR) DOI:10.1016/S1569-190X(02)00099-0 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 45> Accession number:2004148097108 Title:An Approach of Heterogeneous Database Replication Authors:Zhe, Jing (1); Sun, Yufang (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Zhe, J. (jzhe@sonata.iscas.ac.cn) Source title:Proceedings of the Joint Conference on Information Sciences Abbreviated source title:Proc. Jt. Conf. Inf. Sci. Volume:6 Monograph title:Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002 Issue date:2002 Publication year:2002 Pages:407-411 Language:English ISBN-10:0970789017 ISBN-13:9780970789013 Document type:Conference article (CA) Conference name:Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002 Conference date:March 8, 2002 - March 13, 2002 Conference location:Research Triange Park, NC, United states Conference code:63045 Sponsor:Association for Intelligent Machinery; Information Sciences Journal; Duke University; Tamkang University Publisher:Duke University/Association for Intelligent Machinery Abstract:Database replication is a key technique that often used in distributed environments. To deal with the increasing heterogeneous database replication demands, this paper proposes a framework named 2345. Two objects (Publication and Subscription) are firstly abstracted. Based on them, the framework is divided into 3 layers (the Connection Layer, the Implementation Layer and the Application Layer), and 4 components (Capturing Manager, Distributing Manager, Synchronize Manager and Conflict Manager) are defined in the core layer. Thus 5 advantages (Fully Heterogeneous, All-round function, easy to Transplant and Expand, Better Performance) are achieved. A prototype based on 2345 is developed to prove the contributions. Number of references:9 Main heading:Database systems Controlled terms:Data warehouses - Electronic commerce - Embedded systems - Internet - Mobile computing - Personal digital assistants - Software prototyping - Systems analysis Uncontrolled terms:Abstraction - Database replication - Frameworks - Heterogeneous databases - Multi-layer components Classification code:722 Computer Systems and Equipment - 723.1 Computer Programming - 723.3 Database Systems - 723.5 Computer Applications - 912.3 Operations Research Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 46> Accession number:2002457184665 Title:A CSP and Z combined modeling of document exchange processes in e-commerce protocols Authors:Wang, Xu (1); Cheung, Shing-Chi (2); Wei, Jun (3) Author affiliation:(1) Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford OX1 3QD, United Kingdom; (2) Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong; (3) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Wang, X. (xu.wang@comloab.ox.ac.uk) Source title:Information and Software Technology Abbreviated source title:Inf Software Technol Volume:44 Issue:14 Issue date:November 1, 2002 Publication year:2002 Pages:875-889 Language:English ISSN:09505849 CODEN:ISOTE7 Document type:Journal article (JA) Publisher:Elsevier Abstract:E-commerce protocols comprise a vital component of the trading infrastructure over the Internet. Effectiveness and reliability of trading transactions likely depend on the quality of such protocols. However, building a quality e-commerce protocol may be more difficult than traditional protocols, as they are deployed in an open environment and data context-dependent. Application of formal methods has been suggested by many researchers as a viable approach for improving the reliability of software systems. But, can formal methods really help with the current crop of e-commerce protocols? As such, this paper made a study to formally formulate e-commerce protocols and identify their key features. A formal approach for modeling e-commerce protocols in a language combined of CSP and Z is developed. Compared to other works in formal modeling and analysis of e-commerce protocols, our approach concentrates on the XML document exchange processes of the protocols, which are a central part of most e-commerce protocols. The approach is illustrated by applying it to the Internet Open Trading Protocol, a trading protocol recommended by the Internet Engineering Task Force. The illustration demonstrates how the quality of a trading protocol can be improved through formalization. &copy; 2002 Elsevier Science B.V. All rights reserved. Number of references:44 Main heading:Computer aided software engineering Controlled terms:Computer programming languages - Data transfer - Electronic commerce - Network protocols - XML Uncontrolled terms:Document exchange processes Classification code:723.1 Computer Programming - 723.1.1 Computer Programming Languages - 723.2 Data Processing and Image Processing - 723.5 Computer Applications Treatment:Theoretical (THR) DOI:10.1016/S0950-5849(02)00121-0 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 47> Accession number:2002427144934 Title:New model and scheduling protocol for transactional workflows Authors:Ding, Ke (1); Jin, Beihong (1); Wei, Jun (1); Feng, Yulin (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, 100080, China Corresponding author:Ding, K. (dingke@otcaix.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:2002 Publication year:2002 Pages:920-927 Language:English ISSN:07303157 CODEN:PSICD2 Document type:Conference article (CA) Conference name:26th Annual International Computer Software and Applications Conference Conference date:August 26, 2002 - August 29, 2002 Conference location:Oxford, United kingdom Conference code:59851 Sponsor:IEEE Computer Society Publisher:Institute of Electrical and Electronics Engineers Computer Society 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 transactional workflow may be not well-formed. Moreover, only one workflow is allowed to execute a non-compensatable transaction with current scheduling protocol. In this paper, we present a transactional workflow model and formally define the correctness criteria of transactional workflow structure (well-formedness) and execution (serializability). We then propose an efficient method for well-formedness validation through a set of computation rules. Finally a scheduling protocol based on two kinds of locking granularities is presented. The protocol is different from related research in the fine-grained locking on transaction instances and coarse-grained locking on transaction classes, multiple workflows are therefore allowed to execute non-compensatable transactions if they are not conflict in predicated future execution. Number of references:10 Main heading:Network protocols Controlled terms:Computer architecture - Distributed computer systems - Java programming language - Scheduling Uncontrolled terms:Scheduling protocol - Transactional workflow Classification code:722.4 Digital Computers and Systems - 723.1 Computer Programming - 723.5 Computer Applications - 912.2 Management Treatment:Applications (APP) DOI:10.1109/CMPSAC.2002.1045123 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 48> <RECORD 1> Accession number:2002487244390 Title:Polygon splatting for multiple viewpoint rendering Authors:Sun, Qing-Jie (1); Wang, Wen-Cheng (1); Wu, En-Hua (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Faculty of Sci. and Technol., Univ. of Macau, Macau, China Corresponding author:Sun, Q.-J. (sqj@ios.ac.cn) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:25 Issue:7 Issue date:July 2002 Publication year:2002 Pages:737-746 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:This paper presents a new method for multiple viewpoint rendering to employ perspective coherence, which allows the viewpoint to be placed freely in the 3D space. At first, it creates an intermediate construct referred to as polygon splat for every polygon in the scene, which consists of a set of stripes, line segments parallel to the image plane and extracted from the polygon. As some linear relations between a stripe and its perspective projection with the viewpoint movement can be derived, polygons can be rendered stripe by stripe instead of the pixel-by-pixel manner used in the conventional scan conversion method, which greatly reduce the average cost for the ray cast from a pixel to intersect a polygon. For view independent shading and texture, they can be pre-computed and stored in the stripes to be reused to render high quality images by image-based rendering techniques to save a large amount of on-line shading and texture mapping calculations. In rendering, the farther the polygon is from the viewpoint, the fewer the stripes of the polygon are selected to represent the polygon. Thus, the new method can automatically implement the level-of-detail rendering without constructing many models of different levels of details. From experimental results, the new method is several times faster than the conventional scan conversion method for multiple viewpoint rendering. As the new method only aims to replace the scan conversion method in the rendering pipeline, it is easy to integrate with other efficient rendering methods such as visibility determination and shading methods to further improve the rendering efficiency. Also, the new method can be easily extended to render curve surfaces. Number of references:19 Main heading:Virtual reality Controlled terms:Computer vision Uncontrolled terms:Multiple viewpoint rendering - Perspective projection - Polygon splat - Stripe Classification code:723 Computer Software, Data Handling and Applications Treatment:Applications (APP); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 49> Accession number:2002307027947 Title:An adaptive sampling scheme for out-of-core simplification Authors:Fei, Guangzheng (1); Cai, Kangying (1); Guo, Baining (2); Wu, Enhua (1) Author affiliation:(1) Key Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences, No.4, Zhongguancunnan 4 Road, Beijing, 100080, China; (2) Microsoft Research Asia, 5/F, Beijing Sigma Center, No.49, Zhichun Rd., Haidian District, Beijing 100080, China; (3) Faculty of Science and Technology, University of Macao, Av. Padre Tom&#225;s Pereira S.J., Taipa, Macao, China Corresponding author:Fei, G. (fei@miralab.unige.ch) Source title:Computer Graphics Forum Abbreviated source title:Comput Graphics Forum Volume:21 Issue:2 Issue date:June 2002 Publication year:2002 Pages:111-119 Language:English ISSN:01677055 CODEN:CGFODY Document type:Journal article (JA) Publisher:Blackwell Publishing Ltd. Abstract:Current out-of-core simplification algorithms can efficiently simplify large models that are too complex to be loaded in to the main memory at one time. However, these algorithms do not preserve surface details well since adaptive sampling, a typical strategy for detail preservation, remains to be an open issue for out-of-core simplification. In this paper, we present an adaptive sampling scheme, called the balanced retriangulation (BR), for out-of-core simplification. A key idea behind BR is that we can use Garland's quadric error matrix to analyze the global distribution of surface details. Based on this analysis, a local retriangulation achieves adaptive sampling by restoring detailed areas with cell split operations while further simplifying smooth areas with edge collapse operations. For a given triangle budget, BR preserves surface details significantly better than uniform sampling algorithms such as uniform clustering. Like uniform clustering, our algorithm has linear running time and small memory requirement. Number of references:19 Main heading:Three dimensional computer graphics Controlled terms:Adaptive algorithms - Data acquisition - Data structures - Mathematical models - Matrix algebra - Sampling - Surfaces Uncontrolled terms:Adaptive sampling Classification code:723.2 Data Processing and Image Processing - 723.5 Computer Applications - 921 Mathematics - 921.1 Algebra Treatment:Theoretical (THR) DOI:10.1111/1467-8659.00571 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 50> Accession number:2003027308382 Title:Automated test case generation for the stress testing of multimedia systems Authors:Zhang, Jian (1); Cheung, S.C. (2) Author affiliation:(1) Laboratory of Computer Science, Inst. Software Chinese Acad. Sci., Beijing 100080, China; (2) Department of Computer Science, Hong Kong Univ. of Sci. and Technol., Clear Water Bay, Hong Kong, Hong Kong Corresponding author:Cheung, S.C. (scc@t.hk) Source title:Software - Practice and Experience Abbreviated source title:Software Pract Exper Volume:32 Issue:15 Issue date:December 2002 Publication year:2002 Pages:1411-1435 Language:English ISSN:00380644 CODEN:SPEXBL Document type:Journal article (JA) Publisher:John Wiley and Sons Ltd Abstract:With the advancement in network bandwidth and computing power, multimedia systems have become a popular means for information delivery. However, general principles of system testing cannot be directly applied to testing of multimedia systems on account of their stringent temporal and synchronization requirements. In particular, few studies have been made on the stress testing of multimedia systems with respect to their temporal requirements under resource saturation. Stress testing is important because erroneous behavior is most likely to occur under resource saturation. This paper presents an automatable method of test case generation for the stress testing of multimedia systems. It adapts constraint solving techniques to generate test cases that lead to potential resource saturation in a multimedia system. Coverage of the test cases is defined upon the reachability graph of a multimedia system. The proposed stress testing technique is supported by tools and has been successfully applied to a real-life commercial multimedia system. Although our technique focuses on the stress testing of multimedia systems, the underlying issues and concepts are applicable to other types of real-time systems. Number of references:37 Main heading:Multimedia systems Controlled terms:Automatic testing - Computer aided software engineering - Computer software selection and evaluation - Reliability - Resource allocation - Storage allocation (computer) Uncontrolled terms:Automated test case generation - Constraint solving - Resource consumption - Static analysis - Stress testing Classification code:722.1 Data Storage, Equipment and Techniques - 723.1 Computer Programming - 723.5 Computer Applications Treatment:Theoretical (THR) DOI:10.1002/spe.487 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 51> Accession number:2003177450315 Title:Combination of hierarchical visibility with level of detail terrain model Authors:Li, Sheng (1); Liu, Xue-Hui (1); Wang, Wen-Cheng (1); Wu, En-Hua (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Faculty of Sci. and Technol., Univ. of Macao, Macao, China Corresponding author:Li, S. (lishengvr@) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:25 Issue:9 Issue date:September 2002 Publication year:2002 Pages:945-952 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:Real-time rendering of large-scale terrain is one of the important subjects in virtual reality technology. This paper puts forward a fast terrain rendering algorithm that combines hierarchical visibility with level of detail model for terrain walk-through. The main idea of the algorithm is to make use of horizon characteristic of terrain to set up the corresponding block visibility structure for dynamic multi-resolution model in preprocessing stage. With the block visibility structure, the visibility of all terrain block can be quickly tested. Since the invisible terrain quads are culled, the number of triangles to be processed and rendered reduces heavily. At the same time, in order to eliminate the visibility error caused by terrain model changing in different level. This paper puts forward a hierarchical visibility computing method to revise the dynamic change on terrain model. The experimental result indicates efficiency of the algorithm. Number of references:14 Main heading:Virtual reality Controlled terms:Algorithms - Geographical regions - Models - Visibility Uncontrolled terms:Block culling - Hierarchical visibility - Horizon - Level of detail model - Occlusion region Classification code:723 Computer Software, Data Handling and Applications - 741.2 Vision - 921 Mathematics Treatment:Applications (APP); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 52> Accession number:2003137420516 Title:Research and implementation of enterprise computing model under distributed and heterogeneous environments Authors:Zhan, Min (1); Zuo, Chun (1); Sun, Yu-Fang (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhan, M. Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:30 Issue:11 Issue date:November 2002 Publication year:2002 Pages:1681-1684 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Enterprise computing focuses on seamless integration of critical applications under distributed and heterogeneous environments. Traditional enterprise computing models are top-down ones that are inconsistent with bottom-up interoperation requirements, This paper brings forward a novel model named UECM for enterprise computing which is based on the coordination of loose-coupled messages and peer-to-peer technology. It aims to provide a light-weighted, low-cost, robust and scalable infrastructure for interoperations among enterprise applications under heterogeneous, distributed and decentralized environment and better solve the problems of extensibility and server bottle-neck caused by traditional models. Number of references:7 Main heading:Computer architecture Controlled terms:Distributed computer systems - Enterprise resource planning - Information retrieval - Mathematical models - Network protocols Uncontrolled terms:Distributed heterogeneous environment - Information islands - Interoperations - Loose coupled messages - Peer to peer computing - System infrastructure - Universal enterprise computing models Classification code:716 Telecommunication; Radar, Radio and Television - 722 Computer Systems and Equipment - 723 Computer Software, Data Handling and Applications - 903.3 Information Retrieval and Use - 912.2 Management - 921 Mathematics Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 53> Accession number:2002457178727 Title:New audit-based intrusion detection model and its implement mechanism Authors:Liu, Hai-Feng (1); Qing, Si-Han (1); Meng, Yang (1); Liu, Wen-Qing (1) Author affiliation:(1) Inst. of Software, China Acad. of Sci., Beijing 100080, China Corresponding author:Liu, H.-F. Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:30 Issue:8 Issue date:August 2002 Publication year:2002 Pages:1167-1171 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Intrusion detection models based on system call sequence are discussed, and a new intrusion detection model based on audit event vector which is named AUDIDS is presented. This model has not only the merits of the previous IDS model but also richer semantics and higher efficiency. We describe its implementation mechanism on Linux which defines, collects and stores audit event and improves the storage and matching of normal database. Number of references:9 Main heading:Security of data Controlled terms:Database systems - Mathematical models - Semantics - Vectors Uncontrolled terms:Audit event vectors - Computer security - Intrusion detection - Linux - System call sequence Classification code:723 Computer Software, Data Handling and Applications - 903.2 Information Dissemination - 921 Mathematics Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 54> Accession number:2002477219056 Title:A history-based model of the enhanced Chinese Wall policy Authors:Zhao, Qingsong (1); Sun, Yufang (1); Liang, Hongliang (1); Zhang, Xiangfeng (1); Sun, Bo (1); Bi, Xiaodong (1) Author affiliation:(1) Institute of Software, The Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Zhao, Q. Source title:Chinese Journal of Electronics Abbreviated source title:Chin J Electron Volume:11 Issue:4 Issue date:October 2002 Publication year:2002 Pages:439-443 Language:English ISSN:10224653 CODEN:CHJEEW Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:The Chinese Wall security policy, identified and so named by Brewer and Nash, is an important commercial policy. Its basic idea is to prevent information flows that cause conflicts of interest for individual consultants. A history-based information flow control model for Chinese Wall security policy is presented in this paper. This model can more precisely and factually enforce Chinese Wall policy than other models. Number of references:9 Main heading:Security of data Controlled terms:Computer simulation - Data privacy - Database systems - Electronic commerce - Information retrieval - Recursive functions Uncontrolled terms:Chinese wall policy - History based model - Information flow control model - Lattice based access control model 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 - 723.5 Computer Applications Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 55> Accession number:2002487245732 Title:Two results of structure of feedforward inverse finite automata Authors:Yao, Gang (1) Author affiliation:(1) Key Lab. for Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Graduate Sch., Chinese Acad. of Sci., Beijing 100039, China Corresponding author:Yao, G. (yaogcrab@iso.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:SUPPL. Issue date:September 2002 Publication year:2002 Pages:252-258 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Feedforward inverse finite automata satisfy the condition of weakly error propagation limited in decoding, and it can be widely used in digital communication. The result of the structure of feedforward inverse finite automata with delay 1 is revised, and a form of structure of feedforward inverse finite automata with delay t is given in the situation that it is a c-order semi-input-memory finite automata where autonomous finite automaton is cyclic and the number if input alphabet set is equal to the number of output alphabet set. Number of references:8 Main heading:Finite automata Controlled terms:Calculations - Decoding - Digital communication systems - Matrix algebra - Theorem proving Uncontrolled terms:Alphabet sets - Autonomous finite automata - Error propagation - Feedforward inverse structure - Semi input memory Classification code:716 Telecommunication; Radar, Radio and Television - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722.3 Data Communication, Equipment and Techniques - 723.2 Data Processing and Image Processing - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 56> Accession number:2002487245699 Title:Information filtering domain-specific framework based on text Authors:Ruan, Tong (1); Jin, Bei-Hong (1); Feng, Yu-Lin (1) Author affiliation:(1) Key Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Ruan, T. (ruan@otcaix.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:SUPPL. Issue date:September 2002 Publication year:2002 Pages:7-11 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Text filtering involves feature extraction, text classification, and corpus selection. Both algorithms and architecture patterns affects the effectiveness of ultimate information filtering systems. To improve effectiveness and reusability of information filtering system, a domain specific information filtering framework called IFDF (information filtering domain-specific framework) is constructed, which is represented in UML. Then IFDF is extended with event-based interface. Three architecture patterns, namely MAPAP (multi-algorithm parallel architecture pattern), MARAP (multi-algorithm refiner architecture pattern) and EDFAP (event-driven feedback architecture pattern) are proposed. They can also be used in other algorithm-intensive applications. Number of references:6 Main heading:Information retrieval Controlled terms:Algorithms - Classification (of information) - Feature extraction - File organization - Text processing Uncontrolled terms:Architecture patterns - Domain specific framework - Event based interfaces - Event driven feedback patterns - Information filtering - Multi algorithms - Parallel patterns - Refine patterns Classification code:716.1 Information Theory and Signal Processing - 723.2 Data Processing and Image Processing - 723.5 Computer Applications - 903.3 Information Retrieval and Use - 921 Mathematics Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 57> Accession number:2002477223052 Title:Combining a fuzzy optimal model with a genetic algorithm to solve multi-objective rainfall-runoff model calibration Authors:Cheng, C.T. (1); Ou, C.P. (2); Chau, K.W. (3) Author affiliation:(1) Department of Civil Engineering, Dalian University of Technology, 116024 Dalian, China; (2) Intelligent Engineering Lab, Institute of Software, Chinese Academy of Sciences, 100080 Beijing, China; (3) Department of Civil and Structural Engineering, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong Corresponding author:Cheng, C.T. (ctcheng@dlut.edu.cn) Source title:Journal of Hydrology Abbreviated source title:J. Hydrol. Volume:268 Issue:1-4 Issue date:November 1, 2002 Publication year:2002 Pages:72-86 Language:English ISSN:00221694 CODEN:JHYDA7 Document type:Journal article (JA) Publisher:Elsevier Abstract:An automatic calibration methodology for the Xinanjiang model that has been successfully and widely applied in China is presented. The automatic calibration of the model consists of two parts: water balance parameter and runoff routing parameter calibration. The former is based on a simple genetic algorithm (GA). The latter is based on a new method which combines a fuzzy optimal model (FOM) with a GA for solving the multiple objective runoff routing parameters calibration problem. Except for the specific fitness where the membership degree of alternative obtained by FOM with limited alternatives and multi-objectives is employed, the GA with multiple objectives in this paper is otherwise the same as the simple GA. The parameter calibration includes optimization of multiple objectives: (1) peak discharge, (2) peak time and (3) total runoff volume. Thirty-four historical floods from 12 years in the Shuangpai Reservoir are applied to calibrate the model parameters whilst 11 floods in recent 2 years are utilized to verify these parameters. Results of this study and application show that the hybrid methodology of GAs and the FOM is not only capable of exploiting more the important characteristics of floods but also efficient and robust. &copy; 2002 Elsevier Science B.V. All rights reserved. Number of references:26 Main heading:Hydrology Controlled terms:Calibration - Floods - Genetic algorithms - Optimization - Rain - Runoff Uncontrolled terms:Fuzzy optimal models Classification code:921.5 Optimization Techniques - 902.2 Codes and Standards - 723 Computer Software, Data Handling and Applications - 444.1 Surface Water - 444 Water Resources - 443.3 Precipitation - 442.1 Flood Control Treatment:Theoretical (THR) DOI:10.1016/S0022-1694(02)00122-1 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 58> Accession number:2003087370170 Title:Specification and structure design of 3D interaction tasks Authors:Tian, Feng (1); Dai, Guo-Zhong (1); Chen, You-Di (1); Cheng, Cheng (1) Author affiliation:(1) Lab. of Human-Comp. Interaction, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Tian, F. (tf@iel_mail.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:11 Issue date:November 2002 Publication year:2002 Pages:2099-2105 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:This paper aims at 3D interaction task analysis and construction, summarizes interaction tasks in 3D interaction field, presents the integration process from basic interaction tasks to universal interaction tasks in 3D/VR application, and finally constructs a core toolkit which can be widely used in 3D interaction field. This core toolkit specifies the low level structure of 3D interaction. A set of interaction primitives, interaction tasks and the process about primitive creation and task integration are defined in it. It can be used as the low level platform in 3D UI toolkit, 3D UIMS or 3D/VR application development. Therefore programmer can just pay attention to the high level work such as interaction style construction. Number of references:11 Main heading:Interactive computer graphics Controlled terms:Computer aided software engineering - Specifications - Three dimensional - Virtual reality Uncontrolled terms:Core toolkits - Interaction tasks - Interaction tasks primitives - Structure design - Task integration Classification code:723 Computer Software, Data Handling and Applications - 902.2 Codes and Standards - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 59> Accession number:2002427142513 Title:Access multiple application servers by using once identity authentication Authors:Chang, Xiao-Lin (1); Feng, Deng-Guo (1); Qing, Si-Han (1) Author affiliation:(1) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Chang, X.L. (fengdg@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:6 Issue date:June 2002 Publication year:2002 Pages:1111-1116 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Various kinds of application service are used in corporation network; which provide security measures. It isn't convenient for users to use and for managers to manage limits of authority. Therefore, a set of once identity authentication system is designed and developed. The system can be well integrated with every application service, and it is convenient for users and managers under ensuring security. Number of references:5 Main heading:Electronic document identification systems Controlled terms:Client server computer systems - Cryptography - Local area networks - Management - Network protocols - Security of data Uncontrolled terms:Application servers - Corporation networks - Once pad - Proxy - Retransaction - Strong identity authentication Classification code:716 Telecommunication; Radar, Radio and Television - 722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 912.2 Management Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 60> Accession number:2002397116105 Title:Design of a modified BLP security model and its application to SecLinux Authors:Liu, Wen-Qing (1); Qing, Si-Han (1); Liu, Hai-Feng (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Liu, W.-Q. Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:4 Issue date:April 2002 Publication year:2002 Pages:567-573 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:A MBLP (modified BLP) security model is presented which is PAC (privileged access control) oriented. Some concepts such as role management, domain compartment, limitation of covert channels and defence of viruses, are introduced. MBLP is applied to SecLinux, which is a self-developed secure operating system by the authors. Abstract type:(Edited Abstract) Number of references:7 Main heading:Computer operating systems Controlled terms:Computer viruses - Management - Mathematical models - Security of data Uncontrolled terms:BLP models - Computer security - Covert channels - Domain compartment - MBLP security models - Privileged access control - Role management - Secure operating systems Classification code:722 Computer Systems and Equipment - 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 61> Accession number:2003357608507 Title:Gesture language use in natural UI: Pen- based sketching in conceptual design Authors:Ma, Cuixia (1); Dai, Guozhong (1) Author affiliation:(1) Hum. Comp. Interac./Intell. I.P.L., Institute of Software, Chinese Academy of Sciences, Beijing, China Corresponding author:Ma, C. (mcx@iel_mail.iscas.ac.cn) Source title:Proceedings of SPIE - The International Society for Optical Engineering Abbreviated source title:Proc SPIE Int Soc Opt Eng Volume:4756 Issue date:2002 Publication year:2002 Pages:122-128 Language:English ISSN:0277786X CODEN:PSISDG Document type:Conference article (CA) Conference name:Third International Conference on Virtual Reality and Its Application in Industry Conference date:April 9, 2002 - April 12, 2002 Conference location:Hangzhou, China Conference code:61339 Sponsor:China Society of Image and Graphics Publisher:SPIE Abstract:Natural User Interface is one of the important next generation interactions. Computers are not just the tools of many special people or areas but for most people. Ubiquitous computing<sup>1</sup> makes the world magic and more comfortable. In the design domain, current systems, which need the detail information, cannot conveniently support the conceptual design of the early phrase. Pen and paper are the natural and simple tools to use in our daily life, especially in design domain. Gestures are the useful and natural mode in the interaction of pen -based. In natural UI, gestures can be introduced and used through the similar mode to the existing resources in interaction. But the gestures always are defined beforehand without the users' intention and recognized to represent something in certain applications without being transplanted to others. We provide the gesture description language (GDL) to try to cite the useful gestures to the applications conveniently. It can be used in terms of the independent control resource such as menus or icons in applications. So we give the idea from two perspectives: one from the application-dependent point of view and the other from the application-independent point of view. Number of references:7 Main heading:Virtual reality Controlled terms:Computer software - Constraint theory - Gesture recognition - Hierarchical systems - Interfaces (computer) Uncontrolled terms:Gesture description language (GDL) Classification code:716 Telecommunication; Radar, Radio and Television - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722.2 Computer Peripheral Equipment - 723 Computer Software, Data Handling and Applications - 731.1 Control Systems Treatment:Theoretical (THR) DOI:10.1117/12.497751 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 62> Accession number:2003127405555 Title:The computational complexity of dynamic programming algorithm for combination auctions Authors:Hu, Shan-Li (1); Shi, Chun-Yi (2) Author affiliation:(1) Dept. of Computer Sci. and Technol., Fuzhou University, Fuzhou 350002, China; (2) Dept. of Computer Sci. and Technol., Tsinghua University, Beijing 100084, China; (3) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 10080, China Corresponding author:Hu, S.-L. (husl@fzu.edu.cn) Source title:Proceedings of 2002 International Conference on Machine Learning and Cybernetics Abbreviated source title:Proc. of 2002 Internat. Conf. on Machine Learning and Cybernetics Volume:1 Issue date:2002 Publication year:2002 Pages:266-268 Language:English ISBN-10:0780375084 ISBN-13:9780780375086 Document type:Conference article (CA) Conference name:Proceedings of 2002 International Conference on Machine Learning and Cybernetics Conference date:November 4, 2002 - November 5, 2002 Conference location:Beijing, China Conference code:60774 Sponsor:Hebei University; IEEE systems, Man and Cybernetics technical Comm. on Cybernetics Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Auctions are important mechanisms for resource and task allocation in multi-agent systems. Combinatorial auctions where bidders can bid on bundles of items can lead to more economical revenue. This is a winner determination problem. But determining the winners is NP-complete. Rothkopf et al presented a dynamic programming algorithm for this problem. It is an optimal algorithm found so far for the general case. In this paper we analyzes its computational complexity exactly, prove that the computational complexity of the algorithm is O(3<sup>n</sup>) for n items. Comparing with the result O(3<sup>n</sup>) of Rothkopf et al, it is more exact. This will help to research on the approximate algorithm for the winner determination problem in combinatorial auctions, and for the optimal coalition structure generation in multi-agent systems. Number of references:9 Main heading:Computational complexity Controlled terms:Algorithms - Constraint theory - Dynamic programming - Integer programming - Multi agent systems - Problem solving Uncontrolled terms:Combinatorial auctions - Winner determination problem Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 921.5 Optimization Techniques Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) DOI:10.1109/ICMLC.2002.1176753 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 63> Accession number:2003027311422 Title:Web application framework based on object view model WebView Authors:Zhang, Bo (1); Feng, Yu-Lin (1); Huang, Tao (1) Author affiliation:(1) Lab. for Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Software Eng. Technol. Cent., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhang, B. (zb@otcaix.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:10 Issue date:October 2002 Publication year:2002 Pages:1985-1990 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:By lack of suitable abstractions of the resource model, it is difficult to apply well-established software development methods to Web applications. An object view model WebView is outlined and the model is implemented in this paper as a Web application framework. WebView uses object view as a uniform concept to model Web entities. By using the model in designing, it can enhance reusability and productivity in the Web application development. Based on the available Web technologies, the Web application framework can map object views into the HTML format. Number of references:6 Main heading:World Wide Web Controlled terms:Distributed computer systems - HTML - Mathematical models - Web browsers Uncontrolled terms:Distributed computing - Object view models - Web application Classification code:716 Telecommunication; Radar, Radio and Television - 722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 921 Mathematics Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 64> Accession number:2002427142664 Title:Intelligent mobile agents-based architecture for network fault detection Authors:Zhang, Pu-Han (1); Sun, Yu-Fang (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhang, P.-H. (phzhang@sonata,iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:7 Issue date:July 2002 Publication year:2002 Pages:1209-1219 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:The increasing complexity of modern network motivates the development of different fault detection and isolation approaches for the purpose of supervision. Currently, packet monitoring is a standard technique in network fault detection, but when applied to a large-scale network it yields a high volume of packets. To overcome this problem, some techniques are proposed. However, the proposed techniques are based on popular SNMP agent and RMON technology, which are characterized by centralization, some inherent known problems are the lack of scalability, complexity to configure, network congestion and not strong local processing ability. This paper proposes a new method for fault detection and isolation based on intelligent mobile agents. To measure the impact on fault detection capability, a monitoring and fault detection experiment is successfully implemented, and the authors compare the number of symptoms detected and traffic of the system with a traditional system using RMON agents. Experimental results show that the fault detection capability using the proposed approach is significantly improved. Abstract type:(Edited Abstract) Number of references:15 Main heading:Telecommunication networks Controlled terms:Intelligent agents - Management - Monitoring - Network protocols Uncontrolled terms:Intelligent mobile agents - Internet control message protocols - Network fault detection - Network management - Symptom isolation Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer Software, Data Handling and Applications - 912.2 Management Treatment:Applications (APP); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 65> Accession number:2002397116154 Title:Specify and verify fault-tolerant systems in XYZ/E Authors:Guo, Liang (1); Tang, Zhi-Song (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. 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:13 Issue:5 Issue date:May 2002 Publication year:2002 Pages:913-920 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:To specify and verify fault-tolerant systems in XYZ/E is discussed. Based on the corresponding state transition system of an XYZ/E executable program P, how to model its fault environment F and obtain its fault affected program P<inf>F</inf> by fault transformation is illustrated. With P, F, P<inf>F</inf> and a recovery algorithm R, how to obtain the fault-tolerant program P<inf>F-R</inf> by fault tolerant transformation is also illustrated. Furthermore, two kinds of refinement relationships between programs P and Q, fault-tolerant refinement and backward-recovery refinement are defined. Based on these two refinement relationships, some properties satisfied program Q can be directly deduced from the specification of program P. Number of references:10 Main heading:Fault tolerant computer systems Controlled terms:Algorithms - Computer program listings - Computer programming languages - Mathematical models - Specifications - Theorem proving Uncontrolled terms:Fault environment - Fault tolerant transformation - Recovery algorithms - Refinement - State transition - Verification Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 902.2 Codes and Standards - 921 Mathematics Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 66> Accession number:2002397107856 Title:Developing a new dynamic scheduling algorithm for real-time multiprocessor systems Authors:Qiao, Ying (1); Wang, Hong-An (1); Dai, Guo-Zhong (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Qiao, Y. (qiaoyingbj@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:1 Issue date:January 2002 Publication year:2002 Pages:51-58 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Dynamic scheduling algorithms for real-time multiprocessor systems are important components of real-time systems. The most important metric for real-time scheduling algorithms is scheduling success ratio. Based on the traditional myopic algorithm, a new dynamic scheduling algorithm, called thrift algorithm, is proposed for real-time multiprocessor systems. In this algorithm, a new processor selection policy is developed to improve scheduling success ratio. To study the effectiveness of thrift algorithm, an intensive simulation study is made to analyze the impact of several task parameters on its scheduling success ratio and compare its performance to myopic algorithm. The simulation results show that the scheduling success ratio of our new scheduling algorithm is superior to that of myopic algorithm. Number of references:4 Main heading:Multiprocessing systems Controlled terms:Algorithms - Computer simulation - Mathematical models - Real time systems - Scheduling Uncontrolled terms:Backtracks - Dynamic scheduling - Multiprocessors - Myopic algorithms - Scheduling success ratio - Task parameters - Thrift algorithms 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 Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 67> Accession number:2002487245714 Title:Software process improvement system based on ISO9000 and CMM Authors:Li, Huai-Zhang (1); Li, Ming-Shu (1) Author affiliation:(1) Lab. for Internet Software Technol., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Li, H.-Z. (hzli@intec.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:SUPPL. Issue date:September 2002 Publication year:2002 Pages:113-119 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:By studying on software quality management technologies, a model of software production line and a five-layers software process improvement system are put forward for Chinese software organizations, which consists of organization role, process control, technology realization, process assets management and measurement and analysis. In which process control layer is studied as the most important part. Through studying on setup and maintenance of organization standard software process, organization process tailoring guide and software production activity class element, method of definition of the software production process is brought out. Number of references:15 Main heading:Software engineering Controlled terms:Computer supported cooperative work - Management - Measurements - Process control - Process engineering - Quality control - Standards Uncontrolled terms:Capability of muturity model - ISO9000 standards - Process tailoring guides - Software process definition - Software process improvement - Software production lines - Software quality management Classification code:723.1 Computer Programming - 723.5 Computer Applications - 902.2 Codes and Standards - 912.2 Management - 913.1 Production Engineering - 913.3 Quality Assurance and Control Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 68> Accession number:2003197463098 Title:Transmutative Rijndael with the differential and statistical characteristics Authors:Feng, Guo-Zhu (1); Li, Chao (1); Duo, Lei (1); Xie, Duan-Qiang (1); Dai, Qing-Ping (1) Author affiliation:(1) Dept. of Math. and Syst Sci., Natl. Univ. of Defense Technol., Changsha 410073, China; (2) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Feng, G.-Z. Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:30 Issue:10 Issue date:October 2002 Publication year:2002 Pages:1544-1546 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Rijndael is an interative classification code algorithm which is composed of four layers including byte substitution, line displacement conversion, mix columm conversion and ring key conversion. The Rijndael primary algorithm was improves. The new algorithm is better than the primary algorithm in that its key setup is little slower but is still secure against differential and truncated differential cryptanalysis. Its statistical effect is improved. It can counteract the square attack to some extent. Abstract type:(Edited Abstract) Number of references:6 Main heading:Cryptography Controlled terms:Algorithms - Probability - Security of data - Statistical methods Uncontrolled terms:Differential probability - Rijndael algorithm Classification code:716.1 Information Theory and Signal Processing - 921.6 Numerical Methods - 922.1 Probability Theory - 922.2 Mathematical Statistics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 69> Accession number:2002317040827 Title:Structure of weakly invertible semi-input-memory finite automata with delay 1 Authors:Tao, Renji (1); Chen, Shihua (1) Author affiliation:(1) Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Tao, R. (trj@gat.ios.ac.cn) Source title:Journal of Computer Science and Technology Abbreviated source title:J Comput Sci Technol Volume:17 Issue:4 Issue date:July 2002 Publication year:2002 Pages:369-376 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:Semi-input-memory finite automata, a kind of finite automata introduced by the first author of this paper for studying error propagation, are a generalization of input-memory finite automata by appending an autonomous finite automaton component. In this paper, we give a characterization of the structure of weakly invertible semi-input-memory finite automata with delay 1, in which the state graph of each autonomous finite automaton is a cycle. From a result on mutual invertibility of finite automata obtained by the authors recently, it leads to a characterization of the structure of feedforward inverse finite automata with delay 1. Number of references:28 Main heading:Finite automata Controlled terms:Computer simulation - Cryptography - Decoding - Error correction - Graph theory - Inverse problems - Matrix algebra - Set theory Uncontrolled terms:Error propagation - Semi-input-memory finite automata Classification code:921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 921.1 Algebra - 921 Mathematics - 723.5 Computer Applications - 723.2 Data Processing and Image Processing - 723 Computer Software, Data Handling and Applications - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 716.1 Information Theory and Signal Processing - 716 Telecommunication; Radar, Radio and Television Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 70> Accession number:2003087370171 Title:Refinement from Z specification to parallel program Authors:Wan, Jian-Yi (1); Sun, Yong-Qiang (1); Xue, Jin-Yun (2) Author affiliation:(1) Dept. of Comp. Sci. and Eng., Shanghai Jiaotong Univ., Shanghai 200030, China; (2) Dept. of Comp. Sci., Jiangxi Normal Univ., Nanchang 330027, China; (3) Lab. for Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wan, J.-Y. (jywan820@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:11 Issue date:November 2002 Publication year:2002 Pages:2106-2111 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:A method of getting parallel program from Z specification through refinement of design patterns is proposed. It expands parallel concepts into Z notation. Beginning with Z functional specification, it refines expanded design patterns step by step to get parallel design, and succeeds in obtaining abstract parallel program through semantic-preserving transformations, which can be transformed to parallel code finally. This method is described in detail through an example. Abstract type:(Edited Abstract) Number of references:10 Main heading:Parallel processing systems Controlled terms:Codes (symbols) - Computer program listings - Design - Fourier transforms - Mathematical models - Semantics - Specifications Uncontrolled terms:Design patterns - Parallel codes - Parallel program development - Refinement methods - Semantic preserving transformations - Z specification Classification code:722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 902.2 Codes and Standards - 903.2 Information Dissemination - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 71> Accession number:2002497255527 Title:Improvement of Shoup's threshold RSA signature scheme Authors:Wang, Gui-Lin (0); Qing, Si-Han (0); Wang, Ming-Sheng (0) Corr. author affiliation:Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:39 Issue:9 Issue date:September 2002 Publication year:2002 Pages:1046-1050 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Science Press Abstract:Threshold signature is the generalization of general digital signature, in which the signature is generated under the cooperation of certain members and verified only using the public key of the group. At Eurocrypt'2000, Shoup proposed a practical threshold RSA signature scheme. Shoup's scheme is improved such that the improved scheme has the same security and more efficient performance when compared with the original scheme. Furthermore, this improved scheme can be generalized to the threshold undeniable signature environment. Number of references:22 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 72> <RECORD 1> Accession number:2003027311419 Title:Low-cost automatic data hoarding algorithm for mobile environment Authors:Zhou, Huan (1); Li, Jing (1); Feng, Yu-Lin (1) Author affiliation:(1) Lab. for Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Software Eng. Technol. Cent., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhou, H. (quan@otcaix.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:10 Issue date:October 2002 Publication year:2002 Pages:1962-1968 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Disconnected operation is a challenging issue in mobile computing. Data hoarding is the process of prefetching important data into local cache for future operation. The result of hoarding process will dramatically affect the performance of disconnected operation. A low-cost general hoarding algorithm is introduced to exploit relationship among the data items simultaneously when processing data requests and to select data for hoarding automatically. Simulation results show that this algorithm effectively improves cache hit rate in disconnected operation. And it is especially applicable for handheld mobile devices with low storage capacity and slow computing speed. Number of references:9 Main heading:Mobile computing Controlled terms:Algorithms - Cache memory - Computational complexity - Computer simulation - Data processing - Probability Uncontrolled terms:Data hoarding - Disconnected operation - Handheld mobile devices - Probability graphs Classification code:716 Telecommunication; Radar, Radio and Television - 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 - 921 Mathematics - 922.1 Probability Theory Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 73> Accession number:2002487244386 Title:Filled function method for the traveling salesman problem Authors:Zhu, Wen-Xing (1); Fu, Qing-Xiang (1) Author affiliation:(1) Dept. of Comp. Sci. and Technol., Fuzhou Univ., Fuzhou 350002, China; (2) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhu, W.-X. (wxzhu@fzu.eu.cn) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:25 Issue:7 Issue date:July 2002 Publication year:2002 Pages:701-707 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:This paper presents a local search method based on a filled function transformation method. Given a current best local minimal solution of the TSP, the filled function transformation method converts the TSP into a combinatorial optimization problem with the same solution space, but with less number of local minimal solutions. The combinatorial optimization problem has only one prescribed local minimal solution in the solution space where the length of any tour of the TSP is larger than that of the current best local minimal solution of the TSP. Moreover, a local minimal solution of the combinatorial optimization problem is either the prescribed local minimal solution, or else, is a strictly better local minimal solution of the TSP than the current best solution. Then the well-known 3-opt algorithm is used to solve the combinatorial optimization problem to find a better local minimal solution of the TSP. If a better local minimal solution of the TSP is found, then a new combinatorial optimization problem is constructed using the filled function transformation method, and the 3-opt algorithm is applied to solve it again. This method is tested by some standard test instances, and the method presented in this paper is more efficient and more effective than the 3-opt algorithm for the TSP. It is easy to use, and can be directly generalized to solve other NP-hard combinatorial optimization problems. Number of references:10 Main heading:Traveling salesman problem Controlled terms:Algorithms - Approximation theory - Optimization Uncontrolled terms:Approximate solution - Filled function transform - Local searching Classification code:723 Computer Software, Data Handling and Applications - 921.5 Optimization Techniques - 921.6 Numerical Methods Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 74> Accession number:2002487245709 Title:Signal enhancement with matching pursuit Authors:Zhang, Wen-Yao (1); Xu, Gang (1); Wang, Yu-Guo (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhang, W.-Y. (zhwenyao@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:13 Issue:SUPPL. Issue date:September 2002 Publication year:2002 Pages:80-85 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Signal enhancement with matching pursuit was studied when the statistical property of signal and noise was unknown. Matching pursuit is an algorithm that adaptively decomposes signal. By tracing and analyzing the procedure of matching pursuit, a point where optimal noise reduction can be obtained was found, which had some relation to the coherent ratio of residual signal. With the help of this point and some experiment, a threshold of coherent ratio was determined to adaptively reduce the noise of signal. Finally, the results of the method were compared with those of wavelet de-noising by soft-thresholding. The experiment showed that the method can efficiently enhanced signal, and its enhancement effect is better than that of wavelet de-noising in a rather wide range. Owning to the independence of the statistical property of signal and noise, this method can adapt to many applications. Number of references:8 Main heading:Signal processing Controlled terms:Algorithms - Noise abatement - Optimization - Signal to noise ratio - Statistical methods - Threshold logic Uncontrolled terms:Coherent ratio - Matching pursuit - Optimal noise reduction points - Signal enhancement - Wavelet denoising Classification code:716.1 Information Theory and Signal Processing - 721 Computer Circuits and Logic Elements - 921.5 Optimization Techniques - 922.2 Mathematical Statistics Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 75> Accession number:2003027308400 Title:A graphical &mu;-calculus and local model checking Authors:Lin, Huimin (1) Author affiliation:(1) Laboratory for Computer Science, Institute of Software, The Chinese Academy of Sciences, P.O. Box 8718, Beijing 100080, China Corresponding author:Lin, H. (lhm@ios.ac.cn) Source title:Journal of Computer Science and Technology Abbreviated source title:J Comput Sci Technol Volume:17 Issue:6 Issue date:November 2002 Publication year:2002 Pages:665-671 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:A graphical notation for the propositional &mu;-calculus, called modal graphs, is presented. It is shown that both the textual and equational presentations of the &mu;calculus can be translated into modal graphs. A model checking algorithm based on such graphs is proposed. The algorithm is truly local in the sense that it only generates the parts of the underlying search space which are necessary for the computation of the final result. The correctness of the algorithm is proven and its complexity analysed. Number of references:9 Main heading:Computational methods Controlled terms:Algorithms - Computational complexity - Computational grammars - Computer simulation - Graph theory - Semantics - Set theory Uncontrolled terms:Local algorithms - Modal graphs - Model checking Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1 Computer Programming - 723.5 Computer Applications - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 76> Accession number:2003097373629 Title:Research on network based conceptual design Authors:Ma, Cuixia (1); Wang, Hongan (1); Dai, Guozhong (1) Author affiliation:(1) Intelligent Engineering Laboratory, Institute of Software, Chinese Academy of Sciences, P.O. Box 8718, Beijing 100080, China Corresponding author:Ma, C. (mcx@imd.cims.edu.cn) Source title:Proceedings of the International Conference on Computer Supported Cooperative Work in Design Abbreviated source title:Proc. Intern. Conf. on Comp. Supp. Coop. Work in Des. Issue date:2002 Publication year:2002 Pages:232-235 Language:English ISBN-10:0660184931 ISBN-13:9780660184937 Document type:Conference article (CA) Conference name:Proceedings of the Sixth Conference on Computer Supported Cooperative Work in Design Conference date:July 12, 2001 - July 14, 2001 Conference location:London, Ont., Canada Conference code:60583 Sponsor:NRC-CNRC; IEEE; Western University of Western Ontario; University of Waterloo Publisher:National Research Council Canada Abstract:Conceptual design has played very important role in the design process. Knowledge of all the design requirements and constraints during this early phase of a product's life cycle is usually approximate, imprecise, and unknown. Conceptual Design is now recognized as a highly important process when considering both the concurrent engineering aspects and the commitment of resources necessary to design and develop a product. With the development of the Internet, collaborative design is imperative and effective. The technology of CSCW is adopted widely and necessarily in the domain of the conceptual design. It can fit the nature of the design. It shortens the distance of designers in different places and collects and shares all the information in time. In the conceptual design, collaborative design mainly includes function, principle, layout and initial structure and so on. We developed a system of conceptual design based on the current CAD system, which could realize the seamless link with the later detail design. For the individual design, multi-modal technology, which integrates many interactions such as gesture and speech, supports an advanced interface to assist humans to develop the applications. Number of references:6 Main heading:Computer aided design Controlled terms:Database systems - Human computer interaction - Interfaces (computer) - Internet - Product design - Product development Uncontrolled terms:Conceptual designs Classification code:461.4 Ergonomics and Human Factors Engineering - 722.2 Computer Peripheral Equipment - 723.3 Database Systems - 723.5 Computer Applications - 913.1 Production Engineering Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 77> Accession number:2002477219060 Title:Cryptanalysis of Zodiac Authors:Wu, Wenling (1); Wu, Chuankun (1) Author affiliation:(1) Eng. Res. Ctr. Info. Secty. Technol., Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Wu, W. Source title:Chinese Journal of Electronics Abbreviated source title:Chin J Electron Volume:11 Issue:4 Issue date:October 2002 Publication year:2002 Pages:458-461 Language:English ISSN:10224653 CODEN:CHJEEW Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Zodiac&trade; and Zodiac&trade; 1.0 are two block ciphers proposed by SoftForum Incorporation. This paper studies the differential and linear characteristics of their S-boxes and round functions, and then gives cryptanalysis using with 2<sup>92</sup> data complexity and 2<sup>32</sup> processing complexity. This shows that the analysis is far more efficient than brute force attack, and hence concludes that is not immune against. This paper also shows how differential-linear cryptanalysis can be done on 14-round 1.0 with 2<sup>100</sup> data complexity. Number of references:5 Main heading:Cryptography Controlled terms:Algorithms - Approximation theory - Computational complexity - Computer software selection and evaluation - Digital arithmetic - Security of data - Vectors Uncontrolled terms:Block chippers - Differential linear cryptanalysis - Linear approximation - Software package Zodiac - Truncated differential cryptanalysis 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 - 921.1 Algebra - 921.6 Numerical Methods Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 78> Accession number:2003137420511 Title:Research and enforcement of enhanced Chinese Wall security policy Authors:Zhao, Qing-Song (1); Sun, Yu-Fang (1); Liang, Hong-Liang (1); Zhang, Xiang-Feng (1); Sun, Bo (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhao, Q.-S. Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:30 Issue:11 Issue date:November 2002 Publication year:2002 Pages:1658-1662 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Chinese Wall security policy (CWSP) is one of the most important security policies in commercial information area. But the CWSP proposed by Brewer and Nash can't fully meet the practical requirement. The role-based access control (RBAC), a policy neutral model, recently receives considerable attention as a most promising alternative to traditional discretionary access control (DAC) and mandatory access control (MAC) models. RBAC and the Chinese Wall security policies are given, and expanded due to the practical application. The RBAC-based method to expand CWSP is systematically discussed. Thus, the enhanced CWSP (ECWSP) is presented firstly. And then the method of configuring RBAC to enforce the ECWSP is systematically studied. Abstract type:(Edited Abstract) Number of references:11 Main heading:Security of data Controlled terms:Mathematical models - Network protocols - Theorem proving Uncontrolled terms:Commercial information - Enhanced Chinese Wall security policy - Policy neutral models - Role based access control Classification code:716 Telecommunication; Radar, Radio and Television - 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 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 79> Accession number:2002417130319 Title:Study and implementation of a multilevel file system in security kernel of OS Authors:Liu, Wen-Qing (1); Qing, Si-Han (1); Liu, Hai-Feng (1) Author affiliation:(1) Eng. Res. Cent. for Info. Security, Software Inst., Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Liu, W.-Q. Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:30 Issue:5 Issue date:May 2002 Publication year:2002 Pages:763-765 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:This paper presents a multilevel file system applicable to security kernel of operating system. It provides security policies and key techniques as well as analysis of security, compatibility and efficiency. The file system is implemented in the secure operating system SecLinux. Number of references:8 Main heading:Computer operating systems Controlled terms:File organization - Hard disk storage - Security of data Uncontrolled terms:Multilevel file systems - Secure operating systems - Security kernel - System compatibility Classification code:722 Computer Systems and Equipment - 723 Computer Software, Data Handling and Applications Treatment:Applications (APP); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. EI 2003 <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 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 Comput 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 sets 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 (distinguishing) 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> (close 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 problem; 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 Controlled 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 Theory, 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 Inc. <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 Acad. 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:54-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 loaded 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 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: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 scheduling 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 2003 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 parameters (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. For 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 scheduling, 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 type:(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 ratio - 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 Compilation 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:January 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, are 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 implemented 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:2003317580697 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 author: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:10009825 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 bijective 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 cryptanalysis - 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); Theoretical (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_hong@) 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 article (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 message 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 Uncontrolled 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:Applications (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); Feng, 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:JIXUDT 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 Controlled 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 Programming - 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. (hollace@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 practicable. 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-SUNSHINE Info. Automat. Co., Beijing 100088, China Corresponding author:Tan, W.-A. (twajsj@) Source title:Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS Abbreviated source title:Jisuanji Jicheng Zhizao Xitong Volume: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, enterprise 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 EPDOSTYLE="were introduced. 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 valued 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 Compilation 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 Res. 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, Proceedings 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 Communications 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 Publisher: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 protocols 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 characteristic 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 - Wireless 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 Processing - 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 2009 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:April 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 complexity 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 SEED 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 Applications - 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 search 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 strategy 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 Logic, 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) Database: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) Inst. 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 proposed. 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 also 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 Main 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 Information 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 algorithm 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 minimize 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 - Wavelet 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> Accession 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 Issue: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>, &mellip;, 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. Both 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 method 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 - Feature 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 Computer 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> Accession 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, China; (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 Chaoping 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 distances 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 analysis 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 Corresponding author:Feng, D.-G. (fengdg@) 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:10009825 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; conjectured 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 conjecture 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 generators - 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 Mathematics - 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@otcaix.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-125 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 Conference 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 variation 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 appropriate 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 references: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 Treatment: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@.cn) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:26 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 cryptanalysis. 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 shows 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 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 21> Accession number:2003257507916 Title:Decomposing 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. Sci., 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:10009000 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-finite-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, Switching 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 supporting 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 Abbreviated 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 interfaces 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 support 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 context 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 - Legacy 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 Computer 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, Copyright 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 Academy 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 backward 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 planes. 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 abandoned. 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 requirement 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 references: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 Classification 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> Accession 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 Corresponding 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:10009825 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 - Management - 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 Theory, 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 Elsevier 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 indexing 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 system 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 query 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:Extensible 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 indexing 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, Inst. 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 Mathematics 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 classical 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 overrelaxation 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 Sciences, Beijing 100080, China Corresponding author:He, Y.-C. (yuchengh@) 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) codes 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 quantization 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) - Computational 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 Title: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:2003 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 cryptanalysis 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:Algorithms - Approximation theory - Computational complexity - Security of data Uncontrolled terms:Linear approximation - Linear cryptanalysis - Nonlinear approximation - Nonlinear cryptanalysis 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 - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation 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@.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 some 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:Probabilistic 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 Theory 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, Beijing 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 number 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 strands 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 on 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 protocol 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 protocols 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 number: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-1450 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:China 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 WAN 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 unbiased 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 traditional 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:Congestion 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 Classification 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.1109/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 Telecommunications 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 Conference 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 Engineers 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 achieved. 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 of 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 Uncontrolled 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 method 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 Electronics 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 Abstract: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 level 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. Traditional 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 propagating 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:October 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 concept 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 systems - 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 - 723 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 novel 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: Neural 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 Neural Networks in Engineering Conference Conference date:November 2, 2003 - November 5, 2003 Conference location:St. Louis, MO., United states Conference code:62934 Sponsor:American Society of Mechanical Engineers, ASME Publisher:American Society of Mechanical Engineers Abstract:In this paper, a new reproduction strategy for Genetic Algorithms (GA) is proposed, and a novel GA with King reproduction strategy (King GA) is established. A new mutation operator is also proposed that helps to deal with the multi-modality of the fitness functions and performs search more efficiently than mutation operators from the literature. Experimental results show that King GA with the new mutation yields much faster convergence to the optimum than the traditional GA on a set of multi-modal and deceptive test functions. Number of references:6 Main heading:Mutagenesis Controlled terms:Chromosomes - Genetic algorithms - Genetic engineering - Mathematical models - Modal analysis - Optimization - RNA - Sensors Uncontrolled terms:Fitness functions - Genetic algorithms (GA) - Mutation operators - Sensor networks Classification code:461.2 Biological Materials and Tissue Engineering - 461.8.1 Genetic Engineering - 723 Computer Software, Data Handling and Applications - 921.5 Optimization Techniques Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 36> Accession number:2003477740789 Title:Scatternet scheduling algorithm in sniff mode for bluetooth ad hoc personal area networks Authors:Lin, Hong (1); Ding, Wen-Fang (2); Gao, Qiang (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Dept. of Comp. Sci. and Technol., Univ. of Sci. and Technol. Beijing, Beijing 100083, China Corresponding author:Lin, H. (honglin@) 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:1495-1502 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Bluetooth ad hoc personal area network is one independent wireless network composed of Bluetooth enabled mobile devices, which can freely communicate and collaborate with each other in some area without extra infrastructure. Some nodes in Bluetooth ad hoc personal area networks participate in multiple piconets in time division duplex and forward network traffic. It needs one inter-piconet or scatternet scheduling algorithm since at a time the node presents in only one of the piconets it participates. Sniff mode provides a flexible method to support inter-piconet scheduling scheme without protocol modification. A self-adaptive scatternet scheduling algorithm is presented based on sniff mode to efficiently deal with the challenging issue. According to the supervised dynamic traffic of the physical links, the algorithm adjusts in real time the allocation ratio of the node's time slots to its connected links. With the comparison and analysis of the results of the simulation in various flow models, it validates that the algorithm can enhance the throughput of the system, lower the delay of the system and then improve the performance of the network. Abstract type:(Edited Abstract) Number of references:12 Main heading:Wireless telecommunication systems Controlled terms:Algorithms - Computer simulation - Personal communication systems - Picocellular radio systems - Scheduling - Telecommunication links - Telecommunication traffic - Time division multiplexing Uncontrolled terms:Ad hoc networks - Bluetooth technology - Piconets - Scatternets - Scheduling algorithms - Sniff mode - Time slot allocation ratio Classification code:716 Telecommunication; Radar, Radio and Television - 717 Optical Communication - 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 37> Accession number:2003427680795 Title:The broadband residential ethernet access infrastructure: Architecture, service &amp; traffic mode, QoS provisioning and research issues Authors:Zhao, Zhuang (1); Liu, Qiong (1); Wu, Zhi-Mei (1) Author affiliation:(1) MCNERC, Institute of Software, Chinese Academy of Sciences, 3 P.O. Box 8718, Beijing, 100080, China Corresponding author:Zhao, Z. (zhuangzh@isdn.iscas.ac.cn) Source title:Proceeding of the International Conference on Telecommunications Abbreviated source title:Proc. Internat. Conf. Telecomm. Issue date:2003 Publication year:2003 Pages:267-276 Language:English ISBN-10:7505377027 ISBN-13:9787505377028 Document type:Conference article (CA) Conference name:Proceeding of the International Conference on Telecommunications 2002 Conference date:June 23, 2002 - June 26, 2002 Conference location:Beijing, China Conference code:61590 Publisher:Publishing House of Electronics Industy (PHEI) Abstract:A broadband Residential Ethernet access infrastructure supporting multiservice or full-service is presented. As such, multicasting mechanism is used to provide broadcast voice and video service such as audio, TV and interactive TV. This paper discusses network architecture, service &amp; traffic mode, QoS provisioning thoroughly. An evolving method to offer multiservice or full service in the braodband Residential Ethernet access networks is provided. Abstract type:(Edited Abstract) Number of references:51 Main heading:Local area networks Controlled terms:Broadband networks - Computer simulation - Internet - Multicasting - Quality of service - Telecommunication traffic - Telephone systems - Television systems Uncontrolled terms:Broadband residential ethernet access infrastructure - Multiservice - Plain old telephone service Classification code:716.1 Information Theory and Signal Processing - 716.4 Television Systems and Equipment - 718.1 Telephone Systems and Equipment - 723.5 Computer Applications Treatment:General review (GEN) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 38> Accession number:2003067352250 Title:Neuro-fuzzy adaptive control based on dynamic inversion for robotic manipulators Authors:Sun, Fuchun (1); Sun, Zengqi (1); Li, Lei (3); Li, Han-Xiong (4) Author affiliation:(1) Dept. of Comp. Sci. and Technology, State Key Lab Intell. Techno./Syst., Beijing 100084, China; (2) Robotics Laboratory, Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110015, China; (3) Institute of Software, Tsinghua University, Chinese Academy of Science, Beijing 100084, China; (4) Dept. of Mfg. Eng./Eng. Management, City University of Hong Kong, Hong Kong, Hong Kong Corresponding author:Sun, F. (sfc@s1000e.cs.tsinghua.edu.cn) Source title:Fuzzy Sets and Systems Abbreviated source title:Fuzzy Sets Syst Volume:134 Issue:1 Issue date:Febrary 16, 2003 Publication year:2003 Pages:117-133 Language:English ISSN:01650114 CODEN:FSSYD8 Document type:Journal article (JA) Publisher:Elsevier Abstract:This paper presents a stable neuro-fuzzy (NF) adaptive control approach for the trajectory tracking of the robotic manipulator with poorly known dynamics. Firstly, the fuzzy dynamic model of the manipulator is established using the Takagi-Sugeno (T-S) fuzzy framework with both structure and parameters identified through input/output data from the robot control process. Secondly, based on the derived fuzzy dynamics of the robotic manipulator, the dynamic NF adaptive controller is developed to improve the system performance by adaptively modifying the fuzzy model parameters on-line. The dynamic NF system aims to approximate the whole robot dynamics rather than its nonlinear components as is done by static neural networks. The dynamic inversion introduced for the controller design is constructed by the dynamic NF system and will help the NF controller design because it does not require the assumption that the robot states should be within a compact set. It is generally known that the compact set cannot be specified before the control loop is closed. Thirdly, the system stability and the convergence of tracking errors are guaranteed by Lyapunov stability theory, and the learning algorithm for the dynamic NF system is obtained thereby. Finally, simulation studies are carried out to show the viability and effectiveness of the proposed control approach. &copy; 2002 Elsevier Science B.V. All rights reserved. Number of references:23 Main heading:Robotics Controlled terms:Adaptive control systems - Approximation theory - Computer simulation - Error analysis - Fuzzy control - Learning algorithms - Manipulators - Neural networks - Trajectories Uncontrolled terms:Fuzzy clustering Classification code:723 Computer Software, Data Handling and Applications - 723.5 Computer Applications - 731.1 Control Systems - 731.5 Robotics - 921.6 Numerical Methods Treatment:Theoretical (THR) DOI:10.1016/S0165-0114(02)00233-6 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 39> Accession number:2004128075179 Title:Representing and verifying reactive systems with continuous-time temporal logic Authors:Li, Guang-Yuan (1); Tang, Zhi-Song (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Li, G.-Y. (ligy@ios.ac.cn) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:26 Issue:11 Issue date:November 2003 Publication year:2003 Pages:1424-1434 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:A continuous-time temporal logic, called LTLC, is introduced for the specification and verification of reactive systems. A distinguished feature of LTLC is that it can represent both reactive systems and their properties in one unified logic framework, so the satisfaction relation between systems and their properties can be expressed by logical implication. In addition, the use of non-negative real numbers as time domain enables us to express hiding of variables as standard existential quantification and express the relation of refinement between reactive systems as implications between logic formulas. This paper begins with a brief introduction to LTLC and then describes how it is used to represent and reason about reactive systems. Finally, a decidability result about LTLC is given. The result can be used for the automatic verification of finite-state reactive systems. Abstract type:(Edited Abstract) Number of references:11 Main heading:Logic programming Controlled terms:Computability and decidability - Real time systems Uncontrolled terms:Continuous time temporal logic - Fair transition systems - Reactive systems - Temporal logic - Verification Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 721.2 Logic Elements - 722.4 Digital Computers and Systems - 723.1 Computer Programming Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 40> Accession number:2003317580687 Title:Research on development tools for pen-based user interfaces Authors:Li, Yang (1); Guan, Zhi-Wei (1); Dai, Guo-Zhong (1) Author affiliation:(1) Intelligence Eng. Lab., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Li, Y. (yangli@) 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:392-400 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Pen-Based user interfaces provide more natural interactions for uers. However, it is difficult to be constructed because a usable pen-based user interface generally involves multiple areas and interdisciplinary knowledge. The design and implementation of a toolkit, named Penbuilder, is described systematically, supporting the development of pen-based user interfaces. It is designed based on the attributes of pen interaction and ubiquitous computing. It offers high-level supports to developers. Based on Penbuilder, several typical prototypes of pen interaction are constructed, which demonstrate the capability of Penbuilder for easy construction and fast-prototyping of pen-based user interfaces. Abstract type:(Edited Abstract) Number of references:17 Main heading:User interfaces Controlled terms:Computer aided software engineering - Design - Mathematical models - Semantics - Software prototyping Uncontrolled terms:Event models - Pen based user interfaces - Penbuilder toolkits Classification code:722 Computer Systems and Equipment - 723 Computer Software, Data Handling and Applications - 903.2 Information Dissemination - 921 Mathematics Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 41> Accession number:2004027814425 Title:Mobile multicast algorithm based on hierarchical architecture Authors:Sun, Li-Min (1); Liao, Yong (1); Zheng, Jian-Ping (1); Wu, Zhi-Mei (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Sun, L.-M. (slm@iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:14 Issue:9 Issue date:September 2003 Publication year:2003 Pages:1608-1614 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Mobile IPv6 offers two methods of multicast services for mobile host called remote subscription and home subscription, which have complementary advantages and shortcomings. An efficient mobile multicast protocol provided in this paper integrates remote subscription and home subscription. It uses a hierarchical route architecture, which reduces the frequency of rebuilding multicast tree because of hosts' mobility. The results of analysis and simulation are also given. Number of references:9 Main heading:Multicasting Controlled terms:Algorithms - Computer simulation - Data structures - Mathematical models - Mobile computing - Network protocols - Routers - Trees (mathematics) Uncontrolled terms:Hierarchical route architecture - Home subscription - Mobile IPv6 protocols - Mobile multicasting - Multicast trees - Remote subscription Classification code:716 Telecommunication; Radar, Radio and Television - 722.3 Data Communication, Equipment and Techniques - 723 Computer Software, Data Handling and Applications - 921 Mathematics Treatment:Applications (APP); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 42> Accession number:2003447707789 Title:Dynamic persistent object in ERP system Authors:Bian, Shi-Hong (1); Xue, Jin-Song (2); Song, Xue-Yan (3) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Shenyang Inst. of Automat., Chinese Acad. of Sci., Shenyang 110015, China; (3) Qingdao Etsong Tobacco Group, Qingdao 266021, China Corresponding author:Bian, S.-H. (bianshihong@) Source title:Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS Abbreviated source title:Jisuanji Jicheng Zhizao Xitong Volume:9 Issue:5 Issue date:May 2003 Publication year:2003 Pages:378-383 Language:Chinese ISSN:10065911 CODEN:JJZXFN Document type:Journal article (JA) Publisher:CIMS Abstract:With the development of enterprise management, the dynamic enterprise resource planning (ERP) software system becomes a hotspot. The dynamic persistent data, which are the basis of dynamic ERP, are studied. First, from the viewpoint of data structure, the persistent data are divided into the generalized table structure and the generalized recursion structure. Then the design thought that persistent objects are constructed based on the abstract data model is brought out. Finally a set of reusable persistent data access components are realized, which prove the feasibility of the thought that an abstract data model component is firstly constructed and bound dynamically with the concrete physical storage structure lately in the deployment phase. Through the study on the dynamic of persistent data, the structure problem of persistent objects and their uncertainty are solved, which enforce the flexibility of ERP systems. Number of references:4 Main heading:Enterprise resource planning Controlled terms:Computer software - Data structures - Software engineering Uncontrolled terms:Generalized recursion structure - Generalized table structure - Model view controller - Persistent objects Classification code:723.2 Data Processing and Image Processing - 723.5 Computer Applications - 912.2 Management Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 43> Accession number:2003287540859 Title:Reachability analysis on real-time value-passing systems Authors:Chen, Jing (1) Author affiliation:(1) Key Lab. for Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Chen, J. (cj@ios.ac.cn) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:26 Issue:1 Issue date:January 2003 Publication year:2003 Pages:19-25 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:Model checking is widely used in verification of hardware design and communication protocols. But because of state-explosion, model checking cannot solve problems with larger scale. Actually, many issues in model checking can be reduced to reachability checking, which means less time and less space involved since the task is simply to check whether the state we care is reachable or not. Thus this kind of algorithms is easy to maintain or optimize in practice, and is accepted widely in industry. An algorithm based on reachability analysis is presented and many useful properties ca be checked efficiently by it. The model used for systems is Timed Symbolic Transition Graph which can represent both real-time and value-passing under the same framework. Correspondingly a logic is presented for the algorithm to check the assertions concerning time, data and location. The correctness proof for the algorithm is also given. Abstract type:(Edited Abstract) Number of references:9 Main heading:Real time systems Controlled terms:Algorithms - Computer simulation - Mathematical models - Network protocols - Theorem proving Uncontrolled terms:Model checking - Reachability analysis - Timed symbolic transition graph - Value passing Classification code:716 Telecommunication; Radar, Radio and Television - 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 44> Accession number:2004108052688 Title:Priority inheritance protocol of non-exclusive mutex and its implementation under Linux Authors:Zhao, Hui-Bin (1); Li, Xiao-Qun (1); Sun, Yu-Fang (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhao, H.-B. 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:1145-1149 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Priority inheritance protocol is used to improve the scheduling precision of real time system with synchronization and exclusive requirements and hence increase the predictability of the behavior of an operating system. But the protocol and correspondent implementations do not involve non-exclusive mutex, such as reading lock. The paper gives rise to an algorithm of priority inheritance of non-exclusive mutex and analyzes the property of the protocol, on the basis of which an implementation under Linux is described. Number of references:8 Main heading:Computer operating systems Controlled terms:Network protocols Uncontrolled terms:Linux operating systems - Nonexclusive mutex - Preemtable kernel - Priority inheritance protocols Classification code:723 Computer Software, Data Handling and Applications Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 45> Accession number:2004058000395 Title:Shifted Chebyshev Collocation Domain Truncation for Solving Problems on an Infinite Interval Authors:Li, Huiyuan (1); Ma, Heping (1) Author affiliation:(1) Department of Mathematics, Shanghai University, Shanghai 200436, China; (2) RDCPS, Institute of Software, Chinese Academy of Sciences, P.O. Box 8718, Beijing 100080, China Corresponding author:Li, H. (hynli@mail.rdcps.ac.cn) Source title:Journal of Scientific Computing Abbreviated source title:J Sci Comput Volume:18 Issue:2 Issue date:April 2003 Publication year:2003 Pages:191-213 Language:English ISSN:08857474 CODEN:JSCOEB Document type:Journal article (JA) Publisher:Kluwer Academic/Plenum Publishers Abstract:The development of a shifted Chebyshev collocation (SCC) method for problems on an infinite interval with fast decaying solution using domain truncation strategy was discussed. It was found that the main function of method was to shift the narrow peaks of a fast decaying function to the endpoints neighbourhood of truncated domains. The quantification of the superiority of the SCC method over the pure Chebyshev domain truncation method was presented. The stability and accuracy of the SCC method were also elaborated. Abstract type:(Edited Abstract) Number of references:26 Main heading:Chebyshev approximation Controlled terms:Boundary conditions - Computer simulation - Error analysis - Fourier transforms - Polynomials - Problem solving Uncontrolled terms:Domain truncation - Shifted Chebyshev collocation (SCC) Classification code:723.4 Artificial Intelligence - 723.5 Computer Applications - 921 Mathematics - 921.1 Algebra - 921.3 Mathematical Transformations - 921.6 Numerical Methods Treatment:Theoretical (THR) DOI:10.1023/A:1021146530553 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 46> Accession number:2004158108967 Title:Analysis, design and implementation of client wireless transaction protocol Authors:Wang, Mao-Zhi (1); Xu, Ze-Yin (1); She, Chun-Dong (2) Author affiliation:(1) College of Information Management, Chengdu University of Technology, Chengdu, China; (2) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Wang, M.-Z. Source title:Journal of the Chengdu Institute of Technology Abbreviated source title:J. Chengdu Inst. Technol. Volume:30 Issue:4 Issue date:August 2003 Publication year:2003 Pages:396-403 Language:Chinese ISSN:10059539 CODEN:CLIXFB Document type:Journal article (JA) Publisher:Chengdu Institute of Technology Abstract:This paper discusses the function of client WTP in WAP stack and proposes a plan of design and implementation based on WIN32 environment. At the same time, it points out the critical technique during the design and implementation. The debug result shows that the software is stable and operative and corresponding to the protocol specification. This plan is a reference to protocol implementation based on WIN32 environment. Number of references:24 Main heading:Wireless telecommunication systems Controlled terms:Computer software - Network protocols - Program debugging - Software engineering Uncontrolled terms:Protocol implementation - Transaction protocol Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer Software, Data Handling and Applications - 723.1 Computer Programming Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 47> Accession number:2004118060675 Title:Survey on Web application servers Authors:Fan, Guo-Chuang (1); Zhong, Hua (1); Huang, Tao (1); Feng, Yu-Lin (1) Author affiliation:(1) Technol. Ctr. of Software Eng., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Fan, G.-C. (fanguo@otcaix.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:14 Issue:10 Issue date:October 2003 Publication year:2003 Pages:1728-1739 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Web application server (WAS), which is considered to be one of the most exciting milestones of enterprise software technology since the relational database and has become very popular in the last few years. It solves the problems in applying traditional middlewares to web computing environment and provides web middleware platforms that support for the deployment, integration, and execution of transactional web applications, Attention to the new category of middleware has been drawn from the academia and software industry. The current state-of-the-art of Web application servers, including what is a web application server and its functionality, architectural model, component container, transaction processing, load balancing, mid-tier caching, web services and analysis criteria etc., are outlined. Using the Ecperf benchmark, a comparative study among some leading Web application servers is presented by evaluating their functions and performance. Lastly, some open issues about WASs are discussed, and the future direction of WASs is pointed out. Number of references:62 Main heading:Servers Controlled terms:Cache memory - Computer architecture - Computer networks - Distributed computer systems - Middleware - Operations research - Performance - Quality of service Uncontrolled terms:Transactional Web application - Web computing - Web servers Classification code:722 Computer Systems and Equipment - 723 Computer Software, Data Handling and Applications - 912.3 Operations Research Treatment:General review (GEN) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 48> <RECORD 1> Accession number:2004108052952 Title:Application of strand space theory to formalization analyses of network protocol Authors:Sun, Hai-Bo (1); Lin, Dong-Dai (1); Huang, Ji-Hong (1) Author affiliation:(1) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Sun, H.-B. (sunhaibo@) Source title:Dalian Ligong Daxue Xuebao/Journal of Dalian University of Technology Abbreviated source title:Dalian Ligong Daxue Xuebao Volume:43 Issue:SUPPL. Issue date:October 2003 Publication year:2003 Pages:5-8 Language:Chinese ISSN:10008608 CODEN:DLXUEJ Document type:Journal article (JA) Publisher:Dalian University of Technology Abstract:With the popularization and development of network communication and especially the increasing requirement of secure protocol, because of the diversification of secure requirements and various attack techniques, people made higher request for the efficiency and the veracity of network protocol's formalization analyses. The previously available tools severely suffer from the state space explosion, which makes the analyses of massive complicated protocol difficult. Strand space theories supplies the method to avoid the state space explosion problem and improves the efficiency of formalization analysis. This paper utilizes some simple protocol to illuminate how to use strand space theory to analyze protocol effectively. Number of references:7 Main heading:Network protocols Controlled terms:Security of data - State space methods - Telecommunication networks Uncontrolled terms:Network formalization - Secure protocol - State space explosion - Strand space Classification code:716 Telecommunication; Radar, Radio and Television - 717 Optical Communication - 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 49> Accession number:2003397651655 Title:Security model for cryptographic protocols Authors:Liu, Yi-Wen (1); Li, Wei-Qin (1); Feng, Deng-Guo (2) Author affiliation:(1) Dept. of Comp. Sci. and Eng., Beijing Univ. of Aero. and Astron., Beijing 100083, China; (2) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Liu, Y.-W. (liuyw@buaa.edu.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:14 Issue:6 Issue date:June 2003 Publication year:2003 Pages:1148-1156 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:A cryptographic protocol together with its cryptographic algorithms is regarded as one system, and a security model for the system is built. Based on assume-guarantee compositional reasoning techniques, a new assume-guarantee based reasoning rule and algorithm are proposed, and the soundness of the rule is proved. In realizing model checking to the cryptographic protocol system, several difficulties are solved chiefly such as decomposition of the system, generation of assumed functions, and specifying security properties in forms of both logic formulas and processes. Using this security model and assume-guarantee based reasoning techniques, the Kerberos cryptographic protocol system is verified. Number of references:11 Main heading:Network protocols Controlled terms:Algorithms - Cryptography - Functions - Mathematical models - Security of data Uncontrolled terms:Assumed functions - Compositional reasoning - Cryptographic protocols - Model checking - Protocol verification - Security models Classification code:716 Telecommunication; Radar, Radio and Television - 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 50> Accession number:2003267520176 Title:An algorithm for the intersection of quadrilateral surfaces by tracing of neighbours Authors:Lo, S.H. (1); Wang, W.X. (2) Author affiliation:(1) Dept. of Civil/Structural Eng., The University of Hong Kong, Pokfulum Road, Hong Kong, Hong Kong; (2) Sino Software Group, Institute of Software, Chinese Academy of Sciences, Beijing, China Corresponding author:Lo, S.H. (hreclsh@hkucc.hku.hk) Source title:Computer Methods in Applied Mechanics and Engineering Abbreviated source title:Comput. Methods Appl. Mech. Eng. Volume:192 Issue:20-21 Issue date:May 23, 2003 Publication year:2003 Pages:2319-2338 Language:English ISSN:00457825 CODEN:CMMECC Document type:Journal article (JA) Publisher:Elsevier Abstract:The use of discrete data to represent engineering structures as derivatives from intersecting components requires algorithms to perform Boolean operations between groups of quadrilateral and triangular surfaces. In the intersection process, an accurate and efficient method for the determination of intersection lines is a crucial step for large scale and complex surface intersections. An algorithm based on tracing the neighbours of intersecting quadrilaterals is proposed to determine the intersection lines. A background grid is employed to limit the scope of searching for candidate quadrilaterals that may intersect. This will drastically cut down the time of geometrical check for intersections between quadrilaterals, making the surface intersection and mesh generation a quasi-linear process with respect to the number of elements involved. Given the node numbers at the vertices of the candidate quadrilaterals, the neighbour relationship is then established. In the determination of intersection, each quadrilateral is divided into two triangles and four fundamental cases are identified and treated systematically to enhance robustness and reliability. Tracing the neighbours for the determination of intersection lines not only greatly increases the efficiency of the process, it also improves the reliability as branching and degenerated cases can all be dealt with in a consistent manner on the intersecting surfaces concerned. Examples on a great variety of surface and mesh characteristics are given to demonstrate the effectiveness and robustness of the algorithm. &copy; 2003 Elsevier Science B.V. All rights reserved. Number of references:25 Main heading:Computational methods Controlled terms:Algorithms - Boolean algebra - Reliability Uncontrolled terms:Discrete data Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 921 Mathematics - 921.1 Algebra - 922.2 Mathematical Statistics Treatment:Theoretical (THR) DOI:10.1016/S0045-7825(03)00240-8 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 51> Accession number:2004308276677 Title:A dynamic approach to characterizing termination of general logic programs Authors:Shen, Y.I.-Dong (1); You, Jia-Huai (2); Yuan, L.I.-Yan (2); Shen, Samuel S. P. (2); Yang, Qiang (3) Author affiliation:(1) Chinese Academy of Sciences; (2) University of Alberta; (3) Simon Fraser University; (4) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (5) Department of Computing Science, University of Alberta, Edmonton, T6G 2H2, Canada; (6) Department of Mathematics, University of Alberta, Edmonton, T6G 2H2, Canada; (7) School of Computing Science, Simon Fraser University, Burnaby, BC V5A 1S6, Canada Corresponding author:Shen, Y.I.-D. (ydshen@ios.ac.cn) Source title:ACM Transactions on Computational Logic Abbreviated source title:ACM Trans. Comput. Log. Volume:4 Issue:3 Issue date:October 2003 Publication year:2003 Pages:417-430 Language:English ISSN:15293785 Document type:Journal article (JA) Publisher:Association for Computing Machinery Abstract:We present a new characterization of termination of general logic programs. Most existing termination analysis approaches rely on some static information about the structure of the source code of a logic program, such as modes/types, norms/level mappings, models/interargument relations, and the like. We propose a dynamic approach that employs some key dynamic features of an infinite (generalized) SLDNF-derivation, such as repetition of selected subgoals and recursive increase in term size. We also introduce a new formulation of SLDNF-trees, called generalized SLDNF-trees. Generalized SLDNF-trees deal with negative subgoals in the same way as Prolog and exist for any general logic programs. Number of references:30 Main heading:Logic programming Controlled terms:Automatic programming - Computer programming languages - Constraint theory - Formal logic - Information analysis - Mapping - Programming theory - Trees (mathematics) Uncontrolled terms:Dynamic characterization - Prolog - Subgoals - Termination analysis Classification code:405.3 Surveying - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1 Computer Programming - 723.1.1 Computer Programming Languages - 903.1 Information Sources and Analysis - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 52> Accession number:2003177442706 Title:Construction of feature-matching perception in virtual assembly Authors:Cheng, Cheng (1); Wang, HongAn (1); Dai, GuoZhong (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Cheng, C. (guoguocheng@) Source title:Journal of Computer Science and Technology Abbreviated source title:J Comput Sci Technol Volume:18 Issue:2 Issue date:March 2003 Publication year:2003 Pages:163-171 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:An important characteristic of virtual assembly is interaction. Traditional direct manipulation in virtual assembly relies on dynamic collision detection, which is very time-consuming and even impossible in desktop virtual assembly environment. Feature-matching is a critical process in harmonious virtual assembly, and is the premise of assembly constraint sensing. This paper puts forward an active object-based feature-matching perception mechanism and a feature-matching interactive computing process, both of which make the direct manipulation in virtual assembly break away from collision detection. They also help to enhance virtual environment understandability of user intention and promote interaction performance. Experimental results show that this perception mechanism can ensure that users achieve real-time direct manipulation in desktop virtual environment. Number of references:8 Main heading:Virtual reality Controlled terms:Algorithms - Computer aided design - Feature extraction - Human computer interaction - Interactive computer systems - Object oriented programming - Software prototyping Uncontrolled terms:Feature matching perceptions Classification code:722.2 Computer Peripheral Equipment - 722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 723.1 Computer Programming - 723.5 Computer Applications Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 53> Accession number:2003257507920 Title:Fast algorithms for revision of some special propositional knowledge bases Authors:Luan, ShangMin (1); Dai, GuoZhong (1) Author affiliation:(1) Institute of Software, The Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Luan, S.M. (shangmin_luan@) 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:388-392 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:In this paper, the computational complexity of propositional clause set counter-factuals is discussed. It is shown that the computational complexity of propositional clause set counterfactuals is at the second level of the polynomial hierarchy, and that the computational complexity of propositional Horn clause set counterfactuals is at the first level of the polynomial hierarchy. Furthermore, some polynomial algorithms are presented for some special propositional clause set, such as the unique satisfiable clause set and the clause set of which only one subset is minimally inconsistent with the input clause whose inconsistency check can be solved in polynomial time. Number of references:19 Main heading:Knowledge based systems Controlled terms:Algorithms - Computational complexity - Equivalence classes - Logic programming - Mathematical models - Polynomials - Set theory - Theorem proving - User interfaces Uncontrolled terms:Polynomial hierarchy - Propositional base revision - Propositional clause set counterfactuals Classification code:722.2 Computer Peripheral Equipment - 723.1 Computer Programming - 723.4.1 Expert Systems - 921.1 Algebra - 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 54> Accession number:2003487751325 Title:A framework for domain-specific search engine: Design pattern perspective Authors:Zhang, Junlin (1); Qu, Weimin (1); Du, Lin (1); Sun, Yufang (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, P.O. Box 8717, Beijing, 100080, China Corresponding author:Zhang, J. (zjl@sonata.iscas.ac.cn) Source title:Proceedings of the IEEE International Conference on Systems, Man and Cybernetics Abbreviated source title:Proc IEEE Int Conf Syst Man Cybern Volume:4 Issue date:2003 Publication year:2003 Pages:3881-3886 Language:English ISSN:08843627 CODEN:PICYE3 Document type:Conference article (CA) Conference name:System Security and Assurance Conference date:October 5, 2003 - October 8, 2003 Conference location:Washington, DC, United states Conference code:61779 Sponsor:Systems, Man and Cybernetics Society of the IEEE Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Domain specific search engine has many advantages over its generic counterparts such as high precision and short update period. However it's a time consuming job to construct these applications. We introduce an object-oriented framework for domain specific search engine applications which contain some design patterns. This paper describes the main design patterns that contribute to this object-oriented architecture, revealing the framework's structure and the forces that shaped it. Using this framework we fix a basic architecture and thus increase ability to construct domain specific search engine application. Number of references:18 Main heading:Search engines Controlled terms:Automatic indexing - Computer aided design - Computer architecture - Information technology - Object oriented programming - Websites Uncontrolled terms:Design pattern - Domain specific search engine Classification code:723.1 Computer Programming - 723.5 Computer Applications Treatment:Theoretical (THR) DOI:10.1109/ICSMC.2003.1244494 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 55> Accession number:2003297543491 Title:Rate distortion optimization in the scalable video coding Authors:Yang, Zhijie (1); Wu, Feng (2); Li, Shipeng (2) Author affiliation:(1) Institute of Software, Chinese Academy of Science, Beijing 100080, China; (2) Microsoft Research Asia, Beijing 100080, China Corresponding author:Yang, Z. Source title:Proceedings - IEEE International Symposium on Circuits and Systems Abbreviated source title:Proc IEEE Int Symp Circuits Syst Volume:2 Issue date:2003 Publication year:2003 Pages:II884-II887 Language:English ISSN:02714310 CODEN:PICSDI Document type:Conference article (CA) Conference name:Proceedings of the 2003 IEEE International Symposium on Circuits and Systems Conference date:May 25, 2003 - May 28, 2003 Conference location:Bangkok, Thailand Conference code:61136 Sponsor:IEEE Circuits and Systems Society; Mahanakorn University of Technology Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:This paper discusses the rate distortion optimization (RDO) issue in the scalable video coding. It is different from that in the non-scalable video coding because a scalable codec usually presents the decoded video within a certain range of the quality, frame rate and resolution. Therefore, this paper first analyzes the problem from a general model and gives a common description by the Lagrangian formula. Secondly, an algorithm is proposed to solve the above optimization problem at a specific scalable codec: the H.26L-based PFGS. At the same time, two analytic formulae are derived to ascertain the parameters &lambda; in this algorithm. The experimental results show that the proposed algorithm significantly improves the coding efficiency of the H.26L-based PFGS. Further studies on this problem will be quite significant and challenging. Number of references:15 Main heading:Image coding Controlled terms:Algorithms - Image enhancement - Lagrange multipliers - Motion compensation - Probability density function - Signal distortion - Signal to noise ratio Uncontrolled terms:Rate distortion Classification code:716.1 Information Theory and Signal Processing - 723.2 Data Processing and Image Processing - 741 Light, Optics and Optical Devices - 922.1 Probability Theory Treatment:Theoretical (THR); Experimental (EXP) DOI:10.1109/ISCAS.2003.1206116 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 56> Accession number:2004468461916 Title:Mining the customer's up-to-moment preferences for E-commerce recommendation Authors:Shen, Yi-Dong (1); Yang, Qiang (2); Zhang, Zhong (3); Lu, Hongjun (2) Author affiliation:(1) Lab. of Comp. Sci., Institute of Software, Chinese Academy of Sciences, China; (2) Hong Kong Univ. of Sci. and Technol., Hong Kong, Hong Kong; (3) School of Computing Science, Simon Fraser University, Burnaby, Canada Source title:Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) Abbreviated source title:Lect Notes Artif Intell Volume:2637 Monograph title:Advances in Knowledge Discovery and Data Mining Issue date:2003 Publication year:2003 Pages:166-177 Language:English ISSN:03029743 CODEN:LNAIE4 Document type:Conference article (CA) Conference name:7th Pacific-Asia Conference, PAKDD 2003 Conference date:April 30, 2003 - May 2, 2003 Conference location:Seoul, Korea, Republic of Conference code:63783 Sponsor:Korea Advanced Institute of Science and Technology, AITRC; Seoul National University, SRCCS; Korea Information Science Society; Korean Datamining Society Publisher:Springer Verlag Abstract:Most existing data mining approaches to e-commerce recommendation, are past data model-based in the sense that they first build a preference model from a past dataset and then apply the model to current customer situations. Such approaches are not suitable for applications where fresh data should be collected instantly since it reflects changes to customer preferences over some products. This paper targets those e-commerce environments in which knowledge of customer preferences may change frequently. But due to the very large size of past datasets the preference models cannot be updated instantly in response to the changes. We present an approach to making real time online recommendations based on an up-to-moment dataset which includes not only a gigantic past dataset but the most recent data that may be collected just moments ago. Number of references:12 Main heading:Data mining Controlled terms:Electronic commerce - Mathematical models - Online systems Uncontrolled terms:Datasets - Performance models Classification code:722.4 Digital Computers and Systems - 723.2 Data Processing and Image Processing - 723.5 Computer Applications - 921 Mathematics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 57> Accession number:2003477740777 Title:Human detection based on rectangle fitting Authors:Sun, Qing-Jie (1); Wu, En-Hua (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Faculty of Sci. and Technol., Univ. of Macau, Macau, China Corresponding author:Sun, Q.-J. (sqj@ios.ac.cn) 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:1388-1393 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:A new algorithm for human detection in a static image is proposed. Human is seen as a model constructed by a torso and four limbs. The torso is fitted by a quadrangle, and each limb is fitted by one or two quadrangles. Detecting human is to search a combination of quadrangles constrained by some geometrical and topological relations. The first step is to detect and fit rectangles in the image, and then try to search some reasonable combinations of rectangles that should satisfy the geometrical and topological relations. If the probability of the combination is more than a fixed threshold, the vertex positions of the rectangles are adjusted to get a compact model of human in that image. At last, the probability of the compact model is recalculated. Experimental results show that this algorithm can be applied in the content-based image retrieval and the analysis of human motion based on video. Abstract type:(Edited Abstract) Number of references:11 Main heading:Image segmentation Controlled terms:Algorithms - Computer graphics - Content based retrieval - Mathematical models - Probability - Topology Uncontrolled terms:Human detection - Human images - Human models - Rectangle fitting Classification code:723.2 Data Processing and Image Processing - 723.5 Computer Applications - 741.1 Light/Optics - 921 Mathematics - 922.1 Probability Theory Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 58> Accession number:2003287540884 Title:Real-time alert of secure OS Authors:Liu, Hai-Feng (1); Qing, Si-Han (1); Liu, Wen-Qing (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Eng. Res. Cent., Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Liu, H.-F. (liuhf008@) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:26 Issue:3 Issue date:March 2003 Publication year:2003 Pages:287-293 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:This paper presents a method for real-time detecting intrusions in privileged programs by monitoring their execution using audit events in Secure OS. First, it learns the normal behavior by monitoring audit events of privileged programs in gear, and builds normal database, then, monitors process behavior for significant deviations and alert to system when happen. Number of references:13 Main heading:Computer operating systems Controlled terms:Monitoring - Real time systems - Security systems Uncontrolled terms:Audit - Intrusion detection - Real time alert - Secure operating system Classification code:722 Computer Systems and Equipment - 914.1 Accidents and Accident Prevention Treatment:Applications (APP); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 59> Accession number:2005229125482 Title:Sketching informal presentations Authors:Li, Yang (1); Landay, James A. (1); Guan, Zhiwei (2); Ren, Xiangshi (3); Dai, Guozhong (2) Author affiliation:(1) Group for User Interface Research, Computer Science Division, University of California, Berkeley, Berkeley, CA 94720-1776, United States; (2) Intelligence Engineering Lab, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (3) Department of Information Systems Engineering, Kochi University of Technology, Tosayamada-cho, Kochi 782-8502, Japan; (4) National Research Council in Software Engineering Automation Center, Naval Postgraduate School, Monterey, CA 93940, United States Corresponding author:Li, Y. (yangli@cs.berkeley.edu) Source title:ICMI'03: Fifth International Conference on Multimodal Interfaces Abbreviated source title:ICMI Fifth Int. Conf. Multimodal Interfaces Monograph title:ICMI'03: Fifth International Conference on Multimodal Interfaces Issue date:2003 Publication year:2003 Pages:234-241 Language:English ISBN-10:1581136218 ISBN-13:9781581136210 Document type:Conference article (CA) Conference name:ICMI'03: Fifth International Conference on Multimodal Interfaces Conference date:November 5, 2003 - November 7, 2003 Conference location:Vancouver, BC, Canada Conference code:64729 Sponsor:ACM SIGCHI Publisher:Association for Computing Machinery Abstract:Informal presentations are a lightweight means for fast and convenient communication of ideas. People communicate their ideas to others on paper and whiteboards, which afford fluid sketching of graphs, words and other expressive symbols. Unlike existing authoring tools that are designed for formal presentations, we created SketchPoint to help presenters design informal presentations via freeform sketching. In SketchPoint, presenters can quickly author presentations by sketching slide content, overall hierarchical structures and hyperlinks. To facilitate the transition from idea capture to communication, a note-taking workspace was built for accumulating ideas and sketching presentation outlines. Informal feedback showed that SketchPoint is a promising tool for idea communication. Copyright 2003 ACM. Number of references:21 Main heading:Information analysis Controlled terms:Communication - Feedback - Graph theory - Rapid prototyping - User interfaces Uncontrolled terms:Gestures - Informal presentation - Pen-based computers - Sketching - Storyboards - Zooming user interfaces (ZUI) Classification code:722.2 Computer Peripheral Equipment - 723.5 Computer Applications - 731.1 Control Systems - 903.1 Information Sources and Analysis - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 60> Accession number:2004138090528 Title:DRAM(h): A parallel computation model for high performance numerical computing Authors:Zhang, Yun-Quan (1) Author affiliation:(1) Lab. of Parallel Comp., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Lab. of Comp. Sci., Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhang, Y.-Q. (zyq@mail.rdcps.ac.cn) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:26 Issue:12 Issue date:December 2003 Publication year:2003 Pages:1660-1670 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:A parallel computation model DRAM(h), which has h-level memory hierarchies, was proposed. With this model, we performed memory complexity analysis on different implementation forms of two classical parallel numerical linear algebra algorithms, i.e., four forms of parallel lower triangular solver (PTRS) and six forms of parallel LU factorization without column pivoting (PLU). Under DRAM(h) model, we find out that the different implementation forms of the same algorithm can have different memory complexity though they have almost the same time and space complexity under traditional RAM model. Finally, we validate our analytical results with experimental results on three parallel computing platforms, i.e., HITACHI SR2201, DAWNING3000 and 128 node LSEC Linux Cluster. In most cases, our model's analytical results match well with experimental results, which indicates the effectiveness of our new model on clarifying the different memory access pattern of various forms of the same algorithm. Some mismatches can be well explained through slightly modification on model analysis assumptions according to platform memory hierarchy features. Abstract type:(Edited Abstract) Number of references:17 Main heading:Parallel algorithms Controlled terms:Distributed computer systems - Mathematical models - Parallel processing systems - Supercomputers Uncontrolled terms:Clusters - Hierarchy memory model - High performance numerical computing - Memory complexity - Parallel computation model Classification code: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 61> Accession number:2003237499615 Title:Formal semantics for degree of perseverance of peers and its application Authors:Zhan, Min (1); Zuo, Chun (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhan, M. Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:31 Issue:2 Issue date:February 2003 Publication year:2003 Pages:287-289 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:The semantics for interoperations among peers is expressed in a logic of mental attitudes and action, formalized in a first order modal language, and provides an unambiguous reference point for implementations of interoperations. There exists some defects in the semantics of traditional persistent goal, which make initiator lose their controls of interoperations. In order to solve this problem, this paper brings forward the concept of degree of perseverance, which means the grade of commitment of interoperations. Perseverant goal, based on the concept of degree of perseverance, is an improvement on persistent goal, and realizes supports of different levels of commitment for interoperations. Number of references:6 Main heading:Multiprocessing systems Controlled terms:Information management - Semantics Uncontrolled terms:Goal - Interoperation - Peer - Perseverant goal - Persistent Classification code:722.4 Digital Computers and Systems - 903.2 Information Dissemination - 912.2 Management Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 62> Accession number:2003477740781 Title:Block placement algorithm with predefined coordinate alignment constraint based on sequence pair representation Authors:Liu, Rui (1); Hong, Xian-Long (2); Dong, She-Qin (2); Gu, Jun (3) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Dept. of Comp. Sci. and Technol., Tsinghua Univ., Beijing 100084, China; (3) Dept. of Comp. Sci., Sci. and Technol. Univ. of Hong Kong, Hong Kong, Hong Kong Corresponding author:Liu, R. (liurui@iscas.ac.cn) 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:1418-1424 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:In the system on a chip, some cells should be placed along a predefined coordinate within a relatively small region. This constraint comes from the requirement that the data should be ready on the common bus at the same time. The module placement problem is studied where some modules have the predefined coordinate alignment (PCA) constraint. The relations are given between constrained modules, from which a necessary condition is induced. A polynomial-time algorithm is developed that can guarantee that a feasible placement is always obtainable. The algorithm is implemented and tested on ami33 and ami49. The experimental results show that it is effective. Abstract type:(Edited Abstract) Number of references:13 Main heading:Computer architecture Controlled terms:Algorithms - Computational complexity - Constraint theory - Simulated annealing - Theorem proving Uncontrolled terms:Common buses - Module placement - Polynomial time complexity - Predefined coordinate alignment constraints - Sequence pairs - System on chip 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 - 921 Mathematics Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 63> Accession number:2003207471645 Title:A method for interaction of mobile agent and SNMP Authors:Zhang, Puhan (1); Sun, Yufang (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Zhang, P. Source title:Chinese Journal of Electronics Abbreviated source title:Chin J Electron Volume:12 Issue:2 Issue date:April 2003 Publication year:2003 Pages:283-286 Language:English ISSN:10224653 CODEN:CHJEEW Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Typically, most of existing network management applications are based on protocol SNMP(Simple network management protocol). The protocol is based on static, centralized and non-scalable client/server architectures, where some central entity processes large amounts of raw data gathered from each network element. By this reason, the management applications are not flexible, have problems of scalability and produce too much traffic in the network. Mobile agents have been proposed as a solution to the problems. However, most of proposed solutions often ignore the existing of legacy network management frameworks and have to change them. This paper presents a method to extend an existing legacy network management framework targeted at network management with an interface for integration with mobile agents and implemented it by using Java technology and aglet which is a mobile agent system from IBM. Number of references:12 Main heading:Network protocols Controlled terms:Client server computer systems - Internet - Java programming language - Management information systems - Software agents - Telecommunication traffic Uncontrolled terms:Mobile agents - Simple network management protocol Classification code:716.1 Information Theory and Signal Processing - 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) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 64> Accession number:2004068009279 Title:Measurement of software requirement based on SPC Authors:Wang, Qing (1); Li, Ming-Shu (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wang, Q. (wq@itechs.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:1312-1317 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:Software requirement management is very important in software development and quality management. Today, the essence of software crisis is the uncontrolled ever-changing software requirement. So we must adopt more appropriate software engineering method and requirement engineering method to accommodate these changes, and meanwhile we also must use effective measurement to analyze the trend and cause of changes, and then control and manage the changes. In this paper, we introduce an interest method based on SPC to control the change rate of software requirement, and analyze the cause of significant deviation. Number of references:8 Main heading:Software engineering Controlled terms:Life cycle - Process control - Quality control - Requirements engineering - Statistical process control Uncontrolled terms:Requirement change rate - Software metrics - Software quality management - Software requirement management Classification code:723.1 Computer Programming - 913.3 Quality Assurance and Control - 922.2 Mathematical Statistics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 65> Accession number:2004298272368 Title:Community network and broadband access Authors:Wu, Zhi-Mei (1); Zhang, Huan-Qiang (1); Wang, Jun (1) Author affiliation:(1) Multimedia Commun. Ctr., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wu, Z.-M. (wzm@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:23-28 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:The general problems in implementing and developing broadband integrated-services community network are analyzed. The key technologies in multicast services, quality of service (QoS), accounting and billing are studied. A description is given to the broadband community network solution, which is based on high speed Ethernet switches. In the solution, integrated services can be offered through a hierarchical switched network. These services include digital-TV, IP phone, data services etc. In order to simultaneously deliver all these services safely and with assured quality, QoS support and accounting mechanisms are applied in this community network. Number of references:7 Main heading:Local area networks Controlled terms:Broadband networks - Digital television - Hierarchical systems - Internet telephony - Multicasting - Quality of service Uncontrolled terms:Accounting mechanisms - Broadband access - Community networks - Data services - Ethernet switches Classification code:716.4 Television Systems and Equipment - 718 Telephone Systems and Related Technologies; Line Communications - 723 Computer Software, Data Handling and Applications Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 66> Accession number:2004198155264 Title:On two allocation methods for web services Authors:Sum, John (1); Wu, Jie (3) Author affiliation:(1) Department of Computing, Hong Kong Polytechnic University, Hung Hom, KLN, Hong Kong; (2) Lab. for Internet Technologies, Institute of Software, CAS, Qingdao, China; (3) Dept. of Computer Science and Eng., Florida Atlantic University, Boca Raton, FL 33431, United States Corresponding author:Sum, J. Source title:Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications Abbreviated source title:Proc. Int. Conf. Parallel Distrib. Proces. Tech. Applic. Volume:4 Monograph title:Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2003 Issue date:2003 Publication year:2003 Pages:1823-1828 Language:English ISBN-10:1892512416 ISBN-13:9781892512413 Document type:Conference article (CA) Conference name:Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications Conference date:June 23, 2003 - June 26, 2003 Conference location:Las Vegas, NV, United states Conference code:62566 Sponsor:Computer Science Research, Education, and Applications Press; International Technology Institute (ITI); Korean Society for Internet Information (KSII); World Academy of Sciences for Information Technology (WAS) Publisher:CSREA Press Abstract:In this paper, the properties of the multi-unit combinatorial auction (MUCA) and first-come-first-serve (FCFS) mechanisms for resource allocation in web services are discussed. For the former mechanism, the web services provider (WSP) collects all the offers from the clients and then allocates the resource (via a greedy algorithm) to the clients in a way that maximizes the total return. For the later mechanism, the WSP simply allocates the resource to the client if the stock is available. Considering profit making, it is obvious that MUCA is a preferred mechanism. However, profit making is usually not the only consideration for mechanism selection. In practice, the number of clients who can get the resource and the volume of resource finally allocated are also important for management decision. By assuming that (a) the pricing curves of the clients are all identical and their marginal utility is decreasing, (b) resource being sold are divisible, (c) the number of units each client is willing to subscribe is uniformly distributed in [0, 1]; and (d) the available resource is of constant size (k&macr;); equations for the expected number of buyers who can get the product (&lang;bi&rang;) and the expected number of units being sold (&lang;s&rang;) are derived analytically. Furthermore, by observing the numerical plots of these numbers against the number of clients, i.e. n, interesting results have been found. For MUCA, it is found that &lang;b&rang; will be equal to n for n &le 2k&macr; and approximately equal to -1+&radic;1+8nk&macr;/2 for n &le 2k&macr;. For the FCFS, it is found that &lang;b&rang; will be equal to n for n &le 2k&macr; and approximately equal to k&macr; for n &ge; 2k&macr;. Comparing the number of units being sold, i.e. &lang;s&rang;, it is found that the expected number of units being sold by either mechanism are approximately the same for n &le 2k&macr;. However, it is slightly larger in FCFS than MUCA if n &ge; 2k&macr;. These results can be used as a reference guideline for a web services provider to select appropriate mechanisms for allocating their computational resources to their clients. Number of references:6 Main heading:World Wide Web Controlled terms:Algorithms - Client server computer systems - Computational methods - Optimization - Resource allocation - Systems analysis - Telecommunication services - Websites - XML Uncontrolled terms:Allocation method - Combinatorial auction - Computational resources - Web service providers - Web services 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 - 921.5 Optimization Techniques Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 67> Accession number:2003397651653 Title:Towards adaptive load balancing services for web application servers Authors:Fan, Guo-Chuang (1); Zhu, Huan (1); Huang, Tao (1); Feng, Yu-Lin (1) Author affiliation:(1) Technol. Ctr. of Software Eng., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Fan, G.-C. (fanguo@otcaix.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:14 Issue:6 Issue date:June 2003 Publication year:2003 Pages:1134-1141 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:WAS (Web application server) is a distributed system which provides runtime integrated services for transactional Web applications. To improve the dependability and scalability of WASs, one effective way is to balance loads via adaptive load balancing service based on the middleware. The existing adaptive load balancing services, however, have inadequacies such as lack of server transparency and extensible load balancing strategy etc., and provide insufficient functionality to satisfy WASs. The key requirements of adaptive load balancing services for WASs are addressed first, and then the design of a novel adaptive load balancing service is presented. The key design challenges including hot plug-in, customizable load balancing strategy, load feedback and adaptive control, state migration and fault tolerance etc. are described, and the technical solutions are outlined. Lastly, a comparative study with other related works is given. The adaptive load balancing service is developed and implemented in WebFrame2.0 application server by using Java RMI. Abstract type:(Edited Abstract) Number of references:14 Main heading:Servers Controlled terms:Adaptive control systems - Algorithms - Fault tolerant computer systems - Feedback control - World Wide Web Uncontrolled terms:Dependability - Load balancing - Load feedback - Middleware - Scalability - State migration - Web application servers Classification code:722 Computer Systems and Equipment - 723 Computer Software, Data Handling and Applications - 731.1 Control Systems - 921 Mathematics Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 68> Accession number:2003037327471 Title:Probability graph based data hoarding for mobile environment Authors:Zhou, Huan (1); Feng, Yulin (1); Li, Jing (1) Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, P.O. Box 8718, 100080 Beijing, China Corresponding author:Zhou, H. (quan@otcaix.iscas.ac.cn) Source title:Information and Software Technology Abbreviated source title:Inf Software Technol Volume:45 Issue:1 Issue date:January 1, 2003 Publication year:2003 Pages:35-41 Language:English ISSN:09505849 CODEN:ISOTE7 Document type:Journal article (JA) Publisher:Elsevier Abstract:The vision of mobile environment is severely challenged by disconnected operation. Automated hoarding is an attractive approach solution to this issue. On the other hand, the large overhead of automatic hoarding algorithm is a serious problem for handheld devices. In this paper, we propose an application-independent automatic hoarding algorithm based on probability graph. Simulation results show that it can improve cache hit rate with low time and space overhead in disconnected operation effectively, especially for small cache size, which makes our proposed algorithm preferable for handheld devices. &copy; 2002 Elsevier Science B.V. All rights reserved. Number of references:12 Main heading:Mobile computing Controlled terms:Algorithms - Computer simulation - Graph theory - Information retrieval - Probability Uncontrolled terms:Data hoarding Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer Software, Data Handling and Applications - 723.5 Computer Applications - 903.3 Information Retrieval and Use - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 922.1 Probability Theory Treatment:Theoretical (THR) DOI:10.1016/S0950-5849(02)00160-X Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 69> Accession number:2003317580684 Title:Scheduling protocol for transactional workflows based on mix-grained conflict detection Authors:Ding, Ke (1); Wei, Jun (1); Feng, Yu-Lin (1) Author affiliation:(1) Lab. for 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: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:369-375 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:A transactional workflow is composed of traditional flat transactions, and its execution has relaxed transactional atomicity. Due to different termination characteristics of transactions, only one workflow is allowed to execute non-compensatable transactions with current scheduling protocols. Two granularities of conflict based on transaction classes and transaction instances are defined, and a scheduling protocol by using both granularities of conflict detection classes and transaction instances are defined, and a scheduling protocol by using both granularities of conflict detection is proposed. Besides generating serializable and recoverable schedules, this method provides a higher degree of concurrency in following two ways. On the one hand, the fine-grained locking mechanism based on transaction instances is used to reduce conflict possibility among concurrent workflows. On the other hand, the coarse-grained conflict mechanism based on transaction classes is used to predict future conflict among workflows, multiple workflows are therefore allowed to execute non-compensatable transactions if they will not conflict in predicated future execution. Number of references:10 Main heading:Computer supported cooperative work Controlled terms:Algorithms - Concurrency control - Mathematical models - Network protocols - Scheduling Uncontrolled terms:Locking granularity - Mix grained conflict detection - Scheduling protocols - Transactional workflow Classification code:723 Computer Software, Data Handling and Applications - 731.3 Specific Variables Control - 912.2 Management - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 70> Accession number:2003297544140 Title:Algorithms for analog VLSI 2D stack generation and block merging Authors:Liu, Rui (1); Dong, Sheqin (2); Hong, Xianlong (2); Long, Di (2); Gu, Jun (3) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Department of Computer Science, Tsinghua University, Beijing 100084, China; (3) Department of Computer Science, University of Hong Kong, Hong Kong, Hong Kong Corresponding author:Liu, R. (liurui@isdn.iscas.ac.cn) Source title:Proceedings - IEEE International Symposium on Circuits and Systems Abbreviated source title:Proc IEEE Int Symp Circuits Syst Volume:4 Issue date:2003 Publication year:2003 Pages:IV716-IV719 Language:English ISSN:02714310 CODEN:PICSDI Document type:Conference article (CA) Conference name:Proceedings of the 2003 IEEE International Symposium on Circuits and Systems Conference date:May 25, 2003 - May 28, 2003 Conference location:Bangkok, Thailand Conference code:61138 Sponsor:IEEE Circuits and Systems Society; Mahanakorn University of Technology Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:In analog VLSI design, 2-axial symmetry stack and block merging are critical for mismatch minimization and parasitic control. In this paper, algorithms for analog VLSI 2-axial symmetry stack and block merging are described. We get several theory results by studying symmetric Eulerian graph and symmetric Eulerian trail. Based on those, an O(n) algorithm for dummy transistor insertion, symmetric Eulerian trail construction and 2-axial symmetry stack construction are developed. The generated stacks are 2-axial symmetric and common-centroid. Block merging algorithm is described, which is essentially independent to topological representation. Formula for calculating maximum block merging distance is given. Experimental results show effectiveness of our algorithms. Number of references:9 Main heading:VLSI circuits Controlled terms:Algorithms - Graph theory - Simulated annealing Uncontrolled terms:Block merging Classification code:537.1 Heat Treatment Processes - 714.2 Semiconductor Devices and Integrated Circuits - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Theoretical (THR); Experimental (EXP) DOI:10.1109/ISCAS.2003.1206244 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 71> <RECORD 1> Accession number:2003317580712 Title:Hierarchical retrieval method for MPEG video Authors:Liu, Yang (1); Xu, Song-Tao (1); Wu, Zhi-Mei (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wu, Z.-M. (wzm@isdn.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:675-681 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Video retrieval is a current hot research area. Most of the past algorithms are done in pixel domain, which need many decode calculations. What is more, the same matching algorithm is used to all the video clips in the same way, which wasts many unnecessary calculations. A new hierarchical retrieval method based on example video for MPEG video is proposed: firstly the dct_dc_size field in I frames is used to locate the suspected videos quickly, then the retrieval result scope can be further reduced by analyzing the spatiotemporal distribution of motion vector in B frames using tomography method, at last DC images precise matching analysis is used to validate the retrieval result. The experimental results show that this method needs a few calculations and has higher precision ratio. Number of references:11 Main heading:Image retrieval Controlled terms:Algorithms - Space time adaptive processing - Standards - Vectors Uncontrolled terms:Hierarchical retrieval - Motion vectors - Video retrieval Classification code:716 Telecommunication; Radar, Radio and Television - 723.2 Data Processing and Image Processing - 723.5 Computer Applications - 741 Light, Optics and Optical Devices - 902.2 Codes and Standards - 921 Mathematics Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 72> Accession number:2004188147186 Title:Network fault management system research based on event flow model Authors:Wei, Dong-Hua (1); Shi, Zhi-Qiang (1); Wu, Zhi-Mei (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wei, D.-H. (wdh@isdn.iscas.ac.cn) Source title:Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications Abbreviated source title:Beijing Youdian Daxue Xuebao Volume:26 Issue:SUPPL Issue date:October 2003 Publication year:2003 Pages:52-58 Language:Chinese ISSN:10075321 CODEN:BYXBEV Document type:Journal article (JA) Publisher:Beijing University of Posts and Telecommunications Abstract:A network fault management system research is discussed in the environment of Broadband Community network (EBCN) based on Ethernet. The fault detection takes integration of two type events, including performance polling and trap receiving. After analysis for the event flow model, the merger of events and faults are presented according the fault status and problems of the network. The fault management structure is applied to enhance the fault management simply and practically on algorithms and solutions. Number of references:5 Main heading:Computer networks Controlled terms:Algorithms - Local area networks - Management Uncontrolled terms:Broadband community networks - Ethernet - Event flow models - Network fault management - Performance polling - Trap mechanism Classification code:716 Telecommunication; Radar, Radio and Television - 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 73> Accession number:2003397651174 Title:Composition of novel views through an efficient image warping Authors:Wu, Enhua (1); Zheng, Xin (2) Author affiliation:(1) Faculty of Science and Technology, University of Macao, Macao, China; (2) Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China; (3) Zhongxinguoan Info. Technol. Company, Beijing, China Corresponding author:Wu, E. (ehwu@umac.mo) Source title:Visual Computer Abbreviated source title:Visual Comput Volume:19 Issue:5 Issue date:August 2003 Publication year:2003 Pages:319-328 Language:English ISSN:01782789 CODEN:VICOE5 Document type:Journal article (JA) Publisher:Springer Verlag Abstract:This paper presents an efficient inverse warping algorithm for generating novel views from multiple reference images taken from different viewpoints. The method proceeds in three steps: preprocess for edge-pixel extraction, inverse warping from the primary image, and hole filling from remaining reference images. In using advantages of epipolar-line features and the depth discontinuity in the reference images, the inverse warping can be efficiently applied in segments, accelerating the rendering process substantially. Two acceleration techniques are proposed at the last stage for hole filling. By using the algorithm proposed, we may navigate a virtual environment at an interactive rate. Number of references:12 Main heading:Image processing Controlled terms:Algorithms - Edge detection - Functions - Virtual reality Uncontrolled terms:Edge-pixel - Image wraping Classification code:723.2 Data Processing and Image Processing - 723.5 Computer Applications - 921 Mathematics Treatment:Theoretical (THR) DOI:10.1007/s00371-002-0183-x Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 74> Accession number:2004108052868 Title:Development directions and comparison of network of manufacturing industry in China Authors:Gu, Xin-Jian (1); Qi, Guo-Ning (1); Han, Yong-Sheng (2) Author affiliation:(1) Dept. of Mech. Eng., Zhejiang Univ., Hangzhou 310027, China; (2) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Gu, X.-J. (xjgu@zju.edu.cn) Source title:Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS Abbreviated source title:Jisuanji Jicheng Zhizao Xitong Volume:9 Issue:7 Issue date:July 2003 Publication year:2003 Pages:583-588 Language:Chinese ISSN:10065911 CODEN:JJZXFN Document type:Journal article (JA) Publisher:CIMS Abstract:The profound influence of the network technology on the manufacturing industry of China is taking place. The network of manufacturing industry of China is developing rapidly from bottom to upper. Its main development ways to realize the network of manufacturing industry of China are by the development of network of industry, or by the development of network of region, or by the development of integrated network of industry and region. The analysis and comparison for them are presented. The research results showed that the network of industry and the network of region could play a role of mutual benefit. The network of industry and the network of region have their own main development directions, and the former is to deepen the content of network, while the latter is to extend the range of network. The development directions of these networks are discussed. Abstract type:(Edited Abstract) Number of references:4 Main heading:Internet Controlled terms:Intranets - Local area networks - Machinery - Manufacture - Wide area networks Uncontrolled terms:China manufacturing industry network - Development direction - Enterprise network - Region network Classification code:604.2 Machining Operations - 718 Telephone Systems and Related Technologies; Line Communications - 722.3 Data Communication, Equipment and Techniques - 723 Computer Software, Data Handling and Applications - 913.4 Manufacturing Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 75> Accession number:2003097371295 Title:Complete inference systems for weak bisimulation equivalences in the &pi;-calculus Authors:Lin, Huimin (1) Author affiliation:(1) Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, P.O. Box 8718, Beijing 100080, China Corresponding author:Lin, H. (lhm@ios.ac.cn) Source title:Information and Computation Abbreviated source title:Inf Comput Volume:180 Issue:1 Issue date:January 10, 2003 Publication year:2003 Pages:1-29 Language:English ISSN:08905401 CODEN:INFCEC Document type:Journal article (JA) Publisher:Academic Press Abstract:Proof systems for weak bisimulation equivalences in the &pi;-calculus are presented, and their soundness and completeness are shown. Two versions of &pi;-calculus are investigated one without and the other with the mismatch operator. For each version of the calculus proof systems for both late and early weak bisimulation equivalences are studied. Thus there are four proof systems in all. These inference systems are related in a natural way: the inference system for early equivalence is obtained from the one for late equivalence by replacing the inference rule for input prefix, while the inference system for the version of &pi;-calculus with mismatch is obtained by adding a single inference rule for mismatch to the one for the version without it. The proofs of the completeness results rely on the notion of symbolic bisimulation. Number of references:14 Main heading:Inference engines Controlled terms:Computer simulation - Equivalence classes - Formal languages - Semantics - Theorem proving Uncontrolled terms:Bisimulation - Inference rules - Inference systems - Mobile processes - Pi-calculus - Process algebra - Proof systems - Symbolic bisimulation Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.4.1 Expert Systems - 723.5 Computer Applications - 921.6 Numerical Methods Treatment:Theoretical (THR) DOI:10.1016/S0890-5401(02)00014-7 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 76> Accession number:2003317580682 Title:Overview towards the semantics of XYZ/E object-oriented programs Authors:Guo, Liang (1); Tang, Zhi-Song (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. 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:3 Issue date:March 2003 Publication year:2003 Pages:356-361 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:The element acted as object in XYZ/E object-oriented program is agent, a module consists of a data package and a process. The semantics of XYZ/E object-oriented programs are defined, including their language elements, under the framework of temporal logic. And several theories for proving the semantics consistency between these elements are also provided. Number of references:6 Main heading:Object oriented programming Controlled terms:Computer programming languages - Process control - Semantics - Software agents - Theorem proving Uncontrolled terms:Conditional elements - Refinement - Semantic consistency Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1 Computer Programming - 723.5 Computer Applications - 903.2 Information Dissemination - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 77> Accession number:2004128072207 Title:Twin-subset semantic model for intention Authors:Hu, Shan-Li (1); Shi, Chun-Yi (3) Author affiliation:(1) Dept. of Comp. Sci. and Technology, Fuzhou University, Fuzhou 350002, China; (2) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 10080, China; (3) Dept. of Comp. Sci. and Technology, Tsinghua University, Beijing 100084, China Corresponding author:Hu, S.-L. (husl@fzu.edu.cn) Source title:International Conference on Machine Learning and Cybernetics Abbreviated source title:Int. Conf. Mach. Learn. Cybern. Volume:4 Issue date:2003 Publication year:2003 Pages:2004-2008 Language:English ISBN-10:0780378652 ISBN-13:9780780378650 Document type:Conference article (CA) Conference name:2003 International Conference on Machine Learning and Cybernetics Conference date:November 2, 2003 - November 5, 2003 Conference location:Xi'an, China Conference code:62425 Sponsor:IEEE SMCTCC; Hebei University; Northwestern Polytechnical University Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Intention, an indispensable cognition attribute of agent, plays an important role in agent's rational behavior. There is a lot of research on formalization of cognitive state that include intentions of the agents in a multi-agent system. These theories are based on normal modal logic, interpret intention as unary normal modal operator in Kripke semantics, and hence suffer from the harmful logical omniscience and side-effect problems. These have not been eliminated satisfactorily as yet. In this paper, we interpret intention as unary non-normal modal operator and introduce novel possible world semantics for intention, called the twin-subset semantics. It describes the intentions of agent in a possible world w with two subsets of W, where W is the set of all possible worlds which an agent can be in, and allows us to embody essential cognitive features of intention and the relations between belief and intention. Compared with classical normal or non-normal modal logics, not only does it avoid the logical omniscience and side-effect problems but also the classical semantics of logical connectives are still valid; and moreover, it improves the true-false subset semantics, which were introduced by us previously, and overcomes its serious drawbacks. Number of references:15 Main heading:Software agents Controlled terms:Cognitive systems - Engineering research - Formal logic - Mathematical models - Multi agent systems - Semantics - Set theory Uncontrolled terms:Modal logics - Subsets Classification code:921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 903.2 Information Dissemination - 901.3 Engineering Research - 723.5 Computer Applications - 723.4 Artificial Intelligence - 723 Computer Software, Data Handling and Applications - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory Treatment:Theoretical (THR) DOI:10.1109/ICMLC.2003.1259832 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 78> Accession number:2004298271367 Title:Load balancing scheduling algorithm for multiprocessor system Authors:Li, Dong-Mei (1); Shi, Hai-Hu (2) Author affiliation:(1) Dept. of Comp. Sci. and Technol., Beijing Forestry Univ., Beijing 100083, China; (2) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Li, D.-M. (winter1532@) 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:29-34 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:For the load balancing problem of distributed system, it is very important that how to assign tasks to the leisure workstations and share processing resources by parallel network computing so as to accomplish the task as soon as possible. Recently, the load balancing problem of multiprocessor is becoming one of new research directions. In this paper, a mathematical model for load balancing of multiprocessor is proposed, which solves the problem of load balancing by factors decomposing of graphs. Let G is an undirected graph with weight, and G&prime; is a directed bipartite graph made from G. It is proved that the problem about fractional 1-factor of G is equal to the problem about 1-factor of G&prime;. By using this result, an O(n<sup>2</sup>) time algorithm of load balancing of multiprocessor is given, where n is the sum of workstations and tasks. Number of references:10 Main heading:Multiprocessing systems Controlled terms:Distributed computer systems - Graph theory - Mathematical models - Resource allocation Uncontrolled terms:Load balancing - Parallel network computing Classification code:722.4 Digital Computers and Systems - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 79> Accession number:2004488477106 Title:The information entropy of rough relational databases Authors:Sui, Yuefei (1); Xia, Youming (2); Wang, Ju (3) Author affiliation:(1) Key Lab. of Intelligent Info. Proc., Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China; (2) Department of Computer Science, Yunnan Normal University, Kunming, China; (3) Institute of Software, Chinese Academy of Sciences, Beijing, China Corresponding author:Sui, Y. (suiyyff@ict.ac.cn) Source title:Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) Abbreviated source title:Lect Notes Artif Intell Volume:2639 Monograph title:Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing Issue date:2003 Publication year:2003 Pages:320-324 Language:English ISSN:03029743 CODEN:LNAIE4 Document type:Conference article (CA) Conference name:9th International Conference, RSFDGrC 2003 Conference date:May 26, 2003 - May 29, 2003 Conference location:Chongqing, China Conference code:63796 Sponsor:National Natural Science Foundation of China; Chongqing University of Posts and Telecommunications; Municipal Education Committee of Chongqing, China; Municipal Science and Technology Committee of Chongqing, China; Bureau of Information Industry of Chongqing, China Publisher:Springer Verlag Abstract:Beaubouef, Petry and Buckles proposed the generalized rough set database analysis (GRSDA) to discuss rough relational databases. Given any rough relational database (U, A) and an attribute a &isin; A, as in rough set theory, a definition of the lower and upper approximations based on &phi;<inf>a</inf> is given. The entropy and conditional entropy of similarity relations in a rough relational database are defined. The examples show that the entropy of a similarity relation does not decrease as the similarity relation is refined. It will be proved that given any two similarity relations &phi; and &psi;, defined by a set C of conditional attributes and a decision attribute d, respectively, if d similarly depends on C in a rough relational database then the conditional entropy of &phi; with respect to &psi; is equal to the entropy of &phi;. Number of references:7 Main heading:Artificial intelligence Controlled terms:Database systems - Entropy - Relational database systems Uncontrolled terms:Conditional entropy - Similarity relation Classification code:641.1 Thermodynamics - 723.3 Database Systems - 723.4 Artificial Intelligence Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 80> Accession number:2004138084359 Title:Performance optimization for a distributed transaction manager Authors:Xu, Chang (1); Chen, Xiaofang (1); Jin, Beihong (1); Zhang, Xin (1) Author affiliation:(1) Technol. Ctr. of Software Eng., Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Xu, C. Source title:Proceedings of the IASTED International Conference on Software Engineering and Applications Abbreviated source title:Proc. IASTED Internat. Conf. Softw. Eng. Appl. Volume:7 Monograph title:Proceedings of the Seventh IASTED International Conference on Software Engineering and Applications Issue date:2003 Publication year:2003 Pages:140-145 Language:English ISBN-10:0889863946 ISBN-13:9780889863941 Document type:Conference article (CA) Conference name:Proceedings of the Seventh IASTED International Conference on Software Engineering and Applications Conference date:November 3, 2003 - November 5, 2003 Conference location:Marina del Rey, CA, United states Conference code:62498 Sponsor:IASTED, Technical Committee on Software Engineering Publisher:Int. Assoc. of Science and Technology for Development Abstract:As a key component of J2EE application servers, distributed transaction manager following JTS and JTA specifications plays an important role in distributed transaction environment, and its performance becomes one of the most important factors that limit the transaction throughput in J2EE application servers. This paper discusses the strategies to optimize distributed transaction manager in J2EE application servers to gain a better performance. The later performance test confirms our efforts eventually. Number of references:13 Main heading:Computer science Controlled terms:Database systems - Network protocols - Optimization - Servers - Software engineering Uncontrolled terms:Distributed transaction - Performance optimization Classification code:721 Computer Circuits and Logic Elements - 722 Computer Systems and Equipment - 723.1 Computer Programming - 723.3 Database Systems - 921.5 Optimization Techniques Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 81> Accession number:2002487247319 Title:An unconditionally stable parallel difference scheme for parabolic equations Authors:Gao, Jiaquan (1); He, Guixia (2) Author affiliation:(1) Research and Development Center for Parallel Software, Institute of Software, Chinese Academy of Sciences, P.O. Box 8718, Beijing 100080, China; (2) Management Department, Zhengzhou Institute of Light Industry, Zhengzhou, China Corresponding author:Gao, J. (giq@mail.rdcps.ac.cn) Source title:Applied Mathematics and Computation (New York) Abbreviated source title:Appl Math Comput (New York) Volume:135 Issue:2-3 Issue date:March 10, 2003 Publication year:2003 Pages:391-398 Language:English ISSN:00963003 CODEN:AMHCBQ Document type:Journal article (JA) Publisher:Elsevier Inc. Abstract:An unconditionally stable difference scheme with intrinsic parallelism is constructed in this paper, taking the parabolic equation u<inf>t</inf> = u<inf>xx</inf> as an example. The main ideas are described as follows. We decompose the domain &Omega; into some overlapping subdomains, take values of the last time layer as values of the time layer on inner boundary points of subdomains, solve it with the fully implicit scheme inside each subdomain, and then take correspondent values of its neighbor subdomains as their values for inner boundary points of each subdomain and mean of its neighbor subdomain and itself at overlapping points. Its unconditional stability and convergence are proved. Though its truncation error is O(1), we will still prove that the estimate order is improved to O(&tau; + h). &copy; 2002 Elsevier Science Inc. All rights reserved. Number of references:7 Main heading:Parallel processing systems Controlled terms:Error analysis - Numerical methods - Parallel algorithms - Theorem proving Uncontrolled terms:Parabolic equations Classification code:921 Mathematics - 921.6 Numerical Methods Treatment:Theoretical (THR) DOI:10.1016/S0096-3003(01)00340-X Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 82> Accession number:2004138082061 Title:Fuzzy multiple-level sequential patterns discovery from customer transaction database Authors:An, Chen (1); Huilin, Ye (3) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, China; (2) Institute of Policy and Management, Chinese Academy of Sciences, Beijing, China; (3) Sch. of Elec. Eng./Computer Science, University of Newcastle, Australia Corresponding author:An, C. Source title:Proceedings of the 10th ISPE International Conference on Concurrent Engineering Research and Application, Enhanced Interoperable Systems Abbreviated source title:Proc. ISPE Int. Conf. Concurrent Eng. Res. Appl. Enhanced Interoperable Syst. Issue date:2003 Publication year:2003 Pages:37-42 Language:English ISBN-10:905809622X ISBN-13:9789058096227 Document type:Conference article (CA) Conference name:Proceedings of the 10th ISPE International Conference on Concurrent Engineers: Research and Applications, Enhanced Interporable Systems Conference date:July 26, 2003 - July 30, 2003 Conference location:Madeira, Portugal Conference code:62478 Sponsor:FCT; ISPE; Fundacao Oriente; Fundacao Luso-Americana; Uninova Publisher:shers Abstract:Sequential patterns discovery is a very important research topic in data mining and knowledge discovery, and it has been widely applied in business analysis. Previous works were focused on mining sequential patterns at a single concept level based on definite and accurate concept which may not be concise and meaningful enough for human experts to easily obtain nontrivial knowledge from the rules discovered. In this paper, we introduce concept hierarchies firstly, and then discuss a mining algorithm F-MLSPDA for discovering multiple-level sequential patterns with quantitative attribute based on fuzzy partitions. Number of references:14 Main heading:Data mining Controlled terms:Algorithms - Database systems - Electronic commerce - Fuzzy sets - Knowledge engineering - Management information systems Uncontrolled terms:Customer transaction database - Knowledge discovery Classification code:723.2 Data Processing and Image Processing - 723.3 Database Systems - 723.4 Artificial Intelligence - 723.5 Computer Applications - 921 Mathematics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 83> Accession number:2004118060682 Title:Inverse rendering in a global illuminated environment Authors:Sun, Qi-Min (1); Wu, En-Hua (1) Author affiliation:(1) Key Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Dept. of Comp. Sci., Qufu Normal Univ., Qufu 273165, China; (3) Faculty of Sci. and Technol., Univ. of Macao, Macao, China Corresponding author:Sun, Q.-M. (sunqimin@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:14 Issue:10 Issue date:October 2003 Publication year:2003 Pages:1796-1805 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:A method is proposed to recover the reflectance properties of all objects in an environment. The input of the algorithm is a 3D geometric model of the scene, a panorama of it, and the information of light sources. The result is a full model of the reflectance properties of the scene. Recovery is done in a progressive refinement manner. At the very beginning, supposes all surfaces are diffuse and generates a new panorama. Then the new rendered panorama and the original one are compared iteratively. If the differences of some objects are greater than a threshold, more complex reflectance models are chosen for them. Finally, each object in the scene has a proper reflectance model. The scene can be rendered under novel lighting or viewing conditions, old objects can be removed from the scene, and new objects can be augmented into the scene. Special efforts have been done on recovering textures of textured diffuse, isotropic, and anisotropic surfaces; shadows and highlights are eliminated almost clearly. Number of references:11 Main heading:Three dimensional computer graphics Controlled terms:Image processing - Light reflection - Optimization - Textures - Virtual reality Uncontrolled terms:Augmented reality - Global illumination - Inverse rendering - Panorama - Reflectance model Classification code:723.2 Data Processing and Image Processing - 723.5 Computer Applications - 741.1 Light/Optics - 921.5 Optimization Techniques Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 84> Accession number:2005229132661 Title:Eigenvariables, bracketing and the decidability of positive minimal intuitionistic logic Authors:Dowek, Gilles (1); Jiang, Ying (2) Author affiliation:(1) &#201;cole Polytechnique and INRIA, LIX, &#201;cole Polytechnique, 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:Electronic Notes in Theoretical Computer Science Abbreviated source title:Electron. Notes Theor. Comput. Sci. Volume:85 Issue:7 Issue date:September 2003 Publication year:2003 Pages:19-31 Language:English ISSN:15710661 Document type:Journal article (JA) Publisher:Elsevier Abstract:We give a new proof of a theorem of Mints that the positive fragment of minimal intuitionistic logic is decidable. The idea of the proof is to replace the eigenvariable condition 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 inhabitation for positive types in system F. &copy;2003 Published by Elsevier Science B. V. Number of references:10 Main heading:Theorem proving Controlled terms:Algorithms - Eigenvalues and eigenfunctions - Formal logic - Logic programming - Mathematical models Uncontrolled terms:Intuitionistic logic - Negative quantifiers - Predicate logic - Propositional logic 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 - 921.1 Algebra Treatment:Theoretical (THR) DOI:10.1016/S1571-0661(04)80755-2 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 85> Accession number:2004258219605 Title:ARECA: A highly attack resilient Certification Authority Authors:Jing, Jiwu (1); Liu, Peng (2); Feng, Dengguo (3); Xiang, Ji (1); Gao, Neng (1); Jingqiang, Lin (1) Author affiliation:(1) Stt. Key Lab of Information Security, Graduate School, Chinese Academy of Sciences, 19A Yuquan Road, Beijing 100039, China; (2) Sch. of Info. Science and Technology, Pennsylvania State University, University Park, PA 16802; (3) Stt. Key Lab of Information Security, Institute of Software, CAS, 4 South Fourth Street, Zhongguancun, Beijing 100084, China Corresponding author:Jing, J. (Jing@) Source title:Proceedings of the ACM Workshop on Survivable and Self-Regenerative Systems Abbreviated source title:Proc. ACM Workshop Survivable Self-Regen. Syst. Monograph title:Proceedings of the ACM Workshop on Survivable and Self-Regenerative Systems (In Association with 10th ACM Conference on Computer Communications Security) Issue date:2003 Publication year:2003 Pages:53-63 Language:English ISBN-10:1581137842 ISBN-13:9781581137842 Document type:Conference article (CA) Conference name:Proceedings of the ACM Workshop on Survivable and Self-Regenerative Systems (In Association with 10th ACM Conference on Computer Communications Security) Conference date:October 31, 2003 - October 31, 2003 Conference location:Fairfax, VA, United states Conference code:63066 Sponsor:ACM; ACM SIGSAC; DARPA Publisher:Association for Computing Machinery Abstract:Certification Authorities (CA) are a critical component of a PKI. All the certificates issued by a CA will become invalid when the (signing) private key of the CA is compromised. Hence it is a very important issue to protect the private key of an online CA. ARECA systems, built on top of threshold cryptography, ensure the security of a CA through a series of defense-in-depth protections. ARECA systems won't be compromised when a few system components are compromised or some system administrators betray. The private key of a CA is protected by distributing different shares of the key to different (signing) components and by ensuring that any component of the CA is unable to reconstruct the private key. In addition, the multi-layer system architecture of ARECA makes it very difficult to attack from outside. Several threshold-cryptography- based methods are proposed in the literature to construct an intrusion tolerant CA, and the uniqueness of ARECA is that it engineers a novel two phase signature composition scheme and a multi-layer CA protection architecture. As a result, ARECA is (a) practical, (b) highly resilient to both insider and outsider attacks that compromise one or more components, and (c) can prevent a variety of outside attacks. Number of references:8 Main heading:Internet Controlled terms:Algorithms - Computer operating systems - Computer viruses - Cryptography - Network protocols - Online systems - Public policy - Security of data - Security systems Uncontrolled terms:Certification Authorities (CA) - Public Key Infrastructure (PKI) - Resilience - Threshold-cryptography Classification code:722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 723.2 Data Processing and Image Processing - 901 Engineering Profession - 914.1 Accidents and Accident Prevention Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 86> Accession number:2003077361262 Title:A programmable approach to maintenance of a finite knowledge base Authors:Luan, ShangMin (1); Dai, GuoZhong (1); Li, Wei (2) Author affiliation:(1) Institute of Software, The Chinese Academy of Sciences, Beijing 100080, China; (2) Dept. of Computer Science and Eng., Beijing Univ. Aero. and Astronautics, Beijing 100083, China Corresponding author:Luan, S.M. (shangmin_luan@) 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:102-108 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:In this paper, we present a programmable method of revising a finite clause set. We first present a procedure whose formal parameters are a consistent clause set &Gamma; and a clause A and whose output is a set of minimal subsets of &Gamma; which are inconsistent with A. The maximal consistent subsets can be generated from all minimal inconsistent subsets. We develop a prototype system based on the above procedure, and discuss the implementation of knowledge base maintenance. At last, we compare the approach presented in this paper with other related approaches. The main characteristic of the approach is that it can be implemented by a computer program. Number of references:19 Main heading:Computer systems programming Controlled terms:Finite automata - Formal languages - Formal logic - Knowledge based systems - Maximum principle - Procedure oriented languages - Set theory Uncontrolled terms:Clause set - Finite clause set - Finite knowledge base - Formal parameters - Maximal consistent subsets - Minimal inconsistent subsets - Predicate logic - Propositional logic Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1 Computer Programming - 723.1.1 Computer Programming Languages - 723.4.1 Expert Systems - 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 87> Accession number:2003257514158 Title:Multivariate Fourier series over a class of non tensor-product partition domains Authors:Sun, Jiachang (1) Author affiliation:(1) Parallel Comp. Div., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Sun, J. (sunjc@mail.rdcps.ac.cn) Source title:Journal of Computational Mathematics Abbreviated source title:J Comput Math Volume:21 Issue:1 Issue date:January 2003 Publication year:2003 Pages:53-62 Language:English ISSN:02549409 CODEN:JCMMEB Document type:Journal article (JA) Publisher:Inst. of Computational Mathematics and Sc./Eng. Computing Abstract:This paper finds a way to extend the well-known Fourier methods, to so-called n+1 directions partition domains in n-dimension. In particular, in 2-D and 3-D cases, we study Fourier methods over 3-direction parallel hexagon partitions and 4-direction parallel parallelogram dodecahedron partitions, respectively. It has pointed that, the most concepts and results of Fourier methods on tensor-product case, such as periodicity, orthogonality of Fourier basis system, partial sum of Fourier series and its approximation behavior, can be moved on the new non tensor-product partition case. Number of references:7 Main heading:Approximation theory Controlled terms:Fourier transforms - Functions Uncontrolled terms:Fourier basis system - Multivariate Fourier methods - Multivariate Fourier series - Non tensor product partitions Classification code:921 Mathematics - 921.3 Mathematical Transformations - 921.6 Numerical Methods Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 88> Accession number:2004027814430 Title:Zero knowledge watermark verification protocols Authors:Zou, Xiao-Xiang (1); Dai, Qiong (3); Huang, Chao (1); Li, Jin-Tao (1) Author affiliation:(1) Inst. of Comp. Technol., Chinese Acad. of Sci., Beijing 100080, China; (2) Natl. Comp. Network and Admin. Ctr., Beijing 100080, China; (3) Inst. of Software, Chinese Acad. of Sci., Beijing 100029, China Corresponding author:Zou, X.-X. (zxx@mail.nisac.gov.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:14 Issue:9 Issue date:September 2003 Publication year:2003 Pages:1645-1651 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Watermark technology is developed to tackle the problem of unauthorized copying and distribution of digital data. Several different schemes are proposed in the last few years, but most of them are symmetric, i.e., the key used for watermark embedding is just the same used for watermark detection. However, in many applications, an asymmetric scheme is needed, where the secrete information used to detect the watermark is not enough to modify, counterfeit or remove the watermark. Some watermark verification protocols based on bit commitment and zero knowledge proof are proposed. The ownership prover insert the watermark into the host signal using symmetric watermark technology based on spread spectrum. The watermark detect key is sent to the verifier hiding in bit commitment. By the interactive protocol between the prover and the verifier, the verifier can extract the embedded watermark, but he can not modify, counterfeit or remove it. Protocols are proposed to verify one watermark bit and several watermark bits respectively. Those protocols can be used to verify the watermark information inserted into image, audio and video using spread spectrum watermark technology. Number of references:18 Main heading:Digital watermarking Controlled terms:Calculations - Cryptography - Network protocols - Spread spectrum communication Uncontrolled terms:Asymmetric watermarking - Bit commitment - Spread spectrum watermarking - Symmetric watermarking - Watermark bits - Zero knowledge proof Classification code:716 Telecommunication; Radar, Radio and Television - 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 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 89> Accession number:2003407659541 Title:Research and implementation of role-based domain and type enforcement access control model Authors:Zhao, Qing-Song (1); Sun, Yu-Fang (1); Zhang, Xiao-Ping (2) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Shandong Inst. of Arch. and Eng., Ji'nan 250014, China Corresponding author:Zhao, Q.-S. 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:842-846 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Only those systems which support multiple security policies can meet practical security requirements. The role-based access control (RBAC) is a new policy-neutral model, which has enforced multiple security policies. The domain and type enforcement security policy fully reflects the security principles of least privilege and separation of duties. According to RBAC and DTE, the role-based domain and type enforcement access control (RDTEAC) model is presented. RDTEAC not only inherits the advantage of RBAC, but also facilitates implementation of DTE security policy. A Linux prototype of RDTEAC was developed. Number of references:16 Main heading:Security of data Controlled terms:Computer control - Information management - Models Uncontrolled terms:Domain and type enforcement - Information security - Multi policy securities - Role based access control Classification code:723.2 Data Processing and Image Processing - 903.2 Information Dissemination - 912.2 Management Treatment:Applications (APP); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 90> Accession number:2004118060676 Title:Twenty years development of security protocols research Authors:Qing, Si-Han (1) Author affiliation:(1) Eng. Res. Ctr. for Info. Technol., Chinese Acad. of Sci., Beijing 100080, China; (2) State Key Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, 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:14 Issue:10 Issue date:October 2003 Publication year:2003 Pages:1740-1752 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:This paper is a survey on the twenty years development of security protocols research. The state of the art in the application of formal methods to the design and analysis of security protocols is presented. Some major threads and emerging trends of research in this area are outlined. Number of references:77 Main heading:Security of data Controlled terms:Computer networks - Cryptography - Network protocols - Public key cryptography Uncontrolled terms:BAN logic - CSP method - Dolev Yao models - Formal method - Needham Schroeder public key - Security protocol Classification code:723.2 Data Processing and Image Processing Treatment:General review (GEN) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 91> Accession number:2003297554024 Title:Temporal logic-based software architecture description language XYZ/ADL Authors:Zhu, Xue-Yang (1); Tang, Zhi-Song (1) Author affiliation:(1) Key Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., 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:14 Issue:4 Issue date:April 2003 Publication year:2003 Pages:713-720 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:The architecture description language (ADL) is the foundation of software development based on software architecture. An ADL supporting stepwise refinement can make it more convenient that a good design leads to a good implementation. The architecture description language XYZ/ADL can support the stepwise transition from higher-level architectures to lower-level architectures, because it is based on the temporal logic language (TLL) XYZ/E, which can represent both dynamic semantics and static semantics under a unified logical framework. The framework and syntax of XYZ/ADL is presented and its underlying semantics is explained using XYZ/E, and how to describe software architecture and software architecture style using XYZ/ADL is introduced. Abstract type:(Edited Abstract) Number of references:11 Main heading:Software engineering Controlled terms:Computer architecture - Computer programming languages - Logic programming - Semantics - Specifications Uncontrolled terms:Architecture description languages - Software architecture - Temporal logic 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 - 903.2 Information Dissemination Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 92> <RECORD 1> Accession number:2004128072206 Title:The rationality of agents and the weak realism constraint for intentions Authors:Hu, Shan-Li (1); Shi, Chun-Yi (3); Fang, Xiu-Duan (1) Author affiliation:(1) Dept. of Comp. Sci. and Technology, Fuzhou University, Fuzhou 350002, China; (2) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 10080, China; (3) Dept. of Comp. Sci. and Technology, Tsinghua University, Beijing 100084, China Corresponding author:Hu, S.-L. (husl@fzu.edu.cn) Source title:International Conference on Machine Learning and Cybernetics Abbreviated source title:Int. Conf. Mach. Learn. Cybern. Volume:4 Issue date:2003 Publication year:2003 Pages:2000-2003 Language:English ISBN-10:0780378652 ISBN-13:9780780378650 Document type:Conference article (CA) Conference name:2003 International Conference on Machine Learning and Cybernetics Conference date:November 2, 2003 - November 5, 2003 Conference location:Xi'an, China Conference code:62425 Sponsor:IEEE SMCTCC; Hebei University; Northwestern Polytechnical University Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:This paper first explores the differences of the attitude of mind, especially desires, between rational agents and human beings. It argues that the desires of rational agents must be consistent, although those of human beings may be inconsistent. Later, it discusses the weak realism constraint for intentions and points out that the existing formalizations are unable to exactly describe the features of intentions due to their shortcomings. In order to overcome these drawbacks, it introduces the parameter of time and the possibility of operator to propose a more exact formal representation for intentions and the relationship between intentions and beliefs. Number of references:10 Main heading:Software agents Controlled terms:Computational methods - Constraint theory - Engineering research - Human engineering - Mathematical models - Parameter estimation - Semantics Uncontrolled terms:Rational agents - Semantic formalism Classification code:921 Mathematics - 903.2 Information Dissemination - 901.3 Engineering Research - 731.1 Control Systems - 723 Computer Software, Data Handling and Applications - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 461.4 Ergonomics and Human Factors Engineering Treatment:Theoretical (THR) DOI:10.1109/ICMLC.2003.1259831 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 93> Accession number:2003317580705 Title:Differential and linear cryptanalysis of AC block cipher Authors:Wu, Wen-Ling (1); Ma, Heng-Tai (1); Qing, Si-Han (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Ctr. for Info. Security Technol., Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wu, W.-L. (wwl@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:569-574 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:The security of AC block cipher against differential and linear cryptanalysis is discussed. It is shown that 12-round AC has no differential characteristic with probability higher than 2-128 and no linear approximations with approximation bias larger than 2-67 by estimating the lower bound of the number of active-boxes in 3-round differential characteristic and 12-round linear approximation. Hence, AC block cipher is secure to differential and linear cryptanalysis. Abstract type:(Edited Abstract) Number of references:5 Main heading:Cryptography Controlled terms:Approximation theory - Numerical analysis - Probability Uncontrolled terms:Differential characteristic - Differential cryptanalysis - Linear approximation - Linear cryptanalysis - S boxes Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer Software, Data Handling and Applications - 921 Mathematics - 922.1 Probability Theory Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 94> Accession number:2004228177953 Title:Optimal error estimates of the Chebyshev-Legendre spectral method for solving the generalized Burgers equation Authors:Wu, Hua (1); Ma, Heping (1); Li, Huiyuan (1) Author affiliation:(1) Department of Mathematics, Shanghai University, Shanghai 200436, China; (2) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Wu, H. (hwu@mail.shu.edu.cn) Source title:SIAM Journal on Numerical Analysis Abbreviated source title:SIAM J Numer Anal Volume:41 Issue:2 Issue date:April/May 2003 Publication year:2003 Pages:659-672 Language:English ISSN:00361429 CODEN:SJNAAM Document type:Journal article (JA) Publisher:Society for Industrial and Applied Mathematics Publications Abstract:In this paper the Chebyshev-Legendre collocation method is applied to the generalized Burgers equation. Optimal error estimate of the method is proved for the problem with the Dirichlet boundary conditions. Also, a Legendre-Galerkin-Chebyshev collocation method is given for the generalized Burgers equation. The scheme is basically formulated in the Legendre spectral form but with the nonlinear term being treated by the Chebyshev collocation method so that the scheme can be implemented at Chebyshev-Gauss-Lobatto points efficiently. Optimal order convergence is also obtained through coupling estimates in the L<sup>2</sup>-norm and the H<sup>1</sup>-norm. Number of references:25 Main heading:Partial differential equations Controlled terms:Boundary conditions - Chebyshev approximation - Convergence of numerical methods - Error analysis - Galerkin methods - Interpolation - Linear equations Uncontrolled terms:Chebyshev-Legendre methods - Generalised Burgers equation - Optimal error estimate Classification code:921.2 Calculus - 921.6 Numerical Methods Treatment:Theoretical (THR) DOI:10.1137/S0036142901399781 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 95> Accession number:2004128066617 Title:Hardware impact on communication performance of Beowulf LINUX cluster Authors:Tang, Yuan (1); Zhang, Yun-Quan (1); Sun, Jia-Chang (1); Li, Yu-Cheng (1) Author affiliation:(1) Res./Devmt. Ctr. Parallel Software, Institute of Software, Chinese Academy of Science, Beijing 100080, China; (2) Key Lab of Computer Science, Chinese Academy of Science, Beijing 100080, China Corresponding author:Tang, Y. (tang@mail.rdcps.ac.cn) Source title:IASTED International Multi-Conference on Applied Informatics Abbreviated source title:IASTED Internat. Multi-Conf. Appl. Inform. Volume:21 Monograph title:21st IASTED International Multi-Conference on Applied Informatics Issue date:2003 Publication year:2003 Pages:495-500 Language:English ISBN-10:0889863415 ISBN-13:9780889863415 Document type:Conference article (CA) Conference name:21st IASTED International Multi-Conference on Applied Informatics Conference date:Febrary 10, 2003 - Febrary 13, 2003 Conference location:Innsbruck, Austria Conference code:62395 Sponsor:International Assoc. of Sc. and Technol. for Developm. (IASTED) Publisher:Int. Assoc. of Science and Technology for Development Abstract:There exist a lot of models of parallel computation, amongst which LogP and LogGP are famous and suitable to describe the framework of communication process of Beowulf LINUX Cluster. [4] analyzed the impact of each LogP parameter on real world application in detail. But most researchers seemed ignore the impact of different hardware conditions on LogP parameters. This paper, based on Beowulf LINUX Cluster, compare these various hardware differences and their possible impacts, and propose some useful suggestions in the end. We hope it will be helpful to the configuration of Beowulf LINUX Cluster. The analysis of software impacts is our future work. Number of references:5 Main heading:Information analysis Controlled terms:Computational methods - Computer hardware - Computer operating systems - Computer programming - Data reduction Uncontrolled terms:Bewulf LINUX Cluster - Hardware impact - LogP parameters Classification code:921 Mathematics - 903.1 Information Sources and Analysis - 723.2 Data Processing and Image Processing - 723.1 Computer Programming - 723 Computer Software, Data Handling and Applications - 722 Computer Systems and Equipment - 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 96> Accession number:2003247506944 Title:Optimized propagation algorithms for multi-replication definition Authors:Zhe, Jing (1); Sun, Yu-Fang (1) Author affiliation:(1) Chinese Character Info. Cent., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhe, J. (jzhe@sonata.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:14 Issue:2 Issue date:February 2003 Publication year:2003 Pages:230-236 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Multi-replication definition (MRD) is a new trend of database replication, but it will increase the propagation costs. In this paper, three optimized propagation algorithms for MRD are presented, D-M, ILS and LIS. D-M Algorithm gets the minimum individual propagation cost by dividing replication objects and merging propagation objects. Based on it, ILS makes the total costs to the least in strict Chain Topology scenarios, and LIS gets optimized total costs in other common situations by decomposing the propagation task. Their correctness and efficiencies are validated both theoretical and experimentally. Number of references:5 Main heading:Distributed database systems Controlled terms:Optimization - Topology Uncontrolled terms:Chain topology scenarios - Database replication - database replication - Multireplication definition - Propagation Classification code:723 Computer Software, Data Handling and Applications - 723.3 Database Systems - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 921.5 Optimization Techniques Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 97> Accession number:2003317580695 Title:Multicast protocol over switch Ethernet Authors:Wang, Jun (1); Wu, Zhi-Mei (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wang, J. (wyj@isdn.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:496-502 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Many services, including video conference, whiteboard and video broadcasting, run over LANs. However, most of LANs, such as Ethernet, treat multicast just as broadcast, and they all have few supports for multicast. A multicast protocol in an LAN switch, named IGMP snooping, is implemented based on VLAN and IGMP. IGMP snooping will be applied to the IP multicast stream control on the switch Ethernet. The basic idea, syntax and semantics of this protocol are given, and the verification and test procedure is also provided. Number of references:6 Main heading:Local area networks Controlled terms:Broadcasting - Management - Multicasting - Network protocols - Semantics - Video conferencing Uncontrolled terms:Cisco group management protocols - Electronic whiteboards - Generic group management protocols - Internet group management protocols - Multicast protocols - Switch Ehernet - Video broadcasting Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer Software, Data Handling and Applications - 903.2 Information Dissemination - 912.2 Management Treatment:Applications (APP); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 98> Accession number:2003397651651 Title:Host-based anomaly intrusion detection model based on genetic programming Authors:Su, Pu-Rui (1); Li, De-Quan (1); Feng, Deng-Guo (1) Author affiliation:(1) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Su, P.-R. (supurui@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:14 Issue:6 Issue date:June 2003 Publication year:2003 Pages:1120-1126 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Anomaly Detection techniques assume all intrusive activities deviate from the norm. A new anomaly detection model is found to improve the veracity and efficiency. The proposed model establishes a normal activity profile of the systemcall sequences by using Genetic Programming. One instance of the model monitors one process. If the model finds the real systemcall sequences profile of the process deviating from the normal activity profile, it will flag the process as intrusive and take some actions to respond to it. And a new method of calculating the fitness and two operators to generate the next offspring are provided. According to the comparison with some of current models, the model is more veracious and more efficient. Abstract type:(Edited Abstract) Number of references:9 Main heading:Computer networks Controlled terms:Calculations - Genetic engineering - Mathematical models - Mathematical programming - Monitoring - Security of data Uncontrolled terms:Anomaly detection - Genetic programming - Intrusion detection - Systemcall sequences Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer Software, Data Handling and Applications - 921 Mathematics - 922 Statistical Methods Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 99> Accession number:2003317580694 Title:Sinusoidal modeling method based on matching-pursuits with perceptual gradient Authors:Zhang, Wen-Yao (1); Xu, Gang (1); Wang, Yu-Guo (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhang, W.-Y. (zhwenyao@) 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:467-472 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:As an adaptive algorithm of signal decomposition, matching pursuits provides a new framework for sinusoidal modeling of speech and audio signal. The procedure of sinusoidal modeling using matching pursuits is analyzed as well as the sinusoidal modeling algorithm using perceptually weighted matching pursuits. And a method of sinusoidal modeling with perceptual gradient is proposed. The proposed method, which adopts the adaptive feature of matching pursuits, computes dynamically a masking threshold from the currently synthesized signal using the psychoacoustic model. With the thresholds, it extracts the most perceptually significant component from the residual signal. Therefore, the perceptual information contained in the synthesized signal increases as quickly as possible. The quality of the synthesized speech by this approach is rather high even if the model precision is low. Experiments prove that the method uses the features of hearing system in a better way, and the modeling is reasonable and efficient. Both the objective compare of SNR and the subjective listening test show the rationality and superiority of the new method. Number of references:12 Main heading:Speech processing Controlled terms:Algorithms - Audio acoustics - Computer simulation - Gradient methods - Mathematical models - Threshold logic Uncontrolled terms:Masking threshold - Matching pursuits - Perceptual gradient - Psychoacoustic models - Sinusoidal modeling Classification code:721 Computer Circuits and Logic Elements - 723.5 Computer Applications - 751.1 Acoustic Waves - 751.5 Speech - 921 Mathematics Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 100> Accession number:2003517788914 Title:Adaptive image coding based on matching pursuit Authors:Liao, Bin (1); Xu, Gang (1); Wang, Yuguo (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Liao, B. 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:15 Issue:9 Issue date:September 2003 Publication year:2003 Pages:1084-1090 Language:Chinese ISSN:10039775 CODEN:JFTXFX Document type:Journal article (JA) Publisher:Institute of Computing Technology Abstract:A new image coding method is proposed that can produce an embedded and progressive-PSNR bit stream with region of interest ability. It represents the original image as linear composition of some time-frequency atoms. These atoms are extracted from a redundant dictionary to match the time-frequency characteristics of original image in a great degree. Our experiments show that it can capture texture and edge characteristics efficiently and the quality of recovered image is better than SPIHT at low bit rates. Number of references:10 Main heading:Image coding Controlled terms:Adaptive algorithms - Feature extraction - Frequency domain analysis - Time domain analysis Uncontrolled terms:Interest region - Matching pursuit - Redundant time frequency dictionary Classification code:723.2 Data Processing and Image Processing - 723.5 Computer Applications - 921 Mathematics Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 101> Accession number:2003447707670 Title:Design and logical analysis of security protocols Authors:Qing, Si-Han (1) Author affiliation:(1) Eng. 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:Qing, S.-H. (qsihan@) 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:1300-1309 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:With the rapid growth of network applications, network security has become an important issue. The following issues are investigated: the design principles of security protocols, the use of formal methods in the design of security protocols, the characteristics of various approaches to formal analysis, in particular logical analysis. The strand space approach to logical analysis, and the possibility of the strand space model guiding the formal design of security protocols are also explored. Abstract type:(Edited Abstract) Number of references:36 Main heading:Network protocols Controlled terms:Cryptography - Design - Formal logic - Mathematical models - Security of data Uncontrolled terms:Logical analysis - Network security - Security protocols - Strand space 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 - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 102> Accession number:2004088028784 Title:Method of mass production of custom-tailor apparel in network age Authors:Pan, Xu-Wei (1); Gu, Xin-Jian (1); Hu, Lin (2); Shao, Chen-Xi (1); Li, Xing-Sen (3) Author affiliation:(1) Inst. of Contemporary Mfg. Eng., Zhejiang Univ., Hangzhou 310027, China; (2) Youngor Apparel Group Corp. Ltd., Ningbo 315153, China; (3) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Pan, X.-W. (x.w.pan@) Source title:Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS Abbreviated source title:Jisuanji Jicheng Zhizao Xitong Volume:9 Issue:9 Issue date:September 2003 Publication year:2003 Pages:784-787+792 Language:Chinese ISSN:10065911 CODEN:JJZXFN Document type:Journal article (JA) Publisher:CIMS Abstract:After the main problems in the Mass Production of Custom-tailor Apparel (MPoCtA) are analyzed, the architecture of the integrated information system based on network for the mass production is put forward, and main business processes related to the integration and its shared data and information are discussed. Then rule-based knowledge base techniques in MPoCtA and its practice in the automatic transformation of apparel pattern are elaborated. Finally, a system of custom-tailor apparel in one company is introduced, which integrates the design, production and distribution. The accuracy of transformation of apparel pattern in this system reached 90%. Number of references:5 Main heading:Production engineering Controlled terms:Computer integrated manufacturing - Computer networks - Enterprise resource planning - Information management - Knowledge based systems Uncontrolled terms:Apparel - Custom tailor - Enterprise application integration - Mass customization - Rule based knowledge systems Classification code:723.4.1 Expert Systems - 912.2 Management - 913.1 Production Engineering - 913.4.2 Computer Aided Manufacturing Treatment:Applications (APP); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 103> Accession number:2003357612261 Title:Approach to the revision of a finite belief set Authors:Luan, Shang-Min (1); Dai, Guo-Zhong (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Luan, S.-M. (shangmin_luan@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:14 Issue:5 Issue date:May 2003 Publication year:2003 Pages:911-917 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:An approach to the revision of a finite belief set is presented. First, a procedure for generating all the minimal inconsistent sets is introduced, and the correctness of the procedure is proved. Then what discussed further is that how to apply the procedure to the implementation of some representative methods, and an implemented prototype for belief revision is introduced. At last, the presented approach is compared with other related work. Number of references:31 Main heading:Artificial intelligence Controlled terms:Formal logic - Set theory - Software prototyping - Theorem proving Uncontrolled terms:Belief revision - Finite belief sets - First order logic - Minimal inconsistent sets - Prepositional logic Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1 Computer Programming - 723.4 Artificial Intelligence - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 104> Accession number:2004128072178 Title:Self-maintainability of deletions of materialized views over XML data Authors:Hua, Cheng (1); Gao, Ji (1); Chen, Yi (2); Su, Jian (1) Author affiliation:(1) School of Computing, Zhejiang University; (2) Institute of Software, Chinese Academy of Science, Hangzhou 310027, Zhejiang, China Corresponding author:Hua, C. (hc5599@.cn) Source title:International Conference on Machine Learning and Cybernetics Abbreviated source title:Int. Conf. Mach. Learn. Cybern. Volume:3 Issue date:2003 Publication year:2003 Pages:1883-1888 Language:English ISBN-10:0780378652 ISBN-13:9780780378650 Document type:Conference article (CA) Conference name:2003 International Conference on Machine Learning and Cybernetics Conference date:November 2, 2003 - November 5, 2003 Conference location:Xi'an, China Conference code:62424 Sponsor:IEEE SMCTCC; Hebei University; Northwest Polytechnical Univeristy Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:To implement a XML data warehouse system, a key issue is how to efficiently maintain materialized views, to preserve their consistency with data sources when base data changes. Self-maintenance of views has been shown to dramatically improve performance for view maintenance, and studied extensively in the context of the relational data model. But for XML database, there are still lots of work left to be done. In this paper, we give a preliminary result on self-maintainability of deletions of views over XML data. We give a necessary and sufficient condition of self-maintenance of deletions of views for XML data. Number of references:13 Main heading:XML Controlled terms:Algorithms - Database systems - Information analysis - Mapping - Mathematical models - Query languages Uncontrolled terms:Relational data models - Self-maintainability Classification code:405.3 Surveying - 723 Computer Software, Data Handling and Applications - 723.1.1 Computer Programming Languages - 723.3 Database Systems - 903.1 Information Sources and Analysis - 921 Mathematics Treatment:Theoretical (THR) DOI:10.1109/ICMLC.2003.1259804 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 105> Accession number:2004158109734 Title:A Novel Traffic Model Based on Wavelet analysis 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:1392-1395 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:China Institute of Communications (CIC); Chinese Institute of Electronics (CIE); IEEE COMSOC Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Recent research shows network traffic exhibits drastically different statistics according to scales. At large time scales, nearly Gaussian marginals and Long range dependence and highly non-Gaussian marginals and multifractal scaling on small scales. Structure network researchers show there are two components of the traffic according to the speed of connections, one component holds most traffic and being mostly Gaussian, the other absorbs virtually all the small scale bursts. For better understanding of this phenomenon, we propose a novel traffic model based on wavelet. Simulation results with the real traffic show this model is flexible and parsimonious to accommodate Gaussian as well as bursty behavior on different scales. Number of references:10 Main heading:Telecommunication traffic Controlled terms:Approximation theory - Computer simulation - Data communication systems - Data reduction - Mathematical models - Network protocols - Telecommunication networks - Wavelet transforms Uncontrolled terms:Fractional Brownian motion - Long-range-dependence (LRD) - LRD - Multifractal - Traffic modeling - Wavelet Classification code:921.6 Numerical Methods - 921.3 Mathematical Transformations - 723.5 Computer Applications - 723.2 Data Processing and Image Processing - 723 Computer Software, Data Handling and Applications - 718 Telephone Systems and Related Technologies; Line Communications - 716 Telecommunication; Radar, Radio and Television Treatment:Theoretical (THR) DOI:10.1109/ICCT.2003.1209788 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 106> Accession number:2003357612270 Title:Stream cipher algorithms based on composite nonlinear discrete chaotic dynamical systems Authors:Li, Hong-Da (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:Li, H.-D. (lihongda@is.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:14 Issue:5 Issue date:May 2003 Publication year:2003 Pages:991-998 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Two approaches are presented to stream cipher utilizing a peculiar dynamical system called as composite discrete chaotic dynamical system (for short, composite system), which consists of two chaotic dynamical systems. The secret keys are the initial state of the chaotic dynamical systems, and the plain text is used as its composite sequence that decides the choice of iterating function in the iterating process. Because of sensitivity of the composite system to initial conditions and randomness in the iterating process, the approach mingles secret keys with plain text when using the composite system to produce ciphertext. Therefore they hold very complex and sensitive nonlinear relations. The algorithm is also provided with uniform distributing cipher text. These peculiarities prevent ciphertext to leak the information of plaintext and secret key and make the security of the algorithms not depend on the complexity of the ciphertext. Number of references:14 Main heading:Cryptography Controlled terms:Algorithms - Chaos theory - Iterative methods - Random processes - Security of data - Theorem proving Uncontrolled terms:Composite dynamical systems - Plain text - Secret keys - Stream cipher 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 - 921 Mathematics - 922 Statistical Methods Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 107> Accession number:2003517786684 Title:Rate distortion optimized mode decision in the scalable video coding Authors:Yang, Zhijie (1); Wu, Feng (2); Li, Shipeng (2) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080; (2) Microsoft Research Asia, Beijing 100080 Corresponding author:Yang, Z. Source title:IEEE International Conference on Image Processing Abbreviated source title:IEEE Int Conf Image Process Volume:3 Issue date:2003 Publication year:2003 Pages:781-784 Language:English CODEN:85QTAW Document type:Conference article (CA) Conference name:Proceedings: 2003 International Conference on Image Processing, ICIP-2003 Conference date:September 14, 2003 - September 17, 2003 Conference location:Barcelona, Spain Conference code:62005 Sponsor:IEEE Signal Processing Society Publisher:Institute of Electrical and Electronics Engineers Computer Society Abstract:In this paper, we discuss how to apply the rate distortion technique to select the optimal mode in the scalable coding. Firstly, we analyze this problem from a general scalable model and point out that the complicated dependencies among the different macroblocks and layers make the original independency assumption no longer a right approximation. Secondly, we propose an EOD function to estimate this dependency and derive a simple formula of this function. We apply the proposed algorithm to the H.26L PFGS, and the experimental results show that the algorithm significantly improves the coding efficiency of the H.26L PFGS. Further studies on how to design the EOD function more accurately will be quite interesting and significant. Number of references:17 Main heading:Image coding Controlled terms:Algorithms - Functions - Lagrange multipliers - Optimization - Vectors Uncontrolled terms:Multi-mode video coders - Video sequences Classification code:723.2 Data Processing and Image Processing - 921 Mathematics - 921.1 Algebra - 921.5 Optimization Techniques Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 108> Accession number:2003367626177 Title:Research on an image deformation algorithm based on calculus and its implementation Authors:Zou, Bei-Ji (1); Zhou, Hao-Yu (2); Lu, Ge-Feng (2); Sun, Jia-Guang (1) Author affiliation:(1) Dept. of Comp. Sci. and Technol., Tsinghua Univ., Beijing 100084, China; (2) Coll. of Comp. and Commun., Hu'nan Univ., Changsha 410082, China; (3) Lab. of Comp. Sci., Inst. of Software, Chinese Acad., Beijing 100080, China Corresponding author:Zou, B.-J. (bjzou@) Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:31 Issue:5 Issue date:May 2003 Publication year:2003 Pages:674-678 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:The image deformation often appears in the image processing system. So it is necessary to develop a highly efficient algorithm to get a good result of the deformation. But most of the existing deformation algorithms are based on Pixel-Fill-Method, and there are some obvious faults in these algorithms: (1) When the shape of the deformation region is complex, the efficiency of these algorithms is lower. (2) Some errors may occur when the pixels are mapped from the original image region to the destination image region since one target pixel may be relative to several source pixels. To solve these problems, a new deformation algorithm based on calculus is presented. In this algorithm a complex shape deformation region will be divided into several sub-regions firstly, and then each sub-region will be divided into many Small-Rectangles, at last a standard rectangle fill algorithm is applied to fill pixels in the corresponding rectangles. The experimental results from our algorithm show that there is a better effect of image deformation and a higher efficiency when using our algorithm. And our algorithm is successfully applied to a human face beautifying system based on its real photo which was developed by the authors. Abstract type:(Edited Abstract) Number of references:10 Main heading:Image processing Controlled terms:Algorithms - Computer graphics - Differentiation (calculus) Uncontrolled terms:Human face beautifying systems - Image deformation - Pixel fill method - Standard rectangle fill algorithms Classification code:723.2 Data Processing and Image Processing - 723.5 Computer Applications - 741 Light, Optics and Optical Devices - 921.2 Calculus - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. EI 2004 <RECORD 1> Accession number:2004508718395 Title:Enhancing global SLS-resolution with loop cutting and tabling mechanisms Authors:Shen, Yi-Dong (1); You, Jia-Huai (2); Yuan, Li-Yan (2) Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Department of Computing Science, University of Alberta, Edmonton, Alta. T6G 2H2, Canada Corresponding author:Shen, Y.-D. (ydshen@ios.ac.cn) Source title:Theoretical Computer Science Abbreviated source title:Theor Comput Sci Volume:328 Issue:3 Issue date:December 3, 2004 Publication year:2004 Pages:271-287 Language:English ISSN:03043975 CODEN:TCSCDI Document type:Journal article (JA) Publisher:Elsevier Abstract:Global SLS-resolution is a well-known procedural semantics for top-down computation of queries under the well-founded model. It inherits from SLDNF-resolution the linearity property of derivations, which makes it easy and efficient to implement using a simple stack-based memory structure. However, like SLDNF-resolution it suffers from the problem of infinite loops and redundant computations. To resolve this problem, in this paper we develop a new procedural semantics, called SLTNF-resolution, by enhancing Global SLS-resolution with loop cutting and tabling mechanisms. SLTNF-resolution is sound and complete w.r.t. the well-founded semantics for logic programs with the bounded-term-size property, and is superior to existing linear tabling procedural semantics such as SLT-resolution. &copy; 2004 Elsevier B. V. All rights reserved. Number of references:38 Main heading:Semantics Controlled terms:Algorithms - Computational methods - Logic programming - Mathematical models - Problem solving - Query languages Uncontrolled terms:Global SLS resolution - Loop cutting - Tabling - The well-founded semantics Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1.1 Computer Programming Languages - 723.3 Database Systems - 723.4 Artificial Intelligence - 903.2 Information Dissemination - 921 Mathematics Treatment:Theoretical (THR) DOI:10.1016/j.tcs.2004.07.028 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 2> Accession number:2004488687441 Title:Evaluation algorithms of a new kind of recursive functions Authors:Chen, Hai-Ming (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Chen, H.-M. (chm@ios.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:9 Issue date:September 2004 Publication year:2004 Pages:1277-1291 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Recursive functions on context-free languages (CFRF) are a kind of new recursive functions proposed especially for describing non-numerical algorithms used on computers. An important research aspect of this kind of functions is the exploration of evaluation algorithms. The paper summarizes the author's research on this issue. Beginning by a discussion on possible combinations of calculation and parsing, it presents a comprehensive introduction to the major algorithms in an order in which the applicable ranges of the algorithms increase (this is also the order that the algorithms were devised). The introduction emphasizes on a new, efficient, and general evaluation algorithm, i.e. the tree-oriented evaluation algorithm. The paper also explains the evaluation method for the many-sorted recursive functions extended from CFRF. The algorithms of CFRF are realized on computers, and are validated by practice. Abstract type:(Edited Abstract) Number of references:23 Main heading:Recursive functions Controlled terms:Algorithms - Computers - Context free grammars - Context free languages - Evaluation - Trees (mathematics) Uncontrolled terms:Evaluation algorithms - Nonnumerical algorithms - Tree oriented evaluation 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 - 921 Mathematics Treatment:Applications (APP); General review (GEN); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 3> Accession number:2004248214256 Title:Research and implementation on improving kernel premempablity of Linux Authors:Zhao, Hui-Bin (1); Li, Xiao-Qun (1); Sun, Yu-Fang (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhao, H.-B. (hbzhao@sonata.iscas.ac.cn) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:27 Issue:2 Issue date:February 2004 Publication year:2004 Pages:244-251 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:Using an open source system, Linux, as the supporting OS is more and more popular in many fields, and it is regarded as a potential aspect by many users to improve Linux performance to satisfy the real-time requirements. Inspired mostly by some real time improvements of Linux, the article gives rise to three methods to improve the prempatibility of Linux kernel: tasked interrupt handling, modified mutex mechanism and mutex protocol support. The authors also describe the implementation under version of 2.2 series. The modification is a successful effort to decrease the grain of kernel trap and increase the precision of schedule. Abstract type:(Edited Abstract) Number of references:7 Main heading:Computer operating systems Controlled terms:Distributed database systems - Network protocols - Real time systems Uncontrolled terms:Kernel Premempablity - Linux - Mutex - Open source system - Priority ceiling protocol - Priority inheritance protocol Classification code:722 Computer Systems and Equipment - 722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 723.3 Database Systems Treatment:Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 4> Accession number:2004318296854 Title:Fuzzy dynamic pre-emptive scheduling algorithms Authors:Jin, Hong (1); Wang, Hong-An (1); Wang, Qiang (1); Fu, Yong (1); Wang, Hui (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Jin, H. (hjin@iel.iscas.ac.cn) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:27 Issue:6 Issue date:June 2004 Publication year:2004 Pages:812-818 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:Aiming to uncertain task characteristics, it is presented to apply fuzzy theory to dynamic preemptive scheduling. Making use of linguistic fuzzy sets for describing uncertain characteristics and different priority levels, the principle of maximum membership function for determining task priority level, and the policy of scheduling tasks with high priority lever first for increasing the scheduling success ratio of critical tasks, it realizes the preemptive scheduling of tasks with uncertain characteristics. Compared to the classical EDF and LSF, the simulations show that the proposed approach can improve the scheduling success ratio of critical tasks and reduce their mean missed deadline rate, meanwhile, mean switching number among tasks gets decreased greatly compared to LSF and is close to EDF. The proposed method can be applied to control task scheduling in computer-controlled systems, and used for reference in real-time scheduling research with uncertain characteristic or limited priority level. Number of references:10 Main heading:Real time systems Controlled terms:Computer control systems - Fuzzy sets - Membership functions - Scheduling Uncontrolled terms:Dynamic preemptive scheduling algorithm - Linguistic fuzzy set - Priority level - Real time scheduling - Scheduling policy - Uncertain task Classification code:722.4 Digital Computers and Systems - 731.1 Control Systems - 921 Mathematics Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 5> Accession number:2004498707828 Title:Manifold-guaranteed out-of-core simplification based on vertex clustering Authors:Cai, Kangying (0); Sun, Hanqiu (0); Wu, Enhua (0) Corr. author affiliation:Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., 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:16 Issue:10 Issue date:October 2004 Publication year:2004 Pages:1346-1354 Language:Chinese ISSN:10039775 CODEN:JFTXFX Document type:Journal article (JA) Publisher:Institute of Computing Technology, Beijing, China Abstract:In this paper we propose a manifold-guaranteed out-of-core simplification algorithm based on vertex clustering, referred to as MAG-Simp. All the manifold parts generated by vertex-clustering strategy are categorized into three types, triangle segments, inherent non-manifold edges and inherent non-manifold vertices. All the three types of non-manifold parts can be converted into manifold by simple operations. Our MAG-Simp algorithm does not require the input with manifold topology while the manifold topology of the resultant models could be guaranteed. Both the efficiency and simplicity of vertex clustering strategy and the quality of the simplified model are maintained. Number of references:19 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 6> Accession number:2004398380408 Title:An efficient multicast protocol in mobile IPv6 networks Authors:Sun, Limin (1); Liao, Yong (1); Zheng, Jianping (1); Yichuan, Wu (1); Ma, Jian (2) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, China; (2) Nokia Research Center, China, Beijing, China Corresponding author:Sun, L. (slm@iscas.ac.cn) Source title:2004 IEEE Wireless Communications and Networking Conference, WCNC 2004 Abbreviated source title:2004 IEEE Wireless Commun. Networking Conf. Volume:1 Monograph title:2004 IEEE Wireless Communications and Networking Conference, WCNC 2004 Issue date:2004 Publication year:2004 Pages:155-159 Language:English ISBN-10:0780383443 ISBN-13:9780780383449 Document type:Conference article (CA) Conference name:2004 IEEE Wireless Communications and Networking Conference, WCNC 2004 Conference date:March 21, 2004 - March 25, 2004 Conference location:Atlanta, GA, United states Conference code:63498 Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Mobile IPv6 provides two basic schemes called remote subscription and home subscription to provide multicast service for mobile hosts. Those two algorithms have complementary advantages. In this paper, we propose a new scheme called previous network subscription, which can provide low handover delay for real time multicast applications. We also propose a new multicast routing protocol called RHMoM (Region based Hierarchical Mobile Multicast) by combining the previous network subscription and the home subscription. RHMoM uses two kinds of agent and employs the region based hierarchical architecture to limit the reconstruction frequency of the multicast tree and optimize the delivery path. The simulation results show that RHMoM has better performance than other mobile multicast solutions in mobile IPv6 network. Number of references:11 Main heading:Telecommunication networks Controlled terms:Algorithms - Multicasting - Network protocols - Packet networks - Packet switching - Synchronization Uncontrolled terms:Hierarchial architecture - IPv6 - Mobile multicast protocol - Previous network subscription Classification code:716 Telecommunication; Radar, Radio and Television - 717 Optical Communication - 718 Telephone Systems and Related Technologies; Line Communications - 723 Computer Software, Data Handling and Applications - 731.1 Control Systems - 921 Mathematics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 7> Accession number:2004488478332 Title:A transaction model for long running business processes Authors:Wang, Jinling (1); Jin, Beihong (1); Li, Jing (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, China Corresponding author:Wang, J. (jlwang@otcaix.iscas.ac.cn) Source title:ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems Abbreviated source title:ICEIS Proc. Sixth Int. Conf. Enterp. Inf. Syst. Monograph title:ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems Issue date:2004 Publication year:2004 Pages:267-274 Language:English ISBN-10:9728865007 ISBN-13:9789728865009 Document type:Conference article (CA) Conference name:ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems Conference date:April 14, 2004 - April 17, 2004 Conference location:Porto, Portugal Conference code:63846 Sponsor:I2S Informatica Sistemas Servicos; Oni; Associacao Comercial do Porto; Camara Municipal do Porto; Sogrape Publisher:Inst. for Syst. and Technol. of Inf., Control and Commun. (INSTICC) Abstract:Many business processes in the enterprise applications are both long running and transactional in nature, but currently no transaction model can provide full transaction support for such long running business processes. In this paper, we proposed a new transaction model - PP/T model. It can provide full transaction support for the long running business processes, so that application developers can focus on the business logic, with the underlying platform providing the required transactional semantics. Simulation results show that the model has good performance in processing the long running business processes. Number of references:9 Main heading:Database systems Controlled terms:Computer aided design - Computer simulation - Control systems - Problem solving - Semantics Uncontrolled terms:Semantic constraints - Transaction models - Transactional semantics Classification code:723.3 Database Systems - 723.4 Artificial Intelligence - 723.5 Computer Applications - 731.1 Control Systems - 903.2 Information Dissemination Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 8> Accession number:2004388367825 Title:A new role-based access control model using attribute certificate Authors:Xie, Dongqing (1); Wang, Yongjing (1); Chen, Huayong (1) Author affiliation:(1) Coll. of Computer and Communication, Hunan University, Changsha, 410082; (2) Laboratory of Computer Science, Institute of Software, Chinese Academic of Science, Beijing 100080 Corresponding author:Xie, D. (dqxie@hnu.cn) Source title:Proceedings of the World Congress on Intelligent Control and Automation (WCICA) Abbreviated source title:Proc. World Congr. Intelligent Control Autom. WCICA Volume:5 Monograph title:WCICA 2004 - Fifth World Congress on Intelligent Control and Automation, Conference Proceedings Issue date:2004 Publication year:2004 Pages:4335-4338 Language:Chinese Document type:Conference article (CA) Conference name:WCICA 2004 - Fifth World Congress on Intelligent Control and Automation, Conference Proceedings Conference date:June 15, 2004 - June 19, 2004 Conference location:Hangzhou, China Conference code:63444 Sponsor:Zhejiang University; National Laboratory of Industrial Control Technology; Zhejiang University of Technology Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Traditional Role Based Access Control (RBAC) systems perform in low security level yet cost much in management and inter-operation under complex network environment. We present a new RBAC model using attribute certificate (AC-RBAC), which makes privilege information independent from Public Key certificates and constructs Role-Permission attribute certificates and User-Role attribute certificates to authorization. The model implements user verification and RBAC with PKI arid PMI to enhance system resource security and supplies a effective, manage easy and inter-operation nice scheme for access control in distributed environment. Number of references:10 Main heading:Control systems Controlled terms:Computer networks - Information analysis - Public key cryptography - Security of data Uncontrolled terms:Attribute certificate - Authentication - Authorization - Role based access control (RBAC) Classification code:716 Telecommunication; Radar, Radio and Television - 723.2 Data Processing and Image Processing - 731.1 Control Systems - 903.1 Information Sources and Analysis Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 9> Accession number:2005219121854 Title:A semantic-aware publish/subscribe system with RDF patterns Authors:Wang, Jinling (1); Jin, Beihong (1); Li, Jing (1); Shao, Danhua (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, China Corresponding author:Wang, J. (jlwang@otcaix.iscas.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 of the 28th Annual International Computer Software and Applications Conference, COMPSAC 2004 Issue date:2004 Publication year:2004 Pages:141-146 Language:English ISSN:07303157 CODEN:PSICD2 Document type:Conference article (CA) Conference name:Proceedings of the 28th Annual International Computer Software and Applications Conference, COMPSAC 2004 Conference date:September 28, 2004 - September 30, 2004 Conference location:Hong Kong, China, Hong kong Conference code:64717 Publisher:Institute of Electrical and Electronics Engineers Computer Society Abstract:The publish/subscribe paradigm provides a loosely coupled form of interaction that is well suitable for the large-scale distributed systems. In this paper, we introduce the Semantic Web technologies into the publish/subscribe systems and propose a new type of publish/subscribe system. In the system, concept models are represented as ontologies, events are represented as RDF graphs, and subscriptions are represented as RDF graph patterns. The system can match events with subscriptions based on the semantics of events, and support events with complex data structures such as graphs. &copy; 2004 IEEE. Number of references:19 Main heading:Semantics Controlled terms:Algorithms - Computer software - Data processing - Data structures - Distributed computer systems - Graph theory - World Wide Web - XML Uncontrolled terms:IBM (CO) - Ontology-based publish/subscribe (OPS) system - Semantic Web technologies - Subscribers Classification code:716 Telecommunication; Radar, Radio and Television - 722.4 Digital Computers and Systems - 723.2 Data Processing and Image Processing - 903.2 Information Dissemination - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 10> Accession number:2004268238237 Title:Priority table based real-time scheduling algorithm Authors:Wang, Qiang (1); Xu, Jun-Gang (1); Wang, Hong-An (1); Dai, Guo-Zhong (1) Author affiliation:(1) Intelligence Eng. Lab., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wang, Q. Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:32 Issue:2 Issue date:February 2004 Publication year:2004 Pages:310-313 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:A new priority table based real-time scheduling algorithm named DVDF (Deadline-Value Density First) is proposed. This algorithm takes the deadlines and value density of real-time tasks into account synthetically, and can adapt different load conditions better. In contrast to classical EDF (Earliest Deadline First) algorithm that only considers the deadlines of real-time tasks, DVDF algorithm is shown to improve the performance of scheduling obviously by simulation with some typical data of various parameters under normal workload and overload situation, especially under overload situation, it can degrade gracefully. Number of references:9 Main heading:Scheduling Controlled terms:Algorithms - Computer simulation - Real time systems - Value engineering Uncontrolled terms:Deadline value density first - Differentiated guarantee ratio - Hit value ratio - Priority tables - Real time scheduling - Real time tasks - Weighted guarantee ratio Classification code:722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 911.5 Value Engineering - 912.2 Management - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 11> Accession number:2004198157011 Title:An operating system oriented RBAC model and its implementation Authors:Shan, Zhi-Yong (0); Sun, Yu-Fang (0) Corr. author affiliation:Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:41 Issue:2 Issue date:February 2004 Publication year:2004 Pages:287-298 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Science Press Abstract:The construction and implementation of an operating system oriented RBAC model are discussed in this paper. Firstly, on the basis of the RBAC96 model, a new RBAC model named 'OSR' is presented and formalized by adding executable-file component and subdividing permission component. Secondly, the OSR model is enforced in the secure Linux kernel by integrating the GFAC method and capability mechanism together. Number of references:25 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 12> Accession number:2004488687388 Title:Analysis on the two classes of robust threshold key escrow schemes Authors:Feng, Deng-Guo (1); Chen, Wei-Dong (2) Author affiliation:(1) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Lab. of Info. Security, Graduate Sch., Chinese Acad. of Sci., Beijing 100039, China; (3) Inst. of Electron., Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Feng, D.-G. Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:27 Issue:9 Issue date:September 2004 Publication year:2004 Pages:1170-1176 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:Key Escrow Scheme (KES) is initially a new cryptographic idea keeping balance between protecting a person's right to privacy and safeguarding public interests and national security in communications. Since Escrowed Encryption Standard was published by NISTYLE="in 1994, KES has been one of the focuses of attention of cryptology community. The basic method is that users communicate in the way appending LEAF (Law Enforcement Access Field, usually consisting of users' escrowed key information) on encrypted message, by which the accredited monitor can listen in the communications. Recently two classes of new schemes, RTKES1 and RTKES2, are proposed by CAO, who declares the two ones have many good properties, such as solving the problems of once monitor, monitor forever, verification of users' key shares escrowed, identifying malicious escrow agencies, resisting LEAF Feedback attacks. Especially CAO claims the schemes offer the Robustness, i.e. even the whole escrow agencies being malicious, they can not recover the key of users. In this paper, the two schemes are analyzed systematically and many practical attacks on them are provided, and the final conclusion is negative, i.e. both of them are proved to be not secure at all. First, the formalization model of KES analysis is formulated mainly based on credible degree function put forward by us for the first time. Second, authors put forward two effective subliminal channel attacks on RTKES, the former is a kind of Shadow Session Key attack in nature and the latter makes use of the subliminal channel offered by signatures. Third, by constructing Cheating attacks successfully, it is shown that RTKES1 and RTKES2 does not really solve the problems mentioned above. Finally, according to comprehensive theoretic analysis, authors argue whether RTKES gain their end of robustness is worth deliberating. In addition, some groupwares of RTKES are proved to be redundant or not necessary. Number of references:12 Main heading:Security of data Controlled terms:Algorithms - Cryptography - Data privacy Uncontrolled terms:ElGamal cryptosystem - Improved Rivest Shamir Adleman cryptosystem - Key escrow - Threshold scheme Classification code:723.2 Data Processing and Image Processing Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 13> Accession number:2004468461412 Title:Discovering ordered tree patterns from XML queries Authors:Chen, Yi (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences Source title:Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) Abbreviated source title:Lect Notes Artif Intell Volume:3056 Monograph title:Advances in Knowledge Discovery and Data Mining Issue date:2004 Publication year:2004 Pages:559-563 Language:English ISSN:03029743 CODEN:LNAIE4 Document type:Conference article (CA) Conference name:8th Pacific-Asia Conference, PAKDD 2004 Conference date:May 26, 2004 - May 28, 2004 Conference location:Sydney, Australia Conference code:63763 Sponsor:SAS, Australia and New Zealand; University of Technology, Sydney, UTS; Sociedad Mexicana de Ciencia de la Computacion, Mexico Publisher:Springer Verlag Abstract:Recently, several researches have investigated the discovering of frequent XML query patterns using frequent structure mining techniques. All these works ignore the order properties of XML queries, and therefore are limited in their effectiveness. In this paper, we consider the discovering of ordered query patterns. We propose an algorithm for ordered query pattern mining. Experiments show that our method is efficient. Number of references:4 Main heading:XML Controlled terms:Algorithms - Data mining - Pattern recognition - Query languages - Trees (mathematics) Uncontrolled terms:Query patterns - Tree patterns - XML queries Classification code:723 Computer Software, Data Handling and Applications - 723.1.1 Computer Programming Languages - 723.2 Data Processing and Image Processing - 723.5 Computer Applications - 921 Mathematics - 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 14> Accession number:2005149020772 Title:Web service cooperation ideology Authors:Liu, Shaohua (1); Wei, Jun (1); Ma, Yinglong (1); Liu, Yu (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@otcaix.iscas.ac.cn) Source title:Proceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004 Abbreviated source title:Proc. IEEE WIC ACM Int. Conf. Web Intell. WI Monograph title:Proceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004 Issue date:2004 Publication year:2004 Pages:537-540 Language:English ISBN-10:0769521002 ISBN-13:9780769521008 Document type:Conference article (CA) Conference name:Proceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004 Conference date:September 20, 2004 - September 24, 2004 Conference location:Beijing, China Conference code:64424 Sponsor:IEEE Computer Society; Web Intelligence Consortium, WIC; Association for Computing Machinery Publisher:IEEE Computer Society Abstract:As the Internet environment becomes more and more dynamic, open and mutable, future software have to be more autonomic, reactive, adaptive, cooperative, and evolvable. To meet the need, we introduce emerging service cooperation middleware providing such infrastructure support. Derived from Chinese ancient five-elements ideology, a similar service cooperation philosophy is developed. Complying the idea, we develop a workflow system, PI, supporting Process Intelligence. We believe that the service cooperation will become a feasible solution to the future complex environment. &copy; 2004 IEEE. Number of references:6 Main heading:World Wide Web Controlled terms:Artificial intelligence - Computer architecture - Data structures - Information retrieval - Metadata - Middleware - Virtual reality Uncontrolled terms:Process intelligence - Service cooperation middleware (SCM) architecture - Service providers - Web services Classification code:903.3 Information Retrieval and Use - 723.4 Artificial Intelligence - 723.2 Data Processing and Image Processing - 723.1 Computer Programming - 723 Computer Software, Data Handling and Applications - 722 Computer Systems and Equipment - 716 Telecommunication; Radar, Radio and Television Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 15> Accession number:2004318292210 Title:Large scale petroleum reservoir simulation and parallel preconditioning algorithms research Authors:Sun, Jiachang (0); Cao, Jianwen (0) Corr. author affiliation:R and D Ctr. for Parallel Software, Inst. of Software, Chinese Acad. of Sciences, Beijing 100080, China Source title:Science in China, Series A: Mathematics Abbreviated source title:Sci. China Ser. A Math. Volume:47 Issue:SUPPL. Issue date:April 2004 Publication year:2004 Pages:32-40 Language:English ISSN:10069283 Document type:Journal article (JA) Publisher:Science in China Press, Beijing, China Abstract:Solving large scale linear systems efficiently plays an important role in a petroleum reservoir simulator, and the key part is how to choose an effective parallel preconditioner. Properly choosing a good preconditioner has been beyond the pure algebraic field. An integrated preconditioner should include such components as physical background, characteristics of PDE mathematical model, nonlinear solving method, linear solving algorithm, domain decomposition and parallel computation. We first discuss some parallel preconditioning techniques, and then construct an integrated preconditioner, which is based on large scale distributed parallel processing, and reservoir simulation-oriented. The infrastructure of this preconditioner contains such famous preconditioning construction techniques as coarse grid correction, constraint residual correction and subspace projection correction. We essentially use multi-step means to integrate totally eight types of preconditioning components in order to give out the final preconditioner. Million-grid cell scale industrial reservoir data were tested on native high performance computers. Numerical statistics and analyses show that this preconditioner achieves satisfying parallel efficiency and acceleration effect. Number of references:15 DOI:10.1360/04za0003 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 16> Accession number:2004508717059 Title:Study on authenticated dictionary and its applications in PKI Authors:Qing, Si-Han (1); Zhou, Yong-Bin (1); Zhang, Zhen-Feng (1); Liu, Juan (4) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Ctr. for Info. Security Technol., Chinese Acad. of Sci., Beijing 100080, China; (3) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (4) Dept. of History, Yunan Nationalities Univ., Kunming 650031, China Corresponding author:Qing, S.-H. Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:32 Issue:8 Issue date:August 2004 Publication year:2004 Pages:1356-1359 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Authenticated Dictionary (AD) is one of the important data structures, and it is of great theoretic and applicable value in many research fields. Basic concept and principle of AD were examined. Time constraint was introduced into the model of AD, based on which a new taxonomy of AD was presented. Afterwards, different implementation technologies of AD were given on the base of typical application of ADs in PKI fields. A brief performance analysis and comparison among these certificate revocation schemes based on different ADs were carried out. Number of references:12 Main heading:Data structures Controlled terms:Classification (of information) - Glossaries - Mathematical models - Public key cryptography - Security of data - Set theory Uncontrolled terms:Authenticated dictionary (AD) - Certificate revocation - Public key infrastructures (PKI) - Time constraints Classification code:716.1 Information Theory and Signal Processing - 723.2 Data Processing and Image Processing - 723.5 Computer Applications - 902.2 Codes and Standards - 903.2 Information Dissemination - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 17> Accession number:2004268236302 Title:Construction of a new CEMBS based on RSA cryptosystem Authors:Zhou, Yong-Bin (0); Zhang, Zhen-Feng (0); Qing, Si-Han (0); Ji, Qing-Guang (0); Yuan, Xiu-Mei (0) Corr. author affiliation:Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:41 Issue:3 Issue date:March 2004 Publication year:2004 Pages:420-425 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Science Press Abstract:Fairness is one of the basic requirements of E-commerce protocols. CEMBS is proved to be an important cryptographic building primitive in constructing fair exchange protocols. In this paper flaws of the existing CEMBS-implementing methods are analyzed. A new CEMBS-constructing method based on RSA cryptosystem is proposed, which is proved simple, efficient and secure. Afterwards, a fair exchange protocol is built using the newly constructed CEMBS. And the devised scheme is the first efficient CEMBS based on RSA, which is the most popular public key cryptosystem. Number of references:15 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 18> Accession number:2004378354997 Title:Behavior-based navigation control of wheeled mobile robot Authors:Li, Lei (1); Cao, Zhi-Qiang (1); Hou, Zeng-Guang (1); Tan, Min (1) Author affiliation:(1) Inst. of Automat., Chinese Acad. of Sci., Beijing 100080, China; (2) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Li, L. Source title:Kongzhi yu Juece/Control and Decision Abbreviated source title:Kongzhi yu Juece Control Decis Volume:19 Issue:6 Issue date:June 2004 Publication year:2004 Pages:707-710 Language:Chinese ISSN:10010920 CODEN:KYJUEF Document type:Journal article (JA) Publisher:Northeast University Abstract:A wheeled mobile robot CASIA-I and its locomotion system are introduced. To the locomotion system, the kinematics equation and behavior-based navigation control algorithm are constructed. Software simulation and experiment are conducted according to the proposed algorithm. Experiment results show the effectiveness of the navigation algorithm. Number of references:3 Main heading:Mobile robots Controlled terms:Collision avoidance - Computer simulation - Navigation systems Uncontrolled terms:Kinematics equations - Locomotion system - Wheeled mobile robots Classification code:731.5 Robotics - 914.1 Accidents and Accident Prevention Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 19> Accession number:2004248214407 Title:Reliable multicast for real-time continuous-media streams over switch ethernet Authors:Wang, Jun (1); Wu, Zhi-Mei (1) Author affiliation:(1) Multimedia Commun. Ctr., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wang, J. (wyj@iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:2 Issue date:February 2004 Publication year:2004 Pages:229-237 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:A reliable multicast protocol for real-time continuous-media streams on switch Ethernet after research of the LANs' special features for reliable multicast is proposed. The recovery of this protocol begins with the receiver's detection of packet loss by packet's number, and the second step of it is the NAK (negative acknowledgment) suppression procedure. Then the sender will retransmit the lost packet by the received NAK, and finally the receiver will discard or accept the recovered packet based on the limit of the real-time playback. The experimental results and the analysis of performance demonstrate the effectiveness and reliability of the approach. Number of references:18 Main heading:Multicasting Controlled terms:Local area networks - Multimedia systems - Network protocols - Packet switching - Performance - Real time systems - Reliability - Switching networks Uncontrolled terms:Negative acknowledgment suppression - Real time continuous media stream - Reliable multicast - Roundtrip delay Classification code:718 Telephone Systems and Related Technologies; Line Communications - 721 Computer Circuits and Logic Elements - 722.4 Digital Computers and Systems - 723.5 Computer Applications Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 20> Accession number:2004258227571 Title:Research and revision on transmission of MPEG-2 transport stream Authors:Hong, Fei (1); Wu, Zhi-Mei (1) Author affiliation:(1) Multimedia Res. Ctr., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Hong, F. (hongfei@iscas.cn) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:27 Issue:3 Issue date:March 2004 Publication year:2004 Pages:352-356 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:The transmission of high-quality streaming media plays a key role in providing streaming services, which poses great challenges. Transmitting compressed variable bit rate video with traditional constant bit-rate (CBR) service for continuous playback requires a large buffer at the viewer's side. This paper studies one new CBR transmission scheme, called PCR-assist CBR (PCBR), in detail, which employs the Program Clock Reference embedded in the MPEG-2 Transport Streams to reduce the buffer requirement. The PCBR scheme uses PCRs to examine its transmission regularly, which reduces the buffer requirement at the cost of higher transmission rate. Authors present the revised PCBR scheme which reduces the transmission rate by shorting the transmit time scale. Simulation results in NS and authors' broadband testbed both show that this method serves best for the transmission and playback by slowing down the transmission rate without higher buffer requirement. Abstract type:(Edited Abstract) Number of references:12 Main heading:Electric power transmission networks Controlled terms:Buffer amplifiers - Code converters - Embedded systems - Multimedia systems Uncontrolled terms:Constant bit rate - Program clock reference - Transmission rate Classification code:706.1.1 Electric Power Transmission - 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 21> Accession number:2004488687435 Title:Adaptive sampling methodology in network measurements Authors:Wang, Jun-Feng (1); Yang, Jian-Hua (3); Zhou, Hong-Xia (4); Xie, Gao-Gang (3); Zhou, Ming-Tian (1) Author affiliation:(1) Coll. of Comp. Sci. and Eng., Univ. of Electron. Sci. and Technol., Chengdu 610054, China; (2) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (3) Network Res. Div., Inst. of Comp. Technol., Chinese Acad. of Sci., Beijing 100080, China; (4) Coll. of Electron. Eng., Univ. of Electron. Sci. and Technol., Chengdu 610054, China Corresponding author:Wang, J.-F. (mailwangjf@.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:8 Issue date:August 2004 Publication year:2004 Pages:1227-1236 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Sampling methodologies are widely used in network measurements and other related fields. Most applications mainly focus on parent population statistical metrics estimation of interest. Recent researches reveal that many aspects of network characters present heavy-tailed distribution or self-similarity. These properties might cause a heavy passive effect on the estimation accuracy. In other circumstances, there exist demands on modeling the characteristics of a network in network operation. To develop an accurate model for network character is much difficult. From a broader view, these applications are treated as special cases of fitting problems of planar data set or time series in applied mathematics. A Fitting-based adaptive sampling methodology (FASM) is developed for reconstructing the evolution of some network characteristics (model). The contributions of the paper include: (1) Adopting a Piecewise Linear Function Approximation scheme to provide a more accurate approximation of the true character. (2) The statistical metric derived from the FASM provides a much more stable and accurate estimation than other popular methodologies under the same sampling size. Experiments based on two measurement traces show that the FASM can dramatically reduce the number of samples while retaining the same approximating residual error as others. (3) The variance of sampling size is more stable than those of other probability sampling schemes. Number of references:10 Main heading:Sampling Controlled terms:Algorithms - Approximation theory - Internet - Measurements - Parameter estimation - Statistical methods Uncontrolled terms:Adaptive sampling - Network measurements - Piecewise linear fitting Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer Software, Data Handling and Applications - 731.1 Control Systems - 913.3 Quality Assurance and Control - 921 Mathematics - 922 Statistical Methods Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 22> Accession number:2004328299600 Title:Improved method to enforce BLP model and its variations in role-based access control Authors:Liang, Bin (1); Sun, Yu-Fang (1); Shi, Wen-Chang (1); Sun, Bo (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Lab. of Info. Security, Beijing 100080, China Corresponding author:Liang, B. (liangbin01@ios.cn) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:27 Issue:5 Issue date:May 2004 Publication year:2004 Pages:636-644 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:The existing classical method of enforcing BLP model in Role-based Access Control (RBAC) model presented by Sandhu et al. is researched and analyzed. Some errors of it are revealed, such as denial of service, over many privileges may be granted to the subjects, etc. Additionally, it also lacks of enough support to the classical BLP model. An improved method called ISandhu method is presented; it introduces assistant role hierarchies, strengthens role relations, and provides the support to the notation of trusted subject. Based on this method, the mistakes of the original method are revised and the classical BLP model and some variations of it are enforced in RBAC to meet the practical requirements. As results, the exact enforcement of mandatory access control (MAC) in RBAC is guaranteed and the theoretical foundation for adopting MAC in a large amount of commercial systems with small cost is offered. Number of references:13 Main heading:Security of data Controlled terms:Commerce - Mathematical models - Network protocols Uncontrolled terms:BLP models - ISandlu method - Mandatory access control - Role based access control - Role hierarchy - Trusted subjects Classification code:723 Computer Software, Data Handling and Applications - 911.4 Marketing - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 23> Accession number:2004538760287 Title:State of the art and future challenge on general purpose computation by graphics processing unit Authors:Wu, En-Hua (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Dept. of Comp. and Info. Sci., Faculty of Sci. and Technol., Univ. of Macau, Macau, China Corresponding author:Wu, E.-H. (ehwu@umac.mo) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:10 Issue date:October 2004 Publication year:2004 Pages:1493-1504 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Graphics processing unit (GPU) has been developing rapidly in recent years at a speed over Moor's law, and as a result, various applications associated with computer graphics advance greatly. At the same time, the highly processing power, parallelism and programmability available nowadays on the contemporary GPU provide an ideal platform on which the general-purpose computation could be made. Starting from an introduction to the development history and the architecture of GPU, the technical fundamentals of GPU are described. Then in the main part of the paper, the development of various applications on general purpose computation on GPU is introduced, and among those applications, fluid dynamics, algebraic computation, database operations, and spectrum analysis are introduced in detail. The experience of our work on fluid dynamics has been also given, and the development of software tools in this area is introduced. Finally, a conclusion is made, and the future development and the new challenge on both hardware and software in this subject are discussed. Number of references:57 Main heading:Computer graphics Controlled terms:Calculations - Computer applications - Computer graphics equipment - Computer hardware - Computer software - Database systems - Fluid dynamics - Spectrum analysis Uncontrolled terms:Algebraic computations - General purpose computations - Graphics processing units - Programmability - Real time computations - Stream processing Classification code:722 Computer Systems and Equipment - 723.3 Database Systems - 723.5 Computer Applications - 741 Light, Optics and Optical Devices - 921 Mathematics - 922 Statistical Methods Treatment:Applications (APP); General review (GEN); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 24> Accession number:2005209100432 Title:An adaptive strategy for high-speed network flow compression Authors:Wang, Junfeng (1); Li, Lei (1); Zhou, Mingtian (2); Xu, Fanjiang (1); Sun, Fuchun (3) Author affiliation:(1) Laboratory of General Software, Institute of Software, Chinese Academy of Sciences; (2) Coll. of Comp. Sci. and Engineering, Univ. Electron. Sci./Technol. China; (3) Dept. of Comp. Sci. and Technology, Tsinghua University Corresponding author:Wang, J. (mailwangjf@.cn) Source title:GLOBECOM - IEEE Global Telecommunications Conference Abbreviated source title:GLOBECOM IEEE Global Telecommun. Conf. Volume:3 Monograph title:GLOBECOM'04 - IEEE Global Telecommunications Conference Issue date:2004 Publication year:2004 Pages:1645-1649 Article number:GI11-3 Language:English Document type:Conference article (CA) Conference name:GLOBECOM'04 - IEEE Global Telecommunications Conference Conference date:November 29, 2004 - December 3, 2004 Conference location:Dallas, TX, United states Conference code:64670 Sponsor:IEEE Communications Society; ICC Globecom Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Collecting network traffic is becoming a more challenging task in passive network measurement due to the rapid growth of link speed. Flow-based network traffic capture and storage is an efficient way for high-speed network measurement. Based on the statistical investigation of the correlations between flow size and the maximum packets interinterval time of consecutive packets within a flow, we obtain the empirical conditional distribution functions for some popular TCP protocol-based application flows, and then propose a Probability-Guaranteed Adaptive Timeout algorithm (PGAT) for flow termination decision. The assessment criteria for flow termination decision algorithm is systematically developed. Comparisons on flow generation ratio, flow intact ratio, and mean flow extra retaining time metrics indicate that the PGAT algorithm can obtain more attractive performance than other schemes. &copy; 2004 IEEE. Number of references:14 Main heading:Packet networks Controlled terms:Algorithms - Bandwidth - Correlation theory - Functions - Internet - Network protocols - Probability distributions - Telecommunication links - Telecommunication traffic - Throughput Uncontrolled terms:Flow compression - Flow-based network traffic - High-speed networks - Probability-guaranteed adaptive timeout algorithm (PGAT) Classification code:716 Telecommunication; Radar, Radio and Television - 716.1 Information Theory and Signal Processing - 723 Computer Software, Data Handling and Applications - 921 Mathematics - 922.1 Probability Theory - 922.2 Mathematical Statistics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 25> Accession number:2004238200856 Title:An orientation update message filtering algorithm in collaborative virtual environments Authors:Zhang, Mao-Jun (1); Georganas, Nicolas D. (2) Author affiliation:(1) General Software Laboratory, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Discover Lab, SITE, University of Ottawa, Ottawa, Canada Corresponding author:Zhang, M.-J. (mzhang@discover.uottawa.ca) Source title:Journal of Computer Science and Technology Abbreviated source title:J Comput Sci Technol Volume:19 Issue:3 Issue date:May 2004 Publication year:2004 Pages:423-429 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:Orientation update message filtering is an important issue in collaborative virtual environments (CVEs). Dead-reckoning (DR) is a known effective mechanism for update message filtering. Yet, previous dead-reckoning techniques mainly focus on the update message filtering for positions. The existing orientation dead-reckoning algorithms are based on fixed threshold values. The drawbacks of fixed thresholding for orientations (FTO) are discussed in this paper. We propose a variable thresholding for orientations (VTO) based on average recent angular velocity. The main advantage of the proposed VTO is the ability of balancing the number of state update messages and shift frequency of direction and speed of rotation. Number of references:18 Main heading:Computer supported cooperative work Controlled terms:Algorithms - Error analysis - Multimedia systems - Quadratic programming - Signal filtering and prediction - Virtual reality Uncontrolled terms:Average recent angular velocity - Collaborative virtual environment - Dead-reckoning - Orientation update message filtering - Variable thresholding for orientation Classification code:716.1 Information Theory and Signal Processing - 723.1 Computer Programming - 723.5 Computer Applications - 921.6 Numerical Methods Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 26> Accession number:2004428410994 Title:Service selection in dynamic demand-driven web services Authors:Wang, Xiaoling (1); Yue, Kun (1); Huang, Joshua Zhexue (2); Zhou, Aoying (1) Author affiliation:(1) Dept. of Comp. Sci. and Engineering, Fudan University, ShangHai, 200433, China; (2) E-Business Technology Institute, University of Hong Kong, China; (3) Laboratory of Computer Science, Institute of Software, Chinese Academy of Science, China Corresponding author:Wang, X. (wxling@fudan.edu.cn) Source title:Proceedings - IEEE International Conference on Web Services, ICWS 2004 Abbreviated source title:Proc. IEEE Int. Conf. Web Serv. ICWS Monograph title:Proceedings - IEEE International Conference on Web Services, ICWS 2004 Issue date:2004 Publication year:2004 Pages:376-383 Language:English ISBN-10:0769521673 ISBN-13:9780769521671 Document type:Conference article (CA) Conference name:Proceedings - IEEE International Conference on Web Services, ICWS 2004 Conference date:June 6, 2004 - June 9, 2004 Conference location:San Diego, CA, United states Conference code:63605 Sponsor:IEEE Computer Society (TCSC) Publisher:IEEE Computer Society Abstract:Recently, Web services have become a new technology trend for Enterprise Application Integration (EAI) and more and more applications based on Web services are emerging. One of the problems in using Web services in business applications such as logistics is services composition automatically and efficiently. In this paper, we present a Dynamic, Demand-Driven Web services Engine called D3D-Serv to implement composite service functionality that is used to dynamically build composite services from existing services according to different business logics and requirements. In this D3D_Serv framework, the most challenging function to implement is dynamic selection of service providers at run time. The highly dynamic and distributed nature of Web services often makes some service providers overloaded at certain times while others idle. To solve this problem, we propose an efficient services selection and execution strategy that is based on the queuing theory and can provide guarantees for the QOS (Quality of Service) under provider's limited resources. Preliminary experimental results have shown that this algorithm is effective. Number of references:16 Main heading:World Wide Web Controlled terms:Computer simulation - Electronic commerce - Integration - Inventory control - Online systems - Quality of service - Resource allocation - Technology Uncontrolled terms:Business logic - Request for quotation (RFQ) - Service selection - Web services Classification code:921.2 Calculus - 912.2 Management - 911.3 Inventory Control - 901 Engineering Profession - 723.5 Computer Applications - 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 27> Accession number:2004398378594 Title:Research on a pen-based interaction paradigm in post-WIMP environment Authors:Tian, Feng (1); Mu, Shu (2); Dai, Guo-Zhong (1); Wang, Hong-An (1) Author affiliation:(1) Intelligence Eng. Lab., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Dept. of Psychology, Beijing Normal Univ., Beijing 100875, China Corresponding author:Tian, F. (tf@iel.iscas.ac.cn) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:27 Issue:7 Issue date:July 2004 Publication year:2004 Pages:977-984 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:Pen-based user interface is one of the main styles in Post-WIMP user interface. It is designed on the Pen-Paper metaphor that is analogous to the user's real working environment. It is a natural way for recording, communicating and capturing daily experiences. A new paradigm named PIBG is presented in this paper. In PIBG paradigm, P means physical object. Paper and Frame are main physical objects in PIBG paradigm. IB means icon and button. G means pen gesture. PIBG paradigm is based on Pen-Paper metaphor which is analogous to the user's real working environment. Compared with WIMP paradigm, the information presentation style and interaction style have changed. Widget containing application information is changed from Window to Paper and Frame, and user's action is changed from mouse pointing to pen gesture. The UI structure and interaction techniques of the paradigm are constructed in this paper. And the main characteristics of the paradigm are declared in detail from the viewpoint of Cognitive Psychology. At the end, the evaluation of PIBG paradigm is performed based on GOMS model. Evaluation results show that comparing with WIMP paradigm, PIBG paradigm can decrease user's cognitive load and improve user's interaction efficiency when user performs interaction tasks in pen-paper environment. Number of references:11 Main heading:User interfaces Controlled terms:Cognitive systems - Customer satisfaction - Gesture recognition - Human computer interaction Uncontrolled terms:Pen based interaction paradigm - Post WIMP environment Classification code:722.2 Computer Peripheral Equipment - 723.5 Computer Applications Treatment:Applications (APP); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 28> Accession number:2004268231070 Title:Building extensible and high performance distributed transaction service Authors:Zhang, Xin (1); Xu, Chang (1); Jin, Beihong (1) Author affiliation:(1) Technol. Ctr. of Software Eng., Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Zhang, X. (zhangxin@otcaix.iscas.ac.cn) Source title:Proceedings of the Australian Software Engineering Conference, ASWEC Abbreviated source title:Proc Aust Software Eng Conf ASWEC Volume:2004 Monograph title:Proceedings - 2004 Australian Software Engineering Conference ASWEC 2004 Issue date:2004 Publication year:2004 Pages:202-210 Language:English Document type:Conference article (CA) Conference name:Proceedings - 2004 Australian Software Engineering Conference ASWEC 2004 Conference date:April 13, 2004 - April 16, 2004 Conference location:Melbourne, Vic., Australia Conference code:63098 Sponsor:Australian Computer Society; Engineers Australia Publisher:Institute of Electrical and Electronics Engineers Computer Society Abstract:Distributed transaction service is one of the most important services in a J2EE application server, and its efficiency has a big impact on the latter's overall performance. This paper presents a distributed transaction service design which is both extensible and portable in a J2EE application server, and strategies to optimize its performance. Experimental data indicate much improved performance of the transaction service without sacrifice of transaction integrity. Number of references:15 Main heading:Distributed computer systems Controlled terms:Computer software - Constraint theory - Data processing - Network protocols - Resource allocation - Servers - User interfaces Uncontrolled terms:Distribution transaction - Resource managers - Transaction processing - Transaction service Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722.2 Computer Peripheral Equipment - 722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 723.2 Data Processing and Image Processing - 912.2 Management Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 29> Accession number:2004358329817 Title:Hierarchy reliable mobile multicast algorithm based on mixed acknowledgement mechanism Authors:Sun, Li-Min (1); Liao, Yong (1); Wu, Zhi-Mei (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Sun, L.-M. (sunlimin@ios.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:6 Issue date:June 2004 Publication year:2004 Pages:908-914 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:As mobile hosts dynamically change their locations, which makes the multicast transmission tree to be rebuilt frequently, the existing reliable multicast algorithms are unsuitable for mobile hosts in wireless IP networks, A new basic mobile multicast mechanism called previous network subscription is proposed. Then, a new reliable multicast algorithm supporting mobile hosts is given. Based on hierarchical architecture, this algorithm integrates previous network subscription and remote subscription. An ACK and NAK mixed acknowledgement mechanism is adopted, the lost packets are retransmitted by multicasting, and the NAK suppression is used in the subnet. The analysis and simulation results show that the algorithm has a good performance in terms of retransmission delay, retransmission cost, multicast service disruption, and protocol cost. Abstract type:(Edited Abstract) Number of references:7 Main heading:Multicasting Controlled terms:Algorithms - Computer simulation - Internet - Mobile telecommunication systems - Network protocols - Reliability Uncontrolled terms:Hierarchical architecture - Mixed acknowledgement mechanism - Previous network subscription - Reliable mobile multicasting - Remote subscription Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer Software, Data Handling and Applications - 913.3 Quality Assurance and Control - 921 Mathematics Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 30> Accession number:2004248214406 Title:Low bit-rate video coding based on undecimated wavelet dictionary Authors:Liao, Bin (1); Xu, Gang (1); Wang, Yu-Guo (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Liao, B. (pliaobin@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:2 Issue date:February 2004 Publication year:2004 Pages:221-228 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Currently, the core techniques of most video coders are based on blocked DCT (discrete cosine transform) transform. At very low bit-rates, video coders of this class always produce visual-sensible block artifacts. Recently, the video coders based on matching pursuit have been proved to have super coding efficiency, compared with the H.263 standard. However, the computation complexity is much too higher, because of laboriously searching optimal atoms in a redundant dictionary. A video coding algorithm based on undecimated wavelet dictionary is proposed, which incorporates multiresolution characteristics of the wavelet transform and assorts to filter the scheme between dictionary functions, to reduce the computation complexity of the original algorithm greatly. Considering the continuity of motion information in the neighboring frames, an entropy coding method of atom position based on a hybrid structure is given. The experimental results show that this algorithm keeps the original coding results and has the desirable application value. Number of references:8 Main heading:Video signal processing Controlled terms:Algorithms - Computational complexity - Pattern matching - Signal encoding - Signal filtering and prediction - Trees (mathematics) - Wavelet transforms Uncontrolled terms:Matching pursuit - Undecimated wavelet - Video coding - Wavelet packet Classification code:716.1 Information Theory and Signal Processing - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.5 Computer Applications - 921.3 Mathematical Transformations Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 31> Accession number:2004358329809 Title:Model checking distributed control systems based on software architecture Authors:Wang, Yang (1); Wei, Jun (1); Wang, Zhen-Yu (2) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Wuhan Digital Eng. Inst., Wuhan 430074, China; (3) Lab. of Software Eng., Wuhan Univ., Wuhan 430072, 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:15 Issue:6 Issue date:June 2004 Publication year:2004 Pages:823-833 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Distributed control systems are a category of high complex systems that include a large number of devices controlled and harmonized by computer systems. Their reliability and functional correctness always need to be guaranteed as their mission-critical feature. The analysis process for complex control systems consists of proving or verifying that the designed system indeed meets certain specifications. However, both the design and analysis may be formidable due to the complexity and magnitude of the system. From an analysis perspective, the complexity of a system can be reduced by imposing a hierarchical structure and abstraction on the architectural design. Currently, model checking is demonstrated by more and more successes. It is an effective way to verify that the construction of a complex system satisfies to the requirements of reliability and correctness. An approach for formally analyzing distributed control systems at architectural level by applying software architecture description and model checking techniques is presented. Through study on a building comprehensive control system, it is shown that the method could improve the quality of design of distributed control systems. Abstract type:(Edited Abstract) Number of references:20 Main heading:Distributed parameter control systems Controlled terms:Computer architecture - Distributed computer systems - Mathematical models - Specifications Uncontrolled terms:Building control systems - Correctness requirement - Formal transformations - Model checking - Property specification - Software architecture Classification code:722.4 Digital Computers and Systems - 723.5 Computer Applications - 731.1 Control Systems - 902.2 Codes and Standards - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 32> Accession number:2005149021966 Title:Research on collaborative interaction based on gesture and sketch in conceptual design Authors:Ma, Cuixia (1); Wang, Hongan (1); Dai, Guozhong (1); Chen, Youdi (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Intelligence Engineering Lab., Beijing 100080 Corresponding author:Ma, C. (mcx@iel.iscas.ac.cn) Source title:CSCWD 2004 - 8th International Conference on Computer Supported Cooperative Work in Design - Proceedings Abbreviated source title:CSCWD Int. Conf. Comput. Supported Coop. Work Des. Proc. Volume:1 Monograph title:CSCWD 2004 - 8th International Conference on Computer Supported Cooperative Work in Design - Proceedings Issue date:2004 Publication year:2004 Pages:261-266 Language:English ISBN-10:0780379411 ISBN-13:9780780379411 Document type:Conference article (CA) Conference name:CSCWD 2004 - 8th International Conference on Computer Supported Cooperative Work in Design - Proceedings Conference date:May 26, 2004 - May 28, 2004 Conference location:Xiamen, China Conference code:64434 Sponsor:Xiamen University, Xiamen, China; Xiamen Computer Federation; IEEE; IEEE Beijing Section; Chine Computer Federation Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:This paper presents an interaction pattern based on gesture and sketch. It provides a natural and harmonious user interface for collaborative operation in conceptual design, which enhances the development and application of collaborative system. Based on user-centered design, this paper analyzes different conceptual design process and gives a new collaborative design method based on gesture and sketch; it makes deep research on product information carrier based on sketch; Citing the gesture operation, it provides the collaborative context-awareness and the description model; it discusses the sketch interaction design for synchronous edit and the bi-dlrect constrain solution is put forward. This paper provides a convenient method of collaborative design to develop design efficiency and improve human-computer interaction. &copy; 2003 IEEE. Number of references:12 Main heading:Computer supported cooperative work Controlled terms:Algorithms - Computer aided design - Constraint theory - Human computer interaction - Mathematical models - Problem solving - User interfaces Uncontrolled terms:Collaborative context-awareness - Conceptual design - Gesture operation - Pen-paper interaction - Product information carrier Classification code:461.4 Ergonomics and Human Factors Engineering - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722.2 Computer Peripheral Equipment - 723.4 Artificial Intelligence - 723.5 Computer Applications - 921 Mathematics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 33> Accession number:2004298268925 Title:A practical parallel difference scheme for parabolic equations Authors:Gao, Jia-Quan (0) Corr. author affiliation:RDCPS, Inst. of Software, Chinese Acad. of Sciences, Beijing 100080, China Source title:Journal of Computational Mathematics Abbreviated source title:J Comput Math Volume:22 Issue:1 Issue date:January 2004 Publication year:2004 Pages:55-60 Language:English ISSN:02549409 CODEN:JCMMEB Document type:Journal article (JA) Publisher:Inst. of Computational Mathematics and Sc./Eng. Computing, Beijing, China Abstract:A practical parallel difference scheme for parabolic equations is constructed as follows: to decompose the domain &Omega; into some overlapping subdomains, take flux of the last time layer as Neumann boundary conditions for the time layer on inner boundary points of subdomains, solve it with the fully implicit scheme on each subdomain, then take correspondent values of its neighbor subdomains as its values for inner boundary points of each subdomain and mean of its neighbor subdomain and itself at overlapping points. The scheme is unconditionally convergent. Though its truncation error is O(&tau; + h), the convergent order for the solution can be improved to O(&tau; + h<sup>2</sup>). Number of references:8 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 34> Accession number:2005159039201 Title:Encoding-based method for pattern matching Authors:Chen, Haiming (1) Author affiliation:(1) Comp. Sci. Lab., Inst. of Software, Chinese Acad. of Sci., P.O. Box 8718, Beijing 100080, China Corresponding author:Chen, H. (chm@ios.ac.cn) Source title:Journal of Information and Computational Science Abbreviated source title:J. Inf. Comput. Sci. Volume:1 Issue:2 Issue date:December 2004 Publication year:2004 Pages:193-197 Language:English ISSN:15487741 Document type:Journal article (JA) Publisher:Sun Yat-sen (Zhongshan) University Abstract:A new algorithm for compiling pattern matching is presented. Different from the traditional traversal-based approaches, it can represent a sequence of patterns as an integer by an encoding method and translate equations into case-expressions. The algorithm is simple to implement, and efficient for a kind of patterns, i.e. simple and dense patterns. This method can be complementary to traditional approaches. Number of references:8 Main heading:Pattern matching Controlled terms:Algorithms - Computer science - Data structures - Encoding (symbols) - Translation (languages) Uncontrolled terms:Case expression - Constructor pattern - Encoding method - Functional language - Indirect address jumping instruction - Pattern matrix - Translate equations Classification code:723.2 Data Processing and Image Processing - 723.3 Database Systems - 723.5 Computer Applications - 903.1 Information Sources and Analysis - 921 Mathematics Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 35> Accession number:2004408391329 Title:Fair exchange protocol based on RSA signature scheme Authors:Zhou, Yong-Bin (1); Zhang, Zhen-Feng (1); Qing, Si-Han (1); Ji, Qing-Guang (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (3) Ctr. for Info. Security Technol., Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhou, Y.-B. (zhouyongbin@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:7 Issue date:July 2004 Publication year:2004 Pages:1049-1055 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Fairness is the basic requirement of E-Commerce protocols. RSA is one of the most widely used cryptosystems. A fair-exchange protocol allows two parties to exchange items in a fair way so that either each party gets the other's item, or neither party does. Construction and architecture of the existing fair exchange protocols are analyzed. Both practicality and efficiency problems of these protocols are also presented. Based on this analysis, an optimistic fair exchange protocol totally based on RSA signature scheme is proposed. The novel scheme employs verifiably encrypted RSA signatures in the extended integer ring that is elaborately constructed. The security and efficiency of the newly devised scheme are also proved and examined. It is showed that the proposed scheme is secure and efficient. Number of references:15 Main heading:Electronic commerce Controlled terms:Algorithms - Cryptography - Electronic document identification systems - Network protocols - Optimization - Security of data Uncontrolled terms:Extended integer rings - Fair exchange protocols - RSA cryptosystems - Verifiable encrypted signature Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer Software, Data Handling and Applications - 911.4 Marketing - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 36> Accession number:2004418404651 Title:Distributed optimization using virtual and real game strategies for aerodynamic multi-objective design Authors:Hu, Shi-Xiang (1); Li, Lei (2); She, Chun-Dong (2); Tang, Zhi-Li (3) Author affiliation:(1) Gen. Dept. of Outfit of PLA, Beijing 100720, China; (2) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (3) Dept. of Aerodynamics, Nanjing Univ. of Aero. and Astron., Nanjing 210016, China Corresponding author:Hu, S.-X. Source title:Hangkong Xuebao/Acta Aeronautica et Astronautica Sinica Abbreviated source title:Hangkong Xuebao Volume:25 Issue:4 Issue date:July 2004 Publication year:2004 Pages:321-326 Language:Chinese ISSN:10006893 CODEN:HAXUDJ Document type:Journal article (JA) Publisher:AAAS Press of Chinese Society of Aeronautics and Astronautics Abstract:The question of multi-objective optimization for optimum shape design in aerodynamics via constrained control theory is described. The optimizer is based on control theory. A scalar adjoint variable to implement the constraints is introduced. The above method is combined with a formula derived from game theory to treat multi-point airfoil optimization. Airfoil shapes are optimized according to various aerodynamics criteria (in conflict). In the symmetric Nash Game, each player is responsible for one criterion. Several kinds of equilibrium provide a solution to the multi-point optimization. Several kinds of airfoil splitting and design cases are shown for virtual and real game strategies in aerodynamic design, and design results confirm the validity and efficiency of the present design method. Abstract type:(Edited Abstract) Number of references:8 Main heading:Aerodynamics Controlled terms:Airfoils - Control theory - Design - Game theory - Optimization Uncontrolled terms:Aerodynamic optimization design - Constrained control theory - Distributed optimization - Multiobjective optimization - Optimum control theory Classification code:651.1 Aerodynamics, General - 652.1 Aircraft, General - 731.1 Control Systems - 921.5 Optimization Techniques - 922.1 Probability Theory Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 37> Accession number:2004448436916 Title:Design and implementation of a semantic web rule markup language OWLRule+ Authors:Liang, Sheng (0); Fu, Hong-Yu (0); Li, Ming-Shu (0) Corr. author affiliation:Lab. for Internet Soft-ware Technol., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:41 Issue:7 Issue date:July 2004 Publication year:2004 Pages:1088-1096 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Science Press, Beijing, China Abstract:Semantic Web is a great vision for the future Web architecture. Its development proceeds in layers. At present, the highest layer that has reached sufficient maturity is the ontology layer in form of OWL. However, its semantics is limited to description logic, which focuses on modeling hierarchies of classes but has weak expressive power for rules. Therefore, a richer logical language should be provided on top of them. A new markup language for semantic Web rules - OWLRule+ is presented. Its syntax extends OWL, and its semantics is based on CARIN, a representation language combining description logic and Horn rules. Its implementation via Jess rule engine is also described. Case study demonstrates its rule representation and inference abilities. Number of references:18 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 38> Accession number:2005239143242 Title:Incremental mining of frequent XML query patterns Authors:Chen, Yi (1); Yang, Liang Huai (2); Wang, Yu Guo (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences; (2) Department of Computer Science, Peking Univerity Source title:Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004 Abbreviated source title:Proc. Fourth IEEE Int. Conf. Data Min. ICDM Monograph title:Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004 Issue date:2004 Publication year:2004 Pages:343-346 Language:English ISBN-10:0769521428 ISBN-13:9780769521428 Document type:Conference article (CA) Conference name:Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004 Conference date:November 1, 2004 - November 4, 2004 Conference location:Brighton, United kingdom Conference code:64905 Sponsor:IEEE Computer Society TCCI; IEEE Computer Society TCPAMI Publisher:IEEE Computer Society Abstract:Recently, the discovering of frequent XML query patterns gains its focus due to its many applications in XML data management, and several algorithms have been proposed to discover frequent query patterns using the frequent structure mining techniques. In this paper we consider the problem of incremental mining of frequent XML query patterns. We propose a novel method to minimize the I/O and computation requirements for handling incremental updates. &copy; 2004 IEEE. Number of references:5 Main heading:XML Controlled terms:Algorithms - Computational methods - Data mining - Database systems - Pattern recognition - Query languages - Trees (mathematics) Uncontrolled terms:Data management - Incremental mining - Pattern trees - XML query patterns Classification code:921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 921 Mathematics - 723.5 Computer Applications - 723.3 Database Systems - 723.2 Data Processing and Image Processing - 723.1.1 Computer Programming Languages - 723 Computer Software, Data Handling and Applications Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 39> Accession number:2004478467335 Title:A new detecting scheme for blind images watermarking Authors:Sun, Zhongwei (1); Feng, Dengguo (1) Author affiliation:(1) State Key Lab. of Info. Security, Institute of Software, Chinese Academy of Science, Beijing 100080 Corresponding author:Sun, Z. (sunzwen@.cn) Source title:International Conference on Signal Processing Proceedings, ICSP Abbreviated source title:Int Conf Signal Process Proc Volume:3 Monograph title:2004 7th International Conference on Signal Processing Proceedings (ICSP'04) Issue date:2004 Publication year:2004 Pages:2334-2337 Language:English Document type:Conference article (CA) Conference name:2004 7th International Conference on Signal Processing Proceedings (ICSP'04) Conference date:August 31, 2004 - September 4, 2004 Conference location:Beijing, China Conference code:63798 Sponsor:Chinese Institute of Electronics (CIE); IEEE Signal Processing Society (IEEE-SPS); Institute of Electrical Engineers (IEE); Union Radio Scientifique Internationale (URSI); IEEE Beijing Section Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Watermark detection plays a crucial role in digital watermarking. A robust DWT-domain watermark detection scheme is proposed in this paper. First, generalized gaussian distributions are applied to statistically model the wavelet coefficients of the detail sub-bands of the original image. Then, based on the theory of statistical inference and weak signal detection in non-gaussian noise, a robust blind detection algorithm is derived. The performance of the new detector is analyzed. And the validity of the detector is also tested. Number of references:8 Main heading:Digital watermarking Controlled terms:Algorithms - Correlation methods - Mathematical models - Probability density function - Problem solving - Robustness (control systems) - Wavelet transforms Uncontrolled terms:Constant false alarm (CFAR) detector - Generalized gaussian distribution - Histograms - Weak signal detection Classification code:723.2 Data Processing and Image Processing - 723.4 Artificial Intelligence - 731.1 Control Systems - 921.3 Mathematical Transformations - 922.1 Probability Theory - 922.2 Mathematical Statistics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 40> Accession number:2005058812015 Title:WebFrame: A multi-phase reconfigurable middleware platform Authors:Guochuang, Fan (1); An, Chen (1); Wenbo, Zhang (1); Tao, Huang (1) Author affiliation:(1) Technol. Ctr. of Software Eng., Institute of Software, Chinese Academy of Sciences, Beijing, 100080, China Corresponding author:Guochuang, F. (fanguo@otcaix.iscas.ac.cn) Source title:Proceedings of the Hawaii International Conference on System Sciences Abbreviated source title:Proc Hawaii Int Conf Syst Sci Volume:37 Monograph title:Proceedings of the 37th Annual Hawaii International Conference on System Sciences Issue date:2004 Publication year:2004 Pages:4283-4292 Article number:STASS05 Language:English ISSN:10603425 CODEN:PHISD7 Document type:Conference article (CA) Conference name:Proceedings of the Hawaii International Conference on System Sciences Conference date:January 5, 2004 - January 8, 2004 Conference location:Big Island, HI., United states Conference code:62887 Sponsor:IEEE Computer Society; Institute of Electrical and Electronics Engineers,IEEE Publisher:Institute of Electrical and Electronics Engineers Computer Society Abstract:Web application servers (WASs) are middleware platforms for deployment and execution of component-based web applications. To cater for an increasingly diverse range of QoS demands, WAS must be capable of adaptation during execution to modify itself and to respond to changing conditions in its external environment. To accommodate such changes, WAS should provide both deployment-time configurability and run-time reconfigurability. Unfortunately, most of the mainstream web application servers adopt a monolithic architecture and "black box" philosophy to their design, and fail to properly address such requirements. In our point of view, adaptation and reconfigurability of WASs should be available at any time of the whole lifecycle. In this paper, a middleware architecture (WebFrame) that supports multi-phase adaptation using computational reflection, microkernel, and component techniques is proposed for web application servers. The architecture is structured into five layers. Both deployment-time configuration and run-time reconfiguration at multiple layers is supported in this architecture. The key insight to this work is the MService Reconfiguration design pattern, which provides dynamic adaptation at run time by swapping in/out the optional middleware components. The comparative evaluation of the performance impact of reflection and multi-phase reconfigurability on systems are given. Number of references:17 Main heading:Middleware Controlled terms:Computer aided design - Computer architecture - Computer programming languages - Computer systems - Mathematical models - Quality of service - Servers Uncontrolled terms:Messaging services - Meta service (MService) - Web application servers (WAS) - Webframe Classification code:716 Telecommunication; Radar, Radio and Television - 722 Computer Systems and Equipment - 723.1 Computer Programming - 723.1.1 Computer Programming Languages - 723.5 Computer Applications - 921 Mathematics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 41> Accession number:2004388357642 Title:An effective evolutionary strategy for bijective S-boxes Authors:Chen, Hua (1); Feng, Deng-Guo (1) Author affiliation:(1) State Key Lab. of Info. Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Chen, H. (chenhua@is.iscas.ac.cn) Source title:Proceedings of the 2004 Congress on Evolutionary Computation, CEC2004 Abbreviated source title:Proc. 2004 Congr. Evol. Comput. CEC2004 Volume:2 Monograph title:Proceedings of the 2004 Congress on Evolutionary Computation, CEC2004 Issue date:2004 Publication year:2004 Pages:2120-2123 Language:English ISBN-10:0780385152 ISBN-13:9780780385153 Document type:Conference article (CA) Conference name:Proceedings of the 2004 Congress on Evolutionary Computation, CEC2004 Conference date:June 19, 2004 - June 23, 2004 Conference location:Portland, OR, United states Conference code:63448 Sponsor:IEEE Neural Network Society (NNS); Evolutionary Programming Society (EPS); Institution of Electrical Engineers (IEE) Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Being as unique nonlinear components of block ciphers, S-boxes control the security of the cryptographic algorithms. The design of S-boxes with genetic algorithms is a recent research focus. For the popular bijective S-boxes, an effective evolutionary strategy is given in this paper, including fitness function, breeding strategy and hill climbing algorithm. Under this strategy, an effective genetic algorithm for 8 prime; 8 bijective S-boxes is provided and a large number of S-boxes with high nonlinearity and low difference uniformity can be obtained. Number of references:11 Main heading:Genetic algorithms Controlled terms:Algebra - Boolean functions - Chaos theory - Cryptography - Inverse problems - Random processes Uncontrolled terms:Bijective S-boxes - Fitness functions - Logarithmic functions Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723 Computer Software, Data Handling and Applications - 921.1 Algebra - 922 Statistical Methods - 922.1 Probability Theory Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 42> Accession number:2004538759955 Title:Design and implementation of a controlled privilege framework Authors:Liang, Bin (1); Sun, Yu-Fang (1); Shi, Wen-Chang (1); Sun, Bo (1) Author affiliation:(1) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Liang, B. (Liangbin01@ios.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:SUPPL. Issue date:October 2004 Publication year:2004 Pages:74-82 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:In order to support to the principle of least privilege effectively, considering the limitations traditional privilege mechanisms, a new Linux privilege mechanism called controlled privilege framework (CPF) is proposed. CPF provides a fine-granularity partition of system privileges; improves the privilege computing mechanism of privileged process; and introduces the notation of privilege state for privilege control, refines the unit of privilege control farther. Based on CPF, fine-granularity and automatic privilege control can be performed totally transparent to all applications. The experimental results show that the threats of intrusion are reduced and effective support to the principle of least privilege can be achieved. Number of references:7 Main heading:Computer software Controlled terms:Computer operating systems - Security of data Uncontrolled terms:Capability - Linux intrusion detection - Linux security modules - Principle of least privilege - Privileged process - Trusted computing base Classification code:723 Computer Software, Data Handling and Applications Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 43> Accession number:2005038792058 Title:Semi-naive evaluation in linear tabling Authors:Zhou, Neng-Fa (1); Shen, Yi-Dong (2); Sato, Taisuke (3) Author affiliation:(1) Department of Computer Science, CUNY Brooklyn College, Graduate Center; (2) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing; (3) Department of Computer Science, Tokyo Institute of Technology, CRESTYLE="JSTYLE=" Source title:Proceedings of the Sixth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP'04 Abbreviated source title:Proc. Sixth ACM SIGPLAN Conf. Princ. Pract. Declar. Program. PPDP Monograph title:Proceedings of the Sixth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP'04 Issue date:2004 Publication year:2004 Pages:90-97 Language:English ISBN-10:1581138199 ISBN-13:9781581138191 Document type:Conference article (CA) Conference name:Proceedings of the Sixth ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP'04 Conference date:August 24, 2004 - August 26, 2004 Conference location:Verona, Italy Conference code:64168 Sponsor:Association for Computing Machinery, ACM SIGPLAN Publisher:Association for Computing Machinery Abstract:Semi-naive evaluation is an effective technique employed in bottom-up evaluation of logic programs to avoid redundant joins of answers. The impact of this technique on top-down evaluation had been unknown. In this paper, we introduce semi-naive evaluation into linear tabling, a top-down resolution mechanism for tabled logic programs. We give the conditions for the technique to be safe and propose an optimization technique called early answer promotion to enhance its effectiveness. While semi-naive evaluation is not as effective in linear tabling as in bottom-up evaluation, it is worthwhile to be adopted. Our benchmarking shows that this technique gives significant speed-ups to some programs. Number of references:21 Main heading:PROLOG (programming language) Controlled terms:Benchmarking - Computer software - Iterative methods - Logic programming - Optimization - Problem solving Uncontrolled terms:Linear tabling - Memoization - Recursion - Semi-naive evaluation - Tabling Classification code:723.1.1 Computer Programming Languages - 723.4 Artificial Intelligence - 912 Industrial Engineering and Management - 921.5 Optimization Techniques - 921.6 Numerical Methods Treatment:Theoretical (THR) DOI:10.1145/1013963.1013976 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 44> Accession number:2005149022173 Title:Research on the cooperation of the virtual enterprise using Metasynthetic Engineering Authors:Wang, Danli (1); Dai, Guozhong (1); Wang, Hongan (1); Hua, Qingyi (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Wang, D. (dlwang@iel.iscas.ac.cn) Source title:CSCWD 2004 - 8th International Conference on Computer Supported Cooperative Work in Design - Proceedings Abbreviated source title:CSCWD Int. Conf. Comput. Supported Coop. Work Des. Proc. Volume:2 Monograph title:CSCWD 2004 - 8th International Conference on Computer Supported Cooperative Work in Design - Proceedings Issue date:2004 Publication year:2004 Pages:582-587 Language:English ISBN-10:0780379411 ISBN-13:9780780379411 Document type:Conference article (CA) Conference name:CSCWD 2004 - 8th International Conference on Computer Supported Cooperative Work in Design - Proceedings Conference date:May 26, 2004 - May 28, 2004 Conference location:Xiamen, China Conference code:64434 Sponsor:Xiamen University, Xiamen, China; Xiamen Computer Federation; IEEE; IEEE Beijing Section; Chine Computer Federation Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:This paper first briefly discusses complexity and complex systems. Then it points out that a virtual enterprise is an open complex giant system and in essence a certain result of enterprise's adaptation to the environmental changes. The problems in enterprise cooperation are studied, then the framework of Metasynthetic Engineering platform for virtual enterprise is given to facilitate enterprise cooperation and management. The method and process of decision making for virtual enterprise are discussed. The key feature of this platform - human-machine cooperation - is also analyzed. &copy; 2003 IEEE. Number of references:19 Main heading:Large scale systems Controlled terms:Computer software - Customer satisfaction - Decision making - Life cycle - Man machine systems - Network protocols - Project management - Societies and institutions - Systems engineering Uncontrolled terms:Innovative technologies - Management research - Metasynthetic engineering - Research projects Classification code:723 Computer Software, Data Handling and Applications - 731.1 Control Systems - 901.1.1 Societies and Institutions - 912 Industrial Engineering and Management - 912.2 Management Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 45> Accession number:2005219121852 Title:SOWAC: A service-oriented workflow access control model Authors:Xu, Wei (1); Wei, Jun (1); Liu, Yu (1); Li, Jing (1) Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Xu, W. (xuwei@otcaix.iscas.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 of the 28th Annual International Computer Software and Applications Conference, COMPSAC 2004 Issue date:2004 Publication year:2004 Pages:128-134 Language:English ISSN:07303157 CODEN:PSICD2 Document type:Conference article (CA) Conference name:Proceedings of the 28th Annual International Computer Software and Applications Conference, COMPSAC 2004 Conference date:September 28, 2004 - September 30, 2004 Conference location:Hong Kong, China, Hong kong Conference code:64717 Publisher:Institute of Electrical and Electronics Engineers Computer Society Abstract:Workflow access control is the fundamental issue in workflow security. With the development of enterprise globalization and the constant re-engineering and optimizing of enterprise business, the organization becomes more dynamic and its business process is frequently changing. As a result, workflow access control turns more complicated and entails a comparatively operational mechanism. To solve the problem, in view of decoupling workflow access control model from workflow model, we propose a Service-Oriented Workflow Access Control (SOWAC) model in this paper. In SOWAC model, service is the abstraction of a task and the unit for applying access control. We present the elements of SOWAC model and illustrate the enforcement of SOWAC with an example workflow. Then the dynamic separation of duty for SOWAC model is proposed based on the authorization history of services. By applying SOWAC in a real workflow management system, we show SOWAC model is practical and effectual. &copy; 2004 IEEE. Number of references:13 Main heading:Computer software Controlled terms:Mathematical models - Optimization - Process control - Reengineering - Servers - Synchronization Uncontrolled terms:Business process automation (BPA) - Service-oriented workflow access control (SOWAC) models - Software systems - Workflow access control Classification code:722 Computer Systems and Equipment - 723 Computer Software, Data Handling and Applications - 731 Automatic Control Principles and Applications - 731.1 Control Systems - 913.3 Quality Assurance and Control - 921.5 Optimization Techniques Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 46> Accession number:2005058819807 Title:Dynamic adjustment of execution order in real-time databases Authors:Wang, Yongyan (1); Wang, Qiang (1); Wang, Hongan (1); Dai, Guozhong (1) Author affiliation:(1) Intelligence Engineering Lab., Institute of Software, Chinese Academy of Sciences, Beiging 100080, China Corresponding author:Wang, Y. (wyy@iel.iscas.ac.cn) Source title:Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM) Abbreviated source title:Proc. Int. Parall. Distrib. Process. Symp. IPDPS 2004 Volume:18 Monograph title:Proceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM) Issue date:2004 Publication year:2004 Pages:1219-1225 Language:English ISBN-10:0769521320 ISBN-13:9780769521329 Document type:Conference article (CA) Conference name:Proceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM) Conference date:April 26, 2004 - April 30, 2004 Conference location:Santa Fe, NM, United states Conference code:63369 Sponsor:IEEE Computer Society Technical Committee on Parallel Processing Publisher:IEEE Computer Society Abstract:Many researches have been devoted to designing appropriate concurrency control algorithms for real-time database systems, which not only satisfy consistency requirements but also meet transaction timing constraints as much as possible. Optimistic concurrency control protocols have the nice properties of being non-blocking and deadlock-free, but they have the problems of late conflict detection and transaction restarts. Although the number of transaction restarts is reduced by dynamic adjustment of serialization order (DASO) in real-time database systems, it still has some unnecessary transaction restarts. In this paper, we first propose a new method called dynamic adjustment of execution order (DAEO) and a new optimistic concurrency control algorithm based on DAEO, which can reduce the number of unnecessary restarts near to zero and outperforms the previous algorithms, and then discuss the experiments and the results. Number of references:13 Main heading:Real time systems Controlled terms:Algorithms - Concurrency control - Database systems - Network protocols - Object recognition - Optimization - Problem solving Uncontrolled terms:Dynamic adjustment execution order (DAEO) - Dynamic adjustment of serialization order (DASO) - Real-time databases Classification code:921.5 Optimization Techniques - 921 Mathematics - 741.1 Light/Optics - 723.5 Computer Applications - 723.4 Artificial Intelligence - 723.3 Database Systems - 722.4 Digital Computers and Systems Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 47> Accession number:2004278252560 Title:Migration model and algorithms for dynamic redistribution of enterprise Java bean components Authors:Fan, Guo-Chuang (1); Wei, Jun (1); Zhong, Hua (1); Feng, Yu-Lin (1) Author affiliation:(1) Technol. Ctr. of Software Eng., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Fan, G.-C. (fanguo@otcaix.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:3 Issue date:March 2004 Publication year:2004 Pages:404-413 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Web application servers (WASs) provide a web computing infrastructure for distributed components. The component structure of statically configured distribution prevents web applications from being adaptive to the changing environmental conditions at runtime. To meet the requirement of dynamic redistribution, WASs should provide the capability to support component migration. The most challenging problem is to maintain component consistency during such a component migration. Some kinds of component migration constrains (CMC) are defined. A component migration model for J2EE (Java 2 platform enterprise edition) application servers is proposed, and SLB_Copy, SFB_Copy and EB_Copy component migration algorithms are presented. It is proved that SLB_Copy, SFB_Copy and EB_Copy migration algorithms all satisfy the CMC constrains. The migration model is implemented in a J2EE application server, referred to as WebFrame 2.0, and these algorithms are applied to provide numerous services such as the adaptive load balancing service and the failover service. Abstract type:(Edited Abstract) Number of references:18 Main heading:Servers Controlled terms:Algorithms - Client server computer systems - Computer software reusability - Distributed computer systems - Dynamic programming - Java programming language Uncontrolled terms:Component migration model - Enterprise Javabean - Entity bean - Message drive bean - Session bean - Web application server Classification code:722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 921.5 Optimization Techniques Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 48> Accession number:2004488687433 Title:Research and development of internet worms Authors:Wen, Wei-Ping (1); Qing, Si-Han (1); Jiang, Jian-Chun (1); Wang, Ye-Jun (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Ctr. for Info. Security Technol., Chinese Acad. of Sci., Beijing 100080, China; (3) Graduate Sch., Chinese Acad. of Sci., Beijing 100039, China Corresponding author:Wen, W.-P. (qingl010@ercist.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:8 Issue date:August 2004 Publication year:2004 Pages:1208-1219 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:With the explosive growth of network applications and complexity, the threat of Internet worms against network security becomes increasingly serious. Especially under the environment of Internet, the variety of the propagation ways and the complexity of the application environment result in worm with much higher frequency of outbreak, much deeper latency and more wider coverage, and Internet worms are a primary issue faced by malicious code researchers. The concept and research situation of Internet worms, exploration function component and execution mechanism are first presented, then the scanning strategies and propagation model are discussed, and finally the critical techniques of Internet worm prevention are given. Some major problems and research trends in this area are also addressed. Number of references:55 Main heading:Internet Controlled terms:Codes (symbols) - Computer program listings - Mathematical models - Security of data Uncontrolled terms:Function components - Internet worms - Malicious codes - Malicious programs - Network security - Propagation models - Scanning strategy Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer Software, Data Handling and Applications - 921 Mathematics Treatment:Applications (APP); General review (GEN); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 49> Accession number:2004538756789 Title:Digital audio watermarking algorithm based on adaptive quantization Authors:Wang, Xiang-Yang (1); Yang, Hong-Ying (1); Zhao, Hong (2) Author affiliation:(1) Sch. of Comp. and Info. Technology, Liaoning Normal University, Liaoning Dalian 116029, China; (2) State Key Lab. of Info. Security, Institute of Software, Chinese Academy of Sciences, Beijing 100039, China Corresponding author:Wang, X.-Y. Source title:Technical Acoustics Abbreviated source title:Tech. Acoust. Volume:23 Issue:2 Issue date:June 2004 Publication year:2004 Pages:117-120+127 Language:Chinese ISSN:10003630 Document type:Journal article (JA) Publisher:Shanghai Acoustics Laboratory Abstract:In this paper, a new digital audio watermarking algorithm based on adaptive quantization is presented. A visually recognizable binary watermark image is first converted into a one-dimensional sequence. The sequence is permuted pseudo-randomly and modulated using BCH coding. Then the original digital audio signal is converted into segments and some audio segments are selected. Finally the modulated watermarking signal is embedded into the FFT coefficients by means of adaptive quantizaiton. The proposed algorithm can extract the watermark without the original audio signal. Experimental results show that the proposed watermarking scheme is inaudible and robust against various signal-processing operations such as noise addition, lossy compression, low pass filtering, re-sampling, and re-quantization. Number of references:10 Main heading:Digital watermarking Controlled terms:Acoustic noise - Acoustic signal processing - Adaptive algorithms - Audition - Binary sequences - Data compression - Fast Fourier transforms - Image coding - Low pass filters - Modulation - Random processes Uncontrolled terms:Digital audio watermarking - Human auditory system (HAS) - Quantization Classification code:922.1 Probability Theory - 921.3 Mathematical Transformations - 751.4 Acoustic Noise - 751.1 Acoustic Waves - 751 Acoustics, Noise. Sound - 941.1 Acoustical Instruments - 723.2 Data Processing and Image Processing - 716.1 Information Theory and Signal Processing - 716 Telecommunication; Radar, Radio and Television - 703.2 Electric Filters - 461.4 Ergonomics and Human Factors Engineering - 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 50> Accession number:2004338313313 Title:Two-dimensional stack generation and block merging algorithms for analog VLSI Authors:Liu, Rui (1); Dong, She-Qin (2); Hong, Xian-Long (2); Long, Di (2); Gu, Jun (3) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Dept. of Comp. Sci. and Technol., Tsinghua Univ., Beijing 100084, China; (3) Dept. of Comp. Sci., Sci. and Technol. Univ. of Hong Kong, Hong Kong, Hong Kong Corresponding author:Liu, R. (rliu_ac@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:5 Issue date:May 2004 Publication year:2004 Pages:641-649 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:In analog VLSI design, 2-dimensional symmetry stack and block merging are critical for mismatch minimization and parasitic control. Algorithms for analog VLSI 2-dimensional symmetry stack and block merging are described. Several theoretical results are obtained by studying symmetric Eulerian graph and symmetric Eulerian trail. Based on them, an O(n) algorithm for dummy transistor insertion, symmetric Eulerian trail construction and 2-dimensional symmetry stack construction is developed. The generated stacks are 2-dimensional symmetric and common-centroid. A block merging algorithm is described, which is essentially independent of the topological representation. Formula for calculating the maximum block merging distance is given. Experimental results show the effectiveness of the algorithms. Abstract type:(Edited Abstract) Number of references:23 Main heading:VLSI circuits Controlled terms:Algorithms - Graph theory - Optimization - Theorem proving - Two dimensional Uncontrolled terms:Analog VLSI - Block merging - Common centroid stacks - Symmetric Eulerian graphs - Symmetric Eulerian trails - Two dimensional stacks Classification code:714.2 Semiconductor Devices and Integrated Circuits - 723 Computer Software, Data Handling and Applications - 921 Mathematics Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 51> Accession number:2005108870054 Title:Symbolic execution of program paths involving pointer and structure variables Authors:Zhang, Jian (1) Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Zhang, J. (zj@ios.ac.cn) Source title:Proceedings - Fourth International Conference on Quality Software, QSIC 2004 Abbreviated source title:Proc. Fourth Int. Conf. Qual. Softw. QSIC Monograph title:Proceedings - Fourth International Conference on Quality Software, QSIC 2004 Issue date:2004 Publication year:2004 Pages:87-92 Language:English ISBN-10:0769522076 ISBN-13:9780769522074 Document type:Conference article (CA) Conference name:Proceedings - Fourth International Conference on Quality Software, QSIC 2004 Conference date:September 8, 2004 - September 9, 2004 Conference location:Braunschweig, Germany Conference code:64326 Sponsor:Technical University of Braunschweig, Inst. of Inf. Syst., Ger.; University of Hong Kong, Software Engineering Group, Hong Kong; Swinburne University of Technology, Centre for Softw. Eng., Aust. Publisher:IEEE Computer Society Abstract:Many white-box testing methods are based on the analysis of program paths. For these methods, an important problem is to determine the feasibility of a given path, and find appropriate input data to execute the path if it is feasible. In this paper, the symbolic execution of program paths is studied. An approach is presented, which translates a path involving pointer and structure variables to a path involving simple variables and array variables only. The later is then analyzed with constraint solving techniques. An implemention of the translation tool is described with some examples. Preliminary experimental results show that the approach is quite efficient and applicable to paths in typical programs. Number of references:16 Main heading:Computer software Controlled terms:Algorithms - Automation - Benchmarking - Constraint theory - Data reduction - Graph theory - Information analysis - Linear programming - Polynomials - Semantics Uncontrolled terms:Dynamic domain reduction (DDR) - Flow graphs - Path conditions (PC) - Symbolic execution Classification code:921.5 Optimization Techniques - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 921.1 Algebra - 903.2 Information Dissemination - 903.1 Information Sources and Analysis - 731 Automatic Control Principles and Applications - 723.2 Data Processing and Image Processing - 723 Computer Software, Data Handling and Applications - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 52> Accession number:2004398380197 Title:A new CEMBS based on RSA signatures and its application in constructing fair exchange protocol Authors:Zhou, Yong-Bin (1); Zhang, Zhen-Feng (1); Qing, Si-Han (1); Liu, Juan (4) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, 100080, China; (2) Eng. Res. Ctr. Info. Secty. Technol., CAS, Beijing, 100080, China; (3) State Key Lab. of Info. Security, CAS, Beijing, 100080, China; (4) Yunnan Nationalities University, Department of History, Kunming, 650003, China Corresponding author:Zhou, Y.-B. (zhouyongbin@) Source title:Proceedings - 2004 IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE 2004 Abbreviated source title:Proc. IEEE Int. Conf. e_technology e-Commerce e-Service EEE Monograph title:Proceedings - 2004 IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE 2004 Issue date:2004 Publication year:2004 Pages:558-562 Language:English ISBN-10:0769520731 ISBN-13:9780769520735 Document type:Conference article (CA) Conference name:Proceedings - 2004 IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE 2004 Conference date:March 28, 2004 - March 31, 2004 Conference location:Taipei, Taiwan Conference code:63492 Sponsor:IEEE Task Committee on E-Commerce; Fu-Jen University of Taiwan; BIKMrdc of Fu-Jen University; Academia Sinica; National Science Council of Taiwan Publisher:IEEE Computer Society Abstract:Fairness is one of the basic requirements of E-Commerce protocols and applications. CEMBS is proved to be an important cryptographic building primitive in constructing fair exchange protocols. In this paper the drawbacks of existing CEMBS-implementing methods are analyzed. A new CEMBS-constructing method based on RSA signature is proposed, which is proved to be simple, efficient and secure. Afterwards, a fair exchange protocol is built using the newly constructed CEMBS. And the devised scheme in this paper is the first efficient CEMBS based on RSA signatures. Number of references:7 Main heading:Internet Controlled terms:Algorithms - Asynchronous machinery - Cryptography - Electronic document identification systems - Mathematical models - Security of data Uncontrolled terms:Asynchronous mode - Cryptographic buildings - Fair exchange protocol Classification code:705.1 Electric Machinery, General - 716 Telecommunication; Radar, Radio and Television - 723 Computer Software, Data Handling and Applications - 723.2 Data Processing and Image Processing - 723.5 Computer Applications - 921 Mathematics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 53> Accession number:2005319273216 Title:Mesozoic basin evolution and tectonic mechanism in Yanshan, China Authors:Liu, Shaofeng (1); Li, Zhong (3); Zhang, Jinfang (4) Author affiliation:(1) Key Laboratory of Lithospheric Tectonics Deep-Level Process and Explovation, Ministry of Education of P.R. China, Beijing 100083, China; (2) School of Geosciences and Resources, China University of Geosciences, Beijing 100083, China; (3) Institute of Geology and Geophysics, Chinese Academy of Sciences, Beijing 100029, China; (4) Institute of Software, Chinese Academy of Science, Beijing 100080, China Corresponding author:Liu, S. (shaofeng@cugb.edu.cn) Source title:Science in China, Series D: Earth Sciences Abbreviated source title:Sci. China Ser. D Earth Sci. Volume:47 Issue:SUPPL. 2 Issue date:September 2004 Publication year:2004 Pages:24-38 Language:English ISSN:10069313 Document type:Journal article (JA) Publisher:Science in China Press Abstract:The Mesozoic basins in Yanshan, China underwent several important tectonic transformations, including changes from a pre-Late Triassic marginal cratonic basin to a Late Triassic-Late Jurassic flexural basin and then to a late Late Jurassic-Early Cretaceous rift basin. In response to two violent intraplate deformation at Late Triassic and Late Jurassic, coarse fluvial depositional systems in Xingshikou and Tuchengzi Formations were deposited in front of thrust belts. Controlled by transform and extension faulting, fan deltas and lacustrine systems were deposited in Early Cretaceous basins. The composition of clastic debris in Late Triassic and Late Jurassic flexural basins respectively represents unroofing processes from Proterozoic to Archean and from early deposited, overlying pyroclastic rocks to basement rocks in provenance areas. Restored protobasins were gradually migrated toward nearly NEE to EW-trending from Early Jurassic to early Late Jurassic. The Early Cretaceous basins with a NNE-trending crossed over early-formed basins. The Early-Late Jurassic and Early Cretaceous basins were respectively controlled by different tectonic mechanisms. Copyright by Science in China Press 2004. Number of references:24 Main heading:Tectonics Controlled terms:Catchments - Crude petroleum - Finite difference method - Geophysics - Hydrocarbons - Petroleum prospecting - Petroleum reservoirs - Rocks - Tectonics Uncontrolled terms:Flexural basins - Mesozoic basin evolution - Tectonic transformation - Thrust belts Classification code:921.6 Numerical Methods - 512.1.2 Development Operations - 512.1.1 Oil Fields - 512.1 Petroleum Deposits - 481.3 Geophysics - 481.1 Geology - 444 Water Resources Treatment:Theoretical (THR) DOI:10.1360/04zd0022 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 54> Accession number:2004047825435 Title:On liveness and boundedness of asymmetric choice nets Authors:Jiao, Li (1); Cheung, To-Yat (1); Lu, Weiming (3) Author affiliation:(1) Department of Computer Science, City University of Hong Kong, Hong Kong; (2) Institute of Software, Chinese Academy of Sciences, Beijing, China; (3) Acad. of Math. and System Science, Chinese Academy of Sciences, Beijing, China Corresponding author:Jiao, L. (ljiao@ios.ac.cn) Source title:Theoretical Computer Science Abbreviated source title:Theor Comput Sci Volume:311 Issue:1-3 Issue date:January 23, 2004 Publication year:2004 Pages:165-197 Language:English ISSN:03043975 CODEN:TCSCDI Document type:Journal article (JA) Publisher:Elsevier Abstract:This paper concerns two important techniques, characterization and property-preserving transformation, for verifying some basic properties of asymmetric choice Petri nets (AC nets). In the literature, a majority of the characterizations are for ordinary free choice nets. This paper presents many extended (from free choice nets) and new characterizations for four properties: Liveness with respect to an initial marking, liveness monotonicity with respect to an initial marking, well-formedness, liveness and boundedness with respect to an initial marking. The nets involved are extended to homogeneous free choice nets, ordinary AC nets and homogeneous AC nets. This paper also investigates the transformation of merging a set of places of an ordinary AC net and proposes the conditions for it to preserve the siphon-trap-property (ST-property), liveness, boundedness and reversibility. The results are then applied to the verification of resource-sharing systems. At present, the major approaches for solving this problem are based on state machines or marked graphs and are not based on property preservation. Our approach extends the scopes of the underlying nets to AC nets and the verification techniques. It is found that the ST-property plays a very important role in many of the results. Furthermore, mainly through examples, the importance of the assumptions in the proposed characterizations and transformation and the limitation on further extensions are pointed out. &copy; 2003 Elsevier B.V. All rights reserved. Number of references:31 Main heading:Petri nets Controlled terms:Composition - Computational methods - Computer science - Mathematical programming - Mathematical transformations - Problem solving - Set theory - Systems analysis Uncontrolled terms:Asymmetric choice nets - Boundedness - Liveness - Well-formedness Classification code:921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 921.3 Mathematical Transformations - 912.3 Operations Research - 723.4 Artificial Intelligence - 921.5 Optimization Techniques - 723.1 Computer Programming - 722 Computer Systems and Equipment - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 721 Computer Circuits and Logic Elements - 723 Computer Software, Data Handling and Applications Treatment:Theoretical (THR) DOI:10.1016/S0304-3975(03)00359-1 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 55> Accession number:2005169045052 Title:Path-oriented test data generation using symbolic execution and constraint solving techniques Authors:Zhang, Jian (1); Xu, Chen (2); Wang, Xiaoliang (1) Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Yale University Corresponding author:Zhang, J. (zj@ios.ac.cn) Source title:Proceedings of the Second International Conference on Software Engineering and Formal Methods. SEFM 2004 Abbreviated source title:Proc. Second Int. Conf. Softw. Eng. Formal Methods SEFM Monograph title:Proceedings of the Second International Conference on Software Engineering and Formal Methods. SEFM 2004 Issue date:2004 Publication year:2004 Pages:242-250 Language:English ISBN-10:076952222X ISBN-13:9780769522227 Document type:Conference article (CA) Conference name:Proceedings of the Second International Conference on Software Engineering and Formal Methods. SEFM 2004 Conference date:September 28, 2004 - September 30, 2004 Conference location:Beijing, China Conference code:64528 Sponsor:IEEE Computer Society, Tech. Committee on Complexity in Comput. Publisher:IEEE Computer Society Abstract:Automatic test data generation is a challenging task in software engineering research. This paper studies a path-oriented approach to the problem, which is based on the combination of symbolic execution and constraint solving. Methods for representing expressions and path conditions are discussed. An implemented toolkit is described with some examples. The toolkit transforms an input program (possibly embedded with assertions) to an extended finite state machine and then performs depth-first or breadth-first search on it. The goal is to find values for input variables such that a terminal state can be reached. If successful, input test data are found (which might reveal a bug in the program). &copy; 2004 IEEE. Number of references:33 Main heading:Data acquisition Controlled terms:Computer programming - Constraint theory - Data structures - Graph theory - Mathematical models - Software engineering Uncontrolled terms:Automatic test data generation - Finite state machine - Logical operators - Program analysis 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 - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 56> Accession number:2004508717054 Title:Adaptive packet marking for IP traceback Authors:Li, De-Quan (1); Xu, Yi-Ding (2); Su, Pu-Rui (1); Feng, Deng-Guo (1) Author affiliation:(1) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., P.O. Box 8718, Beijing 100080, China; (2) UNIX User's Assoc. of China, No.31 Xueyuanlu, Beijing 100083, China Corresponding author:Li, D.-Q. (dequanli@) Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:32 Issue:8 Issue date:August 2004 Publication year:2004 Pages:1334-1337 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Denial of service attack is among the hardest network problems. Several countermeasures are proposed for it in the literature, among which, Probabilistic Packet Marking (PPM) first developed by Savage et al is promising and has many variants. In these marking schemes, router marks packets with a probability which is fixed and uniform. Using fixed probability causes that many packets are needed for a victim to reconstruct the attack path(s). An adaptive marking scheme is given, which reduces the number of packets needed for attack path reconstruction, thus also saves time for the victim and reduces the ability for attackers to spoof. Abstract type:(Edited Abstract) Number of references:10 Main heading:Telecommunication services Controlled terms:Calculations - Network protocols - Packet networks - Probability - Routers Uncontrolled terms:Adaptive packet marking - Attack path reconstruction - Denial of service (DoS) - Distributed denial of service (DDos) - IP traceback Classification code:716 Telecommunication; Radar, Radio and Television - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722.3 Data Communication, Equipment and Techniques - 723 Computer Software, Data Handling and Applications - 921 Mathematics - 922.1 Probability Theory Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 57> Accession number:2004248214409 Title:Notes on packet marking for IP traceback Authors:Li, De-Quan (1); Su, Pu-Rui (1); Feng, Deng-Guo (1) Author affiliation:(1) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Li, D.-Q. (dequanli@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:2 Issue date:February 2004 Publication year:2004 Pages:250-258 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Distributed Denial of Service (DDoS) attack is among the hardest network security problems to address. Recently, several countermeasures are proposed, among which, PPM (probabilistic packet marking) pioneered by Savage et al. is promising. In this paper, a brief review of countermeasures to DDoS is given and then an analysis on some of the packet marking schemes is provided. Some modifications are further provided. One modification to the basic PPM scheme can reduce its computation remarkably. Number of references:18 Main heading:Internet Controlled terms:Distributed computer systems - Network protocols - Packet switching - Probabilistic logics - Security of data Uncontrolled terms:Denial of service - Distributed denial of service - IP traceback - Packet marking Classification code:718 Telephone Systems and Related Technologies; Line Communications - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.2 Data Processing and Image Processing Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 58> Accession number:2005078842419 Title:VICOS: A framework for session management in network computing infrastructure Authors:Li, Wenjie (1); Li, Mingshu (1); Wang, Qing (1); Wang, Yongji (1) Author affiliation:(1) Laboratory for Internet Technology, Institute of Software, Chinese Academy of Sciences Source title:Proceedings - 2004 IEEE International Conference on Services Computing, SCC 2004 Abbreviated source title:Proc. IEEE Int. Conf. Serv. Comput. SCC Monograph title:Proceedings - 2004 IEEE International Conference on Services Computing, SCC 2004 Issue date:2004 Publication year:2004 Pages:647-650 Language:English ISBN-10:0769522254 ISBN-13:9780769522258 Document type:Conference article (CA) Conference name:Proceedings - 2004 IEEE International Conference on Services Computing, SCC 2004 Conference date:September 15, 2004 - September 18, 2004 Conference location:Shanghai, China Conference code:64288 Sponsor:IEEE Comput. Soc. Tech. Steering Comm. for Serv. Comput. (TSC-SC) Publisher:IEEE Computer Society Abstract:By introducing a virtual computing session abstraction to network computing infrastructure, and slightly extending its underlying remote display protocol, we propose VICOS (Virtual Computing Session): a framework of session management which provides session-level manageability, and allows multiple user to access the computing service on the server simultaneously. The virtual computing session abstraction also supports user roaming among desktops, i.e. user mobility. This framework isolates user's computing session from network or desktop failure. The session-level management mechanism provided by this framework improves the service availability and reliability. We have implemented our VICOS prototype in Linux. We demonstrate that our Linux VICOS prototype can provide general-purpose computing service with low overhead. Number of references:10 Main heading:Virtual reality Controlled terms:Bandwidth - Network protocols - Optimization - Parameter estimation - Servers Uncontrolled terms:Session authentication agents (SAA) - Session route agents (SRA) - System architecture - Virtual computing Classification code:716.1 Information Theory and Signal Processing - 722 Computer Systems and Equipment - 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 59> Accession number:2004208164771 Title:Adaptive scheduling approaches to open real-time systems Authors:Zou, Yong (1); Huai, Xiao-Yong (1); Li, Ming-Shu (1) Author affiliation:(1) Lab. of Internet Software Technol., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zou, Y. (zouy@itechs.iscas.ac.cn) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:27 Issue:1 Issue date:January 2004 Publication year:2004 Pages:58-65 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:The adaptive scheduling problems for open real-time systems are discussed in this paper. In an open real-time system, tasks are loaded dynamically and their schedulability is tested on line. At the mean time, how much CPU bandwidth the tasks need may not be known as a priori. This feature urges us to develop adaptive real-time scheduling approaches which can allocate resources to tasks dynamically at run time. According to the scheduling requirements of the open real-time system, adaptive scheduling approaches are presented respectively for hard real-time tasks and soft real-time tasks. Firstly, an approach based on feedback control is presented for the hard real-time tasks scheduling. Secondly, for soft real-time applications, another adaptive scheduling approach is presented. The second one is based on fussy control technology. It can control the deadline missing ratio near the expected value while sampling the applications' performance. These adaptive scheduling approaches are developed for open real-time system, with the merits that they can schedule different kinds of real-time tasks and adapt to their dynamic resource requirements through tuning the schedulers. Number of references:10 Main heading:Real time systems Controlled terms:Adaptive control systems - Control system analysis - Decision making - Fuzzy control - Open systems - Scheduling Uncontrolled terms:Adaptive scheduling approaches - Open real time system Classification code:722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 731.1 Control Systems - 921 Mathematics Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 60> Accession number:2004408391320 Title:Polymorphic type for a kind of recursive functions Authors:Huang, Wen-Ji (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Graduate Sch., Chinese Acad. of Sci., Beijing 100039, China Corresponding author:Huang, W.-J. (hwj@ios.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:7 Issue date:July 2004 Publication year:2004 Pages:969-976 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Based on recursive functions defined on context-free language, LFC (language for context free recursive function) is a formal specification language and fits for dealing with phrase structure. LFC is yet another functional language with many general characteristics. It is implemented in SAQ (specification acquisition system). The original type system for LFC is not polymorphic. With type variables, the original type system can be augmented and become a polymorphic type system. The type checking algorithm and some problems about implementation are also discussed. Polymorphic type system makes LFC more agile and predicts good future in the applications of LFC. Abstract type:(Edited Abstract) Number of references:18 Main heading:Context free languages Controlled terms:Algorithms - Computer program listings - Recursive functions Uncontrolled terms:Context free recursive functions - Formal specification languages - Functional languages - Polymorphic type systems - Specification acquisition systems - Type checking - Type systems Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1 Computer Programming - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 61> Accession number:2005169045345 Title:Aggregating local behaviors based upon a discrete lagrange multiplier method Authors:Tang, Yi (1); Liu, Timing (3); Jin, Xiaolong (3) Author affiliation:(1) Department of Information Science, Guangzhou University, Guangzhou, 510405, China; (2) State Key Lab of Info. Security, Institute of Software, CAS, Beijing, 100039, China; (3) Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong Corresponding author:Tang, Y. (ytang@gzhu.edu.cn) Source title:Proceedings - IEEE/WIC/ACM International Conference on Intelligent Agent Technology. IAT 2004 Abbreviated source title:Proc. IEEE WIC ACM Int. Conf. Intell. Agent Technol. IAT Monograph title:Proceedings - IEEE/WIC/ACM International Conference on Intelligent Agent Systems. IAT 2004 Issue date:2004 Publication year:2004 Pages:413-416 Language:English ISBN-10:0769521010 ISBN-13:9780769521015 Document type:Conference article (CA) Conference name:Proceedings - IEEE/WIC/ACM International Conference on Intelligent Agent Technology. IAT 2004 Conference date:September 20, 2004 - September 24, 2004 Conference location:Beijing, China Conference code:64530 Sponsor:IEEE Computer Society; Web Intelligence Consortium, WIC; ACM Publisher:IEEE Computer Society Abstract:When solving a distributed problem based on a multiagent system, the local behaviors of agents will be aggregated to the global behaviors of the multi-agent system towards a solution state. This paper presents a distributed discrete Lagrange multiplier (DDLM) method for solving distributed constraint satisfaction problems (distributed CSPs). In this method, the local behaviors of agents are aggregated as a descent direction of an objective function corresponding to the problem at hand. Thus, a trend to a solution state will be formed. Furthermore, we provide three techniques to speed up the aggregation of agents' local behaviors. Through experiments on benchmark graph coloring problems, we validate the effectiveness of the presented DDLM method as well as the three techniques in solving distributed CSPs. &copy; 2004 IEEE. Number of references:8 Main heading:Lagrange multipliers Controlled terms:Benchmarking - Graph theory - Mathematical transformations - Multi agent systems - Problem solving - Set theory Uncontrolled terms:Benchmark graph coloring problems - Discrete lagrange multiplier methods - Distributed discrete lagrange multiplier (DDLM) - Non-empty groups Classification code:723.4 Artificial Intelligence - 723.5 Computer Applications - 912 Industrial Engineering and Management - 921 Mathematics - 921.3 Mathematical Transformations - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 62> Accession number:2005239143286 Title:Cluster cores-based clustering for high dimensional data Authors:Shen, Yi-Dong (1); Shen, Zhi-Yong (1); Zhang, Shi-Ming (1); Yang, Qiang (2) Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Department of Computer Science, Hong Kong Univ. of Sci. and Technology, Clearwater Bay, Kowloon, Hong Kong Corresponding author:Shen, Y.-D. (ydshen@ios.ac.cn) Source title:Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004 Abbreviated source title:Proc. Fourth IEEE Int. Conf. Data Min. ICDM Monograph title:Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004 Issue date:2004 Publication year:2004 Pages:519-522 Language:English ISBN-10:0769521428 ISBN-13:9780769521428 Document type:Conference article (CA) Conference name:Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004 Conference date:November 1, 2004 - November 4, 2004 Conference location:Brighton, United kingdom Conference code:64905 Sponsor:IEEE Computer Society TCCI; IEEE Computer Society TCPAMI Publisher:IEEE Computer Society Abstract:We propose a new approach to clustering high dimensional data based on a novel notion of cluster cores, instead of on nearest neighbors. A cluster core is a fairly dense group with a maximal number of pairwise similar objects. It represents the core of a cluster, as all objects in a cluster are with a great degree attracted to it. As a result, building clusters from cluster cores achieves high accuracy. Other major characteristics of the approach include: (1) It uses a semantics-based similarity measure. (2) It does not incur the curse of dimensionality and is scalable linearly with the dimensionality of data. (3) It outperforms the well-known clustering algorithm, ROCK, with both lower time complexity and higher accuracy. &copy; 2004 IEEE. Number of references:4 Main heading:Data reduction Controlled terms:Data mining - Graph theory - Learning systems - Numerical analysis - Semantics - Set theory Uncontrolled terms:Clustering - Cores - Edge connectivity - Jarvis-Patrick method Classification code:461.4 Ergonomics and Human Factors Engineering - 723.2 Data Processing and Image Processing - 903.2 Information Dissemination - 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 63> Accession number:2004358329807 Title:On schedulability test of rate monotonic and its extendible algorithms Authors:Wang, Yong-Ji (1); Chen, Qiu-Ping (1) Author affiliation:(1) Lab. for Internet Software Technol., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Graduate Sch., Chinese Acad. of Sci., Beijing 100039, China Corresponding author:Wang, Y.-J. (ywang@itechs.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:6 Issue date:June 2004 Publication year:2004 Pages:799-814 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Schedulability test is an essential issue in real-time scheduling theory. Rate monotonic (RM) algorithm is one of the scheduling algorithms in real-time systems. However, a general review on this field can hardly be seen. This paper presents a review of the various schedulability tests under RM algorithm, starting from the simplest ideal RM scheduling model and then going into the more complicated ones. Three subjects are covered: (1) schedulable tasks' CPU utilization least bound and the sufficient and necessary conditions; (2) condition of schedulable tasks taking the scheduling time cost into account; (3) condition of schedulable tasks taking priority inversion into account. Some appropriate examples are provided to illustrate and compare the relative merits among the discussed algorithms. Number of references:30 Main heading:Real time systems Controlled terms:Algorithms - Scheduling - Testing - Theorem proving Uncontrolled terms:CPU utilization - Priority inversion - Rate monotonic algorithms - Real time operating systems - Real time scheduling - Schedulability test - Scheduling time cost Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 912.2 Management Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 64> Accession number:2004288261802 Title:Modeling real-time cooperative systems with workflow nets Authors:Du, Yu-Yue (1); Jiang, Chang-Jun (1) Author affiliation:(1) Coll. of Comp., Liaocheng Univ., Liaocheng 252059, China; (2) Dept. of Comp. Sci. and Eng., Tongji Univ., Shanghai 200092, China; (3) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (4) Dept. of Comp. Sci., Shandong Inst. of Bus. and Technol., Yantai 264005, China; (5) Dept. of Comp. Sci., Ningbo Univ., Ningbo 315211, China Corresponding author:Du, Y.-Y. (yydu001@) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:27 Issue:4 Issue date:April 2004 Publication year:2004 Pages:471-481 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:A new formal method used to model and to analyze real-time cooperative systems, logical workflow nets, is presented based on Petri nets and workflow techniques in this paper. It is the abstract and extension of Petri nets and high-level Petri nets on the expression of passing value indeterminacy. It enhances the modeling and analyzing ability of Petri nets. Compared with the workflow nets, it is able to mitigating efficiently the problem of state space explosion to a certain extent and being used expediently by the designers of workflow nets. The input and output places of the logical transitions in logical workflow nets are restricted by corresponding temporal logical expressions. Some properties of logical workflow nets and their combining nets, such as soundness and liveness, are defined and analyzed. The inheritable problem of the properties from each single net to their combination net is discussed thoroughly. Since the time sequences of the messages to be transferred between its two related entities are only considered, when a combining net is analyzed, this method can reduce consumedly the analyzing complexity of logical workflow nets. The use of our method is illustrated by a useful example of an online selling system. Number of references:14 Main heading:Computer supported cooperative work Controlled terms:Computer simulation - Formal logic - Petri nets - Real time systems - Specifications Uncontrolled terms:Logical Petri net - Logical workflow net - Modeling and verification - Real time cooperative system - Workflow 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 - 902.2 Codes and Standards - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 65> <RECORD 1> Accession number:2004358329806 Title:Fuzzy feedback control real-time scheduling algorithm Authors:Jin, Hong (1); Wang, Hong-An (1); Fu, Yong (1); Wang, Qiang (1); Wang, Hui (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:15 Issue:6 Issue date:June 2004 Publication year:2004 Pages:791-798 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:To solve the dynamic preemptive scheduling problem of a fuzzy uncertain task set under an unpredictable environment, a scheduling algorithm, by applying fuzzy rules and fuzzy scheduling theory, is presented based on fuzzy feedback control, and its corresponding scheduling structure, composed of a basic scheduler and a fuzzy feedback controller, is established. The fuzzy scheduling algorithm is used as the scheduling algorithm of the basic scheduler. By classifying tasks into different priority levels and scheduling the task with high priority level first, more critical tasks can be scheduled. A fuzzy controller constitutes the part of the fuzzy feedback control with the adjusting policy of task flow. Simulation results show that the proposed fuzzy feedback-control scheduling can effectively control the missed deadline rate of tasks, the scheduling problem with fuzzy characteristics or unpredictable environment can be solved, and the successful scheduling rate of critical tasks can be improved. Number of references:8 Main heading:Real time systems Controlled terms:Algorithms - Computer simulation - Feedback control - Fuzzy sets - Scheduling Uncontrolled terms:CPU utilization - Fuzzy feedback control - Missed deadline percentage - Real time scheduling - Task flow Classification code:722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 731.1 Control Systems - 912.2 Management - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 66> Accession number:2005068829607 Title:Covert channel analysis in secure operating systems with high security levels Authors:Qing, Si-Han (1) Author affiliation:(1) Eng. Ctr. of Info. Security Technol., Chinese Acad. of Sci., Beijing 100080, China; (2) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, 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:15 Issue:12 Issue date:December 2004 Publication year:2004 Pages:1837-1849 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:The thirty years, development of covert channel analysis research is summarized. The essence of covert channel and its analysis is depicted according to our theoretical research and engineering experience in this area. The state of the art in the application of covert channel analysis approaches to the real systems is illustrated. Some major threads and emerging trends of the research in this area are presented. Number of references:28 Main heading:Computer operating systems Controlled terms:Calculations - Communication channels (information theory) - Data flow analysis - Measurements - Security of data - Semantics Uncontrolled terms:Covert channels - High security levels - Secure operating systems - Storage channels - Timing channels Classification code:716.1 Information Theory and Signal Processing - 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 - 903.2 Information Dissemination - 921 Mathematics Treatment:Applications (APP); General review (GEN); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 67> Accession number:2004348325307 Title:Extending standard UML semantics to support PADS design Authors:Hu, Si-Quan (0); Fan, Zhi-Hua (0); She, Chun-Dong (0) Corr. author affiliation:General Software Lab., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:41 Issue:6 Issue date:June 2004 Publication year:2004 Pages:1030-1036 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Science Press, Beijing, China Abstract:UML is proposed as a unified language to both simulation object modeling and PADS software system modeling. This work focuses on extending standard UML semantics to support simulation domain specific concepts including introducing virtual time in UML, and using UML statechart diagram and interaction diagram with virtual time labels and constraints to describe simulation entity functional property. In addition, virtual time synchronization stereotypes are created to describe PADS time synchronization protocols, which separates the functional properties and synchronization properties, thus alleviating the simulation modeling complexity and improving both simulation model reuse and synchronization reuse. A wireless network parallel simulation example is given to illustrate the extensions. Number of references:16 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 68> Accession number:2004498707335 Title:Real-time fur with biological pattern Authors:Yang, Gang (0); Fei, Guangzheng (0); Wu, Enhua (0) Corr. author affiliation:Key Lab. of Computer Science, Inst. 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:16 Issue:9 Issue date:September 2004 Publication year:2004 Pages:1244-1249 Language:Chinese ISSN:10039775 CODEN:JFTXFX Document type:Journal article (JA) Publisher:Institute of Computing Technology, Beijing, China Abstract:An approach is presented, which combines reaction-diffusion with Lengyel's real-time fur to render the fur with biological pattern effect. Firstly, we generate biological pattern texture on model surface by reaction-diffusion; then introduce the texture to the fur rendering process to produce pattern effect on fur. In addition, we improve Lengyel's method by employing vertex shader and pixel shader, which not only speeds up the rendering rates, but also allows more accurate computation of fur shading. Number of references:12 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 69> Accession number:2004298270477 Title:Application of edge detector in video object extraction Authors:Hong, Fei (0); Wang, Jun (0); Wu, Zhimei (0) Corr. author affiliation:Multimedia Research Ctr., Inst. of Software, Chinese Acad. of Sci., 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:16 Issue:1 Issue date:January 2004 Publication year:2004 Pages:57-61 Language:Chinese ISSN:10039775 CODEN:JFTXFX Document type:Journal article (JA) Publisher:Institute of Computing Technology, Beijing, China Abstract:An algorithm using edge detector to detect the region of video objects in key frames of a video sequence and to build reference objects for the subsequent motion-estimation and compensation is proposed. First, the edge detectors of both Marr-Hildreth and Canny are used to build an edge image from the original key frame. Then the edge image is scanned to form mask. Finally, the original image is "AND" operated with the mask image to extract the video object. The algorithm is useful for many applications, especially for video conference and news. The experiment results show that the algorithm based on Canny edge detector is better than that based on Marr-Hildreth and presents better reference frame for the whole video sequence. Number of references:9 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 70> Accession number:2004438422918 Title:Fusion algorithm of correlated local estimates Authors:Qiu, Hong Zhuan (1); Zhang, Hong Yue (1); Jin, Hong (2) Author affiliation:(1) Sch. of Automat. Sci./Elec. Eng., Beihang University, 37 Xueyuan Road, Haidian District, Beijing 100083, China; (2) Hum. Comp. Interac./I.I.P.L., Institute of Software, Chinese Academy of Sciences, Beijing, 100080, China Corresponding author:Qiu, H.Z. (qiuhz@) Source title:Aerospace Science and Technology Abbreviated source title:Aerosp Sci Technol Volume:8 Issue:7 Issue date:October 2004 Publication year:2004 Pages:619-626 Language:English ISSN:12709638 Document type:Journal article (JA) Publisher:Elsevier Abstract:Three algorithms for fusing local estimates are compared. The first one (algorithm A) is the well known Federated filtering algorithm proposed by Carlson [Federated filter for fault-tolerant integrated navigation systems, in: Proceedings of IEEE Position, Location and Navigation Symposium, Oriando, FL, 1988 pp. 110-119; IEEE Trans. Aerospace and Electronic System 26 (3) (1990) 517-525], which needs an Upper Bound technique to eliminate the correlation between local estimates, and a reset procedure to make the global estimate optimal. The second one (algorithm B) proposed by Hong Jin and Hong Yue Zhang directly calculates the optimal global estimate as a weighted sum of correlated local estimates using general weighting matrices [Fusion algorithm of correlated local estimates for federated filter, in: Proceedings of the 3rd Asian Control Conference, Shanghai, 2000, pp. 1428-1433]. In this paper a simplified algorithm (algorithm C) is derived, which uses diagonal weighting matrices. The simplification leads to less computation as compared to that of algorithm B, but the global estimate is sub-optimal. Comparison between these three algorithms is conducted by theoretical analysis and extensive simulations as well. The comparison reveals that the algorithm C has moderate calculation load, strong fault tolerance and little loss in estimation accuracy. And the sensitivities to the values of covariance matrices of noises are similar for the three algorithms. &copy; 2004 Elsevier SAS. All rights reserved. Number of references:12 Main heading:Navigation Controlled terms:Algorithms - Computation theory - Data communication systems - Matrix algebra - Sensors - State estimation - Statistical methods Uncontrolled terms:Decentralized filtering - Fusion algorithms - Information fusion Classification code:655.1 Spacecraft, General - 731.1 Control Systems - 921.1 Algebra - 922.2 Mathematical Statistics Treatment:Theoretical (THR) DOI:10.1016/j.ast.2004.06.009 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 71> Accession number:2005038791405 Title:A robot path planning approach based on generalized semi-infinite optimization Authors:Liu, Han (1); Tang, Qianying (2); Wang, Yongji (3) Author affiliation:(1) Department of Computer Science, University of Toronto, Toronto M5S 3G4, Canada; (2) Deaprtment of Computer Engineering, University of Toronto, Toronto M5S 3A8, Canada; (3) Institute of Software, Chinese Academy of Sciences, Beijing, 100080, China Corresponding author:Liu, H. (hanliu@cs.toronto.edu) Source title:2004 IEEE Conference on Robotics, Automation and Mechatronics Abbreviated source title:IEEE Conf. Rob. Autom. Mechatron. Monograph title:2004 IEEE Conference on Robotics, Automation and Mechatronics Issue date:2004 Publication year:2004 Pages:768-773 Language:English ISBN-10:0780386469 ISBN-13:9780780386464 Document type:Conference article (CA) Conference name:2004 IEEE Conference on Robotics, Automation and Mechatronics Conference date:December 1, 2004 - December 3, 2004 Conference location:Singapore Conference code:64159 Sponsor:Institute of Electrical and Electronics Engineers, IEEE; IEEE SMC Society Singapore Chapter; IEEE R and A Society Singapore Chapter Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:This paper inherits the fundamental ideas of inequality and optimization techniques from the previous work and converts the real-time obstacle avoidance problem into a semi-infinite constrained optimization problem with the help of a delicate mathematical transformation, which leads to an efficient real-time robotics' path planning approach. Motivated by the practical requirements of obstacle representation, a generalized semi-infinite optimization problem (GSOP) with not only intersection but also union operations was proposed and a mathematical solution to it was developed. Simulation results in 3D space have been presented to show its merits. non-linear programming, obstacle avoidance, robotics, semi-infinite constrained optimization. Number of references:9 Main heading:Motion planning Controlled terms:Approximation theory - Boolean functions - Collision avoidance - Functions - Mathematical techniques - Nonlinear programming - Optimization - Real time systems - Robotics Uncontrolled terms:Goal configuration - Semi-infinite constrained optimization Classification code:921.5 Optimization Techniques - 921.1 Algebra - 914.1 Accidents and Accident Prevention - 921.6 Numerical Methods - 731.5 Robotics - 722.4 Digital Computers and Systems - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1 Computer Programming Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 72> Accession number:2004518726897 Title:Coevolving and cooperating path planner for multiple unmanned air vehicles Authors:Zheng, Changwen (1); Ding, Mingyue (2); Zhou, Chengping (2); Li, Lei (1) Author affiliation:(1) Laboratory of General Software, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Inst. Pattern Recog. Artif. Intell., Huazhong Univ. of Sci. and Technol., Wuhan 430074, China Corresponding author:Zheng, C. (cwzheng@) Source title:Engineering Applications of Artificial Intelligence Abbreviated source title:Eng Appl Artif Intell Volume:17 Issue:8 Issue date:December 2004 Publication year:2004 Pages:887-896 Language:English ISSN:09521976 CODEN:EAAIE6 Document type:Journal article (JA) Publisher:Elsevier Ltd Abstract:In this paper, the coordinated path planning problem for multiple unmanned air vehicles is studied with the proposal of a novel coevolving and cooperating path planner. In the new planner, potential paths of each vehicle form their own sub-population, and evolve only in their own sub-population, while the interaction among all sub-problems is reflected by the definition of fitness function. Meanwhile, the individual candidates are evaluated with respect to the workspace so that the computation of the configuration space is avoided. By using a problem-specific representation of candidate solutions and genetic operators, our algorithm can take into account different kinds of mission constraints and generate solutions in real time. &copy; 2004 Elsevier Ltd. All rights reserved. Number of references:16 Main heading:Unmanned vehicles Controlled terms:Collision avoidance - Evolutionary algorithms - Motion planning - Optimization - Probability - Real time systems Uncontrolled terms:Coevolving algorithm - Cooperative path planning - Coordination - Multiple unmanned air vehicles Classification code:922.1 Probability Theory - 921.5 Optimization Techniques - 914.1 Accidents and Accident Prevention - 723 Computer Software, Data Handling and Applications - 722.4 Digital Computers and Systems - 652 Aircraft and Avionics - 431.5 Air Navigation and Traffic Control Treatment:Theoretical (THR) DOI:10.1016/j.engappai.2004.08.016 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 73> Accession number:2004428412734 Title:Layered textures for image-based rendering Authors:Wang, Wen-Cheng (1); Li, Kui-Yu (1); Zheng, Xin (1); Wu, En-Hua (1) Author affiliation:(1) Key Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Department of Computer Science, Faculty of Science and Technology, University of Macau, Macao, China; (3) Graduate School, Chinese Academy of Sciences, Beijing 100039, China 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:19 Issue:5 Issue date:September 2004 Publication year:2004 Pages:633-642 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:An extension to texture mapping is given in this paper for improving the efficiency of image-based rendering. For a depth image with an orthogonal displacement at each pixel, it is decomposed by the displacement into a series of layered textures (LTs) with each one having the same displacement for all its texels. Meanwhile, some texels of the layered textures are interpolated for obtaining a continuous 3D approximation of the model represented in the depth image. Thus, the plane-to-plane texture mapping can be used to map these layered textures to produce novel views and the advantages can be obtained as follows: accelerating the rendering speed, supporting the 3D surface details and view motion parallax, and avoiding the expensive task of hole-filling in the rendering stage. Experimental results show the new method can produce high-quality images and run faster than many famous image-based rendering techniques. Number of references:19 Main heading:Computer graphics Controlled terms:Approximation theory - Computational methods - Computer simulation - Image analysis - Mapping - Textures Uncontrolled terms:Image-based rendering - Layered texture - Motion parallax - Texture mapping Classification code:405.3 Surveying - 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.6 Numerical Methods - 933 Solid State Physics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 74> Accession number:2004498704648 Title:IAM: An algorithm of indirect association mining Authors:Li, Lei (1); Xu, Fanjiang (1); Wang, Hongbing (1); She, Chundong (1); Fan, Zhihua (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Li, L. (wawahohobibi@) Source title:Proceedings - 2004 International Conference on Intelligent Mechatronics and Automation Abbreviated source title:Proc. Int. Conf. Intell. Mechatron. Autom. Monograph title:Proceedings - 2004 International Conference on Intelligent Mechatronics and Automation Issue date:2004 Publication year:2004 Pages:831-835 Language:English ISBN-10:0780387481 ISBN-13:9780780387485 Document type:Conference article (CA) Conference name:Proceedings - 2004 International Conference on Intelligent Mechatronics and Automation Conference date:August 26, 2004 - August 31, 2004 Conference location:Chengdu, China Conference code:63941 Sponsor:IEEE Robotics and Automation Society; IEEE Systems, Man, and Cybernetics Society; IEEE Shikoku Section; National Natural Science Foundation of China; Chinese Institute of Electronics Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:There have been several algorithms for mining association rules, such as Apriori and some improved Aprioris, only to be interested in those itemsets, which have support above a user-defined threshold. However, there exists a kind of important rule, indirect association, hidden in these itemsets, which are filtered out. When a pair of items, (A, B), which seldom occur together in the same transaction, are highly dependent on the presence of another itemset, Z, the pair (A, B) are said to be indirectly associated via Z. In this paper, the definition of indirect association is firstly given. Then a measure of dependence to estimate the correlation between relative frequent items and a simple way to express the closeness between a pair of items indirectly associated by another itemset are provided. In addition, two kinds of classifying standard for indirect association rules are proposed for further research. In order to mine such indirect association rules, an algorithm of indirect association mining (IAM) is presented. And the complexity analysis about this algorithm is showed. An experiment in order to verify the utility of this algorithm is made. Finally, some issues about the IAM algorithm are put forward for future research. Number of references:14 Main heading:Data mining Controlled terms:Algorithms - Computational complexity - Correlation methods - Optimization - Query languages - Set theory Uncontrolled terms:Association rule - Bridge itemsets - Database transactions - Indirect association 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.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 921.5 Optimization Techniques - 922.2 Mathematical Statistics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 75> Accession number:2004538759824 Title:Construction of cryptographically important Boolean permutations Authors:Zhang, Wenying (1); Wu, Chuan-Kun (1); Li, Shiqu (2) Author affiliation:(1) State Key Lab of Info. Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Department of Information Research, Information Engineering University, Zhengzhou 450002, China Corresponding author:Zhang, W. (wenyingzh@is.iscas.ac.cn) Source title:Applicable Algebra in Engineering, Communications and Computing Abbreviated source title:Appl Algebra Eng Commun Comput Volume:15 Issue:3-4 Issue date:November 2004 Publication year:2004 Pages:173-177 Language:English ISSN:09381279 CODEN:AAECEW Document type:Journal article (JA) Publisher:Springer Verlag Abstract:In this paper a new general methodology is developed to construct Boolean permutations such that any non-trivial linear combination of their components has the largest algebraic degree. Number of references:3 Main heading:Boolean functions Controlled terms:Cryptography - Multivariable systems - Polynomials - Security of data - Theorem proving - World Wide Web Uncontrolled terms:Algebraic degree - Cryptographic transform - Hash function - Permutation Classification code:716 Telecommunication; Radar, Radio and Television - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.2 Data Processing and Image Processing - 731.1 Control Systems - 921.1 Algebra Treatment:Theoretical (THR) DOI:10.1007/s00200-004-0163-7 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 76> Accession number:2005088853950 Title:Research on supply chain exception event management system Authors:Zhang, Kai-Feng (1); Han, Yong-Sheng (1); Pan, Xu-Wei (2) Author affiliation:(1) Ctr. of Indust. Mgmt. and Design, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Inst. of Contemporary Mfg. Eng., Zhejiang Univ., Hangzhou 310027, China Corresponding author:Zhang, K.-F. (kaikaizhang@) Source title:Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS Abbreviated source title:Jisuanji Jicheng Zhizao Xitong Volume:10 Issue:11 Issue date:November 2004 Publication year:2004 Pages:1402-1407 Language:Chinese ISSN:10065911 CODEN:JJZXFN Document type:Journal article (JA) Publisher:CIMS Abstract:Managing the exception events is crucial for supply chain to make sure the system running normally. In order to immediately find the exception events in the business processes, collaboratively resolve them in time, and be rapidly-responsive and more competitive in the collaborative, changeful business environment, a solution model of Supply Chain Exception Management System was put forward to focus on controlling exceptions of the critical points in the business process. Correspondingly, a framework based on quantitified performance index was constructed to integrat process, information and person, and a configurable, extensible software architecture was constructed. This system was demonstrated by a process example for exception management. Number of references:10 Main heading:Management information systems Controlled terms:Computer aided analysis - Computer software - Information analysis Uncontrolled terms:Business process management - Collaborative management - Exception event - Supply chain Classification code:723.5 Computer Applications - 903.1 Information Sources and Analysis - 912.2 Management Treatment:Applications (APP); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 77> Accession number:2005159039028 Title:A robot path planning approach based on generalized semi-infinite optimization Authors:Liu, Han (1); Tang, Qianying (2); Wang, Yongji (3) Author affiliation:(1) Department of Computer Science, University of Toronto, Toronto M5S 3G4, Canada; (2) Deaprtment of Computer Engineering, University of Toronto, Toronto M5S 3A8, Canada; (3) Institute of Software, Chinese Academy of Sciences, Beijing, 100080, China Corresponding author:Liu, H. (hanliu@cs.toronto.edu) Source title:2004 IEEE Conference on Robotics, Automation and Mechatronics Abbreviated source title:IEEE Conf. Rob. Autom. Mechatron. Volume:2 Monograph title:2004 IEEE Conference on Robotics, Automation and Mechatronics Issue date:2004 Publication year:2004 Pages:768-773 Article number:TM4.5 Language:English ISBN-10:0780386450 ISBN-13:9780780386457 Document type:Conference article (CA) Conference name:2004 IEEE Conference on Robotics, Automation and Mechatronics Conference date:December 1, 2004 - December 3, 2004 Conference location:Singapore, Singapore Conference code:64502 Sponsor:nstitute of Electrical and Electronics Engineers, IEEE Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:This paper inherits the fundamental ideas of inequality and optimization techniques from the previous work and converts the real-time obstacle avoidance problem into a semi-infinite constrained optimization problem with the help of a delicate mathematical transformation, which leads to an efficient real-time robotics' path planning approach. Motivated by the practical requirements of obstacle representation, a generalized semi-infinite optimization problem (GSOP) with not only intersection but also union operations was proposed and a mathematical solution to it was developed. Simulation results in 3D space have been presented to show its merits. &copy; 2004 IEEE. Number of references:9 Main heading:Motion planning Controlled terms:Approximation theory - Boolean algebra - Collision avoidance - Computer simulation - Manipulators - Mathematical transformations - Nonlinear programming - Optimization - Real time systems - Robots Uncontrolled terms:Constructive solid geometry (CSG) - Real time obstacle avoidance - Robot path planning - Semi-infinite constrained optimization Classification code:921.5 Optimization Techniques - 921.3 Mathematical Transformations - 921.1 Algebra - 914.1 Accidents and Accident Prevention - 921.6 Numerical Methods - 731.5 Robotics - 723.1 Computer Programming - 722.4 Digital Computers and Systems - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.5 Computer Applications Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 78> Accession number:2004538760280 Title:Dynamic process model based on service cooperation middleware Authors:Liu, Shao-Hua (1); Wei, Jun (1); Huang, Tao (1) Author affiliation:(1) Technol. Ctr. of Software Eng., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Liu, S.-H. (ham_liu@otcaix.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:10 Issue date:October 2004 Publication year:2004 Pages:1431-1440 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Emerging service oriented architecture is increasing the evolution and variation of software resources. Applications that cannot adapt to dynamic environments will decrease their usefulness, particularly to business process management systems that face requirements changed frequently. In response to the realistic requirements, this paper, based on Web services and business process management techniques, propose a model of service cooperation middleware (SCM) for enterprise computing. First, it discusses the conceptual architecture and operation mechanisms of SCM, then formalizes the meta-model of cooperative processes deployed on SCM. By introducing a model transformation function into the formalization, a static process model can be extended to a dynamic one. In virtue of the reflection capability, structural reconstruction and behavioral adaptation of the dynamic processes can be achieved in SCM by introspection and effectuation. In terms of the conceptual model of SCM, a process virtual machine (PVM) is designed as a running container for cooperative processes. Borrowed from the power of MDA mechanism, the model of a business process can be transformed successively from design to run time. The business processes established on SCM can be more flexibly and extensively applied to various open environments, and leverage modern enterprise computing. Number of references:12 Main heading:Marketing Controlled terms:Calculations - Computer software - Computer supported cooperative work - Management information systems - Mathematical models - Middleware - Process control - Virtual reality - World Wide Web Uncontrolled terms:Business process management - Dynamic processes - Enterprise computing - Process virtual machines - Reflection capability - Service cooperation - Variable structure - Web services Classification code:716 Telecommunication; Radar, Radio and Television - 723 Computer Software, Data Handling and Applications - 731 Automatic Control Principles and Applications - 911.4 Marketing - 912.2 Management - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 79> Accession number:2004408391335 Title:Hierarchical schemata design for XML schemata and DTDs normalization design Authors:Wu, Yong-Hui (1) Author affiliation:(1) Dept. of Comp. Sci. and Eng., Fudan Univ., Shanghai 200433, China; (2) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wu, Y.-H. (slwu@fudan.edu.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:7 Issue date:July 2004 Publication year:2004 Pages:1099-1106 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Normalization design of XML Schemata and DTDs (document type definitions) is to produce a set of XML schemata or DTDs that can well represent data dependencies and eliminate redundancies. Now there are a few researches on it, and the existing researches are still at its initial stage. Provost proposed the idea of applying the theory of relational database to XML schemata normalization design. This idea has not been put into practice. The paper shows algorithms of hierarchical schemata design for XML schemata and DTDs normalization design based on Provost's idea. Firstly the paper analyzes hierarchy decomposition based on Provost's idea. Then it presents an algorithm producing a decomposition tree to eliminate redundant schemata. Finally it shows an algorithm of hierarchical schemata design for XML schemata and DTDs normalization design to get over deficiencies for Provost's idea. With respect to other researches on normalization design for XML schemata and DTDs, the set of full and embedded MVDs in hierarchical schemata produced by these algorithms are implied by the given set of MVDs (multivalued dependencies), and the hierarchical schemata eliminate redundant ones and satisfy the lossless join property. Abstract type:(Edited Abstract) Number of references:15 Main heading:XML Controlled terms:Algorithms - Data structures - Internet - Theorem proving - Trees (mathematics) Uncontrolled terms:Document type definitions - Hierarchical schemata - Lossless join property - Multivalued dependencies - Normalization design - Provost idea - Simple type elements - XML schemata 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 - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 80> Accession number:2005068825899 Title:Practical type checking of functions defined on context-free languages Authors:Chen, Hai-Ming (1); Dong, Yun-Mei (1) Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Chen, H.-M. (chm@ios.ac.cn) Source title:Journal of Computer Science and Technology Abbreviated source title:J Comput Sci Technol Volume:19 Issue:6 Issue date:November 2004 Publication year:2004 Pages:840-847 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:A type checking method for the functional language LFC is presented. A distinct feature of LFC is that it uses Context-Free (CF) languages as data types to represent compound data structures. This makes LFC a dynamically typed language. To improve efficiency, a practical type checking method is presented, which consists of both static and dynamic type checking. Although the inclusion relation of CF languages is not decidable, a special subset of the relation is decidable, i.e., the sentential form relation, which can be statically checked. Moreover, most of the expressions in actual LFC programs appear to satisfy this relation according to the statistic data of experiments. So, despite that the static type checking is not complete, it undertakes most of the type checking task. Consequently the run-time efficiency is effectively improved. Another feature of the type checking is that it converts the expressions with implicit structures to structured representation. Structure reconstruction technique is presented. Number of references:17 Main heading:Context free languages Controlled terms:Algorithms - Computer programming languages - Computer software selection and evaluation - Costs - Data structures - Optimization - Program compilers - Recursive functions - Trees (mathematics) Uncontrolled terms:Functional languages - Run-time efficiency - Structure reconstruction techniques - Type checking 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 - 911 Cost and Value Engineering; Industrial Economics - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 921.5 Optimization Techniques Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 81> Accession number:2004448436962 Title:Effective algorithm for improving cryptographic properties of bijective S-boxes Authors:Chen, Hua (0); Feng, Deng-Guo (0); Wu, Wen-Ling (0) Corr. author affiliation:Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:41 Issue:8 Issue date:August 2004 Publication year:2004 Pages:1410-1414 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Science Press, Beijing, China Abstract:S-boxes are the only nonlinear component in many cryptographic algorithms, which decides the security strength of the whole algorithm. S-boxes with good cryptographic properties can be constructed by genetic algorithm, and it is proved in practice that optimizing cryptographic properties of S-boxes in the middle procedure of algorithm can make the algorithm more effective. Difference uniformity is also an important aspect to weigh S-boxes. How to improve difference uniformity with difference matrix is considered. And a practical algorithm is given, which can improve nonlinearity and difference uniformity of a randomly chosen bijective S-box simultaneously. Number of references:4 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 82> Accession number:2004288256979 Title:Using SPIN to model cryptographic protocols Authors:Yongjian, Li (1); Rui, Xue (2) Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, 100080; (2) Stt. Key Lab. of Info. Security, Beijing, 100080 Corresponding author:Yongjian, L. (lyj238@ios.ac.cn) Source title:International Conference on Information Technology: Coding Computing, ITCC Abbreviated source title:Internat. Conf. Inf. Tech. Coding Comput. ITCC Volume:2 Monograph title:International Conference on Information Technology: Coding Computing, ITCC 2004 Issue date:2004 Publication year:2004 Pages:741-745 Language:English ISBN-10:0769521088 ISBN-13:9780769521084 Document type:Conference article (CA) Conference name:International Conference on Information Technology: Coding Computing, ITCC 2004 Conference date:April 5, 2004 - April 7, 2004 Conference location:Las Vegas, NV, United states Conference code:63213 Sponsor:IEEE Comput. Soc. Task Force on Inf. Tech. for Business Appl. Publisher:Institute of Electrical and Electronics Engineers Computer Society Abstract:We explore the use of Spin to model cryptographic protocols, and propose a general method to define the data structures used in the verification, such as facts, the intruder's knowledge, and so on. Based on this, we develop a general method to model the behaviors of honest principals and the intruder, in particular; we propose a general model for the intruder's deduction system. The method can be adapted to different protocols, and make it possible to transform a more abstract description of a sample protocol instance to Promela code. Our method is illustrated by using a revised TMN protocol, and the verification result has shown that it is a practical and useful way to analyze cryptographic protocols. Number of references:10 Main heading:Cryptography Controlled terms:Algorithms - Arrays - Boolean functions - Computer software - Data communication systems - Error detection - Mathematical models - Network protocols - Queueing theory - Security of data - Set theory Uncontrolled terms:Authentication protocols - Cryptographic protocols - Decryption - Inference systems Classification code:921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 921.1 Algebra - 723.2 Data Processing and Image Processing - 922.1 Probability Theory - 723 Computer Software, Data Handling and Applications - 716 Telecommunication; Radar, Radio and Television - 702.3 Solar Cells - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory Treatment:Theoretical (THR) DOI:10.1109/ITCC.2004.1286745 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 83> Accession number:2004268236483 Title:Clustering model for mobile ad hoc network Authors:Cheng, Wei-Ming (0); Zheng, Jian-Ping (0); Sheng, Ling-Zhi (0) Corr. author affiliation:Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:41 Issue:4 Issue date:April 2004 Publication year:2004 Pages:674-678 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Science Press Abstract:A new clustering model for wireless ad hoc network is presented. The metric of constraint degree is used to describe the mobility condition of nodes in the network, and a mathematical expression is defined based on attributes of the node. The clusterheads are selected according to communication capability and state transition of the nodes, and the clustering is performed using the GM-BFS algorithm. The handoff problem of mobile nodes is handled by the offset degree finally. Number of references:11 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 84> Accession number:2005209109320 Title:Description of service and resource in broadband IP network Authors:Ren, Shu-Ting (1); Wu, Zhi-Mei (2); Gu, Guo-Chang (1) Author affiliation:(1) Comp. Sci. and Technol. Coll., Harbin Eng. Univ., Harbin 150001, China; (2) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Ren, S.-T. (rst@isdn.iscas.ac.cn) Source title:Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications Abbreviated source title:Beijing Youdian Daxue Xuebao Volume:27 Issue:6 Issue date:December 2004 Publication year:2004 Pages:41-44 Language:Chinese ISSN:10075321 CODEN:BYXBEV Document type:Journal article (JA) Publisher:Beijing University of Posts and Telecommunications Abstract:The concept of network-service of transport layer and application layer have been presented. A mathematic method for describing the transport layer service has been given out. The meaning for quality of service (QoS) has been analyzed and its mathematic formula based the method presented here has been provided. The description of network-resource competition has been studied, and its allocation has been given. The description of QoS based the method presented here has been given out too. Number of references:5 Main heading:Broadband networks Controlled terms:Computer networks - Information services - Mathematical models - Network protocols - Quality of service - Resource allocation Uncontrolled terms:Application layer - Broadband IP network - Network resource competition - Network service - Resource occupying - Service description - Transport layer Classification code:716 Telecommunication; Radar, Radio and Television - 718 Telephone Systems and Related Technologies; Line Communications - 723 Computer Software, Data Handling and Applications - 912.2 Management - 912.3 Operations Research - 921 Mathematics Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 85> Accession number:2004538752059 Title:A new detecting scheme for blind images watermarking Authors:Sun, Zhongwei (1); Feng, Dengguo (1) Author affiliation:(1) State Key Lab. of Info. Security, Institute of Software, Chinese Academy of Science, Beijing 100080 Corresponding author:Sun, Z. (sunzwcn@.cn) Source title:2004 7th International Conference on Signal Processing Proceedings, ICSP Abbreviated source title:Int. Conf. Sign. Process. Proc. ICSP Monograph title:2004 7th International Conference on Signal Processing Proceedings, ICSP Issue date:2004 Publication year:2004 Pages:2336-2339 Language:English ISBN-10:0780384075 ISBN-13:9780780384071 Document type:Conference article (CA) Conference name:2004 7th International Conference on Signal Processing Proceedings, ICSP Conference date:August 31, 2004 - September 4, 2004 Conference location:Beijing, China Conference code:64055 Sponsor:Chinese Institute of Electronics (CIE); IEEE Signal Processing Society (IEEE-SPS); Institute of Electrical Engineers (IEE); Union Radio Scientifique Internationale (URSI); IEEE Beijing Section Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Watermark detection plays a crucial role in digital watermarking. A robust DWT-domain watermark detection scheme is proposed in this paper. First, generalized gaussian distributions are applied to statistically model the wavelet coefficients of the detail sub-bands of the original image. Then, based on the theory of statistical inference and weak signal detection in non-gaussian noise, a robust blind detection algorithm is derived. The performance of the new detector is analyzed. And the validity of the detector is also tested. Number of references:8 Main heading:Watermarking Controlled terms:Algorithms - Copyrights - Demodulation - Digital watermarking - Image processing - Problem solving - Statistical methods Uncontrolled terms:Discrete wavelet transform (DWT) - Generalized gaussian distribution - Watermark detection - Weak signal detection Classification code:713.3 Modulators, Demodulators, Limiters, Discriminators, Mixers - 723.2 Data Processing and Image Processing - 723.4 Artificial Intelligence - 902.3 Legal Aspects - 922.2 Mathematical Statistics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 86> <RECORD 1> Accession number:2004298268912 Title:Feature-gestures modeling of sketch in conceptual design Authors:Ma, Cuixia (0); Zhang, Fengjun (0); Chen, Youdi (0); Dai, Guozhong (0) Corr. author affiliation:Intelligence Eng. Lab., Inst. of Software, Chinese Acad. of Sci., 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:16 Issue:4 Issue date:April 2004 Publication year:2004 Pages:559-565 Language:Chinese ISSN:10039775 CODEN:JFTXFX Document type:Journal article (JA) Publisher:Institute of Computing Technology, Beijing, China Abstract:The concept of feature gesture is given and feature gesture base is set up. The modeling process based on feature gesture is described. Furthermore, the constraint capture, solution algorithm and the context-awareness are discussed. By comparing the method with traditional mode, we can see that the feature gestures are convenient and efficient for modeling. The method can make the interactive interface more natural and more intuitive, and simplify the designing process, allowing designers to express design intention fluently. By the way of user-Centered design, this method can improve the human-computer interaction in designing process. Abstract type:(Edited Abstract) Number of references:13 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 87> Accession number:2005088854097 Title:On the choice of the parameter r in robust r-support vector regression Authors:Zhu, Jia-Gang (1); Wang, Shi-Tong (2); Yang, Jing-Yu (1) Author affiliation:(1) Dept. of Comp. Sci. and Eng., Nanjing Univ. of Sci. and Technol., Nanjing 210094, China; (2) Sch. of Info. Eng., Southern Yangtze Univ., Wuxi 214036, China; (3) Lab. of Novel Software, Nanjing Univ., Nanjing 210016, China; (4) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wang, S.-T. (wxwangst@.cn) Source title:Kongzhi yu Juece/Control and Decision Abbreviated source title:Kongzhi yu Juece Control Decis Volume:19 Issue:12 Issue date:December 2004 Publication year:2004 Pages:1383-1386 Language:Chinese ISSN:10010920 CODEN:KYJUEF Document type:Journal article (JA) Publisher:Northeast University Abstract:The dependency relationship between r and the input noise in r-SVR is studied using the idea that SVR can be interpreted into an equivalent MAP problem. The dependency relationships are derived by maximizing the posteriori estimation. Accordingly, focus is paid on the case of Gaussian noise, and the linear inverse proportional dependency between r and the variance of Gaussian noise is then derived. Such a dependency relationship is useful to determine the optimal choice for r in r-loss function in the existence of Gaussian noise. Number of references:10 Main heading:Learning systems Controlled terms:Classification (of information) - Data processing Uncontrolled terms:Maximization posteriori estimation - Parameter choice - R loss function - Support vector machines - Support vector regression Classification code:716.1 Information Theory and Signal Processing - 723.2 Data Processing and Image Processing - 723.4 Artificial Intelligence Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 88> Accession number:2005149018044 Title:Adaptive robust header compression based on RTS/CTS handshake for real-time streams in 3G wireless network Authors:Wu, Yichuan (1); Limin, Sun (1); Ma, Jian (2) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, China; (2) Nokia Research Center, China, Beijing, China Corresponding author:Wu, Y. (wyc@iscas.ac.cn) Source title:IEEE Vehicular Technology Conference Abbreviated source title:IEEE Veh Technol Conf Volume:59 Issue:4 Monograph title:2004 IEEE 59th Vehicular Technology Conference, VTC2004-Spring: Towards a Global Wireless World Issue date:2004 Publication year:2004 Pages:2281-2285 Language:English ISSN:15502252 CODEN:IVTCDZ Document type:Conference article (CA) Conference name:2004 IEEE 59th Vehicular Technology Conference, VTC2004-Spring: Towards a Global Wireless World Conference date:May 17, 2004 - May 19, 2004 Conference location:Milan, Italy Conference code:64425 Sponsor:IEEE; IEEE Vehicular Technology Society Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:In "all-IP" wireless networks, It is necessary to adopt header compression schemes to reduce the protocol header size in order to utilize the limited bandwidth efficiently and make real-time services economically feasible and physically realizable. In this paper, a new adaptive robust header compression algorithm based on RTS/CTS handshake for real-time streams in wireless networks such as 3G platforms is proposed and analyzed. Through adjusting the dimension of Variable Sliding Window (VSW) of Window-based Least Significant Bits (W-LSB) encoding in header compressor with the accurate estimation of wireless channel state, this adaptive algorithm can achieve the good balance of compression ratio and error-resistant robustness for its adaptive use in wireless links. We present simulation results that demonstrate the effectiveness of this adaptive algorithm over wireless links. &copy; 2004 IEEE. Number of references:18 Main heading:Wireless telecommunication systems Controlled terms:Adaptive systems - Algorithms - Bandwidth - Computer networks - Data compression - Encoding (symbols) - Internet - Network protocols Uncontrolled terms:Networking protocols - Real time services - Voice over IP (VoIP) - Wireless networks Classification code:716 Telecommunication; Radar, Radio and Television - 716.1 Information Theory and Signal Processing - 723.2 Data Processing and Image Processing - 723.4 Artificial Intelligence Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 89> Accession number:2004248204421 Title:A problem solving environment for electronic commerce and collaborative work in the housing industry of China Authors:Xu, Jungang (1); Wang, Hongan (1); Dai, Guozhong (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Xu, J. Source title:Chinese Journal of Electronics Abbreviated source title:Chin J Electron Volume:13 Issue:2 Issue date:April 2004 Publication year:2004 Pages:258-262 Language:English ISSN:10224653 CODEN:CHJEEW Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Currently, the world is in the times that knowledge economy is growing up rapidly. The gathering, sharing, using and spreading of information have become key factors of influencing competition capability of one enterprise; at the same time, information technologies that support distributed computing and information sharing appear one after the other. Therefore, distributed computing will become an inevitable trend of development of enterprise informatization. As one part of the construction industry, the housing industry is emerging as a new application frontier for information technologies. According to the applications of information technologies in the housing industry, this paper puts forth a Problem Solving Environment for electronic commerce and collaborative work, electronic-PSE (e-PSE), which is an Intranet/Internet platform for solving many problems existing in the housing industry, such as building of virtual organization, system integration, development of new Internet/Intranet application and so on. The information infrastructure framework of e-PSE is presented, which includes two modules: XML-based electronic commerce platform (XECP), XML-based collaborative work platform (XCWP). XECP provides solutions for integration of construction system and electronic commerce system; XCWP provides solutions for building of virtual organization and implementation of collaborative work of partners. At last, conclusions and prospects are presented. Number of references:16 Main heading:Electronic commerce Controlled terms:Computer hardware - Computer software - Construction industry - Electronic communities - Groupware - Housing - Information technology - Internet - Intranets - Java programming language - Knowledge engineering - Problem solving - XML Uncontrolled terms:Electronic problem solving environment (e-PSE) - Housing industry - Information infrastructure framework - Virtual organization Classification code:903 Information Science - 723.5 Computer Applications - 723.4 Artificial Intelligence - 723.1.1 Computer Programming Languages - 722 Computer Systems and Equipment - 405 Construction Equipment and Methods; Surveying - 403.1 Urban Planning and Development Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 90> Accession number:2005189075677 Title:Real-time 3D fluid simulation on GPU with complex obstacles Authors:Liu, Youquan (1); Liu, Xuehui (1); Wu, Enhua (1) Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China; (2) Dept. of Comp. and Info. Science, Faculty of Science and Technology, University of Macau, Macao, China; (3) Graduate School, Chinese Academy of Sciences, China Source title:Proceedings - Pacific Conference on Computer Graphics and Applications Abbreviated source title:Proc Pacif Conf Comput Graph Appl Monograph title:Proceedings - 12th Pacific Conference on Computer Graphics and Applications, PG 2004 Issue date:2004 Publication year:2004 Pages:247-256 Language:English ISSN:15504085 Document type:Conference article (CA) Conference name:Proceedings - 12th Pacific Conference on Computer Graphics and Applications, PG 2004 Conference date:October 6, 2004 - October 8, 2004 Conference location:Seoul, Korea, Republic of Conference code:64603 Sponsor:IEEE Computer Society Publisher:Institute of Electrical and Electronics Engineers Computer Society Abstract:In this paper, we solve the 3D fluid dynamics problem in a complex environment by taking advantage of the parallelism and programmability of GPU. In difference from other methods, innovation is made in two aspects. Firstly, more general boundary conditions could be processed on GPU in our method. By the method, we generate the boundary from a 3D scene with solid clipping, 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, we modify the values on the boundaries according to the boundary conditions. Secondly, more compact structure in data packing with flat 3D textures 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 (NSEs). The test results prove the efficiency of our 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. &copy; 2004 IEEE. Number of references:33 Main heading:Computational fluid dynamics Controlled terms:Computational geometry - Computational methods - Computer graphics - Computer simulation - Data reduction - Differential equations - Navier Stokes equations - Partial differential equations - Real time systems Uncontrolled terms:Graphics processing units (GPU) - Parallelism - Partial differential equation (PDE) - Three dimensional (3D) fluid dynamics - Voxels Classification code:931.1 Mechanics - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 921.2 Calculus - 723.5 Computer Applications - 723.2 Data Processing and Image Processing - 722.4 Digital Computers and Systems - 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 91> Accession number:2004318292036 Title:General purpose computation on GPU Authors:Wu, Enhua (0); Liu, Youquan (0) Corr. author affiliation:Lab. of Computer Science, Inst. 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:16 Issue:5 Issue date:May 2004 Publication year:2004 Pages:601-612 Language:Chinese ISSN:10039775 CODEN:JFTXFX Document type:Journal article (JA) Publisher:Institute of Computing Technology, Beijing, China Abstract:Along with the rapid development of personal computers, various applications in computer graphics, even real-time applications in middle or small scale such as those in virtual reality and computer simulation, are migrating from workstations to PCs. To a large extent no doubt, the migration comes from the innovation of graphics hardware. For many years, with the advancement of graphics processing unit (GPU) and the creation of its new feature of programmability, scientists begin to transfer some of the processing stages in the graphics output pipeline or some graphics algorithms from CPU to GPU. To our surprise, except from those applications in graphics itself, GPU finds its applications in general purpose computations in other fields, and it comes up as a hot topic for research in recent 2 - 3 years. In this paper, starting from a brief introduction to some historical events on graphics hardware development, a detail introduction and analysis will be given to the technique and the latest development of GPU for general purpose computations, in combination with our own practice. Finally, a discussion is given to probe into the development perspective of GPU in this regard. Number of references:57 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 92> Accession number:2004268236490 Title:Fingerprint minutiae extraction based on binary image Authors:Fu, Jing-Guang (0); Xu, Gang (0); Wang, Yu-Guo (0) Corr. author affiliation:Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:41 Issue:4 Issue date:April 2004 Publication year:2004 Pages:720-727 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Science Press Abstract:Minutiae extraction is a critical problem in the research of automatic fingerprint recognition. Though there are many methods based on the analysis of a skeleton image or original gray image, the problem has not been solved perfectly. In this paper, a method is presented which extracts minutiae from the binary image. Image segments are first extracted from the binary image by run-length code matching. Then the minutiae are detected through the analysis of the segments' structure and their inter-relations. The direction of minutiae is determined by the line-testing method. Experimental results show that compared with the method based on the skeleton image, the proposed method is more efficient and can improve the accuracy of fingerprint matching. Number of references:12 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 93> Accession number:2005068829603 Title:OnceAS/Q: A QoS-enabled web application server Authors:Huang, Tao (1); Chen, Ning-Jiang (1); Wei, Jun (1); Zhang, Wen-Bo (1); Zhang, Yong (1) Author affiliation:(1) Technol. Ctr. of Software Eng., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (3) Graduate Sch., Chinese Acad. of Sci., Beijing 100039, China Corresponding author:Huang, T. (tao@otcaix.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:12 Issue date:December 2004 Publication year:2004 Pages:1787-1799 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:With the increasing diversity and complexity of distributed systems in network environment, web application server (WAS) is required to transform its service model from Best Effort to QoS (quality of service) Guarantee. However, most existing WASs are relatively weak in terms of QoS provision. In this paper, OnceAS/Q is presented to show how a QoS-enabled WAS can offer different QoS provisions for applications. OnceAS/Q provides a set of QoS related services and a framework to support QoS guarantee, in order to realize a QoS enabled WAS. This paper first describes the architecture and main components of OnceAS/Q. Then two key issues, related to QoS enabling and the corresponding solutions, are explored in detail: one is the definition and mapping of QoS specifications, and the other is the dynamic reconfiguration of QoS-aware service components and resources. Ecperf benchmark, a well-known performance benchmark for J2EE Application Server, is used to evaluate the effect of QoS enabling of OnceAS/Q. Experimental results show that OnceAS/Q can support better QoS for applications at a reasonable cost. Number of references:22 Main heading:Servers Controlled terms:Distributed database systems - Functions - Middleware - Optimization - Quality of service - Specifications - World Wide Web Uncontrolled terms:Dynamic reconfiguration - Ecperf benchmark - Optimization functions - QoS guarantee - Service models - Web application servers Classification code:716 Telecommunication; Radar, Radio and Television - 722 Computer Systems and Equipment - 723 Computer Software, Data Handling and Applications - 902.2 Codes and Standards - 921 Mathematics Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 94> Accession number:2004388368410 Title:Secure communication based on synchronization of a unified chaotic system Authors:Lu, Jun-An (1); Deng, Xiaoming (1); Xie, Jin (1); Chang, Liang (1) Author affiliation:(1) School of Mathematics and Statistics, Wuhan University, Wuhan, Hubei 430072, China; (2) State Key Lab. of Info. Security, Inst. Software Chinese Acad. of Sci., Beijing 100039, China Corresponding author:Lu, J.-A. (Jalu@wuhee.edu.cn) Source title:Proceedings of the World Congress on Intelligent Control and Automation (WCICA) Abbreviated source title:Proc. World Congr. Intelligent Control Autom. WCICA Volume:2 Monograph title:WCICA 2004 - Fifth World Congress on Intelligent Control and Automation, Conference Proceedings Issue date:2004 Publication year:2004 Pages:1264-1266 Language:English Document type:Conference article (CA) Conference name:WCICA 2004 - Fifth World Congress on Intelligent Control and Automation, Conference Proceedings Conference date:June 15, 2004 - June 19, 2004 Conference location:Hangzhou, China Conference code:63444 Sponsor:Zhejiang University; National Laboratory of Industrial Control Technology; Zhejiang University of Technology Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Since chaotic signal is broad spectrum and noise like, it is suitable for information encryption. Chaotic encryption is superior to key-based encryption as its speed is almost unrelated with key length. This paper presents an improved secure communication algorithm based on a unified system. The algorithm is used for encrypting and decrypting both continuous signals and discrete signals such as digital image. Especially, it avoids eigenfrequency assumptions for transmitted signals. Theoretical proof and numerical simulations show its high secure level and feasibility. Number of references:14 Main heading:Chaos theory Controlled terms:Acoustic noise - Algorithms - Cryptography - Eigenvalues and eigenfunctions - Functions - Mathematical models - Spectrum analysis - Synchronization Uncontrolled terms:Chaos synchronization - Decryption - Secure communication Classification code:922 Statistical Methods - 921.1 Algebra - 921 Mathematics - 751.4 Acoustic Noise - 731.1 Control Systems - 723 Computer Software, Data Handling and Applications - 716 Telecommunication; Radar, Radio and Television Treatment:Theoretical (THR) DOI:10.1109/WCICA.2004.1340819 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 95> Accession number:2004478468721 Title:Edge selection on gradients based on dome extraction Authors:Wang, Yike (1); Dou, Wanchun (1); Zhang, Xiwen (2); Cai, Shijie (1) Author affiliation:(1) Natl. Lab. Novel Software Technol., Nanjing University, Nanjing 210093, China; (2) Institute of Software, Chinese Academy of Sciences, Beijing 100080 Corresponding author:Wang, Y. (yikes_wang@.cn) Source title:International Conference on Signal Processing Proceedings, ICSP Abbreviated source title:Int Conf Signal Process Proc Volume:2 Monograph title:2004 7th International Conference on Signal Processing Proceedings (ICSP'04) Issue date:2004 Publication year:2004 Pages:1010-1013 Language:English Document type:Conference article (CA) Conference name:2004 7th International Conference on Signal Processing Proceedings (ICSP'04) Conference date:August 31, 2004 - September 4, 2004 Conference location:Beijing, China Conference code:63798 Sponsor:Chinese Institute of Electronics (CIE); IEEE Signal Processing Society (IEEE-SPS); Institute of Electrical Engineers (IEE); Union Radio Scientifique Internationale (URSI); IEEE Beijing Section Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:The phenomenon of multiple responses to a single edge often occurs in detecting noisy ramp edges. This paper investigates three properties of dome extracted by grayscale reconstruction and then presents a novel approach to select edges from gradients suppressing the multiplicity of response. The approach extracts domes in gradients, and then threshold them to get edges. Its computation time and memory requirements are not more than the non-maxima suppression algorithm obviously. Experiment results show that our approach suppresses the multiplicity of response effectively. Number of references:5 Main heading:Edge detection Controlled terms:Algorithms - Feature extraction - Image analysis - Image reconstruction - Spurious signal noise Uncontrolled terms:Dome extraction - Gaussian smoothing - Grayscale reconstruction - Multiple responses Classification code:716 Telecommunication; Radar, Radio and Television - 723.2 Data Processing and Image Processing - 723.5 Computer Applications - 921 Mathematics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 96> Accession number:2005038797906 Title:Study and implementation of double-levels-cache GFAC Authors:Shan, Zhi-Yong (1); Sun, Yu-Fang (1) Author affiliation:(1) Dept. of Comp., Renmin Univ. of China, Beijing 100872, China; (2) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Shan, Z.-Y. (zyshan@) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:27 Issue:11 Issue date:November 2004 Publication year:2004 Pages:1576-1584 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:Generalized Framework for Access Control (GFAC) which is a classical multi-policies supporting mechanism, is disclosed an underlying efficiency fault after enforced several policy modules in practice. In the paper, a two-levels-cache mechanism is brought in the GFAC based on a three levels model of access, and is implemented in Redflag secure OS. Experiments has proved that the two-levels-cache mechanism can effectively improve performance of the GFAC. Number of references:12 Main heading:Security of data Controlled terms:Cache memory - Computer operating systems - Data communication systems - Decision making Uncontrolled terms:Access control - Multi policies - Secure operating system Classification code:722.1 Data Storage, Equipment and Techniques - 723.2 Data Processing and Image Processing Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 97> Accession number:2004448429566 Title:P-Quadtrees: A point and polygon hybrid multi-resolution rendering approach Authors:Ji, Junfeng (1); Li, Sheng (1); Liu, Xuehui (1); Wu, Enhua (1) Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China; (2) Department of Computer Science, University of Macau, Macao, China Corresponding author:Ji, J. Source title:Proceedings of Computer Graphics International Conference, CGI Abbreviated source title:Proc Comput Graph Int Conf CGI Monograph title:Proceedings - Computer Graphics International, CGI 2004 Issue date:2004 Publication year:2004 Pages:382-385 Language:English ISSN:15301052 Document type:Conference article (CA) Conference name:Proceedings - Computer Graphics International, CGI 2004 Conference date:June 16, 2004 - June 19, 2004 Conference location:Crete, Greece Conference code:63656 Sponsor:SCI Publisher:Institute of Electrical and Electronics Engineers Computer Society Abstract:Point and polygon representations have their respective merits in rendering objects. In this paper, we propose a novel hybrid multi-resolution approach, P-Quadtrees, to efficiently render highly detailed objects. P-Quadtrees are constructed from geometry images. Both point and polygon are tightly integrated into a uniform structure. While traversing the P-Quadtrees in rendering, the part of surface that face the viewer can be rendered by coarser quad mesh to reduce the numbers of rendering primitives. The shading details can be enhanced by hardware accelerated normal mapping. The view dependent LOD selects the finer hierarchy on silhouette, which is rendered by points. The rendering of large-scale model is greatly accelerated while the visual effect both at the surfaces and the silhouette is guaranteed. Number of references:14 Main heading:Image analysis Controlled terms:Geometry - Information analysis - Scanning - Surface properties - Topology - Trees (mathematics) Uncontrolled terms:LOD - Normal mapping - Point and polygon hybrid rendering - Quadtrees - Silhouette fidelity Classification code:723.2 Data Processing and Image Processing - 741.3 Optical Devices and Systems - 903.1 Information Sources and Analysis - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 931.2 Physical Properties of Gases, Liquids and Solids Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 98> Accession number:2004298268942 Title:On approximation of Laplacian eigenproblem over a regular hexagon with zero boundary conditions Authors:Sun, Jia-Chang (0) Corr. author affiliation:Parallel Computing Div., Inst. of Software, Chinese Acad. of Sciences, Beijing 100080, China Source title:Journal of Computational Mathematics Abbreviated source title:J Comput Math Volume:22 Issue:2 Issue date:March 2004 Publication year:2004 Pages:275-286 Language:English ISSN:02549409 CODEN:JCMMEB Document type:Journal article (JA) Publisher:Inst. of Computational Mathematics and Sc./Eng. Computing, Beijing, China Abstract:In my earlier paper [4], an eigen-decompositions of the Laplacian operator is given on a unit regular hexagon with periodic boundary conditions. Since an exact decomposition with Dirichlet boundary conditions has not been explored in terms of any elementary form, in this paper, we investigate an approximate eigen-decomposition. The function space, corresponding all eigenfunction, has been decomposed into four orthogonal subspaces. Estimations of the first eight smallest eigenvalues and related orthogonal functions are given. In particularly we obtain an approximate value of the smallest eigenvalue &lambda; [similar to] 29&pi;/40 = 7.1555, and the absolute error is less than 0.0001. Number of references:6 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 99> Accession number:2004318296332 Title:Routing technology for LEO satellite network Authors:Sun, Li-Min (1); Lu, Ze-Xin (2); Wu, Zhi-Mei (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Sch. of Comp., Natl. Univ. of Defense Technol., Changsha 410073, China Corresponding author:Sun, L.-M. (sunlimin@ios.cn) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:27 Issue:5 Issue date:May 2004 Publication year:2004 Pages:659-667 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:LEO(low earth orbit) satellite network providing real time multimedia service is a important research direction of satellite communication. For LEO satellite movement and dynamic satellite network topology, routing is always one of key and important problems of LEO satellite network. This paper makes a survey of recent works on routing mechanism for LEO satellite network. First, the paper presents the topology characteristics of LEO satellite network. Then it classifies and describes the main routing protocols proposed in published literatures, and specially discusses the effect of handover on routing. Finally, research directions and open problems about routing of LEO satellite network are also discussed. Number of references:20 Main heading:Satellite communication systems Controlled terms:Multimedia systems - Network protocols - Routers - Telecommunication networks Uncontrolled terms:Dynamic network topology - Handover operation - Low earth orbits - Routing protocols - Satellite networks Classification code:655.2.1 Communication Satellites - 716 Telecommunication; Radar, Radio and Television - 722.3 Data Communication, Equipment and Techniques - 723 Computer Software, Data Handling and Applications Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 100> Accession number:2004408391318 Title:Analysis for reachability problem of Petri net Authors:Hu, Juan (1); Liu, Li-Hui (1); Fan, Zhi-Hua (1); Li, Lei (1); Wang, Chang-Qing (1); Zhou, Wei-Jie (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Hu, J. (juanhchina@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:7 Issue date:July 2004 Publication year:2004 Pages:949-955 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:The marking's reachability problem is one of the basis problems in Petri net analysis. As the conventional methods for solving it may not insure the exactitude of the outcome, the essential of the reachability problem is pointed out. Besides, the different connected areas are plotted out and the reachability of markings in the same connected areas of marking graph is discussed. Finally, an effective method for solving the marking's reachability problem is presented as the conclusion of the whole work, which can be used for ordinary nets. This method preserves the virtues of the conventional methods, takes the advantage of the Gro&die;bner basis algorithm, and can insure the exactitude of the outcome. Abstract type:(Edited Abstract) Number of references:5 Main heading:Petri nets Controlled terms:Algorithms - Mathematical models - Theorem proving Uncontrolled terms:Connected ares - Grobner basis - Marking graphs - Reachability Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.4 Artificial Intelligence - 723.5 Computer Applications - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 101> Accession number:2005038797890 Title:Progressive out-of-core compression based on reconstruction with marching cubes Authors:Liu, Ying (1); Cai, Kang-Ying (1); Wang, Wen-Cheng (1); Wu, En-Hua (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Dept. of Comp. and Info. Sci., Faculty of Sci. and Technol., Univ. of Macao, Macao, China Corresponding author:Liu, Y. (liuyingbj@) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:27 Issue:11 Issue date:November 2004 Publication year:2004 Pages:1457-1463 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:Out-of-Core models are the massive models that cannot be loaded into the memory as a whole. For improving the efficiency of storing, transmitting and rendering such models, it is very important to progressively compress the models. However, to our knowledge, all the existing out-of-core compression algorithms are single rate, which cannot perform progressive compression. With regard to this, this paper proposes a method that can progressively compress out-of-core models in high efficiency and transmit and render the models in multi-resolutions. At first, the method uniformly divides the bounding box of the out-of-core model into sub-boxes for the local model in every sub-box to be able to process in core, and manages the sub-boxes hierarchically in an octree. Afterwards, the local model in every sub-box is reconstructed with Marching Cubes and an adaptable sub-octree is constructed for the reconstructed local model. Finally, based on the sub-octrees, the nodes of the octree of the whole model can be traversed progressively from coarse to fine and compressed with an advanced compression method for handling in-core models. Experimental results show that the new method can compress the out-of-core models in similar compression ratios as the advanced method to compress the in-core models, it is also superior to the existing methods for compressing out-of-core models and is the first method for performing progressive compression on out-of-core models. Number of references:11 Main heading:Data compression Controlled terms:Algorithms - Data storage equipment - Encoding (symbols) - Image reconstruction - Three dimensional computer graphics Uncontrolled terms:Adaptive octrees - Arthmetic encoding - Marching cubes - Out of core models - Progressive compression Classification code:722.3 Data Communication, Equipment and Techniques - 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 102> Accession number:2004488687423 Title:Secure monitoring model based on the Clark-Wilson integrity policies Authors:Qing, Si-Han (1); Wen, Hong-Zi (1); Lei, Hao (2); Wang, Jian (2) Author affiliation:(1) Eng. and Res. Ctr., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Graduate Sch., Chinese Acad. of Sci., Beijing 100039, China; (3) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (4) Supercomputing Ctr., Comp. Network Info. Ctr., Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wen, H.-Z. (wenhongzi@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:8 Issue date:August 2004 Publication year:2004 Pages:1124-1132 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:The redundant data in log files and the delay for detecting abnormal trails are the inherent problems existing in the traditional secure monitoring subsystem of a computer system. It is identified that the system security policies determine the logging data items in a secure monitoring function. By formally describing and analyzing the famous Clark-Wilson integrity policies with the corresponding relation patterns, the minimal logging data items set involved in these security policies is precisely determined. A formal secure monitoring model based on Clark-Wilson integrity policies (CW-SMM) is proposed. The CW-SMM has the characteristics of both minimal logging data and auto-detecting of the system abnormal trails in time, and can thoroughly solve the problems mentioned above. Abstract type:(Edited Abstract) Number of references:14 Main heading:Security of data Controlled terms:Electronic document identification systems - Functions - Mathematical models - Monitoring Uncontrolled terms:Auditing operation - Clark Wilson integrity policy - Logging operation - Relation pattern - Secure monitoring Classification code:723.2 Data Processing and Image Processing - 723.5 Computer Applications - 911.2 Industrial Economics - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 103> Accession number:2005038797582 Title:Threshold access control scheme based on quantifying permission Authors:Lei, Hao (1); Feng, Deng-Guo (1); Zhou, Yong-Bin (1); Huang, Jian (3) Author affiliation:(1) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Graduate Sch., Chinese Acad. of Sci., Beijing 100039, China; (3) Comp. Lab., Oxford Univ., London, OX1 3QD, United Kingdom Corresponding author:Lei, H. (leihao00@iscas.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:11 Issue date:November 2004 Publication year:2004 Pages:1680-1688 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Secret protection is studied after introducing the quantifying permission idea in the view of access control. Meta-Permission is derived from the view of quality and quantity in philosophy. Compared with traditional cognition and permission used in access control, it comprehensively and deeply reflects the essence of permission. Combining with the threshold idea and RBAC, a threshold access control scheme based on quantifying permission is proposed. This scheme is applicable as widely as secret-sharing scheme, and shares the same function in protecting secret. Furthermore, it has some distinct advantages such as no relation in knowledge between the secret pieces hold by participants and the protective secret target, the ability for expressing the difference among participants' trustworthiness, and the low complexity in computing. Number of references:15 Main heading:Threshold logic Controlled terms:Administrative data processing - Metadata Uncontrolled terms:Certificate authority - Certificate identity - Identity authentication - Meta permission - Quantifying permission - Role - Threshold scheme 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 104> Accession number:2004538759960 Title:Discovering frequent tree patterns from XML queries Authors:Chen, Yi (1); Wang, Yu-Guo (1); Yang, Liang-Huai (2) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Dept. of Comp. Sci., Peking Univ., Beijing 100871, China Corresponding author:Chen, Y. (chenyi72@) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:SUPPL. Issue date:October 2004 Publication year:2004 Pages:114-123 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:With XML being the standard for data encoding and exchange over Internet, how to manage XML data efficiently becomes a critical issue. An effective approach to improve the performance of XML management systems is to discover frequent XML query patterns and cache their results. Since each XML query can be modeled as a tree structure, the problem of discovering frequent query patterns can be reduced to frequent structure mining. However, mining frequent query patterns is much more complex than simple structure mining since we have to consider the semantics of query patterns. In this paper, we present an approach to discover frequent XML query patterns efficiently. Compared with previous works, our approach is strictly based on the semantics of XML queries, its mining results are more precise, and can be more effectively utilized by caching system. Number of references:12 Main heading:Data mining Controlled terms:Algorithms - Optimization - Semantics - Trees (mathematics) Uncontrolled terms:Frequent pattern - Pattern tree - Query caching - XML query Classification code:723.2 Data Processing and Image Processing - 903.2 Information Dissemination - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 105> <RECORD 1> Accession number:2005068824739 Title:Generalized semi-infinite optimization and its application in robotics' path planning problem Authors:Liu, Han (1); Yang, Xiaolin (1); Zhang, Ji (1); Wang, Yongji (2) Author affiliation:(1) Department of Computer Science, University of Toronto, Toronto, Ont. M5S 3G4, Canada; (2) Institute of Software, Chinese Academy of Sciences, Beijing, 100080, China Corresponding author:Liu, H. (hanliu@cs.toronto.edu) Source title:Proceedings of the International Conference on Artificial Intelligence, IC-AI'04 Abbreviated source title:Proc. Int. Conf. Artif. Intell. IC AI Volume:2 Monograph title:Proceedings of the International Conference on Artificial Intelligence, IC-AI'04 and Proceedings of the International Conference on Machine Learning; Models, Technologies and Applications, MLMTA'04) Issue date:2004 Publication year:2004 Pages:1147-1153 Language:English ISBN-10:1932415335 ISBN-13:9781932415339 Document type:Conference article (CA) Conference name:Proceedings of the International Conference on Artificial Intelligence, IC-AI'04 Conference date:June 21, 2004 - June 24, 2004 Conference location:Las Vegas, NV, United states Conference code:64231 Sponsor:Computer Sci. Research, Education, and Applications Press (CSREA); International Technology Institute (ITI); Korean Society for Internet Information (KSII); World Academy of Science for Information Technology (WAS) Publisher:CSREA Press Abstract:This paper presents a new real-time robot path planning approach which, to our best knowledge, is the first one in the robotic community. Motivated by the practical requirements of obstacle representation. A generalized semi-infinite optimization problem (GSOP) with not only intersection but also union operations was proposed and a mathematical solution to it was developed. This paper inherits the fundamental ideas of inequality and optimization techniques from the previous work and converts the real-time obstacle avoidance problem into a semi-infinite constrained optimization problem with the help of a delicate mathematical transformation. This leads to an efficient method for the real-time obstacle avoidance. Simulation results in 3D space have been presented to show its merits. Number of references:15 Main heading:Motion planning Controlled terms:Approximation theory - Collision avoidance - Computer graphics - Computer simulation - Constraint theory - Iterative methods - Nonlinear programming - Optimization - Problem solving - Real time systems - Robot applications - Robotics Uncontrolled terms:Constrained optimization and constructive solid geometry (COCSG) - Constructive solid geometry (CSG) - Generalized semi-infinite optimization problem (GSOP) - Semi-infinite constrained optimization Classification code:921.5 Optimization Techniques - 921 Mathematics - 914.1 Accidents and Accident Prevention - 731.6 Robot Applications - 921.6 Numerical Methods - 731.5 Robotics - 723.4 Artificial Intelligence - 722.4 Digital Computers and Systems - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.5 Computer Applications Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 106> Accession number:2004458451082 Title:An approach to enforcing Clark-Wilson model in role-based access control model Authors:Liang, Bin (1); Shi, Wenchang (1); Sun, Yufang (1); Sun, Bo (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Department of Computer Science, Yunnan University, Kunming 650091, China Corresponding author:Liang, B. Source title:Chinese Journal of Electronics Abbreviated source title:Chin J Electron Volume:13 Issue:4 Issue date:October 2004 Publication year:2004 Pages:596-599 Language:English ISSN:10224653 CODEN:CHJEEW Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Using one security model to enforce another is a prospective solution to multi-policy support. In this paper, an approach to the enforcing Clark-Wilson data integrity model in the Role-based access control (RBAC) model is proposed. An enforcement construction with great feasibility is presented. In this construction, a direct way to enforce the Clark-Wilson model is provided, the corresponding relations among users, transformation procedures, and constrained data items are strengthened; the concepts of task and subtask are introduced to enhance the support to least-privilege. The proposed approach widens the applicability of RBAC. The theoretical foundation for adopting Clark-Wilson model in a RBAC system with small cost is offered to meet the requirements of multi-policy support and policy flexibility. Number of references:7 Main heading:Security of data Controlled terms:Computer simulation - Constraint theory - Data reduction - Hierarchical systems - Problem solving - Security systems Uncontrolled terms:Clark-Wilson (CW) model - CW triples - Role-based access control - Subtasks Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.2 Data Processing and Image Processing - 723.4 Artificial Intelligence - 723.5 Computer Applications - 731.1 Control Systems - 914.1 Accidents and Accident Prevention Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 107> Accession number:2004538751736 Title:Edge selection on gradients based on dome extraction Authors:Wang, Tike (1); Dou, Wanchun (1); Zhang, Xiwen (2); Cai, Shijie (1) Author affiliation:(1) Natl. Lab. Novel Software Technol., Nanjing University, Nanjing, 210093, China; (2) Institute of Software, Chinese Academy of Sciences, Beijing 100080 Corresponding author:Wang, T. (yikes_wang@.cn) Source title:2004 7th International Conference on Signal Processing Proceedings, ICSP Abbreviated source title:Int. Conf. Sign. Process. Proc. ICSP Monograph title:2004 7th International Conference on Signal Processing Proceedings, ICSP Issue date:2004 Publication year:2004 Pages:1012-1015 Language:English ISBN-10:0780384075 ISBN-13:9780780384071 Document type:Conference article (CA) Conference name:2004 7th International Conference on Signal Processing Proceedings, ICSP Conference date:August 31, 2004 - September 4, 2004 Conference location:Beijing, China Conference code:64055 Sponsor:Chinese Institute of Electronics (CIE); IEEE Signal Processing Society (IEEE-SPS); Institute of Electrical Engineers (IEE); Union Radio Scientifique Internationale (URSI); IEEE Beijing Section Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:The phenomenon of multiple responses to a single edge often occurs in detecting noisy ramp edges. This paper investigates three properties of dome extracted by grayscale reconstruction and then presents a novel approach to select edges from gradients suppressing the multiplicity of response. The approach extracts domes in gradients, and then threshold them to get edges. Its computation time and memory requirements are not more than the non-maxima suppression algorithm obviously. Experiment results show that our approach suppresses the multiplicity of response effectively. Number of references:5 Main heading:Edge detection Controlled terms:Algorithms - Feature extraction - Image reconstruction - Noise abatement - Optimization - White noise Uncontrolled terms:Dome extraction - Grayscale reconstruction - Multiple responses - Noisy ramp edges - Non-maxima suppression Classification code:711 Electromagnetic Waves - 716 Telecommunication; Radar, Radio and Television - 723.2 Data Processing and Image Processing - 751.4 Acoustic Noise - 921.5 Optimization Techniques Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 108> Accession number:2004488687422 Title:Improved least-slack-first scheduling algorithm 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:15 Issue:8 Issue date:August 2004 Publication year:2004 Pages:1116-1123 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:The LSF (least slack first) algorithm assigns a priority to a task according to its executing urgency. The smaller the remaining slack time of a task is, the sooner it needs to be executed. However, LSF may frequently cause switching or serious thrashing among tasks, which augments the overhead of a system and restricts its application. Assigning a preemption threshold in the scheduling policy can decrease the switching among tasks, however, the existing assigning methods are limited to the fixed priority such that they are not applied to the LSF algorithm. In order to relieve the thrashing caused by LSF, some applicable assigning schemes are presented to the LSF algorithm based on the preemption threshold. Every task is dynamically assigned a preemption threshold that is dynamically changing with the executing urgency of the task and is not limited by the number of tasks. Simulations show that, by using the improved LSF policy, the switching among tasks decreases greatly while the missed deadline percentage decreases. The proposed algorithm is useful for designing and implementing a real-time operating system. Number of references:9 Main heading:Computer operating systems Controlled terms:Algorithms - Computer simulation - Multitasking - Real time systems - Scheduling - Threshold logic Uncontrolled terms:Least slack first - Missed deadline percentage - Preemption threshold - Real time operating systems - Thrashing Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 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 Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 109> Accession number:2005159040810 Title:A typical noisy covert channel in the IP protocol Authors:Qu, Haipeng (1); Su, Purui (1); Feng, Dengguo (1) Author affiliation:(1) State Key Lab of Info. Security, Institute of Software, CAS, P.O. Box 8718, Beijing, 100080, China Corresponding author:Qu, H. Source title:Proceedings - International Carnahan Conference on Security Technology Abbreviated source title:Proc. Int. Carnahan Conf. Secur. Technol. Monograph title:Proceedings - IEEE 38th Annual 2004 International Carnahan Conference on Security Technology Issue date:2004 Publication year:2004 Pages:189-192 Language:English ISSN:10716572 Document type:Conference article (CA) Conference name:Proceedings - IEEE 38th Annual 2004 International Carnahan Conference on Security Technology Conference date:October 11, 2004 - October 14, 2004 Conference location:Albuquerque, NM, United states Conference code:64505 Sponsor:IEEE Lexington Section, USA; IEEE Aerospace and Electronic Systems Society, USA; Chung Shan Institute of Science, Taiwan, ROC; National Central University, Taiwan, ROC Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Previous studies have exploited a number of noiseless covert channels in the IPv4 protocol by using some fields in the IP header including the Identification, the Header Checksum and the Padding fields. These channels can transmit covert information correctly between two Internet nodes, but will be eliminated after the adoption of the IPv6 protocol. To construct a covert channel which can survive in the IPv6 protocol, a noisy covert channel is designed by using the TTL field in the IPv4 header. The channel can be exploited in the IPv6 protocol because the TTL field will be substituted by the Hop Limit field with a similar function. Two methods are presented including one-bit-per-packet method and TTL partition method. The maximal attainable bandwidth of the channel is discussed and a formula is given to calculate the maximal attainable bandwidth. The maximal attainable bandwidth is inversely proportional to the expectation and variance of the distribution of the average hop number between two communication nodes. The correlation between the maximal attainable bandwidth and the selection of the code error rate is also analyzed. Some statistics data from real networks are collected to estimate the bandwidth of the channel in practice. The result shows that the covert channel is effective in most situations. &copy;2004 IEEE. Number of references:15 Main heading:Network protocols Controlled terms:Bandwidth - Data communication systems - Data transfer - Information dissemination - Security of data - Statistical methods - Theorem proving Uncontrolled terms:Communication security - Covert channels - Noisy channels - TCP/IP protocol 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.2 Data Processing and Image Processing - 903.2 Information Dissemination - 922.2 Mathematical Statistics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 110> Accession number:2005229125701 Title:Mobility pattern based adaptive mobile multicast algorithm Authors:Zheng, Jianping (1); Huang, Kui (1); Wu, Yichuan (1); Wu, Zhimei (1) Author affiliation:(1) Institute of Software, Chinese Academy of Science, Beijing, China; (2) Graduate School, Chinese Academy of Science, Beijing, China Corresponding author:Zheng, J. (jianping@ios.cn) Source title:2004 Joint Conference of the 10th Asia-Pacific Conference on Communications and the 5th International Symposium on Multi-Dimensional Mobile Communications Proceedings, APCC/MDMC'04 Abbreviated source title:Joint Conf. Asia Pac. Conf. Commun. Int. Symp. Multi Dimensional Mobile Commun. Proc. APCC MDMC Volume:2 Monograph title:2004 Joint Conference of the 10th Asia-Pacific Conference on Communications and the 5th International Symposium on Multi-Dimensional Mobile Communications Proceedings, APCC/MDMC'04 Issue date:2004 Publication year:2004 Pages:888-892 Article number:WM12-1 Language:English ISBN-10:0780386019 ISBN-13:9780780386013 Document type:Conference article (CA) Conference name:2004 Joint Conference of the 10th Asia-Pacific Conference on Communications and the 5th International Symposium on Multi-Dimensional Mobile Communications Proceedings, APCC/MDMC'04 Conference date:August 29, 2004 - September 1, 2004 Conference location:Beijing, China Conference code:64730 Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Mobile IP proposes two approaches to support mobile multicast, which are bi-directional tunneling and remote subscription. The former hides host mobility from all other members of the group so that the multicast tree can remain unchanged, but it introduces the triangle routing problem; the latter provides the shortest routes for the delivery of multicast datagram but at the cost of tree reconstruction. After analyzing the user mobility pattern, an adaptive mobile multicast algorithm based on the mobility patter is proposed. The mobile host adaptively chooses bi-direction tunneling or remote subscription to perform the multicast handoff according to its mobility pattern. When the movement is low, the proposed algorithm optimizes the multicast data transmission with little cost of tree reconstruction, and while the movement is high, it avoids the frequent multicast handoff so as to reduce the tree reconstruction cost. &copy; 2004 IEEE. Number of references:9 Main heading:Multicasting Controlled terms:Algorithms - Computer simulation - Data communication systems - Internet - Mobile telecommunication systems - Routers - Trees (mathematics) Uncontrolled terms:Mobile multicast trees - Mobility patterns - Multicast tree - Routing Classification code:716 Telecommunication; Radar, Radio and Television - 717 Optical Communication - 723 Computer Software, Data Handling and Applications - 723.5 Computer Applications - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 111> Accession number:2005118995954 Title:GSPN-based performance analysis of LEO satellite networks Authors:Hong, Zhiguo (1); Fan, Zhihua (1); Li, Lei (1); Xu, Fanjiang (1); Hu, Gang (1); Wu, Fengge (2) Author affiliation:(1) Gen. Software Lab., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Lab. of Intelligent Technol., Dept. of Comp. Sci. and Technol., Tsinghua Univ., Beijing 100084, China Corresponding author:Hong, Z. (hongzhiguo1977@.cn) Source title:Journal of Information and Computational Science Abbreviated source title:J. Inf. Comput. Sci. Volume:1 Issue:1 Issue date:September 2004 Publication year:2004 Pages:47-51 Language:English ISSN:15487741 Document type:Journal article (JA) Publisher:Sun Yat-sen (Zhongshan) University Abstract:In this paper, a Generalized Stochastic Petri Net (GSPN) model is constructed to analyze the performance of LEO satellite networks in the case of packet loss. Furthermore, the impact of delay and packet loss on the performance of LEO satellite networks is also analyzed with SPNP6.0 software package. Numerical results show that packet loss probability decreases, and the time delay becomes bigger as buffer size of LEO satellite networks increases. Number of references:8 Main heading:Petri nets Controlled terms:Functional assessment - Numerical analysis - Packet networks - Queueing theory - Satellites - Stochastic control systems Uncontrolled terms:Generalized stochastic petri net (GSPN) model - LEO satellite networks - Performance analysis - Performance evaluation - SPNP - SPNP6 software package - Time delay Classification code:461.5 Rehabilitation Engineering and Assistive Technology - 655.2 Satellites - 718 Telephone Systems and Related Technologies; Line Communications - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 921.6 Numerical Methods - 922.1 Probability Theory Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 112> Accession number:2005149022124 Title:A workflow model based on temporal logic Authors:Ma, Huadong (1) Author affiliation:(1) Sch. of Comp. Science and Technology, Beijing Univ. of P. and Telecom., Beijing 100876, China; (2) Lab for Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Ma, H. (mhd@bupt.edu.cn) Source title:CSCWD 2004 - 8th International Conference on Computer Supported Cooperative Work in Design - Proceedings Abbreviated source title:CSCWD Int. Conf. Comput. Supported Coop. Work Des. Proc. Volume:2 Monograph title:CSCWD 2004 - 8th International Conference on Computer Supported Cooperative Work in Design - Proceedings Issue date:2004 Publication year:2004 Pages:327-332 Language:English ISBN-10:0780379411 ISBN-13:9780780379411 Document type:Conference article (CA) Conference name:CSCWD 2004 - 8th International Conference on Computer Supported Cooperative Work in Design - Proceedings Conference date:May 26, 2004 - May 28, 2004 Conference location:Xiamen, China Conference code:64434 Sponsor:Xiamen University, Xiamen, China; Xiamen Computer Federation; IEEE; IEEE Beijing Section; Chine Computer Federation Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:This paper proposes a workflow model based on temporal logic, called TLWS model. This formal model supports the formal specifications for a workflow system, such as the abstraction of activities, the synchronization among activities, and the step-wise refinement design procedure of a workflow. The most important advantage of this model is that it can specify the workflow process and its evolution, which are difficult to be supported by the previous models. Using this model, we have designed a workflow editing tool and are developing an interactive workflow design environment. &copy;2003 IEEE. Number of references:14 Main heading:Formal logic Controlled terms:Computer programming languages - Data acquisition - Flowcharting - Hypermedia systems - Mathematical models - Mathematical operators - Problem solving - Process control - Program compilers - Search engines - Trees (mathematics) Uncontrolled terms:Hypermedia models - Temporal logic - Workflow editing system - Workflow models Classification code:921 Mathematics - 731 Automatic Control Principles and Applications - 723.2 Data Processing and Image Processing - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 723.1.1 Computer Programming Languages - 723 Computer Software, Data Handling and Applications - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1 Computer Programming Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 113> Accession number:2004448436918 Title:TRDM - Temporal role-based delegation model Authors:Sun, Bo (0); Zhao, Qing-Song (0); Sun, Yu-Fang (0) Corr. author affiliation:Inst. of Soft-ware, Chinese Acad. of Sci., Beijing 100080, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:41 Issue:7 Issue date:July 2004 Publication year:2004 Pages:1104-1109 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Science Press, Beijing, China Abstract:It is the system manager with authorization role who handles assignments of users to roles in role-based systems. However, the central management, which fully depends on the manager, is not suitable for distributed environments. Role-based delegation model (RDM) is more suitable for distributed environments. But current role-based delegation models don't support temporal delegation and delegation width. A temporal role-based delegation model called TRDM is presented, which is an extension of RDM2000 by supporting temporal delegation and delegation width. New mechanisms of role delegation and role revocation are explored, which is based on TRDM. Number of references:17 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 114> Accession number:2004338311906 Title:An efficient certificate status validation method for mobile communication Authors:Zhou, Yongbin (1); Qing, Sihan (1); Zhang, Zhenfeng (2); Ji, Qingguang (1) Author affiliation:(1) Eng. Res. Ctr. Info. Secty. Technol., Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) State Key Lab. of Info. Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Zhou, Y. (zhouyongbin@) Source title:Chinese Journal of Electronics Abbreviated source title:Chin J Electron Volume:13 Issue:3 Issue date:July 2004 Publication year:2004 Pages:378-382 Language:English ISSN:10224653 CODEN:CHJEEW Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:The huge success of mobile telephone and such other wireless digital devices have transformed business and the Internet. In order to protect the security of mobile commerce transaction, WAP forum specified the WAP security protocol and defined WPKI architecture. Certificate status checking is one of the challenging issues of PKI in wired settings, and it is more challenging in the wireless world (that is WPKI here) due to the limitations of mobile devices. In this paper, several mechanisms for certificate status validation are summarized and compared, and a new efficient certificate status validation method for WPKI is presented based on commutative hashing and a variation of dynamic Merkle hash tree. The newly proposed scheme has the advantages of being efficient and secure. The computation of the tree is independent of the nodes' relative location in the hash tree, thus simplifying the computation and verification process. The proposed scheme is compatible with both X.509 certificate and WTLS certificate. Number of references:12 Main heading:Mobile telecommunication systems Controlled terms:Algorithms - Costs - Cryptography - Electronic commerce - Information analysis - Internet telephony - Mobile computing - Network protocols - Public key cryptography - Voice/data communication systems - Wireless telecommunication systems Uncontrolled terms:Certificate status validation - Commutative hash - Digital services - Merkle hash tree - Wireless public key infrastructure (WPKI) Classification code:911 Cost and Value Engineering; Industrial Economics - 903.1 Information Sources and Analysis - 723.5 Computer Applications - 921 Mathematics - 723 Computer Software, Data Handling and Applications - 718 Telephone Systems and Related Technologies; Line Communications - 716.4 Television Systems and Equipment - 718.1 Telephone Systems and Equipment Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 115> Accession number:2004027811098 Title:HyO-XTM: A set of hyper-graph operations on XML Topic Map toward knowledge management Authors:Dong, Ying (1); Li, Mingshu (1) Author affiliation:(1) Lab. for Internet Software Technol., Institute of Software, Chinese Academy of Sciences, Beijing 10080, China Corresponding author:Dong, Y. (ying@intec.iscas.ac.cn) Source title:Future Generation Computer Systems Abbreviated source title:Future Gener Comput Syst Volume:20 Issue:1 Issue date:January 15, 2004 Publication year:2004 Pages:81-100 Language:English ISSN:0167739X CODEN:FGCSEV Document type:Journal article (JA) Publisher:Elsevier Abstract:Knowledge management is a critical issue for the next-generation web application, because the next-generation web is becoming a semantic web, a knowledge-intensive network. XML Topic Map (XTM), a new standard, is appearing in this field as one of the structures for the semantic web. It organizes information in a way that can be optimized for navigation. In this paper, a new set of hyper-graph operations on XTM (HyO-XTM) is proposed to manage the distributed knowledge resources. HyO-XTM is based on the XTM hyper-graph model. It is well applied upon XTM to simplify the workload of knowledge management. The application of the XTM hyper-graph operations is demonstrated by the knowledge management system of a consulting firm. HyO-XTM shows the potential to lead the knowledge management to the next-generation web. &copy; 2003 Elsevier B.V. All rights reserved. Number of references:34 Main heading:Knowledge based systems Controlled terms:Distributed computer systems - Graph theory - Knowledge representation - Semantics - Web browsers - World Wide Web - XML Uncontrolled terms:Active document framework (ADF) - Hyper graphs - Knowledge management (KM) - Topic maps Classification code:716 Telecommunication; Radar, Radio and Television - 722.4 Digital Computers and Systems - 723.4.1 Expert Systems - 903.2 Information Dissemination - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Theoretical (THR) DOI:10.1016/S0167-739X(03)00166-3 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 116> Accession number:2004338311907 Title:On the parallel computation of characteristic set Authors:Wu, Yongwei (1); Yang, Guangwen (1); Lin, Dongdai (2); Huang, Qifeng (1); Zheng, Weimin (1) Author affiliation:(1) Dept. of Comp. Sci. and Technology, Tsinghua University, Beijing 100084, China; (2) Stt. Key Lab. of Info. Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Wu, Y. (wuyw@tsinghua.edu.cn) Source title:Chinese Journal of Electronics Abbreviated source title:Chin J Electron Volume:13 Issue:3 Issue date:July 2004 Publication year:2004 Pages:383-388 Language:English ISSN:10224653 CODEN:CHJEEW Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:As one of the efficient approaches for computing various zero decompositions of any set of multivariable polynomials, Characteristic set (CS) computation is very compute intensive. In this paper, our purpose is to build an effective parallel computation model for CS. We first present the parallel algorithm for CS computation. Then the term of Polynomial complexity grade (PCG) is defined, and our load balance strategy is put forward based on it as well. On the analysis of two basic transmission methods, we construct one efficient hybrid method for the data communication of parallel CS computation. At last, experiments and timing data have demonstrated the stability and high performance of our parallel computation model for CS method. Number of references:15 Main heading:Computer networks Controlled terms:Algorithms - Analog to digital conversion - Computational geometry - Computer aided design - Computer vision - Data communication systems - Hybrid computers - Local area networks - Multivariable control systems - Robotics - Set theory Uncontrolled terms:Characteristic set - Data communication - Load balance - Parallel computation Classification code:921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 741.2 Vision - 731.5 Robotics - 731.1 Control Systems - 723.5 Computer Applications - 723 Computer Software, Data Handling and Applications - 722.5 Analog and Hybrid Computers - 722.4 Digital Computers and Systems - 718 Telephone Systems and Related Technologies; Line Communications Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 117> Accession number:2004288261800 Title:WebFrame: An extensible multi-layer web application server Authors:Fan, Guo-Chuang (1); Lin, Shi-Biao (1); Dong, Wei-Chuan (1); Hu, Jian-Hua (1); Feng, Yu-Lin (1) Author affiliation:(1) Technol. Ctr. of Software Eng., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Fan, G.-C. (fanguo@otcaix.iscas.ac.cn) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:27 Issue:4 Issue date:April 2004 Publication year:2004 Pages:451-460 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:Web application servers (WASs) are middleware platforms for deployment and execution of component-based web applications. To cater for an increasingly diverse range of QoS demands, WAS must be capable of adaptation during execution to modify itself and to respond to changing conditions in its external environment. To accommodate such changes, WAS should provide both deployment-time configurability and run-time reconfigurability. Unfortunately, most of the mainstream web application servers adopt a monolithic architecture and black box philosophy to their design, and fail to properly address such requirements. In our point of view, reconfigurability of WASs should be available at any time of the whole lifecycle. In this paper, an extensible multi-layer model that supports multi-phase extension using computational reflection, microkernel, and component techniques is proposed for web application servers. The model is structured into four layers. Both deployment-time configuration and run-time reconfiguration at multiple layers is supported in this model. The model is applied in the design and implementation of a WAS, referred to as WebFrame. The comparative evaluation of the performance impact of reflection and multi-phase extension on systems are given. The experiments show that WebFrame takes on good performance. Number of references:26 Main heading:Middleware Controlled terms:Computer architecture - Computer software selection and evaluation - Distributed computer systems - Open systems - Quality of service - Servers Uncontrolled terms:Extensible multilayer model - Microkernel - Reconfigurability - Web application server Classification code:722.4 Digital Computers and Systems - 723.1 Computer Programming Treatment:Applications (APP); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 118> Accession number:2004538759972 Title:Rectifying the skeleton of 3D models Authors:Zhu, Hong-Bin (1); Wang, Wen-Cheng (1); Wu, En-Hua (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Dept. of Comp. and Info. Sci., Faculty of Sci. and Technol., Univ. of Macao, Macao, China; (3) Graduate Sch., Chinese Acad. of Sci., Beijing 100039, China Corresponding author:Zhu, H.-B. (zhuhb@ios.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:SUPPL. Issue date:October 2004 Publication year:2004 Pages:206-214 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:In extracting the skeleton from the 3D complex model, the existing methods may produce errors that some branches are away from the center positions and some branches are redundant. As for this, a rectification method is proposed in this paper to correct these errors. After a coarse skeleton is extracted based on the distance field of the 3D model, the method investigates every joint to see whether it is away from its local center position, The investigation work by omitting radial rays evenly with the joint as the starting point to intersect the model's surfaces and studying the length distribution of the segments from the joint to the intersection points along the rays. For the joints away from the center positions, they are moved to the center and their related branches are also modified. Thus, the skeleton can be rectified automatically. Experimental results show the new method can efficiently rectify the skeleton and run fast, and generally the time for rectification takes up less than 2% of the time for extracting the skeleton. Number of references:17 Main heading:Three dimensional computer graphics Controlled terms:Computer software - Models Uncontrolled terms:Radial rays - Rectify - Skeleton - Three dimensional model Classification code:723 Computer Software, Data Handling and Applications Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 119> Accession number:2005068833107 Title:Mobile communications in China Authors:Dong, Ying (1); Li, Mingshu (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Dong, Y. (ying@intec.iscas.ac.cn) Source title:International Journal of Mobile Communications Abbreviated source title:Int. J. Mobile Commun. Volume:2 Issue:4 Issue date:2004 Publication year:2004 Pages:395-404 Language:English ISSN:1470949X Document type:Journal article (JA) Publisher:Inderscience Enterprises Ltd. Abstract:China now has the world's largest mobile communications market. In the past several years, a series of major reforms have been carried out in China's telecom industry, aiming at separating administrative and enterprise functions, breaking monopoly and promoting effective competition. Upon WTO accession, China has committed to a phased timetable of mobile market opening. China has announced plans to have four full-range telecom operators. Moreover, there is a big opportunity for 3G mobile services in China. In the next five or ten years, China is expected become a major player in the development and innovation of mobile communication. We believe that with the entry to the WTO, the reformed and reorganised mobile market of China will have a very bright and promising future. Number of references:7 Main heading:Mobile telecommunication systems Controlled terms:Cellular telephone systems - Marketing - Product development - Public policy - Statistical methods - Telecommunication industry Uncontrolled terms:3G mobile services - Mobile markets - TD-SCDMA - WTO Classification code:716 Telecommunication; Radar, Radio and Television - 716.3 Radio Systems and Equipment - 901 Engineering Profession - 911.4 Marketing - 913.1 Production Engineering - 922.2 Mathematical Statistics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 120> Accession number:2004478467328 Title:A quantum authenticated encryption scheme Authors:L&#252;, Xin (1); Ma, Zhi (1); Feng, Deng-Guo (1) Author affiliation:(1) State Key Lab. of Info. Security, Graduate School, Chinese Academy of Sciences, 100039, Beijing, China; (2) State Key Lab. of Info. Security, Institute of Software, Chinese Academy of Sciences, 100039, Beijing, China Corresponding author:L&#252;, X. (lx@is.ac.cn) Source title:International Conference on Signal Processing Proceedings, ICSP Abbreviated source title:Int Conf Signal Process Proc Volume:3 Monograph title:2004 7th International Conference on Signal Processing Proceedings (ICSP'04) Issue date:2004 Publication year:2004 Pages:2306-2309 Language:English Document type:Conference article (CA) Conference name:2004 7th International Conference on Signal Processing Proceedings (ICSP'04) Conference date:August 31, 2004 - September 4, 2004 Conference location:Beijing, China Conference code:63798 Sponsor:Chinese Institute of Electronics (CIE); IEEE Signal Processing Society (IEEE-SPS); Institute of Electrical Engineers (IEE); Union Radio Scientifique Internationale (URSI); IEEE Beijing Section Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Privacy and authenticity are two main tasks for secure communication. In this paper, a quantum authenticated encryption scheme is proposed. This scheme is devised to encrypt and authenticate classical information using quantum states. We assume that Alice and Bob share a classical bits string &mu; as their private key. Alice generates quantum cipher text and authentication tag using her secret key. Bob can decrypt and verify the authenticity of the received message. Security analysis shows that the proposed protocol is a computationally secure encryption and statistically secure authentication scheme. Number of references:11 Main heading:Quantum cryptography Controlled terms:Computational methods - Data privacy - Data processing - Digital signal processing - Functions - Matrix algebra - Probability distributions - Security of data Uncontrolled terms:Authentication - Authentication protocols - Quantum information processing - Quantum key distribution (QKD) 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 - 921 Mathematics - 921.1 Algebra - 922.1 Probability Theory Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 121> Accession number:2005219121877 Title:POP beyond SODA, reaching the new horizon of service cooperation Authors:Liu, Shaohua (1); Ye, Dan (1); Wei, Jun (1); Xu, Gang (1); Xia, Yonglin (1); Liu, Yu (1) Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Liu, S. (ham_liu@otcaix.iscas.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 of the 28th Annual International Computer Software and Applications Conference, COMPSAC 2004 Issue date:2004 Publication year:2004 Pages:280-285 Language:English ISSN:07303157 CODEN:PSICD2 Document type:Conference article (CA) Conference name:Proceedings of the 28th Annual International Computer Software and Applications Conference, COMPSAC 2004 Conference date:September 28, 2004 - September 30, 2004 Conference location:Hong Kong, China, Hong kong Conference code:64717 Publisher:Institute of Electrical and Electronics Engineers Computer Society Abstract:As we have been gaining more experiences in services provision, online services are becoming increasingly complex. They have moved from simple service provision and invocation to very sophisticated service interaction and cooperation. As presented in this paper, service cooperation will be a promising computation model to achieve overall goals beyond individual capabilities. Based on the supreme wide spread of Service-oriented Development (SODA), the Process-oriented Platform (POP), with favourable flexibility derived from late binding, will be the optimum approach to this end. The PI production developed by us is such a system implementation, which architecture, components, and functionalities are also introduced in detail. We believe that the service cooperation paradigm is a hopeful solution to future service evolution, and the PI system will be an instructive explorer to reach this new horizon. &copy; 2004 IEEE. Number of references:29 Main heading:Software engineering Controlled terms:Computational methods - Computer architecture - Information technology - Interfaces (computer) - Internet - Mathematical models - Online systems Uncontrolled terms:PI systems - Process-oriented platform (POP) - Service-oriented development (SODA) - WSDL interfaces Classification code:903 Information Science - 723.5 Computer Applications - 723.1 Computer Programming - 921 Mathematics - 722.4 Digital Computers and Systems - 722 Computer Systems and Equipment - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722.2 Computer Peripheral Equipment Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 122> Accession number:2005038797574 Title:Embedded real-rime software oriented requirements specification language and checking methods Authors:Shu, Feng-Di (1); Wu, Guo-Qing (2); Li, Ming-Shu (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Dept. of Comp. Sci., Comp. Sch., Wuhan Univ., Wuhan 430072, China Corresponding author:Shu, F.-D. (fdshu@itechs.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:11 Issue date:November 2004 Publication year:2004 Pages:1595-1606 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Aiming at the requirements specification and related checking of embedded real-time software, a visual modeling language, RTRSM<sup>*</sup> (real-time requirements specification model<sup>*</sup>), which is compositional and based on hierarchical and concurrent finite state machine, is proposed. It uses state transitions with duration and scheduled events to describe timing constraints, and can support the description of interactivity and timing constraints effectively. Additionally, RITL (real-time interval temporal logic), a kind of prepositional temporal logic, is presented to make up for RTRSM<sup>*</sup>'s defect description of global system properties, which is the drawback of operational specification languages. Interpreted over timed state sequences, RITL is able to deal with the description of both point-based and interval-based metric temporal properties, and supports the property description of RTRSM<sup>*</sup> models naturally and comprehensively. The verification and validation of the resulted requirements specification, especially issues with respect to the reachability graph of RTRSM<sup>*</sup> models with finite system states and the simulation execution of the specification, are also explored. Number of references:27 Main heading:Embedded systems Controlled terms:Computer simulation - Graph theory - Problem oriented languages Uncontrolled terms:Embedded real time software - Reachability graph - Requirements specification checking - Requirements specification language Classification code:723 Computer Software, Data Handling and Applications - 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 123> Accession number:2004338313326 Title:Cryptanalysis of a variant of a cellular automata based cryptosystem Authors:Zhang, Wen-Tao (1); Qing, Si-Han (2); Wu, Wen-Ling (2) 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; (3) Ctr. of Info. Security Technol., Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhang, W.-T. (wentaozhangl@.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:5 Issue date:May 2004 Publication year:2004 Pages:767-771 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Subhayan Sen et al. proposed a block cipher system CAC (cellular automata based cryptosystem) based on cellular automata theory, but they have not given a detailed description of some of its modules. From the point of view of application, one module of CAC is fixed, and the variant is called SMCAC (same major -CA CAC). The analysis of SMCAC is given, and the results show that the variant of this cipher is very insecure under chosen-plaintext attacks. Using cryptanalysis of the variant for reference, attacks on the cipher itself may be found when some of the design details of the cipher are known. Abstract type:(Edited Abstract) Number of references:5 Main heading:Cryptography Controlled terms:Automata theory - Calculations - Numerical analysis - Security of data Uncontrolled terms:Block cipher systems - Cellular automata - Chosen plaintext attack - Security analysis 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 - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 124> Accession number:2004538759969 Title:Bar texture mapping Authors:Li, Kui-Yu (1); Wang, Wen-Cheng (1); Wu, En-Hua (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Graduate Sch., Chinese Acad. of Sci., Beijing 100039, China; (3) Dept. of Comp. and Info. Sci., Faculty of Sci. and Technol., Univ. of Macao, Macao, China Corresponding author:Li, K.-Y. (lky@ios.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:SUPPL. Issue date:October 2004 Publication year:2004 Pages:179-189 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:An image-based rendering method that can successfully support the representation of 3-D surface details and view motion parallax is presented. Expensive task of hole-filling is finished beforehand in the preprocessing stage, only texture-mapping hardware is employed in the rendering stage for acceleration. For correct representation, each pixel in a parallel projection image with depth is decomposed into several consecutive layers so that a bar texture is generated for that pixel. Since all the bar textures as a whole constitute a continuous 3-D approximation to the scene represented in the original depth image, novel views can be obtained by mapping these bar textures in a from-back-to-front order. Experimental results show the new approach can produce high visual quality and runs faster than many existing image-based rendering techniques with only moderate storage overhead. Number of references:15 Main heading:Image processing Controlled terms:Algorithms - Computer hardware - Mapping Uncontrolled terms:Bar texure - Hardware assisted relief texture mapping - Image based rendering - Layered depth bars - Layered depth images - Layered texure mapping - Pre warped texure Classification code:722 Computer Systems and Equipment - 723.2 Data Processing and Image Processing - 902.1 Engineering Graphics - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 125> Accession number:2004328300798 Title:New semantic model for authentication protocols in ASMs Authors:Xue, Rui (1); Feng, Deng-Guo (1) Author affiliation:(1) Stt. Key Lab. of Info. Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Xue, R. (rxue@is.iscas.ac.cn) Source title:Journal of Computer Science and Technology Abbreviated source title:J Comput Sci Technol Volume:19 Issue:4 Issue date:July 2004 Publication year:2004 Pages:555-563 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:A new semantic model in Abstract State Model (ASM) for authentication protocols is presented. It highlights the Woo-Lam's ideas for authentication, which is the strongest one in Lowe's definition hierarchy for entity authentication. Apart from the flexible and natural features in forming and analyzing protocols inherited from ASM, the model defines both authentication and secrecy properties explicitly in first order sentences as invariants. The process of proving security properties with respect to an authentication protocol blends the correctness and secrecy properties together to avoid the potential flaws which may happen when treated separately. The security of revised Helsinki protocol is shown as a case study. The new model is different from the previous ones in ASMs. Number of references:22 Main heading:Cryptography Controlled terms:Computer programming languages - Data privacy - Formal logic - Mathematical models - Network protocols - Security of data - Semantics - Theorem proving Uncontrolled terms:Abstract state machines (ASM) - Authentication protocols - Cryptographic protocols - Formal analysis Classification code:903.2 Information Dissemination - 902.3 Legal Aspects - 723.2 Data Processing and Image Processing - 921 Mathematics - 723.1.1 Computer Programming Languages - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 716 Telecommunication; Radar, Radio and Television - 723 Computer Software, Data Handling and Applications Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 126> Accession number:2004388367829 Title:Study on the applications of Hidden Markov Models to computer intrusion detection Authors:Zhong, Anming (1); Jia, Chunfu (1) Author affiliation:(1) Coll. of Info. Technol. and Sciences, Nankai University, Tianjin 300071, China; (2) Stt. Key Lab. of Info. Security, Institute of Software, Chinese Academy of Sciences, Beijing 100039, China Corresponding author:Zhong, A. (zhonganming@) Source title:Proceedings of the World Congress on Intelligent Control and Automation (WCICA) Abbreviated source title:Proc. World Congr. Intelligent Control Autom. WCICA Volume:5 Monograph title:WCICA 2004 - Fifth World Congress on Intelligent Control and Automation, Conference Proceedings Issue date:2004 Publication year:2004 Pages:4352-4356 Language:English Document type:Conference article (CA) Conference name:WCICA 2004 - Fifth World Congress on Intelligent Control and Automation, Conference Proceedings Conference date:June 15, 2004 - June 19, 2004 Conference location:Hangzhou, China Conference code:63444 Sponsor:Zhejiang University; National Laboratory of Industrial Control Technology; Zhejiang University of Technology Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:In this paper, the problem of the applications of HMM (Hidden Markov Model) to computer intrusion detection is discussed. Both first-order HMM and second-order HMM are tested to compare their performances of computer intrusion detection. HMMs are used to build a profile of normal activities on a computer from the training data of normal activities on the computer. The norm profile is then used to detect anomalous activities from testing data of both normal and intrusive activities on the computer for intrusion detection. Using the data set of DARPA 2000 LLDOS 1.0, our experiments show that first-order HMM reveals better intrusion detection performance than that of second-order HMM. Number of references:14 Main heading:Computer crime Controlled terms:Computational complexity - Computer aided analysis - Costs - Data recording - Database systems - Information management - Markov processes - Nonlinear systems - Research laboratories - Security of data - Stochastic programming - Time varying networks Uncontrolled terms:Anomaly detection - Computer intrusions - Hidden markov model - Intrusion detection Classification code:911 Cost and Value Engineering; Industrial Economics - 903.2 Information Dissemination - 901.3 Engineering Research - 731.1 Control Systems - 723.5 Computer Applications - 723.3 Database Systems - 723.2 Data Processing and Image Processing - 723.1 Computer Programming - 723 Computer Software, Data Handling and Applications - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 703.1 Electric Networks Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 127> Accession number:2004538760291 Title:Fine-grained mandatory access control model for XML documents Authors:Li, Lan (1); He, Yong-Zhong (1); Feng, Deng-Guo (1) Author affiliation:(1) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Li, L. (lilan@is.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:10 Issue date:October 2004 Publication year:2004 Pages:1528-1537 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Information stored in XML documents should be protected by access control policy. Current access control models for XML documents are all based on DAC (discretionary access control) or RBAC (role-basd access control). High security system uses MAC (mandatory access control) to secure information in system. XML document model is extended to include label information, and some rules that the extended model has to satisfy with are presented. Fine-grained MAC model for XML documents is described in detail by discussing four operations on XML documents. The fine-grained MAC model is based on XML schema, and its finest granularity of access control is element or attribute. The architecture and some mechanisms used to implement the fine-grained MAC model are discussed too. Number of references:17 Main heading:Network protocols Controlled terms:Algorithms - Architecture - Mathematical models - Security of data - XML Uncontrolled terms:Access control - Discretionary access control - Fine grained MAC models - Label information - Mandatory access control - Role based access control - XML documents Classification code:723.1 Computer Programming - 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 128> Accession number:2004238193096 Title:Selection algorithms for anycast relay routing Authors:Zheng, Jianping (1); Li, Keqin (2); Wu, Zhime (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Bell Labs. Research China, Lucent Technologies, Beijing 100080, China Corresponding author:Zheng, J. (jianping@ios.cn) Source title:IEEE International Performance, Computing and Communications Conference, Proceedings Abbreviated source title:IEEE Int Perform Comput Commun Conf Proc Volume:23 Monograph title:23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004 Issue date:2004 Publication year:2004 Pages:21-27 Language:English Document type:Conference article (CA) Conference name:23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004 Conference date:April 15, 2004 - April 17, 2004 Conference location:Phoenix, AZ., United states Conference code:62954 Sponsor:IEEE Computer Society Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Anycast has been applied widely in service discovery and replicated service. Current researches on anycast routing mainly focus on the scenario that anycast server is the final destination in a communication session. In this paper, we explore another scenario that anycast is applied for relay routing, and addresses the problem of selecting among the anycast relay routers. After analyzing the characteristics of anycast relay routing distinguished from general anycast routing, we present three selection algorithms for anycast relay routing, namely nearest to source, nearest to destination and random selection. Based on the results of probability analysis and simulation, we compare the performance of each algorithm, analyze how the placement and the number of relay routers impact the performance of selection algorithms, and further discuss how to apply these selection algorithms and how many relay routers should be deployed. Number of references:14 Main heading:Information services Controlled terms:Algorithms - Communication systems - Computer simulation - Mathematical models - Packet networks - Probability distributions - Problem solving - Routers - Servers - Set theory Uncontrolled terms:Anycast relay routing - Automatic tunneling - Random selection - Selection algorithms Classification code:922.1 Probability Theory - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 903.4 Information Services - 723.5 Computer Applications - 723.4 Artificial Intelligence - 723 Computer Software, Data Handling and Applications - 722.3 Data Communication, Equipment and Techniques - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 716 Telecommunication; Radar, Radio and Television Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 129> Accession number:2004047825461 Title:Correlation immunity and resiliency of symmetric Boolean functions Authors:Wu, Chuan-Kun (1); Dawson, Ed (2) Author affiliation:(1) Stt. Key Lab. of Info. Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Information Security Research Centre, Queensland University of Technology, G.P.O. Box 2434, Brisbane, QLD 4001, Australia Corresponding author:Wu, C.-K. (ckwu@is.iscas.ac.cn) Source title:Theoretical Computer Science Abbreviated source title:Theor Comput Sci Volume:312 Issue:2-3 Issue date:January 30, 2004 Publication year:2004 Pages:321-335 Language:English ISSN:03043975 CODEN:TCSCDI Document type:Journal article (JA) Publisher:Elsevier Abstract:Correlation immunity of symmetric Boolean functions is studied in this paper. Lower bounds on the number of constructible correlation immune symmetric functions are given. Constructions for such new balanced functions are presented. These functions are also known as 1-resilient functions. In 1985, Chor et al. conjectured that the only 1-resilient symmetric functions are the exclusive-or of all n variables and its negation. This conjecture, however, was disproved by Gopalakrishnan, Hoffman and Stinson in 1993 by giving a class of infinite counterexamples, and they noted that it does not seem to extend any further in an obvious way. In this paper two more infinite classes of such examples are presented for n being even and being odd, respectively, and consequently one of the two open problems proposed by Gopalakrishnan et al., is addressed by constructing new symmetric resilient functions. &copy; 2003 Elsevier B.V. All rights reserved. Number of references:16 Main heading:Boolean functions Controlled terms:Computer science - Correlation methods - Cryptography - Integral equations - Linear equations - Problem solving - Vectors Uncontrolled terms:Binomial coefficients - Correlation immunity - Resiliency Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723 Computer Software, Data Handling and Applications - 723.4 Artificial Intelligence - 921.1 Algebra - 921.2 Calculus - 922.2 Mathematical Statistics Treatment:Theoretical (THR) DOI:10.1016/j.tcs.2003.09.009 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 130> Accession number:2004288261805 Title:Parallel model of intrusion tolerance system: RC model Authors:Gui, Jing-Song (1); Wang, Li-Na (1); Zhang, Huan-Guo (1); Fu, Jian-Ming (1) Author affiliation:(1) Sch. of Comp. Sci., Wuhan Univ., Wuhan 430072, China; (2) Lab. of Software Eng., Wuhan Univ., Wuhan 430072, China; (3) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Cui, J.-S. (cui_js@) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:27 Issue:4 Issue date:April 2004 Publication year:2004 Pages:500-506 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:Intrusion Tolerance System has become another essential technique to protect Internet servers against intrusion succeeding to the firewall and IDS. The article proposes a parallel model of intrusion tolerance system (ITS): RC model. This model classifies the effects of intrusions on system resources and controls when attacks happen. It divides the resources into 3 levels: measurable resource, information resource and attribute resource, and divides the control status into 2 levels: code level and active level. The 5 levels can characterize the system security state accurately from different views, though they are abstract. The article also describes how to analyze an ITS using RC model, and provides some recovery methods and instances of RC Model. Number of references:6 Main heading:Servers Controlled terms:Computer system firewalls - Distributed computer systems - Parallel processing systems - Security of data Uncontrolled terms:Attribute resource - Information resource - Intrusion tolerance - Measurable resource - Network security Classification code:722.4 Digital Computers and Systems - 723.2 Data Processing and Image Processing Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 131> Accession number:2004068008527 Title:The implementation of an enterprise application integration platform Authors:Xu, Jungang (1); Wang, Hongan (1); Dai, Guozhong (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Xu, J. Source title:Chinese Journal of Electronics Abbreviated source title:Chin J Electron Volume:13 Issue:1 Issue date:January 2004 Publication year:2004 Pages:122-126 Language:English ISSN:10224653 CODEN:CHJEEW Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:With the driving of rapid reaction to the changes of business rules, enterprises realize that they need to transfer their applications from single function to management of the whole processing flow. This transfer requires the enterprises to integrate the existing individual systems and re-configure its business systems. To meet this challenge, we have designed and implemented an Application integration platform for process industry (AIP/PI), which is model-driven and component-based, and composed of six main components: application configuration and execution platform, data accessing middleware, data collecting middleware, enterprise core database for production management, enterprise real-time database for production process, data integration and material balancing system. Our work has been applied to one refinery plant. Number of references:11 Main heading:Information technology Controlled terms:Database systems - Industrial management - Industry - Management information systems - Mathematical models - Middleware - Petroleum refineries Uncontrolled terms:Application integration platform for process industry - Business model Classification code:513.2 Petroleum Refineries - 723.1 Computer Programming - 723.2 Data Processing and Image Processing - 723.5 Computer Applications - 912.2 Management - 921.6 Numerical Methods Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 132> Accession number:2004248214410 Title:Location pre-query scheme to Internet mobility support Authors:He, Xiao-Ying (1); Liu, Qiong (2); Lei, Zhen-Ming (1) Author affiliation:(1) ATM Ctr., Sch. of Info. Eng., Univ. of Posts and Telecom., Beijing 100876, China; (2) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:He, X.-Y. (liuq@ios.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:2 Issue date:February 2004 Publication year:2004 Pages:259-267 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:An approach for IP mobility support with Location Pre-Query (MIP_Q) is put forward for solving the traffic bottleneck and single point error at home network, and also for improving the efficiency and reliability of communication. MIP_Q eliminates the agent of HA (home Agent) by extending the functions of DNS (domain name system) to manage and track the location database of mobile nodes. MIP_Q uses parallel handoff procedures and avoids the triangle routing and tunneling. The cost and handoff delay of MIP_Q with MIP and MIP_LR are analyzed and compared. The realization of MIP_Q is also discussed by referring to the widely used wide area cellular mobile networks. The analysis results show that MIP_Q precedes MIP and MIP_Q on handoff efficiency and the number of additional entities. MIP_Q can greatly reduce the mean cost of mobile communication and lead to a reasonable handoff delay. MIP_Q also has feasibility on implementation. Finally, the MIP_Q's simulation and implementation schemes are given out. Abstract type:(Edited Abstract) Number of references:22 Main heading:Mobile telecommunication systems Controlled terms:Costs - Internet - Network protocols - Parallel processing systems - Traffic control Uncontrolled terms:Domain name system - Home agent - Mobile internet protocol - Mobile node Classification code:718 Telephone Systems and Related Technologies; Line Communications - 722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 133> Accession number:2004328300788 Title:Model checking real-time value-passing systems Authors:Chen, Jing (1); Cao, Zi-Ning (1) Author affiliation:(1) Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Lab. d'Info. Fond. d'Orl&#233;ans, Universit&#233; d'Orl&#233;ans, Rue L&#233;onard de Vinci, 45067 Orleans Cedex 2, France Corresponding author:Chen, J. (chen@lifo.univ-orleans.fr) Source title:Journal of Computer Science and Technology Abbreviated source title:J Comput Sci Technol Volume:19 Issue:4 Issue date:July 2004 Publication year:2004 Pages:459-471 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:In this paper, to model check real-time value-passing systems, a formal language Timed Symbolic Transition Graph and a logic system named Timed Predicate &mu;-Calculus are proposed. An algorithm is presented which is local in that it generates and investigates the reachable state space in top-down fashion and maintains the partition for time evaluations as coarse as possible while on-the-fly instantiating data variables. It can deal with not only data variables with finite value domain, but also the so called data independent variables with infinite value domain. To authors knowledge, this is the first algorithm for model checking timed systems containing value-passing features. Number of references:22 Main heading:Formal languages Controlled terms:Algorithms - Communication channels (information theory) - Graph theory - Mathematical models - Real time systems - Semantics - Set theory - Vectors Uncontrolled terms:Model checking - Timed predicate &mu;-calculus - Value-passing Classification code:921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 921.1 Algebra - 903.2 Information Dissemination - 723.1.1 Computer Programming Languages - 722.4 Digital Computers and Systems - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 716.1 Information Theory and Signal Processing Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 134> Accession number:2005219121888 Title:Design of a CIL connector to Spin Authors:Yongjian, Li (1); Rui, Xue (2) Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, 100080; (2) State Key Laboratory of Information Security, Beijing, 100080 Corresponding author:Yongjian, L. (lyj238@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 of the 28th Annual International Computer Software and Applications Conference, COMPSAC 2004 Issue date:2004 Publication year:2004 Pages:349-354 Language:English ISSN:07303157 CODEN:PSICD2 Document type:Conference article (CA) Conference name:Proceedings of the 28th Annual International Computer Software and Applications Conference, COMPSAC 2004 Conference date:September 28, 2004 - September 30, 2004 Conference location:Hong Kong, China, Hong kong Conference code:64717 Publisher:Institute of Electrical and Electronics Engineers Computer Society Abstract:The CAPSL Integrated Protocol Environment effort aims at providing an intuitive and expressive language for specifying authentication and key distribution protocols and supporting interfaces to various analysis tools. The CAPSL Intermediate Language CIL has been designed with the emphasis on simplifying translators from CIL to other analysis tools. In this paper we describe the design of a CIL-to-Spin connector. We describe how CIL concepts are translated into Spin and propose a general method to model the behaviors of honest principals and the intruder. Based on the method, a prototype connector has been implemented in Gentle, which can automatically translate CIL specification to promela code and LTL formula, thus greatly simplifying the modelling and analysis process. &copy; 2004 IEEE. Number of references:12 Main heading:Computer programming languages Controlled terms:Computer science - Cryptography - Network protocols - Security of data - Software engineering - Specifications - User interfaces Uncontrolled terms:CALSL integrated protocol environment - CAPSL - Cryptographic protocols - Security protocols Classification code:716 Telecommunication; Radar, Radio and Television - 721 Computer Circuits and Logic Elements - 722.2 Computer Peripheral Equipment - 723.1.1 Computer Programming Languages - 723.2 Data Processing and Image Processing - 902.2 Codes and Standards Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 135> Accession number:2004198157008 Title:An adaptive traffic shaping algorithm based on DLB Authors:Wang, Jun (0); Liu, Yang (0); Wu, Zhi-Mei (0) Corr. author affiliation:Multimedia Commun. and Network Eng., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:41 Issue:2 Issue date:February 2004 Publication year:2004 Pages:268-275 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Science Press Abstract:In this paper, an algorithm of traffic shaping based on DLB is developed to smooth the traffic with a large fluctuation of output rate. This algorithm can estimate and compute the average input rate of traffic on-line by monitoring the variety of data buffer's length. It updates the settings of traffic shaper depending on the rate change of source traffic so as to provide smoothed stream under the limited resources. The general problems of traffic shaping are given. And then the general principle of traffic shaping and a typical shape algorithm are described. The main ideas and working process of the proposed algorithm are introduced. An experiment which is used to verify this algorithm is given. Finally, the results of this experiment are analyzed and a conclusion is given. Number of references:8 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 136> Accession number:2004268236297 Title:Overview of scheduling algorithms of aperiodic tasks in real-time systems Authors:Wang, Qiang (0); Wang, Hong-An (0); Jin, Hong (0); Dai, Guo-Zhong (0) Corr. author affiliation:Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:41 Issue:3 Issue date:March 2004 Publication year:2004 Pages:385-392 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Science Press Abstract:Scheduling of aperiodic tasks is an important research topic in real-time systems. The study of scheduling algorithms for aperiodic tasks in real-time systems is summarized. These algorithms are classified into two categories: server-based algorithms and slack-based algorithms. Each algorithm and its variations are discussed, and especially their characteristics and performance are analyzed. By comparing and analyzing these different algorithms, researchers and designers of real-time systems can gain useful information. Finally, some suggestions for future research in scheduling aperiodic tasks are made. Number of references:35 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 137> Accession number:2005149018160 Title:Joint an advanced proportionally fair scheduling and rate adaptation for multi-services in TDD-CDMA systems Authors:Peng, Mugen (1); Wu, Yichuan (2); Wang, Wenbo (1) Author affiliation:(1) Center for Wireless Communications, Beijing University of Posts and Tele, P.O.Box 93, Beijing 100876, China; (2) Institute of Software, Chinese Academy of Sciences, Beijing, 100080, China Corresponding author:Peng, M. (pmg@bupt.edu.cn) Source title:IEEE Vehicular Technology Conference Abbreviated source title:IEEE Veh Technol Conf Volume:59 Issue:3 Monograph title:2004 IEEE 59th Vehicular Technology Conference, VTC2004-Spring: Towards a Global Wireless World Issue date:2004 Publication year:2004 Pages:1630-1634 Language:English ISSN:15502252 CODEN:IVTCDZ Document type:Conference article (CA) Conference name:2004 IEEE 59th Vehicular Technology Conference, VTC2004-Spring: Towards a Global Wireless World Conference date:May 17, 2004 - May 19, 2004 Conference location:Milan, Italy Conference code:64425 Sponsor:IEEE; IEEE Vehicular Technology Society Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Since TDD mode can support the asymmetric traffic efficiently, advanced scheduler based on slot -assignment for multi-service in TDD systems should be investigated. In this paper, downlink capacity constraint is discussed firstly. Secondly, a rate adaptation scheme is presented to maximizing the throughput. Furthermore, to guarantee the fairness and satisfy QoS requirement, an advanced Proportionally Fair Scheduling (PFS) algorithm is proposed for determining which flow will be allocated resources. The proposed algorithm aims at guaranteeing the long-term and short-term fairness as well as maximizing the system throughput. Furthermore, the scheduler supports multiple classes of traffic with different QoS requirement. The simulation results demonstrate that the proposed scheduling algorithm can improve the fairness and provide a considerable throughput as well. &copy; 2004 IEEE. Number of references:9 Main heading:Code division multiple access Controlled terms:Algorithms - Computer simulation - Quality of service - Queueing networks - Scheduling - Telecommunication links - Telecommunication networks - Telecommunication traffic Uncontrolled terms:Proportionally fair scheduling (PFS) algorithm - Queuing principle - Rate control - Time division duplex (TDD) - Wireless fair scheduling Classification code:716 Telecommunication; Radar, Radio and Television - 723.5 Computer Applications Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 138> Accession number:2004188142850 Title:A real-time path planning approach without the computation of Cspace obstacles Authors:Wang, Yongji (1); Han, Liu (1); Li, Mingshu (1); Wang, Qing (1); Zhou, Jinhui (1); Cartmell, Matthew (2) Author affiliation:(1) Laboratory for Internet Technologies, Institute of Software, Chinese Academy of Sciences, P.O. Box 8718, Beijing 100080, China; (2) Department of Mechanical Engineering, Centre for Systems and Control, University of Glasgow, Glasgow, G12 8QQ, United Kingdom Corresponding author:Wang, Y. (ywang@intec.iscas.ac.cn) Source title:Robotica Abbreviated source title:Robotica Volume:22 Issue:2 Issue date:March/April 2004 Publication year:2004 Pages:173-187 Language:English ISSN:02635747 CODEN:ROBODV Document type:Journal article (JA) Publisher:Cambridge University Press Abstract:An important concept proposed in the early stage of robot path planning field is the shrinking of the robot to a point and meanwhile expanding of the obstacles in the workspace as a set of new obstacles. The resulting grown obstacles are called the Configuration Space (Cspace) obstacles. The find-path problem is then transformed into that of finding a collision free path for a point robot among the Cspace obstacles. However, the research experiences obtained so far have shown that the calculation of the Cspace obstacles is very hard work when the following situations occur: 1. both the robot and obstacles are not polygons and 2. the robot is allowed to rotate. This situation is even worse when the robot and obstacles are three dimensional (3D) objects with various shapes. Obviously a direct path planning approach without the calculation of the Cspace obstacles is strongly needed. This paper presents such a new real-time robot path planning approach which, to the best of our knowledge, is the first one in the robotic community. The fundamental ideas are the utilization of inequality and optimization technique. Simulation results have been presented to show its merits. Number of references:55 Main heading:Motion planning Controlled terms:Algorithms - Boolean algebra - Collision avoidance - Computer simulation - Mathematical models - Nonlinear programming - Optimization - Real time systems - Remotely operated vehicles - Robotics Uncontrolled terms:Semi-finite constrained optimization - Subsea vehicles Classification code:921.5 Optimization Techniques - 921.1 Algebra - 914.1 Accidents and Accident Prevention - 922 Statistical Methods - 731.5 Robotics - 722.4 Digital Computers and Systems - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.5 Computer Applications Treatment:Literature review (LIT); Theoretical (THR) DOI:10.1017/S0263574703005472 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 139> Accession number:2004268238101 Title:Acquirement and analysis of Doppler ionograms with high accuracy in the ionogram mode from Digisonde 256 Authors:Yuan, Zhigang (1); Ning, Baiqi (1); Wan, Weixing (1); Yuan, Hong (2) Author affiliation:(1) Institute of Geology and Geophysics, Chinese Academy of Sciences, Beijing, China; (2) Institute of Software, Chinese Academy of Sciences, Beijing, China; (3) Solar-Terrestrial Environ. Lab., Nagoya University, Nagoya, Japan; (4) Institute of Geology and Geophysics, Chinese Academy of Sciences, 100029 Beijing, China; (5) Solar-Terrestrial Environ. Lab., Nagoya University, 464-8601 Nagoya, Japan Corresponding author:Yuan, Z. (yuan@stelab.nagoya-u.ac.jp) Source title:Radio Science Abbreviated source title:Radio Sci Volume:39 Issue:2 Issue date:March/April 2004 Publication year:2004 Pages:RS2021 1-RS2021 9 Language:English ISSN:00486604 CODEN:RASCAD Document type:Journal article (JA) Publisher:American Geophysical Union Abstract:The Doppler frequency shift of the radio echo reflected from the ionosphere is an important characteristic to measure ionospheric movements. Generally, for the Digisonde 256 digital ionosonde, a Doppler frequency shift with high resolution can be obtained in the drift mode. In this mode, the height profile of ionospheric disturbances cannot be acquired due to only a few sounding frequencies. In the routine ionogram mode, the profile of electron density is displayed, but the resolution of the recorded Doppler spectral lines is too low to detect precisely the ionospheric disturbances. This paper introduces a method to acquire a Doppler ionogram with high accuracy in the ionograin mode for Digisonde 256. In the condition of a narrowband ionospheric echo in the range bin, through converting the 16 channel data from the frequency domain to the time domain by Inverse Discrete Fourier Transform (IDFT) and estimating the Doppler frequency shift by a least squares method, a Doppler ionogram with high accuracy can be acquired. In order to validate the method, some experiments have been carried out with the Digisonde 256 at Wuhan Ionospheric Observatory. Based on an event of the Traveling Ionospheric Disturbance (TID), we describe how to use these derived Doppler ionograms to study the ionospheric disturbances. Those observation results show that the present method is very useful in the experimental investigations of ionospheric disturbances. Number of references:28 Main heading:Ionomers Controlled terms:Data reduction - Echo suppression - Fourier transforms - Inverse problems - Ionosphere - Spectrum analysis Uncontrolled terms:Doppler frequency shift - Doppler ionograms - Inverse discrete Fourier transforms (IDFT) - Ionospheric disturbances Classification code:443.1 Atmospheric Properties - 716.1 Information Theory and Signal Processing - 723.2 Data Processing and Image Processing - 815.1.1 Organic Polymers - 921.3 Mathematical Transformations Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 140> Accession number:2004238200849 Title:Towards a theory of bisimulation for the higher-order process calculi Authors:Li, Yong-Jian (1); Liu, Xin-Xin (1) Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Li, Y.-J. (lyj238@ios.ac.cn) Source title:Journal of Computer Science and Technology Abbreviated source title:J Comput Sci Technol Volume:19 Issue:3 Issue date:May 2004 Publication year:2004 Pages:352-363 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:In this paper, a labelled transition semantics for higher-order process calculi is studied. The labelled transition semantics is relatively clean and simple, and corresponding bisimulation equivalence can be easily formulated based on it. And the congruence properties of the bisimulation equivalence can be proved easily. To show the correspondence between the proposed semantics and the well-established ones, the bisimulation is characterized as a version of barbed equivalence and a version of context bisimulation. Number of references:18 Main heading:Semantics Controlled terms:Computer science - Computer simulation - Integrodifferential equations - Mathematical models - Problem solving - Syntactics Uncontrolled terms:Barbed bisimulation - Context-bisimulation - Higher order process calculi - Labelled transition semantics - Mathematical derivatives - Theory of bisimulation Classification code:721 Computer Circuits and Logic Elements - 723.4 Artificial Intelligence - 723.5 Computer Applications - 903.2 Information Dissemination - 921.2 Calculus Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 141> Accession number:2005149022063 Title:Pen-based user interface Authors:Dai, Guozhong (1) Author affiliation:(1) Intelligence Engineering Lab., Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Dai, G. (guozhong@admin.iscas.ac.cn) Source title:CSCWD 2004 - 8th International Conference on Computer Supported Cooperative Work in Design - Proceedings Abbreviated source title:CSCWD Int. Conf. Comput. Supported Coop. Work Des. Proc. Volume:2 Monograph title:CSCWD 2004 - 8th International Conference on Computer Supported Cooperative Work in Design - Proceedings Issue date:2004 Publication year:2004 Pages:32-36 Language:English ISBN-10:0780379411 ISBN-13:9780780379411 Document type:Conference article (CA) Conference name:CSCWD 2004 - 8th International Conference on Computer Supported Cooperative Work in Design - Proceedings Conference date:May 26, 2004 - May 28, 2004 Conference location:Xiamen, China Conference code:64434 Sponsor:Xiamen University, Xiamen, China; Xiamen Computer Federation; IEEE; IEEE Beijing Section; Chine Computer Federation Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Pen-based user interfaces are becoming more popular. This paper presents the universal analysis and specification of characters and structure of pen-based user interface. With the goal of high usability, interaction techniques on pen-based user interface are performed to improve the human-computer interaction. Furthermore, based on user-centered design, this paper provides a natural and harmonious pen-based user interface for collaborative design, which enhances the development and application of collaborative system. The results of the survey provide insight of pen-based user interfaces and related applications. &copy;2003 IEEE. Number of references:19 Main heading:User interfaces Controlled terms:Computer supported cooperative work - Human computer interaction - Information analysis - Mathematical models - Parallel processing systems - Problem solving - Semantics Uncontrolled terms:Collaborative designs - Interaction techniques - Pen-based user interface - Ubiquitous computing Classification code:722.2 Computer Peripheral Equipment - 723.5 Computer Applications - 903.1 Information Sources and Analysis - 903.2 Information Dissemination - 921 Mathematics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 142> Accession number:2004298266640 Title:Open adaptive scheduling algorithm for open hybrid real-time systems Authors:Huai, Xiao-Yong (1); Zou, Yong (1); Li, Ming-Shu (1) Author affiliation:(1) Lab. for Internet Software Technol., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Huai, X.-Y. (huaixy@itechs.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:4 Issue date:April 2004 Publication year:2004 Pages:487-496 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:To meet the system scheduling requirements of open hybrid real-time systems, an open adaptive real-time scheduling framework, called OARtS (open adaptive real-time scheduling), is presented, which comprises three key components: accept control, scheduling server and adaptive control. To guarantee the schedulability in the open environment, OARtS only accepts the task whose computing bandwidth requirement is no higher than the system's spare one. To schedule multi-constraint tasks, a two-layer scheduling mechanism is introduced. In the mechanism, the scheduling server components provide concurrent scheduling mechanism for multi-constraint tasks, and each of them is assigned to a bandwidth-independent computing bandwidth and has its specific scheduling policy to schedule its own task queue. To adapt to the change in the open environment, the adaptive control tries to tune the real-time service level so as to make full use of the system computing capability; to adapt to the uncertainty of execution time of the soft real-time task, a fuzzy control engine is used to regulate the task's computing bandwidth according to fuzzy rules of the scheduling error so as to eliminate the scheduling error and to get a satisfactory soft real-time performance. Number of references:5 Main heading:Open systems Controlled terms:Adaptive algorithms - Fuzzy control - Quality of service - Real time systems - Scheduling - Servers Uncontrolled terms:Open adaptive scheduling algorithms - Open hybrid real time systems Classification code:722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 921 Mathematics Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 143> Accession number:2004538752052 Title:A quantum authenticated encryption scheme Authors:L&#252;, Xin (1); Ma, Zhi (2); Feng, Deng-Guo (1) Author affiliation:(1) State Key Lab. of Info. Security, Graduate School, Chinese Academy of Sciences, 100039, Beijing, China; (2) State Key Lab. of Info. Security, Institute of Software, Chinese Academy of Sciences, 100039, Beijing, China Corresponding author:L&#252;, X. (lx@is.ac.cn) Source title:2004 7th International Conference on Signal Processing Proceedings, ICSP Abbreviated source title:Int. Conf. Sign. Process. Proc. ICSP Monograph title:2004 7th International Conference on Signal Processing Proceedings, ICSP Issue date:2004 Publication year:2004 Pages:2308-2311 Language:English ISBN-10:0780384075 ISBN-13:9780780384071 Document type:Conference article (CA) Conference name:2004 7th International Conference on Signal Processing Proceedings, ICSP Conference date:August 31, 2004 - September 4, 2004 Conference location:Beijing, China Conference code:64055 Sponsor:Chinese Institute of Electronics (CIE); IEEE Signal Processing Society (IEEE-SPS); Institute of Electrical Engineers (IEE); Union Radio Scientifique Internationale (URSI); IEEE Beijing Section Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Privacy and authenticity are two main tasks for secure communication, In this paper, a quantum authenticated encryption scheme is proposed. This scheme is devised to encrypt and authenticate classical information using quantum states. We assume that Alice and Bob share a classical bits string y as their private key. Alice generates quantum cipher text and authentication tag using her secret key. Bob can decrypt and verify the authenticity of the received message. Security analysis shows that the proposed protocol is a computationally secure encryption and statistically secure authentication scheme. Number of references:11 Main heading:Digital watermarking Controlled terms:Algorithms - Codes (symbols) - Error correction - Functions - Image coding - Logic circuits - Pattern recognition - Polynomials - Quantum cryptography - Security of data - Set theory Uncontrolled terms:Authentication - Quantum information processor - Quantum key distribution (QKD) - Quantum states Classification code:921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 921.1 Algebra - 921 Mathematics - 723.5 Computer Applications - 723.2 Data Processing and Image Processing - 721.2 Logic Elements - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 144> Accession number:2005068825540 Title:Elevator group control algorithm based on residual gradient and q-learning Authors:Zong, Ziliang (1); Wang, Xugang (3); Tang, Zheng (2); Zeng, Guangzhou (1) Author affiliation:(1) Shandong University, Faculty of Computer Science, Shandong University, Jinan, 250061, China; (2) Toyama University, Faculty of Engineering, Toyama University, Toyama-shi, 930-8555, Japan; (3) Intelligence Engineering Laboratory, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Zong, Z. (pipizzl@) Source title:Proceedings of the SICE Annual Conference Abbreviated source title:Proc SICE Annu Conf Monograph title:SICE Annual Conference 2004 Issue date:2004 Publication year:2004 Pages:2255-2257 Article number:FPI-1-2 Language:English CODEN:PSIAEV Document type:Conference article (CA) Conference name:SICE Annual Conference 2004 Conference date:August 4, 2004 - August 6, 2004 Conference location:Sapporo, Japan Conference code:64238 Sponsor:Society of Instrument and Control Engineers, (SICE); IEEE Industrial Electronics Society; IEEE Robotics and Automation Society; IEEE Control Systems Society; IEEE Systems, Man and Cybernetics Society Publisher:Society of Instrument and Control Engineers (SICE) Abstract:This paper describes the application of a novel reinforcement learning to the difficult real world problem of elevator dispatching. We propose a new algorithm combing Q-learning and residual gradient to solve this problem and obtain the results which are better than other traditional elevator control algorithms. Number of references:6 Main heading:Learning algorithms Controlled terms:Computer simulation - Elevators - Mathematical models - Poisson equation - Problem solving Uncontrolled terms:Elevator group control - Q-learning - Reinforcement learning - Residual gradient Classification code:692.2 Elevators - 723 Computer Software, Data Handling and Applications - 723.4 Artificial Intelligence - 723.5 Computer Applications - 921.2 Calculus Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 145> Accession number:2004278252556 Title:Real-time scheduling algorithm based on priority table and its implementation Authors:Wang, Yong-Yan (1); Wang, Qiang (1); Wang, Hong-An (1); Jin, Hong (1); Dai, Guo-Zhong (1) Author affiliation:(1) Intelligent Eng. Lab., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wang, Y.-Y. (wyy@iel.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:3 Issue date:March 2004 Publication year:2004 Pages:360-370 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:This paper proposes a new scheduling scheme based on priority table design by integrating two characteristic parameters (i.e. deadline and value) of a task. Two real-time scheduling algorithms from the scheme are presented: earliest deadline value (EDV) and value earliest deadline (VED). The way to implement the two algorithms using multi-linked lists is given, including task acceptance policy and task completion/abortion policy. This scheme can also be applied to integrate two other characteristic parameters or even three characteristic parameters of a task. Based on hit value ratio, weighted guarantee ratio and differentiated guarantee ratio, the performance of the VED and EDV algorithms are analyzed. The experimental results show that the VED and EDV algorithms can improve the performance compared to the classical EDF (earliest deadline first) and HVF (highest value first) algorithms under all workload conditions. Abstract type:(Edited Abstract) Number of references:11 Main heading:Real time systems Controlled terms:Algorithms - Computer operating systems - Multitasking - Performance - Scheduling Uncontrolled terms:Deadline guarantee ratio - Earliest deadline value - Hit value ratio - Priority - Real time scheduling - Value earliest deadline Classification code:722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 146> Accession number:2005038797576 Title:Hierarchical model for perception memory based on connected graph and dynamic process Authors:Wei, Hui (1); Luan, Shang-Min (4) Author affiliation:(1) Algorithm for Cognitive Model Lab., Dept. of Comp. Sci. and Eng., Fudan Univ., Shanghai 200433, China; (2) Lab. of Intelligent Info. Proc., Inst. of Comp. Technol., Chinese Acad. of Sci., Beijing 100080, China; (3) Inst. of Artificial Intelligence, Dept. of Comp. Sci. and Eng., Zhejiang Univ., Hangzhou 310027, China; (4) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wei, H. (weihui@fudan.edu.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:11 Issue date:November 2004 Publication year:2004 Pages:1616-1628 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:One of the interferences between inheritance and concurrency is inheritance anomaly. From the view of cognitive computational neuroscience, a direct information representation method is presented based on neural system dynamics and graphic theory. A group of neurons and their connections representing perceptual information directly and the dynamical behaviors of neurons are defined firstly, and then a two-layer neural network is designed to record characteristics of stimulus and connect a specialized neural circuit that responding to the perception of that stimulus respectively. This could be achieved by the structure learning algorithm. The circuit constituted by neurons in two layers is also served as an associative memory of stimulus whose credibility is decided by the degree of connection of the circuit. The direct representation method is of very significance to the research of semantic representation and inference driven by semantics in artificial intelligence. Number of references:26 Main heading:Neural networks Controlled terms:Artificial intelligence - Computer graphics - Learning algorithms Uncontrolled terms:Associative memory - Computational neuroscience - Dynamic system - Perceptual information - Representation - Structure learning algorithm Classification code:723 Computer Software, Data Handling and Applications - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 147> <RECORD 1> Accession number:2004408389491 Title:Service selection in dynamic demand-driven Web services Authors:Wang, Xiaoling (1); Yue, Kun (1); Huang, Joshua Zhexue (2); Zhou, Aoying (1) Author affiliation:(1) Dept. of Comp. Sci. and Engineering, Fudan University, ShangHai, 200433, China; (2) E-Business Technology Institute, University of Hong Kong, Hong Kong, Hong Kong; (3) Laboratory of Computer Science, Institute of Software, Chinese Academy of Science, China Corresponding author:Wang, X. (wxling@fudan.edu.cn) Source title:Proceedings - IEEE International Conference on Web Services Abbreviated source title:Proc. IEEE Int. Conf. Web Serv. Monograph title:Proceedings - IEEE International Conference on Web Services Issue date:2004 Publication year:2004 Pages:376-383 Language:English ISBN-10:0769521673 ISBN-13:9780769521671 Document type:Conference article (CA) Conference name:Proceedings - IEEE International Conference on Web Services Conference date:July 6, 2004 - July 9, 2004 Conference location:San Diego, CA, United states Conference code:63576 Sponsor:IEEE Computer Society (TCSC) Publisher:IEEE Computer Society Abstract:Recently, Web services have become a new technology trend for Enterprise Application Integration (EAI) and more and more applications based on Web services are emerging. One of the problems in using Web services in business applications such as logistics is services composition automatically and efficiently. In this paper, we present a Dynamic, Demand-Driven Web services Engine called D3D-Serv to implement composite service functionality that is used to dynamically build composite services from existing services according to different business logics and requirements. In this D3D_Serv framework, the most challenging function to implement is dynamic selection of service providers at run time. The highly dynamic and distributed nature of Web services often makes some service providers overloaded at certain times while others idle. To solve this problem, we propose an efficient services selection and execution strategy that is based on the queuing theory and can provide guarantees for the QOS (Quality of Service) under provider's limited resources. Preliminary experimental results have shown that this algorithm is effective. Number of references:16 Main heading:World Wide Web Controlled terms:Algorithms - Optimization - Problem solving - Quality of service - Resource allocation - Scheduling - Telecommunication services Uncontrolled terms:Enterprise application integration (EAI) - Request for quotation (RFQ) - Web services - Web technologies Classification code:723 Computer Software, Data Handling and Applications - 723.4 Artificial Intelligence - 912.2 Management - 921.5 Optimization Techniques Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 148> Accession number:2004488687451 Title:Covert channel analysis on ANSHENG secure operating system Authors:Qing, Si-Han (1); Zhu, Ji-Feng (1) Author affiliation:(1) Ctr. for Info. Security Technol., Chinese Acad. of Sci., Beijing 100080, China; (2) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (3) Graduate Sch., Chinese Acad. of Sci., Beijing 100039, 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:15 Issue:9 Issue date:September 2004 Publication year:2004 Pages:1385-1392 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:ANSHENG operating system is a secure operating system with high security level based on Linux, which is independently developed with the security kernel, security framework and security models. The approaches to analyzing covert channels in the underlying system are summarized, and it is the first time that the covert-channel-analysis results on a secure operating system based on Linux kernel are reported. Some new covert channels are found by the novel backward tracking approach. For the identified covert channels, accurate bandwidth computation and appropriate covert-channel handling are performed. Abstract type:(Edited Abstract) Number of references:13 Main heading:Computer operating systems Controlled terms:Calculations - Communication channels (information theory) - Security of data Uncontrolled terms:ANSHENG secure operating systems - Backward tracking approaches - Bandwidth computation - Covert channel analysis - Information flow - Linux operating systems - Storage channels Classification code:716.1 Information Theory and Signal Processing - 723 Computer Software, Data Handling and Applications - 921 Mathematics Treatment:Applications (APP); General review (GEN); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 149> Accession number:2004408381320 Title:Adaptive robust TCP/IP header compression algorithm for 3G wireless networks Authors:Wu, Yichuan (1); Limin, Sun (1); Ma, Jian (2) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, China; (2) Nokia Research Center, China, Beijing, China Corresponding author:Wu, Y. (wyc@iscas.ac.cn) Source title:2004 IEEE Wireless Communications and Networking Conference, WCNC 2004 Abbreviated source title:2004 IEEE Wireless Commun. Networking Conf. Volume:2 Monograph title:2004 IEEE Wireless Communications and Networking Conference, WCNC 2004 Issue date:2004 Publication year:2004 Pages:1046-1050 Language:English ISBN-10:0780383443 ISBN-13:9780780383449 Document type:Conference article (CA) Conference name:2004 IEEE Wireless Communications and Networking Conference, WCNC 2004 Conference date:March 21, 2004 - March 25, 2004 Conference location:Atlanta, GA, United states Conference code:63498 Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:The future telecommunication systems will be surely characterized by the convergence of mobile technologies and Internet protocols, achieved through a network platform totally based on TCP/IP protocols ("all-IP network"). In such a system, both wired and wireless parts will build on a common network platform based on TCP/IP protocol. However, TCP/IP protocol headers overheads are large and need to be compressed to save radio channel bandwidth which is the most expensive and scarce resource of the whole wireless system, especially for some services whose payload size is small. In this paper, a new adaptive robust TCP/IP header compression algorithm for 3G wireless networks is proposed and analyzed. The aim of this algorithm is to adjust the dimension of Variable Sliding Window (VSW) in W-LSB encoding with the accurate estimation of wireless channel state to achieve the good balance of compression ratio and error-resistant robustness for the adaptive use in wireless link. We present simulation results that demonstrate the effectiveness of this adaptive algorithm over wireless link. Number of references:16 Main heading:Wireless telecommunication systems Controlled terms:Algorithms - Bandwidth - Bit error rate - Computer simulation - Error analysis - Feedback - Internet - Mobile telecommunication systems - Network protocols - Robustness (control systems) - Telecommunication links - Throughput Uncontrolled terms:Header compression (HC) - TCP/IP - Variable sliding window (VSW) - w-LSB encoding - Window-based least significant bits (W-LSB) Classification code:912.2 Management - 731.1 Control Systems - 723.5 Computer Applications - 921.6 Numerical Methods - 723.1 Computer Programming - 716.1 Information Theory and Signal Processing - 716 Telecommunication; Radar, Radio and Television - 723 Computer Software, Data Handling and Applications Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 150> Accession number:2005058822083 Title:Technique of code obfuscation based on function pointer array Authors:Li, Yong-Xiang (1); Chen, Yi-Yun (1) Author affiliation:(1) Dept. of Comp. and Technol., Univ. of Sci. and Technol. of China, Hefei 230027, China; (2) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Li, Y.-X. Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:27 Issue:12 Issue date:December 2004 Publication year:2004 Pages:1706-1711 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:Mobile agent may often be purposefully tampered in the net, but we can increase the difficulty of the tampering attack effectively if we can increase the complexity and decrease the accuracy of analysis to the mobile code by the code obfuscation techniques so as to prevent the tampering attack. Function pointer alias and control flow analysis are difficulties in the course of program analysis, and reasons why the accuracy of program analysis are decreased. This article firstly presents a kind of method to transform the program to make it difficult to analyze the function call relation by adding function pointer array, at the same time mentions a method to transform the control flow to increase the complexity of the dataflow and control flow analysis. So the accuracy of the program analysis is decreased greatly and the tamper attack is hard to attain its purpose. Number of references:5 Main heading:Software agents Controlled terms:Distributed computer systems - Performance - Security of data Uncontrolled terms:Code obfuscation - Control flow transformation - Function pointer - Mobile agent Classification code:722.4 Digital Computers and Systems - 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 151> Accession number:2005239143258 Title:Mining Ratio Rules via principal sparse non-negative matrix factorization Authors:Hu, Chenyong (1); Zhang, Benyu (2); Yan, Shuicheng (3); Yang, Qiang (4); Yan, Jun (3); Chen, Zheng (2); Ma, Wei-Ying (2) Author affiliation:(1) Institute of Software, CAS, Beijing, China; (2) Microsoft Research Asia, Beijing; (3) LMAM, Peking University, Beijing, China; (4) Hong Kong University of Science and Technology Corresponding author:Hu, C. (huchenyong@itechs.iscas.ac.cn) Source title:Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004 Abbreviated source title:Proc. Fourth IEEE Int. Conf. Data Min. ICDM Monograph title:Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004 Issue date:2004 Publication year:2004 Pages:407-410 Language:English ISBN-10:0769521428 ISBN-13:9780769521428 Document type:Conference article (CA) Conference name:Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004 Conference date:November 1, 2004 - November 4, 2004 Conference location:Brighton, United kingdom Conference code:64905 Sponsor:IEEE Computer Society TCCI; IEEE Computer Society TCPAMI Publisher:IEEE Computer Society Abstract:Association rules are traditionally designed to capture statistical relationship among itemsets in a given database. To additionally capture the quantitative association knowledge, F.Korn et al recently proposed a paradigm named Ratio Rules for quantifiable data mining. However, their approach is mainly based on Principle Component Analysis (PCA) and as a result, it cannot guarantee that the ratio coefficient is non-negative. This may lead to serious problems in the rules' application. In this paper, we propose a new method, called Principal Sparse Non-Negative Matrix Factorization (PSNMF), for learning the associations between itemsets in the form of Ratio Rules. In addition, we provide a support measurement to weigh the importance of each rule for the entire dataset. &copy; 2004 IEEE. Number of references:7 Main heading:Data mining Controlled terms:Algorithms - Approximation theory - Boolean functions - Database systems - Matrix algebra - Principal component analysis - Vectors Uncontrolled terms:Association rule mining (ARM) - Non-negative matrix factorization (NMF) - Principal sparse non-negative matrix factorization (PSNMF) - Sparse non-negative matrix factorization (SNMF) 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 - 921.1 Algebra - 921.6 Numerical Methods - 922.2 Mathematical Statistics Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 152> Accession number:2004298268900 Title:Fingerprint minutiae post- processing using fuzzy geometry and texture feature Authors:Fu, Jingguang (0); Xu, Gang (0); Wang, Yuguo (0) Corr. author affiliation:Inst. of Soft-ware, Chinese Acad. of Sci., 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:16 Issue:4 Issue date:April 2004 Publication year:2004 Pages:487-491+496 Language:Chinese ISSN:10039775 CODEN:JFTXFX Document type:Journal article (JA) Publisher:Institute of Computing Technology, Beijing, China Abstract:Fingerprint recognition is usually based on minutiae matching. Reliable minutiae extraction is very difficult for poor fingerprint images and many false minutiae will be extracted. To improve the accuracy of minutiae, a minutiae post-processing method based on the analysis of initial grayscale fingerprint image is presented. The fuzzy geometry features and texture features were extracted from each minutia's local neighborhoods. The verification of minutia's type was realized by classifying these features with a MLP neural network. Experimental results show that the proposed method can filter out most false minutiae and is more accurate than other methods. Number of references:10 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 153> Accession number:2005048803601 Title:Calculation of the concept similarity in domain ontology Authors:Zhu, Li-Jun (1); Tao, Lan (2); Liu, Hui (3) Author affiliation:(1) e-Commerce Technol. R and D Ctr., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Coll. of Info. Eng., Shenzhen Univ., Shenzhen 518060, China; (3) Sch. of Mgmt. and Econ., Beijing Inst. of Technol., Beijing 100081, China Corresponding author:Zhu, L.-J. (zhulj@) Source title:Huanan Ligong Daxue Xuebao/Journal of South China University of Technology (Natural Science) Abbreviated source title:Huanan Ligong Daxue Xuebao Volume:32 Issue:SUPPL. Issue date:November 2004 Publication year:2004 Pages:147-150 Language:Chinese ISSN:1000565X CODEN:HLDKEZ Document type:Journal article (JA) Publisher:South China University of Technology Abstract:A method to calculate the semantic similarity of the ontology concepts described by RDF Schema constructs was proposed on the basis of the semantic distance theory in the linguistic field. This method was then used to calculate and analyze the semantic similarity of the concepts in Agriculture Ontology (AO). The result proves that the proposed method can be used to quantitatively analyze the semantic similarity of concepts and properties, and can also help to extend the query concept sets and rate the query results in domain ontology-based semantic query systems. Number of references:7 Main heading:Information management Controlled terms:Information retrieval - Knowledge based systems - Query languages Uncontrolled terms:Concept similarity - Ontology - Resource description framework - Semantic distance Classification code:723.3 Database Systems - 723.4.1 Expert Systems - 723.5 Computer Applications - 903.2 Information Dissemination - 903.3 Information Retrieval and Use - 912.2 Management Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 154> Accession number:2004538760293 Title:Improved dynamically modified confidentiality policies model Authors:Ji, Qing-Guang (1); Qing, Si-Han (1); He, Ye-Ping (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Ctr. for Info. Security Technol., Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Ji, Q.-G. (qgji@ercist.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:10 Issue date:October 2004 Publication year:2004 Pages:1547-1557 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:This paper presents a model which can support network security objects, improve the Amon ott's rules with small amount of operations and storages for practicality, enhance the flexibility available for system implementation by making the single level becoming level range, and control IPC objects effectively. For these purposes, the Amon ott's rules for dynamically modifying the current sensitivity level are extended to ones for sensitivity levels range, so Bell's work on making the single level becoming level range for network security can be combined with Amon ott's work. Considering the cases in the practical system GEMSOS, DG/UX and prototype microkernel system Fluke, single level entity, multiple level entity and special access mode for progress, and the invariants and constraints corresponding to them are introduced. Based on Tmack's way, a sufficient mechanism for IPC objects is posed. In addition, some flaws in ABLP model are pointed out. A new confidentiality policy model with formal specification of invariants, constraints, variables, and constants has been presented with demonstrating reasonableness for some constraints, and it can be used for system design. Number of references:21 Main heading:Security systems Controlled terms:Algorithms - Computer networks - Constraint theory - Formal logic - Mathematical models - Security of data Uncontrolled terms:ABLP model - Confidentiality policy - Formal models - IPC objects - Multiple level entity - Network security - Sensitivity level range Classification code:716 Telecommunication; Radar, Radio and Television - 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 - 914.1 Accidents and Accident Prevention - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 155> Accession number:2004498704600 Title:Algorithm of fault diagnosis for satellite network Authors:Hou, Xia (1); Fan, Zhihua (1); Li, Lei (1); Xu, Fanjiang (1); She, Chundong (1); Hu, Gang (1) Author affiliation:(1) General Software Lab., Institute of Software, Chinese Academy of Sciences, 4# South Fourth Street, Zhong Guan Cun, Beijing, China Corresponding author:Hou, X. (helenhou0927@) Source title:Proceedings - 2004 International Conference on Intelligent Mechatronics and Automation Abbreviated source title:Proc. Int. Conf. Intell. Mechatron. Autom. Monograph title:Proceedings - 2004 International Conference on Intelligent Mechatronics and Automation Issue date:2004 Publication year:2004 Pages:594-598 Language:English ISBN-10:0780387481 ISBN-13:9780780387485 Document type:Conference article (CA) Conference name:Proceedings - 2004 International Conference on Intelligent Mechatronics and Automation Conference date:August 26, 2004 - August 31, 2004 Conference location:Chengdu, China Conference code:63941 Sponsor:IEEE Robotics and Automation Society; IEEE Systems, Man, and Cybernetics Society; IEEE Shikoku Section; National Natural Science Foundation of China; Chinese Institute of Electronics Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Automated fault diagnosis becomes increasingly important to satellite work. In an early paper, we introduced system level diagnosis theory into satellite network firstly and presented two-level-node graph, a novel modeling method. Based on these work, a new test invalidation model under certain fault pattern is presented and a diagnosis algorithm is proposed in this paper. Diagnosis can be divided into two steps, local diagnosis and centralized diagnosis. The former is distributed, which can reduce the diagnosis delay by collecting test results in satellites parallelly. The latter is centralized, which can make use of the regularity of satellite network. The procedure of local diagnosis is described by activity cycle diagram. During diagnosing, little professional knowledge about satellite needs to be involved. An example illustrates the diagnosis algorithm and its effect. Number of references:6 Main heading:Satellite communication systems Controlled terms:Algorithms - Computer software - Control systems - Functions - Graph theory - Mathematical models - Transceivers Uncontrolled terms:Fault diagnosis - Satellite network - System level diagnosis Classification code:655.2.1 Communication Satellites - 716.3 Radio Systems and Equipment - 723 Computer Software, Data Handling and Applications - 731.1 Control Systems - 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 156> Accession number:2004378353842 Title:On Lin-Bose problem Authors:Wang, Mingsheng (1); Feng, Dengguo (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Stt. Lab. for Information Security, P.O. Box 8718, Beijing 100080, China Corresponding author:Wang, M. (mswang@acae.cuhk.edu.hk) Source title:Linear Algebra and Its Applications Abbreviated source title:Linear Algebra Its Appl Volume:390 Issue:1-3 Issue date:October 1, 2004 Publication year:2004 Pages:279-285 Language:English ISSN:00243795 CODEN:LAAPAW Document type:Journal article (JA) Publisher:Elsevier Inc. Abstract:This paper study generalized Serre problem proposed by Lin and Bose in multidimensional system theory context [Multidimens. Systems and Signal Process. 10 (1999) 379; Linear Algebra Appl. 338 (2001) 125]. This problem is stated as follows. Let F &isin; A<sup>l&times;m</sup> be a full row rank matrix, and d be the greatest common divisor of all the l &times; l minors of F. Assume that the reduced minors of F generate the unit ideal, where A = K[x <inf>1</inf>,...,x<inf>n</inf>] is the polynomial ring in n variables x <inf>1</inf>,...,x<inf>n</inf> over any coefficient field K. Then there exist matrices G &isin; A<sup>l&times;l</sup> and F<inf>1</inf> &isin; A <sup>l&times;m</sup> such that F = GF<inf>1</inf> with det G = d and F <inf>1</inf> is a ZLP matrix. We provide an elementary proof to this problem, and treat non-full rank case. &copy; 2004 Elsevier Inc. All rights reserved. Number of references:13 Main heading:Problem solving Controlled terms:Conformal mapping - Integral equations - Linear equations - Matrix algebra - Polynomials - Set theory - Signal processing - Theorem proving - Variational techniques Uncontrolled terms:Lin-bose problem - Matrix factorization - Multidimensional systems - Multivariate polynomial matrix - Polynomial ring Classification code:716.1 Information Theory and Signal Processing - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.4 Artificial Intelligence - 921.1 Algebra - 921.2 Calculus - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory Treatment:Theoretical (THR) DOI:10.1016/j.laa.2004.04.020 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 157> Accession number:2005149020701 Title:Clustering high-dimensional data with low-order neighbors Authors:Zhao, Yanchang (1); Zhang, Chengqi (1); Shen, Yi-Dong (2) Author affiliation:(1) Faculty of Information Technology, Univ. of Technology, Sydney, Australia; (2) Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences, China Corresponding author:Zhao, Y. (yczhao@it.uts.edu.au) Source title:Proceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004 Abbreviated source title:Proc. IEEE WIC ACM Int. Conf. Web Intell. WI Monograph title:Proceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004 Issue date:2004 Publication year:2004 Pages:103-109 Language:English ISBN-10:0769521002 ISBN-13:9780769521008 Document type:Conference article (CA) Conference name:Proceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004 Conference date:September 20, 2004 - September 24, 2004 Conference location:Beijing, China Conference code:64424 Sponsor:IEEE Computer Society; Web Intelligence Consortium, WIC; Association for Computing Machinery Publisher:IEEE Computer Society Abstract:Density-based and grid-based clustering are two main clustering approaches. The former is famous for its capability of discovering clusters of various shapes and eliminating noises, while the latter is well known for its high speed. Combination of the two approaches seems to provide better clustering results. To the best of our knowledge, however, all existing algorithms that combine density-based clustering and grid-based clustering take cells as atomic units, in the sense that either all objects in a cell belong to a cluster or no object in the cell belong to any cluster. This requires the cells to be small enough to ensure the fine resolution of results. In high-dimensional spaces, however, the number of cells can be very large when cells are small, which would make the clustering process extremely costly. On the other hand, the number of neighbors of a cell grows exponentially with the dimensionality of datasets, which makes the complexity increase further. In this paper, we present a new approach that takes objects (or points) as the atomic units, so that the restriction of cell size can be relaxed without degrading the resolution of clustering results. In addition, a concept of ith-order neighbors is introduced to avoid considering the exponential number of neighboring cells. By considering only low-order neighbors, our algorithm is very efficient while losing only a little bit of accuracy. Experiments on synthetic and public data show that our algorithm can cluster high-dimensional data effectively and efficiently. &copy; 2004 IEEE. Number of references:12 Main heading:Data mining Controlled terms:Algorithms - Computational complexity - Entropy - Hierarchical systems - Number theory - Probability density function - Problem solving - Signal processing - Wavelet transforms Uncontrolled terms:Clustering - Conditional entropy (CE) - Hierarchial structures - Normalized mutual information (NMI) Classification code:922.1 Probability Theory - 921.3 Mathematical Transformations - 921 Mathematics - 723.2 Data Processing and Image Processing - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 716.1 Information Theory and Signal Processing - 641.1 Thermodynamics Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 158> Accession number:2004248214394 Title:Mechanism to efficiently transport wireless real-time IP services over cellular links Authors:Wu, Yi-Chuan (1); Huang, Kui (1); Sun, Li-Min (1); Wu, Zhi-Mei (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wu, Y.-C. (wyc@iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:1 Issue date:January 2004 Publication year:2004 Pages:112-119 Language:English ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:When transporting real-time IP services such as VoIP in a cellular communication system with limited channel bandwidth and high bit error rate, there exist some problems such as the relatively large overhead imposed by protocol headers and poor data discarding policies. In this paper, a new scheme, ROHC/UDP Lite, is proposed to solve these problems, which combines ROHC with UDP Lite protocol effectively. With the ROHC/UDP Lite, it is possible to efficiently transport IP-based packet-switched voice services in the future IP cellular systems. Number of references:11 Main heading:Cellular telephone systems Controlled terms:Bit error rate - Network protocols - Packet switching - Quality of service - Real time systems - Wireless telecommunication systems Uncontrolled terms:Cellular link - Real time IP service - Robust header compression - UDP lite Classification code:718.1 Telephone Systems and Equipment - 723.1 Computer Programming Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 159> Accession number:2004538754712 Title:Model-checking tool with non-trivial data structures Authors:Zhang, Yi (0); Lin, Hui-Min (0) Corr. author affiliation:Key Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:41 Issue:11 Issue date:November 2004 Publication year:2004 Pages:1990-1999 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Science Press, Beijing, China Abstract:Model-checking is one of the most successful automatic verification techniques over the last 20 years, and the development of model-checking tools is the bridge that connects theories in this field and applications. In order to efficiently model-check value-passing current systems which involve non-trivial data structures. An extended symbolic transition graph with assignment (STGA) is introduced as the semantic model of concurrent systems, and a modal graph is used as the semantic model of logic formulae. And then following an on-the-fly algorithm, a prototype tool is implemented to model-check concurrent systems. In this paper model-checking is summarized by introducing non-trivial data structures into value-passing process specification language and STGA. A practical case is also presented to justify the tool's efficiency. Number of references:17 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 160> Accession number:2005058812430 Title:A study of the connectedness of Gnutella Authors:Sum, John (1); Li, Mingshu (2); Ng, Chung W. (3); Wong, Tony (1); Young, G. (4) Author affiliation:(1) Dept. of Computing, PolyU Hong Kong, KLN, Hong Kong, Hong Kong; (2) Institute of Software, Chinese Academy of Science, China; (3) Dept. of Computer Science, Morehouse College, Atlanta, GA 30314; (4) Dept. of Computer Science, Cal Poly Pomona, CA 91768 Corresponding author:Sum, J. Source title:Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04 Abbreviated source title:Proc. Int. Conf. Parall. Distr. Process. Tech. Appl. PDPTA'04 Volume:2 Monograph title:Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04 Issue date:2004 Publication year:2004 Pages:960-966 Language:English ISBN-10:1932415262 ISBN-13:9781932415261 Document type:Conference article (CA) Conference name:Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04 Conference date:June 21, 2004 - June 24, 2004 Conference location:Las Vegas, NV, United states Conference code:64204 Sponsor:Comput. Sci. Research, Education, and Applications Press (CSREA); International Technology Institute (ITI); Korean Society for Internet Information (KSII); World Academy of Science for Information Technology Publisher:CSREA Press Abstract:While lot of researches on Gnutella have been focus on its topological properties and file search capability, seldom of them has been on the connectedness of Gnutella. In this paper, an investigation result on a simulated model for Gnutella will be presented. The simulated model is inspired by a S.N. Dorogovtsev and J.F.F. Mendes evolution network model (p.121 in [4]). Whenever a new node has been added, a constant number of edges will be connected from this new node to a randomly selected node and its direct neighbors. This mimics the situation when XTRY or PING with TTL 2 is used for making connection. By simulation and utilizing the Molloy-Reed criteria, it is anticipated that the network topology of Gnutella P2P might not be connected. The network simply consists of a number of small components. For a Gnutella of n peer nodes, the size of each component is of order O(log n). In another word, the amount of information a Gnutella peer can reach could be quite small. Number of references:15 Main heading:Computer networks Controlled terms:Computational complexity - Computer simulation - Mathematical models - Problem solving - Statistical methods - Topology Uncontrolled terms:Gnutella - Network topology - Node degree distribution (NDD) - Power law distribution Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723 Computer Software, Data Handling and Applications - 723.4 Artificial Intelligence - 723.5 Computer Applications - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory - 922.2 Mathematical Statistics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 161> Accession number:2004428407672 Title:VICOS: A framework for session management in network computing infrastructure Authors:Li, Wenjie (1); Li, Mingshu (1); Wang, Qing (1); Wang, Yongji (1) Author affiliation:(1) Laboratory for Internet Technology, Institute of Software, Chinese Academy of Sciences Source title:Proceedings - 2004 IEEE International Conference on Services Computing, SCC 2004 Abbreviated source title:Proc. IEEE Int. Conf. Serv. Comput. SCC Monograph title:Proceedings - 2004 IEEE International Conference on Services Computing, SCC 2004 Issue date:2004 Publication year:2004 Pages:647-650 Language:English ISBN-10:0769522254 ISBN-13:9780769522258 Document type:Conference article (CA) Conference name:Proceedings - 2004 IEEE International Conference on Services Computing, SCC 2004 Conference date:September 15, 2004 - September 18, 2004 Conference location:Shanghai, China Conference code:63604 Sponsor:IEEE Computer Society, TSC-SC; IBM T.J. Watson Research Center; Shanghai Jiao Tong University (SJTU), China; University of Hong Kong, E-Business Technology Institute, China Publisher:IEEE Computer Society Abstract:By introducing a virtual computing session abstraction to network computing infrastructure, and slightly extending its underlying remote display protocol, we propose VICOS (Virtual Computing Session): a framework of session management which provides session-level manageability, and allows multiple user to access the computing service on the server simultaneously. The virtual computing session abstraction also supports user roaming among desktops, i.e. user mobility. This framework isolates user's computing session from network or desktop failure. The session-level management mechanism provided by this framework improves the service availability and reliability. We have implemented our VICOS prototype in Linux. We demonstrate that our Linux VICOS prototype can provide general-purpose computing service with low overhead. Number of references:10 Main heading:Computer networks Controlled terms:Computation theory - Liquid crystal displays - Multimedia systems - Optimization - Servers - Switching Uncontrolled terms:Linux - Network computing - Virtual computing session (VICOS) Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722 Computer Systems and Equipment - 722.2 Computer Peripheral Equipment - 921.5 Optimization Techniques Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 162> Accession number:2005038797274 Title:Integrated model of RBAC and MAC in multilevel relation database system Authors:Li, Lan (1); Feng, Deng-Guo (1); Xu, Zhen (1) Author affiliation:(1) Lab. of Info. Security, Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Li, L. (lilan@is.iscas.ac.cn) Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:32 Issue:10 Issue date:October 2004 Publication year:2004 Pages:1635-1639 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Security policy of multilevel security DBMS is expressed by many models. One of them is access control model. Mandatory Access Control (MAC) model guarantees that information flow in multilevel databases is in accordance with security policy. Role-Based Access Control can simplify administration of privileges in multilevel databases. This paper proposes an integrated model of RBAC and MAC. Multilevel role and internal role are defined, and some modified operations in the model are presented. Administration of privileges under MAC policy is done by system automatically. The integrated model can simplify administration of privileges, and is appropriate for multilevel relation database system which has many users or complex security levels. Some implementing mechanisms of the model are provided. Number of references:14 Main heading:Relational database systems Controlled terms:Mathematical models - Network protocols - Security of data Uncontrolled terms:Database security - Integrated models - Mandatory access control - Multilevel databases - Multilevel roles - Privilege administration - Role based access control Classification code:716.1 Information Theory and Signal Processing - 723.2 Data Processing and Image Processing - 723.3 Database Systems - 723.5 Computer Applications - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 163> Accession number:2004418404931 Title:Attack to multisignature schemes based on discrete logarithm Authors:Han, Xiao-Xi (1); Wang, Gui-Lin (1); Bao, Feng (1); Ren, Kui (1) Author affiliation:(1) InfoCommun. Security Dept., Inst. for InfoCommun. Res., Singapore 119613, Singapore; (2) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Han, X.-X. (hxx@ios.ac.cn) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:27 Issue:8 Issue date:August 2004 Publication year:2004 Pages:1147-1152 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:Multisignature is a special kind of digital signature, in these schemes every member of the signing group generates his partial signature for the same message using his own secret, and the multisignature is combined by all these partial signatures. But to verify a multisignature, a verifier only needs to know the unique group public key. Harn and Ji et al. proposed two multi-signature schemes based on discrete logarithm problem. However, Lu et al. found that there was a weakness in these two schemes: If several members collude together, a multisignature of the group can also be viewed as a multisignature generated by honest members. Therefore, if necessary, malicious members would repudiate that they did not sign some multisignatures. To avoid this weakness, Lu et al, proposed two kinds of improvements in the key generation protocols of the two existing multisignature schemes. This paper presents an attack to show that Lu's improved schemes are still insecure. In our attack, a single malicious group member can control the group secret key, who can generate valid multisignature for any message on the behalf of the whole group without the help of other members. At the same time, honest members cannot detect this security flaw in the system, since the group can generate multisignature according to the prescribed protocols. Furthermore, our attack can also be applied to the original two schemes. Abstract type:(Edited Abstract) Number of references:11 Main heading:Public key cryptography Controlled terms:Security of data Uncontrolled terms:Attack - Digital signature - Information security - Multisignature Classification code:723 Computer Software, Data Handling and Applications Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 164> Accession number:2004178124298 Title:A Smart-Card-Enabled Privacy Preserving E-Prescription System Authors:Yang, Yanjiang (1); Han, Xiaoxi (2); Bao, Feng (1); Deng, Robert H. (1) Author affiliation:(1) Institute for Infocomm Research, Singapore 119613; (2) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Yang, Y. (yanjiang@i2r.a-star.edu.sg) Source title:IEEE Transactions on Information Technology in Biomedicine Abbreviated source title:IEEE Trans Inf Technol Biomed Volume:8 Issue:1 Issue date:March 2004 Publication year:2004 Pages:47-58 Language:English ISSN:10897771 CODEN:ITIBFX Document type:Journal article (JA) Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Within the overall context of protection of health care information, privacy of prescription data needs special treatment. First, the involvement of diverse parties, especially nonmedical parties in the process of drug prescription complicates the protection of prescription data. Second, both patients and doctors have privacy stakes in prescription, and their privacy should be equally protected. Third, the following facts determine that prescription should not be processed in a truly anonymous manner: certain involved parties conduct useful research on the basis of aggregation of prescription data that are linkable with respect to either the patients or the doctors; prescription data has to be identifiable in some extreme circumstances, e.g., under the court order for inspection and assign liability. In this paper, we propose an e-prescription system to address issues pertaining to the privacy protection in the process of drug prescription. In our system, patients' smart cards play an important role. For one thing, the smart cards are implemented to be portable repositories carrying up-to-date personal medical records and insurance information, providing doctors instant data access crucial to the process of diagnosis and prescription. For the other, with the secret signing key being stored inside, the smart card enables the patient to sign electronically the prescription pad, declaring his acceptance of the prescription. To make the system more realistic, we identify the needs for a patient to delegate his signing capability to other people so as to protect the privacy of information housed on his card. A strong proxy signature scheme achieving technologically mutual agreements on the delegation is proposed to implement the delegation functionality. Number of references:50 Main heading:Data privacy Controlled terms:Diagnosis - Health care - Insurance - Patient monitoring - Smart cards Uncontrolled terms:E-prescription - Privacy Classification code:461.6 Medicine and Pharmacology - 461.7 Health Care - 722.4 Digital Computers and Systems - 723.2 Data Processing and Image Processing Treatment:Theoretical (THR) DOI:10.1109/TITB.2004.824731 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 165> Accession number:2004198157007 Title:An overview of theories and methods of production scheduling Authors:Xu, Jun-Gang (0); Di, Guo-Zhong (0); Wang, Hong-An (0) Corr. author affiliation:Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:41 Issue:2 Issue date:February 2004 Publication year:2004 Pages:257-267 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Science Press Abstract:Research on theories and methods of production scheduling is an intractable subject, but it is very crucial for improving productivity and benefits in one enterprise or industry, specially in the era of market economy nowadays. It has been more than 50 years since the beginning of the research on theories and methods of production scheduling, but till now there still exists the gap between classical scheduling theories and practical scheduling problems. Considering this characteristic, some existing problems and factors to be addressed in handling practical scheduling problems are specified, various methods for solving production scheduling problems and some typical applications of these methods are listed, and their advantages and disadvantages are also indicated. Finally, several future research trends of production scheduling theories and methods and proposals for the future research work are summarized and presented respectively. Number of references:73 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 166> Accession number:2004498704560 Title:An improved parallel algorithm for finding frequent item-sets Authors:She, Chundong (1); Li, Lei (1); Wang, Hongbing (1); Gao, Bo (2); Deng, Hongqin (2) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Department of Technology, Xichang Satellite Launch Center, Xichang, Sichuan 615000, China Corresponding author:She, C. (shurcd@) Source title:Proceedings - 2004 International Conference on Intelligent Mechatronics and Automation Abbreviated source title:Proc. Int. Conf. Intell. Mechatron. Autom. Monograph title:Proceedings - 2004 International Conference on Intelligent Mechatronics and Automation Issue date:2004 Publication year:2004 Pages:383-386 Language:English ISBN-10:0780387481 ISBN-13:9780780387485 Document type:Conference article (CA) Conference name:Proceedings - 2004 International Conference on Intelligent Mechatronics and Automation Conference date:August 26, 2004 - August 31, 2004 Conference location:Chengdu, China Conference code:63941 Sponsor:IEEE Robotics and Automation Society; IEEE Systems, Man, and Cybernetics Society; IEEE Shikoku Section; National Natural Science Foundation of China; Chinese Institute of Electronics Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Discovery of associations from large-sets becomes increasingly useful in data-mining field. Several sequential and parallel algorithms for discovery of association rules are analyzed in this paper. And based on the efficient FP-growth algorithm without candidacy, its implementation method of constructing the frequent pattern tree and mining frequent item sets is given for the shared memory parallel formulation. However, it becomes less effective due to the imbalance. Therefore, a dynamic mechanism is proposed in this paper to solve the problem successfully. Number of references:17 Main heading:Data mining Controlled terms:Data storage equipment - Decision making - Functions - Parallel algorithms - Problem solving - Set theory Uncontrolled terms:Association rules - Load balance - Shared memory Classification code:722.1 Data Storage, Equipment and Techniques - 723.2 Data Processing and Image Processing - 912.2 Management - 921 Mathematics - 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 167> Accession number:2004198156972 Title:A time-sharing scheduling algorithm based on PID feedback control Authors:Tong, Li-Jing (0); Huai, Xiao-Yong (0); Li, Ming-Shu (0) Corr. author affiliation:Lab. for Internet Software Technol., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:41 Issue:1 Issue date:January 2004 Publication year:2004 Pages:15-21 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Science Press Abstract:Feedback control emerges in real-time operating system scheduling in recent years. In this paper, the idea of feedback control is introduced into time-sharing operating system scheduling, and a PID control based time-sharing operating system scheduling algorithm is proposed. It can adaptively adjust CPU bandwidth to overcome the dynamical uncertainty of CPU utilization and to meet the application specified distribution demands for CPU bandwidth, thus keeping the system performance in the best state. The simulation results illustrate the efficiency of the control mechanism of the PID time-sharing scheduling algorithm. Besides its compatibility with traditional time-sharing scheduling, the scheduling algorithm has good dynamic, static and robust characters with very low scheduling overhead. Number of references:11 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 168> Accession number:2004068008525 Title:Improved differential-linear cryptanalysis of reduced-round SAFER<sup>++</sup> Authors:Zhang, Wentao (1); Qing, Sihan (1); Wu, Wenling (1) Author affiliation:(1) State Key Lab. of Info. Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Engineering Research Center for IST, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Zhang, W. Source title:Chinese Journal of Electronics Abbreviated source title:Chin J Electron Volume:13 Issue:1 Issue date:January 2004 Publication year:2004 Pages:111-115 Language:English ISSN:10224653 CODEN:CHJEEW Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:In this paper we present differential-linear cryptanalysis of SAFER<sup>++</sup> reduced to 4 and 5 rounds. For 4 rounds, we can find 51 key bits of 128-bit master keys, and 67 key bits of 256-bit master keys using 2<sup>38</sup> chosen plaintexts. For 5 rounds, we can find 58 key bits of 128-bit master keys, and 82 key bits of 256-bit master keys using 2<sup>46</sup> chosen plaintexts. All attacks are applicable to a fraction of 2<sup>-6</sup> of the corresponding key space. For 256-bit master keys, the attack complexity are reduced greatly compared with those using linear cryptanalysis for 4-round by Jorge Nakahara and the differential-nonlinear cryptanalysis for 4-round by us. Number of references:10 Main heading:Cryptography Controlled terms:Approximation theory - Calculations - Computational complexity - Mathematical transformations - Matrix algebra - Nonlinear systems - Probability Uncontrolled terms:Differential linear cryptanalysis - Differential nonlinear cryptanalysis - Nonlinear transformation - Psuedo Hadamard transformation Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.5 Computer Applications - 921.1 Algebra - 921.3 Mathematical Transformations - 921.6 Numerical Methods - 922.1 Probability Theory Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 169> Accession number:2005058812559 Title:A formal framework of UML Authors:Zhou, Jin (1); Ma, Yinglong (1); Li, Wei (1); Wu, Zhilin (2) Author affiliation:(1) Technol. Ctr. of Software Eng., Institute of Software, Chinese Academy of Sciences, P.O.Box 8718, Beijing 100080, China; (2) Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, P.O.Box 8718, Beijing 100080, China Corresponding author:Zhou, J. Source title:Proceedings of the International Conference on Software Engineering Research and Practice, SERP'04 Abbreviated source title:Proc. Int. Conf. Softw. Eng. Res. Pract. SERP Volume:1 Monograph title:Proceedings of the International Conference on Software Engineering Research and Practice, SERP'04 Issue date:2004 Publication year:2004 Pages:151-157 Language:English ISBN-10:1932415300 ISBN-13:9781932415308 Document type:Conference article (CA) Conference name:Proceedings of the International Conference on Software Engineering Research and Practice, SERP'04 Conference date:June 21, 2004 - June 24, 2004 Conference location:Las Vegas, NV, United states Conference code:64209 Sponsor:Comput. Sci. Research, Education, and Applications Press (CSREA); International Technology Institute (ITI); Korean Society for Internet Information (KSII); World Academy of Science for Information Technology (WAS) Publisher:CSREA Press Abstract:This paper describes a metrics oriented algebraic representation for UML Class and Sequence diagrams. The paper uses an example to illustrate how to transform between UML graphical and algebraic representations; the transformation serves as the basis of automated generation of algebraic UML during design. The algebraic representation of object-oriented design provides a foundation for design model checking. Number of references:9 Main heading:Software engineering Controlled terms:Computer programming languages - Computer simulation - Error analysis - Metric system - Semantics - Signal processing - Systems analysis Uncontrolled terms:Algebraic representation - Class diagram - Sequence diagrams - Unified modeling language (UML) Classification code:912.3 Operations Research - 903.2 Information Dissemination - 902.2 Codes and Standards - 921.6 Numerical Methods - 723.5 Computer Applications - 723.1 Computer Programming - 716.1 Information Theory and Signal Processing - 723.1.1 Computer Programming Languages Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 170> Accession number:2004508717055 Title:Intrusion detection based on sub-set of system calls Authors:Zhang, Xiang-Feng (1); Sun, Yu-Fang (1); Zhao, Qing-Song (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Zhang, X.-F. (mailofzxf@) Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:32 Issue:8 Issue date:August 2004 Publication year:2004 Pages:1338-1341 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Intrusion detection (ID) techniques are important to intrusion detection systems (IDS). Based on the ID technique using system call sequences, a new detection technique was put forward that uses a subset of system calls (named W-subset). Experiments show that the new technique has low false positive rate, low storage-cost, high computing efficiency and hence is applicable to real-time intrusion detection. Abstract type:(Edited Abstract) Number of references:15 Main heading:Security of data Controlled terms:Calculations - Computer software - Database systems - Feature extraction - Real time systems - Set theory Uncontrolled terms:Anomaly detection - False positive rate - Feature databases - Intrusion detection - System call - W subsets Classification code:722.4 Digital Computers and Systems - 723.1 Computer Programming - 723.2 Data Processing and Image Processing - 723.3 Database Systems - 723.5 Computer Applications - 921 Mathematics Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 171> <RECORD 1> Accession number:2005058812770 Title:Recovery of material under complex illumination conditions Authors:Wu, Enhua (1); Sun, Qimin (1); Liu, Xuehui (4) Author affiliation:(1) Key Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences; (2) Dept. of Computer Science, University of Macau, Macao, China; (3) Dept. of Computer Science, Qufu Normal University, Shandong, China; (4) Key Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China Source title:Proceedings GRAPHITE 2004 - 2nd International Conference on Computer Graphics and Interactive Techniques in Australasia and Southeast Asia Abbreviated source title:Proc. GRAPHITE Int. Conf. Comput. Graph. Interact. Tech. Australas. S. East Asia Monograph title:Proceedings GRAPHITE 2004 - 2nd International Conference on Computer Graphics and Interactive Techniques in Australasia and South East Asia Issue date:2004 Publication year:2004 Pages:39-45 Language:English ISBN-10:1581138849 ISBN-13:9781581138849 Document type:Conference article (CA) Conference name:Proceedings GRAPHITE 2004 - 2nd International Conference on Computer Graphics and Interactive Techniques in Australasia and South East Asia Conference date:June 15, 2004 - June 18, 2004 Conference location:Singapore, Singapore Conference code:64215 Sponsor:ACM SIGGRAPH, Special Interest Group on Graphical Display; Eurographics Association Publisher:Association for Computing Machinery Abstract:To calculate the inter-reflection between real objects and virtual ones in augmented reality, recovery of material for the real objects is necessary. In this paper, an approach is proposed to recover the material properties from a single high dynamic range image for a homogeneous object under complex illumination conditions. By the method, we first acquire a high dynamic range image for the object, and one or a few environment maps in high dynamic range as illumination of the object. Then a simulated annealing algorithm is employed to solve the inverse rendering problem. Finally, we obtain optimal parameter values for the reflection model in approximating the material of the object. In the course of optimization, image-based lighting and ray tracing techniques are used, and as a result the inter-reflection can be calculated in convenience. In addition, the transparent and translucent properties can be also recovered. Number of references:24 Main heading:Lighting Controlled terms:Algorithms - Annealing - Materials handling - Optimization - Problem solving - Virtual reality Uncontrolled terms:High dynamic range image - Image based lighting - Inverse rendering - Reflection models Classification code:921.5 Optimization Techniques - 921 Mathematics - 723.4 Artificial Intelligence - 723 Computer Software, Data Handling and Applications - 707 Illuminating Engineering - 691 Bulk Handling and Unit Loads - 537.1 Heat Treatment Processes Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 172> Accession number:2005169045282 Title:A default extension to distributed description logics Authors:Ma, Yinglong (1); Wei, Jun (1) Author affiliation:(1) Technol. Ctr. of Software Eng., Institute of Software, Chinese Academy of Science, P.O.Box.8718, Beijing 100080, China Corresponding author:Ma, Y. (m_y_long@otcaix.iscas.ac.cn) Source title:Proceedings - IEEE/WIC/ACM International Conference on Intelligent Agent Technology. IAT 2004 Abbreviated source title:Proc. IEEE WIC ACM Int. Conf. Intell. Agent Technol. IAT Monograph title:Proceedings - IEEE/WIC/ACM International Conference on Intelligent Agent Systems. IAT 2004 Issue date:2004 Publication year:2004 Pages:38-44 Language:English ISBN-10:0769521010 ISBN-13:9780769521015 Document type:Conference article (CA) Conference name:Proceedings - IEEE/WIC/ACM International Conference on Intelligent Agent Technology. IAT 2004 Conference date:September 20, 2004 - September 24, 2004 Conference location:Beijing, China Conference code:64530 Sponsor:IEEE Computer Society; Web Intelligence Consortium, WIC; ACM Publisher:IEEE Computer Society Abstract:Description Logic is now an active research area, which is applied universally to knowledge representation, Semantic Web and Ontology language. Compared with Description Logic, Distributed Description Logic can be used to better establish distributed ontologies from distributed information sources. But little attention has been paid to the problem of endowing Distributed Description Logic with default reasoning capabilities to deal with incomplete or conflict information. In this paper we present a default extension to Distributed Description Logics to handle the heterogeneity and incompleteness of different information sources. We extend Distributed Description Logics by adding default information into a distributed knowledge base, and discuss the default satisfiability based on Distributed Description Logics with default rules. To perform default reasoning, a default Tableau algorithm is developed to check satisfiability of complex concepts and subsumption assertions. &copy; 2004 IEEE. Number of references:16 Main heading:Knowledge representation Controlled terms:Algorithms - Computer simulation - Database systems - Distributed computer systems - Knowledge based systems - Search engines - Semantics - World Wide Web Uncontrolled terms:Distributed description logics (DDL) - Ontology language - Polynomial time - Semantic Web Classification code:722.4 Digital Computers and Systems - 723.3 Database Systems - 723.4 Artificial Intelligence - 723.4.1 Expert Systems - 723.5 Computer Applications Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 173> Accession number:2005068825896 Title:Automatic generation of symbolic model for parameterized synchronous systems Authors:Xu, Wei-Wen (1) Author affiliation:(1) Dept. of Comp. Sci. and Engineering, Shanghai Jiaotong University, Shanghai 200030, China; (2) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Xu, W.-W. (xu@lix.polytechnique.fr) Source title:Journal of Computer Science and Technology Abbreviated source title:J Comput Sci Technol Volume:19 Issue:6 Issue date:November 2004 Publication year:2004 Pages:812-819 Language:English ISSN:10009000 CODEN:JCTEEM Document type:Journal article (JA) Publisher:Allerton Press Inc. Abstract:With the purpose of making the verification of parameterized system more general and easier, in this paper, a new and intuitive language PSL (Parameterized-system Specification Language) is proposed to specify a class of parameterized synchronous systems. From a PSL script, an automatic method is proposed to generate a constraint-based symbolic model. The model can concisely symbolically represent the collections of global states by counting the number of processes in a given state. Moreover, a theorem has been proved that there is a simulation relation between the original system and its symbolic model. Since the abstract and symbolic techniques are exploited in the symbolic model, state-explosion problem in traditional verification methods is efficiently avoided. Based on the proposed symbolic model, a reachability analysis procedure is implemented using ANSI C++ on UNIX platform. Thus, a complete tool for verifying the parameterized synchronous systems is obtained and tested for some cases. The experimental results show that the method is satisfactory. Number of references:14 Main heading:Systems science Controlled terms:Computer programming languages - Computer simulation - Constraint theory - Finite automata - Network protocols - Parameter estimation - Theorem proving - UNIX Uncontrolled terms:Formal verification - Parameterized systems - Parameterized-system Specification Language (PSL) - Symbolic representation Classification code:461.1 Biomedical Engineering - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722 Computer Systems and Equipment - 723.1.1 Computer Programming Languages - 723.5 Computer Applications - 731.1 Control Systems Treatment:Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 174> Accession number:2004268236298 Title:Scheduling dynamic real-time tasks with preemption threshold Authors:Jin, Hong (0); Wang, Qiang (0); Wang, Hong-An (0); Dai, Guo-Zhong (0) Corr. author affiliation:Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:41 Issue:3 Issue date:March 2004 Publication year:2004 Pages:393-398 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Science Press Abstract:Scheduling algorithms with preemption threshold collect characteristics of no preemption scheduling and full preemption scheduling. It both decreases the waste of CPU resources caused by excessive random preemptions and guarantees suitable missed deadline percentage and CPU utilization. However, the existing works are basically focused on a determinated task set (i.e., a given number of tasks, fixed priority and a given preemption threshold satisfied a certain condition), and require that different task has a different priority integer. The proposed scheduling algorithm with preemption threshold discussed in this paper relaxes the above limitations, i.e. an uncertain number of tasks, and the priority and its preemption threshold can be dynamically changed during scheduling. Finally, using usual LSF policy as example, simulations with dynamic preemption threshold are given. Results show that the proposed dynamic scheduling algorithm with preemption threshold decreases the missed deadline percentage and increases efficient utilization percentage of CPU greatly for uncertain task set with no fixed priority and preemption threshold. Number of references:9 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 175> Accession number:2004458446418 Title:A dynamic model of multi-agent system Authors:Hu, Shan-Li (1); Shi, Chun-Yi (3) Author affiliation:(1) Dept. of Comp. Sci. and Technology, Fuzhou University, Fuzhou 350002, China; (2) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (3) Dept. of Comp. Sci. and Technology, Tsinghua University, Beijing 100084, China Corresponding author:Hu, S.-L. (husl@fzu.edu.cn) Source title:Proceedings of 2004 International Conference on Machine Learning and Cybernetics Abbreviated source title:Proc. Int. Conf. Mach. Learning Cybernetics Volume:1 Monograph title:Proceedings of 2004 International Conference on Machine Learning and Cybernetics Issue date:2004 Publication year:2004 Pages:183-187 Language:English ISBN-10:0780384032 ISBN-13:9780780384033 Document type:Conference article (CA) Conference name:Proceedings of 2004 International Conference on Machine Learning and Cybernetics Conference date:August 26, 2004 - August 29, 2004 Conference location:Shanghai, China Conference code:63733 Sponsor:IEEE Systems, Man and Cybernetics Techn. Committee; Shanghai Jiao Tong University; Hong Kong Polytechnic University; Int. University of Germany; Hebei University Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:There are two purposes in this paper. First, it presents an approach to designing an agent For adapting to the cooperative requests of the agents in a multi-agent system, we distinguish between the two aspects of underlying attributes of an agent: individual and organizational. And introduce a concept "pairs of roles". The other purpose is to show how to express the behavioral semantics of an agent and a multi-agent system with the "state transition graph". The individual attributes of an agent consist of beliefs and intentions, and for intentions we adopt the "twin-subset semantics" developed by us. While the organizational attributes of an agent consist of "pairs of roles". These compose the state of individual agent and the relations between agents. The state transitions are produced by the behaviors of agents and materialize the dynamic characters of agent and the turn of a multi-agent system. And the behaviors arise from the mental states of agents and the situations. Number of references:10 Main heading:Multi agent systems Controlled terms:Formal logic - Mathematical models - Modal analysis - Semantics - Set theory - Societies and institutions Uncontrolled terms:Distributed artificial intelligence (DAI) - Pair of rules - State transition - Twin-subset semantics Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.5 Computer Applications - 901.1.1 Societies and Institutions - 903.2 Information Dissemination - 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 176> Accession number:2005269178405 Title:Design and initialization algorithm based on modulus maxima of wavelet transform for wavelet neural network Authors:Zhang, Dahai (1); Bi, Yanqiu (1); Bi, Yanbing (2); Sun, Yantao (3) Author affiliation:(1) School of Electrical Engineering, Shandong University, China; (2) Shandong Institute of Light Industry, China; (3) Institute of Software, Chinese Academy of Sciences, China Corresponding author:Zhang, D. (dhzhang@sdu.edu.cn) Source title:2004 International Conference on Power System Technology, POWERCON 2004 Abbreviated source title:Int. Conf. Power Syst. Technol. POWERCON Volume:1 Monograph title:2004 International Conference on Power System Technology, POWERCON 2004 Issue date:2004 Publication year:2004 Pages:897-901 Language:English ISBN-10:0780386108 ISBN-13:9780780386105 Document type:Conference article (CA) Conference name:2004 International Conference on Power System Technology, POWERCON 2004 Conference date:November 21, 2004 - November 24, 2004 Conference location:Singapore Conference code:65033 Sponsor:IEEE Power Engineering Society, PES; Chinese Society of Electrical Engineering, CSEE Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:Wavelet neural network (WNN) has many advantages and it receives wide attention in power system. Based on the problems encountered in application, the paper investigates the defects of WNN. It points out that the characteristics of activation functions of the continuous WNN and the back-propagation (BP) neural network have great differences, while the current continuous WNN uses the random initialization and back-propagation algorithm of BP network. Thus the continuous WNN has poor convergence performance. Referring to the design method of discrete WNN and signal edge detection and reconstruction theory, the paper proposes a design and initialization algorithm for single-input single-output continuous WNN. The novel algorithm utilizes the known data to search the modulus maxima of wavelet transform, then the number of hidden nodes and the initial parameters of continuous WNN can be obtained, which speeds up the training process as well as improves the convergence performance. Case study validates the effectiveness of the proposed method. &copy; 2004 IEEE. Number of references:7 Main heading:Neural networks Controlled terms:Algorithms - Approximation theory - Backpropagation - Convergence of numerical methods - Edge detection - Electric power systems - Fourier transforms - Genetic algorithms - Mathematical models - Set theory - Wavelet transforms Uncontrolled terms:Design and initialization algorithms - Reconstruction theory - Signal edge detection - Wavelet neural networks (WNN) Classification code:706.1 Electric Power Systems - 723.4 Artificial Intelligence - 723.5 Computer Applications - 921.3 Mathematical Transformations - 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 177> Accession number:2004508717064 Title:Research and implementation of the protection mechanism for digital evidence collecting system Authors:Sun, Bo (1); Sun, Yu-Fang (1); Zhang, Xiang-Feng (1); Liang, Bin (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Sun, B. (sunbo@sonata.iscas.ac.cn) Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:32 Issue:8 Issue date:August 2004 Publication year:2004 Pages:1374-1380 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Research regarding Digital Forensic Technologies has become more active with the recent increases in illegal accesses to computer system. Many researchers focus only on the techniques or mechanisms for evidence detecting and evidence analyzing, without considering the security of forensic mechanisms themselves, and the digital evidence can't be protected completely. Based on the analysis of relative researches, secure area is proposed to protect forensic mechanisms from attacking. A mechanism called I-LOMAC has been designed and implemented to evaluate this method. The results demonstrate the advantage in protecting the forensic mechanisms. Number of references:18 Main heading:Computer systems Controlled terms:Client server computer systems - Computer crime - Computer networks - Network protocols - Numerical analysis - Security of data Uncontrolled terms:Digital evidences collecting systems - Digital forensics - Fidelity - Forensic mechanisms - I-LOMAC mechanisms - Integrity Classification code:716 Telecommunication; Radar, Radio and Television - 722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 902.3 Legal Aspects - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 178> Accession number:2004198156971 Title:Enumerating sentences of context free language based on first one in order Authors:Huang, Wen-Ji (0) Corr. author affiliation:Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development Abbreviated source title:Jisuanji Yanjiu yu Fazhan Volume:41 Issue:1 Issue date:January 2004 Publication year:2004 Pages:9-14 Language:Chinese ISSN:10001239 CODEN:JYYFEY Document type:Journal article (JA) Publisher:Science Press Abstract:Enumerating sentences for CFL is often needed in SAQ (specification acquisition system) and some formal proof systems. The current methods are not very efficient and enough. Some of them are limited to deal with specific CFL, like regular CFL. First and last sentences of the same length in order can be found by parsing the productions. Then scanning those strings from first sentence to last sentence in order cover all the sentences of the same length. The scanned strings are determined to be output or skipped by Earley algorithm. Earley algorithm is modified to judge whether a string is the left subword of some sentences of CFL. Two control strategies, reduction and look-ahead are adopted in the scanning process. So the number of those scanned strings are decreased greatly. And good time and space efficiencies can be acquired in practice. Compared with other methods, the method shows some advantages by test data. Number of references:10 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 179> Accession number:2004238193108 Title:Channel state dependent robust TCP/IP header compression for 3G wireless networks Authors:Wu, Yichuan (1); Sun, Limin (1); Zheng, Jianping (1); Huang, Kui (1); Liao, Yong (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Wu, Y. (wyc@iscas.ac.cn) Source title:IEEE International Performance, Computing and Communications Conference, Proceedings Abbreviated source title:IEEE Int Perform Comput Commun Conf Proc Volume:23 Monograph title:23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004 Issue date:2004 Publication year:2004 Pages:141-145 Language:English Document type:Conference article (CA) Conference name:23rd IEEE International Performance, Computing, and Communications Conference, Conference Proceedings, IPCCC 2004 Conference date:April 15, 2004 - April 17, 2004 Conference location:Phoenix, AZ., United states Conference code:62954 Sponsor:IEEE Computer Society Publisher:Institute of Electrical and Electronics Engineers Inc. Abstract:The convergence of mobile technologies and Internet protocols makes "all-IP network" be the actual trend of development for future telecommunication system. In such a system, both wired and wireless parts will be built on a common network platform based on TCP/IP protocol. However, TCP/IP protocol headers are relatively large and need to be compressed to save radio channel bandwidth (the most expensive and scarce resource of the whole wireless system), especially for some services whose payload size is small. In this paper, we propose and analyze a channel state dependent robust TCP/IP header compression algorithm (CSDROHC) for 3G wireless networks. Through adjusting the dimension of Variable Sliding Window (VSW) of W-LSB encoding in header compressor with the accurate estimation of wireless channel state, CSDROHC can achieve the 'good balance of compression ratio and error-resistant robustness for its adaptive use in wireless links. Simulation results are presented to demonstrate the effectiveness of CSDROHC over wireless link. Number of references:16 Main heading:Telecommunication networks Controlled terms:Algorithms - Mobile telecommunication systems - Network protocols - Radio - Robustness (control systems) - Synchronization - Wireless telecommunication systems Uncontrolled terms:Radio channel bandwidth - TCP/IP header compressor - Window-based least significant bits (W-LSB) Classification code:716 Telecommunication; Radar, Radio and Television - 716.3 Radio Systems and Equipment - 723 Computer Software, Data Handling and Applications - 731.1 Control Systems Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 180> Accession number:2005339304190 Title:An improved study of real-time fluid simulation on GPU Authors:Wu, Enhua (1); Liu, Youquan (1); Liu, Xuehui (1) Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China Corresponding author:Wu, E. (ehwu@umac.mo) Source title:Computer Animation and Virtual Worlds Abbreviated source title:Comput. Anim. Virtual Worlds Volume:15 Issue:3-4 Monograph title:The Very Best Papers of CASA 2004 Issue date:July 2004 Publication year:2004 Pages:139-146 Language:English ISSN:15464261 Document type:Journal article (JA) Publisher:John Wiley and Sons Ltd Abstract:Taking advantage of the parallelism and programmability of GPU, we solve the fluid dynamics problem completely on GPU. Different front previous methods, the whole computation is accelerated in our method by packing the scalar and vector variables into four channels of texels. In order to be adaptive to the arbitrary boundary conditions, we group the grid nodes into different types according to their positions relative to obstacles and search the node that determines the value of the current node. Then we compute the texture coordinates offsets according to the type of the boundary condition of each node to determine the corresponding variables and achieve the interaction of flows with obstacles set freely by users. The test results prove the efficiency of our method and exhibit the potential of GPU for general-purpose computations. Copyright &copy; 2004 John Wiley &amp; Sons, Ltd. Number of references:20 Main heading:Real time systems Controlled terms:Boundary conditions - Computational methods - Computer graphics - Computer hardware - Computer programming - Computer simulation Uncontrolled terms:Fluid simulation - GPU - Graphics hardware - NSEs - Programmability Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 722.4 Digital Computers and Systems - 723.1 Computer Programming - 723.5 Computer Applications - 921 Mathematics Treatment:Theoretical (THR) DOI:10.1002/cav.16 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 181> Accession number:2004438424580 Title:Bi-directional convergence ACO for job-shop scheduling Authors:Wang, Chang-Qing (1); Cao, Yun-Fu (1); Dai, Guo-Zhong (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Wang, C.-Q. (wcq@iel.iscas.ac.cn) Source title:Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS Abbreviated source title:Jisuanji Jicheng Zhizao Xitong Volume:10 Issue:7 Issue date:July 2004 Publication year:2004 Pages:820-824 Language:Chinese ISSN:10065911 CODEN:JJZXFN Document type:Journal article (JA) Publisher:CIMS Abstract:To properly and efficiently schedule resources and solve the combinatorial optimization problem, an improved algorithm named Bi-directional Convergence Ant Colony Optimization (ACO) algorithm was proposed. Using the graphic definition of Job-shop problem and the elitist strategy, the Bi-directional Convergence ACO algorithm was designed to improve efficiency and usability of original ACO by different evaporated means. Finally, the Bi-directional Convergence ACO algorithm was tested on a benchmark Job-shop scheduling problem. The performance of the Bi-directional Convergence ACO was also compared with that of the original ACO. The simulation result illustrates that the bi-directional convergence ACO algorithm accelerates the convergence without affecting the temporal and spatial complexity much. Number of references:8 Main heading:Job analysis Controlled terms:Algorithms - Computational complexity - Computer simulation - Convergence of numerical methods - Scheduling Uncontrolled terms:Ant colony optimization - Bidirectional convergence - Job shop scheduling - Temporal and spatial complexity Classification code:723 Computer Software, Data Handling and Applications - 912.2 Management - 913.1 Production Engineering - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 182> Accession number:2005108868809 Title:MIVAS: A multi-modal immersive virtual assembly system Authors:Wan, Huagen (1); Gao, Shuming (1); Peng, Qunsheng (1); Dai, Guozhong (2); Zhang, Fengjun (2) Author affiliation:(1) State Key Lab. of CAD and CG, Zhejiang University; (2) Institute of Software, Chinese Academy of Sciences Source title:Proceedings of the ASME Design Engineering Technical Conference Abbreviated source title:Proc. ASME Des. Eng. Tech. Conf. Volume:4 Monograph title:Proceedings of the ASME Design Engineering Technical Conference and Computers and Information in Engineering Conference 2004: Volume 4: 24th Computers and Information in Engineering Conference Issue date:2004 Publication year:2004 Pages:113-122 Article number:57660 Language:English Document type:Conference article (CA) Conference name:2004 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference Conference date:September 28, 2004 - October 2, 2004 Conference location:Salt Lake City, UT, United states Conference code:64323 Sponsor:ASME, Design Engineering Division; ASME, Computers and Information Engineering Division Publisher:American Society of Mechanical Engineers Abstract:Evaluation and planning of assembly processes in virtual environments have become an active research area in engineering community. However, planning of complex assemblies in virtual environments, especially large-scale virtual environments, is still hindered by limitations like unnatural user interaction, insufficient frame rates, and deficiencies in processing of assembly constraints. In this paper, we present MIVAS, a Multi-modal Immersive Virtual Assembly System. By viewing the virtual assembly system as a finite state machine, we incorporate tracked devices, force feedback dataglove, voice commands, human sounds, fully immersive 4-sided CAVE, together with optimization techniques for both complex assembly models and assembly operations to provide for engineers an intuitive and natural way of assembly evaluation and planning. Testing scenarios on disassembling different components of an intelligent hydraulic excavator are described. Special attention is paid upon such technical issues as interface between CAD packages and the CAVE virtual environment, natural and intuitive user interaction including realistic virtual hand interaction and force feedback, intelligent navigation for assembly operations, and real-time display of complex assemblies. Number of references:54 Main heading:Virtual reality Controlled terms:Assembly - Computer aided design - Constraint theory - Engineers - Interfaces (computer) - Optimization - Planning - Real time systems Uncontrolled terms:Assembly processes - Finite state machine (FSM) - Intelligent navigation - Virtual assembly system Classification code:913.1 Production Engineering - 912.4 Personnel - 912.2 Management - 901.1 Engineering Professional Aspects - 921.5 Optimization Techniques - 723.5 Computer Applications - 722.4 Digital Computers and Systems - 722.2 Computer Peripheral Equipment - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723 Computer Software, Data Handling and Applications Treatment:Literature review (LIT); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 183> Accession number:2004278252555 Title:Agent-based self-adaptive software process model Authors:Zhao, Xin-Pei (1); Li, Ming-Shu (1); Wang, Qing (1); Chan, Keith (2); Leung, Hareton (2) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Dept. of Comp., Hong Kong Polytech. Univ., Hong Kong, Hong Kong Corresponding author:Zhao, X.-P. (xinpei@itechs.iscas.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:3 Issue date:March 2004 Publication year:2004 Pages:348-359 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Traditional software process models are mostly static, mechanical, and passive. Traditional approach requires modeler to determine all the possible conditions the software process will encounter and to define explicitly the solutions into a process model. It lacks the ability to allow further deliberations when the modeled environment changes. This paper presents an Agent-based self-adaptive software process model. In this approach, software process is modeled as peers: process Agents. These software process Agents can adapt themselves to the software process environment and act with initiative and autonomy. When the process environment changes, the process agents can dynamically change their behavior to ensure that the development goal can still be achieved. Number of references:12 Main heading:Software engineering Controlled terms:Adaptive algorithms - Artificial intelligence - Computer aided software engineering - Formal logic - Multi agent systems Uncontrolled terms:Process enactment model - Process specification model - Self adaptive - Software process model Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.4 Artificial Intelligence - 723.5 Computer Applications Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 184> Accession number:2004538760289 Title:Parameter space based multiresolution structure for hybrid rendering Authors:Ji, Jun-Feng (1); Li, Sheng (1); Liu, Xue-Hui (1); Wu, En-Hua (1) Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (2) Dept. of Comp. and Info. Sci., Faculty of Sci. and Technol., Univ. of Macau, Macau, China; (3) Graduate Sch., Chinese Acad. of Sci., Beijing 100039, China Corresponding author:Ji, J.-F. (jjf@ios.ac.cn) Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:10 Issue date:October 2004 Publication year:2004 Pages:1515-1521 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:A novel hybrid multiresolution approach is proposed to efficiently render highly detailed objects based on the respective merits of point-based and polygon-based rendering. Both point and polygon are tightly integrated into the uniform structure of P-Quadtrees, which are constructed from geometry images. While traversing the P-Quadtrees in rendering, the part of surface that faces the viewer can be rendered by coarser quad mesh to reduce the numbers of rendering primitives. The shading details can be enhanced by hardware accelerated normal mapping. The view-dependent LOD (level of detail) selects the finer hierarchy on silhouette, which is rendered by points. The rendering efficiency of large-scale model is greatly improved while the visual effect at both the surfaces and the silhouette is guaranteed. Number of references:18 Main heading:Multispectral scanners Controlled terms:Computer aided design - Computer hardware - Image quality - Mathematical models - Scanning - Trees (mathematics) Uncontrolled terms:Hybrid rendering - Level of detail - Multiresolution structure - Normal mapping - P-Quadtrees nodes - Parameter space - Prepixel lighting - Silhouette fidelity Classification code:722 Computer Systems and Equipment - 723.5 Computer Applications - 741.1 Light/Optics - 741.3 Optical Devices and Systems - 921 Mathematics Treatment:Applications (APP); Theoretical (THR); Experimental (EXP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 185> Accession number:2004338313324 Title:Security flaws in a confirmer signature scheme Authors:Wang, Gui-Lin (1); Qing, Si-Han (2) Author affiliation:(1) Infocomm Security Dept., Inst. for Infocomm Res., 21 Heng Mui Keng Terrace, Singapore 119613, Singapore; (2) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China; (3) Ctr. of Info. Security Technol., Chinese Acad. of Sci., Beijing 100080, China Corresponding author:Qing, S.-H. Source title:Ruan Jian Xue Bao/Journal of Software Abbreviated source title:Ruan Jian Xue Bao Volume:15 Issue:5 Issue date:May 2004 Publication year:2004 Pages:752-756 Language:Chinese ISSN:10009825 CODEN:RUXUEW Document type:Journal article (JA) Publisher:Chinese Academy of Sciences Abstract:Confirmer signatures are different from standard signatures in the sense that without the help and cooperation of a designated confirmer, a verifier cannot determine the validity of a Confirmer signature. But except of the signer, anyone else (including the confirmer) can not generate a valid confirmer signature on behalf of the signer. At the same time, the confirmer cannot cheat verifiers once he is involved in the procedure of signature verification. Furthermore, if it is necessary, the confirmer could convert confirmer signatures into standard ones such that the validity of these converted signatures can be publicly validated. Wang et al. proposed an efficient new confirmer signature scheme based on DSA and RSA, and claimed that their scheme is secure. However, several serious security flaws in their scheme are identified so that their investigation does not succeed. Number of references:13 Main heading:Electronic document identification systems Controlled terms:Algorithms - Calculations - Public key cryptography - Security of data Uncontrolled terms:Confirmer signature - Security flaws - Undeniable signature Classification code:716 Telecommunication; Radar, Radio and Television - 723.2 Data Processing and Image Processing - 723.5 Computer Applications - 911.2 Industrial Economics - 921 Mathematics Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. EI 2005 <RECORD 1> Accession number:2005329290295 Title:Information flow analysis and consistency of multilevel OS and DBMS model Authors:Li, Lan (1); Feng, Deng-Guo (3); Xu, Zhen (3) Author affiliation:(1) School of Information Security Engineering, Shanghai Jiaotong University, Shanghai 200030, China; (2) Key Laboratory of Integrate Administration Technologies for Information Security, Shanghai 200030, China; (3) State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Li, L. Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:28 Issue:7 Issue date:July 2005 Publication year:2005 Pages:1123-1129 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:The security of database system (DBMS) is closely related to security of operation system (OS). Multilevel security DBMS can implement its security functions, such as mandatory access control (MAC), using the mechanisms of multilevel security OS only when the security policy of DBMS not violate the security policy of OS. Information flow analysis is beneficial to understanding the meaning and content of the security policies. The theory of information flow analysis is introduced at first. Before discussing the information flows, the multilevel security OS model and multilevel security DBMS model are presented. Then the information flows allowed in multilevel security OS and multilevel security DBMS are analyzed for the first time. The methods of analysis in OS and DBMS are similar: After concluding the objects that contain information, all the information flows among those objects are discussed according to the operations in the OS and DBMS. Because any object of DBMS can be mapped to one or a group of objects in OS, the category set of DBMS is a subset of the category set of OS. Finally the set of DBMS's information flows is proved consistent with the one of OS's information flows based on the definition of the consistence between two information flow sets. The conclusion guarantees the soundness of implementing mandatory access control of multilevel security DBMS using the mechanisms of multilevel security OS. Number of references:11 Main heading:Security of data Controlled terms:Computer operating systems - Data flow analysis - Database systems - Information analysis - Security systems Uncontrolled terms:Mandatory access control - Multilevel relation model - Multilevel security DBMS - Multilevel security of operation system Classification code:723.1 Computer Programming - 723.2 Data Processing and Image Processing - 723.3 Database Systems - 903.1 Information Sources and Analysis Treatment:Applications (APP) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 2> Accession number:2006279980390 Title:SNOS: design and implementation of an operating system for wireless sensor networks Authors:Sun, Yan (1); Chan, Chun-Chung (3) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Graduate School, Chinese Academy of Sciences, Beijing 100039, China; (3) Department of Computing, The Hong Kong Polytechnic University, Hong Kong, Hong Kong Corresponding author:Sun, Y. (sunyan@itechs.iscas.ac.cn) Source title:Tien Tzu Hsueh Pao/Acta Electronica Sinica Abbreviated source title:Tien Tzu Hsueh Pao Volume:33 Issue:SUPPL. Issue date:December 2005 Publication year:2005 Pages:2485-2492 Language:Chinese ISSN:03722112 CODEN:TTHPAG Document type:Journal article (JA) Publisher:Chinese Institute of Electronics Abstract:Wireless sensor networks (WSNs), as a new class of networked information system, have some unique characteristics. These characteristics present new challenges to the research of operating systems. SNOS (Sensor Network Operating System) operating system for WSNs, proposed in this paper, is designed to aim at the characteristics and requirements of WSNs. This paper introduces the design and architecture of SNOS, system resource mechanism and execution management of SNOS. The paper also presents the simulation of task execution on SNOS and the test of SNOS prototype in coal mine. The design of SNOS offers new idea and reference to the research of operating system for WSNs. Number of references:9 Main heading:Sensors Controlled terms:Architecture - Coal mines - Computer networks - Computer operating systems - Computer simulation - Information retrieval systems - Management - Radio - Resource allocation - Software prototyping Uncontrolled terms:Data aggregation - Networked information systems - Sensor network operating systems - Simulation test - System resources - Wireless sensor networks Classification code:716 Telecommunication; Radar, Radio and Television - 722 Computer Systems and Equipment - 723 Computer Software, Data Handling and Applications - 732.2 Control Instrumentation - 903.3 Information Retrieval and Use - 912.2 Management Treatment:Applications (APP); General review (GEN) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 3> Accession number:2005149028058 Title:A randomized RSA-based partially blind signature scheme for electronic cash Authors:Cao, Tianjie (1); Lin, Dongdai (1); Xue, Rui (1) Author affiliation:(1) State Key Lab. of Info. Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Sch. of Comp. Science and Technology, China Univ. of Mining and Technology, Xuzhou 221008, China Corresponding author:Cao, T. (tjcao@cumt.edu.cn) Source title:Computers and Security Abbreviated source title:Comput Secur Volume:24 Issue:1 Issue date:February 2005 Publication year:2005 Pages:44-49 Language:English ISSN:01674048 CODEN:CPSEDU Document type:Journal article (JA) Publisher:Elsevier Ltd Abstract:Blind signature schemes can yield a signature and message pair whose information does not leak to the signer. However, when blind signatures are used to design e-cash schemes, there are two problems. One is the unlimited growth of the bank's database which keeps all spent e-cashes for preventing double spending. Another problem is that the signer must assure himself that the message contains accurate information such as the face value of the e-cash without seeing it. Partially blind signatures can cope with these problems. In partially blind signatures, the signer can explicitly include some agreed common information such as the expiration date and the face value in the blind signature. Randomized signature schemes can withstand one-more-forgery under the chosen plaintext attack. Based on RSA cryptosystem Fan-Chen-Yeh proposed a randomized blind signature scheme and Chien-Jan-Tseng also proposed a randomized partially blind signature scheme. But, the attacker can remove the randomizing factor from the messages to be signed in these two schemes. The attacker can also change the common information of Chien-Jan-Tseng's partially blind signature. In this paper, we propose a secure randomized RSA-based partially blind signature scheme, and show that the proposed scheme satisfies the blindness and unforgeability properties. We also analyse the computation cost of the proposed scheme. &copy; 2005 Elsevier Ltd. All rights reserved. Number of references:9 Main heading:Electronic document identification systems Controlled terms:Computational methods - Computer crime - Cryptography - Database systems - Electronic commerce - Security of data Uncontrolled terms:Electronic cash - Partially blind signatures - Privacy - Randomization - RSA Classification code:716 Telecommunication; Radar, Radio and Television - 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.2 Data Processing and Image Processing - 723.3 Database Systems - 723.5 Computer Applications Treatment:Theoretical (THR) DOI:10.1016/j.cose.2004.05.008 Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 4> Accession number:2005259171434 Title:Approach to diagnosing a system with structure information Authors:Luan, Shang-Min (1); Dai, Guo-Zhong (1) Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China Corresponding author:Luan, S.-M. (shangmin@iscas.cn) Source title:Jisuanji Xuebao/Chinese Journal of Computers Abbreviated source title:Jisuanji Xuebao Volume:28 Issue:5 Issue date:May 2005 Publication year:2005 Pages:801-808 Language:Chinese ISSN:02544164 CODEN:JIXUDT Document type:Journal article (JA) Publisher:Science Press Abstract:Model-based diagnosis is one of important methods for diagnosing a system. A important problem for this method is to generate the diagnoses. This paper presents an algorithm for computing minimal conflicts by using structure information. The correctness of the algorithm is shown, and the time complexity of the algorithm is also analyzed. Furthermore, a method for generating diagnoses from minimal conflicts is introduced. This paper also introduce an algorithm for computing diagnoses by using structure information. The correctness of the algorithm is also shown. At last, the proposed approach is compared with related works. The algorithms terminate in polynomial time for some special systems. Number of references:20 Main heading:Networks (circuits) Controlled terms:Algorithms - Computational complexity - Diagnosis - Mathematical models - Optimization - Set theory Uncontrolled terms:Diagnosis sets - Fault diagnoses - Minimal conflict sets - Polynomial time - Structure information - Time complexity Classification code:703.1 Electric Networks - 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 - 921.5 Optimization Techniques Treatment:Applications (APP); Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 5> Accession number:2006189846260 Title:Computer search for counterexamples to Wilkie's identity Authors:Zhang, Jian (1) Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China Corresponding author:Zhang, J. (zj@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:3632 LNAI Volume title:Automated Deduction - CADE-20 - 20th International Conference on Automated Deduction, Proceedings Issue date:2005 Publication year:2005 Pages:441-451 Language:English ISSN:03029743 E-ISSN:16113349 ISBN-10:3540280057 ISBN-13:9783540280057 Document type:Conference article (CA) Conference name:20th International Conference on Automated Deduction, CADE-20 Conference date:July 22, 2005 - July 27, 2005 Conference location:Tallinn, Estonia Conference code:67106 Publisher:Springer Verlag Abstract:Tarski raised the High School Problem, i.e., whether a set of 11 identities (denoted by HSI) serves as a basis for all the identities which hold for the natural numbers. It was answered by Wilkie in the negative, who gave an identity which holds for the natural numbers but cannot be derived from HSI. This paper describes some computer searching efforts which try to find a small model of HSI rejecting Wilkie's identity. The experimental results show that such a model has at least 11 elements. Some experiences are reported, and some issues are discussed. &copy; Springer-Verlag Berlin Heidelberg 2005. Number of references:14 Main heading:Search engines Controlled terms:Mathematical models - Number theory - Problem solving - Professional aspects Uncontrolled terms:Computer search - Wilkie's identity Classification code:723 Computer Software, Data Handling and Applications - 723.4 Artificial Intelligence - 901.1 Engineering Professional Aspects - 921 Mathematics Treatment:Theoretical (THR) Database:Compendex Compilation and indexing terms, Copyright 2009 Elsevier Inc. <RECORD 6> Accession number:2005179069639 Title:Method for mobile agent data protection Authors:Tan, Xiang (1); Gu, Yu-Qing (1); Bao, Chong-Ming (1) Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China Corresponding