Title:Role-Based Authorization Constraint with Time Character

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.

()

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

Accession number:2002487244369

Title:Predicate μ-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.

()

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

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

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.

()

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

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.

()

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

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.

()

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

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.

()

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. © 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

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.

()

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

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.

()

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

Accession number:2004148097618