ISTP 2000 ??1 ???12 ? ??: Le, S; Youbing, J; Du, L; Wang ...

Information Management: File concept, Access method, Directory structure, ...... KLOC and Function Point Metric, Cost Estimation Analysis, COCOMO Model, ...... 3g Wireless Networks: 3G W-CDMA (UMTS), 3G CDMA 2000, 3G TD-SCDMA.

part of the document

ISTP 2000
>f:y 1 agÿqQ 12 ag
\O: Le, S; Youbing, J; Du, L; Wang, SF
: Schutze, H; Su, KY
h: Word alignment of English-Chinese bilingual corpus based on chunks
egnúQHrir: PROCEEDINGS OF THE 2000 JOINT SIGDAT CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING AND VERY LARGE CORPORA: 110-116 2000
í: English
e.s{|W: Proceedings Paper
O®h: Joint SIGDAT Conference on Empirical Methods in Natural Language Processing and Very Large Corpora held in Conjunction with the 38th Annual Meeting of the Association-for-Computational-Linguistics
O®åeg: OCT 07-08, 2000
O®0W¹p: Hong Kong, PEOPLES R CHINA
O®^©RFU: Behavior Design Corp.; GroupFire Inc.; Intel China Res Ctr.; LEXIS-NEXIS.
O®;NR¹e: Hong Kong Univ Sci & Technol
\OsQ.Í: word alignment; chunk alignment; bilingual corpus; lexicon extraction
Xd: In this paper, a method for the word alignment of English-Chinese corpus based on chunks is proposed. The chunks of English sentences are identified firstly. Then the chunk boundaries of Chinese sentences are predicted by the translations of English chunks and heuristic information. The ambiguities of Chinese chunk boundaries are resolved by the coterminous words in English chunks. With the chunk aligned bilingual corpus, a translation relation probability is proposed to align words. Finally, we evaluate our system by real corpus and present the experiment results.
0W@W: Chinese Acad Sci, Inst Software, Chinese Informat Proc Ctr, Beijing 100080, Peoples R China
¯\O0W@W: Le, S, Chinese Acad Sci, Inst Software, Chinese Informat Proc Ctr, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 14
«_!k: 2
úQHrFU: ASSOCIATION COMPUTATIONAL LINGUISTICS
úQHrFU0W@W: PO BOX 6090, SOMERSET, NJ 08875 USA
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Interdisciplinary Applications; Linguistics
ISI e.s O÷S: BAP00

--------------------------------------------------------------------------------
>f:y 2 agÿqQ 12 ag
\O: Zhang, YB; Sun, L; Du, L; Sun, Y
: Schutze, H; Su, KY
h: Query translation in Chinese-English cross-language information retrieval
egnúQHrir: PROCEEDINGS OF THE 2000 JOINT SIGDAT CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING AND VERY LARGE CORPORA: 104-109 2000
í: English
e.s{|W: Proceedings Paper
O®h: Joint SIGDAT Conference on Empirical Methods in Natural Language Processing and Very Large Corpora held in Conjunction with the 38th Annual Meeting of the Association-for-Computational-Linguistics
O®åeg: OCT 07-08, 2000
O®0W¹p: Hong Kong, PEOPLES R CHINA
O®^©RFU: Behavior Design Corp.; GroupFire Inc.; Intel China Res Ctr.; LEXIS-NEXIS.
O®;NR¹e: Hong Kong Univ Sci & Technol
Xd: This paper proposed a new query translation method based on the mutual information matrices of terms in the Chinese and English corpora. Instead of looking up a bilingual phrase dictionary, the compositional phrase (the translation of phrase can be derived from the translation of its components) in the query can be indirectly translated via a general-purpose Chinese-English dictionary look-up procedure. A novel selection method for translations of query terms is also presented in detail. Our query translation method ultimately constructs an English query in which each query term has a weight. The evaluation results show that the retrieval performance achieved by our query translation method is about 73% of monolingual information retrieval and is about 28% higher than that of simple word-by-word translation way.
0W@W: Chinese Acad Sci, Inst Software, Chinese Informat Proc Ctr, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, YB, Chinese Acad Sci, Inst Software, Chinese Informat Proc Ctr, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: ASSOCIATION COMPUTATIONAL LINGUISTICS
úQHrFU0W@W: PO BOX 6090, SOMERSET, NJ 08875 USA
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Interdisciplinary Applications; Linguistics
ISI e.s O÷S: BAP00

--------------------------------------------------------------------------------
>f:y 3 agÿqQ 12 ag
\O: Zheng, X; Wu, EH
: Wang, PP
h: An approach of novel view generation from images with depth
egnúQHrir: PROCEEDINGS OF THE FIFTH JOINT CONFERENCE ON INFORMATION SCIENCES, VOLS 1 AND 2: A62-A65 2000
í: English
e.s{|W: Proceedings Paper
O®h: 5th Joint Conference on Information Sciences (JCIS 2000)
O®åeg: FEB 27-MAR 03, 2000
O®0W¹p: ATLANTIC CITY, NJ
O®^©RFU: Assoc Intelligent Machinery.; Machine Intelligent & Fussy Log Lab.; Elsevier Publishing Co, Inc.; Informat Sci Journal.; USA Res Off.
\OsQ.Í: image-based rendering; 3D image warping; sprites; image with depth
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing, Peoples R China
¯\O0W@W: Zheng, X, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: ASSOC INTELLIGENT MACHINERY
úQHrFU0W@W: PO BOX 90291, DURHAM, NC 27708-0291 USA
ISBN: 0-9643456-9-2
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Engineering, Electrical & Electronic
ISI e.s O÷S: BV66Q

--------------------------------------------------------------------------------
>f:y 4 agÿqQ 12 ag
\O: Guan, ZW; Li, Y; Wang, HG; Dai, GZ
: Thomas, P; Gellersen, HW
h: A comparison of free interaction modes for mobile layout system
egnúQHrir: HANDHELD AND UBIQUITOUS COMPUTING, PROCEEDINGS, 1927: 63-71 2000
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Symposium on Handheld and Ubiquitous Computing (HUC 2000)
O®åeg: SEP 25-27, 2000
O®0W¹p: BRISTOL, ENGLAND
O®^©RFU: HP Labs.; Nokia.; BT.; Microsoft.; Appliance Studio Ltd.; Engn & Phys Sci Res Council.
KeyWords Plus: SPEECH
Xd: The interaction mode in a mobile layout system was studied. An evaluation experiment was designed and conducted to compare five interaction modes: single pen-based, pen + voice, pen + keyboard, mouse + voice, mouse + keyboard. Subjects were instructed to fulfill the basic tasks of a layout plan design system, such as locating, shaping the property of, and modifying the coordinate setting of an object. In plan setting, modification time, accuracy rate and subjective preferences a pen-based system proved the best, pen + voice followed. This experiment confirmed that different availability of interaction modes resulted in different interaction efficiency in the mobile layout environment. The experiment also provided information on the possible efficient combination of interaction modes. This paper gives statistical support to indicate that use of pen is preferable to voice in setting and modification procedures in mobile technology.
0W@W: Chinese Acad Sci, Inst Software, Intelligent Engn Lab, Beijing 100080, Peoples R China
¯\O0W@W: Guan, ZW, Chinese Acad Sci, Inst Software, Intelligent Engn Lab, POB 8718, Beijing 100080, Peoples R China.
5uP[®±{0W@W: gzw@imd.cims.edu.cn
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-41093-7
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BT81N

--------------------------------------------------------------------------------
>f:y 5 agÿqQ 12 ag
\O: Guan, ZW; Li, Y; Chen, YD; Dai, GZ
: Tan, T; Shi, YC; Gao, W
h: Heuristic walkthroughs evaluation of pen-based Chinese word edit system (PCWES) usability
egnúQHrir: ADVANCES IN MULTIMODAL INTERFACES - ICMI 2000, PROCEEDINGS, 1948: 488-495 2000
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Multimodal Interfaces (ICMI 2000)
O®åeg: OCT 14-16, 2000
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: Chinese Natl 863 306 Steering Comm.; Nat Sci Fdn China.; CAS Inst Automat, Natl Lab Pattern Recognit.; China Comp Federat.; Beijing Univ Aeronaut & Astronaut.; Tsinghua Univ.; IEEE, Beijing Sect.; Assoc Comp Machinery.
KeyWords Plus: INTERFACES
Xd: An evaluation experiment was conducted to compare four interface styles: Hanwang Fixed Window, Translucent Mobile Single Window, Translucent Mobile Double Window, and No Window. Subjects tested the four styles on a pen based word edit system in free-form mode. The result shows that traditional interface style of the Hanwang Fix Window didn't satisfy the requirement of the nature interaction of the end user. And the TMDW mode are very suitable for user to perform the word processing task, in terms of the task performing time and mean accuracy rate. And the NW is the most nature and promising style, in terms of the subjective preference and the error rate of the performing time and accuracy rate of the experimental data. The experiment also shows that the moving window would influent the accuracy rate of the recognition. This experiment confirmed that a proper employment of interface style could improve the interactive efficiency of word editing systems. Also we give out some useful interface hints to improve the performance of the interface. Our tests for the first time give statistical support to the view that free pen_based interface is meaningful in the nature pen and gesture input of the word edit system.
0W@W: Chinese Acad Sci, Inst Software, Intelligent Engn Lab, Beijing 100080, Peoples R China
¯\O0W@W: Guan, ZW, Chinese Acad Sci, Inst Software, Intelligent Engn Lab, POB 8718, Beijing 100080, Peoples R China.
5uP[®±{0W@W: gzw@imd.cims.edu.cn
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-41180-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BT81T

--------------------------------------------------------------------------------
>f:y 6 agÿqQ 12 ag
\O: Li, Y; Guan, ZW; Chen, YD; Dai, GZ
: Tan, T; Shi, YC; Gao, W
h: Penbuilder: Platform for the development of pen-based user interface
egnúQHrir: ADVANCES IN MULTIMODAL INTERFACES - ICMI 2000, PROCEEDINGS, 1948: 534-541 2000
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Multimodal Interfaces (ICMI 2000)
O®åeg: OCT 14-16, 2000
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: Chinese Natl 863 306 Steering Comm.; Nat Sci Fdn China.; CAS Inst Automat, Natl Lab Pattern Recognit.; China Comp Federat.; Beijing Univ Aeronaut & Astronaut.; Tsinghua Univ.; IEEE, Beijing Sect.; Assoc Comp Machinery.
Xd: Pen-based user interfaces is widely used in mobile computing environment, which provides natural, efficient interaction. It has substantial differences from any previous interface and it is difficult to be implemented. A well-designed platform will improve the development of pen-based user interface. In this paper, the architecture of Pen-Book-Page-Paper is presented, which is extended from the metaphor of Pen-Paper. Penbuilder is a development platform based on this architecture. Pen-based user interface can be constructed from three layers of Penbuilder: modal-primitive layer, task-primitive layer and task layer. Each layer provides different extent supports for flexibility and reusability. The components of the platform are discussed in detail and some properties of the platform are argued. Penbuilder is also compliant for the development of distributed user interface. In the section of discussion, we analyze the platform through task tree. The platform provides full supports for extensibility and new interactive devices can be easily added.
0W@W: Chinese Acad Sci, Inst Software, Intelligent Engn Lab, Beijing 100080, Peoples R China
¯\O0W@W: Li, Y, Chinese Acad Sci, Inst Software, Intelligent Engn Lab, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 6
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-41180-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BT81T

--------------------------------------------------------------------------------
>f:y 7 agÿqQ 12 ag
\O: Wang, MS; Qi, SH; Feng, DG
: Qing, S; Eloff, JHP
h: A simple algorithm for computing several sequences synthesis
egnúQHrir: INFORMATION SECURITY FOR GLOBAL INFORMATION INFRASTRUCTURES, 47: 211-220 2000
NfNh: INTERNATIONAL FEDERATION FOR INFORMATION PROCESSING
í: English
e.s{|W: Proceedings Paper
O®h: 16th International-Federation-for-Information-Processing World Computer Congress (IFIP 2000)/Annual Conference of TC11 (SEC 2000)
O®åeg: AUG 21-25, 2000
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: Int Federat Informat Proc, TC-11.; China Comp Federat.; Chinese Acad Sci, Engn Res Ctr Informat Secur Technol.
\OsQ.Í: module Grobner bases; several sequences synthesis; Buchberger algoruthm
Xd: In this paper, we use module Grobner bases to Compute several sequences synthesis problem. It is a natual generalization of Fitzpatrick's algorithm.
0W@W: Chinese Acad Sci, Inst Software, Engn Res Ctr Informat Secur Technol, Beijing 100080, Peoples R China
¯\O0W@W: Wang, MS, Chinese Acad Sci, Inst Software, Engn Res Ctr Informat Secur Technol, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: KLUWER ACADEMIC PUBLISHERS
úQHrFU0W@W: 101 PHILIP DRIVE, ASSINIPPI PARK, NORWELL, MA 02061 USA
ISSN: 1571-5736
ISBN: 0-7923-7914-4
29 W[&{vegnúQHrir
Tðy)Q: INT FED INFO PROC
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Information Systems; Computer Science, Theory & Methods
ISI e.s O÷S: BR59P

--------------------------------------------------------------------------------
>f:y 8 agÿqQ 12 ag
\O: Zhan, NJ
fNM|âVSO\O: IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY
h: Another formal proof for deadline driven scheduler
egnúQHrir: SEVENTH INTERNATIONAL CONFERENCE ON REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS: 481-485 2000
í: English
e.s{|W: Proceedings Paper
O®h: 7th International Conference on Real Time Computing Systems and Applications
O®åeg: DEC 12-14, 2000
O®0W¹p: CHEJU ISL, SOUTH KOREA
O®^©RFU: Adv Informat Technol Ctr.; Korea Informat Sci Soc.; Informat Processing Soc Japan.; Informat Technol.; IEEE Comp Soc Tech Comm Real Time Syst.; Electr & Telecommun Res Inst.
\OsQ.Í: duration calculus; deadline driven scheduler; correctness
Xd: This paper presents another formal proof for the correctness of the Deadline Driven Scheduler (DDS). This proof is different from Zheng and Zhou's [1], although both are given in tel-ms of Duration Calculus (DC far short) which provides abstraction for random preemption of processor: In the proof of [1], the induction rules of Duration Calculus are heavily applied, brit the intuition of the induction propositions is not obvious. However; this proof is to follow and to formalise the original one developed by Liu and Layland in [2] which relies on many! intuitive facts. Therefore this proof is more intuitive, while it is still formal.
0W@W: UN Univ, Int Inst Software Technol, Comp Sci Lab, Inst Software,Chinese Acad Sci, Beijing 100080, Peoples R China
¯\O0W@W: Zhan, NJ, UN Univ, Int Inst Software Technol, Comp Sci Lab, Inst Software,Chinese Acad Sci, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-0930-4
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Information Systems; Computer Science, Theory & Methods; Engineering, Electrical & Electronic; Telecommunications
ISI e.s O÷S: BR28Q

--------------------------------------------------------------------------------
>f:y 9 agÿqQ 12 ag
\O: Zhang, HY; Sun, JC
: Chen, Z; Ewing, RE; Shi, ZC
h: Domain decomposition preconditioners for non-selfconjugate second order elliptic problems
egnúQHrir: NUMERICAL TREATMENT OF MULTIPHASE FLOWS IN POROUS MEDIA, 552: 409-418 2000
NfNh: LECTURE NOTES IN PHYSICS
í: English
e.s{|W: Proceedings Paper
O®h: International Workshop on Fluid Flow and Transport in Porous Media
O®åeg: AUG 02-06, 1999
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: Natl Nat Sci Fdn China.; Beijing Inst Appl Phys & Computat Math.; Chinese State Key Basic Res Project.; USA Off Res Far E.; USN Off Res Int Field Off Asia.; USAF Asian Off Aerosp Res & Dev.
\OsQ.Í: non-selfconjugate; elliptic equation; domain decomposition; Schur complement; preconditioner
Xd: A non-symmetric interface Schur complement arises from non-selfconjugate second order elliptic problems with domain decomposition methods. The usual numerical methods for solving it axe GMRES, ORTHOMIN, and BICGSTAB, but they take a large amount of computer time and memory. The authors find in this paper that the nonsymmetric Schur complement can in fact be changed into a symmetric one by scaling. Then an efficient preconditioner can be provided by which the preconditioned system can be solved iteratively by a modified PCG method. When the problem is imposed on a rectangular region, the condition number is estimated and is nearly one. Numerical experiments axe also presented. Non-selfconjugate problems arise in mathematical modeling and numerical simulation of fluid flows and transport in porous media.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Zhang, HY, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 6
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0075-8450
ISBN: 3-540-67566-3
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTES PHYS
egne.sux¡pe: 10
f[Ñy{|+R: Physics, Multidisciplinary
ISI e.s O÷S: BS67F

--------------------------------------------------------------------------------
>f:y 10 agÿqQ 12 ag
\O: Lin, HM; Yi, W
: Tiuryn, J
h: A proof system for timed automata
egnúQHrir: FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, 1784: 208-222 2000
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2000)
O®åeg: MAR 25-APR 02, 2000
O®0W¹p: BERLIN, GERMANY
Xd: A proof system for timed automata is presented, based on a CCS-style language for describing timed automata. It consists of the standard monoid laws for bisimulation and a set of inference rules. The judgments of the proof system are conditional equations of the form phi > t = u where phi is a clock constraint and t, u are terms denoting timed automata. It is proved that the proof system is complete for timed bisimulation over the recursion-free subset of the language. The completeness proof relies on the notion of symbolic timed bisimulation. The axiomatisation is also extended to handle an important variation of timed automata where each node is associated with an invariant constraint.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100864, Peoples R China; Uppsala Univ, Dept Comp Sci, Uppsala, Sweden
¯\O0W@W: Lin, HM, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 2
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-67257-5
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 15
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BT06Y

--------------------------------------------------------------------------------
>f:y 11 agÿqQ 12 ag
\O: Lin, HM; Yi, W
: Kapoor, S; Prasad, S
h: A complete axiomatisation for timed automata
egnúQHrir: FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 1974: 277-289 2000
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 20th Conference on Foundations of Software Technology and Theoretical Computer Science
O®åeg: DEC 13-15, 2000
O®0W¹p: NEW DELHI, INDIA
O®^©RFU: IBM India Res Lab.; TCS (TRDDC).; Tata Infotech.; Silicon Automat Syst.; Cadence Design Syst.; IIT Delhi.
KeyWords Plus: REGULAR BEHAVIORS
Xd: In this paper we present a complete proof system for timed automata. It extends our previous axiomatisation of timed bisimulation for the class of loop-free timed automata with unique fixpoint induction. To our knowledge, this is the first algebraic theory for the whole class of timed automata with a completeness result, thus fills a gap in the theory of timed automata. The proof of the completeness result relies on the notion of symbolic timed bisimulation, adapted from the work on value-passing processes.
0W@W: Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100864, Peoples R China; Uppsala Univ, Dept Comp Syst, Uppsala, Sweden
¯\O0W@W: Lin, HM, Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-41413-4
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 13
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BS71L

--------------------------------------------------------------------------------
>f:y 12 agÿqQ 12 ag
\O: Zhang, J
: Tse, TH; Chen, TY
h: Specification analysis and test data generation by solving Boolean combinations of numeric constraints
egnúQHrir: FIRST ASIA-PACIFIC CONFERENCE ON QUALITY SOFTWARE, PROCEEDINGS: 267-274 2000
í: English
e.s{|W: Proceedings Paper
O®h: 1st Asia-Pacific Conference on Quality Software
O®åeg: OCT 30-31, 2000
O®0W¹p: HONG KONG, PEOPLES R CHINA
O®^©RFU: Univ Hong Kong, Software Engn Grp.; Vocat Training Council, Software Technol Ctr.; IEEE, Hong kong Sect, Comp Chapter.; British Comp Soc, Hong Kong Sect.; Software Dioxide QAI.
Xd: In the analysis of state-based requirement specifications and in software test data generation, one often: has to determine the satisfiability of Boolean combinations of numeric constraints. Theoretically this problem is undecidable, and practically many problem instances are very difficult. In this paper, an extension to a Boolean constraint solver is described. The new tool can deal with variables of other types (including the enumerated type, integers and reals). It combines Boolean logic reasoning with linear programming and bound propagation. Non-linear constraints are allowed, but the solving method is incomplete. Experimental results show that the tool can be quite rueful in testing specifications as well as procedural code.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, J, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 22
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-0825-1
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BQ97T

ISTP 2001
>f:y 1 agÿqQ 35 ag
\O: Wang, Q; Lai, XF
fNM|âVSO\O: IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY
h: Requirements management for the incremental development model
egnúQHrir: SECOND ASIA-PACIFIC CONFERENCE ON QUALITY SOFTWARE, PROCEEDINGS: 295-301 2001
í: English
e.s{|W: Proceedings Paper
O®h: 2nd Asia-Pacific Conference on Quality Software
O®åeg: DEC 10-11, 2001
O®0W¹p: HONG KONG, PEOPLES R CHINA
O®^©RFU: City Univ Hong Kong, Dept Comp Sci.; Ctr Software Engn, Sch Informat Technol.; Swinburn Univ Technol.; Informat Technol Serv Dept, Govt Hong Kong.; British Comp Soc, Hong Kong Sect.; Hong Kong Comp Soc.; Hong Kong Inst Engineers Informat Technol Div.; IEEE Hong Kong Sect Comp Soc Chapter.
Xd: Requirements management is a crucial process in software engineering. Nowadays, information technology was applied in many fields of society. The change of the requirements becomes an inevitable fact. But the good quality means the conformance to the customer's requirements. Good and suitable software engineering model and efficient requirements management is required. This paper discusses the method of requirements management for the increment development model, the goal of the management, the structure of data collect, and the metrics of the capability measurement.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Wang, Q, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 8
«_!k: 2
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-1287-9
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Software Engineering; Engineering, Electrical & Electronic
ISI e.s O÷S: BT52P

--------------------------------------------------------------------------------
>f:y 2 agÿqQ 35 ag
\O: Lin, HM
fNM|âVSO\O: IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY
h: Model checking value-passing processes
egnúQHrir: APSEC 2001: EIGHTH ASIA-PACIFIC SOFTWARE ENGINEERING CONFERENCE, PROCEEDINGS: 3-10 2001
í: English
e.s{|W: Proceedings Paper
O®h: 8th Asia-Pacific Software Engineering Conference
O®åeg: DEC 04-07, 2001
O®0W¹p: MACAO, PEOPLES R CHINA
O®^©RFU: Univ Macau.; Off Dev Telecomm & Informat Technol.; UN Univ, Int Inst Software Technol.; Natl Nat Sci Fdn China.; Macau Fdn.; Public Adm & Civil Serv Bur Macau SAR.; Co Telecommun Macau S A R L.; Macau SAR Govt Tourist Off.; Macau Product & Technol Transfer Ctr.; Zhuhai Sci and Technol Comm.; Macau Comp Assoc.
\OsQ.Í: model checking; mu-calculus; value-passing processes; verification algorithms
Xd: 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 fix-points 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.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Lin, HM, Chinese Acad Sci, Inst Software, Comp Sci Lab, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 13
«_!k: 2
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-1408-1
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Software Engineering; Engineering, Electrical & Electronic
ISI e.s O÷S: BT55P

--------------------------------------------------------------------------------
>f:y 3 agÿqQ 35 ag
\O: Zhang, J
fNM|âVSO\O: IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY
h: A path-based approach to the detection of infinite looping
egnúQHrir: SECOND ASIA-PACIFIC CONFERENCE ON QUALITY SOFTWARE, PROCEEDINGS: 88-94 2001
í: English
e.s{|W: Proceedings Paper
O®h: 2nd Asia-Pacific Conference on Quality Software
O®åeg: DEC 10-11, 2001
O®0W¹p: HONG KONG, PEOPLES R CHINA
O®^©RFU: City Univ Hong Kong, Dept Comp Sci.; Ctr Software Engn, Sch Informat Technol.; Swinburn Univ Technol.; Informat Technol Serv Dept, Govt Hong Kong.; British Comp Soc, Hong Kong Sect.; Hong Kong Comp Soc.; Hong Kong Inst Engineers Informat Technol Div.; IEEE Hong Kong Sect Comp Soc Chapter.
Xd: Infinite looping is a common type of program error This paper studies the detection of infinite loops in imperative programs. A sufficient condition is given, which is based on program paths. For a simple loop, if we can establish the infeasibility of certain paths within the loop body, we can conclude that the loop does not terminate. Several examples are given to show the effectiveness of the approach. Its main benefits are that it is accurate and it can be supported by automated tools.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, J, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 1
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-1287-9
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Software Engineering; Engineering, Electrical & Electronic
ISI e.s O÷S: BT52P

--------------------------------------------------------------------------------
>f:y 4 agÿqQ 35 ag
\O: Li, DQ; Feng, DG
fNM|âVSO\O: UWA - UNIV. OF WESTERN AUSTRALIA; UWA - UNIV. OF WESTERN AUSTRALIA
h: A DCT-robust multimedia authentication scheme
egnúQHrir: ANZIIS 2001: PROCEEDINGS OF THE SEVENTH AUSTRALIAN AND NEW ZEALAND INTELLIGENT INFORMATION SYSTEMS CONFERENCE: 59-62 2001
í: English
e.s{|W: Proceedings Paper
O®h: 7th Australian and New Zealand Intelligent Information Systems Conference (ANZIIS 2001)
O®åeg: NOV 18-21, 2001
O®0W¹p: PERTH, AUSTRALIA
O®^©RFU: IEEE.
Xd: In this paper, we analyze a fragile watermark algorithm of Lisa M. Marvel et al and show a security weakness therein. We then show that a fragile watermark could not survive DCT compression as long as the authenticator is constructed from pixel values. After that, a new algorithm is presented, which gets rid of the severe security weakness and the implementation flaw of Lisa M.Marvel et al's method.
0W@W: Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Li, DQ, Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 5
«_!k: 0
úQHrFU: UNIV WESTERN AUSTRALIA
úQHrFU0W@W: NEDLANDS, WA, AUSTRALIA
ISBN: 1-74052-061-0
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Engineering, Biomedical
ISI e.s O÷S: BT72B

--------------------------------------------------------------------------------
>f:y 5 agÿqQ 35 ag
\O: Lin, H; Gao, Q; Ye, DX
: Wu, H; Vaario, J
h: Implementation architecture for group network profile in embedded systems
egnúQHrir: APOC 2001: ASIA-PACIFIC OPTICAL AND WIRELESS COMMUNICATIONS: WIRELESS AND MOBILE COMMUNICATIONS, 4586: 226-235 2001
NfNh: PROCEEDINGS OF THE SOCIETY OF PHOTO-OPTICAL INSTRUMENTATION ENGINEERS (SPIE)
í: English
e.s{|W: Proceedings Paper
O®h: Asia-Pacific Optical and Wireless Communications Conference (APOC 2001)
O®åeg: NOV 12-15, 2001
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: SPIE.; China Opt & Optoelectr Manufacturers Assoc.; Minist Informat Ind.; China Inst Commun.; NEL NTT Electr Corp.; Credit Suisse First Boston Technol Grp.; China Telecom.; Huawei Technologies.; ZTE Corp.; SANY Optilayer Co Ltd.; Dateng Telecom.; Photon Technol.; O Net Commun Ltd.; China Minist Sci & Technol.; Alcatel.; Corning.; Australia Opt Soc.; Beijing Univ Posts & Telecommun.; Korea Assoc Photon Ind Dev.; Optoelectr Ind Dev Assoc.; Optoelectr Ind & Technol Dev Assoc.; Opt Soc India.; Opt Soc Japan.; Opt Soc Korea.; Photon Ind Dev Assoc.; Photon Assoc.; SPIE Asia Pacific Chapters.; SPIE Tech Grp Opt Networks.; Tsinghua Univ.
\OsQ.Í: group network; personal area networks; embedded systems; bluetooth
Xd: Bluetooth Group Network Profile (GNP) plays a key role in Bluetooth to support an ad-hoe 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Lin, H, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 5
«_!k: 0
úQHrFU: SPIE-INT SOC OPTICAL ENGINEERING
úQHrFU0W@W: 1000 20TH ST, PO BOX 10, BELLINGHAM, WA 98227-0010 USA
ISSN: 0277-786X
ISBN: 0-8194-4316-6
29 W[&{vegnúQHrir
Tðy)Q: P SOC PHOTO-OPT INSTRUM ENG
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Information Systems; Engineering, Electrical & Electronic; Optics; Telecommunications
ISI e.s O÷S: BT79A

--------------------------------------------------------------------------------
>f:y 6 agÿqQ 35 ag
\O: Luo, HB; Gao, Q
: Wu, H; Vaario, J
h: The mobile synchronization solutions in Bluetooth wireless technology
egnúQHrir: APOC 2001: ASIA-PACIFIC OPTICAL AND WIRELESS COMMUNICATIONS: WIRELESS AND MOBILE COMMUNICATIONS, 4586: 236-244 2001
NfNh: PROCEEDINGS OF THE SOCIETY OF PHOTO-OPTICAL INSTRUMENTATION ENGINEERS (SPIE)
í: English
e.s{|W: Proceedings Paper
O®h: Asia-Pacific Optical and Wireless Communications Conference (APOC 2001)
O®åeg: NOV 12-15, 2001
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: SPIE.; China Opt & Optoelectr Manufacturers Assoc.; Minist Informat Ind.; China Inst Commun.; NEL NTT Electr Corp.; Credit Suisse First Boston Technol Grp.; China Telecom.; Huawei Technologies.; ZTE Corp.; SANY Optilayer Co Ltd.; Dateng Telecom.; Photon Technol.; O Net Commun Ltd.; China Minist Sci & Technol.; Alcatel.; Corning.; Australia Opt Soc.; Beijing Univ Posts & Telecommun.; Korea Assoc Photon Ind Dev.; Optoelectr Ind Dev Assoc.; Optoelectr Ind & Technol Dev Assoc.; Opt Soc India.; Opt Soc Japan.; Opt Soc Korea.; Photon Ind Dev Assoc.; Photon Assoc.; SPIE Asia Pacific Chapters.; SPIE Tech Grp Opt Networks.; Tsinghua Univ.
\OsQ.Í: Bluetooth; data synchronization; synchronization engine; object store; IrMC; SyncML
Xd: Bluetooth is a new wireless communication protocol, its background and the structure of Bluetooth Profiles, as well as the concept of data synchronization are introduced first, and then Data Synchronization Algorithm and the implementing models according to Bluetooth Synchronization Specification are provided. Finally, problems of the models are analyzed, and the synchronization solution of combining SyncML protocol and Bluetooth is described.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100081, Peoples R China
¯\O0W@W: Luo, HB, Chinese Acad Sci, Inst Software, 4 S 4 St Zhong Guan Cun, Beijing 100081, Peoples R China.
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: SPIE-INT SOC OPTICAL ENGINEERING
úQHrFU0W@W: 1000 20TH ST, PO BOX 10, BELLINGHAM, WA 98227-0010 USA
ISSN: 0277-786X
ISBN: 0-8194-4316-6
29 W[&{vegnúQHrir
Tðy)Q: P SOC PHOTO-OPT INSTRUM ENG
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Information Systems; Engineering, Electrical & Electronic; Optics; Telecommunications
ISI e.s O÷S: BT79A

--------------------------------------------------------------------------------
>f:y 7 agÿqQ 35 ag
\O: Wu, P; Gao, Q
: Wu, H; Vaario, J
h: Incompleteness of Bluetooth protocol conformance test cases
egnúQHrir: APOC 2001: ASIA-PACIFIC OPTICAL AND WIRELESS COMMUNICATIONS: WIRELESS AND MOBILE COMMUNICATIONS, 4586: 266-273 2001
NfNh: PROCEEDINGS OF THE SOCIETY OF PHOTO-OPTICAL INSTRUMENTATION ENGINEERS (SPIE)
í: English
e.s{|W: Proceedings Paper
O®h: Asia-Pacific Optical and Wireless Communications Conference (APOC 2001)
O®åeg: NOV 12-15, 2001
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: SPIE.; China Opt & Optoelectr Manufacturers Assoc.; Minist Informat Ind.; China Inst Commun.; NEL NTT Electr Corp.; Credit Suisse First Boston Technol Grp.; China Telecom.; Huawei Technologies.; ZTE Corp.; SANY Optilayer Co Ltd.; Dateng Telecom.; Photon Technol.; O Net Commun Ltd.; China Minist Sci & Technol.; Alcatel.; Corning.; Australia Opt Soc.; Beijing Univ Posts & Telecommun.; Korea Assoc Photon Ind Dev.; Optoelectr Ind Dev Assoc.; Optoelectr Ind & Technol Dev Assoc.; Opt Soc India.; Opt Soc Japan.; Opt Soc Korea.; Photon Ind Dev Assoc.; Photon Assoc.; SPIE Asia Pacific Chapters.; SPIE Tech Grp Opt Networks.; Tsinghua Univ.
\OsQ.Í: Bluetooth conformance testing; test case; interoperability; extended finite state machine
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100081, Peoples R China
¯\O0W@W: Wu, P, Chinese Acad Sci, Inst Software, 4 S 4 St Zhong Guan Cun, Beijing 100081, Peoples R China.
_(uvÂSe.spe: 4
«_!k: 0
úQHrFU: SPIE-INT SOC OPTICAL ENGINEERING
úQHrFU0W@W: 1000 20TH ST, PO BOX 10, BELLINGHAM, WA 98227-0010 USA
ISSN: 0277-786X
ISBN: 0-8194-4316-6
29 W[&{vegnúQHrir
Tðy)Q: P SOC PHOTO-OPT INSTRUM ENG
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Information Systems; Engineering, Electrical & Electronic; Optics; Telecommunications
ISI e.s O÷S: BT79A

--------------------------------------------------------------------------------
>f:y 8 agÿqQ 35 ag
\O: Xu, C; Zhang, J
: Wu, ZH; Zhuang, YT; He, QM; Zhang, SY; Wei, BG
h: EFSM generation for C programs with functions
egnúQHrir: COMPUTER SCIENCE AND TECHNOLOGY IN NEW CENTURY: 90-94 2001
í: English
e.s{|W: Proceedings Paper
O®h: 6th International Conference for Young Computer Scientists
O®åeg: OCT 23-25, 2001
O®0W¹p: HANGZHOU, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; Zhejiang Univ.; W Lake Exposit.
\OsQ.Í: EFSM; test data generation; recursive functions
Xd: Test data generation in program testing is the process of identifying a suite of test data that satisfy a selected criterion, such as statement coverage or branch coverage. Most existing methods for test data generation are limited to unit testing and may not work for programs with functions. In [1] we present an approach to automated test data generation for unit testing, which is based on extended finite state machines (EFSMs). In order to deal with programs with functions, we extend our work by improving the EFSM generation process. The new approach can eliminate functions in a C program and convert the program into a whole equivalent EFSM. Now the EFSM generator can accept C programs with functions, and its output can be accepted by the EFSM analyzer described in [1].
0W@W: Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Xu, C, Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 1
«_!k: 0
úQHrFU: INTERNATIONAL ACADEMIC PUBLISHERS LTD
úQHrFU0W@W: UNIT 1205, 12 FLOOR, SINO PLAZA, 255 GLOUCESTER ROAD, HONG KONG 00000, CAUSEWAY BAY, PEOPLES R CHINA
ISBN: 7-5062-5181-7
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Hardware & Architecture; Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BT66S

--------------------------------------------------------------------------------
>f:y 9 agÿqQ 35 ag
\O: Zhang, XF; Sun, YF
: Wu, ZH; Zhuang, YT; He, QM; Zhang, SY; Wei, BG
h: Implementation of audit in secure operating system based on CC
egnúQHrir: COMPUTER SCIENCE AND TECHNOLOGY IN NEW CENTURY: 198-201 2001
í: English
e.s{|W: Proceedings Paper
O®h: 6th International Conference for Young Computer Scientists
O®åeg: OCT 23-25, 2001
O®0W¹p: HANGZHOU, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; Zhejiang Univ.; W Lake Exposit.
\OsQ.Í: secure operating system; common criteria; audit
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, XF, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: INTERNATIONAL ACADEMIC PUBLISHERS LTD
úQHrFU0W@W: UNIT 1205, 12 FLOOR, SINO PLAZA, 255 GLOUCESTER ROAD, HONG KONG 00000, CAUSEWAY BAY, PEOPLES R CHINA
ISBN: 7-5062-5181-7
egne.sux¡pe: 2
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Hardware & Architecture; Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BT66S

--------------------------------------------------------------------------------
>f:y 10 agÿqQ 35 ag
\O: Liang, HL; Sun, YF
: Wu, ZH; Zhuang, YT; He, QM; Zhang, SY; Wei, BG
h: Designing and modeling security architecture of a secure operating system
egnúQHrir: COMPUTER SCIENCE AND TECHNOLOGY IN NEW CENTURY: 202-205 2001
í: English
e.s{|W: Proceedings Paper
O®h: 6th International Conference for Young Computer Scientists
O®åeg: OCT 23-25, 2001
O®0W¹p: HANGZHOU, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; Zhejiang Univ.; W Lake Exposit.
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Liang, HL, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 13
«_!k: 0
úQHrFU: INTERNATIONAL ACADEMIC PUBLISHERS LTD
úQHrFU0W@W: UNIT 1205, 12 FLOOR, SINO PLAZA, 255 GLOUCESTER ROAD, HONG KONG 00000, CAUSEWAY BAY, PEOPLES R CHINA
ISBN: 7-5062-5181-7
egne.sux¡pe: 2
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Hardware & Architecture; Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BT66S

--------------------------------------------------------------------------------
>f:y 11 agÿqQ 35 ag
\O: Zhao, QS; Sun, YF
: Wu, ZH; Zhuang, YT; He, QM; Zhang, SY; Wei, BG
h: Configuring role-based access control to enforce Chinese Wall policy
egnúQHrir: COMPUTER SCIENCE AND TECHNOLOGY IN NEW CENTURY: 206-209 2001
í: English
e.s{|W: Proceedings Paper
O®h: 6th International Conference for Young Computer Scientists
O®åeg: OCT 23-25, 2001
O®0W¹p: HANGZHOU, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; Zhejiang Univ.; W Lake Exposit.
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhao, QS, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: INTERNATIONAL ACADEMIC PUBLISHERS LTD
úQHrFU0W@W: UNIT 1205, 12 FLOOR, SINO PLAZA, 255 GLOUCESTER ROAD, HONG KONG 00000, CAUSEWAY BAY, PEOPLES R CHINA
ISBN: 7-5062-5181-7
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Hardware & Architecture; Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BT66S

--------------------------------------------------------------------------------
>f:y 12 agÿqQ 35 ag
\O: Ding, K; Jin, BH
: Wu, ZH; Zhuang, YT; He, QM; Zhang, SY; Wei, BG
h: An object-oriented framework for multilevel transaction recovery
egnúQHrir: COMPUTER SCIENCE AND TECHNOLOGY IN NEW CENTURY: 459-464 2001
í: English
e.s{|W: Proceedings Paper
O®h: 6th International Conference for Young Computer Scientists
O®åeg: OCT 23-25, 2001
O®0W¹p: HANGZHOU, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; Zhejiang Univ.; W Lake Exposit.
KeyWords Plus: DESIGN
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Ding, K, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 13
«_!k: 0
úQHrFU: INTERNATIONAL ACADEMIC PUBLISHERS LTD
úQHrFU0W@W: UNIT 1205, 12 FLOOR, SINO PLAZA, 255 GLOUCESTER ROAD, HONG KONG 00000, CAUSEWAY BAY, PEOPLES R CHINA
ISBN: 7-5062-5181-7
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Hardware & Architecture; Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BT66S

--------------------------------------------------------------------------------
>f:y 13 agÿqQ 35 ag
\O: Cao, JW; Pan, F; Sun, JC; Liu, W
: Qingping, G
h: Large-scale parallel reservoir simulation on distributed memory systems
egnúQHrir: DCABES 2001 PROCEEDINGS: 98-103 2001
í: English
e.s{|W: Proceedings Paper
O®h: International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES 2001)
O®åeg: 2001
O®0W¹p: WUHAN, PEOPLES R CHINA
O®^©RFU: Wuhan Univ Technol.; Int Sci & Technol Cooperat Hubei Prov.; Comp Acad Assoc Hubei Prov.; China Minist Sci & Technol.; China Minist Educ.; Nat Sci Fdn China.
\OsQ.Í: large-scale; parallel reservoir simulation; distributed memory system; preconditioner; Krylov subspace methods; numerical comparison
KeyWords Plus: NONSYMMETRIC LINEAR-SYSTEMS
Xd: Computational efficiency and memory scalability are major subjects in large-scale reservoir simulations. In order to solve large-scale problems within required time, parallel codes running on distributed/shared memory systems are required.
This paper presents a parallel simulator developed especially for distributed memory systems, and some numerical results of test cases on parallel computers are given. Results show that this parallel code behaves satisfactory scalability and computational speedup.
The paper also presents Krylov subspace methods with two types of preconditioners. one based on ILU decomposition and the other based on an iterative algorithm. Numerical tests show that different Krylov subspace methods with an appropriate preconditioner are able to achieve similar performance.
0W@W: Chinese Acad Sci, Inst Software, R&D Ctr Parallel Software, Beijing 100080, Peoples R China
¯\O0W@W: Cao, JW, Chinese Acad Sci, Inst Software, R&D Ctr Parallel Software, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 22
«_!k: 0
úQHrFU: HUBEI SCI TECHNOL PRESS
úQHrFU0W@W: 75 HUANGLI RD, WUHAN 430077, WUCHANG, PEOPLES R CHINA
ISBN: 7-5352-2722-8
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Hardware & Architecture; Computer Science, Theory & Methods; Engineering, Electrical & Electronic
ISI e.s O÷S: BT55R

--------------------------------------------------------------------------------
>f:y 14 agÿqQ 35 ag
\O: Xu, JG; Ye, ZB; Wang, HG; Dai, GH
fNM|âVSO\O: PHOEI; PHOEI; PHOEI
h: Problem Solving Environment for enterprise
egnúQHrir: NEW TRENDS OF INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT IN NEW CENTURY: 760-765 2001
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Modern Industrial Engineering and Engineering Management in New Century
O®åeg: AUG 10-12, 2001
O®0W¹p: TIANJIN, PEOPLES R CHINA
O®^©RFU: China Mech Engn Soc, Ind Engn Inst.; Nat Sci Fdn China.; Amer Inst Ind Engn.; Univ Sci & Technol Hong Kong.; Inst Ind Engineers Hong Kong.; Florida State Univ.; Tianjin Univ Technol.; Tianjin Light Ind Inst.; Tianjin Normal Univ, Econ & Management Sch.; Hebei Univ Technol, Sch Management.; Publishing House Electr Ind.; Logist Engn Inst, CMES.; Prod Engn Inst, CMES.; Inst Ind Engn.; Soc Sypply Chain Management.; Japan Inst Management Assoc.; Tianjin Beirong Investment & Consulting Co, Ltd.; Tianjin Univ, Sch Management.
\OsQ.Í: Enterprise Problem Solving Environment (E-PSE); business process modeling; component; CORBA; scheduling
Xd: Problem Solving Environment, PSE for short, is a relatively new and diverse area of research, and till now it resists simple universally accepted definitions. In brief, PSE is a complete and integrated computing environment in which new application can be constructed, compiled and executed. The main purpose to develop PSE is to relieve scientists and engineers from tedious computer application technologies so that they can devote themselves into researches on new ideologies and technologies of their own field and achieve more advanced research production as soon as possible. PSE for any field will bring immeasurable value for the development of that Field. In this paper, we discuss PSE for enterprise, and bring for-ward the concept of Enterprise PSE, E-PSE for short. Furthermore, we describe the architecture of E-PSE and the process of constructing E-PSE in detail. In addition, we introduce an E-PSE example of process industry: an E-PSE for oil refining enterprise. Finally, we give some conclusions and prospects for E-PSE.
0W@W: Chinese Acad Sci, Intelligent Engn Lab, Inst Software, Beijing, Peoples R China
¯\O0W@W: Xu, JG, Chinese Acad Sci, Intelligent Engn Lab, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: PUBLISHING HOUSE ELECTRONICS INDUSTRY
úQHrFU0W@W: PO BOX 173 WANSHOU ROAD, BEIJING 100036, PEOPLES R CHINA
ISBN: 7-5053-6381-6
egne.sux¡pe: 6
f[Ñy{|+R: Engineering, Industrial; Engineering, Manufacturing; Operations Research & Management Science
ISI e.s O÷S: BT55U

--------------------------------------------------------------------------------
>f:y 15 agÿqQ 35 ag
\O: Qiao, Y; Wang, HA; Zou, B; Fang, T; Dai, GZ
: Arabnia, HR
h: Integrated dynamic scheduling for hard and soft real-time tasks in heterogeneous systems
egnúQHrir: PDPTA'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS: 2076-2082 2001
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2001)
O®åeg: JUN 25-28, 2001
O®0W¹p: LAS VEGAS, NV
O®^©RFU: Comp Sci Res Educ & Applicat Press.; Int Technol Inst.; Korea Informat Processing Soc.; World Acad Sci Informat Technol.; PACT Corp.
\OsQ.Í: heterogeneous systems; hard real-time; soft real time; dynamic scheduling; backtracks
Xd: Real-time heterogeneous systems are used widely in recent years. however, few algorithms were proposed to deal with integrated dynamic scheduling for hard and soft aperiodic algorithm is presented to dynamically schedule the task sets combining hard and soft real-time tasks in heterogeneous systems. The proposed algorithm tries to achieve a high scheduling success ratio for hard real-time tasks while guaranteeing the quality of service for soft real-time tasks as possible. Simulation results show that the scheduling success ratio of our algorithm is much higher than that of myopic algorithm, which is used as a baseline algorithm in simulations for a variety of task parameters.
0W@W: Chinese Acad Sci, Intelligent Engn Lab, Inst Software, Beijing 10080, Peoples R China
¯\O0W@W: Qiao, Y, Chinese Acad Sci, Intelligent Engn Lab, Inst Software, POB 8718, Beijing 10080, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: C S R E A PRESS
úQHrFU0W@W: 115 AVALON DR, ATHENS, GA 30606 USA
ISBN: 1-892512-71-8
egne.sux¡pe: 3
f[Ñy{|+R: Computer Science, Hardware & Architecture; Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BT77Y

--------------------------------------------------------------------------------
>f:y 16 agÿqQ 35 ag
\O: Zhao, MZ; Li, MS
: Shen, W; Lin, Z; Barthes, JP; Kamel, M
h: T.120/H.32x-based multimedia conferencing design
egnúQHrir: PROCEEDINGS OF THE SIXTH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN: 146-148 2001
í: English
e.s{|W: Proceedings Paper
O®h: 6th International Conference on Computer Supported Cooperative Work in Design
O®åeg: JUL 12-14, 2001
O®0W¹p: LONDON, CANADA
O®^©RFU: Natl Res Council Canada.; IEEE Canada.; IEEE London Canada Sect.; Univ Western Ontario.; Univ Waterloo.
Xd: Multimedia conferencing technology is becoming increasingly important, as it enables people who are located in different cities (or countries) to share as well as interact with their data, comments, images, and video pictures. This paper introduces the multimedia conferencing standards, such as ITU-T T.120, T.130, H.320, H.323, and H.324, which comprise the core technologies for multimedia conferencing. The paper discusses interoperability and compatibility issues which arise from the deployment of different vendor applications. The paper also presents a proposed multimedia conferencing system with H.32X standard capabilities, which is designed to facilitate interoperability and compatibility between different platforms.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Zhao, MZ, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 2
«_!k: 0
úQHrFU: NATL RESEARCH COUNCIL CANADA
úQHrFU0W@W: BUILDING M-55, OTTAWA, ON KIA OR6, CANADA
ISBN: 0-660-18493-1
egne.sux¡pe: 3
f[Ñy{|+R: Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods; Engineering, Electrical & Electronic
ISI e.s O÷S: BT51H

--------------------------------------------------------------------------------
>f:y 17 agÿqQ 35 ag
\O: Ma, CX; Wang, HG; Dai, GZ
: Shen, W; Lin, Z; Barthes, JP; Kamel, M
h: Research on network based conceptual design
egnúQHrir: PROCEEDINGS OF THE SIXTH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN: 232-235 2001
í: English
e.s{|W: Proceedings Paper
O®h: 6th International Conference on Computer Supported Cooperative Work in Design
O®åeg: JUL 12-14, 2001
O®0W¹p: LONDON, CANADA
O®^©RFU: Natl Res Council Canada.; IEEE Canada.; IEEE London Canada Sect.; Univ Western Ontario.; Univ Waterloo.
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Intelligent Engn Lab, Beijing 100080, Peoples R China
¯\O0W@W: Ma, CX, Chinese Acad Sci, Inst Software, Intelligent Engn Lab, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 6
«_!k: 0
úQHrFU: NATL RESEARCH COUNCIL CANADA
úQHrFU0W@W: BUILDING M-55, OTTAWA, ON KIA OR6, CANADA
ISBN: 0-660-18493-1
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods; Engineering, Electrical & Electronic
ISI e.s O÷S: BT51H

--------------------------------------------------------------------------------
>f:y 18 agÿqQ 35 ag
\O: Dong, Y; Li, MS
fNM|âVSO\O: IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY
h: A risk-driven design model for embedded system
egnúQHrir: SECOND ASIA-PACIFIC CONFERENCE ON QUALITY SOFTWARE, PROCEEDINGS: 204-208 2001
í: English
e.s{|W: Proceedings Paper
O®h: 2nd Asia-Pacific Conference on Quality Software
O®åeg: DEC 10-11, 2001
O®0W¹p: HONG KONG, PEOPLES R CHINA
O®^©RFU: City Univ Hong Kong, Dept Comp Sci.; Ctr Software Engn, Sch Informat Technol.; Swinburn Univ Technol.; Informat Technol Serv Dept, Govt Hong Kong.; British Comp Soc, Hong Kong Sect.; Hong Kong Comp Soc.; Hong Kong Inst Engineers Informat Technol Div.; IEEE Hong Kong Sect Comp Soc Chapter.
Xd: Embedded system is becoming a hot issue for a lot of appliances. However, the development of embedded systems faces the challenge of high risks from market pressures and lack of domain expertise. In this paper, we introduce a risk-driven model for embedded system developing. Driven by risk evaluation, the model guides the embedded system developing in a module-based approach. Moreover, a risk evaluation framework composing of three-dimension metrics is provided with the model to address and track the development risk, including metrics for economy, personnel and technology. A case study is provided to demonstrate how the model and framework are applied.
0W@W: Chinese Acad Sci, Inst Software, Internet Software Technol Lab, Beijing 100864, Peoples R China
¯\O0W@W: Dong, Y, Chinese Acad Sci, Inst Software, Internet Software Technol Lab, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 5
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-1287-9
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Software Engineering; Engineering, Electrical & Electronic
ISI e.s O÷S: BT52P

--------------------------------------------------------------------------------
>f:y 19 agÿqQ 35 ag
\O: Li, C; Li, HZ; Li, MS
fNM|âVSO\O: IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY
h: A software factory model based on ISO9000 and CMM for Chinese small organizations
egnúQHrir: SECOND ASIA-PACIFIC CONFERENCE ON QUALITY SOFTWARE, PROCEEDINGS: 288-292 2001
í: English
e.s{|W: Proceedings Paper
O®h: 2nd Asia-Pacific Conference on Quality Software
O®åeg: DEC 10-11, 2001
O®0W¹p: HONG KONG, PEOPLES R CHINA
O®^©RFU: City Univ Hong Kong, Dept Comp Sci.; Ctr Software Engn, Sch Informat Technol.; Swinburn Univ Technol.; Informat Technol Serv Dept, Govt Hong Kong.; British Comp Soc, Hong Kong Sect.; Hong Kong Comp Soc.; Hong Kong Inst Engineers Informat Technol Div.; IEEE Hong Kong Sect Comp Soc Chapter.
Xd: With the concepts and practices of Software Factory all over the world, the paper proposes a general Software Factory Model (SFM). The model is presented through a static view and a dynamic view. Based on the general model and the specific situation of Chinese small organizations. a customized model, Software Factory Model-Chinese Small Organizations (SFM-CSO), is presented. Furthermore, an implementation of SFM-CSO based on ISO9000 and CMM (SFM-CSO [ISO/CMM]) is introduced. providing a practical guidance for Chinese small organizations to improve software product quality and productivity by adopting software factory concept.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100864, Peoples R China
¯\O0W@W: Li, C, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 17
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-1287-9
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Software Engineering; Engineering, Electrical & Electronic
ISI e.s O÷S: BT52P

--------------------------------------------------------------------------------
>f:y 20 agÿqQ 35 ag
\O: Hu, KY; Sui, YF; Wang, J; Lu, YC
: Callaos, N; DaSilva, IN; Molero, J
h: Rough set theory under the similarity relations
egnúQHrir: WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL 1, PROCEEDINGS - INFORMATION SYSTEMS DEVELOPMENT : 405-409 2001
í: English
e.s{|W: Proceedings Paper
O®h: 5th World Multi-Conference on Systemics, Cybernetics and Informatics (SCI2001)/7th International Conference on Information Systems Analysis and Synthesis (ISAS 2001)
O®åeg: JUL 22-25, 2001
O®0W¹p: ORLANDO, FL
O®^©RFU: Int Inst Informat & System.; IEEE Comp Soc, Venezuela Chapter.; World Org System & Cybernet.; Ctr Syst Studies.; Syst Soc Poland.; Soc Appl Syst Res.; Slovenian Artificial Intelligence Soc.; Simon Bolivar Univ.; Polish Syst Soc.; Italian Soc System.; Int Soc Syst Sci.; Int Syst Inst.; IEEE Latin Amer.; Int Federat Syst Res.; Cybernet & Human Knowing.; Tunisian Sci Soc.
\OsQ.Í: rough set; similarity relation; multivalued table; multi-table database
KeyWords Plus: UNCERTAINTY; DATABASES
Xd: In this paper we present a framework to mining the multi-valued table and multi-table databases. The framework is based on the rough set theory under the similarity relations. we show how to use the rough set theory under similarity relations to solve the problems in multi-valued table and multi-table databases mining, corresponding to those in one-valued table and one table mining.
0W@W: Tsing Hua Univ, Dept Comp Sci, Beijing 100084, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Hu, KY, Tsing Hua Univ, Dept Comp Sci, Beijing 100084, Peoples R China.
_(uvÂSe.spe: 6
«_!k: 0
úQHrFU: INT INST INFORMATICS & SYSTEMICS
úQHrFU0W@W: 14269 LORD BARCLAY DR, ORLANDO, FL 32837 USA
ISBN: 980-07-7541-2
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Software Engineering
ISI e.s O÷S: BU36Z

--------------------------------------------------------------------------------
>f:y 21 agÿqQ 35 ag
\O: Sui, YF; Wang, J; Jiang, YC
: Callaos, N; DaSilva, IN; Molero, J
h: The entropy of rough relations in rough relational databases
egnúQHrir: WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL 1, PROCEEDINGS - INFORMATION SYSTEMS DEVELOPMENT : 566-570 2001
í: English
e.s{|W: Proceedings Paper
O®h: 5th World Multi-Conference on Systemics, Cybernetics and Informatics (SCI2001)/7th International Conference on Information Systems Analysis and Synthesis (ISAS 2001)
O®åeg: JUL 22-25, 2001
O®0W¹p: ORLANDO, FL
O®^©RFU: Int Inst Informat & System.; IEEE Comp Soc, Venezuela Chapter.; World Org System & Cybernet.; Ctr Syst Studies.; Syst Soc Poland.; Soc Appl Syst Res.; Slovenian Artificial Intelligence Soc.; Simon Bolivar Univ.; Polish Syst Soc.; Italian Soc System.; Int Soc Syst Sci.; Int Syst Inst.; IEEE Latin Amer.; Int Federat Syst Res.; Cybernet & Human Knowing.; Tunisian Sci Soc.
\OsQ.Í: rough sets; relational database; entropy; information; approximation space
KeyWords Plus: UNCERTAINTY
Xd: Beaubouef, T., Petry, F.E. and Arora, G. gave three definitions of the entropy of rough relations to measure the uncertainty of rough sets in the rough set theory or rough relations in the rough relational database: the rough entropy, the rough schema entropy and the rough relation entropy. We shall prove that three kinds of the entropy decrease when the equivalence relation or the rough relation is refined.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Sui, YF, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: INT INST INFORMATICS & SYSTEMICS
úQHrFU0W@W: 14269 LORD BARCLAY DR, ORLANDO, FL 32837 USA
ISBN: 980-07-7541-2
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Software Engineering
ISI e.s O÷S: BU36Z

--------------------------------------------------------------------------------
>f:y 22 agÿqQ 35 ag
\O: Liu, R; Hong, XL; Dong, SQ; Cai, YC; Gu, J
: TingAo, T; Huihua, Y; Wang, A; Cheng, CK
h: VLSI/PCB placement with predefined coordinate alignment constraint based on sequence pair
egnúQHrir: 2001 4TH INTERNATIONAL CONFERENCE ON ASIC PROCEEDINGS: 167-170 2001
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Conference on ASIC
O®åeg: OCT 23-25, 2001
O®0W¹p: SHANGHAI, PEOPLES R CHINA
O®^©RFU: Chinese Inst Electr.; IEEE Beijing Sect.; Natl Nat Sci Fdn China.; Shanghai Municipal Sci & Technol Commiss.
Xd: In the system on a chip, some cells should be placed along a predefined coordinate within a relative small region. This constraint 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Liu, R, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-6677-8
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Information Systems; Engineering, Electrical & Electronic; Telecommunications
ISI e.s O÷S: BU56Q

--------------------------------------------------------------------------------
>f:y 23 agÿqQ 35 ag
\O: Lei, YX; Cao, CG; Sui, YF
: Zhong, YX; Cui, S; Wang, Y
h: Based-CR knowledge interconnection in national knowledge infrastructure
egnúQHrir: 2001 INTERNATIONAL CONFERENCES ON INFO-TECH AND INFO-NET PROCEEDINGS, CONFERENCE A-G - INFO-TECH & INFO-NET: A KEY TO BETTER LIFE : C134-C139 2001
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Info-Tech and Info-Net (ICII 2001)
O®åeg: OCT 29-NOV 01, 2001
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: China Assoc Sci & Technol.; IEEE Beijing Ctr.; ATM Forume.; Beijing Internet Inst.; IEEE Communicat Soc.; IEEE Comp Soc.; IEEE Control Soc.; Global Informat Infrastruct Commiss.; World Federat Engn Org.; Int Federat Informat Proc.; Internet Engn Task Force.; Int Council Comp Commun.; Chinese Inst Electr.; Beijing Univ Posts & Telecommunicat.
\OsQ.Í: CR-model; knowledge interconnection; formal semantic relations; NKI hierarchical concept graph
Xd: Knowledge processing is an important research field in AI. A lot of practices have proved that it is necessary for computer to really realize intelligence to has enough knowledge (i.e. knowledge base) and interconnections among knowledge. Otherwise, Johnson has advanced a famous three stages knowledge acquisition model, and means that knowledge is not isolated but mutally relevant. These sufficiently show that it is necessary and feasible to research knowledge interconnection in knowledge processing. In the paper, we firstly introduced CR(concept-relation)-model and hierarchical concept graph(HCG), and then deeply research knowledge interconnection in National Knowledge Infrastructure(NKI).
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Lei, YX, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 7-900081-58-5
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Software Engineering; Engineering, Electrical & Electronic; Remote Sensing; Telecommunications
ISI e.s O÷S: BU94X

--------------------------------------------------------------------------------
>f:y 24 agÿqQ 35 ag
\O: Liu, WM; Ma, HD
: Shum, HY; Liao, M; Chang, SF
h: Modeling video-on-demand system in temporal logic
egnúQHrir: ADVANCES IN MUTLIMEDIA INFORMATION PROCESSING - PCM 2001, PROCEEDINGS, 2195: 983-988 2001
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd IEEE Pacific Rim Conference on Multimedia
O®åeg: OCT 22-24, 2001
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: IEEE Circuits & Syst Soc.; IEEE Signal Processing Soc.; China Comp Fdn.; China Soc Image & Graph.; Microsoft.; Legend.; GE.; Intel.; Microsoft Res.; Tsinghua Univ.; Natl Nat Sci Fdn China.
Xd: Based on the temporal logic language XYZ, this paper proposes a specification model of Video-on-Demand (VoD) system. By this model, we specify the behaviors of VoD system and discusses the features of VoD system. The advantages of this method are formal, and easy to transform the specification into implementable code.
0W@W: Beijing Univ Posts & Telecommun, Coll Comp Sci & Technol, Beijing 100876, Peoples R China; Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Liu, WM, Beijing Univ Posts & Telecommun, Coll Comp Sci & Technol, Beijing 100876, Peoples R China.
_(uvÂSe.spe: 8
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-42680-9
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BT88V

--------------------------------------------------------------------------------
>f:y 25 agÿqQ 35 ag
\O: Qiao, Y; Wang, HG; Dai, GZ
: Kleinjohann, B
h: A new dynamic scheduling algorithm for real-time multiprocessor systems
egnúQHrir: ARCHITECTURE AND DESIGN OF DISTRIBUTED EMBEDDED SYSTEMS, 61: 173-182 2001
NfNh: INTERNATIONAL FEDERATION FOR INFORMATION PROCESSING
í: English
e.s{|W: Proceedings Paper
O®h: IFIP WG10 3/WG10 4/WG10 5 International Workshop on Distributed and Parallel Embedded Systems (DIPES 2000)
O®åeg: OCT 18-19, 2000
O®0W¹p: ERINGERFELD, GERMANY
O®^©RFU: IFIP WG 10 3.; IFIP WG 10 4.; IFIP WG 10 5.; Gesell Informatik.
\OsQ.Í: Multiprocessor; real-time systems; dynamic scheduling; scheduling success ratio; backtracks
Xd: Real-time systems require both functionally correct executions and results that are produced in time. Thus, the scheduling algorithm is an important component of these systems. Several dynamic scheduling algorithms for real-time multiprocessor systems using heuristic approaches such as famous myopic algorithm and its variations have been proposed. However, the task assignment policies used by all these scheduling algorithms hinder the improvement of the scheduling success ratio. In this paper, we propose a new dynamic scheduling algorithm, called "thrift algorithm", for real-time multiprocessor systems. By using a new task assignment policy in this algorithm, thrift algorithm improves the scheduling success ratio successfully. To study the effectiveness of thrift algorithm, we have conducted extensive simulation studies and compared its scheduling success ratio with that of myopic algorithm when several task parameters are changed. Simulation results demonstrate that the scheduling success ratio of thrift algorithm is superior to that of myopic algorithm.
0W@W: Chinese Acad Sci, Inst Software, Intelligent Engn Lab, Beijing 100080, Peoples R China
¯\O0W@W: Qiao, Y, Chinese Acad Sci, Inst Software, Intelligent Engn Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 4
«_!k: 0
úQHrFU: KLUWER ACADEMIC PUBLISHERS
úQHrFU0W@W: 101 PHILIP DRIVE, ASSINIPPI PARK, NORWELL, MA 02061 USA
ISSN: 1571-5736
ISBN: 0-7923-7345-6
29 W[&{vegnúQHrir
Tðy)Q: INT FED INFO PROC
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Information Systems; Computer Science, Theory & Methods
ISI e.s O÷S: BS33V

--------------------------------------------------------------------------------
>f:y 26 agÿqQ 35 ag
\O: Zheng, X; Wu, EH
fNM|âVSO\O: IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY
h: Efficient 3D image warping for composing novel views
egnúQHrir: COMPUTER GRAPHICS INTERNATIONAL 2001, PROCEEDINGS: 123-130 2001
í: English
e.s{|W: Proceedings Paper
O®h: 19th Computer Graphics International Conference
O®åeg: JUL 03-06, 2001
O®0W¹p: KOWLOON, PEOPLES R CHINA
O®^©RFU: Comp Graph Soc.; IEEE Hong Kong Comp Chapter.; KC Wong Educ Fda.; Hong Kong Pei Hua Educ Fdn.
O®;NR¹e: CITY UNIV HONG KONG
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Zheng, X, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-1007-8
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Software Engineering; Engineering, Electrical & Electronic; Imaging Science & Photographic Technology
ISI e.s O÷S: BS56L

--------------------------------------------------------------------------------
>f:y 27 agÿqQ 35 ag
\O: Zhang, PH; Sun, YF
fNM|âVSO\O: IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY
h: A new approach based on mobile agents to network fault detection
egnúQHrir: 2001 INTERNATIONAL CONFERENCE ON COMPUTER NETWORKS AND MOBILE COMPUTING, PROCEEDINGS: 229-234 2001
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Conference on Computer Networks and Mobile Computing
O®åeg: OCT 16-19, 2001
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: IEEE Comp Soc, Beijing Ctr.; China Comp Federat.; IEEE Comp Soc Tech Comm Distributed Proc.
Xd: As networks become larger and more complex, the need for advanced fault management capabilities becomes critical. Faults are unavoidable in large and complex communication networks, but quick detection and identification can significantly improve network reliability. Packet monitoring has become a standard technique in network fault detection, but when applied to a large-scale network yields a high volume of packets. To overcome this problem, some techniques are proposed. However the proposed techniques are based on popular SNMP agent, RMON technology, which are characterized by centralization, they do not provide strong scalability and local processing ability. In this paper we present an intelligent mobile agent-based approach to deal with the problem of network fault detection and implemented it by using java technology and aglet which is a mobile agent system from IBM. Experiment results show the proposed approach is very effective in network fault detection.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, PH, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 13
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-1381-6
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Hardware & Architecture; Computer Science, Information Systems; Engineering, Electrical & Electronic
ISI e.s O÷S: BT18V

--------------------------------------------------------------------------------
>f:y 28 agÿqQ 35 ag
\O: Shi, WC; Sun, YF
fNM|âVSO\O: IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY
h: An investigation of CC's contribution to confidence in security
egnúQHrir: 2001 INTERNATIONAL CONFERENCE ON COMPUTER NETWORKS AND MOBILE COMPUTING, PROCEEDINGS: 333-338 2001
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Conference on Computer Networks and Mobile Computing
O®åeg: OCT 16-19, 2001
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: IEEE Comp Soc, Beijing Ctr.; China Comp Federat.; IEEE Comp Soc Tech Comm Distributed Proc.
Xd: To facilitate the availability of commercial computer products with sufficient security, excellent evaluation criteria have to be of the potential to drive the course of the security marketplace. The newness and the lack of experiences in the exercise of the Common Criteria (CC), which was adopted in 1999 as an international standard for security product evaluation, make it imperative that efforts be exerted to investigate the prospective influence of the CC in advancing the state of computer security. This paper casts light on the contribution of the CC to establishing confidence in security, which is still a barren land in need of cultivation. A picture of the process of the work to produce a security product is outlined. The roles each parts of the work may play in obtaining confidence are examined. In practice, a research experiment is carried out aiming at building a secure operating system, in accordance with the CC philosophy.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Shi, WC, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-1381-6
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Hardware & Architecture; Computer Science, Information Systems; Engineering, Electrical & Electronic
ISI e.s O÷S: BT18V

--------------------------------------------------------------------------------
>f:y 29 agÿqQ 35 ag
\O: Liang, HL; Sun, YF
fNM|âVSO\O: IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY
h: Enforcing mandatory integrity protection in operating system
egnúQHrir: 2001 INTERNATIONAL CONFERENCE ON COMPUTER NETWORKS AND MOBILE COMPUTING, PROCEEDINGS: 435-440 2001
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Conference on Computer Networks and Mobile Computing
O®åeg: OCT 16-19, 2001
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: IEEE Comp Soc, Beijing Ctr.; China Comp Federat.; IEEE Comp Soc Tech Comm Distributed Proc.
Xd: It is functionality other than security that was put in the first place when most systems and applications were built. The threats brought by Internet connectivity, downloaded code and loaded modules are obvious and dangerous and requires a kind of reliable integrity protection. In this paper we present our mandatory integrity protection(RS-MIP) building in a secure Linux operating system kernel. We describe the security policy and integrity model on which RS-MIP is based, its underlying implementation technology. In the end we compare it to other security protection approaches.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Liang, HL, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-1381-6
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Hardware & Architecture; Computer Science, Information Systems; Engineering, Electrical & Electronic
ISI e.s O÷S: BT18V

--------------------------------------------------------------------------------
>f:y 30 agÿqQ 35 ag
\O: Zhang, B; Xu, C; Cheung, SC
fNM|âVSO\O: IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY
h: Automatic generation of database instances for white-box testing
egnúQHrir: 25TH ANNUAL INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE: 161-165 2001
NfNh: PROCEEDINGS - INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE
í: English
e.s{|W: Proceedings Paper
O®h: 25th Annual International Computer Software and Applications Conference (COMPSAC 2001)
O®åeg: OCT 08-12, 2001
O®0W¹p: CHICAGO, IL
O®^©RFU: IEEE Comp Soc.
\OsQ.Í: database applications; embedded SQL; constraint solving; automatic test data generation; software testing
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, B, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 0730-3157
ISBN: 0-7695-1372-7
29 W[&{vegnúQHrir
Tðy)Q: P INT COMP SOFTW APPL CONF
egne.sux¡pe: 3
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Software Engineering; Engineering, Electrical & Electronic
ISI e.s O÷S: BT20L

--------------------------------------------------------------------------------
>f:y 31 agÿqQ 35 ag
\O: Zhang, B; Ding, K; Li, J
fNM|âVSO\O: IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY
h: An XML-message based architecture description language and architectural mismatch checking
egnúQHrir: 25TH ANNUAL INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE: 561-566 2001
NfNh: PROCEEDINGS - INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE
í: English
e.s{|W: Proceedings Paper
O®h: 25th Annual International Computer Software and Applications Conference (COMPSAC 2001)
O®åeg: OCT 08-12, 2001
O®0W¹p: CHICAGO, IL
O®^©RFU: IEEE Comp Soc.
\OsQ.Í: software architecture; architecture description language; interface; XML message; architectural mismatch
Xd: 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, behavior 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, B, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 2
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 0730-3157
ISBN: 0-7695-1372-7
29 W[&{vegnúQHrir
Tðy)Q: P INT COMP SOFTW APPL CONF
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Software Engineering; Engineering, Electrical & Electronic
ISI e.s O÷S: BT20L

--------------------------------------------------------------------------------
>f:y 32 agÿqQ 35 ag
\O: Zhang, YC; Liu, XH; Wu, EH
: Peng, Q; Li, W; Yu, J
h: Plane-based warping
egnúQHrir: CAD/GRAPHICS '2001: PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN AND COMPUTER GRAPHICS, VOLS 1 AND 2: 257-265 2001
í: English
e.s{|W: Proceedings Paper
O®h: 7th International Conference on Computer Aided Design and Computer Graphics
O®åeg: AUG 22-24, 2001
O®0W¹p: KUNMING, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; Zhejiang Univ.; Yunnan Univ.; Microsoft Res China.; Natl Nat Sci Fdn China.; Zhejiang Univ, State Key Lab CAD&CG.; Sea Stars Grp Co.
\OsQ.Í: image-based rendering; depth image; backward warping; sample rate
Xd: In this paper we propose a plane-based backward warping algorithm to generate novel views from multiple reference images. We first employ the depth information to reconstruct space planes from individual reference images and calculate the potential occluding relationship between these planes. Then the planes which 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, traditional methods in computer graphics such as visibility test, clipping are used to process the planes reconstructed. Then the planes processed are projected onto the desired image from which we can get the knowledge on which plane 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. We show that the storage requirement in the algorithm is small and increases slowly with the number of reference images. By combining the strategy of only preserving the best sample parts and the backward warping algorithm, the sample problem could be well tackled.
0W@W: Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, YC, Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: INTERNATIONAL ACADEMIC PUBLISHERS LTD
úQHrFU0W@W: UNIT 1205, 12 FLOOR, SINO PLAZA, 255 GLOUCESTER ROAD, HONG KONG 00000, CAUSEWAY BAY, PEOPLES R CHINA
ISBN: 7-5062-5137-X
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BT30L

--------------------------------------------------------------------------------
>f:y 33 agÿqQ 35 ag
\O: Ma, CX; Chen, YD; Dai, GZ
: Peng, Q; Li, W; Yu, J
h: The research of 3D conceptual design based on feature-gestures
egnúQHrir: CAD/GRAPHICS '2001: PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN AND COMPUTER GRAPHICS, VOLS 1 AND 2: 411-415 2001
í: English
e.s{|W: Proceedings Paper
O®h: 7th International Conference on Computer Aided Design and Computer Graphics
O®åeg: AUG 22-24, 2001
O®0W¹p: KUNMING, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; Zhejiang Univ.; Yunnan Univ.; Microsoft Res China.; Natl Nat Sci Fdn China.; Zhejiang Univ, State Key Lab CAD&CG.; Sea Stars Grp Co.
\OsQ.Í: conceptual design; user interface; feature gestures; object oriented
KeyWords Plus: FREEHAND
Xd: Conceptual Design is now recognized as highly important when considering both the concurrent engineering aspects and the commitment of resources necessary to design and develop a product. Freehand sketch can be done with the pen. To be mainly used in mechanical design, one kind of the manipulations based on feature-gestures is proposed. The method can make interface more natural and more intuitive, which is used by the designers to express the design intention fluently. Through the fuzzy theory, we can achieve the fuzzy model of the free sketch based on the existing CAD system by making use of the object-oriented technology. It can record the model information completely and adds the constraints to the feature levels. With the clearly data structure to store the constraints model, we can implement the spread and solving of the constraints conveniently.
0W@W: Chinese Acad Sci, Inst Software, Intelligent Engn Lab, Beijing 100080, Peoples R China
¯\O0W@W: Ma, CX, Chinese Acad Sci, Inst Software, Intelligent Engn Lab, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: INTERNATIONAL ACADEMIC PUBLISHERS LTD
úQHrFU0W@W: UNIT 1205, 12 FLOOR, SINO PLAZA, 255 GLOUCESTER ROAD, HONG KONG 00000, CAUSEWAY BAY, PEOPLES R CHINA
ISBN: 7-5062-5137-X
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BT30L

--------------------------------------------------------------------------------
>f:y 34 agÿqQ 35 ag
\O: Luan, SM; Dai, GZ; Chen, YD
: Peng, Q; Li, W; Yu, J
h: A programmable approach to the maintenance of user modeling
egnúQHrir: CAD/GRAPHICS '2001: PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN AND COMPUTER GRAPHICS, VOLS 1 AND 2: 896-899 2001
í: English
e.s{|W: Proceedings Paper
O®h: 7th International Conference on Computer Aided Design and Computer Graphics
O®åeg: AUG 22-24, 2001
O®0W¹p: KUNMING, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; Zhejiang Univ.; Yunnan Univ.; Microsoft Res China.; Natl Nat Sci Fdn China.; Zhejiang Univ, State Key Lab CAD&CG.; Sea Stars Grp Co.
\OsQ.Í: maintenance of user modeling; propositional logic; algorithm; knowledge base
KeyWords Plus: CONTRACTION
Xd: In this paper, we introduce an algorithm for the maintenance of user modeling. The inputs of the algorithm are a propositional clause set Gamma and a propositional clause A. And the outputs of the algorithm are the subsets of Gamma which are minimally inconsistent with A. Then we also introduce a prototype system for the revision of propositional clause set. At last, we discuss the relationship between the approach presented in this paper and other related approaches.(*)
0W@W: Chinese Acad Sci, Inst Software, Intelligent Engn Lab, Beijing 100080, Peoples R China
¯\O0W@W: Luan, SM, Chinese Acad Sci, Inst Software, Intelligent Engn Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 17
«_!k: 0
úQHrFU: INTERNATIONAL ACADEMIC PUBLISHERS LTD
úQHrFU0W@W: UNIT 1205, 12 FLOOR, SINO PLAZA, 255 GLOUCESTER ROAD, HONG KONG 00000, CAUSEWAY BAY, PEOPLES R CHINA
ISBN: 7-5062-5137-X
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BT30L

--------------------------------------------------------------------------------
>f:y 35 agÿqQ 35 ag
\O: Zhang, J; Wang, XX
h: A constraint solver and its application to path feasibility analysis
egnúQHrir: INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING, 11 (2): 139-156 APR 2001
í: English
e.s{|W: Proceedings Paper
O®h: 1st Asia-Pacific Conference on Quality Software
O®åeg: OCT 30-31, 2000
O®0W¹p: HONG KONG, PEOPLES R CHINA
O®^©RFU: Univ Hong Kong, Software Engn Grp.; Vocat Training Council, Software Technol Ctr.; IEEE, Hong kong Sect, Comp Chapter.; British Comp Soc, Hong Kong Sect.; Software Dioxide QAI.
\OsQ.Í: constraint solving; test data generation; infeasible paths; arrays
KeyWords Plus: GENERATION
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
_(uvÂSe.spe: 27
«_!k: 18
úQHrFU: WORLD SCIENTIFIC PUBL CO PTE LTD
úQHrFU0W@W: JOURNAL DEPT PO BOX 128 FARRER ROAD, SINGAPORE 912805, SINGAPORE
ISSN: 0218-1940
29 W[&{vegnúQHrir
Tðy)Q: INT J SOFTW ENG KNOWL
ISO egne.súQHrir
Tðy)Q: Int. J. Softw. Eng. Knowl. Eng.
egne.sux¡pe: 18
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Software Engineering; Engineering, Electrical & Electronic
ISI e.s O÷S: 440QD

ISTP 2002
>f:y 1 agÿqQ 24 ag
\O: Wang, MS; Kwong, CP
: Cohen, AM; Gao, XS; Takayama, N
h: Computing gclf using syzygy algorithm
egnúQHrir: MATHEMATICAL SOFTWARE, PROCEEDINGS: 93-103 2002
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Congress of Mathematical Software (ICMS 2002)
O®åeg: AUG 17-19, 2002
O®0W¹p: Beijing, PEOPLES R CHINA
KeyWords Plus: POLYNOMIAL-MATRICES; PRIMENESS; SYSTEMS
Xd: This paper discusses problem of computing a greatest common left factor (GCLF) for two n-D(n > 2) polynomial matrices with the same number of rows. We give a partial answer by proposing a new algorithm based on syzygy computation. Some examples are computed using computer algebra softwares Singular and CoCoA. It demonstrates the fundamental importance of Grobner basis and syzygy algorithm.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100864, Peoples R China
¯\O0W@W: Wang, MS, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 15
«_!k: 0
úQHrFU: WORLD SCIENTIFIC PUBL CO PTE LTD
úQHrFU0W@W: PO BOX 128 FARRER RD, SINGAPORE 9128, SINGAPORE
ISBN: 981-238-048-5
egne.sux¡pe: 11
f[Ñy{|+R: Computer Science, Software Engineering; Mathematics
ISI e.s O÷S: BCP21

--------------------------------------------------------------------------------
>f:y 2 agÿqQ 24 ag
\O: Lin, DD; Song, ZM; Wang, PS
: Cohen, AM; Gao, XS; Takayama, N
h: Secure Internet accessible mathematical computation framework
egnúQHrir: MATHEMATICAL SOFTWARE, PROCEEDINGS: 501-502 2002
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Congress of Mathematical Software (ICMS 2002)
O®åeg: AUG 17-19, 2002
O®0W¹p: Beijing, PEOPLES R CHINA
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Lin, DD, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 0
«_!k: 0
úQHrFU: WORLD SCIENTIFIC PUBL CO PTE LTD
úQHrFU0W@W: PO BOX 128 FARRER RD, SINGAPORE 9128, SINGAPORE
ISBN: 981-238-048-5
egne.sux¡pe: 2
f[Ñy{|+R: Computer Science, Software Engineering; Mathematics
ISI e.s O÷S: BCP21

--------------------------------------------------------------------------------
>f:y 3 agÿqQ 24 ag
\O: Liu, Y; Zhang, HQ; Wu, ZM
: Yin, H; Allinson, N; Freeman, R; Keane, J; Hubbard, S
h: A new approach to hierarchically retrieve MPEG video
egnúQHrir: INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2002, 2412: 576-581 2002
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Intelligent Data Engineering and Automated Learning
O®åeg: AUG 12-14, 2002
O®0W¹p: MANCHESTER, ENGLAND
O®^©RFU: Univ Manchester Inst Sci & Technol.
Xd: Many researchers have devoted into video retrieval research and given lots of efficient video retrieval algorithms. Most of past algorithms were done in pixel domain, which needed lots of decoding calculations. What's more, the same matching algorithm was used to all the video clips, which also wasted many unnecessary calculations. This paper presents a new approach to hierarchically retrieve video by example video in MPEG compressed domain. Firstly, the dct_dc_size field in I frames is analyzed to filter out the obviously different video clips quickly, and then the precise matching analysis of DC image is used to get the final retrieval result. Our experiment results show that this approach needs a few calculations and has high precision ratio.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Liu, Y, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-44025-9
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BY01R

--------------------------------------------------------------------------------
>f:y 4 agÿqQ 24 ag
\O: Dong, Y; Li, MS
: Han, Y; Wikarski, D; Tai, S
h: TEMPPLET: A new method for domain-specific ontology design
egnúQHrir: ENGINEERING AND DEPLOYMENT OF COOPERATIVE INFORMATION SYSTEMS, PROCEEDINGS, 2480: 90-103 2002
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Conference on Engineering and Deployment of Cooperative Information Systems
O®åeg: SEP 17-20, 2002
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; EASST.; IEEE.; Chinese Acad Sci, Inst Comp.; Fraunhofer Inst Software & Syst Technol.; Brandenburg Univ Appl Sci.; Tsinghua Univ.; IBM Res.
\OsQ.Í: ontology; domain; template; applet
Xd: Ontology is becoming a basic and important issue for knowledge management and semantic web applications. However, domain-specific ontology design is always difficult. On one hand, the ontology has to fit into standards in the domain to ensure interoperability; On the other hand, it has to be applied into individual organizations. To solve the problem, in this paper we provide a new method for domain-specific ontology design - "Tempplet", combining two words "template" and "applet" together. The two steps of the method are: Firstly it follows a "template ontology" of the domain; then fitting "applet ontology" into the chosen template when customizing. Moreover, a formal model is provided to answer whether there exists an applet ontology that both satisfies the constraints and conforms to the template ontology. Two cases of ontology design for different domains are given to illustrate how to apply the method into practice.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100864, Peoples R China
¯\O0W@W: Dong, Y, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-44222-7
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 14
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BY01V

--------------------------------------------------------------------------------
>f:y 5 agÿqQ 24 ag
\O: Shen, YD; Zhang, Z; Yang, Q
: Kumar, V; Tsumoto, S; Zhong, N; Yu, PS; Wu, XD
h: Objective-oriented utility-based association mining
egnúQHrir: 2002 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS: 426-433 2002
í: English
e.s{|W: Proceedings Paper
O®h: 2nd IEEE International Conference on Data Mining
O®åeg: DEC 09-12, 2002
O®0W¹p: MAEBASHI CITY, JAPAN
O®^©RFU: IEEE Comp Soc Tech Comm Pattern Anal & Machine Intelligence.; IEEE Comp Soc Tech Comm Computat Intelligence.; Maebashi Convent Bur.; Maebashi City Govt.; Gunmma Prefecture Govt.; Maebashi Inst Technol.; AdIn Res Inc.; Japan Res Inst Ltd.; Support Ctr Adv Telecommun Technol Res.; US AFOSR, AOARD, AROFE.; SAS Inst Japan.; SPSS Japan Inc.; Kankodo.; Syst Alpha Inc.; GCC Inc.; Yamato Inc.; Daiei Dream Co Ltd.
Xd: The necessity to develop methods for discovering association patterns to increase business utility of an enterprise has long been recognized in data mining community This requires modeling specific association patterns that are both statistically (based on support and confidence) and semantically (based on objective utility) relating to a given objective that a user wants to achieve or is interested in. However we notice that no such a general model has been reported in the literature. Traditional association mining focuses on deriving correlations among a set of items and their association rules like diaper --> beer only tell us that a pattern like {diaper} is statistically related to an item like beer. In this paper we present a new approach, called Objective-Oriented utility-based Association (OOA) mining, to modeling such association patterns that are explicitly relating to a user's objective and its utility. Due to its focus on a user's objective and the use of objective utility as key semantic information to measure the usefulness of association patterns, OOA mining differs significantly from existing approaches such as the existing constraint-based association mining. We formally define OOA mining and develop an algorithm for mining OOA rules. The algorithm is an enhancement to Apriori with specific mechanisms for handling objective utility. We prove that the utility constraint is neither monotone nor anti-monotone nor succinct nor convertible and present a novel pruning strategy based on the utility constraint to improve the efficiency of OOA mining.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Shen, YD, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-1754-4
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BV87U

--------------------------------------------------------------------------------
>f:y 6 agÿqQ 24 ag
\O: Dong, Y; Li, MS; Wang, Q
fNM|âVSO\O: IEEE; IEEE
h: A UML extension of distributed system
egnúQHrir: 2002 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-4, PROCEEDINGS: 476-480 2002
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Machine Learning and Cybernetics
O®åeg: NOV 04-05, 2002
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: IEEE, SMC.; Hebei Univ, Machine Learning Ctr.
\OsQ.Í: UNM; distributed system; time automata; QoS
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Dong, Y, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-7508-4
egne.sux¡pe: 5
f[Ñy{|+R: Automation & Control Systems; Computer Science, Artificial Intelligence; Computer Science, Cybernetics; Engineering, Electrical & Electronic
ISI e.s O÷S: BW27J

--------------------------------------------------------------------------------
>f:y 7 agÿqQ 24 ag
\O: Huai, XY; Zou, Y; Li, MS
fNM|âVSO\O: IEEE; IEEE
h: Adaptive fuzzy control scheduling of hybrid real-time systems
egnúQHrir: 2002 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-4, PROCEEDINGS: 810-815 2002
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Machine Learning and Cybernetics
O®åeg: NOV 04-05, 2002
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: IEEE, SMC.; Hebei Univ, Machine Learning Ctr.
\OsQ.Í: fuzzy control; adaptive system scheduling; real-time QoS scheduling constraint
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Huai, XY, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 5
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-7508-4
egne.sux¡pe: 6
f[Ñy{|+R: Automation & Control Systems; Computer Science, Artificial Intelligence; Computer Science, Cybernetics; Engineering, Electrical & Electronic
ISI e.s O÷S: BW27J

--------------------------------------------------------------------------------
>f:y 8 agÿqQ 24 ag
\O: Jing, Z; Sun, YF
: Smari, WW; Guizani, M
h: The propagation solutions for multi replication definition
egnúQHrir: PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS: 525-530 2002
í: English
e.s{|W: Proceedings Paper
O®h: ISCA 15th International Conference on Parallel and Distributed Computing Systems
O®åeg: SEP 19-21, 2002
O®0W¹p: LOUISVILLE, KY
O®^©RFU: Int Soc Comp & Their Applicat.
KeyWords Plus: DATABASES
Xd: Multi Replication Definition is a new developing trend of database replication, but it will increase the propagation costs. The paper presents three optimized algorithms: D-M, ILS and LIS. D-M Algorithm gets the minimum individual propagation cost per sites pair by dividing replication objects and merging propagation objects; based on it, ILS makes the total costs to the least in Chain Topology; however LIS gets the optimized total costs in other common situations by decomposing the propagation task. Their correctness and efficiencies are validated both theoretical and experimentally.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Jing, Z, Chinese Acad Sci, Inst Software, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: INTERNATIONAL SOCIETY COMPUTER S & THEIR APPLICATIONS (ISCA)
úQHrFU0W@W: 8820 SIX FORKS ROAD, RALEIGH, NC 27615 USA
ISBN: 1-880843-44-7
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Theory & Methods
ISI e.s O÷S: BV69E

--------------------------------------------------------------------------------
>f:y 9 agÿqQ 24 ag
\O: Ma, CX; Wang, HG; Dai, GZ
: Shen, W; DeSouza, JM; Barthes, JP; Lin, Z
h: A gesture language for collaborative conceptual design
egnúQHrir: PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON CSCW IN DESIGN: 205-209 2002
í: English
e.s{|W: Proceedings Paper
O®h: 7th International Conference on Computer Supported Cooperative Work in Design (CSCWD 2002)
O®åeg: SEP 25-27, 2002
O®0W¹p: RIO DE JANEIRO, BRAZIL
O®^©RFU: Fdn Carlos Chagas Filho Amparo Pesquisa Estado Rio Janeiro.; Soc Brasileira Comp.; Univ Fed Rio Janeiro.; IEEE, Rio Janeiro Sect.; Coppetec Fdn.
Xd: Ubiquitous computing [1] 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.
0W@W: Chinese Acad Sci, Inst Software, Human Comp Interact & Intelligence Informat Proc, Beijing, Peoples R China
¯\O0W@W: Ma, CX, Chinese Acad Sci, Inst Software, Human Comp Interact & Intelligence Informat Proc, Beijing, Peoples R China.
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: UNIV FED RIO DE JANEIRO,
úQHrFU0W@W: COORDENACAO PROGRAMAS POS-GRADUACAO ENGENHARIA, RIO JANEIRO, BRAZIL
ISBN: 85-285-0050-0
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems
ISI e.s O÷S: BV99Q

--------------------------------------------------------------------------------
>f:y 10 agÿqQ 24 ag
\O: Liu, R; Hong, XL; Dong, SQ; Cai, YC; Gu, J; Cheng, CK
fNM|âVSO\O: IEEE; IEEE
h: Module placement with boundary constraints using O-tree representation
egnúQHrir: 2002 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL II, PROCEEDINGS: 871-874 2002
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Symposium on Circuits and Systems
O®åeg: MAY 26-29, 2002
O®0W¹p: PHOENIX, AZ
O®^©RFU: IEEE.; IEEE Circuits & Syst Soc.
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Liu, R, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 5
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-7448-7
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Hardware & Architecture; Computer Science, Information Systems; Engineering, Electrical & Electronic; Telecommunications
ISI e.s O÷S: BX73X

--------------------------------------------------------------------------------
>f:y 11 agÿqQ 24 ag
\O: Li, GY; Tang, ZS
: George, C; Miao, H
h: Modelling real-time systems with continuous-time temporal logic
egnúQHrir: FORMAL METHODS AND SOFTWARE ENGINEERING, PROCEEDINGS, 2495: 231-236 2002
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Conference on Formal Engineering Methods (ICFEM 2002)
O®åeg: OCT 21-25, 2002
O®0W¹p: SHANGHAI, PEOPLES R CHINA
O®^©RFU: Shanghai Univ.; United Nat Univ Int Inst Software Technol.; Natl Nat Sci Fdn China.; China Comp Federat.; China Software Ind Assoc.; Shanghai Comp Assoc.; E China Normal Univ.
Xd: LTLC is a continuous-time linear temporal logic for the specification of real-time systems. It can express both the properties and the implementations of real-time systems. With LTLC, real-time 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 paper will describe how LTLC is used to represent and reason about real-time systems.
0W@W: Chinese Acad Sci, Inst Software, Key Lab Comp Sci, Beijing 100080, Peoples R China
¯\O0W@W: Li, GY, Chinese Acad Sci, Inst Software, Key Lab Comp Sci, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 4
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-00029-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BW29N

--------------------------------------------------------------------------------
>f:y 12 agÿqQ 24 ag
\O: Gang, XJ; An, WH; Zhong, DG
: Sloot, P; Tan, CJK; Dongarra, JJ; Hoekstra, AG
h: The software architecture of a problem solving environment for enterprise computing
egnúQHrir: COMPUTATIONAL SCIENCE-ICCS 2002, PT I, PROCEEDINGS, 2329: 862-871 2002
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Computational Science
O®åeg: APR 21-24, 2002
O®0W¹p: AMSTERDAM, NETHERLANDS
O®^©RFU: Univ Amsterdam, Sect Computat Sci.; SHARCNET, Canada.; Univ Tennessee, Dept Comp Sci.; Power Comp & Commun BV.; Elsevier Sci Publ.; Springer Verlag.; HPCN Fdn.; Natl Supercomp Facilities.; Sun Microsyst Inc.; Queens Univ, Sch Comp Sci.
Xd: Problem Solving Environment (PSE) is a new and diverse area of research, and till now it resists simple universally accepted definitions. In brief, PSE is a complete and integrated computing environment in which new application can be constructed, compiled and executed. This paper describes the concept and software architecture of a PSE for Enterprise computing (E-PSE). The E-PSE is developed to provide transparent access to heterogeneous distributed computing resources in one enterprise, and is to improve research productivity by making it easier to construct, compile and run computer applications so that the enterprise can achieve more advanced economic benefit as soon as possible. The E-PSE includes four modules: Visual Enterprise Modeling System, Visual Application Construction Environment, Application Wrapping & Integrating Toot and Application Runtime Environment. The application of the E-PSE in an oil-refining enterprise is presented. Related work about PSE is also described.
0W@W: Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100080, Peoples R China
¯\O0W@W: Gang, XJ, Chinese Acad Sci, Inst Software, Intelligence Engn Lab, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-43591-3
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BW26B

--------------------------------------------------------------------------------
>f:y 13 agÿqQ 24 ag
\O: Wang, J; Sun, LM; Jiang, X; Wu, ZM
fNM|âVSO\O: IEEE; IEEE
h: IGMP snooping: A VLAN-Based multicast protocol
egnúQHrir: HSNMC 2002: 5TH IEEE INTERNATIONAL CONFERENCE ON HIGH SPEED NETWORKS AND MULTIMEDIA COMMUNICATIONS: 335-340 2002
í: English
e.s{|W: Proceedings Paper
O®h: 5th IEEE International Conference on High Speed Networks and Multimedia Communications (HSNMC 2002)
O®åeg: JUL 03-05, 2002
O®0W¹p: JEJU ISL, SOUTH KOREA
O®^©RFU: IEEE.; IEEE Commun Soc.; IEE.; IEEK.; LG Electr.; KICS.; UFON.; Dongshin Univ.; Korea Natl Tourism Org.; InterFC Co Ltd.; INETCOOL COM CO Ltd.
\OsQ.Í: IGMP snooping; VLAN; Switch Ethernet; CGMP; GMRP
Xd: This paper introduces a VLAN-based multicast protocol, which supports the multicast communication over switch Ethernet. This protocol restricts the multicast traffic of an IP multicast group in a VLAN. It starts with a table including an IP multicast group and the corresponding VLAN. Then it can get the multicast session info to maintain the table by snooping the IGMP messages sent by hosts or routers. In this paper, we will give the basic idea, syntax and semantics of this protocol. At the last, an experiment and its results are also provided.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Wang, J, Chinese Acad Sci, Inst Software, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 2
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-7600-5
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Information Systems; Engineering, Electrical & Electronic; Telecommunications
ISI e.s O÷S: BV08W

--------------------------------------------------------------------------------
>f:y 14 agÿqQ 24 ag
\O: Shu, GQ; Li, C; Wang, Q; Li, MS
fNM|âVSO\O: IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY
h: Validating objected-oriented prototype of real-time systems with timed automata
egnúQHrir: 13TH IEEE INTERNATIONAL WORKSHOP ON RAPID SYSTEM PROTOTYPING, PROCEEDINGS: 99-106 2002
NfNh: PROCEEDINGS - IEEE INTERNATIONAL WORKSHOP ON RAPID SYSTEM PROTOTYPING
í: English
e.s{|W: Proceedings Paper
O®h: 13th IEEE International Workshop on Rapid System Prototyping
O®åeg: JUL 01-03, 2002
O®0W¹p: DARMSTADT, GERMANY
O®^©RFU: IEEE Comp Soc Tech Comm Simulat.; IEEE Comp Soc Tech Comm Design Automat.
Xd: Object-oriented development of real-time systems is becoming more and more prevalent. Unified Modeling Language (UML) is a standardized notation for describing object-oriented software design. While using UML to specify real-time systems, the formal validation of certain timing constraints becomes critical for the success of object-oriented development of real-time systems. Current development methods of real-time systems have not provided consistent support for verifying UML models of real-time systems. This paper presents a formal specification & validation method, FORTS, for object-oriented real-time system development using UML. The method presents a real-time extension of UML; describes the formal semantics of the UML extension; provides automatic transformation of UML models into timed automata; and verifies timing assertions presented by UML sequence diagram using model checking and constraints solving technique. With tool support, FORTS conceals the complicated details of formal validation for users, thus providing the benefits of formal methods without bringing additional burden. A case study is presented in the end of the paper.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Shu, GQ, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 1
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 1074-6005
ISBN: 0-7695-1703-X
29 W[&{vegnúQHrir
Tðy)Q: PROC IEEE RAPID SYST PROTOTYP
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Hardware & Architecture; Computer Science, Software Engineering; Engineering, Electrical & Electronic
ISI e.s O÷S: BU89R

--------------------------------------------------------------------------------
>f:y 15 agÿqQ 24 ag
\O: Sun, L; Zhang, YB; Zhang, JL; Sun, YF
fNM|âVSO\O: IEEE; IEEE; IEEE; IEEE
h: PECAT: A computer-aided translation tool based on bilingual corpora
egnúQHrir: 2001 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5 - E-SYSTEMS AND E-MAN FOR CYBERNETICS IN CYBERSPACE : 927-932 2002
NfNh: IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, CONFERENCE PROCEEDINGS
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on Systems, Man and Cybernetics (SMC)
O®åeg: OCT 07-10, 2001
O®0W¹p: TUCSON, AZ
O®^©RFU: IEEE.; Raytheon.
\OsQ.Í: computer-aided translation; bilingual corpora; text alignment; matching algorithm
Xd: 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 on 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.
0W@W: Chinese Acad Sci, Inst Software, Chinese Informat Proc Ctr, Beijing 100080, Peoples R China
¯\O0W@W: Sun, L, Chinese Acad Sci, Inst Software, Chinese Informat Proc Ctr, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISSN: 1062-922X
ISBN: 0-7803-7087-2
29 W[&{vegnúQHrir
Tðy)Q: IEEE SYS MAN CYBERN
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Cybernetics; Computer Science, Information Systems; Engineering, Electrical & Electronic
ISI e.s O÷S: BU92K

--------------------------------------------------------------------------------
>f:y 16 agÿqQ 24 ag
\O: Zhang, WY; Xu, G; Wang, YG
fNM|âVSO\O: IEEE; IEEE
h: Pitch estimation based on circular AMDF
egnúQHrir: 2002 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-IV, PROCEEDINGS: 341-344 2002
NfNh: International Conference on Acoustics Speech and Signal Processing (ICASSP)
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on Acoustics, Speech, and Signal Processing
O®åeg: MAY 13-17, 2002
O®0W¹p: ORLANDO, FL
O®^©RFU: IEEE Signal Proc Soc.
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, WY, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 9
«_!k: 1
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISSN: 1520-6149
ISBN: 0-7803-7402-9
29 W[&{vegnúQHrir
Tðy)Q: INT CONF ACOUST SPEECH SIG PR
egne.sux¡pe: 4
f[Ñy{|+R: Acoustics; Engineering, Electrical & Electronic
ISI e.s O÷S: BU96P

--------------------------------------------------------------------------------
>f:y 17 agÿqQ 24 ag
\O: Wu, EH; Zhang, YC; Liu, XH
fNM|âVSO\O: IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY
h: Point representation augmented to surface reconstruction in image-based VR
egnúQHrir: CA 2002: PROCEEDINGS OF THE COMPUTER ANIMATION 2002: 55-64 2002
NfNh: COMPUTER ANIMATION CONFERENCE PROCEEDINGS
í: English
e.s{|W: Proceedings Paper
O®h: Computer Animation 2002 Conference (CA 2002)
O®åeg: JUN 19-21, 2002
O®0W¹p: GENEVA, SWITZERLAND
O®^©RFU: Comp Graph Soc.; Univ Geneva, MIRALab.
\OsQ.Í: image-based rendering; real time walkthrough; sampling rate
Xd: In this paper we propose a hybrid representation of environment models by a point representation augmented to geometric representation of surface polygons reconstructed from multiple reference images, through which a real time walkthrough of a complex environment can be achieved. By the method, we start from classification of pixels of the source images into two categories, corresponding respectively 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 uniformly sampled texture images by a comparison of sampling rate and resampling. For the pixels corresponding to the non-planar surfaces, a point representation is applied and the redundant pixels are removed again through 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. presentation, texture mapping and Under this hybrid re point warping are employed to render the novel views, to take full advantages of the acceleration utility of graphics hardware.
0W@W: Chinese Acad Sci, Inst Software, Key Lab Comp Sci, Beijing 100080, Peoples R China
¯\O0W@W: Wu, EH, Chinese Acad Sci, Inst Software, Key Lab Comp Sci, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 25
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 1087-4844
ISBN: 0-7695-1595-9
29 W[&{vegnúQHrir
Tðy)Q: COMP ANIM CONF PROC
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BU80G

--------------------------------------------------------------------------------
>f:y 18 agÿqQ 24 ag
\O: Zhang, YC; Liu, XH; Wu, EH
: Coquillart, S; Shum, HY; Hu, SM
h: A hybrid representation of environment models in image-based real time walkthrough
egnúQHrir: 10TH PACIFIC CONFERENCE ON COMPUTER GRAPHICS AND APPLICATIONS, PROCEEDINGS: 335-344 2002
í: English
e.s{|W: Proceedings Paper
O®h: 10th Pacific Conference on Computer Graphics and Applications
O®åeg: OCT 09-11, 2002
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: Natl Nat Sci Fdn China.; CSIAM Geometr Design & Comp Soc.; Microsoft Res Asia.
O®;NR¹e: TSINGHUA UNIV
KeyWords Plus: TREE
Xd: In this paper, a hybrid representation of environment models by a combination of points and polygons is proposed. Through the model, a real time walkthrough of a complex environment can be achieved. We start from multiple depth reference images and classify the pixels of images into two categories, corresponding respectively to the planar and non-planar surfaces in 3D space, then all the redundant points are removed by a comparison algorithm of sampling rate. For the pixels corresponding to the non-planar surfaces, the point representation is maintained, and a local reconstruction and resampling process is employed to re-sample a set of points that distribute more uniformly on the surfaces. The points re-sampled are organized by OBB-tree according to their space coordinates and a multiresolution structure is built to improve the rendering efficiency. For the pixels corresponding to the planar surfaces, the plane coefficients are reconstructed and all their appearances in the reference images are merged to texture maps. Under this hybrid representation, texture mapping and point-based rendering are employed to render the novel views, to take full advantage of the acceleration utility of graphics hardware. The algorithm demonstrates the combined advantages of the approaches in traditional computer graphics and PBR/IBR, the texture mapping for plane surfaces and the point-based rendering for high detail surfaces and shapes.
0W@W: Chinese Acad Sci, Inst Software, Key Lab Comp Sci, Beijing 100864, Peoples R China
¯\O0W@W: Zhang, YC, Chinese Acad Sci, Inst Software, Key Lab Comp Sci, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 30
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-1785-4
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BV46G

--------------------------------------------------------------------------------
>f:y 19 agÿqQ 24 ag
\O: Ding, K; Jin, BH; Wei, J; Feng, YL
fNM|âVSO\O: IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY
h: New model and scheduling protocol for transactional workflows
egnúQHrir: 26TH ANNUAL INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE, PROCEEDINGS: 920-927 2002
NfNh: PROCEEDINGS - INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE
í: English
e.s{|W: Proceedings Paper
O®h: 26th Annual International Computer Software and Applications Conference
O®åeg: AUG 26-29, 2002
O®0W¹p: OXFORD, ENGLAND
O®^©RFU: IEEE Comp Soc.
\OsQ.Í: transactional workflow; well-formedness; scheduling protocol; locking granularity
Xd: 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). Me 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Ding, K, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 0730-3157
ISBN: 0-7695-1727-7
29 W[&{vegnúQHrir
Tðy)Q: P INT COMP SOFTW APPL CONF
egne.sux¡pe: 2
f[Ñy{|+R: Computer Science, Hardware & Architecture; Computer Science, Information Systems; Computer Science, Software Engineering; Engineering, Electrical & Electronic
ISI e.s O÷S: BV16P

--------------------------------------------------------------------------------
>f:y 20 agÿqQ 24 ag
\O: Sun, LM; Zhang, H; Wang, ZF; Wu, ZM
: Zhou, W; Chi, XB; Goscinski, A; Li, GJ
h: Asymmetric VLAN management protocol for distributed architecture
egnúQHrir: FIFTH INTERNATIONAL CONFERENCE ON ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PROCEEDINGS: 143-147 2002
í: English
e.s{|W: Proceedings Paper
O®h: 5th International Conference on Algorithms and Architectures for Parallel Processing
O®åeg: OCT 23-25, 2002
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: IEEE Beijing Sect.; Chinese Acad Sci.; China Nat Sci Fdn.; Special Funds Major State Basic Res Project China.; Deakin Univ.
\OsQ.Í: asymmetric VLAN management protocol; distributed architecture; broadband access
Xd: This paper provides an Asymmetric VLAN Management Protocol implemented in switch with distributed architecture, to make an end station available to others in different VLANs without routers in the case end stations are VLAN-unaware, as a supplement to IEEE 802.1Q standard. This paper first introduces the Asymmetric VLAN Management Protocol and gives the protocol properties, then extends the protocol for distributed architecture and presents the implementation in our broadband access system.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Sun, LM, Chinese Acad Sci, Inst Software, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 4
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-1512-6
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Hardware & Architecture; Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BV53V

--------------------------------------------------------------------------------
>f:y 21 agÿqQ 24 ag
\O: Sun, LM; Wang, ZF; Wang, J; Wu, ZM
fNM|âVSO\O: IEEE; IEEE
h: An IEEE 802.1Q-based management protocol of asymmetric VLAN
egnúQHrir: HSNMC 2002: 5TH IEEE INTERNATIONAL CONFERENCE ON HIGH SPEED NETWORKS AND MULTIMEDIA COMMUNICATIONS: 208-212 2002
í: English
e.s{|W: Proceedings Paper
O®h: 5th IEEE International Conference on High Speed Networks and Multimedia Communications (HSNMC 2002)
O®åeg: JUL 03-05, 2002
O®0W¹p: JEJU ISL, SOUTH KOREA
O®^©RFU: IEEE.; IEEE Commun Soc.; IEE.; IEEK.; LG Electr.; KICS.; UFON.; Dongshin Univ.; Korea Natl Tourism Org.; InterFC Co Ltd.; INETCOOL COM CO Ltd.
Xd: This paper provides an asymmetric VLAN management protocol used in switches,to make an end station available to others in different VLANs without routers in the case end stations are VLAN-unaware, as a supplement to IEEE 802.1Q standard. It first introduces the asymmetric VLAN management protocol for a single switch situation and gives the protocol properties. Then extends the protocol to be used where there are multiple connected switches. The asymmetric VLAN management protocol is implemented and tested in our broadband access system.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Sun, LM, Chinese Acad Sci, Inst Software, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-7600-5
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Information Systems; Engineering, Electrical & Electronic; Telecommunications
ISI e.s O÷S: BV08W

--------------------------------------------------------------------------------
>f:y 22 agÿqQ 24 ag
\O: Jia, Y; Tan, M; Gu, YQ
: Fernandez, M
h: The evolutionary approach to semantics-driven CBD automation
egnúQHrir: PROCEEDINGS OF THE 28TH EUROMICRO CONFERENCE: 98-104 2002
NfNh: EUROMICRO CONFERENCE - PROCEEDINGS
í: English
e.s{|W: Proceedings Paper
O®h: Joint Meeting of the 28th EUROMICRO Conference/EUROMICRO Symposium on Digital System Design
O®åeg: SEP 04-06, 2002
O®0W¹p: DORTMUND, GERMANY
Xd: The representation and manipulation of the semantic usability of components is one of the most critical issues in the Component-Base Development (CBD) paradigm. This paper originally addresses the component semantics in principle of Evolutionary Algorithm (EA), where an automatic component evolving process is presented based on a genetic component model, along with the feature-oriented component semantics is taken as the driving force for CBD process. In this paper we emphasize the importance of knowledge representing and reasoning in CBD automation. Through introducing Description Logics (DLs) into our approach, we believe that without the support of AI-based automation, CBD will spend or risk no less than the traditional development paradigms.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Jia, Y, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 1089-6503
ISBN: 0-7695-1787-0
29 W[&{vegnúQHrir
Tðy)Q: EUROMICRO CONF PROC
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Software Engineering; Engineering, Electrical & Electronic; Telecommunications
ISI e.s O÷S: BV24G

--------------------------------------------------------------------------------
>f:y 23 agÿqQ 24 ag
\O: Zhe, J; Sun, YF
: Caulfield, HJ; Chen, SH; Duro, R; Honavar, V; Kerre, EE; Lu, M; Romay, MG; Shih, TK; Ventura, D; Wang, PP; Yang, YY
h: Approach of heterogeneous database replication
egnúQHrir: PROCEEDINGS OF THE 6TH JOINT CONFERENCE ON INFORMATION SCIENCES: 407-411 2002
í: English
e.s{|W: Proceedings Paper
O®h: 6th Joint Conference on Information Sciences
O®åeg: MAR 08-13, 2002
O®0W¹p: RES TRIANGLE PK, NC
O®^©RFU: Assoc Intelligent Machinery.; Informat Sci Journal.; Duke Univ, Acad Affairs.; Tamkang Univ.; N Carolina Biotechnol Ctr.; GalxoSmithKline.; George Mason Univ.
\OsQ.Í: database replication; heterogeneous databases; framework; abstraction; multi-layer; component
Xd: 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 theme 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhe, J, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: ASSOC INTELLIGENT MACHINERY
úQHrFU0W@W: PO BOX 90291, DURHAM, NC 27708-0291 USA
ISBN: 0-9707890-1-7
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Software Engineering; Engineering, Electrical & Electronic
ISI e.s O÷S: BV54W

--------------------------------------------------------------------------------
>f:y 24 agÿqQ 24 ag
\O: Wang, X; Cheung, SC; Wei, J
h: A CSP and Z combined modeling of document exchange processes in e-commerce protocols
egnúQHrir: INFORMATION AND SOFTWARE TECHNOLOGY, 44 (14): 875-889 NOV 1 2002
í: English
e.s{|W: Proceedings Paper
O®h: 2nd Asia-Pacific Conference on Quality Software
O®åeg: DEC 10-11, 2001
O®0W¹p: HONG KONG, PEOPLES R CHINA
O®^©RFU: City Univ Hong Kong, Dept Comp Sci.; Ctr Software Engn, Sch Informat Technol.; Swinburn Univ Technol.; Informat Technol Serv Dept, Govt Hong Kong.; British Comp Soc, Hong Kong Sect.; Hong Kong Comp Soc.; Hong Kong Inst Engineers Informat Technol Div.; IEEE Hong Kong Sect Comp Soc Chapter.
\OsQ.Í: formal specification; e-commerce protocols; Internet Open Trading Protocol; CSP; Z; document exchange process
Xd: 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 c-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. (C) 2002 Elsevier Science B.V. All rights reserved.
0W@W: Univ Oxford, Comp Lab, Oxford OX1 3QD, England; Hong Kong Univ Sci & Technol, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China; Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Wang, X, Univ Oxford, Comp Lab, Wolfson Bldg,Parks Rd, Oxford OX1 3QD, England.
_(uvÂSe.spe: 42
«_!k: 0
úQHrFU: ELSEVIER SCIENCE BV
úQHrFU0W@W: PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
ISSN: 0950-5849
29 W[&{vegnúQHrir
Tðy)Q: INFORM SOFTWARE TECHNOL
ISO egne.súQHrir
Tðy)Q: Inf. Softw. Technol.
egne.sux¡pe: 15
f[Ñy{|+R: Computer Science, Information Systems; Computer Science, Software Engineering
ISI e.s O÷S: 612DW

ISTP 2003
>f:y 1 agÿqQ 38 ag
\O: Sun, LM; Yong, L; Wu, ZM
: Agha, KA; Omidyar, CG
h: A reliable region based hierarchical mobile multicast protocol for IPv6 network
egnúQHrir: Mobile and Wireless Communications Networks: 327-330 2003
í: English
e.s{|W: Proceedings Paper
O®h: 5th International Conference on Mobile and Wireless Communications Networks
O®åeg: OCT 27-29, 2003
O®0W¹p: Singapore, SINGAPORE
O®^©RFU: IFIP-TC6.; A Star, Inst Infocomm Res.
\OsQ.Í: reliable multicast; mobile multicast; mobile IPv6; reliable mobile multicast protocol; RRHMoM
Xd: We propose a basic mobile multicast scheme in Mobile IPv6 called previous network subscription (PS). In PS, when a mobile host moves to a new foreign network, it will build a bi-directional tunnel with its previous network, so mobile host can continue to receive multicast packets soon after handover. We also propose a new reliable mobile multicast protocol called RRHMoM (Reliable Region based Hierarchical Mobile Multicast). It combines PS and remote subscription (RS). Hierarchical architecture is adopted in RRHMoM. The acknowledge mechanism combines NAK and ACK Simulation results show that RRHMoM has better performance than existing reliable mobile multicast protocols.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Sun, LM, Chinese Acad Sci, Inst Software, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: WORLD SCIENTIFIC PUBL CO PTE LTD
úQHrFU0W@W: PO BOX 128 FARRER RD, SINGAPORE 9128, SINGAPORE
ISBN: 981-238-686-6
egne.sux¡pe: 4
f[Ñy{|+R: Telecommunications
ISI e.s O÷S: BCN79

--------------------------------------------------------------------------------
>f:y 2 agÿqQ 38 ag
\O: Liu, R; Dong, SQ; Hong, XL; Long, D; Gu, J
: Tang, TA; Li, WH; Yu, HH
h: Two-dimensional common-centroid stack generation algorithms for analog VLSI
egnúQHrir: 2003 5TH INTERNATIONAL CONFERENCE ON ASIC, VOLS 1 AND 2, PROCEEDINGS: 128-131 2003
í: English
e.s{|W: Proceedings Paper
O®h: 5th International Conference on ASIC
O®åeg: OCT 21-24, 2003
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: IEEE, Beijing Sect.; CIE.; IEE, Beijing Branch.; IEEE CAS.
KeyWords Plus: PLACEMENT
Xd: In analog VLSI design, two-dimensional common-centroid stacks, in which devices are two-dimensional symmetry and have a common-centroid, are critical for mismatch minimization and parasitic control. However it is difficult to Construct due to several constrains of layout. In this paper, algorithms for generating analog VLSI two-dimensional common-centroid stack 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 two-dimensional common-centroid stack construction are developed. The generated stacks are two-dimensional symmetric and common - centroid. Several stacks with different ratio are generated for one group of devices and they could be chosen during placement according to the performance and area consideration. Experimental results show effectiveness of our algorithms.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Liu, R, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-7889-X
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Hardware & Architecture; Engineering, Manufacturing; Engineering, Electrical & Electronic
ISI e.s O÷S: BY56E

--------------------------------------------------------------------------------
>f:y 3 agÿqQ 38 ag
\O: Xu, C; Jin, BH
: Werner, B
h: Conformance test of distributed transaction service
egnúQHrir: ATS 2003: 12TH ASIAN TEST SYMPOSIUM, PROCEEDINGS: 216-219 2003
í: English
e.s{|W: Proceedings Paper
O®h: 12th Asian Test Symposium
O®åeg: NOV 16-19, 2003
O®0W¹p: XIAN, PEOPLES R CHINA
O®^©RFU: IEEE Comp Soc, Test Technol Tech Council.; Natl Nat Sci Fdn China, CCF, Tech Comm Fault Tolerant Comp.
Xd: As a key component of J2EE application servers distributed transaction manager following JTS and JTA specifications plays an important role in distributed transaction environment. This paper explores the conformance test of distributed transaction service by broadening the application of protocol conformance test theory and techniques. This paper also presents the formal representation of distributed transaction service and the corresponding test case generation not based on personal experience.
0W@W: Chinese Acad Sci, Technol Ctr Software Engn, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Xu, C, Chinese Acad Sci, Technol Ctr Software Engn, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 5
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-1951-2
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Hardware & Architecture; Computer Science, Software Engineering
ISI e.s O÷S: BY38Z

--------------------------------------------------------------------------------
>f:y 4 agÿqQ 38 ag
\O: Qiang, W; Wang, HA; Hong, J; Dai, GZ
fNM|âVSO\O: IEEE
h: Design and evaluation of priority table based real-time scheduling algorithms
egnúQHrir: 2003 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS, INTELLIGENT SYSTEMS AND SIGNAL PROCESSING, VOLS 1 AND 2, PROCEEDINGS: 1294-1299 2003
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on Robotics, Intelligent Systems and Signal Processing
O®åeg: OCT 08-13, 2003
O®0W¹p: Changsha, PEOPLES R CHINA
O®^©RFU: Chinese High tech Dev Program.; Chinese Acad Sci.; Chinese Soc Automat.; IEEE Syst, Man & Cybernet Soc.; Chinese Univ Hong Kong.; Natl Univ Def Technol.; IEEE Hong Kong RA & CS Joint Chapter.; Joint Ctr Intelligen Sensing & Syst.; Sch Elect Sci & Engn.; Sch Mechatron Engn & Automat.
Xd: This paper proposes a new scheduling scheme based on priority table design by integrating two or more characteristic parameters of a task. Two real-time scheduling algorithms from the scheme are presented: EDV (Earliest Deadline first with larger Value) and VED (Value first with Earlier Deadline). Compared to the classical EDF and HVF algorithms, simulations show that the proposed algorithms improve performance under all workload situations.
0W@W: Chinese Acad Sci, Intelligence Engn Lab, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Qiang, W, Chinese Acad Sci, Intelligence Engn Lab, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-7925-X
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence; Robotics; Imaging Science & Photographic Technology
ISI e.s O÷S: BY96S

--------------------------------------------------------------------------------
>f:y 5 agÿqQ 38 ag
\O: Wu, YC; Zheng, HP; Huang, K
: Ismail, M; Azhar, H; Abdalla, AGE; Anuar, K
h: The performance analysis and simulation of header compression in VoIP services over cellular links
egnúQHrir: APCC 2003: 9TH ASIA-PACIFIC CONFERENCE ON COMMUNICATION, VOLS 1-3, PROCEEDINGS: 644-647 2003
í: English
e.s{|W: Proceedings Paper
O®h: 9th Asia-Pacific Conference on Communications held in conjunction with the 6th Malaysia International Conference on Communications (MICC 2003)
O®åeg: SEP 21-24, 2003
O®0W¹p: Penang, MALAYSIA
O®^©RFU: ComSoc Chapter, Malaysia.; Malaysia Int Conf Commun.; EIC.; Int Elect Informat & Commun Engineers.; Telekom Malaysia Berhad.; Commun Soc Chapter, IEEE Malaysia Sect.; Korea Inst Commun Sci.
\OsQ.Í: wireless VoIP; header compresson; CRTP; ROHC
Xd: In future all IP cellular system, the requirement in terms of voice quality and spectrum efficiency for voice over IP services will reasonably be similar to current requirement on the circuit switched voice services. Hence, comparing with payload, the relatively large IP/UDP/RTP headers of wireless VoIP must be reduced in size by header compression. This paper detailedly analyzes two main header compression algorithms used in current wireless VoIP services. By simulation, the performance of these algorithms in cellular links is evaluated and compared.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Wu, YC, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 6
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-8114-9
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Information Systems; Telecommunications
ISI e.s O÷S: BY58Z

--------------------------------------------------------------------------------
>f:y 6 agÿqQ 38 ag
\O: Lei, W; Cheng, WM; Sun, LM
fNM|âVSO\O: IEEE
h: Improved joint carrier and sampling frequency offset estimation scheme for OFDM systems
egnúQHrir: GLOBECOM'03: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-7: 2315-2319 2003
NfNh: IEEE Global Telecommunications Conference (Globecom)
í: English
e.s{|W: Proceedings Paper
O®h: IEEE Global Telecommunications Conference (GLOBECOM 03)
O®åeg: DEC 01-05, 2003
O®0W¹p: San Francisco, CA
O®^©RFU: IEEE.; ICC.; IEEE Commun Soc.
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Dept Multimedia Commun, Beijing 100080, Peoples R China
¯\O0W@W: Lei, W, Chinese Acad Sci, Inst Software, Dept Multimedia Commun, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-7974-8
29 W[&{vegnúQHrir
Tðy)Q: GLOB TELECOMM CONF
egne.sux¡pe: 5
f[Ñy{|+R: Engineering, Electrical & Electronic; Telecommunications
ISI e.s O÷S: BY73X

--------------------------------------------------------------------------------
>f:y 7 agÿqQ 38 ag
\O: Yang, G; Fei, GZ; Wu, EH
: Wu, E; Sun, H; Qi, D
h: Real-time fur with biological pattern
egnúQHrir: CAD/ GRAPHICS TECHNOLOGY AND ITS APPLICATIONS, PROCEEDINGS: 78-+ 2003
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on CAD/Graphics
O®åeg: OCT 29-31, 2003
O®0W¹p: Macao, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; Natl Nat Sci Fdn China.; Macao Fdn.; Macao Univ Sci & Technol.; Univ Macau.; Chinese Univ Hong Kong.
\OsQ.Í: hair rendering; reaction-diffusion; vertex shader; pixel shader
Xd: Pattern effect of fur is an important characteristic of many animals. This paper puts forward a method that 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.
0W@W: Chinese Acad Sci, Key Lab Comp Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Yang, G, Chinese Acad Sci, Key Lab Comp Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: MACAO FOUNDATION
úQHrFU0W@W: AVENIDA DA REPUBLICA 6, MACAU, TAIPA, MACAO 00000, PEOPLES R CHINA
ISBN: 99937-710-4-X
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Software Engineering; Imaging Science & Photographic Technology
ISI e.s O÷S: BAY65

--------------------------------------------------------------------------------
>f:y 8 agÿqQ 38 ag
\O: Sun, QJ; Wu, EH
: Wu, E; Sun, H; Qi, D
h: A color edge detector with texture analysis ability
egnúQHrir: CAD/ GRAPHICS TECHNOLOGY AND ITS APPLICATIONS, PROCEEDINGS: 99-+ 2003
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on CAD/Graphics
O®åeg: OCT 29-31, 2003
O®0W¹p: Macao, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; Natl Nat Sci Fdn China.; Macao Fdn.; Macao Univ Sci & Technol.; Univ Macau.; Chinese Univ Hong Kong.
\OsQ.Í: color quantization; edge detection; texture analysis; thresholding; image thinning
Xd: Edge is an important feature in the image analysis and computer vision domain, but it is still very difficult to detect the edges caused by color and texture. In this paper a color edge detector is designed to make use of intensity, color and texture. Firstly, a gray component is derived front the color image, and the canny operator is used to detect the edges in the gay image. Secondly, the colors of the input image are quantized to get a small set of representative colors, and the color-texture edges are detected based on the spatial distribution of the representative colors. Finally, the gray, color-texture edges are combined to get all edges in the color image. Experimental results show that the algorithm. makes use of intensity and color information, and removes the false edge points that are inside texture regions. The detected edges can be used by object detection and recognition tasks.
0W@W: Chinese Acad Sci, Key Lab Comp Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Sun, QJ, Chinese Acad Sci, Key Lab Comp Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: MACAO FOUNDATION
úQHrFU0W@W: AVENIDA DA REPUBLICA 6, MACAU, TAIPA, MACAO 00000, PEOPLES R CHINA
ISBN: 99937-710-4-X
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Software Engineering; Imaging Science & Photographic Technology
ISI e.s O÷S: BAY65

--------------------------------------------------------------------------------
>f:y 9 agÿqQ 38 ag
\O: Guo, LZ; Fei, GZ; Wang, WC; Wu, EH
: Wu, E; Sun, H; Qi, D
h: Texture crucial metric for model simplification
egnúQHrir: CAD/ GRAPHICS TECHNOLOGY AND ITS APPLICATIONS, PROCEEDINGS: 119-+ 2003
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on CAD/Graphics
O®åeg: OCT 29-31, 2003
O®0W¹p: Macao, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; Natl Nat Sci Fdn China.; Macao Fdn.; Macao Univ Sci & Technol.; Univ Macau.; Chinese Univ Hong Kong.
\OsQ.Í: metric; texture; visual feature; model simplification; rendering
Xd: Level-of-details construction of the model has been an important topic in computer graphics. However, the existing methods are mostly based on the geometric features, which are difficult to handle the model with a texture image for improving the rendering quality. By well measuring the feature variation of the texture image and the texture distortion in the simplification, a new metric is presented in this paper to efficiently combine texture features with geometric features, for the models to be simplified with important visual information preserved well to render high quality images. The new metric can be easy to apply with efficient simplification methods and support the user-guide simplification to preserve the semantically crucial parts.
0W@W: Chinese Acad Sci, Key Lab Comp Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Guo, LZ, Chinese Acad Sci, Key Lab Comp Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 17
«_!k: 0
úQHrFU: MACAO FOUNDATION
úQHrFU0W@W: AVENIDA DA REPUBLICA 6, MACAU, TAIPA, MACAO 00000, PEOPLES R CHINA
ISBN: 99937-710-4-X
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Software Engineering; Imaging Science & Photographic Technology
ISI e.s O÷S: BAY65

--------------------------------------------------------------------------------
>f:y 10 agÿqQ 38 ag
\O: Li, S; Liu, XH; Wu, EH
: Wu, E; Sun, H; Qi, D
h: Combination of hierarchical visibility with CLOD terrain
egnúQHrir: CAD/ GRAPHICS TECHNOLOGY AND ITS APPLICATIONS, PROCEEDINGS: 177-+ 2003
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on CAD/Graphics
O®åeg: OCT 29-31, 2003
O®0W¹p: Macao, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; Natl Nat Sci Fdn China.; Macao Fdn.; Macao Univ Sci & Technol.; Univ Macau.; Chinese Univ Hong Kong.
\OsQ.Í: hierarchical visibility; horizon; level of detail; conservative block culling; terrain rendering
KeyWords Plus: VISUALIZATION
Xd: Real-time rendering of large-scale terrain is one of the important subjects in virtual reality technology. In this paper, we propose a fast terrain rendering algorithm that combines hierarchical visibility with continuous level of detail for terrain walk through. To make use of horizon of terrain, the hierarchical visibility structure are set up for the multi-resolution model in preprocessing stage. With the visibility structure, the visibility of multi-resolution terrain block can be quickly determined. Thus the number of terrain vertices to be processed and the triangles to be rendered can be greatly reduced by culling those invisible blocks. At the same time, our visibility computation method guarantee that the visibility is conservative and reduce visual artifact in spite of changes between models with different resolutions. The experimental result shows that the algorithm is feasible to enhance rendering efficiency.
0W@W: Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Li, S, Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 15
«_!k: 0
úQHrFU: MACAO FOUNDATION
úQHrFU0W@W: AVENIDA DA REPUBLICA 6, MACAU, TAIPA, MACAO 00000, PEOPLES R CHINA
ISBN: 99937-710-4-X
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Software Engineering; Imaging Science & Photographic Technology
ISI e.s O÷S: BAY65

--------------------------------------------------------------------------------
>f:y 11 agÿqQ 38 ag
\O: Wang, DL; Han, YS; Dai, RW
h: Analysis of enterprise decision-making from the point of view complexity
egnúQHrir: DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS: 38-45 Suppl. SI 2003
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Symposium on Intelligent and Complex Systems
O®åeg: OCT 17-20, 2001
O®0W¹p: Wuhan, PEOPLES R CHINA
\OsQ.Í: complexity; enterprise decision-making; enterprise modeling and simulation; metasynthesis; ARIS; human-machine integration
Xd: Researches about complexity and the metasynthesis are introduced first in this paper. Consisting of many subsystems and involving lots of human actions, a big enterprise is a complex giant system and has close relationship with its environment. Therefore, this is a open complex giant system problem. The effective method for solving this problem is the "metasynthesis from qualitative to quantitative" or "the hall for workshop of metasynthetic engineering". The enterprise decisions are usually made by qualitative methods, based on managers' experience and simple data analysis. The architecture of the hall for workshop of metasynthesis engineering is given in this paper, in which enterprise modeling is very important. As a method of model analysis, ARIS is integrated into the hall for workshop in this paper. A simple example is given out. Based on the simulation results and the managers' experience, a better model is achieved finally.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Chinese Acad Sci, Inst Automat, Beijing 100080, Peoples R China
¯\O0W@W: Wang, DL, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: danli_wang@163.net
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: WATAM PRESS
úQHrFU0W@W: C/O DCDIS JOURNAL, 317 KAREN PLACE, WATERLOO, ONTARIO N2L 6K8, CANADA
ISSN: 1492-8760
29 W[&{vegnúQHrir
Tðy)Q: DYN CONT DISCR IMP SYST SER B
ISO egne.súQHrir
Tðy)Q: Dyn. Contin. Discret. Impuls. Syst. Ser. B-Appl. Algorithms
egne.sux¡pe: 8
f[Ñy{|+R: Mathematics, Applied
ISI e.s O÷S: 823FX

--------------------------------------------------------------------------------
>f:y 12 agÿqQ 38 ag
\O: Chen, J; Lin, HM
: Aichernig, BK; Maibaum, T
h: Making timed automata communicate
egnúQHrir: FORMAL METHODS AT THE CROSSROADS: FROM PANACEA TO FOUNDATIONAL SUPPORT, 2757: 337-351 2003
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 10th Colloquium of the United-Nations-University-International-Institute-for-Software-Technology (UNU/ISST)
O®åeg: MAR 18-20, 2002
O®0W¹p: Lisbon, PORTUGAL
O®^©RFU: UN Univ Int Inst Software Technol.
\OsQ.Í: real-time; value-passing; timed automata; timed symbolic transition graph
Xd: A computation model is introduced in which real-time constraints as well as data communications can be explicitely expressed. The model is presented in a graphical form. Its semantics is studied and algorithms to compute bisimulation equivalences for such graphs are proposed.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Chen, J, Chinese Acad Sci, Inst Software, Comp Sci Lab, POB 8718, Beijing 100080, Peoples R China.
5uP[®±{0W@W: cj@ios.ac.cn; lhm@ios.ac.cn
_(uvÂSe.spe: 22
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-20527-6
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 15
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BY66U

--------------------------------------------------------------------------------
>f:y 13 agÿqQ 38 ag
\O: Wang, GL; Han, XX; Zhu, B
: Zhou, JY; Yung, M; Han, YF
h: On the security of two threshold signature schemes with traceable signers
egnúQHrir: APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PROCEEDINGS, 2846: 111-122 2003
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Conference on Applied Cryptography and Network Security
O®åeg: OCT 16-19, 2003
O®0W¹p: KUNMING, PEOPLES R CHINA
O®^©RFU: Int Commun & Informat Secur Assoc.
\OsQ.Í: digital signature; threshold signature; cryptanalysis
KeyWords Plus: DSS SIGNATURES; ROBUST
Xd: A (t, n) threshold signature scheme allows t or more group members to generate signatures on behalf of a group with n members, while any t-1 or less members cannot do the same thing. In 2001, based on a variant of ElGamal digital signature scheme, Li et al. proposed two (t, n) threshold signature schemes with traceable signers. One of their schemes needs the assistance of a mutually trusted center, while the other does not. In this paper, we present a security analysis on their schemes. We first point out that in fact signers in their schemes are untraceable, since anybody can convert a valid threshold signature into a new one such that another subset of group members will be wrongly considered as the signers of the new threshold signature for the same message. Furthermore, we demonstrate an attack to show that their second threshold signature scheme is insecure. In our attack, (n - t + 1) colluding members can control the group secret key. Therefore, they can generate valid threshold signature for any message without the help of other members. Furthermore, honest members cannot detect this security flaw in the system, since any t members can generate threshold signatures according to the prescribed protocols.
0W@W: Inst Infocomm Res, Infocomm Secur Dept, Singapore 119613, Singapore; Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Wang, GL, Inst Infocomm Res, Infocomm Secur Dept, 21 Heng Mui Keng Terrace, Singapore 119613, Singapore.
5uP[®±{0W@W: glwang@i2r.a-star.edu.sg; xiaoxi@i2r.a-star.edu.sg; zhubo@i2r.a-star.edu.sg
_(uvÂSe.spe: 14
«_!k: 3
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-20208-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BY17G

--------------------------------------------------------------------------------
>f:y 14 agÿqQ 38 ag
\O: Yao, G; Ren, K; Bao, F; Deng, RH; Feng, DG
: Zhou, JY; Yung, M; Han, YF
h: Making the key agreement protocol in mobile ad hoc network more efficient
egnúQHrir: APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PROCEEDINGS, 2846: 343-356 2003
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Conference on Applied Cryptography and Network Security
O®åeg: OCT 16-19, 2003
O®0W¹p: KUNMING, PEOPLES R CHINA
O®^©RFU: Int Commun & Informat Secur Assoc.
\OsQ.Í: mobile ad hoc networks; key agreement; hierarchical; security
Xd: Mobile ad hoc networks offer convenient infrastructureless communications over the shared wireless channel. However, the nature of mobile ad hoc networks makes them vulnerable to security attacks, such as passive eavesdropping over the wireless channel and denial of service attacks by malicious nodes. To ensure the security, several cryptography protocols are implemented. Due to the resource scarcity in mobile ad hoc networks, the protocols must be communication efficient and need as less computational power as possible. Broadcast communication is an important operation for many application in mobile ad hoc networks. To securely broadcast a message, all the members in the network need share a group key so that they can use efficient symmetric encryption, such as DES and AES. Several group key management protocols have been proposed. However, not all of them are communication efficient when applied to mobile ad hoc networks. In this paper, we propose a hierarchical key agreement protocol that is communication efficient to mobile ad hoc networks. We also show how to manage the group efficiently in a mobile environment.
0W@W: Inst InfoComm Res, InfoComm Secur Dept, Singapore 119613, Singapore; Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Yao, G, Inst InfoComm Res, InfoComm Secur Dept, 21 Heng Mui,Keng Terrace, Singapore 119613, Singapore.
5uP[®±{0W@W: yaogang@i2r.a-star.edu.sg; renkui@i2r.a-star.edu.sg; baofeng@i2r.a-star.edu.sg; deng@i2r.a-star.edu.sg; fengdg@263.net
_(uvÂSe.spe: 21
«_!k: 6
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-20208-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 14
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BY17G

--------------------------------------------------------------------------------
>f:y 15 agÿqQ 38 ag
\O: Li, GY; Tang, ZS
: Ohori, A
h: Translating a continuous-time temporal logic into timed automata
egnúQHrir: PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS, 2895: 322-338 2003
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st Asian Symposium on Programming Languages and Systems
O®åeg: NOV 27-29, 2003
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: Asian Assoc Fdn Software.; Beihang Univ.
KeyWords Plus: REAL-TIME; SYSTEMS
Xd: LTLC is a continuous-time linear temporal logic for the specification of real-time systems. It can express both real-time systems and their properties. With LTLC, real-time systems can be described at different 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. The full logic of LTLC is undecidable. This paper will show that the existentially quantified fragment of LTLC is decidable. We achieve this goal by showing that the fragment can be translated into timed automata. Because the emptiness problem for timed automata is decidable, we then get a decision procedure for satisfiability for this fragment. This decidable part of LTLC is quite expressive. Many important real-time properties, such as bounded-response and bounded-invariance properties, can be expressed in it. The translation also enables us to develop a decision procedure for model checking real-time systems with quantifier-free LTLC specifications.
0W@W: Chinese Acad Sci, Key Lab Comp Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Li, GY, Chinese Acad Sci, Key Lab Comp Sci, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: ligy@ios.ac-cn; cst@ios.ac-cn
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-20536-5
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 17
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BY12F

--------------------------------------------------------------------------------
>f:y 16 agÿqQ 38 ag
\O: Ren, ZH; Cao, JN; Chan, ATS; Li, J
: Zhou, XM; Jahnichen, S; Xu, M; Cao, JN
h: Composition and automation of grid services
egnúQHrir: ADVANCED PARALLEL PROCESSING TECHNOLOGIES, PROCEEDINGS, 2834: 352-362 2003
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 5th International Workshop on Advanced Parallel Processing Technologies
O®åeg: SEP 17-19, 2003
O®0W¹p: XIAMEN, PEOPLES R CHINA
O®^©RFU: APC CCF.; Natl Nat Sci Fdn China.; Xiamen Software Pk.
Xd: A grid service is a Web service that provides a set of well-defined interfaces and that follows specific conventions. Composition of grid services combines the offerings of two or more grid services to achieve the desired computing goals. Candidate standards have been proposed, providing a foundation for service composition specifications. However, at a higher level, there is no framework that supports service composition construction and automation. In this paper, we propose a framework that facilitates the visual composition as well as automation of service compositions. The framework is based mainly on Service Composition Graph (SCG), the underlying formalism for service compositions. Using graph grammar and graph transformation defined on SCG, the static topological structure of a service composition can be described and the automation of the constructed service compositions is also facilitated. We also outline the design and implementation of the prototype.
0W@W: Hong Kong Polytech Univ, Dept Comp, Kowloon, Hong Kong, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Ren, ZH, Hong Kong Polytech Univ, Dept Comp, Kowloon, Hong Kong, Peoples R China.
_(uvÂSe.spe: 20
«_!k: 3
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-20054-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 11
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BY05L

--------------------------------------------------------------------------------
>f:y 17 agÿqQ 38 ag
\O: Hong, F; Wu, ZM
: George, AD; Johnson, E; Richard, GG; Xue, GL
h: Multifractal analysis and model of the MPEG-4 video traffic
egnúQHrir: 2003 IEEE INTERNATIONAL PERFORMANCE, COMPUTING, AND COMMUNICATIONS CONFERENCE PROCEEDINGS: 463-467 2003
NfNh: IEEE International Performance, Computing and Communications Conference (IPCCC)
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Performance, Computing and Communications Conference
O®åeg: APR 09-11, 2003
O®0W¹p: PHOENIX, AZ
O®^©RFU: IEEE Comp Soc.; IEEE Comp Soc, Tech Comm Internet.; IEEE Commun Soc.
KeyWords Plus: NETWORKS
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Multimedia & Network Res Ctr, Beijing 100080, Peoples R China
¯\O0W@W: Hong, F, Chinese Acad Sci, Inst Software, Multimedia & Network Res Ctr, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISSN: 1097-2641
ISBN: 0-7803-7893-8
29 W[&{vegnúQHrir
Tðy)Q: IEEE IPCCC
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Information Systems; Computer Science, Theory & Methods; Telecommunications
ISI e.s O÷S: BW73S

--------------------------------------------------------------------------------
>f:y 18 agÿqQ 38 ag
\O: Ma, CX; Dai, GZ
: Pan, ZG; Shi, JY
h: Gesture language use in natural UI: Pen-based sketching in conceptual design
egnúQHrir: THIRD INTERNATIONAL CONFERENCE ON VIRTUAL REALITY AND ITS APPLICATION IN INDUSTRY, 4756: 122-128 2003
NfNh: PROCEEDINGS OF THE SOCIETY OF PHOTO-OPTICAL INSTRUMENTATION ENGINEERS (SPIE)
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Virtual Reality and Its Application in Industry
O®åeg: APR 09-12, 2002
O®0W¹p: HANGZHOU, PEOPLES R CHINA
O®^©RFU: China Soc Image & Graph.; Eurographics.; VR Soc Japan.; Korean Assoc VR.; IEEE CS Beijing.; Nat Sci Fdn China.
\OsQ.Í: gesture description language; conceptual design; feature; strokes; constraints
Xd: 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(1) 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 languages (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.
0W@W: Chinese Acad Sci, Inst Software, Human Comp Interact & Informat Proc Lab, Beijing, Peoples R China
¯\O0W@W: Ma, CX, Chinese Acad Sci, Inst Software, Human Comp Interact & Informat Proc Lab, Beijing, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: SPIE-INT SOC OPTICAL ENGINEERING
úQHrFU0W@W: 1000 20TH ST, PO BOX 10, BELLINGHAM, WA 98227-0010 USA
ISSN: 0277-786X
ISBN: 0-8194-4519-3
29 W[&{vegnúQHrir
Tðy)Q: P SOC PHOTO-OPT INSTRUM ENG
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Software Engineering; Computer Science, Theory & Methods; Engineering, Electrical & Electronic
ISI e.s O÷S: BW54T

--------------------------------------------------------------------------------
>f:y 19 agÿqQ 38 ag
\O: Sun, QJ; Wu, EH
: Skala, V
h: Probability estimation for people detection
egnúQHrir: WSCG'2003, VOL 11, NO 3, CONFERENCE PROCEEDINGS: 448-455 2003
í: English
e.s{|W: Proceedings Paper
O®h: 11th International Conference on Computer Graphics, Visualization and Computer Vision 2003
O®åeg: FEB 03-07, 2003
O®0W¹p: PLZEN, CZECH REPUBLIC
O®;NR¹e: UNIV W BOHEMIA
\OsQ.Í: people detection; image segmentation rectangle fitting; probability estimation
KeyWords Plus: IMAGES; BODY
Xd: This paper presents a probability method for detecting people in a static image. We simplify people as a torso and four limbs. The torso is fitted by a quadrangle, and each limb is fitted by one or two quadrangles depending on its pose. In order to find people, we should try to find a combination of quadrangles that must satisfy some geometric and topological constrains. Firstly, we try to detect and fit rectangle regions in the image, then we search some combinations of rectangles under certain constrains. After we get a combination, we calculate its probability of being people. If the probability is above threshold, we adjust the vertexes of rectangles so as to get a compact people model.
0W@W: Chinese Acad Sci, Inst Software, Key Lab Comp Sci, Beijing 100080, Peoples R China
¯\O0W@W: Sun, QJ, Chinese Acad Sci, Inst Software, Key Lab Comp Sci, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: UNIV WEST BOHEMIA
úQHrFU0W@W: PILSEN UNIVERZITNI 8, PLZEN 306 14, CZECH REPUBLIC
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Software Engineering; Imaging Science & Photographic Technology
ISI e.s O÷S: BW81B

--------------------------------------------------------------------------------
>f:y 20 agÿqQ 38 ag
\O: Hong, F; Wu, ZM
fNM|âVSO\O: IEEE; IEEE
h: A novel traffic model based on wavelet analysis
egnúQHrir: 2003 INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY, VOL 1 AND 2, PROCEEDINGS: 1392-1395 2003
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Communication Technology
O®åeg: APR 09-11, 2003
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: CIC.; CIE.; IEEE.; IEEE Communicat Soc.; IEEE Press.; Beijing Univ Post & Telecommunicat Press.; Minist Informat Ind.; Natl Nat Sci Fdn China.
\OsQ.Í: traffic modeling; wavelet; LRD; multifractal; fractional Brownian motion
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Multimedia Res Ctr, Beijing 100864, Peoples R China
¯\O0W@W: Hong, F, Chinese Acad Sci, Inst Software, Multimedia Res Ctr, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: BEIJING UNIV POSTS TELECOMMUNICAT PRESS
úQHrFU0W@W: XI TU CHEG RD 10 HAIDIAN, BEIJING 100876, PEOPLES R CHINA
ISBN: 7-5635-0686-1
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Information Systems; Engineering, Electrical & Electronic; Telecommunications
ISI e.s O÷S: BX37F

--------------------------------------------------------------------------------
>f:y 21 agÿqQ 38 ag
\O: Hong, F; Wu, ZM
fNM|âVSO\O: IEEE; IEEE
h: A novel estimation of Hurst index based on wavelet
egnúQHrir: 2003 INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY, VOL 1 AND 2, PROCEEDINGS: 1447-1450 2003
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Communication Technology
O®åeg: APR 09-11, 2003
O®0W¹p: BEIJING, PEOPLES R CHINA
O®^©RFU: CIC.; CIE.; IEEE.; IEEE Communicat Soc.; IEEE Press.; Beijing Univ Post & Telecommunicat Press.; Minist Informat Ind.; Natl Nat Sci Fdn China.
\OsQ.Í: self similar; Hurst index; wavelet
Xd: 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 or traffic enforcement and congestion control in high-speed networks.
0W@W: Chinese Acad Sci, Inst Software, Multimedia Res Ctr, Beijing 100864, Peoples R China
¯\O0W@W: Hong, F, Chinese Acad Sci, Inst Software, Multimedia Res Ctr, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: BEIJING UNIV POSTS TELECOMMUNICAT PRESS
úQHrFU0W@W: XI TU CHEG RD 10 HAIDIAN, BEIJING 100876, PEOPLES R CHINA
ISBN: 7-5635-0686-1
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Information Systems; Engineering, Electrical & Electronic; Telecommunications
ISI e.s O÷S: BX37F

--------------------------------------------------------------------------------
>f:y 22 agÿqQ 38 ag
\O: Chen, A; Ye, HL
: JardimGoncalves, R; Cha, J; SteigerGarcao, A
h: Fuzzy multiple-level sequential patterns discovery from customer transaction database
egnúQHrir: CONCURRENT ENGINEERING: ENHANCED INTEROPERABLE SYSTEMS: 37-42 2003
í: English
e.s{|W: Proceedings Paper
O®h: 10th International Conference on Concurrent Engineering
O®åeg: JUL 26-30, 2003
O®0W¹p: MADEIRA, PORTUGAL
O®^©RFU: Int Soc Productiv Enhancement.; FCT.; Fundacao Oriente.; Fundacao Luso Amer.; Dept Engenharia Electrotecn.; UNINOVA.
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Chen, A, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: A A BALKEMA PUBLISHERS
úQHrFU0W@W: SCHIPHOLWEG 107C, PO BOX 447, 2316 XC LEIDEN, NETHERLANDS
ISBN: 90-5809-623-8
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Theory & Methods; Engineering, Manufacturing
ISI e.s O÷S: BX40P

--------------------------------------------------------------------------------
>f:y 23 agÿqQ 38 ag
\O: Yang, ZJ; Wu, F; Li, SP
fNM|âVSO\O: IEEE; IEEE
h: Rate distortion optimization in the scalable video coding
egnúQHrir: PROCEEDINGS OF THE 2003 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL II - COMMUNICATIONS-MULTIMEDIA SYSTEMS & APPLICATIONS : 884-887 2003
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Symposium on Circuits and Systems
O®åeg: MAY 25-28, 2003
O®0W¹p: BANGKOK, THAILAND
O®^©RFU: IEEE Circuits & Syst Soc.; Mahanakorn Univ Technol.
KeyWords Plus: FINE GRANULARITY SCALABILITY; COMPRESSION
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Yang, ZJ, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 19
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-7761-3
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Hardware & Architecture; Engineering, Electrical & Electronic; Imaging Science & Photographic Technology
ISI e.s O÷S: BX26N

--------------------------------------------------------------------------------
>f:y 24 agÿqQ 38 ag
\O: Liu, R; Dong, SQ; Hong, XL; Long, D; Gu, J
fNM|âVSO\O: IEEE; IEEE
h: Algorithms for analog VLSI 2D stack generation and block merging
egnúQHrir: PROCEEDINGS OF THE 2003 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL IV - DIGITAL SIGNAL PROCESSING-COMPUTER AIDED NETWORK DESIGN-ADVANCED TECHNOLOGY : 716-719 2003
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Symposium on Circuits and Systems
O®åeg: MAY 25-28, 2003
O®0W¹p: BANGKOK, THAILAND
O®^©RFU: IEEE Circuits & Syst Soc.; Mahanakorn Univ Technol.
KeyWords Plus: PLACEMENT
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Liu, R, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-7761-3
egne.sux¡pe: 4
f[Ñy{|+R: Engineering, Electrical & Electronic
ISI e.s O÷S: BX30U

--------------------------------------------------------------------------------
>f:y 25 agÿqQ 38 ag
\O: Li, S; Liu, XH; Wu, EH
: Rokne, J; Klein, R; Wang, W
h: Feature-based visibility-driven CLOD for terrain
egnúQHrir: 11TH PACIFIC CONFERENCE ON COMPUTER GRAPHICS AND APPLICATIONS, PROCEEDINGS: 313-322 2003
í: English
e.s{|W: Proceedings Paper
O®h: 11th Pacific Conference on Computer Graphics and Applications
O®åeg: OCT 08-10, 2003
O®0W¹p: CANMORE, CANADA
O®^©RFU: Silicon Graph Inc.; iCore.; Univ Calgary.
KeyWords Plus: HORIZON COMPUTATION; VISUALIZATION
Xd: View-dependent level-of-detail (LOD) and visibility culling are two powerful tools for accelerating the rendering of very large models in real-time visualization, especially in walkthrough of a large-scale terrain environment. In this paper, we propose a visibility-driven Continuous LOD (CLOD) framework for terrain, which takes advantage of both techniques. The visibility determination is based on the well-known occlusion horizon algorithm. By making use of the features of the terrain extracted in pre-processing stage, a new cascading occlusion culling (COC) algorithm is proposed to cull those regions classified as invisible to current viewpoint in real time. The time consumption and storage overheads that we spend on visibility preprocessing are quite small. risibility-driven CLOD enhances culling efficiency and improves the frame rates significantly for walkthrough of a terrain environment.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing, Peoples R China
¯\O0W@W: Li, S, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing, Peoples R China.
_(uvÂSe.spe: 30
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2028-6
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BX85R

--------------------------------------------------------------------------------
>f:y 26 agÿqQ 38 ag
\O: Zhang, JL; Qu, WM; Du, L; Sun, YF
fNM|âVSO\O: IEEE; IEEE
h: A framework for domain-specific search engine: Design pattern perspective
egnúQHrir: 2003 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOLS 1-5, CONFERENCE PROCEEDINGS: 3881-3886 2003
NfNh: IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, CONFERENCE PROCEEDINGS
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on Systems, Man and Cybernetics (SMC 03)
O®åeg: OCT 05-08, 2003
O®0W¹p: WASHINGTON, D.C.
O®^©RFU: IEEE, Syst, Man & Cybernet Soc.
\OsQ.Í: domain specific search engine; application framework; design pattern
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, JL, Chinese Acad Sci, Inst Software, POB 8717, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISSN: 1062-922X
ISBN: 0-7803-7952-7
29 W[&{vegnúQHrir
Tðy)Q: IEEE SYS MAN CYBERN
egne.sux¡pe: 6
f[Ñy{|+R: Automation & Control Systems; Computer Science, Artificial Intelligence; Computer Science, Cybernetics; Computer Science, Interdisciplinary Applications; Computer Science, Software Engineering; Robotics
ISI e.s O÷S: BX83D

--------------------------------------------------------------------------------
>f:y 27 agÿqQ 38 ag
\O: Wang, Q; Wang, HA; Tang, H; Dai, GZ
fNM|âVSO\O: IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY
h: Adaptive real-time publish-subscribe service model for mobile communication environments
egnúQHrir: 2003 INTERNATIONAL CONFERENCE ON COMPUTER NETWORKS AND MOBILE COMPUTING, PROCEEDINGS: 224-229 2003
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Conference on Computer Networks and Mobile Computing
O®åeg: OCT 20-23, 2003
O®0W¹p: SHANGHAI, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; IEEE Comp Soc Beijing Ctr.; IEEE Comp Soc, TC Distributed Proc.; Shanghai Comp Soc.
Xd: With the rapid advances in mobile computing technology, there is increasing demand for disseminating information to large numbers of clients with wireless network. The service model, which supports such mobile communication environments, should be scalable, flexible, and cater to the limited bandwidth of mobile clients while providing real-time guarantees. In this paper, we present high-level design of an adaptive real-time publish-subscribe model for mobile communication environments. To express the model and the underlying work mechanism, we define four primitives: publish, subscribe, activate and deactivate. Furthermore, we discuss how to achieve the adaptability and real-time property in the model. Primary simulation study shows that the service model is feasible and well suited to address the requirements of mobile computing. In conclusion, we identify some open problems and our future work.
0W@W: Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100864, Peoples R China
¯\O0W@W: Wang, Q, Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2033-2
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Hardware & Architecture; Computer Science, Software Engineering; Engineering, Electrical & Electronic; Telecommunications
ISI e.s O÷S: BX87X

--------------------------------------------------------------------------------
>f:y 28 agÿqQ 38 ag
\O: Yang, ZJ; Wu, F; Li, SP
fNM|âVSO\O: IEEE; IEEE
h: Rate distortion optimized mode decision in the scalable video coding
egnúQHrir: 2003 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOL 3, PROCEEDINGS: 781-784 2003
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on Image Processing
O®åeg: SEP 14-17, 2003
O®0W¹p: BARCELONA, SPAIN
O®^©RFU: IEEE Signal Proc Soc.
KeyWords Plus: CODER
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Yang, ZJ, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-7750-8
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Imaging Science & Photographic Technology
ISI e.s O÷S: BX96G

--------------------------------------------------------------------------------
>f:y 29 agÿqQ 38 ag
\O: Liu, SH; Wei, J; Xu, W
fNM|âVSO\O: IEEE COMPUTER SOCIETY; IEEE COMPUTER SOCIETY
h: Towards dynamic process with variable structure by reflection
egnúQHrir: 27TH ANNUAL INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE, PROCEEDINGS: 120-125 2003
í: English
e.s{|W: Proceedings Paper
O®h: 27th Annual International Computer Software and Applications Conference
O®åeg: NOV 03-06, 2003
O®0W¹p: DALLAS, TX
O®^©RFU: IEEE Comp Soc.
Xd: 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 Middle-ware (SCM) because it is service-oriented, into which the reflection mechanism is easily attached to support structural and behavioural changes on processes at runtime.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Liu, SH, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2020-0
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Information Systems; Computer Science, Software Engineering
ISI e.s O÷S: BX93S

--------------------------------------------------------------------------------
>f:y 30 agÿqQ 38 ag
\O: Zheng, H; Li, SX
fNM|âVSO\O: EMIS; EMIS
h: Formal analysis of CORBA-based objects communication using Petri nets
egnúQHrir: ICEMI'2003: PROCEEDINGS OF THE SIXTH INTERNATIONAL CONFERENCE ON ELECTRONIC MEASUREMENT & INSTRUMENTS, VOLS 1-3: 1787-1793 2003
í: English
e.s{|W: Proceedings Paper
O®h: 6th International Conference on Electronic Measurement and Instruments
O®åeg: AUG 18-21, 2003
O®0W¹p: TAIYUAN, PEOPLES R CHINA
O®^©RFU: GIS.; CIE.; IEEE.; CNNSF.
\OsQ.Í: CORBA; services specifications; Petri nets
Xd: CORBA(Common Object Request Broker Architecture) is a set of open standards proposed by the Object Management Group. (OMG) in order to promote interoperability between distributed object systems, but Common Object Services Specifications (COSS) do not contain integrated formal descriptions. Petri nets are a powerful instrument for modeling, analyzing, and simulating dynamic systems with concurrent and non-deterministic behavior. This paper introduces a high-level Object-oriented extended Petri nets (ECPNs) to speck the behaviors of CORBA objects.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zheng, H, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: CHINESE INSTITUTE ELECTRONICS
úQHrFU0W@W: HARBIN INSTITUTE TECHNOLOGY NO. 92, WEST DA-ZHI STREET, HEILONGJIANG, HARBIN 150001, PEOPLES R CHINA
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Artificial Intelligence; Engineering, Electrical & Electronic; Instruments & Instrumentation
ISI e.s O÷S: BX80T

--------------------------------------------------------------------------------
>f:y 31 agÿqQ 38 ag
\O: Wang, Q; Xu, JG; Wang, HA; Dai, GZ
fNM|âVSO\O: IEEE; IEEE
h: Adaptive real-time publish-subscribe messaging for distributed monitoring systems
egnúQHrir: IDAACS'2003: PROCEEDINGS OF THE SECOND IEEE INTERNATIONAL WORKSHOP ON INTELLIGENT DATA ACQUISITION AND ADVANCED COMPUTING SYSTEMS: TECHNOLOGY AND APPLICATIONS: 412-417 2003
í: English
e.s{|W: Proceedings Paper
O®h: 2nd IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems
O®åeg: SEP 08-10, 2003
O®0W¹p: LVIV, UKRAINE
O®^©RFU: Ternopil Acad Natl Econ.; Sci & Technol Ctr Ukraine.; Minist Educ & Sci Ukraine.; Post Pens Bank Aval.; Inst Comp Informat Technologies.; Inst Comp Technologies, Automat & Metrol.; Natl Univ Lviv Polytechn.
\OsQ.Í: real-time publish-subscribe; ECA rule; active real-time database
Xd: Many complex distributed real-time applications, monitoring and controlling the external environment, require sophisticated processing and sharing of an extensive amount of data under critical timing constraints. In this paper, we present adaptive real-time publish-subscribe (RTPS) messaging service for distributed real-time applications, and four primitives are, defined for expressing the adaptive RTPS. Furthermore, adaptive RTPS is incorporated into an active real-time database (ARTDB) named Agilor by translating RTPS primitives into subscription objects and ECA rules. We also apply real-time scheduling algorithm to protocol processing for improving predictability and minimizing priority inversions during message transmission. The experimental results indicate the idea is feasible, and the current implementation shows better performance.
0W@W: Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100080, Peoples R China
¯\O0W@W: Wang, Q, Chinese Acad Sci, Inst Software, Intelligence Engn Lab, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-8138-6
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Theory & Methods; Engineering, Electrical & Electronic; Instruments & Instrumentation
ISI e.s O÷S: BX93T

--------------------------------------------------------------------------------
>f:y 32 agÿqQ 38 ag
\O: Liu, SH; Wei, J; Xu, W
: Titsworth, F
h: Diversifying and improving business process management systems by service cooperation middleware
egnúQHrir: THIRD INTERNATIONAL CONFERENCE ON QUALITY SOFTWARE, PROCEEDINGS: 396-399 2003
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Quality Software
O®åeg: NOV 06-07, 2003
O®0W¹p: DALLAS, TX
O®^©RFU: Chinese Acad Sci, Inst Software.; Univ Texas Dallas.; Univ Hong Kong.; Swinburne Univ Technol.
Xd: Emerging service oriented business process management (BPM) systems require efficient middleware infrastructure. However, current techniques for middleware are not optimal for that because they all do not have service-oriented natures themselves. This paper introduces a novel service cooperation middleware (SCM), which is designed to meet such requirements. It improves the development and integration of loosely coupled service oriented BPM system by applying several concepts such as control flow semantic and projection operation, etc. Furthermore, based on the SCM architecture, the related Process Integration Suit viz. ISProcessIntegration (PI) can be widely applied into all kinds of scenes, for example EAI, B2B, B2C, P2P, Cluster, with different topologies.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Liu, SH, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 6
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2015-4
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BX93Q

--------------------------------------------------------------------------------
>f:y 33 agÿqQ 38 ag
\O: Wu, EH; Zheng, X
h: Composition of novel views through an efficient image warping
egnúQHrir: VISUAL COMPUTER, 19 (5): 319-328 AUG 2003
í: English
e.s{|W: Proceedings Paper
O®h: 19th Computer Graphics International Conference
O®åeg: JUL 03-06, 2001
O®0W¹p: KOWLOON, PEOPLES R CHINA
O®^©RFU: Comp Graph Soc.; IEEE Hong Kong Comp Chapter.; KC Wong Educ Fda.; Hong Kong Pei Hua Educ Fdn.
O®;NR¹e: CITY UNIV HONG KONG
\OsQ.Í: image-based rendering; 3D warping; forward warping; inverse warping
Xd: 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.
0W@W: Univ Macao, Fac Sci & Technol, Macao, Peoples R China; Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing, Peoples R China; Zhongxinguoan Informat Technol Co, Beijing, Peoples R China
¯\O0W@W: Wu, EH, Univ Macao, Fac Sci & Technol, Macao, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 1
úQHrFU: SPRINGER-VERLAG
úQHrFU0W@W: 175 FIFTH AVE, NEW YORK, NY 10010 USA
ISSN: 0178-2789
DOI: 10.1007/s00371-002-0183-x
29 W[&{vegnúQHrir
Tðy)Q: VISUAL COMPUT
ISO egne.súQHrir
Tðy)Q: Visual Comput.
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: 726KP

--------------------------------------------------------------------------------
>f:y 34 agÿqQ 38 ag
\O: Wu, Z; Wang, J; Zhang, H
: Sloot, PMA; Abramson, D; Bogdanov, AV; Dongarra, JJ; Zomaya, AY; Gorbachev, YE
h: Community Network with Integrated Services
egnúQHrir: COMPUTATIONAL SCIENCE - ICCS 2003, PT II, PROCEEDINGS, 2658: 46-53 2003
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Computational Science (ICCS 2003)
O®åeg: JUN 02-04, 2003
O®0W¹p: MELBOURNE, AUSTRALIA
O®^©RFU: Univ Amsterdam.; Hewlett Packard.; Springer Verlag.; Netherlands Inst St Petersburg.; Russian Federat, Minist Ind, Sci & Technol.; Govt St Petersburg, Comm Sci & High Educ.; St Petersburg State Tech Univ.; Inst High Performance Comp & Informat Syst.; IBM Australia.; Microsoft.; Cray Inc.; Dolphin Interconnect.; Microway.; Etnus.; ceanet.; NAG.; Pallas GmbH.
\OsQ.Í: Broadband Access; Community Network; Integrated Services; QoS; multicast; security
Xd: This paper first introduces the general problems met when building Broadband Community Access Network which supports Integrated Services, and then presents some solutions and achievements on multicast service, QoS provision, security, network accounting and billing. In the third section, this paper gives the architecture of a community network, which is a broadband access network based on high-speed switching Ethernet, and provides integrated services, such as digital TV, IP telephone, WWW, Email, and so on. This paper also gives an implementation of this broadband access system, which can afford the special requests of classified transfer, QoS and security, and at the same time provides the accounting and billing function. Lastly, this paper indicates the unfinished part of this broadband access system, and describes the future development.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Wu, Z, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-40195-4
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BX28K

--------------------------------------------------------------------------------
>f:y 35 agÿqQ 38 ag
\O: Shen, YD; Yang, Q; Zhang, Z; Lu, HJ
: Whang, KY; Jeon, J; Shim, K; Srivastava, J
h: Mining the customer's up-to-moment preferences for e-commerce recommendation
egnúQHrir: ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, 2637: 166-177 2003
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: 7th Pacific-Asia Conference on Knowledge Discovery and Data Mining
O®åeg: APR 30-MAY 02, 2003
O®0W¹p: SEOUL, SOUTH KOREA
O®^©RFU: KAIST, Adv Informat Technol Res Ctr.; SNU, Stat Res Ctr Complex Syst.; Korea Informat Sci Soc.; Korean Datamining Soc.; USAF, Off Sci Res, Asian Off Aerosp Res & Dev.; ACM SIGKDD.
KeyWords Plus: DATABASES
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100864, Peoples R China; Hong Kong Univ Sci & Technol, Hong Kong, Hong Kong, Peoples R China; Simon Fraser Univ, Sch Comp Sci, Burnaby, BC V5A 1S6, Canada
¯\O0W@W: Shen, YD, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100864, Peoples R China.
5uP[®±{0W@W: ydshen@ios.ac.cn; qyang@cs.ust.hk; zzhang@cs.sfu.ca; luhj@cs.ust.hk
_(uvÂSe.spe: 12
«_!k: 2
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-04760-3
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BX23S

--------------------------------------------------------------------------------
>f:y 36 agÿqQ 38 ag
\O: Sui, YF; Xia, YM; Wang, J
: Wang, GY; Liu, Q; Yao, YY; Skowron, A
h: The information entropy of rough relational databases
egnúQHrir: ROUGH SETS, FUZZY SETS, DATA MINING, AND GRANULAR COMPUTING, 2639: 320-324 2003
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: 9th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Grandular Computing (RSFDGrC 2003)
O®åeg: MAY 26-29, 2003
O®0W¹p: CHONGQING, PEOPLES R CHINA
O®^©RFU: Natl Nat Sci Fdn China.; Chongqing Municipal Educ Comm.; Chongqing Municipal Sci & Technol Comm.; Chongqing Bur Informat Ind.
\OsQ.Í: rough set; relational database; entropy; dependence
KeyWords Plus: UNCERTAINTY
Xd: 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 is an element of A, as in rough set theory, a definition of the lower and upper approximations based on phi(a) 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.
0W@W: Chinese Acad Sci, Comp Technol Inst, Key Lab Intelligent Informat Proc, Beijing, Peoples R China; Yunnan Normal Univ, Dept Comp Sci, Kunming, Peoples R China; Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Sui, YF, Chinese Acad Sci, Comp Technol Inst, Key Lab Intelligent Informat Proc, Beijing, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-14040-9
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BX12N

--------------------------------------------------------------------------------
>f:y 37 agÿqQ 38 ag
\O: Luan, SM; Dai, GZ
: Kumar, V; Gavrilova, ML; Tan, CJK; LEcuyer, P
h: An algorithm for diagnosing system with structured description
egnúQHrir: COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2003, PT 2, PROCEEDINGS, 2668: 695-704 2003
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Computational Science and Its Applications (ICCSA 2003)
O®åeg: MAY 18-21, 2003
O®0W¹p: MONTREAL, CANADA
O®^©RFU: CERCA.; IBM Canada.; IBM, United States.; Heuchera Technol.; Pallas.; Queens Univ Belfast.; SHARCNET.; Soc Ind & Appl Math.; Springer Verlag.
KeyWords Plus: MODEL-BASED DIAGNOSIS
Xd: The model-based approach to diagnosis is one of the important approach to the system diagnosis, and the main problem for the approach is that how to generate the diagnoses. In this paper, an algorithm for computing all minimal conflicts using structured description system is introduced, then the diagnoses can be generated from all the minimal conflicts. Furthermore, an algorithm for computing diagnoses straight-forwardly from the structured description is presented. The correctness of the algorithm is proved, and the time complexity of the algorithm is also analyzed. At last, the algorithms are compared with related works. The algorithms will terminate in polynomial time for some special system.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Luan, SM, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 21
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-40161-X
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BX11V

--------------------------------------------------------------------------------
>f:y 38 agÿqQ 38 ag
\O: Sun, FC; Sun, ZQ; Li, L; Li, HX
h: Neuro-fuzzy adaptive control based on dynamic inversion for robotic manipulators
egnúQHrir: FUZZY SETS AND SYSTEMS, 134 (1): 117-133 FEB 16 2003
í: English
e.s{|W: Proceedings Paper
O®h: 4th International FLINS Conference on Intelligent Techniques and Soft Computing in Nuclear Science and Engineering
O®åeg: AUG 28-30, 2000
O®0W¹p: BRUGGE, BELGIUM
\OsQ.Í: robotics; neuro-fuzzy systems; dynamic inversion; fuzzy clustering; adaptive control
KeyWords Plus: NONLINEAR-SYSTEMS; NETWORKS; DESIGN; IDENTIFICATION; STABILITY; MODELS
Xd: 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 Lya-punov 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. (C) 2002 Elsevier Science B.V. All rights reserved.
0W@W: State Key Lab Intelligent Technol & Syst, Dept Comp Sci & Technol, Beijing 100084, Peoples R China; Chinese Acad Sci, Shenyang Inst Automat, Robot Lab, Shenyang 110015, Peoples R China; Tsing Hua Univ, Sch Publ Policy & Mangaement, Inst Software, Chinese Acad Sci, Beijing 100084, Peoples R China; City Univ Hong Kong, Dept Mfg Engn & Engn Management, Hong Kong, Hong Kong, Peoples R China
¯\O0W@W: Sun, FC, State Key Lab Intelligent Technol & Syst, Dept Comp Sci & Technol, Beijing 100084, Peoples R China.
_(uvÂSe.spe: 23
«_!k: 13
úQHrFU: ELSEVIER SCIENCE BV
úQHrFU0W@W: PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
ISSN: 0165-0114
29 W[&{vegnúQHrir
Tðy)Q: FUZZY SET SYSTEM
ISO egne.súQHrir
Tðy)Q: Fuzzy Sets Syst.
egne.sux¡pe: 17
f[Ñy{|+R: Computer Science, Theory & Methods; Mathematics, Applied; Statistics & Probability
ISI e.s O÷S: 640HM

ISTP 2004
>f:y 1 agÿqQ 58 ag
\O: Zheng, JP; Huang, K; Wu, YC; Wu, ZM
: Ke, G
h: Mobility pattern based adaptive mobile multicast algorithm
egnúQHrir: 2004 JOINT CONFERENCE OF THE 10TH ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS AND THE 5TH INTERNATIONAL SYMPOSIUM ON MULTI-DIMENSIONAL MOBILE COMMUNICATIONS, VOLS 1 AND 2, PROCEEDINGS: 888-892 2004
í: English
e.s{|W: Proceedings Paper
O®h: Joint Conference of the 10th Asia-Pacific Conference on Communications/5th International Symposium on Mult-Dimensional Mobile Communication
O®åeg: AUG 29-SEP 01, 2004
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: China Inst Communicat.; Inst Elect Informat, & Communicat Engineers.; Koreean Inst Communicat Syst.; IEEE Communicat Soc.; Nat Sci Fdn China.
O®;NR¹e: Tsinghua Univ
Xd: Mobile IT 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Zheng, JP, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-8601-9
egne.sux¡pe: 5
f[Ñy{|+R: Telecommunications
ISI e.s O÷S: BBL82

--------------------------------------------------------------------------------
>f:y 2 agÿqQ 58 ag
\O: Chen, Y; Yang, LH; Wang, YG
: Rastogi, R; Morik, K; Bramer, M; Wu, X
h: Incremental mining of frequent XML query patterns
egnúQHrir: FOURTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS: 343-346 2004
í: English
e.s{|W: Proceedings Paper
O®h: 4th IEEE International Conference on Data Mining
O®åeg: NOV 01-04, 2004
O®0W¹p: Brighton, ENGLAND
O®^©RFU: IEEE Comp Soc, TCCI.; IEEE Comp Soc, TCPAMI.; IBM Res.; StatSoft Ltd.; Web Intelligence Consortium.
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Chen, Y, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 5
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2142-8
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems
ISI e.s O÷S: BBI95

--------------------------------------------------------------------------------
>f:y 3 agÿqQ 58 ag
\O: Hu, CY; Zhang, BY; Yan, SC; Yang, Q; Yan, J; Chen, Z; Ma, WY
: Rastogi, R; Morik, K; Bramer, M; Wu, X
h: Mining ratio rules via principal sparse non-negative matrix factorization
egnúQHrir: FOURTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS: 407-410 2004
í: English
e.s{|W: Proceedings Paper
O®h: 4th IEEE International Conference on Data Mining
O®åeg: NOV 01-04, 2004
O®0W¹p: Brighton, ENGLAND
O®^©RFU: IEEE Comp Soc, TCCI.; IEEE Comp Soc, TCPAMI.; IBM Res.; StatSoft Ltd.; Web Intelligence Consortium.
Xd: 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 [4] 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Hu, CY, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2142-8
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems
ISI e.s O÷S: BBI95

--------------------------------------------------------------------------------
>f:y 4 agÿqQ 58 ag
\O: Shen, YD; Shen, ZY; Zhang, SM; Yang, Q
: Rastogi, R; Morik, K; Bramer, M; Wu, X
h: Cluster cores-based clustering for high dimensional data
egnúQHrir: FOURTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS: 519-522 2004
í: English
e.s{|W: Proceedings Paper
O®h: 4th IEEE International Conference on Data Mining
O®åeg: NOV 01-04, 2004
O®0W¹p: Brighton, ENGLAND
O®^©RFU: IEEE Comp Soc, TCCI.; IEEE Comp Soc, TCPAMI.; IBM Res.; StatSoft Ltd.; Web Intelligence Consortium.
KeyWords Plus: ALGORITHM
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Shen, YD, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 4
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2142-8
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems
ISI e.s O÷S: BBI95

--------------------------------------------------------------------------------
>f:y 5 agÿqQ 58 ag
\O: Wang, JF; Li, L; Zhou, MT; Xu, FJ; Sun, FC
fNM|âVSO\O: ieee
h: An adaptive strategy for high-speed network flow compression
egnúQHrir: GLOBECOM '04: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6: 1645-1649 2004
NfNh: IEEE Global Telecommunications Conference (Globecom)
í: English
e.s{|W: Proceedings Paper
O®h: IEEE Global Telecommunications Conference (GLOBECOM 04)
O®åeg: NOV 29-DEC 03, 2004
O®0W¹p: Dallas, TX
O®^©RFU: IEEE.; Strateg Alliance Metroplex Technol.; Freescale.; IDT.; Nokia.; Univ Texas Austin, ECE.; Wireless Valley Commun Inc.; ALCATEL.; ALTERA.; Raytheon.; SMU Eng.; UTA Eng.; Univ Texas Dallas, Erik Jonsson Sch Engn & Comp Sci.; Axes Technol.
Xd: 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 highspeed 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.
0W@W: Chinese Acad Sci, Inst Software, Lab Gen Software, Beijing 100864, Peoples R China
¯\O0W@W: Wang, JF, Chinese Acad Sci, Inst Software, Lab Gen Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-8794-5
29 W[&{vegnúQHrir
Tðy)Q: GLOB TELECOMM CONF
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Information Systems; Telecommunications
ISI e.s O÷S: BBO43

--------------------------------------------------------------------------------
>f:y 6 agÿqQ 58 ag
\O: Chen, HM; Dong, YM
: Fujita, H; Gruhn, V
h: Facilitating formal specification acquisition by using recursive functions on context-free languages
egnúQHrir: NEW TRENDS IN SOFTWARE METHODOLOGIES, TOOLS AND TECHNIQUES, 111: 213-227 2004
NfNh: FRONTIERS IN ARTIFICIAL INTELLIGENCE AND APPLICATIONS
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Software Methodology Tools and Techniques (SoMeT-04)
O®åeg: SEP 28-30, 2004
O®0W¹p: Leipzig, GERMANY
Xd: Although formal specification techniques are very useful in software development, the acquisition of formal specification is a difficult task. This paper presents the formal software specification language LFC, which is designed to facilitate the acquisition and validation of formal specifications. LFC relies on a new kind of recursive functions, i.e. recursive functions on context-free languages, for semantic aspect and uses context-free languages for syntactic aspect of specifications. Specification in LFC and the validation are entirely machine aided. Specification is mainly facilitated through grammatical learning technique and machine-aided function construction. Validation is facilitated by sample recognition and generation techniques and rapid prototyping technique. A formal specification acquisition system SAQ has been implemented, several non-trivial examples have been developed using SAQ.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Chen, HM, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 22
«_!k: 0
úQHrFU: I O S PRESS
úQHrFU0W@W: NIEUWE HEMWEG 6B, 1013 BG AMSTERDAM, NETHERLANDS
ISSN: 0922-6389
ISBN: 1-58603-455-3
29 W[&{vegnúQHrir
Tðy)Q: FR ART INT
egne.sux¡pe: 15
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BBH03

--------------------------------------------------------------------------------
>f:y 7 agÿqQ 58 ag
\O: She, CD; Li, L; Wang, HB; Gao, B; Deng, HQ
fNM|âVSO\O: ieee
h: An improved parallel algorithm for finding frequent item-sets
egnúQHrir: PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON INTELLIGENT MECHATRONICS AND AUTOMATION: 383-386 2004
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Intelligent Mechatronics and Automation
O®åeg: AUG 26-31, 2004
O®0W¹p: Chengdu, PEOPLES R CHINA
O®^©RFU: Hong Kong Univ Sci & Technol.; Kagawa Univ.; Univ Electro Commun.; Natl Nat Sci Fdn China.; Shanghai Univ.; Harbin Engn Univ.; Japan Soc Precis Engn.; IEEE Robot & Automat Soc.; IEEE Syst, Man & Cybernet Soc.; IEEE Shikoku Sect.; Chinese Inst Elect.; Chinese Soc Mech Engn.; China Cleaning Engn Technol Cooperat Assoc.; Robot Soc Japan.; Int Mechatron Forum.; JSPE, Tech Comm Intell Mechatron.; Minist Educ, China.
O®;NR¹e: Univ Elect Sci & Technol China
\OsQ.Í: data mining; parallel processing; association rules; load balance; shared memory
KeyWords Plus: ASSOCIATION RULES
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: She, CD, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 17
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-8748-1
egne.sux¡pe: 4
f[Ñy{|+R: Automation & Control Systems; Computer Science, Artificial Intelligence; Engineering, Mechanical; Robotics
ISI e.s O÷S: BBG56

--------------------------------------------------------------------------------
>f:y 8 agÿqQ 58 ag
\O: Hou, X; Fan, ZH; Li, L; Xu, FJ; She, CD; Hu, G
fNM|âVSO\O: ieee
h: Algorithm of fault diagnosis for satellite network
egnúQHrir: PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON INTELLIGENT MECHATRONICS AND AUTOMATION: 594-598 2004
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Intelligent Mechatronics and Automation
O®åeg: AUG 26-31, 2004
O®0W¹p: Chengdu, PEOPLES R CHINA
O®^©RFU: Hong Kong Univ Sci & Technol.; Kagawa Univ.; Univ Electro Commun.; Natl Nat Sci Fdn China.; Shanghai Univ.; Harbin Engn Univ.; Japan Soc Precis Engn.; IEEE Robot & Automat Soc.; IEEE Syst, Man & Cybernet Soc.; IEEE Shikoku Sect.; Chinese Inst Elect.; Chinese Soc Mech Engn.; China Cleaning Engn Technol Cooperat Assoc.; Robot Soc Japan.; Int Mechatron Forum.; JSPE, Tech Comm Intell Mechatron.; Minist Educ, China.
O®;NR¹e: Univ Elect Sci & Technol China
\OsQ.Í: system level diagnosis; fault diagnosis; satellite network
KeyWords Plus: SYSTEMS
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Gen Software Lab, Beijing, Peoples R China
¯\O0W@W: Hou, X, Chinese Acad Sci, Inst Software, Gen Software Lab, 4 S 4th St, Beijing, Peoples R China.
_(uvÂSe.spe: 6
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-8748-1
egne.sux¡pe: 5
f[Ñy{|+R: Automation & Control Systems; Computer Science, Artificial Intelligence; Engineering, Mechanical; Robotics
ISI e.s O÷S: BBG56

--------------------------------------------------------------------------------
>f:y 9 agÿqQ 58 ag
\O: Li, L; Xu, FJ; Wang, HB; She, CD; Fan, ZH
fNM|âVSO\O: ieee
h: IAM: An algorithm of indirect association mining
egnúQHrir: PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON INTELLIGENT MECHATRONICS AND AUTOMATION: 831-835 2004
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Intelligent Mechatronics and Automation
O®åeg: AUG 26-31, 2004
O®0W¹p: Chengdu, PEOPLES R CHINA
O®^©RFU: Hong Kong Univ Sci & Technol.; Kagawa Univ.; Univ Electro Commun.; Natl Nat Sci Fdn China.; Shanghai Univ.; Harbin Engn Univ.; Japan Soc Precis Engn.; IEEE Robot & Automat Soc.; IEEE Syst, Man & Cybernet Soc.; IEEE Shikoku Sect.; Chinese Inst Elect.; Chinese Soc Mech Engn.; China Cleaning Engn Technol Cooperat Assoc.; Robot Soc Japan.; Int Mechatron Forum.; JSPE, Tech Comm Intell Mechatron.; Minist Educ, China.
O®;NR¹e: Univ Elect Sci & Technol China
\OsQ.Í: data mining; association rule; indirect association; the bridge itemset; IAM
Xd: 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 L 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 JAM algorithm are put forward for future research.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Li, L, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-8748-1
egne.sux¡pe: 5
f[Ñy{|+R: Automation & Control Systems; Computer Science, Artificial Intelligence; Engineering, Mechanical; Robotics
ISI e.s O÷S: BBG56

--------------------------------------------------------------------------------
>f:y 10 agÿqQ 58 ag
\O: Zhou, J; Ma, YL; Li, W; Wu, ZL
: Arabnia, HR; Reza, H
h: A formal framework of UML
egnúQHrir: SERP'04: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING RESEARCH AND PRACTICE, VOLS 1 AND 2: 151-157 2004
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Software Engineering Research and Practice
O®åeg: JUN 21-24, 2004
O®0W¹p: Las Vegas, NV
O®^©RFU: Comp Sci Res, Educa & Applicat Press.; Int Technol Inst.; Korean Soc Internet Informat.; World Acad Sci Informat Technol.
\OsQ.Í: UML; algebraic representation; class diagram; sequence diagram
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Zhou, J, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: C S R E A PRESS
úQHrFU0W@W: 115 AVALON DR, ATHENS, GA 30606 USA
ISBN: 1-932415-30-0
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BBK74

--------------------------------------------------------------------------------
>f:y 11 agÿqQ 58 ag
\O: Xiao, JF; Lin, DD
: Chen, J
h: Survey of Security in Grid Services
egnúQHrir: SHAPING BUSINESS STRATEGY IN A NETWORKED WORLD, VOLS 1 AND 2, PROCEEDINGS: 1241-1245 2004
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Conference on Electronic Business (ICEB 2004)
O®åeg: DEC 05-09, 2004
O®0W¹p: Beijing, PEOPLES R CHINA
\OsQ.Í: Grid; security; GSI; Globus
Xd: This article provides a survey of Security in Grid Services coming from a study of many papers most of which were done by the Grid Forum OGSA-SEC (Open Grid Service Architecture Security) working group, GSI (Grid Security Infrastructure) working group, and Globus Alliance team and other people who contributed to Grid. It describes the best practice in terms of Grid Security Challenges, Grid Security Requirements, and the GT3 (Globus Toolkit version 3) Security Model for OGSA. Most of these were further refined in separate documents.
0W@W: Chinese Acad Sci, Grad Sch, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Xiao, JF, Chinese Acad Sci, Grad Sch, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 23
«_!k: 0
úQHrFU: INTERNATIONAL ACADEMIC PUBLISHERS LTD
úQHrFU0W@W: UNIT 1205, 12 FLOOR, SINO PLAZA, 255 GLOUCESTER ROAD, HONG KONG 00000, CAUSEWAY BAY, PEOPLES R CHINA
ISBN: 7-5062-7342-X
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Artificial Intelligence; Engineering, Electrical & Electronic; Telecommunications
ISI e.s O÷S: BBO87

--------------------------------------------------------------------------------
>f:y 12 agÿqQ 58 ag
\O: Wu, YC; Sun, LM; Ma, H
fNM|âVSO\O: IEEE
h: Adaptive robust header compression based on RTS/CTS handshake for real-time streams in 3G wireless network
egnúQHrir: VTC2004-SPRING: 2004 IEEE 59TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-5, PROCEEDINGS: 2281-2285 2004
í: English
e.s{|W: Proceedings Paper
O®h: 59th IEEE Vehicular Technology Conference
O®åeg: MAY 17-19, 2004
O®0W¹p: Milan, ITALY
O®^©RFU: IEEE.; IEEE Vehicular Technol Soc.
\OsQ.Í: adaptive; robust header compression; RTS/CTS
KeyWords Plus: CHANNELS
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Wu, YC, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 17
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-8255-2
egne.sux¡pe: 5
f[Ñy{|+R: Telecommunications
ISI e.s O÷S: BBN36

--------------------------------------------------------------------------------
>f:y 13 agÿqQ 58 ag
\O: Sun, ZW; Feng, DG
fNM|âVSO\O: PHEI
h: A new detecting scheme for blind images watermarking
egnúQHrir: 2004 7TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING PROCEEDINGS, VOLS 1-3: 2334-2337 2004
í: English
e.s{|W: Proceedings Paper
O®h: 7th International Conference on Signal Processing
O®åeg: AUG 31-SEP 04, 2004
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Inst Elect.; IEEE Signal Proc Soc.; IEE.; Union Radio Sci Int.; IEEE Beijing Sect.; Natl Nat Sci Fdn China.; CIE Comm URSI.; IEEE Comp Soc Beijing Chapter.; IEEE SP Soc Beijing Chapter.; CIE Signal Proc Soc.; NO Jiaotong Univ.
\OsQ.Í: digital watermarking; generalized Gaussian distribution; weak signal detection
KeyWords Plus: OPTIMUM DETECTION; DOMAIN
Xd: 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 die theory of statistical inference mid weak signal detection in non-gaussian noise, a robust blind detection algorithm is derived. The performance of the new detector is analvzed. And the validity of die detector is also tested.
0W@W: Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Sun, ZW, Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: PUBLISHING HOUSE ELECTRONICS INDUSTRY
úQHrFU0W@W: PO BOX 173 WANSHOU ROAD, BEIJING 100036, PEOPLES R CHINA
ISBN: 7-121-00215-9
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Engineering, Electrical & Electronic; Imaging Science & Photographic Technology; Telecommunications
ISI e.s O÷S: BBR53

--------------------------------------------------------------------------------
>f:y 14 agÿqQ 58 ag
\O: Jin, BH; Wang, JC
: Guo, QP
h: Modeling distributed systems: Architecture and process
egnúQHrir: DCABES 2004, Proceedings, Vols, 1 and 2: 110-115 2004
í: English
e.s{|W: Proceedings Paper
O®h: International Symposium on Distributed Computing and Applications to Business, Engineering and Sciences
O®åeg: SEP 13-16, 2004
O®0W¹p: Wuhan, PEOPLES R CHINA
O®^©RFU: Wuhan Univ Technol.; Minist Educ.; Natl Nat Sci Fdn China.; SUN Microsyst, Hong Kong Headquarters.; Int Sci & Technol Cooperat Assoc Hubei Prov.; Comp Acad Assoc Hubei Prov & Wuhan Metropolis.
\OsQ.Í: modeling; distributed system; software process
Xd: With the rapid prevalence of distributed applications, more attentions have to be focused on modeling distributed system. This paper investigates the characteristics of constructing a distributed system, then gives a series of design considerations of distributed software architecture including component interaction, security, failure handling and QoS, and presents the suggestive modeling process which extends the regular software process. Case study shows our suggestions on modeling are valuable for constructing distributed systems.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Jin, BH, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: HUBEI SCI TECHNOL PRESS
úQHrFU0W@W: 75 HUANGLI RD, WUHAN 430077, WUCHANG, PEOPLES R CHINA
ISBN: 7-5352-3269-8
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BBZ82

--------------------------------------------------------------------------------
>f:y 15 agÿqQ 58 ag
\O: Feng, P; Cao, JW; Sun, JC
: Guo, QP
h: Parallel reservoir integrated simulation platform for one million grid blocks case
egnúQHrir: DCABES 2004, Proceedings, Vols, 1 and 2: 681-684 2004
í: English
e.s{|W: Proceedings Paper
O®h: International Symposium on Distributed Computing and Applications to Business, Engineering and Sciences
O®åeg: SEP 13-16, 2004
O®0W¹p: Wuhan, PEOPLES R CHINA
O®^©RFU: Wuhan Univ Technol.; Minist Educ.; Natl Nat Sci Fdn China.; SUN Microsyst, Hong Kong Headquarters.; Int Sci & Technol Cooperat Assoc Hubei Prov.; Comp Acad Assoc Hubei Prov & Wuhan Metropolis.
\OsQ.Í: parallel numerical reservoir simulation; fine residual-oil distribution; one million grid blocks problem; integrated simulation platform; parallel computer; deadline; grid computing
KeyWords Plus: BLACK-OIL MODEL
Xd: This article first provides a brief introduction to the numerical reservoir simulation and a parallel numerical reservoir integrated simulation platform from RDCPS (Research & Development Center for Parallel Software, Institute of Software, Chinese Academy of Sciences), including Pre-Processing, Simulator (for a Three-Dimensional & Three-Phase Black Oil models), Post Processing, seamlessly integrated with parallel computers. We then present key technologies of the simulator, such as the nonlinear and linear solvers, communications among processors, parallel I/O, etc., and corresponding resolvents. Finally, some results with the platform to solve one million grid blocks cases from Chinese oil fields will be given in the article, which can show that the simulator has a very robust portability, high-speed for deadline and good scalability for the tested cases. As application software, our object is always focusing on meeting deadlines from oil industry. Now, for one million grid blocks' case with 20 similar to 30 years production, its elapsed time with 16 processors is less than 12 hours on parallel computers based on Myrinet or QsNet namely "to submit a case just before off-duty and get its result just before on-duty". A decreasing line of elapsed time appears for a one million grid blocks case. The developing trace of the simulator along with parallel computers can be also inferred.
0W@W: Chinese Acad Sci, Inst Software, Res & Dev Ctr Parallel Software, Beijing, Peoples R China
¯\O0W@W: Feng, P, Chinese Acad Sci, Inst Software, Res & Dev Ctr Parallel Software, POB 8718, Beijing, Peoples R China.
_(uvÂSe.spe: 22
«_!k: 0
úQHrFU: HUBEI SCI TECHNOL PRESS
úQHrFU0W@W: 75 HUANGLI RD, WUHAN 430077, WUCHANG, PEOPLES R CHINA
ISBN: 7-5352-3269-8
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BBZ82

--------------------------------------------------------------------------------
>f:y 16 agÿqQ 58 ag
\O: Cao, TJ; Lin, DD; Xue, R
: Zhong, Y
h: Cryptanalysis of user efficient fair e-cash schemes
egnúQHrir: ICCC2004: Proceedings of the 16th International Conference on Computer Communication Vol 1and 2: 524-528 2004
í: English
e.s{|W: Proceedings Paper
O®h: 16th International Conference on Computer Communication (ICCC 2004)
O®åeg: SEP 15-17, 2004
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Minist Informat Ind.; Int Council Comp Commun.; China Ctr Informat Ind Dev.; China Elect Chamber Commerce.; China Comp Soc.; China Inst Commun.; Chinese Assoc Artificial Intelligence.; Beijing Univ Posts &Telecommun.; China Fed Informat Promot.; Nat Sci Fdn China.; Chinese Assoc Sci & Technol.; States Adm Foreign Experts Affairs.
Xd: In e-cash system, a customer withdraws electronic coins from bank and pays the coins to a shop. Then the shop deposits the paid coins to the bank. To protect the privacy of customer, each payment should be anonymous and it can be achieved by blind signature. However unconditional anonymity may be misused for criminal activities such as blackmailing and money laundering. Fair electronic cash schemes are introduced for preventing these fraudulent activities. The main feature of fair e-cash is the existence of a trusted authority that can revoke the consumer's anonymity under certain circumstances. Recently, to guarantee the quality of mobile commerce, secure and efficient e-cash schemes are greatly desired. Based on Fan-Lei user efficient blind signature scheme, Yu et al. proposed three user efficient fair e-cash schemes. Unfortunately, their schemes do not meet fair property. In this paper, we show that a customer can withdraw e-cashes on behalf of other customers he chooses. Thus, the customer and the coins are fully intraceable.
0W@W: Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Cao, TJ, Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, 4 S 4th St, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: PUBLISHING HOUSE ELECTRONICS INDUSTRY
úQHrFU0W@W: PO BOX 173 WANSHOU ROAD, BEIJING 100036, PEOPLES R CHINA
ISBN: 7-121-00308-2
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Information Systems; Telecommunications
ISI e.s O÷S: BCC66

--------------------------------------------------------------------------------
>f:y 17 agÿqQ 58 ag
\O: Wu, P; Zhang, DM
: Zhong, Y
h: Compositional analysis of mobile IP with symbolic transition graphs
egnúQHrir: ICCC2004: Proceedings of the 16th International Conference on Computer Communication Vol 1and 2: 1481-1488 2004
í: English
e.s{|W: Proceedings Paper
O®h: 16th International Conference on Computer Communication (ICCC 2004)
O®åeg: SEP 15-17, 2004
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Minist Informat Ind.; Int Council Comp Commun.; China Ctr Informat Ind Dev.; China Elect Chamber Commerce.; China Comp Soc.; China Inst Commun.; Chinese Assoc Artificial Intelligence.; Beijing Univ Posts &Telecommun.; China Fed Informat Promot.; Nat Sci Fdn China.; Chinese Assoc Sci & Technol.; States Adm Foreign Experts Affairs.
Xd: The paper presents a compositional framework for modeling network protocols with symbolic transition graphs. The main advantages of the framework are that it can address dynamic network topologies without requiring additional facilities; and it can work out system models that preserve deadlock freedom, namely the deadlock freedom of a system model depends only on the deadlock freedom of its each task component. A case study with Mobile IP illustrates the effectiveness of the modeling framework. Moreover, with, a model checking experiment, it can be shown that the framework can extend the capability of the model checker to deal with more complicated system models than can be dealt with by direct model checking.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Wu, P, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: PUBLISHING HOUSE ELECTRONICS INDUSTRY
úQHrFU0W@W: PO BOX 173 WANSHOU ROAD, BEIJING 100036, PEOPLES R CHINA
ISBN: 7-121-00308-2
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Information Systems; Telecommunications
ISI e.s O÷S: BCC66

--------------------------------------------------------------------------------
>f:y 18 agÿqQ 58 ag
\O: Dai, GZ; Wang, H
: Shen, W; Lin, Z; Barthes, JPA; Li, T
h: Physical object icons buttons gesture (PIBG): A new interaction paradigm with pen
egnúQHrir: COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN I, 3168: 11-20 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on Computer Supported Cooperative Work in Design
O®åeg: MAY 26-JUN 28, 2004
O®0W¹p: Xiamen, PEOPLES R CHINA
O®^©RFU: Xiamen Univ.; Xiamen Comp Federat.; IEEE.; CIMS.; China Comp Federat.; Zhongshan Univ.; Natl Nat Sci Fdn China.; Fuzhou Univ.
Xd: Pen-based User Interface (PUI) is becoming more and more popular. This paper presents (the) universal analysis and specification of characters and structure of PUI. PIBG, a new interaction paradigm, is proposed as the framework for PUI. PIBG Toolkit is also developed as a PUI Software Platform. With the goal of high usability, several applications are developed with PIBG Toolkit. PUI provides a method for natural and concordant interaction, which could facilitate the development and applications of collaborative systems.
0W@W: Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100080, Peoples R China
¯\O0W@W: Dai, GZ, Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100080, Peoples R China.
5uP[®±{0W@W: Dgz@iel.iscas.ac.cn; Wang@iel.iscas.ac.cn
_(uvÂSe.spe: 18
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-29400-7
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDJ25

--------------------------------------------------------------------------------
>f:y 19 agÿqQ 58 ag
\O: Chen, H; Feng, DG
: Park, C; Chee, S
h: An evolutionary algorithm to improve the nonlinearity of self-inverse S-Boxes
egnúQHrir: INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2004, 3506: 352-361 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 7th International Conference on Information Security and Cryptology (ICISC 2004)
O®åeg: DEC 02-03, 2004
O®0W¹p: Seoul, SOUTH KOREA
O®^©RFU: Korea Inst Informat Secur Cryptol.
\OsQ.Í: self-inverse; S-Box; Walsh Hadamard transform; nonlinearity
Xd: Self-inverse S-Boxes have been given much attention in the design of block ciphers recently. In this paper, based on Walsh Hadamard transform of Boolean functions, an evolutionary algorithm is investigated to increase the nonlinearity of self-inverse S-Boxes. The improved S-Boxes still remain self-inverse. Under this algorithm, randomly generated self-inverse S-Boxes can easily evolve into the ones with much higher nonlinearity.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Chen, H, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China.
5uP[®±{0W@W: chenhua@is.iscas.ac.cn; feng@is.iscas.ac.cn
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-26226-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCO37

--------------------------------------------------------------------------------
>f:y 20 agÿqQ 58 ag
\O: Lu, X; Feng, DG
: Zhang, J; He, JH; Fu, Y
h: An arbitrated quantum message signature scheme
egnúQHrir: COMPUTATIONAL AND INFORMATION SCIENCE, PROCEEDINGS, 3314: 1054-1060 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Symposium on Computational and Information Science
O®åeg: DEC 16-18, 2004
O®0W¹p: Shanghai, PEOPLES R CHINA
O®^©RFU: Donghua Univ.; Shanghai Jiaotong Univ.; Univ Kentucky, Lab High Performance Sci Comp & Comp Simulat.
Xd: Digital signature is an important task in modern cryptography, which concerns about authenticity, integrity and non-repudiation of data on communication channel. In this paper, an arbitrated quantum digital signature scheme is proposed, in which the receiver verifies the signature with the help of an arbitrator. The most important property of the proposed scheme is that it can sign unknown quantum states. The security of the protocol relies on the quantum one-time-pad and the Greenberger-Horne-Zeilinger (GHZ) triplet particles distributed among communication entities. Security analysis shows that the proposed quantum signature is a secure scheme.
0W@W: Chinese Acad Sci, Grad Sch, State Key Lab Informat Secur, Beijing 100039, Peoples R China; Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Lu, X, Chinese Acad Sci, Grad Sch, State Key Lab Informat Secur, Beijing 100039, Peoples R China.
5uP[®±{0W@W: lx@is.ac.cn
_(uvÂSe.spe: 12
«_!k: 4
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-24127-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BBO38

--------------------------------------------------------------------------------
>f:y 21 agÿqQ 58 ag
\O: Li, J; Li, MS; Wu, ZC; Wang, Q
: Cao, J; Yang, LT; Guo, M; Lau, F
h: A metamodel for the CMM software process
egnúQHrir: PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, PROCEEDINGS, 3358: 446-450 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Symposium on Parallel and Distributed Processing and Applications
O®åeg: DEC 13-15, 2004
O®0W¹p: Hong Kong, PEOPLES R CHINA
O®^©RFU: IEEE HK Chapter.; Assoc Comp Machinery, HK Chapter.; Informat Proc Soc Japan.; Springer.
Xd: With the increasing complexity of software system, geographically distributed development has become mainstream. Managing a software process in which team members are physically distributed is challenging. How to use the Capability Maturity Model (CMM) in geographically distributed development is an area with a number of open research issues. We define a CMM Software Process (CSP) by a set of generic process elements in accordance with the requirements of the CMM. Using the Model Driven Architecture (MDA), the CSP model can be transformed into distributed CMM implementation process models. This paper presents a metamodel for the CSP model, named MM-CSP, and provides the abstract syntax and the semantic of the MM-CSP as well as a UML profile for the MM-CSP. Based on the MM-CSP, a prototype tool for CSP modeling is developed.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing, Peoples R China
¯\O0W@W: Li, J, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
5uP[®±{0W@W: lijuan@itechs.iscas.ac.cn
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-24128-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BBM37

--------------------------------------------------------------------------------
>f:y 22 agÿqQ 58 ag
\O: Zhang, WB; Yang, B; Jin, BH; Chen, NJ; Huang, T
: Cao, J; Yang, LT; Guo, M; Lau, F
h: Performance tuning for application server OnceAS
egnúQHrir: PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, PROCEEDINGS, 3358: 451-462 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Symposium on Parallel and Distributed Processing and Applications
O®åeg: DEC 13-15, 2004
O®0W¹p: Hong Kong, PEOPLES R CHINA
O®^©RFU: IEEE HK Chapter.; Assoc Comp Machinery, HK Chapter.; Informat Proc Soc Japan.; Springer.
Xd: The J2EE application server provides a primary solution to develop enterprise-wide applications, which uses containers to hold application components. The container framework relieve developers' burden greatly because it encapsulates all the system level services and the developers are able to use these services directly without knowing underlying details. The processing capacity of application servers is becoming more and more important with the requirements of achieving higher performance and higher scalability. This paper uses ECperf, a performance benchmark tool for application servers. to studies the performance issues of the application server OnceAS. which is developed by the Institute of software, Chinese Academy of Sciences, and presents optimization approaches including bean instance pools and high speed naming service. These optimizations are implemented in OnceAS and proved to be effective through ECperf benchmark evaluation.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing, Peoples R China
¯\O0W@W: Zhang, WB, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
5uP[®±{0W@W: wellday@otcaix.iscas.ac.cn; yangbo@otcaix.iscas.ac.cn; jbh@otcaix.iscas.ac.cn; river@otcaix.iscas.ac.cn; tao@otcaix.iscas.ac.cn
_(uvÂSe.spe: 11
«_!k: 2
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-24128-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BBM37

--------------------------------------------------------------------------------
>f:y 23 agÿqQ 58 ag
\O: Cao, TJ; Lin, DD; Xue, R
: Chi, CH; Lam, KY
h: Security analysis of user efficient blind signatures
egnúQHrir: CONTENT COMPUTING, PROCEEDINGS, 3309: 167-172 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: Advanced Workshop on Content Computing
O®åeg: NOV 15-17, 2004
O®0W¹p: ZhenJiang, PEOPLES R CHINA
Xd: Blind signature schemes allow a person to get a message signed by another party without revealing any information about the message to the other party. To believe the message contains a certain form, cut and choose protocol and partially blind signature protocol are used to prevent cheating. In electronic cash system, unconditional anonymity may be misused for criminal activities such as blackmailing and money laundering. Fair electronic cash schemes are introduced for preventing these fraudulent activities. In this paper, we point out a weakness in Fan and Lei's user efficient blind signatures. Utilizing this weakness, a user can cheat the signer in cut and choose protocol, and the user can also break Fan and Lei's low-computation partially blind signature scheme and Yu et al.'s user efficient fair e-cash scheme.
0W@W: Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China; China Univ Min & Technol, Sch Comp Sci & Technol, Xuzhou 221008, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China
¯\O0W@W: Cao, TJ, Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: tjcao@is.iscas.ac.cn; ddlin@is.iscas.ac.cn; rxue@is.iscas.ac.cn
_(uvÂSe.spe: 13
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-23898-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BBJ44

--------------------------------------------------------------------------------
>f:y 24 agÿqQ 58 ag
\O: Cao, TJ; Lin, DD; Xue, R
: Chi, CH; Lam, KY
h: Improved privacy-protecting proxy signature scheme
egnúQHrir: CONTENT COMPUTING, PROCEEDINGS, 3309: 208-213 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: Advanced Workshop on Content Computing
O®åeg: NOV 15-17, 2004
O®0W¹p: ZhenJiang, PEOPLES R CHINA
Xd: The proxy signature allows a proxy signer to sign on behalf of an original signer and can be verified by anyone with access to the original signer's public key. Recently, Dai et al. proposed a privacy-protecting proxy signature scheme. In this scheme, the messages the original signer entrust to the proxy signer to sign on behalf of him are kept secret from the proxy signer during the generation of the proxy signature except the receiver designated by the original signer. Therefore, the privacy of the original signer is protected. Unfortunately, Dai et al.'s scheme is insecure and inefficient. Particularly, the receiver can cheat the proxy signer and obtain a proxy signature on any message. To eliminate these weaknesses, we propose an improved scheme based on Nyberg-Rueppel signature.
0W@W: Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China; China Univ Min & Technol, Sch Comp Sci & Technol, Xuzhou 221008, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China
¯\O0W@W: Cao, TJ, Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: tjcao@is.iscas.ac.cn; ddlin@is.iscas.ac.cn; rxue@is.iscas.ac.cn
_(uvÂSe.spe: 13
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-23898-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BBJ44

--------------------------------------------------------------------------------
>f:y 25 agÿqQ 58 ag
\O: Su, B; Zhang, WH
: Wang, F
h: Search space partition and case basis exploration for reducing model checking complexity
egnúQHrir: AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS, 3299: 34-48 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Conference on Automated Technology for Verification and Analysis
O®åeg: OCT 31-NOV 03, 2004
O®0W¹p: Taipei, TAIWAN
O®^©RFU: Natl Sci Council.; Minist Educ.; Acad Sinica, Inst Informat Sci.; Natl Taiwan Univ.; Ctr Informat & Elect Technol.; Natl Taiwan Univ, SOC Ctr.; Natl Taiwan Univ, Grad Inst Elect Engn.; Synopsys Inc.
KeyWords Plus: SPIN
Xd: The main disadvantage of model checking is the state explosion problem that can occur if the system being verified has many asynchronous components. Many approaches have been proposed to deal with this challenge. This paper extends an approach that suggests combining static analysis and partition of model checking tasks into different cases for reducing the complexity of model checking and introduces algorithms and a tool for the static analysis. This extended approach and the tool are then applied to models of known authentication protocols and operating procedures, which shows that the approach and the tool could have a wide range of applications.
0W@W: Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing, Peoples R China
¯\O0W@W: Su, B, Chinese Acad Sci, Comp Sci Lab, Inst Software, POB 8718, Beijing, Peoples R China.
5uP[®±{0W@W: subai02@ios.cn; zwh@ios.ac.cn
_(uvÂSe.spe: 15
«_!k: 4
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-23610-4
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 15
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BBF03

--------------------------------------------------------------------------------
>f:y 26 agÿqQ 58 ag
\O: Ma, YL; Wei, J
fNM|âVSO\O: ieee computer society
h: A default extension to distributed description logics
egnúQHrir: IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON INTELLIGENT AGENT TECHNOLOGY, PROCEEDINGS: 38-44 2004
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Intelligent Agent Technology (IAT 2004)
O®åeg: SEP 20-24, 2004
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: IEEE Comp Soc.; Web Intelligence Consortium.; Assoc Comp Machinery.; Beijing Univ Technol.; Natl Nat Sci Fdn China.; Microsoft Res Asia.; China Comp Federat.; Hong Kong Baptist Univ.; Maebashi Inst Technol.; Tsinghua Univ.
KeyWords Plus: INFORMATION
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Ma, YL, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 1
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2101-0
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BBA47

--------------------------------------------------------------------------------
>f:y 27 agÿqQ 58 ag
\O: Sun, LM; Liao, Y; Zheng, JP; Wu, YC; Ma, J
fNM|âVSO\O: IEEE
h: An efficient multicast protocol in mobile IPv6 networks
egnúQHrir: 2004 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-4 - BROADBAND WIRELESS - THE TIME IS NOW : 155-159 2004
NfNh: IEEE Wireless Communications and Networking Conference
í: English
e.s{|W: Proceedings Paper
O®h: IEEE Wireless Communications and Networking Conference
O®åeg: MAR 21-25, 2004
O®0W¹p: Atlanta, GA
O®^©RFU: IEEE.
\OsQ.Í: mobile IPv6; previous network subscription; hierarchical architecture; mobile multicast protocol
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Sun, LM, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 1
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISSN: 1525-3511
ISBN: 0-7803-8344-3
29 W[&{vegnúQHrir
Tðy)Q: IEEE WCNC
egne.sux¡pe: 5
f[Ñy{|+R: Telecommunications
ISI e.s O÷S: BAN75

--------------------------------------------------------------------------------
>f:y 28 agÿqQ 58 ag
\O: Zhang, J
: Ehrich, HD; Schewe, KD
h: Symbolic execution of program paths involving pointer and structure variables
egnúQHrir: QSIC 2004: PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON QUALITY SOFTWARE: 87-92 2004
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Conference on Quality Software
O®åeg: SEP 08-09, 2004
O®0W¹p: Braunschweig, GERMANY
O®^©RFU: Tech Univ Braunschweig, Inst Informat Syst.; Univ Hong Kong, Software Engn Grp.; Swinburne Univ Technol, Ctr Software Engn.
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, J, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 3
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2207-6
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BBA88

--------------------------------------------------------------------------------
>f:y 29 agÿqQ 58 ag
\O: Zhang, X; Xu, C; Jin, BH
: Strooper, P
h: Building extensible and high performance distributed transaction service
egnúQHrir: 2004 AUSTRALIAN SOFTWARE ENGINEERING CONFERENCE, PROCEEDINGS: 202-210 2004
í: English
e.s{|W: Proceedings Paper
O®h: 15th Australian Software Engineering Conference
O®åeg: APR 13-16, 2004
O®0W¹p: Melbourne, AUSTRALIA
O®^©RFU: Australian Comp Soc.; Engineers Australia.
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, X, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 15
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2089-8
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BAB32

--------------------------------------------------------------------------------
>f:y 30 agÿqQ 58 ag
\O: Zhou, YB; Zhang, ZF; Qing, SH; Liu, J
: Yuan, ST; Liu, J
h: A new CEMBS based on RSA signatures and its application in constructing fair exchange protocol
egnúQHrir: 2004 IEEE INTERNATIONAL CONFERNECE ON E-TECHNOLOGY, E-COMMERE AND E-SERVICE, PROCEEDINGS: 558-562 2004
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE 2004)
O®åeg: MAR 28-31, 2004
O®0W¹p: Taipei, TAIWAN
O®^©RFU: IEEE Task Comm E-Commerce.; Fu Jen Univ Taiwan.; BIKMrdc Fu Jen Univ.; Acad Sinica.; Natl Sci Council Taiwan.; Minist Educ Taiwan.; Informat Syst Frontiers.; Microsoft.; NTU CSIE.; ChungHwa Data Mining Soc.
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhou, YB, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2073-1
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Information Systems; Computer Science, Interdisciplinary Applications
ISI e.s O÷S: BY96L

--------------------------------------------------------------------------------
>f:y 31 agÿqQ 58 ag
\O: Zheng, JP; Li, KQ; Wu, ZM
: Hassanein, H; Oliver, RL; Richard, GG
fNM|\O: Wilson, LF
h: Selection algorithm for anycast relay routing
egnúQHrir: CONFERENCE PROCEEDINGS OF THE 2004 IEEE INTERNATIONAL PERFORMANCE, COMPUTING, AND COMMUNICATIONS CONFERENCE: 21-27 2004
NfNh: IEEE International Performance, Computing and Communications Conference (IPCCC)
í: English
e.s{|W: Proceedings Paper
O®h: 23rd IEEE International Performance, Computing, and Communications Conference (IPCCC 2004)
O®åeg: APR 15-17, 2004
O®0W¹p: Phoenix, AZ
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zheng, JP, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISSN: 1097-2641
ISBN: 0-7803-8396-6
29 W[&{vegnúQHrir
Tðy)Q: IEEE IPCCC
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Information Systems; Telecommunications
ISI e.s O÷S: BAC05

--------------------------------------------------------------------------------
>f:y 32 agÿqQ 58 ag
\O: Wu, YC; Sun, LM; Zheng, JP; Huang, K; Liao, Y
: Hassanein, H; Oliver, RL; Richard, GG
fNM|\O: Wilson, LF
h: Channel state dependent robust TCP/IP header compression for 3G wireless networks
egnúQHrir: CONFERENCE PROCEEDINGS OF THE 2004 IEEE INTERNATIONAL PERFORMANCE, COMPUTING, AND COMMUNICATIONS CONFERENCE: 141-145 2004
NfNh: IEEE International Performance, Computing and Communications Conference (IPCCC)
í: English
e.s{|W: Proceedings Paper
O®h: 23rd IEEE International Performance, Computing, and Communications Conference (IPCCC 2004)
O®åeg: APR 15-17, 2004
O®0W¹p: Phoenix, AZ
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Wu, YC, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 15
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISSN: 1097-2641
ISBN: 0-7803-8396-6
29 W[&{vegnúQHrir
Tðy)Q: IEEE IPCCC
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Information Systems; Telecommunications
ISI e.s O÷S: BAC05

--------------------------------------------------------------------------------
>f:y 33 agÿqQ 58 ag
\O: Li, YJ; Xue, R
: Srimani, PK
h: Using SPIN to model cryptographic protocols
egnúQHrir: ITCC 2004: INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: CODING AND COMPUTING, VOL 2, PROCEEDINGS: 741-745 2004
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Information Technology - Coding and Computing
O®åeg: APR 05-07, 2004
O®0W¹p: Las Vegas, NV
O®^©RFU: IEEE Comp Soc.
Xd: We explore the useof Spitz 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.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Li, YJ, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2108-8
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Hardware & Architecture; Computer Science, Information Systems; Computer Science, Theory & Methods
ISI e.s O÷S: BAA56

--------------------------------------------------------------------------------
>f:y 34 agÿqQ 58 ag
\O: Wu, YC; Sun, LM; Ma, J
fNM|âVSO\O: IEEE
h: Adaptive robust TCP/IP header compression algorithm for 3G wireless networks
egnúQHrir: 2004 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-4 - BROADBAND WIRELESS - THE TIME IS NOW : 1046-1050 2004
NfNh: IEEE Wireless Communications and Networking Conference
í: English
e.s{|W: Proceedings Paper
O®h: IEEE Wireless Communications and Networking Conference
O®åeg: MAR 21-25, 2004
O®0W¹p: Atlanta, GA
O®^©RFU: IEEE.
\OsQ.Í: TCP/IP; header compression; W-LSB encoding
KeyWords Plus: CHANNELS
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Wu, YC, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 15
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISSN: 1525-3511
ISBN: 0-7803-8344-3
29 W[&{vegnúQHrir
Tðy)Q: IEEE WCNC
egne.sux¡pe: 5
f[Ñy{|+R: Telecommunications
ISI e.s O÷S: BAN75

--------------------------------------------------------------------------------
>f:y 35 agÿqQ 58 ag
\O: Ji, JF; Li, S; Liu, XH; Wu, EH
fNM|âVSO\O: ieee computer society
h: P-quadtrees: A point and polygon hybrid multi-resolution rendering approach
egnúQHrir: COMPUTER GRAPHICS INTERNATIONAL, PROCEEDINGS: 382-385 2004
í: English
e.s{|W: Proceedings Paper
O®h: Computer Graphics International Conference (CGI 2004)
O®åeg: JUN 16-19, 2004
O®0W¹p: Crete, GREECE
O®^©RFU: SCI.
\OsQ.Í: point and polygon hybrid rendering; normal mapping; silhouette fidelity; quadtrees; LOD
Xd: 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.
0W@W: Chinese Acad Sci, Lab Comp Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Ji, JF, Chinese Acad Sci, Lab Comp Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 14
«_!k: 1
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2171-1
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BAM16

--------------------------------------------------------------------------------
>f:y 36 agÿqQ 58 ag
\O: Liu, Y; Liu, X; Wui, E
fNM|âVSO\O: IEEE Comp Soc
h: Real-time 3D fluid simulation on GPU with complex obstacles
egnúQHrir: 12TH PACIFIC CONFERENCE ON COMPUTER GRAPHICS AND APPLICATIONS, PROCEEDINGS: 247-256 2004
í: English
e.s{|W: Proceedings Paper
O®h: 12th Pacific Conference on Computer Graphics and Applications (PG 2004)
O®åeg: OCT 06-08, 2004
O®0W¹p: Seoul, SOUTH KOREA
KeyWords Plus: COMPUTATION
Xd: 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.
0W@W: Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Liu, Y, Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 31
«_!k: 2
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2234-3
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BBC59

--------------------------------------------------------------------------------
>f:y 37 agÿqQ 58 ag
\O: Li, WJ; Li, MS; Wang, Q; Wang, YJ
: Zhang, LJ; Li, M; Sheth, AP; Jeffery, KG
h: VICOS: A framework for session management in network computing infrastructure
egnúQHrir: 2004 IEEE INTERNATIONAL CONFERENCE ON SERVICES COMPUTING, PROCEEDINGS: 647-650 2004
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on Services Computing
O®åeg: SEP 15-18, 2004
O®0W¹p: Shanghai, PEOPLES R CHINA
O®^©RFU: IEEE Comp Soc, TSC SC.
Xd: 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 set-vice with low overhead.
0W@W: Chinese Acad Sci, Lab Internet Technol, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Li, WJ, Chinese Acad Sci, Lab Internet Technol, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2225-4
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Theory & Methods
ISI e.s O÷S: BBB87

--------------------------------------------------------------------------------
>f:y 38 agÿqQ 58 ag
\O: Liu, SH; Wei, J; Ma, YL; Liu, Y
: Zhong, N; Tirri, H; Yao, YY; Zhou, L; Liu, J; Cercone, N
h: Web service cooperation ideology
egnúQHrir: IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE (WI 2004), PROCEEDINGS: 537-540 2004
í: English
e.s{|W: Proceedings Paper
O®h: IEEE/WIC/ACM International Conference on Web Intelligence
O®åeg: SEP 20-24, 2004
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: IEEE Comp Soc.; ACM.; Web Intelligence Consortium.; Beijing Univ Technol.; NSFC.
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Liu, SH, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 6
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2100-2
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems
ISI e.s O÷S: BBB14

--------------------------------------------------------------------------------
>f:y 39 agÿqQ 58 ag
\O: Zhao, FQ; Hong, Y; Yu, DM; Yang, YH
: Wu, Q; Wang, XH
h: A concurrent engineering-based feature information integration system and its implementation by STEP
egnúQHrir: PROCEEDINGS OF THE 2004 CHINA-JAPAN JOINT MEETING ON MICROWAVES: 480-483 2004
í: English
e.s{|W: Proceedings Paper
O®h: China-Japan Joint Meeting on Microwaves
O®åeg: AUG 05-06, 2004
O®0W¹p: Harbin, PEOPLES R CHINA
O®^©RFU: Natl Nat Sci Fdn China.; Chinese Inst Elect.; IEICE Elect Soc Japan.; IEEE Beijing Sect.; Harbin Inst Technol.; Microwave Soc.
\OsQ.Í: STEP; concurrent engineering(CE); information integration; feature
Xd: Product data exchange and interfacing between different CAD/CAM system are of great importance to the development of concurrent integrated design environments and computer integrated manufacturing system. In this paper, a new information integration approach based on STEP is present. First, a feature information models in EXPRESS according to AP214 is established using a three-layer architecture(application, logical and physical layers) recommend by STEP, then translate the EXPRESS information models into C++ structure classes by ST_Developer tools, finally, the integration technology based on STEP application protocol and the ST-Developer tools is realized in a prototype system to support product data integration between CAD and its follow-up systems through STEP physical file and STEP information exchange interface. The feature-based information model, which is proposed in this paper, can meet the common information requirement of CAD, CAPP, and other applications following CAD.
0W@W: Lanzhou Univ Tech, Coll Elect & Informat Engn, Lanzhou 730050, Peoples R China; Chinese Acad Sci, Inst Software, Key Lab Comp Sci, Beijing 100080, Peoples R China
¯\O0W@W: Zhao, FQ, Lanzhou Univ Tech, Coll Elect & Informat Engn, Lanzhou 730050, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: HARBIN INSTITUTE TECHNOLOGY PUBLISHERS
úQHrFU0W@W: 16 FUXINGJIE NANGANGQU, HARBIN 150006, HEILONGJIANG, PEOPLES R CHINA
ISBN: 7-5603-2054-6
egne.sux¡pe: 4
f[Ñy{|+R: Engineering, Electrical & Electronic
ISI e.s O÷S: BAZ90

--------------------------------------------------------------------------------
>f:y 40 agÿqQ 58 ag
\O: Zhang, J; Xu, C; Wang, XL
: Cuellar, JR; Liu, ZM
h: Path-oriented test data generation using symbolic execution and constraint solving techniques
egnúQHrir: PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND FORMAL METHODS: 242-250 2004
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Conference on Software Engineering and Formal Methods
O®åeg: SEP 28-30, 2004
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: IEEE Comp Soc, Tech Comm Complex Comp.; UNU IIST.; Peking Univ.; Chinese Acad Sci, Acad Div.
KeyWords Plus: PROGRAMS
Xd: 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).
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, J, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 33
«_!k: 2
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2222-X
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BBB83

--------------------------------------------------------------------------------
>f:y 41 agÿqQ 58 ag
\O: Chen, H; Feng, DG
fNM|âVSO\O: IEEE
h: An effective evolutionary strategy for bijective S-boxes
egnúQHrir: CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2: 2120-2123 2004
NfNh: IEEE Congress on Evolutionary Computation
í: English
e.s{|W: Proceedings Paper
O®h: Congress on Evolutionary Computation (CEC 2004)
O®åeg: JUN 19-23, 2004
O®0W¹p: Portland, OR
O®^©RFU: IEEE, Neural Network Soc.; Evolutionary Programming Soc.; IEEE.
Xd: 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 x 8 bijective S-boxes is provided and a large number of S-boxes with high nonlinearity and low difference uniformity can be obtained.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Chen, H, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-8515-2
29 W[&{vegnúQHrir
Tðy)Q: IEEE CONGRESS EVOLUT COMPUTAT
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Theory & Methods
ISI e.s O÷S: BAM20

--------------------------------------------------------------------------------
>f:y 42 agÿqQ 58 ag
\O: Ma, CX; Wang, HG; Dai, GZ; Chen, YD
: Shen, W; Li, TQ; Lin, ZK; Barthes, JP; Zeng, WH; Li, S; Yang, CH
h: Research on collaborative interaction based on gesture and sketch in conceptual design
egnúQHrir: PROCEEDINGS OF THE 8TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, VOL 1: 261-266 2004
NfNh: International Conference on Computer Supported Cooperative Work in Design
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on Computer Supported Cooperative Work in Design
O®åeg: MAY 26-JUN 28, 2004
O®0W¹p: Xiamen, PEOPLES R CHINA
O®^©RFU: Xiamen Univ.; Xiamen Comp Federat.; IEEE.; CIMS.; China Comp Federat.; Zhongshan Univ.; Natl Nat Sci Fdn China.; Fuzhou Univ.
Xd: 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-direct constrain solution is put forward. This paper provides a convenient method of collaborative design to develop design efficiency and improve human-computer interaction.
0W@W: Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100080, Peoples R China
¯\O0W@W: Ma, CX, Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: INTERNATIONAL ACADEMIC PUBLISHERS LTD
úQHrFU0W@W: UNIT 1205, 12 FLOOR, SINO PLAZA, 255 GLOUCESTER ROAD, HONG KONG 00000, CAUSEWAY BAY, PEOPLES R CHINA
ISBN: 7-5062-6209-6
29 W[&{vegnúQHrir
Tðy)Q: INT CONF COMP SUPP COOP WORK
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Interdisciplinary Applications
ISI e.s O÷S: BAN09

--------------------------------------------------------------------------------
>f:y 43 agÿqQ 58 ag
\O: Dai, GZ
: Shen, W; Li, TQ; Lin, ZK; Barthes, JP; Zeng, WH; Li, S; Yang, CH
h: Pen-based user interface
egnúQHrir: PROCEEDINGS OF THE 8TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, VOL 2: 32-36 2004
NfNh: International Conference on Computer Supported Cooperative Work in Design
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on Computer Supported Cooperative Work in Design
O®åeg: MAY 26-JUN 28, 2004
O®0W¹p: Xiamen, PEOPLES R CHINA
O®^©RFU: Xiamen Univ.; Xiamen Comp Federat.; IEEE.; CIMS.; China Comp Federat.; Zhongshan Univ.; Natl Nat Sci Fdn China.; Fuzhou Univ.
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100080, Peoples R China
¯\O0W@W: Dai, GZ, Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 19
«_!k: 0
úQHrFU: INTERNATIONAL ACADEMIC PUBLISHERS LTD
úQHrFU0W@W: UNIT 1205, 12 FLOOR, SINO PLAZA, 255 GLOUCESTER ROAD, HONG KONG 00000, CAUSEWAY BAY, PEOPLES R CHINA
ISBN: 0-7803-7941-1
29 W[&{vegnúQHrir
Tðy)Q: INT CONF COMP SUPP COOP WORK
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Interdisciplinary Applications
ISI e.s O÷S: BAN11

--------------------------------------------------------------------------------
>f:y 44 agÿqQ 58 ag
\O: Wang, DL; Dai, GZ; Wang, HG; Hua, QY
: Shen, W; Li, TQ; Lin, ZK; Barthes, JP; Zeng, WH; Li, S; Yang, CH
h: Research on the cooperation of the virtual enterprise using metasynthetic engineering
egnúQHrir: PROCEEDINGS OF THE 8TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, VOL 2: 582-587 2004
NfNh: International Conference on Computer Supported Cooperative Work in Design
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on Computer Supported Cooperative Work in Design
O®åeg: MAY 26-JUN 28, 2004
O®0W¹p: Xiamen, PEOPLES R CHINA
O®^©RFU: Xiamen Univ.; Xiamen Comp Federat.; IEEE.; CIMS.; China Comp Federat.; Zhongshan Univ.; Natl Nat Sci Fdn China.; Fuzhou Univ.
KeyWords Plus: ANALYTIC HIERARCHY PROCESS
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Wang, DL, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 19
«_!k: 0
úQHrFU: INTERNATIONAL ACADEMIC PUBLISHERS LTD
úQHrFU0W@W: UNIT 1205, 12 FLOOR, SINO PLAZA, 255 GLOUCESTER ROAD, HONG KONG 00000, CAUSEWAY BAY, PEOPLES R CHINA
ISBN: 0-7803-7941-1
29 W[&{vegnúQHrir
Tðy)Q: INT CONF COMP SUPP COOP WORK
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Interdisciplinary Applications
ISI e.s O÷S: BAN11

--------------------------------------------------------------------------------
>f:y 45 agÿqQ 58 ag
\O: Wang, JL; Jin, BH; Wei, J; Li, J
: Meersman, R; Tari, Z; VanderAalst, W; Bussler, C; Gal, A; Cahill, V; Vinoski, S; Vogels, W; Gatarci, T; Sycara, K
h: A reliable content-based routing protocol over structured peer-to-peer networks
egnúQHrir: ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS 2004: COOPIS, DOA, AND ODBASE, PT 1, PROCEEDINGS, 3290: 373-390 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: On the Move Confederated International Workshop and Conference
O®åeg: OCT 25-29, 2004
O®0W¹p: Agia Napa, CYPRUS
O®^©RFU: RMIT Univ, Sch Comp Sci & Informat Technol.; Vrije Univ Brussel, Dept Comp Sci.
Xd: Much work has been done on.. building content-based publish/subscribe systems over structured P2P networks',so that the two technologies can be combined together to better support large-scale and highly dynamic systems. However, existing content-based routing protocols can only provide weak reliability guarantee over structured P2P networks. We designed a new type of content-based routing protocol over structured P2P networks - Identifier Range Based Routing (IRBR) protocol, which organizes subscriptions on the basis of the identifier range of subscribers. It provides strong reliability guarantee and is more efficient in event delivery. Experimental results demonstrate the routing efficiency of the protocol.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing, Peoples R China
¯\O0W@W: Wang, JL, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
5uP[®±{0W@W: jlwang@otcaix.iscas.ac.cn; jbh@otcaix.iscas.ac.cn; wj@otcaix.iscas.ac.cn; lij@otcaix.iscas.ac.cn
_(uvÂSe.spe: 29
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-23663-5
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 18
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BBE03

--------------------------------------------------------------------------------
>f:y 46 agÿqQ 58 ag
\O: Wang, H; Buczak, AL; Jin, H; Wang, H; Li, B
: Jin, H; Gao, GR; Xu, ZW; Chen, H
h: Sensors network optimization by a novel genetic algorithm
egnúQHrir: NETWORK AND PARALLEL COMPUTING, PROCEEDINGS, 3222: 536-543 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: IFIP International Conference on Network and Parallel Computing
O®åeg: OCT 18-20, 2004
O®0W¹p: Wuhan, PEOPLES R CHINA
O®^©RFU: IFIP.
Xd: This paper describes the optimization of a sensor network by a novel Genetic Algorithm (GA) that we call King Mutation C2. For a given distribution of sensors, the goal of the system is to determine the optimal combination of sensors that can detect and/or locate the objects. An optimal combination is the one that minimizes the power consumption of the entire sensor network and gives the best accuracy of location of desired objects. The system constructs a GA with the appropriate internal structure for the optimization problem at hand, and King Mutation C2 finds the quasi-optimal combination of sensors that can detect and/or locate the objects. The study is performed for the sensor network optimization problem with five objects to detect/track and the results obtained by a canonical GA and King Mutation C2 are compared.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China; Lockheed Martin Adv Technol Labs, Cherry Hill, NJ 08002 USA; Zibo Elect Power Co, Shandong 255032, Peoples R China
¯\O0W@W: Wang, H, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
5uP[®±{0W@W: wanghui@ios.cn
_(uvÂSe.spe: 17
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-23388-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BBB67

--------------------------------------------------------------------------------
>f:y 47 agÿqQ 58 ag
\O: Xu, C; Cheung, SC; Lo, C; Leung, KC; Wei, J
: Jin, H; Gao, GR; Xu, ZW; Chen, H
h: Cabot: On the ontology for the middleware support of context-aware pervasive applications
egnúQHrir: NETWORK AND PARALLEL COMPUTING, PROCEEDINGS, 3222: 568-575 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: IFIP International Conference on Network and Parallel Computing
O®åeg: OCT 18-20, 2004
O®0W¹p: Wuhan, PEOPLES R CHINA
O®^©RFU: IFIP.
Xd: Middleware support is a major topic in pervasive computing. Existing studies mainly address the issues in the organization of and the collaboration amongst devices and services, but pay little attention to the design support of context-aware pervasive applications. Most of these applications are required to be adaptable to dynamic environments and self-managed. However, most context-aware pervasive applications nowadays have to carry out tedious tasks of gathering, classifying and processing messy context information due to lack of the necessary middleware support. To address this problem, we propose a novel approach based on ontology technology, and apply it in our Cabot project. Our approach defines a context ontology catered for the pervasive computing environment. The ontology acts as the context information agreement amongst all computing components to support applications with flexible context gathering and classifying capabilities. This allows a domain ontology database to be constructed for storing the semantics relationship of concepts used in the pervasive computing environment. The ontology database supports applications with rich context processing capabilities. With the aid of ontology technology, Cabot further helps alleviate the impact of the naming problem, and support advanced user space switching. A case study is given to show how Cabot assists developers in designing context-aware pervasive applications.
0W@W: Hong Kong Univ Sci & Technol, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China; Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100864, Peoples R China
¯\O0W@W: Xu, C, Hong Kong Univ Sci & Technol, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China.
5uP[®±{0W@W: changxu@cs.ust.hk; scc@cs.ust.uk; cindylo@cs.ust.hk; lkchiu@cs.ust.hk; wj@otcaix.iscas.ac.cn
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-23388-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BBB67

--------------------------------------------------------------------------------
>f:y 48 agÿqQ 58 ag
\O: Wang, JL; Jin, BH; Li, J
: Jacobsen, HA
h: An ontology-based publish/subscribe system
egnúQHrir: MIDDLEWARE 2004, PROCEEDINGS, 3231: 232-253 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 5th International Middleware Conference
O®åeg: OCT, 2004
O®0W¹p: Toronto, CANADA
O®^©RFU: ACM.; IFIP.; USENIX.; Cybermation.; IONA.; BBN Technologies.; IBM Res.; Siemens.
KeyWords Plus: SUBGRAPH ISOMORPHISM
Xd: Expressiveness and matching efficiency are two key design goals of publish/subscribe systems. In this paper, we introduce the Semantic Web technologies into the publish/subscribe system and propose an ontology-based publish/subscribe (OPS) system. The system can make use of the semantic of events to match events with subscriptions, and can support events with complex data structure (such as graph structure). An efficient matching algorithm is proposed for the OPS system, which can match events with subscriptions in a speed much higher than conventional graph matching algorithms. Therefore, the main contribution of our work is that it greatly improves the expressiveness of the publish/subscribe system without the sacrifice of matching efficiency.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing, Peoples R China
¯\O0W@W: Wang, JL, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
5uP[®±{0W@W: jlwang@otcaix.iscas.ac.cn; jbh@otcaix.iscas.ac.cn; lij@otcaix.iscas.ac.cn
_(uvÂSe.spe: 25
«_!k: 5
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-23428-4
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 22
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BBB68

--------------------------------------------------------------------------------
>f:y 49 agÿqQ 58 ag
\O: Zhang, J; Zhang, HT
: Buchberger, B; Campbell, JA
h: Extending finite model searching with congruence closure computation
egnúQHrir: ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION, PROCEEDINGS, 3249: 94-102 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 7th International Conference on Artificial Intelligence and Symbolic Computation
O®åeg: SEP 22-24, 2004
O®0W¹p: Linz, AUSTRIA
O®^©RFU: Johannes Kepler Univ Linz, Res Inst Symbol Computat.; Randon Inst Computat & Appl Math.; Austrian Acad Sci.; Linzer Hochschulfonds.; Upper Austrian Govt.; Austrian Sci Fdn.; Raiffeisenlandesbank Upper Austria.; Siemens Austria.; CoLogNET.
Xd: The model generation problem, regarded as a special case of the Constraint Satisfaction Problem (CSP), has many applications in AI, computer science and mathematics. In this paper, we describe how to increase propagation of constraints by using the ground congruence closure algorithm. The experimental results show that using the congruence closure algorithm can reduce the search space for some benchmark problems.
0W@W: Chinese Acad Sci, Inst Software, Lab Comp Sci, Beijing 100080, Peoples R China; Univ Iowa, Dept Comp Sci, Iowa City, IA 52242 USA
¯\O0W@W: Zhang, J, Chinese Acad Sci, Inst Software, Lab Comp Sci, Beijing 100080, Peoples R China.
5uP[®±{0W@W: zj@ios.ac.cn; hzhang@cs.uiowa.edu
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-23212-5
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BAX58

--------------------------------------------------------------------------------
>f:y 50 agÿqQ 58 ag
\O: Deng, XT; Li, GJ
: Diaz, J; Karhumaki, J; Lepisto, A; Sannella, D
h: A PTAS for embedding hypergraph in a cycle - (Extended abstract)
egnúQHrir: AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 3142: 433-444 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 31st International Colloquium on Automata, Languages and Programming (ICALP 2004)
O®åeg: JUL 12-16, 2004
O®0W¹p: Turku, FINLAND
O®^©RFU: Turku Ctr Comp Sci.; Acad Finland.; City Turku.; Finnair.; Finnish Acad Sci & Letters.; Vaisala Fdn.; Math Fdn.; Finnish Cultural Fdn.; Fujitsu Siemens.; IBM.; MasterPlanet.; Nokia.; Nordea.; Sampo Life Insurance Co Ltd.; Stiftelsen Abo Akad.; Turku Univ Fdn.; Turun Seudun Osuuspankki.; Univ Turku.
O®;NR¹e: Turku Univ Math Dept
\OsQ.Í: minimum congestion embedding hypergraph in a cycle; computer application; polynomial-time approximation scheme
KeyWords Plus: RING LOADING PROBLEM; PLANAR GRAPHS; ALGORITHMS
Xd: We consider the problem of embedding hyperedges of a hypergraph as paths in a cycle such that the maximum congestion-the maximum number of paths that use any single edge in a cycle-is minimized. We settle the problem with a polynomial-time approximation scheme.
0W@W: City Univ Hong Kong, Hong Kong, Hong Kong, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Shandong Univ, Sch Math & Syst Sci, Jinan 250100, Peoples R China
¯\O0W@W: Deng, XT, City Univ Hong Kong, Hong Kong, Hong Kong, Peoples R China.
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-22849-7
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BAU86

--------------------------------------------------------------------------------
>f:y 51 agÿqQ 58 ag
\O: Li, SG; Li, GJ; Zhang, SQ
: Chwa, KY; Munro, JI
h: Minimizing maximum lateness on identical parallel batch processing machines
egnúQHrir: COMPUTING AND COMBINATORICS, PROCEEDINGS, 3106: 229-237 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 10th International Computing and Combinatories Conference (COCOON 2004)
O®åeg: AUG 17-20, 2004
O®0W¹p: Jeju Isl, SOUTH KOREA
O®^©RFU: Korea Adv Inst Sci & Techol.; Korea Sci & Engn Fdn.; Korea Informat Sci Soc.
KeyWords Plus: ALGORITHMS; TIMES
Xd: We consider the problem of scheduling n jobs with release dates on m identical parallel batch processing machines so as to minimize the maximum lateness. Each batch processing machine can process up to B (B f:y 52 agÿqQ 58 ag
\O: Bi, WX; Wang, XG; Zong, ZL; Tang, Z
: Yin, FL; Wang, J; Guo, CG
h: Modified error function with added terms for the backpropagation algorithm
egnúQHrir: ADVANCES IN NEURAL NETWORKS - ISNN 2004, PT 1, 3173: 338-343 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Symposium on Neural Networks (ISSN 2004)
O®åeg: AUG 19-21, 2004
O®0W¹p: Dalian, PEOPLES R CHINA
O®^©RFU: Dalian Univ Technol.; Chinese Univ Hong Kong.; IEEE Circuits & Syst Soc.; IEEE Computat Intelligence Soc.; IEEE Control Syst Soc.; Robot & Automat Soc.
Xd: We have noted that the local minima problem in the back-propagation algorithm is usually caused by update disharmony between weights connected to the hidden layer and the output layer. To solve this problem, we propose a modified error function with added terms. By adding one term to the conventional error function, the modified error function can harmonize the update of weights connected to the hidden layer and the output layer. Thus, it can avoid the local minima problem caused by such disharmony. Moreover, some new learning parameters introduced for the added term are easy to select. Simulations on the modified XOR problem have been performed to test the validity of the modified error function.
0W@W: Toyama Univ, Fac Engn, Toyama 9308555, Japan; Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100080, Peoples R China; Shandong Univ, Fac Comp Sci, Jinan 250061, Peoples R China
¯\O0W@W: Bi, WX, Toyama Univ, Fac Engn, Toyama 9308555, Japan.
5uP[®±{0W@W: biweixing613@hotmail.com; tang@iis.toyama-u.ac.jp; wxg@iel.iscas.ac.cn; pipizzl@hotmail.com
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-22841-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BAT64

--------------------------------------------------------------------------------
>f:y 53 agÿqQ 58 ag
\O: Ren, ZH; Jin, BH; Li, J
: Bussler, C; Fensel, D; Orlowska, ME; Yang, J
h: A new web application development methodology: Web service composition
egnúQHrir: WEB SERVICES, E-BUSINESS, AND THE SEMANTIC WEB, 3095: 134-145 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Workshop on Web Services, E-Business and the Semantic Web held in conjunction with the 15th International Conference on Advanced Information Systems Engineering (CAiSE 2003)
O®åeg: JUN 16-17, 2003
O®0W¹p: Klagenfurt, AUSTRIA
Xd: Traditional methodology for web application development can not fully satisfy the requirement raised by web services. Generally, distributed web applications are built on top of 3-tier client/server model, which is a relatively static environment that can provide reliable static service binding. However, in the web service-oriented environment, service binding is dynamic and just-in-time. How to enable the composition among the web services has become a key area in the software engineering research. In this paper, we present a new methodology for web application development, which is a framework that facilitates the visual design, validation and development of web service composition. The framework is mainly based on Web Service Composition Graph (WSCG), the underlying formalism for web service compositions. Using graph grammar and graph transformation defined on WSCG, the static topological structure of a web service composition can be described and the automation of the constructed web service composition is also facilitated.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Ren, ZH, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: ren@otcaix.iscas.ac.cn; jbh@otcaix.iscas.ac.cn; lij@otcaix.iscas.ac.cn
_(uvÂSe.spe: 15
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-22396-7
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BAR49

--------------------------------------------------------------------------------
>f:y 54 agÿqQ 58 ag
\O: Wu, YW; Yang, GW; Zheng, WM; Lin, DD
: Bubak, M; DickVanAlbada, G; Sloot, PMA; Dongarra, JJ
h: DisCAS: A distributed-parallel computer algebra system
egnúQHrir: COMPUTATIONAL SCIENCE - ICCS 2004, PROCEEDINGS, 3039: 295-302 Part 4 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Conference on Computational Science (ICCS 2004)
O®åeg: JUN 06-09, 2004
O®0W¹p: Krakow, POLAND
O®^©RFU: Hewlett-Packard.; Intel.; SGI.; ATM.; Sun Microsyst.; IBM.; Polish Airlines LOT.; ACC CYFRONET AGH.; Inst Comp Sci AGH.; Polish Minist Sci Res & Informat Technol.; Springer Verlag.
Xd: The DisCAS system employs and interacts with multiple ELIMINOs distributed over the Internet to achieve a distributed-parallel computing environment. ELIMINO is a computer algebra system developed to support Wu's method for computing characteristic sets of polynomials and for other related operations. GridPPI, an MPI-like interface for grid computing, could couple multiple computing tools distributed over grid to run complex computing problems. DisCAS combines grid technology, GridPPI and ELIMINOs to deliver high performance computing to Internet users. The overall ELIMINO, GridPPI, and grid technology, as well as the DisCAS architecture are presented. The way to access and apply DisCAS and related works are also discussed at last.
0W@W: Tsing Hua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China; Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Wu, YW, Tsing Hua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China.
_(uvÂSe.spe: 18
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-22129-8
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BAO62

--------------------------------------------------------------------------------
>f:y 55 agÿqQ 58 ag
\O: Wu, EH; Liu, YQ; Liu, XH
h: An improved study of real-time fluid simulation on GPU
egnúQHrir: COMPUTER ANIMATION AND VIRTUAL WORLDS, 15 (3-4): 139-146 JUL 2004
í: English
e.s{|W: Proceedings Paper
O®h: 17th Annual Conference on Computer Animation and Social Agents (CASA 2004)
O®åeg: JUL 07-09, 2004
O®0W¹p: Geneva, SWITZERLAND
O®;NR¹e: Univ Geneva
\OsQ.Í: graphics hardware; GPLF; programmability; NSEs; fluid simulation; real-time
Xd: Taking advantage of the parallelism and programmability of GPU, we solve the fluid dynamics problem completely on GPU. Different from 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 (C) 2004 John Wiley Sons, Ltd.
0W@W: Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing, Peoples R China
¯\O0W@W: Wu, EH, Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing, Peoples R China.
5uP[®±{0W@W: ehwu@umac.mo
_(uvÂSe.spe: 25
«_!k: 12
úQHrFU: JOHN WILEY & SONS LTD
úQHrFU0W@W: THE ATRIUM, SOUTHERN GATE, CHICHESTER PO19 8SQ, W SUSSEX, ENGLAND
ISSN: 1546-4261
DOI: 10.1002/cav.16
29 W[&{vegnúQHrir
Tðy)Q: COMPUT ANIMAT VIRTUAL WORLDS
ISO egne.súQHrir
Tðy)Q: Comput. Animat. Virtual Worlds
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: 839OZ

--------------------------------------------------------------------------------
>f:y 56 agÿqQ 58 ag
\O: Wang, JF; Zhou, MT; Li, YX
: Mammeri, Z; Lorenz, P
h: Survey on the end-to-end Internet delay measurements
egnúQHrir: HIGH SPEED NETWORKS AND MULTIMEDIA COMMUNICATIONS, PROCEEDINGS, 3079: 155-166 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 7th IEEE International Conference on High Speech Networks and Multimedia Communications
O®åeg: JUN 30-JUL 02, 2004
O®0W¹p: Toulouse, FRANCE
O®^©RFU: IEEE.
Xd: The end-to-end delay of Internet is a fundamental indicator for network performance evaluation and has been becoming a hot issue in network measurements in recent years. There are two kinds of metrics related to the end-to-end latency, i.e., Round Trip Delay and One-way Delay metric. In the paper, we survey the recent progresses on these two types of metrics measurement. Special concerns are on the clock synchronization issue in one-way delay measurement. The problems in deploying end-to-end delay measurement and the timestamping issue are also summarized. The potential new research directions in delay measurement and analysis are discussed.
0W@W: Univ Elect Sci & Technol China, Coll Comp Sci & Engn, Chengdu, Peoples R China; Chongqing Commun Inst, Grad Sch, Chongqing, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Wang, JF, Univ Elect Sci & Technol China, Coll Comp Sci & Engn, Chengdu, Peoples R China.
5uP[®±{0W@W: mailwangjf@yahoo.com.cn; mtzhou@uestc.edu.cn; liyuxia20022003@yahoo.com.cn
_(uvÂSe.spe: 35
«_!k: 3
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-22262-6
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BAJ34

--------------------------------------------------------------------------------
>f:y 57 agÿqQ 58 ag
\O: Chen, Y
: Dai, H; Srikant, R; Zhang, C
h: Discovering ordered tree patterns from XML queries
egnúQHrir: ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PROCEEDINGS, 3056: 559-563 2004
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: 8th Pacific/Asia Conference on Advances in Knowledge Discovery and Data Mining
O®åeg: MAY 26-28, 2004
O®0W¹p: Sydney, AUSTRALIA
O®^©RFU: NICIA.; SAS.; Univ Technol Sydney.; Deakin Univ.
Xd: 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.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Chen, Y, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 4
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-22064-X
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BAF29

--------------------------------------------------------------------------------
>f:y 58 agÿqQ 58 ag
\O: Chen, B; Chi, XB; Wu, H
: Li, M; Sun, XH; Deng, Q; Ni, J
h: A model for user management in grid computing environments
egnúQHrir: GRID AND COOPERATIVE COMPUTING, PT 1, 3032: 732-737 2004
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Workshop on Grid and Cooperative Computing
O®åeg: DEC 07-10, 2003
O®0W¹p: Shanghai, PEOPLES R CHINA
Xd: Grid user management aims to effectively manage grid user accounts. The traditional model to manage grid user accounts has several disadvantages. With the enlargement of the scale of the grid computing environment, these disadvantages will become more obvious. In contrast to the traditional model of grid user management, we propose a model that is based on the concept of account mapping. This allows us to facilitate user management and improve the scalability, security and accounting, and make uniform management possible.
0W@W: Chinese Acad Sci, Comp Network Informat Ctr, Beijing 100080, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Chen, B, Chinese Acad Sci, Comp Network Informat Ctr, Beijing 100080, Peoples R China.
5uP[®±{0W@W: chb@jupiter.cnc.ac.cn; chi@jupiter.cnc.ac.cn; wh@jupiter.cnc.ac.cn
_(uvÂSe.spe: 6
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISBN: 3-540-21988-9
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BAC96

ISTP 2005
>f:y 1 agÿqQ 119 ag
\O: Duan, YC (Duan, Yucong); Gu, YQ (Gu, Yuqing); Fu, XL (Fu, Xiaolan)
: Callaos, N; Lesso, W; Su, JS; Conrad, M
h: Manual portion in software process transformation model
egnúQHrir: WMSCI 2005: 9th World Multi-Conference on Systemics, Cybernetics and Informatics, Vol 7: 428-433 2005
í: English
e.s{|W: Proceedings Paper
O®h: 9th World Multi-Conference on Systemics, Cybernetics and Informatics
O®åeg: JUL 10-13, 2005
O®0W¹p: Orlando, FL
\OsQ.Í: model driven software development; model transformation; manual work; automation; UML
Xd: Automatable portion and manual portion of model transformation (MT) definitions usually are not currently differentiated in most model driven software development processes (MD2P). This absence contributes to the vagueness and inefficiency of the task schedule of MT automation. We propose a concept framework of MIB/CSD (manual work, inheritance, behaviorism / cardinality, static, dynamic) to model MD2P and differentiate between automatable and manual portions of work. Its application can potentially provide quality evaluation support for completeness and clearness of MD2P models based on UML. Experimental examples of the generation of rule based transformation system with the aid of this framework are illustrated.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Duan, YC, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 15
«_!k: 0
úQHrFU: INT INST INFORMATICS & SYSTEMICS
úQHrFU0W@W: 14269 LORD BARCLAY DR, ORLANDO, FL 32837 USA
ISBN: 978-980-6560-59-8
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Cybernetics; Computer Science, Information Systems
ISI e.s O÷S: BFQ00

--------------------------------------------------------------------------------
>f:y 2 agÿqQ 119 ag
\O: Guan, HQ; Jin, BH; Wei, J; Xu, W; Chen, NJ
fNM|âVSO\O: IEEE Comp Soc
h: A framework for application server based web services management
egnúQHrir: 12th Asia-Pacific Software Engineering Conference, Proceedings: 95-102 2005
í: English
e.s{|W: Proceedings Paper
O®h: 12th Asia-Pacific Software Engineering Conference
O®åeg: DEC 15-17, 2005
O®0W¹p: Taipei, TAIWAN
O®^©RFU: Natl Cent Univ.; Minist Educ, Advisory Off.; Dept Ind Technol, Minist Econ Affairs.; Natl Sci Council.; Acad Sinica, Inst Informat Sci.
\OsQ.Í: web services; web services management; application server
Xd: Web services are considered as solution for solving the interoperability problem and the challenge of integration. How to manage web services more efficiently is a key problem to the applications based on web services at present. This paper presents a framework for application server based web services management named FASWSM. The main contribution of FASWSM is web service adaptation, so that a web service can be plugged into the application server (AS) as a web service adapter which enables a web service to be managed by the application server. Therefore, the web services management efforts are greatly reduced by leveraging various services provided by the AS. The FASWSM also provides mechanisms for dynamical reconfiguration which improve the extensibility and flexibility of web services management. The FASWSM has been applied to OnceAS 2.0 application server, and the experiments data show. that FASWSM outperforms JAX-RPC in terms of Web service invocation.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Guan, HQ, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 18
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2465-6
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BDU46

--------------------------------------------------------------------------------
>f:y 3 agÿqQ 119 ag
\O: Hu, ZY; Liu, ZQ; Su, PR; Feng, DG
fNM|âVSO\O: IEEE
h: Blocking MSN: A case study of preventing the abuse of IM
egnúQHrir: 2005 Asia-Pacific Conference on Communications (APCC), Vols 1& 2: 1112-1116 2005
í: English
e.s{|W: Proceedings Paper
O®h: 11th Asia-Pacific Conference on Communications
O®åeg: OCT 03-05, 2005
O®0W¹p: Perth, AUSTRALIA
O®^©RFU: IEEE.
\OsQ.Í: blocking; instant messaging; IM; NISN; security; threat; vulnerability
Xd: This paper discusses how to effectively block MSN communication. Based on the analysis of the MSN Messenger Protocol, Five effective blocking methods and a message-driven algorithm are proposed. Experimental results are also presented to compare the performances of different methods. The work done in this paper provides practicable and effective solutions to preventing and controlling the abuse of MSN and other kinds of IM.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Hu, ZY, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 3
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-9132-2
egne.sux¡pe: 5
f[Ñy{|+R: Telecommunications
ISI e.s O÷S: BDX66

--------------------------------------------------------------------------------
>f:y 4 agÿqQ 119 ag
\O: Gang, X; Wei, X; Tao, H
: Ceballos, S
h: Extending OBDD graphs for composite event matching in content-based Pub/Sub systems
egnúQHrir: ISPDC 2005: 4TH INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED COMPUTING: 290-298 2005
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Symposium on Parallel and Distributed Computing (ISPDC 2005)
O®åeg: JUL 04-06, 2005
O®0W¹p: Lille, FRANCE
O®^©RFU: Reg Nord Calais.; France Telecom.; USTL.; CNRS.; LIFL.; IBM.; IEEE Sect France.; INRIA.; IEEE Comp Soc.; IEEE.
O®;NR¹e: Univ Lille 1
Xd: Content-based publish/subscribe offers a convenient abstraction for the information producers and consumers, supporting a large-scale system design and evolution by integrating several distributed independent application systems. Unlike it? the traditional address-based unicast or multicast, its core problem is how to matching events 1) v predicates on the content of events. In existing matching approaches, matching predicates are composed by the conjunction and disjunction of non-semantic constraints. But, in context of enterprise application integration, although they con match events by their contents, this traditional matching predicates at,(, not enough expressive in manipulating the complex event matching, such as the "one-to-many" and "many-to-one" matching. Therefore, traditional matching approaches should be extended to solve the complex matching problems. After analyzing information matching patterns in enterprise application integration, we propose three matching models, extend the simple matching to the multi-semantic matching and introduce the temporal constraint variable. The multi-semantic matching allows using different operations in accordance with different semantics; the temporal constraint variable supports processing the discrete events in the temporal sequence. Then, we extend OBDD graphs into hierarchy coloured OBDD graphs and prove the equivalence of the transformation. Based on the extended OBDD graphs. the composite matching algorithm is presented and analysed. By experiments, we show the proposed algorithm is efficient.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Gang, X, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 13
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2434-6
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDM76

--------------------------------------------------------------------------------
>f:y 5 agÿqQ 119 ag
\O: Wang, JF; Zhou, HX; Li, L; Xu, FJ
fNM|âVSO\O: IEEE Computer Society
h: Accurate long-tailed network traffic approximation and its queueing analysis by Hyper-Erlang distributions
egnúQHrir: LCN 2005: 30th Conference on Local Computer Networks, Proceedings: 148-155 2005
í: English
e.s{|W: Proceedings Paper
O®h: 30th Annual IEEE Conference on Local Computer Networks
O®åeg: NOV 15-17, 2005
O®0W¹p: Sydney, AUSTRALIA
O®^©RFU: IEEE.; ACoRN.; Natl ICT Australia.; BBN Technologies.; Univ New S Wales.
Xd: Internet traffic has been proven to be long-tailedness and often modeled by Lognormal distribution, Weibull or Pareto distributions theoretically. However, these mathematical models hinder us in traffic analysis and evaluation studies due to their complex representations and theoretical properties. This paper proposes a Hyper-Erlang Model (Mixed Erlang distribution) for such long-tailed network traffic approximation. It fits network traffic with long-tailed characteristic into a mixed Erlang distribution directly to facilitate our further analysis. Compared with the well-known hyperexponential based method, the mixed Erlang model is more accurate in fitting the tail behavior and also computationally efficient. Further investigations on the M/G/1 queueing behavior also prove the efficiency of the Mixed Erlang based approximation.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Wang, JF, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 22
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2421-4
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Information Systems; Telecommunications
ISI e.s O÷S: BDS10

--------------------------------------------------------------------------------
>f:y 6 agÿqQ 119 ag
\O: Sun, YT; Shi, ZQ; Wu, ZM
fNM|âVSO\O: IEEE Computer Society
h: A discovery algorithm for physical topology in switched ethernets
egnúQHrir: LCN 2005: 30th Conference on Local Computer Networks, Proceedings: 311-317 2005
í: English
e.s{|W: Proceedings Paper
O®h: 30th Annual IEEE Conference on Local Computer Networks
O®åeg: NOV 15-17, 2005
O®0W¹p: Sydney, AUSTRALIA
O®^©RFU: IEEE.; ACoRN.; Natl ICT Australia.; BBN Technologies.; Univ New S Wales.
Xd: Accurate and up-to-date knowledge of topology serves as the base of a number of network management functions, such as performance monitoring and evaluation, fault detection and location, resource allocation and etc. In the paper, the topology of a Switched Ethernet is abstract to a tree and the relationship between any two network nodes is determined as a lineal connection or collateral connection by aid of a set of theorems. Based on the theorems, a practical algorithm to automatically discover the physical topology of Switched Ethernets is proposed based on the incomplete Address Forwarding Tables (AFTs). As an important part of the Network Management System of Community Broadband Integrated Services Network (CBISNMS), this mechanism is working successfully.
0W@W: Chinese Acad Sci, Multimedia Commun & Network Engn Res Ctr, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Sun, YT, Chinese Acad Sci, Multimedia Commun & Network Engn Res Ctr, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2421-4
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Information Systems; Telecommunications
ISI e.s O÷S: BDS10

--------------------------------------------------------------------------------
>f:y 7 agÿqQ 119 ag
\O: Xu, G; Xu, W; Huang, T
fNM|âVSO\O: IEEE COMPUTER SOC
h: An extended event matching approach in content-based pub/sub systems for EAI
egnúQHrir: NINTH IEEE INTERNATIONAL EDOC ENTERPRISE COMPUTING CONFERENCE, PROCEEDINGS: 287-295 2005
í: English
e.s{|W: Proceedings Paper
O®h: 9th IEEE International Enterprise Distributed Object Computing Conference
O®åeg: SEP 19-23, 2005
O®0W¹p: Enschede, NETHERLANDS
O®^©RFU: IEEE Comp Soc TCDP.; IEEE Commun Soc.; CTIT.; Univ Twente.; Telemat Inst.; NWO.; TNO.; AgentLink.; ACM.; OMG.; Open Grp.; NAF.; InterOP.
Xd: Content-based publish/subscribe offers a convenient abstraction for information producers and consumers, supporting a large-scale system design and evolution by integrating several distributed independent application systems. Unlike in the traditional address-based unicast or multicast, its core problem is how to match events by predicates on the content of events. In existing matching approaches, matching predicates are composed by the conjunction and disjunction of nonsemantic constraints. But, in context of enterprise application integration, although they can match events by their contents, this traditional matching predicates are not expressive enough in manipulating the complex event matching, such as the "one-to-many" and "many-to-one "matching. Therefore, traditional matching approaches should be extended to solve the complex matching problems. After analyzing information matching patterns in enterprise application integration, we propose three matching models, extend this simple matching approach to the multisemantic matching approach and further introduce the temporal constraint variable. The multi-semantic matching approach allows using different operations in accordance with different semantics; the temporal constraint variable supports processing several discrete events in temporal sequences. Then, we extend OBDD graphs into hierarchy coloured OBDD graphs and prove the equivalence of the transformation. Based on the extended OBDD graphs, the composite matching algorithm is presented and analysed. By experiments, we show the proposed algorithm is efficient.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Xu, G, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 13
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2441-9
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDM82

--------------------------------------------------------------------------------
>f:y 8 agÿqQ 119 ag
\O: Zhang, JL; Sun, L; Min, JM
fNM|âVSO\O: IEEE
h: Using the Web corpus to translate the queries in cross-lingual information retrieval
egnúQHrir: Proceedings of the 2005 IEEE International Conference on Natural Language Processing and Knowledge Engineering (IEEE NLP-KE'05): 493-498 2005
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Natural Language Processing and Knowledge Engineering
O®åeg: OCT 30-NOV 01, 2005
O®0W¹p: Wuhan, PEOPLES R CHINA
O®^©RFU: IEEE.; AAI.; CIPSC.; Chinese Assoc Artificial Intelligence.; IEEE Signal Proc Soc.; IEEE Beijing Sect.
Xd: Accurate cross-language information retrieval requires that query terms be correctly translated. In this paper, we propose a new method for Web corpus based query translation, which contains two steps: (1) translation candidate extraction and (2) translation selection. In translation candidate extraction, we use the search engine to rind out the corpus data in the target language on the web by submitting the query in source language. The candidate translations are expected to be both in the title and query-biased summary of searched document. Then we find the intersection substrings of different title pairs (or title-summary pairs) to fix down the possible translation. In translation selection, we determine the possible translation(s) from the candidates by combining substring frequency, Inverse Translation Frequency and top result preferred factor to design the ranking function. Experimental results indicate that the top 3 inclusion rate of translation is 75.57% and our method is also very effective in CLIR task.
0W@W: Chinese Acad Sci, Inst Software, Open Syst & Chinese Informat Proc Ctr, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, JL, Chinese Acad Sci, Inst Software, Open Syst & Chinese Informat Proc Ctr, 4 Nan 4 St,Mailbox 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 13
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-9361-9
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems
ISI e.s O÷S: BDV06

--------------------------------------------------------------------------------
>f:y 9 agÿqQ 119 ag
\O: Feng, YY; Sun, L; Zhang, JL
fNM|âVSO\O: IEEE
h: Early results for chinese named entity recognition using conditional random fields model, HMM and maximum entropy
egnúQHrir: Proceedings of the 2005 IEEE International Conference on Natural Language Processing and Knowledge Engineering (IEEE NLP-KE'05): 549-552 2005
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Natural Language Processing and Knowledge Engineering
O®åeg: OCT 30-NOV 01, 2005
O®0W¹p: Wuhan, PEOPLES R CHINA
O®^©RFU: IEEE.; AAI.; CIPSC.; Chinese Assoc Artificial Intelligence.; IEEE Signal Proc Soc.; IEEE Beijing Sect.
Xd: Named Entity Recognition (NER) is an important step for many natural language applications, such as information extraction, text summarization, and question answering. Chinese NER has some special characteristics that make this task difficult.
In this paper, we present some NER experiments on the corpora used for Chinese 863 NER task in 2004 based on three models: maximum entropy, hidden Markov model (HMM) and the more recent conditional random fields (CRFs).
The results show that CRFs model outperforms the other two models in the sense of best results and average performance, and model scalability among data sizes. In our experiments, CRFs model approach can achieve an overall 171 measure around 84.39/80.68 in simple/traditional Chinese NER respectively, with a gain of 2.01/10.50 over the best system in 863 competitions.
0W@W: Chinese Acad Sci, Inst Software, Open Syst & Chinese Informat Proc Ctr, Beijing 100080, Peoples R China
¯\O0W@W: Feng, YY, Chinese Acad Sci, Inst Software, Open Syst & Chinese Informat Proc Ctr, 4 S 4th Zhongguancun Rd,Mailbox 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 25
«_!k: 1
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-9361-9
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems
ISI e.s O÷S: BDV06

--------------------------------------------------------------------------------
>f:y 10 agÿqQ 119 ag
\O: Zhang, JL; Sun, L; Zhou, Q
fNM|âVSO\O: IEEE
h: A cue-based hub-authority approach for multi-document text summarization
egnúQHrir: Proceedings of the 2005 IEEE International Conference on Natural Language Processing and Knowledge Engineering (IEEE NLP-KE'05): 642-645 2005
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Natural Language Processing and Knowledge Engineering
O®åeg: OCT 30-NOV 01, 2005
O®0W¹p: Wuhan, PEOPLES R CHINA
O®^©RFU: IEEE.; AAI.; CIPSC.; Chinese Assoc Artificial Intelligence.; IEEE Signal Proc Soc.; IEEE Beijing Sect.
Xd: Multi-document extractive summarization relies on the concept of sentence centrality to identify the most important sentences in a document. Although some research has introduced the graph-based ranking algorithms such as PageRank and HITS into the text summarization, we propose a new approach under the Hub-Authority framework: in this paper. Our approach combines the text content with some cues such as "cue phrase", "sentence length" and "first sentence" and explores the sub-topics in the multi-documents by bringing the features of these sub-topics into graph-based sentence ranking algorithms. We provide an evaluation of our method on DUC 2004 data. The results show that our approach is an effective graph-ranking schema in multi-document generic text summarization.
0W@W: Chinese Acad Sci, Open Syst & Chinese Informat Proc Ctr, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, JL, Chinese Acad Sci, Open Syst & Chinese Informat Proc Ctr, Inst Software, 4 Nan 4 St,Mailbox 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 1
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-9361-9
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems
ISI e.s O÷S: BDV06

--------------------------------------------------------------------------------
>f:y 11 agÿqQ 119 ag
\O: Liu, J; Fan, ZH; Li, L; Xu, FJ
: Chen, Z; Peng, XY; Wang, ZG; Duan, HB; Fan, WH; Li, N; Li, N; Tan, J; Tang, SQ; Zhang, P; Zhao, G
fNM|\O: Zhang, LX
h: Applying object petri nets to the multi-resolution entities based simulations
egnúQHrir: System Simulation and Scientific Computing, Vols 1 and 2, Proceedings: 1512-1516 2005
í: English
e.s{|W: Proceedings Paper
O®h: Asia Simulation Conference/6th International Conference on System Simulation and Scientific Computing
O®åeg: OCT 24-27, 2005
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Assoc Syst Simulat.; Korea Soc Simulat.; Japanese Soc Simulat Technol.; Soc Modeling & Simulat Int.; Federat European Simulat Soc.; Int Assoc Math & Comp Simulat.; Beijing Univ, Aeronaut & Astronaut.; Natl Nat Sci Fdn China.; Beijing Simulat Ctr.; Beijing Electro-Mech Engn Inst.; Acad Armored Force Engn.; Natl Univ Defence Technol.; Tsinghua Univ.; Harban Inst Technol.; Harbin AF Flight Simulat Technol Inst.
\OsQ.Í: object petri nets; multi-resolution entities; multi-resolution simulation
Xd: Multi-resolution simulation studies a problem from different representation levels and angles. MIZE approach is a comparatively practical approach of Multi-Resolution Simulation. The formalism of colored petri nets is extended with object features. A definition on object petri nets is given. MRE based simulation system is formally described based on object petri nets in order to analyze the system behavior and verify the logical correctness of a concurrent distributed system before development. A data structure is provided to describe the representation levels in multiple levels simulation systems. A procedure and some translation rules that map a MRE simulation system into an OPN are provided. This facilitates study and application to MRE based simulation system. And an example is demonstrated.
0W@W: Chinese Acad Sci, Gen Software Lab, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Liu, J, Chinese Acad Sci, Gen Software Lab, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 4
«_!k: 0
úQHrFU: INTERNATIONAL ACADEMIC PUBLISHERS LTD
úQHrFU0W@W: UNIT 1205, 12 FLOOR, SINO PLAZA, 255 GLOUCESTER ROAD, HONG KONG 00000, CAUSEWAY BAY, PEOPLES R CHINA
ISBN: 7-5062-7841-3
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Interdisciplinary Applications; Computer Science, Theory & Methods
ISI e.s O÷S: BDL23

--------------------------------------------------------------------------------
>f:y 12 agÿqQ 119 ag
\O: Wang, Q; Li, MS
fNM|âVSO\O: IEEE
h: Measuring and improving software process in China
egnúQHrir: 2005 International Symposium on Empirical Software Engineering (ISESE), Proceedings: 177-186 2005
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Symposium on Empirical Software Engineering
O®åeg: NOV 17-18, 2005
O®0W¹p: Noosa Heads, AUSTRALIA
O®^©RFU: IEEE Comp Soc.; ACM SIGSOFT.
Xd: Measurement is an important facility to support effective and reasonable management. Software development has its inherent property of high-dependency on the personal capabilty of software engineers that causes the variance and instability of software processes. Therefore measurement for software process has long been a challenge. This paper discusses the major problems in software process measurement, presents an active measurement model (AMM) to support software process improvement (SPI). Based on the AMM, software organizations can establish adaptive measurement process and execute the measure just close-related the process goals, which focuses on their particular business environment. Subsequently, some methods of establishing the adaptive measurement process and the appropriate software process performance baseline to support higher level quantitative management are suggested. The application and implementation Of AMM and the related methods is introduced in the end. These works were integrated in a toolkit called SoftPM, which was used widely in China.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Wang, Q, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-9507-7
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BDZ69

--------------------------------------------------------------------------------
>f:y 13 agÿqQ 119 ag
\O: Sun, YT; Wu, ZM; Shi, ZQ
fNM|âVSO\O: IEEE
h: The physical topology discovery for Switched Ethernet based on Connections Reasoning Technique
egnúQHrir: International Symposium on Communications and Information Technologies 2005, Vols 1 and 2, Proceedings: 42-45 2005
í: English
e.s{|W: Proceedings Paper
O®h: International Symposium on Communications and Information Technologies (ISCIT2005)
O®åeg: OCT 12-14, 2005
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Natl Nat Sci Fdn China.; K C Wong Educ Fdn Hong Kong.; IEEE Circuits & Syst Soc.; IEEE Commun Soc Beijing Chapter.; Beijing Assoc Sci & Technol.; Beijing Univ Posts & Telecommun.; IEICE Japan.; ECTI Thailand.
\OsQ.Í: network management; topology discovery; Switched Ethernets; address forwarding table; connections reasoning
Xd: Accurate and up-to-date knowledge of topology serves as the base of a number of network management functions, such as performance monitoring and evaluation, fault detection and location, resource allocation and etc. Firstly the main achievements in topology discovery for LAN are introduced and the defects of those methods are pointed out in this paper. Then the basic theories for Connections Reasoning Technique (CRT) based on the Predication Logic are proposed. This technique translates the topology discovery into a math problem of logic reasoning, so that topology of LAN can be studied by mathematic tools. A new algorithm for topology discovery based on this mechanism is proposed in this paper. Compared with current discovery algorithms, this method excels in: 1) making use of AFT more effectively in topology discovery, so the whole topology can be build up by just a part of AFTs; 2) naturally resolving the problem of topology discovery for multiple subnet switched domain.
0W@W: Chinese Acad Sci, Multimedia Commun & Network Engn Res Ctr, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Sun, YT, Chinese Acad Sci, Multimedia Commun & Network Engn Res Ctr, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-9538-7
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Information Systems; Telecommunications
ISI e.s O÷S: BDY20

--------------------------------------------------------------------------------
>f:y 14 agÿqQ 119 ag
\O: Sun, HB; Lin, DD; Xue, R
fNM|âVSO\O: IEEE
h: An improved efficient self-healing group key distribution
egnúQHrir: International Symposium on Communications and Information Technologies 2005, Vols 1 and 2, Proceedings: 185-189 2005
í: English
e.s{|W: Proceedings Paper
O®h: International Symposium on Communications and Information Technologies (ISCIT2005)
O®åeg: OCT 12-14, 2005
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Natl Nat Sci Fdn China.; K C Wong Educ Fdn Hong Kong.; IEEE Circuits & Syst Soc.; IEEE Commun Soc Beijing Chapter.; Beijing Assoc Sci & Technol.; Beijing Univ Posts & Telecommun.; IEICE Japan.; ECTI Thailand.
\OsQ.Í: self-healing; group key distribution; threshold
Xd: In[1], the authors presents new group key distribution techniques for large and dynamic groups over unreliable channels. The techniques are based on the self-healing key distribution methods (with revocation capability) recently developed by Staddon et al. [2]. By introducing a novel personal key distribution technique, this paper reduces the communication overhead of personal key share distribution and the communication overhead of self-heating key distribution with t-revocation capability where t is the maximum number of colluding group members. Because this technique adopts the polynomial to realize, the degree of these polynomials determine the threshold of the number of colluding group members. And because this scheme is based on ID, so the identity of the excluded member will be open. In this paper, we improved a new scheme based on exponential function to avoid the limitation of threshold and at the same time, our scheme is not based on ID, the identity of member can be protected effectively. All these results are achieved without sacrificing the unconditional security of key distribution and overhead of communication and personal storage. In addition, two techniques proposed in Ill to allow trade-off between the broadcast size and the recoverability of lost session keys are also adaptive in our scheme.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Sun, HB, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 6
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-9538-7
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Information Systems; Telecommunications
ISI e.s O÷S: BDY20

--------------------------------------------------------------------------------
>f:y 15 agÿqQ 119 ag
\O: Sheng, LZ; Lei, W; Wei, HF; Sun, LM; Wu, ZM
fNM|âVSO\O: IEEE
h: A quality of service mechanism for IEEE 802.11 wireless network based on service differentiation
egnúQHrir: International Symposium on Communications and Information Technologies 2005, Vols 1 and 2, Proceedings: 526-529 2005
í: English
e.s{|W: Proceedings Paper
O®h: International Symposium on Communications and Information Technologies (ISCIT2005)
O®åeg: OCT 12-14, 2005
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Natl Nat Sci Fdn China.; K C Wong Educ Fdn Hong Kong.; IEEE Circuits & Syst Soc.; IEEE Commun Soc Beijing Chapter.; Beijing Assoc Sci & Technol.; Beijing Univ Posts & Telecommun.; IEICE Japan.; ECTI Thailand.
\OsQ.Í: wireless local area network; QoS; service differentiation
KeyWords Plus: PERFORMANCE
Xd: This paper introduces an analytical model for wireless local area network with priority schemes based service differentiation. This model can predict station performance by access stations' number and traffic type before wireless channel condition changed. Then a new algorithm, DTCWF (Dynamic Tuning of Contention Window with Fairness), is proposed to modify protocol options to limit end to end delay and loss rate of high priority traffic and maximize throughput of other traffics. Simulations validate this model and the comparison between DTCWF, DCF, and EDCA shows that our algorithm can improve quality of service for real-time traffic.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Sheng, LZ, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-9538-7
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Information Systems; Telecommunications
ISI e.s O÷S: BDY20

--------------------------------------------------------------------------------
>f:y 16 agÿqQ 119 ag
\O: Jin, H; Wang, DL; Wang, HA; Wang, H
: Arabnia, HR
h: Energy-aware scheduling design of control tasks
egnúQHrir: PDPTA '05: Proceedings of the 2005 International Conference on Parallel and Distributed Processing Techniques and Applications, Vols 1-3: 386-392 2005
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Parallel and Distributed Processing Techniques and Applications
O®åeg: JUN 27-30, 2005
O®0W¹p: Las Vegas, NV
\OsQ.Í: computer controlled systems; scheduling; feedbac control; dynamic voltage scaling
Xd: To consider the energy-aware scheduling problem in computer-controlled systems is necessary to improve the control performance of systems, to use limited computing resource reasonably, and to reduce the energy-consumption to extend the lift of the whole system. In this paper the scheduling problem of multiple control tas s based on an ad ustable voltage processor is discussed. A fuzzy feedback control scheduling architecture is presented based on technologies of fuzzy feedback control and dynamic voltage scaling (DVS). The simulation results show that, by using the actual utilization as the feedback information to adjust the supply voltage of the processor dynamically, high CPU utilization can be implemented under the precondition of guaranteeing the control performance, whilst low energy consumption is achieved as well. The proposed method can be applied to the design in computer-controlled systems based on an ad ustable voltage processor.
0W@W: Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100080, Peoples R China
¯\O0W@W: Jin, H, Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: C S R E A PRESS
úQHrFU0W@W: 115 AVALON DR, ATHENS, GA 30606 USA
ISBN: 1-932415-61-0
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDY80

--------------------------------------------------------------------------------
>f:y 17 agÿqQ 119 ag
\O: Wang, HB (Wang, Hongbing); Fan, ZH (Fan, Zhihua); Tang, J (Tang, Jian); She, CD (She, Chundong)
: Gu, J; Liu, PX
h: Research on simulation of an extended MAS model
egnúQHrir: 2005 IEEE International Conference on Mechatronics and Automations, Vols 1-4, Conference Proceedings: 1678-1683 2005
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on Mechatronics Automation
O®åeg: JUL 29-AUG 01, 2005
O®0W¹p: Niagara Falls, CANADA
O®^©RFU: IEEE Robot & Automat Soc.; Harbin Engn Univ.; Kagawa Univ.; Univ Elect Sci & Technol China.; Robot Soc Japan.; Japan Soc Mech Engineers.; Japan Soc Precis Engn.
\OsQ.Í: MAS; joint effect; organization structure; social law; HLA
Xd: An extended MAS computation model with the integration of social law and organization structure was proposed. The formal description about two typical organization structures was given. The joint effect of social law and organization structure with respect to iteration speed and average payoff was investigated in the test bed of cooperation and competition with the introduction of organization structure, which was implemented on the integrated platform of JADE and HLA.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Wang, HB, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-9044-X
egne.sux¡pe: 6
f[Ñy{|+R: Automation & Control Systems; Computer Science, Artificial Intelligence; Engineering, Electrical & Electronic; Engineering, Mechanical; Robotics
ISI e.s O÷S: BEQ03

--------------------------------------------------------------------------------
>f:y 18 agÿqQ 119 ag
\O: She, CD (She, Chundong); Tang, J (Tang, Jian); Li, L (Li, Lei); Wang, HB (Wang, Hongbing); Fan, ZH (Fan, Zhihua)
: Gu, J; Liu, PX
h: An improved parallel algorithm for sequence mining
egnúQHrir: 2005 IEEE International Conference on Mechatronics and Automations, Vols 1-4, Conference Proceedings: 1692-1696 2005
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on Mechatronics Automation
O®åeg: JUL 29-AUG 01, 2005
O®0W¹p: Niagara Falls, CANADA
O®^©RFU: IEEE Robot & Automat Soc.; Harbin Engn Univ.; Kagawa Univ.; Univ Elect Sci & Technol China.; Robot Soc Japan.; Japan Soc Mech Engineers.; Japan Soc Precis Engn.
\OsQ.Í: parallel processing; task decomposition; projection algorithm; frequent sequential patterns
Xd: It is more and more important in data mining field to finding the frequent sequences in a large database. The paper briefly introduces the basic concept of frequent sequence mining and presents the data parallel formulation and task parallel formulation of tree-projection based algorithm. Moreover, the on-line LPT algorithm is used to successfully solve the problem of imbalance for the task parallel formulation Our experiment shows that these algorithms are capable of achieving good speedups. However, the task parallel formulation is more scalable than the data parallel one.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: She, CD, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-9044-X
egne.sux¡pe: 5
f[Ñy{|+R: Automation & Control Systems; Computer Science, Artificial Intelligence; Engineering, Electrical & Electronic; Engineering, Mechanical; Robotics
ISI e.s O÷S: BEQ03

--------------------------------------------------------------------------------
>f:y 19 agÿqQ 119 ag
\O: Cao, JW (Cao, Jianwen); Sun, JC (Sun, Jiachang)
h: An efficient and effective nonlinear solver in a parallel software for large scale petroleum reservoir simulation
egnúQHrir: INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING, 2: 15-27 Sp. Iss. SI 2005
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Scientific Computing in Petroleum Industry (SCPI)
O®åeg: AUG 04-07, 2004
O®0W¹p: Beijing, PEOPLES R CHINA
\OsQ.Í: petroleum reservoir simulation; nonlinear solver; preconditioning; inexact Newton; BFGS; Krylov subspace; parallel performance
KeyWords Plus: QUASI-NEWTON METHODS; NONSYMMETRIC LINEAR-SYSTEMS
Xd: We study a parallel Newton-Krylov-Schwarz (NKS) based algorithm for solving large sparse systems resulting from a fully implicit discretization of partial differential equations arising from petroleum reservoir simulations. Our NKS algorithm is designed by combining an inexact Newton method with a rank-2 updated quasi-Newton method. In order to improve the computational efficiency, both DDM and SPMD parallelism strategies are adopted. The effectiveness of the overall algorithm depends heavily on the performance of the linear preconditioner, which is made of a combination of several preconditioning components including AMC, relaxed ILU, up scaling, additive Schwarz, CRP-like(constraint residual preconditioning), Watts correction, Shur complement, among others. In the construction of the CRP-like preconditioner, a restarted CMRES is used to solve the projected linear systems. We have tested this algorithm and related parallel software using data from some real applications, and presented numerical results that show that this solver is robust and scalable for large scale calculations in petroleum reservoir simulations.
0W@W: Chinese Acad Sci, Inst Software, Lab Parallel Comp, Beijing 100080, Peoples R China
¯\O0W@W: Cao, JW, Chinese Acad Sci, Inst Software, Lab Parallel Comp, Beijing 100080, Peoples R China.
5uP[®±{0W@W: cao@rdcps.ac.cn
_(uvÂSe.spe: 27
«_!k: 1
úQHrFU: ISCI-INSTITUTE SCIENTIFIC COMPUTING & INFORMATION
úQHrFU0W@W: PO BOX 60632, UNIV ALBERTA POSTAL OUTLET,, EDMONTON, ALBERTA T6G 2G1, CANADA
ISSN: 1705-5105
29 W[&{vegnúQHrir
Tðy)Q: INT J NUMER ANAL MODEL
ISO egne.súQHrir
Tðy)Q: Int. J. Numer. Anal. Model.
egne.sux¡pe: 13
f[Ñy{|+R: Mathematics, Applied; Mathematics
ISI e.s O÷S: 091ZZ

--------------------------------------------------------------------------------
>f:y 20 agÿqQ 119 ag
\O: Li, HW (Li, Hongwei); Sun, JC (Sun, Jiachang)
h: Robin transmission conditions for overlapping additive Schwarz method applied to linear elliptic problems
egnúQHrir: INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING, 2: 83-99 Sp. Iss. SI 2005
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Scientific Computing in Petroleum Industry (SCPI)
O®åeg: AUG 04-07, 2004
O®0W¹p: Beijing, PEOPLES R CHINA
\OsQ.Í: domain decomposition; additive Schwarz methods; Robin transmission conditions
KeyWords Plus: DOMAIN DECOMPOSITION
Xd: We consider overlapping Additive Schwarz Method(ASM) with Robin conditions as the transmission conditions (interior boundary conditions). The main difficulty left in this field is how to select the parameters for Robin conditions - these parameters have strong effect on the convergence rate of ASM. In this paper, we proposed the parameters for linear elliptic problems which seemed to be near optimal.
0W@W: Chinese Acad Sci, Inst Software, Lab Parallel Comp, Beijing 100080, Peoples R China
¯\O0W@W: Li, HW, Chinese Acad Sci, Inst Software, Lab Parallel Comp, POB 8718, Beijing 100080, Peoples R China.
5uP[®±{0W@W: lhw@mail.rdcps.ac.cn; sun@mail.rdcps.ac.cn
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: ISCI-INSTITUTE SCIENTIFIC COMPUTING & INFORMATION
úQHrFU0W@W: PO BOX 60632, UNIV ALBERTA POSTAL OUTLET,, EDMONTON, ALBERTA T6G 2G1, CANADA
ISSN: 1705-5105
29 W[&{vegnúQHrir
Tðy)Q: INT J NUMER ANAL MODEL
ISO egne.súQHrir
Tðy)Q: Int. J. Numer. Anal. Model.
egne.sux¡pe: 17
f[Ñy{|+R: Mathematics, Applied; Mathematics
ISI e.s O÷S: 091ZZ

--------------------------------------------------------------------------------
>f:y 21 agÿqQ 119 ag
\O: Yao, JF (Yao, Jifeng)
h: Explorer, a visualization system for reservoir simulations
egnúQHrir: INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING, 2: 169-176 Sp. Iss. SI 2005
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Scientific Computing in Petroleum Industry (SCPI)
O®åeg: AUG 04-07, 2004
O®0W¹p: Beijing, PEOPLES R CHINA
\OsQ.Í: visualization system; post-processing; reservoir simulation
Xd: In this paper, we introduce Explorer, a visualization system for reservoir simulations. It is designed for large-scale data sets and many technologies have been used during its implementation, such as a 3-layer Client-Commware-Server (CCS) structure, Object-Oriented method, VTK based rendering and etc. Compared with current commercial softwares, Explorer has many features including more data formats support, many user-defined properties and full support for Chinese characters.
0W@W: Chinese Acad Sci, Inst Software, Parallel Comp Lab, Beijing 100080, Peoples R China
¯\O0W@W: Yao, JF, Chinese Acad Sci, Inst Software, Parallel Comp Lab, Beijing 100080, Peoples R China.
5uP[®±{0W@W: jifeng.yao@gmail.com
_(uvÂSe.spe: 3
«_!k: 0
úQHrFU: ISCI-INSTITUTE SCIENTIFIC COMPUTING & INFORMATION
úQHrFU0W@W: PO BOX 60632, UNIV ALBERTA POSTAL OUTLET,, EDMONTON, ALBERTA T6G 2G1, CANADA
ISSN: 1705-5105
29 W[&{vegnúQHrir
Tðy)Q: INT J NUMER ANAL MODEL
ISO egne.súQHrir
Tðy)Q: Int. J. Numer. Anal. Model.
egne.sux¡pe: 8
f[Ñy{|+R: Mathematics, Applied; Mathematics
ISI e.s O÷S: 091ZZ

--------------------------------------------------------------------------------
>f:y 22 agÿqQ 119 ag
\O: Li, MS
: Li, M; Boehm, B; Osterweil, LJ
h: Expanding the horizons of software development processes: A 3-D integrated methodology
egnúQHrir: UNIFYING THE SOFTWARE PROCESS SPECTRUM, 3840: 54-67 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Software Process Workshop (SPW 2005)
O®åeg: MAY 25-27, 2005
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Acad Sci, Inst Software.
Xd: This paper investigates how to define and improve software development processes. Based on examining the software development during last two decades, it proposes a breakthrough point of an updated view of requirements, called Great Requirements, and presents a 3-D integrated software engineering methodology for improving software development activities. It expands the horizons of possible future software development processes.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China; Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China
¯\O0W@W: Li, MS, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, 4 S 4th St, Beijing 100080, Peoples R China.
5uP[®±{0W@W: mingshu@iscas.ac.cn
_(uvÂSe.spe: 44
«_!k: 5
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-31112-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 14
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDV58

--------------------------------------------------------------------------------
>f:y 23 agÿqQ 119 ag
\O: Huang, M; Yang, LG; Yang, Y
: Li, M; Boehm, B; Osterweil, LJ
h: A development process for building OSS-based applications
egnúQHrir: UNIFYING THE SOFTWARE PROCESS SPECTRUM, 3840: 122-135 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Software Process Workshop (SPW 2005)
O®åeg: MAY 25-27, 2005
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Acad Sci, Inst Software.
KeyWords Plus: OPEN SOURCE SOFTWARE
Xd: It has become great prominence that business organizations are considering open source software (OSS) when looking for software system solutions. However, building applications based on open source software remains an essential issue for many software developers since the new development process differs from traditional in-house development. In this paper, we present a development process based on our experience on using open source software in application development. The new process emphasizes the early assessment to improve the architecture stability and project manageability by assessing available OSS. A set of measurable assessment criteria is established in assessing OSS candidates and making optimal decisions in the development process. A case study is discussed to show the application of this process.
0W@W: Chinese Acad Sci, Lab Internet Software Technol, Inst Software, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China; Univ So Calif, Ctr Software Engn, Los Angeles, CA 90089 USA
¯\O0W@W: Huang, M, Chinese Acad Sci, Lab Internet Software Technol, Inst Software, POB 8718, Beijing 100080, Peoples R China.
5uP[®±{0W@W: hm@itechs.iscas.ac.cn; yanglg@itechs.iscas.ac.cn; yangy@sunset.usc.edu
_(uvÂSe.spe: 25
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-31112-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 14
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDV58

--------------------------------------------------------------------------------
>f:y 24 agÿqQ 119 ag
\O: Chen, W; Ying, Q; Xue, YZ; Zhao, C
: Li, M; Boehm, B; Osterweil, LJ
h: Software testing process automation based on UTP - A case study
egnúQHrir: UNIFYING THE SOFTWARE PROCESS SPECTRUM, 3840: 222-234 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Software Process Workshop (SPW 2005)
O®åeg: MAY 25-27, 2005
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Acad Sci, Inst Software.
KeyWords Plus: TTCN-3
Xd: Automation of software testing process plays an important role in improving software quality, shortening period of development and reducing development cost. However, most existing testing automation methods tend to rely on various kinds of limited formal models, and make a contrived separation between software testing and other phases in software life cycle. This separation limits wide spread application of these methods. On the other hand, UML, as a unified modeling language that has been widely employed to describe and model software and software process, can provide good basis for testing automation to close the separation. In this paper we introduce an approach that transforms design models represented by UML to testing models represented by UTP (UML Testing Profile), and further more transforms the testing models to TTCN-3 (Test and Test Control Notation) test cases that can be executed on a TTCN-3 execution engine, according to TTCN-3 mapping interface defined in UTP. This approach integrates testing phase with other phases tightly together, and leads to automation or semi-automation of software testing process. Finally, the paper demonstrates the effectiveness of the proposed approach by deriving TTCN-3 test cases for a typical C/S software system.
0W@W: Chinese Acad Sci, Lab Internet Software Technol, Inst Software, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China
¯\O0W@W: Chen, W, Chinese Acad Sci, Lab Internet Software Technol, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: chenwei@itechs.iscas.ac.cn; yingqun@itechs.iscas.ac.cn; yunzhi@itechs.iscas.ac.cn; zhaochen@itechs.iscas.ac.cn
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-31112-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 13
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDV58

--------------------------------------------------------------------------------
>f:y 25 agÿqQ 119 ag
\O: Ding, LP; Yang, QS; Sun, L; Tong, J; Wang, YJ
: Li, M; Boehm, B; Osterweil, LJ
h: Evaluation of the capability of Personal Software Process based on data envelopment analysis
egnúQHrir: UNIFYING THE SOFTWARE PROCESS SPECTRUM, 3840: 235-248 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Software Process Workshop (SPW 2005)
O®åeg: MAY 25-27, 2005
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Acad Sci, Inst Software.
Xd: Personal Software Process (PSP) is a defined and measured software process designed to be used by an individual software engineer. For PSP users, it's important to evaluate the impact of the PSP upon their own personal capabilities of software development. However, the evaluation of capability of PSP is a Variable Return to Scale (VRS) and multivariate input and output problem, which makes traditional evaluation methods useless. In this paper, an evaluation framework for the capability of PSP based on Data Envelopment Analysis (DEA) is proposed. This framework has the advantage of dealing with VRS issues with multivariate input and output. In addition, the input or output variables of the framework can have different measurement units. Therefore, a quantitative and comprehensive result can be returned by this relative efficiency evaluation method and it can support the continuous improvement of PSP.
0W@W: Chinese Acad Sci, Lab Internet Software Technol, Inst Software, Beijing 100080, Peoples R China; Chinese Acad Sci, Key Lab Comp Sci, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China
¯\O0W@W: Ding, LP, Chinese Acad Sci, Lab Internet Software Technol, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: dingliping@itechs.iscas.ac.cn; qiusong_yang@itechs.iscas.ac.cn; sunliang@itechs.iscas.ac.cn; tongjie@itechs.iscas.ac.cn; ywang@itechs.iscas.ac.cn
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-31112-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 14
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDV58

--------------------------------------------------------------------------------
>f:y 26 agÿqQ 119 ag
\O: Wang, JZ; Meyers, S
: Li, M; Boehm, B; Osterweil, LJ
h: Spiral Pro: A project plan generation framework and support tool
egnúQHrir: UNIFYING THE SOFTWARE PROCESS SPECTRUM, 3840: 262-276 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Software Process Workshop (SPW 2005)
O®åeg: MAY 25-27, 2005
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Acad Sci, Inst Software.
Xd: Project planning is a delicate and on-going activity that requires a great deal of experience and knowledge. Several models and methods are developed which explore the various aspects of planning a project. In this paper, we propose a framework named Spiral Pro that integrates Spiral Model, MBASE and COCOMO II to help project managers do their project planning in a systematic way. In an empirical study, a project plan template, developed following the framework, was provided for thirteen e-service projects and a survey was used at the end to assess the study. Based on the survey, some characteristics are summarized, which help point out the effectiveness of using of Spiral Pro framework. Motivated by the findings in the study, a tool has been developed to help both experienced and inexperienced project managers make better use of the framework for project planning.
0W@W: Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China; Univ So Calif, Ctr Software Engn, Los Angeles, CA 90089 USA; Software Proc Grp, Los Angeles, CA 90018 USA
¯\O0W@W: Wang, JZ, Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China.
5uP[®±{0W@W: wangjizhe@itechs.iscas.ac.cn; stevem@cse.usc.edu
_(uvÂSe.spe: 20
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-31112-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 15
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDV58

--------------------------------------------------------------------------------
>f:y 27 agÿqQ 119 ag
\O: Wang, Q; Li, MS
: Li, M; Boehm, B; Osterweil, LJ
h: Software process management: Practices in China
egnúQHrir: UNIFYING THE SOFTWARE PROCESS SPECTRUM, 3840: 317-331 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Software Process Workshop (SPW 2005)
O®åeg: MAY 25-27, 2005
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Acad Sci, Inst Software.
Xd: Software process management has been proven a useful means to help software organizations improve their development processes and produce high quality products. It focuses on providing process-related products and services to software developer. Chinese software industry is developing rapidly. Effective software process methods, technology and tools that help them produce quality products while reducing the costs are in desperate need. This paper discusses the current state of project management in Chinese software companies and presents a solution and practices meeting this need.
0W@W: Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China; Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China
¯\O0W@W: Wang, Q, Chinese Acad Sci, Inst Software, Lab Internet Software Technol, 4 South 4th St,Zhong Guan Cun,POB 8718, Beijing 100080, Peoples R China.
5uP[®±{0W@W: wq@itechs.iscas.ac.cn; lms@admin.iscas.ac.cn
_(uvÂSe.spe: 14
«_!k: 5
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-31112-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 15
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDV58

--------------------------------------------------------------------------------
>f:y 28 agÿqQ 119 ag
\O: Wu, ZC; Christensen, D; Li, MS; Wang, Q
: Li, M; Boehm, B; Osterweil, LJ
h: Survey of CMM/CMMI implementation in China
egnúQHrir: UNIFYING THE SOFTWARE PROCESS SPECTRUM, 3840: 507-520 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Software Process Workshop (SPW 2005)
O®åeg: MAY 25-27, 2005
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Acad Sci, Inst Software.
Xd: Since 1999, the Chinese software industry has been using CMM/CMMI to improve software process. By November, 2004, more that 180 appraisals have been conducted. But the number of CMM/CMMI users is fairly low compared to the whole Chinese software industry. In addition, the growth rate of appraisal numbers has fallen during 2004. Limited research has been done to find out the obstacles for the wide-usage of CMM/CMMI in China. In this research, by investigating most of the organizations who have been appraised, reasons, success factors and benefits of CMM/CMMI implementation are identified, problems which negatively impact the CMM/CMMI usage are analyzed. Recommendations are made to the Chinese software industry and government to solve those problems, which could help those who want to or are using CMM/CMMI.
0W@W: Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China; One Market Ltd Co, Wellington, New Zealand; Chinese Acad Sci, Key Lab Comp Sci, Beijing 100080, Peoples R China
¯\O0W@W: Wu, ZC, Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China.
5uP[®±{0W@W: wzchun@itechs.iscas.ac.cn; david_c@onemarket.co.nz; mingshu@admin.iscas.ac.cn; wq@itechs.iscas.ac.cn
_(uvÂSe.spe: 18
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-31112-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 14
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDV58

--------------------------------------------------------------------------------
>f:y 29 agÿqQ 119 ag
\O: Gu, Y; Zhang, W; Liu, HC; Zhao, BH; Qu, YG
: Enokido, T; Yan, L; Xiao, B; Kim, D; Dai, Y; Yang, LT
h: Energy-efficient target localization based on a prediction model
egnúQHrir: EMBEDDED AND UBIQUITOUS COMPUTING - EUC 2005 WORKSHOPS, PROCEEDINGS, 3823: 1178-1190 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Embedded and Ubiquitous Computing
O®åeg: DEC 06-09, 2005
O®0W¹p: Nagasaki, JAPAN
O®^©RFU: Nagasaki Inst Appl Sci.; Int Federat Informat Proc.
\OsQ.Í: wireless sensor networks; energy-efficient; prediction model; TLS
Xd: In this paper, we propose an energy-efficient target localization scheme (TLS) based on a prediction model that can reveal the most likely zone the target will be in, and also a corresponding two-step communication protocol between base station (BS) and sensors. BS uses a query mechanism to determine which sensors should be used for detailed information according to a limited amount of data received from the sensors. This scheme reduces both energy consumption and communication bandwidth requirement, prolongs the lifetime of the wireless sensor networks. Simulation results indicate that it can achieve a high accuracy while saving a large amount of energy.
0W@W: Univ Sci & Technol China, Dept Comp Sci, Hefei 230027, Peoples R China; Chinese Acad Sci, Sci Inst Software, Comp Sci Lab, Beijing 100864, Peoples R China
¯\O0W@W: Gu, Y, Univ Sci & Technol China, Dept Comp Sci, Hefei 230027, Peoples R China.
5uP[®±{0W@W: guyu@mail.ustc.edu.cn; hcliu@mail.ustc.edu.cn; bhzhao@ustc.edu.cn; ygqu@ustc.edu.cn
_(uvÂSe.spe: 16
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-30803-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 13
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDW22

--------------------------------------------------------------------------------
>f:y 30 agÿqQ 119 ag
\O: Wang, P; Feng, DG; Wu, WL
: Feng, D; Lin, DD
fNM|\O: Yung, M
h: HCTR: A variable-input-length enciphering mode
egnúQHrir: INFORMATION SECURITY AND CRYPTOLOGY, PROCEEDINGS, 3822: 175-188 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st SKLOIS Conference on Information Security and Cryptology
O®åeg: DEC 15-17, 2005
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: State Key Lab Informat Secur, Chinese Acad Sci.
\OsQ.Í: blockcipher; tweakable blockcipher; disk sector encryption; modes of operation; symmetric encryption
KeyWords Plus: BLOCK CIPHERS
Xd: This paper proposes a blockcipher mode of operation, HCTR, which is a length-preserving encryption mode. HCTR turns an n-bit blockcipher into a tweakable blockcipher that supports arbitrary variable input length which is no less than n bits. The tweak length of HCTR is fixed and can be zero. We prove that HCTR is a strong tweakable pseudorandom permutation (sprp), when the underlying blockcipher is a strong pseudorandom permutation (sprp). HCTR is shown to be a very efficient mode of operation when some pre-computations are taken into consideration. Arbitrary variable input length brings much flexibility in various application environments. HCTR can be used in disk sector encryption, and other length-preserving encryptions, especially for the message that is not multiple of n bits.
0W@W: Chinese Acad Sci, Grad Sch, State Key Lab Informat Secur, Beijing 100049, Peoples R China; Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Wang, P, Chinese Acad Sci, Grad Sch, State Key Lab Informat Secur, Beijing 100049, Peoples R China.
5uP[®±{0W@W: w.rocking@gmail.com; feng@is.iscas.ac.cn; wwl@is.iscas.ac.cn
_(uvÂSe.spe: 27
«_!k: 15
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-30855-5
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 14
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDQ31

--------------------------------------------------------------------------------
>f:y 31 agÿqQ 119 ag
\O: Cao, TJ; Lin, DD
: Feng, D; Lin, DD
fNM|\O: Yung, M
h: Security analysis of some threshold signature schemes and multi-signature schemes
egnúQHrir: INFORMATION SECURITY AND CRYPTOLOGY, PROCEEDINGS, 3822: 233-241 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st SKLOIS Conference on Information Security and Cryptology
O®åeg: DEC 15-17, 2005
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: State Key Lab Informat Secur, Chinese Acad Sci.
Xd: Digital signature scheme allows a user to sign a message in such a way that anyone can verify the signature, but no one can forge the signature on any other message. In this paper, we show that Xie and Yu's threshold signature scheme, Huang and Chang's threshold proxy signature scheme, Qian, Cao and Xue's pairing-based threshold proxy signature scheme, Xue and Cao's multi-proxy signature scheme and Zhou et al.'s proxy multi-signature scheme are all insecure against the forgery attacks.
0W@W: China Univ Min & Technol, Sch Comp Sci & Technol, Xuzhou 221008, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Cao, TJ, China Univ Min & Technol, Sch Comp Sci & Technol, Xuzhou 221008, Peoples R China.
5uP[®±{0W@W: tjcao@cumt.edu.cn; ddlin@is.iscas.ac.cn
_(uvÂSe.spe: 14
«_!k: 2
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-30855-5
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDQ31

--------------------------------------------------------------------------------
>f:y 32 agÿqQ 119 ag
\O: Wen, FT; Wu, WL; Wen, QY
: Hao, Y; Liu, J; Wang, Y; Cheung, YM; Yin, H; Jiao, L; Ma, J; Jiao, YC
h: Error oracle attacks on several modes of operation
egnúQHrir: COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 2, PROCEEDINGS, 3802: 62-67 2005
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Computational Intelligence and Security
O®åeg: DEC 15-19, 2005
O®0W¹p: Xi'an, PEOPLES R CHINA
O®^©RFU: IEEE Computat Intelligence, Hong Kong Chapter.; Xidian Univ.; Hong Kong Baptist Univ.; Natl Nat Sci Fdn China.; Guangdong Univ Technol.
KeyWords Plus: ENCRYPTION
Xd: In [7] Vaudenay demonstrated side-channel attacks on CBC-mode encryption, exploiting a "valid padding" oracle. His work showed that several uses of CBC-mode encryption in well-known products and standards were vulnerable to attack when an adversary was able to distinguish between valid and invalid ciphertexts. In [2] [5] [6], Black, Paterson, Taekeon et al. generalized these attacks to various padding schemes of CBC-mode encryption and multiple modes of operation. In this paper, we study side-channel attacks on the CFB, CBC vertical bar CBC, CFB vertical bar CFB, CBC vertical bar CBC vertical bar CBC, CFB vertical bar CFB vertical bar CFB modes under the error oracle models, which enable an adversary to determine the correct message with knowledge of ciphertext. It is shown that an attacker can exploit an oracle to efficiently extract the corresponding position plaintext bits of any block if the target plaintext contains some fixed bits in a known position of one block.
0W@W: Beijing Univ Posts & Telecommun, Sch Sci, Beijing 100876, Peoples R China; Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China; Jinan Univ, Sch Sci, Jinan 250022, Peoples R China
¯\O0W@W: Wen, FT, Beijing Univ Posts & Telecommun, Sch Sci, Beijing 100876, Peoples R China.
5uP[®±{0W@W: wftwq@163.com; wwl@is.iscac.ac.cn; wqy@bupt.edu.cn
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-30819-9
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BDQ20

--------------------------------------------------------------------------------
>f:y 33 agÿqQ 119 ag
\O: Zhou, SJ; Lin, DD
: Hao, Y; Liu, J; Wang, Y; Cheung, YM; Yin, H; Jiao, L; Ma, J; Jiao, YC
h: On anonymity of group signatures
egnúQHrir: COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 2, PROCEEDINGS, 3802: 131-136 2005
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Computational Intelligence and Security
O®åeg: DEC 15-19, 2005
O®0W¹p: Xi'an, PEOPLES R CHINA
O®^©RFU: IEEE Computat Intelligence, Hong Kong Chapter.; Xidian Univ.; Hong Kong Baptist Univ.; Natl Nat Sci Fdn China.; Guangdong Univ Technol.
KeyWords Plus: FOUNDATIONS; ASSUMPTIONS; EFFICIENT; SCHEMES
Xd: A secure group signature is required to be anonymous, that is, given two group signatures generated by two different members on the same message or two group signatures generated by the same member on two different messages, they are indistinguishable except for the group manager. In this paper we prove the equivalence of a group signature's anonymity and its indistinguishability against chosen ciphertext attacks if we view a group signature as an encryption of member identity. Particularly, we prove ACJT's group signature is IND-CCA2 secure, so ACJT's scheme is anonymous in the strong sense. The result is an answer to an open question in literature.
0W@W: Chinese Acad Sci, SKLOIS Lab, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhou, SJ, Chinese Acad Sci, SKLOIS Lab, Inst Software, 4 S 4th St, Beijing 100080, Peoples R China.
5uP[®±{0W@W: zhousujing@is.iscas.ac.cn; ddlin@is.iscas.ac.cn
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-30819-9
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BDQ20

--------------------------------------------------------------------------------
>f:y 34 agÿqQ 119 ag
\O: Shen, JJ; Qing, SH; Shen, QN; Li, LP
: Hao, Y; Liu, J; Wang, Y; Cheung, YM; Yin, H; Jiao, L; Ma, J; Jiao, YC
h: Covert channel identification founded on information flow analysis
egnúQHrir: COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 2, PROCEEDINGS, 3802: 381-387 2005
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Computational Intelligence and Security
O®åeg: DEC 15-19, 2005
O®0W¹p: Xi'an, PEOPLES R CHINA
O®^©RFU: IEEE Computat Intelligence, Hong Kong Chapter.; Xidian Univ.; Hong Kong Baptist Univ.; Natl Nat Sci Fdn China.; Guangdong Univ Technol.
KeyWords Plus: STORAGE
Xd: This paper focuses on covert channel identification in a nondiscretionary secure system. The properties of covert channels are analyzed by channel types. Information flow characteristics are utilized to optimize channel identification with the Share Resource Matrix method adopted for demonstration, and a general framework for channel identification founded on information flow analysis is presented. At last, timing channels are also discussed.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Grad Univ, Chinese Acad Sci, Beijing 100080, Peoples R China
¯\O0W@W: Shen, JJ, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: weishen_cu@yahoo.com.cn
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-30819-9
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BDQ20

--------------------------------------------------------------------------------
>f:y 35 agÿqQ 119 ag
\O: Zheng, QH; Qian, YT
: Hao, Y; Liu, J; Wang, Y; Cheung, YM; Yin, H; Jiao, L; Ma, J; Jiao, YC
h: An event correlation approach based on the combination of IHU and codebook
egnúQHrir: COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 2, PROCEEDINGS, 3802: 757-763 2005
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Computational Intelligence and Security
O®åeg: DEC 15-19, 2005
O®0W¹p: Xi'an, PEOPLES R CHINA
O®^©RFU: IEEE Computat Intelligence, Hong Kong Chapter.; Xidian Univ.; Hong Kong Baptist Univ.; Natl Nat Sci Fdn China.; Guangdong Univ Technol.
KeyWords Plus: COMMUNICATION-NETWORKS; FAULT IDENTIFICATION
Xd: This paper proposes a new event correlation technique, which integrates the increment hypothesis updating (IHU) technique with the codebook approach. The technique allows multiple simultaneous independent faults to be identified when the system's codebook only includes the codes of the single fault and lacks the information of prior fault probability and the conditional probability of fault lead to symptoms occur. The method utilizes the refined IHU technique to create and update fault hypotheses that can explain these events, and ranks these hypotheses by the codebook approach. The result of event correlation is the hypothesis with maximum hamming distance to the code of the received events. Simulation shows that this approach can get a high accuracy and a fast speed of correlation even if the network has event loss and spuriousness.
0W@W: Zhejiang Univ, Computat Intelligence Res Lab, Coll Comp Sci, Hangzhou, Zjhejiang, Peoples R China; Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing, Peoples R China
¯\O0W@W: Zheng, QH, Zhejiang Univ, Computat Intelligence Res Lab, Coll Comp Sci, Hangzhou, Zjhejiang, Peoples R China.
5uP[®±{0W@W: zheng_qiuhua@163.com; ytqian@zju.edu.cn
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-30819-9
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BDQ20

--------------------------------------------------------------------------------
>f:y 36 agÿqQ 119 ag
\O: Liu, ZQ; Feng, DG
: Hao, Y; Liu, J; Wang, Y; Cheung, YM; Yin, H; Jiao, L; Ma, J; Jiao, YC
h: Incremental fuzzy decision tree-based network forensic system
egnúQHrir: COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 2, PROCEEDINGS, 3802: 995-1002 2005
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Computational Intelligence and Security
O®åeg: DEC 15-19, 2005
O®0W¹p: Xi'an, PEOPLES R CHINA
O®^©RFU: IEEE Computat Intelligence, Hong Kong Chapter.; Xidian Univ.; Hong Kong Baptist Univ.; Natl Nat Sci Fdn China.; Guangdong Univ Technol.
Xd: Network forensic plays an important role in the modern network environment for computer security, but it has become a time-consuming and daunting task due to the sheer amount of data involved. This paper proposes a new method for constructing incremental fuzzy decision trees based on network service type to reduce the human intervention and time-cost, and to improve the comprehensibility of the results. At the end of paper, we discuss the performance of the forensic system and present the result of experiments.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Liu, ZQ, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China.
5uP[®±{0W@W: liuzq@is.iscas.ac.cn; feng@is.iscas.ac.cn
_(uvÂSe.spe: 13
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-30819-9
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BDQ20

--------------------------------------------------------------------------------
>f:y 37 agÿqQ 119 ag
\O: Cao, TJ; Lin, DD; Xue, R
: Hao, Y; Liu, J; Wang, Y; Cheung, YM; Yin, H; Jiao, L; Ma, J; Jiao, YC
h: Universal designated-verifier proxy blind signatures for E-commerce
egnúQHrir: COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 2, PROCEEDINGS, 3802: 1036-1041 2005
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Computational Intelligence and Security
O®åeg: DEC 15-19, 2005
O®0W¹p: Xi'an, PEOPLES R CHINA
O®^©RFU: IEEE Computat Intelligence, Hong Kong Chapter.; Xidian Univ.; Hong Kong Baptist Univ.; Natl Nat Sci Fdn China.; Guangdong Univ Technol.
Xd: To protect the privacy of proxy blind signature holders from dissemination of signatures by verifiers, this paper introduces universal designated-verifier proxy blind signatures. In a universal designated-verifier proxy blind signature scheme, any holder of a proxy blind signature can convert the proxy blind signature into a designated-verifier signature. Given the designated-signature, only the designated-verifier can verify that the message was signed by the proxy signer, but is unable to convince anyone else of this fact. This paper also proposes an ID-based universal designated-verifier proxy blind signature scheme from bilinear group-pairs. The proposed scheme can be used in E-commerce to protect user privacy.
0W@W: China Univ Mining & Technol, Sch Comp Sci & Technol, Xuzhou 221008, Peoples R China; Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China
¯\O0W@W: Cao, TJ, China Univ Mining & Technol, Sch Comp Sci & Technol, Xuzhou 221008, Peoples R China.
5uP[®±{0W@W: tjcao@is.iscas.ac.cn; ddlin@is.iscas.ac.cn; rxue@is.iscas.ac.cn
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-30819-9
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BDQ20

--------------------------------------------------------------------------------
>f:y 38 agÿqQ 119 ag
\O: Luan, SM; Dai, GZ
fNM|\O: Hao, Y
h: A computational approach for belief change
egnúQHrir: COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 1, PROCEEDINGS, 3801: 355-360 2005
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Computational Intelligence and Security
O®åeg: DEC 15-19, 2005
O®0W¹p: Xian, PEOPLES R CHINA
O®^©RFU: IEEE Computat Intelligence, Hong Kong Chapter.; Xidian Univ.; Hong Kong Baptist Univ.; Natl Nat Sci Fdn China.; Guangdong Univ Technol.
KeyWords Plus: REVISION; LOGIC
Xd: In this paper, we combine the syntax-based belief change approach and model-based approach, and present a computational approach for belief change. We introduce functions to revise or contract a belief set, as well as functions to revise or contract a belief base. We also show properties of the revision functions and the contraction functions. The implementation of the revision functions and the contraction functions are also considered, and algorithms to revise a belief set or contract a sentence from a belief set are also given. Compared with related works, the main characteristic of our approach is that the functions can be implemented by algorithms.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Luan, SM, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
5uP[®±{0W@W: shangmin@iscas.cn
_(uvÂSe.spe: 17
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-30818-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BDQ19

--------------------------------------------------------------------------------
>f:y 39 agÿqQ 119 ag
\O: Jin, H; Wang, H; Wang, HG; Dai, GZ
fNM|\O: Hao, Y
h: Optimization design of controller periods using evolution strategy
egnúQHrir: COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 1, PROCEEDINGS, 3801: 1100-1105 2005
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Computational Intelligence and Security
O®åeg: DEC 15-19, 2005
O®0W¹p: Xi'an, PEOPLES R CHINA
O®^©RFU: IEEE Computat Intelligence, Hong Kong Chapter.; Xidian Univ.; Hong Kong Baptist Univ.; Natl Nat Sci Fdn China.; Guangdong Univ Technol.
Xd: For real-time computer-controlled systems, a control task does not have a fixed period but a range of periods in which control performance varies. Hence for multiple tasks scheduled on a single processor, to consider the optimization design of sampling periods in the co-design of control and scheduling is necessary to improve the control performance and use limited computing resource efficiently. In this paper, the mathematic description of the optimization problem of designing periods is presented, and the optimization solution using evolution strategy is proposed. The performances of proposed solution are revealed via simulation studies. Simulation shows that the optimization design of sampling periods can be implemented by using the evolution strategy method.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Jin, H, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: hjin@iel.iscas.ac.cn; hui.wang@iel.iscas.ac.cn; wha@iel.iscas.ac.cn; dgz@iel.iscas.ac.cn
_(uvÂSe.spe: 6
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-30818-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BDQ19

--------------------------------------------------------------------------------
>f:y 40 agÿqQ 119 ag
\O: Zhang, ZF; Liu, ML; Xiao, LL
: Roy, B
h: Parallel multi-party computation from linear multi-secret sharing schemes
egnúQHrir: ADVANCES IN CRYPTOLOGY ASIACRYPT 2005, 3788: 156-173 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 11th International Conference on the Theory and Application of Cryptology and Information Security
O®åeg: DEC 04-08, 2005
O®0W¹p: Chennai, INDIA
O®^©RFU: Int Assoc Cryptol Res.; Indian Inst Technol.
Xd: As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against an adversary with multistructures. Precisely, there are m functions f(1), ..., f(m) and m adversary structures A(1), ..., A(m), where f(i) is required to be securely computed against an A(i)-adversary. We give a general construction to build a parallel multi-party computation protocol from any linear multi-secret sharing scheme (LMSSS), provided that the access structures of the LMSSS allow MPC at all. When computing complicated functions, our protocol has more advantage in communication complexity than the "direct sum" method which actually executes a MPC protocol for each function. The paper also provides an efficient and generic construction to obtain from any LMSSS a multiplicative LMSSS for the same multi-access structure.
0W@W: Chinese Acad Sci, Key Lab Math Mechanizat, Acad Math & Syst Sci, Beijing 100080, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, ZF, Chinese Acad Sci, Key Lab Math Mechanizat, Acad Math & Syst Sci, Beijing 100080, Peoples R China.
5uP[®±{0W@W: zfz@amss.ac.cn; mlliu@amss.ac.cn; xllemail2004@yahoo.com.cn
_(uvÂSe.spe: 11
«_!k: 2
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-30684-6
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 18
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDQ24

--------------------------------------------------------------------------------
>f:y 41 agÿqQ 119 ag
\O: Zhang, Z; Che, HY; Shi, PF; Sun, Y; Gu, J
: Grumbach, S; Sui, L; Vianu, V
h: Schema homomorphism - An algebraic framework for schema matching
egnúQHrir: ADVANCES IN COMPUTER SCIENCE - ASIAN 2005, PROCEEDINGS - DATA MANAGEMENT ON THE WEB , 3818: 255-256 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 10th Asian Computing Science Conference
O®åeg: DEC 07-09, 2005
O®0W¹p: Kunming, PEOPLES R CHINA
O®^©RFU: AIT.; INRIA.; UNU/IIST.
Xd: A formal framework for SMP is important because it facilitates the building of algorithm model and the evaluation of algorithms. First, we propose a formal definition of schema matching that is named multivalent matching, i.e., an individual of source schema can be associated with a set of individuals of target schema. Second, we develop the algebraic framework of multivalent matching that is called schema homomorphism and propose the algorithm model of SMP. Then, we discuss the relations between match cardinality and variants of schema homomorphism.
0W@W: Shanghai Jiao Tong Univ, Inst Image Proc & Pattern Recognit, Shanghai 200030, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Hong Kong Univ Sci & Technol, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
¯\O0W@W: Zhang, Z, Shanghai Jiao Tong Univ, Inst Image Proc & Pattern Recognit, Shanghai 200030, Peoples R China.
5uP[®±{0W@W: zzh@sjtu.edu.cn; pfshi@sjtu.edu.cn
_(uvÂSe.spe: 4
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-30767-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 2
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDP59

--------------------------------------------------------------------------------
>f:y 42 agÿqQ 119 ag
\O: Zhang, ZF; Feng, DG; Xu, J; Zhou, YB
: Qing, S; Mao, W; Lopez, J; Wang, G
h: Efficient ID-based optimistic fair exchange with provable security
egnúQHrir: INFORMATION AND COMMUNICATIONS SECURITY, PROCEEDINGS, 3783: 14-26 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 7th International Conference on Information and Communications Security
O®åeg: DEC 10-13, 2005
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Acad SCi.; Int Commun & Informat Secur Assoc.
\OsQ.Í: fair exchange; identity-based signature; provable security
KeyWords Plus: DIGITAL-SIGNATURES; SCHEMES; PROTOCOL
Xd: The notion of identity based cryptosystem was introduced by Shamir in 1984, and has attracted much interest since it eliminates the need of certificates and simplify the key management. In this paper, we propose an optimistic fair exchange protocol for identity-based signatures, A semi-trust third party (TTP) is still involved in our protocol to ensure fairness. However, there is no need for registrations between users and TTP, and no zero-knowledge proof is needed to provide verifiability. The proposed optimistic fair exchange protocol is much concise and efficient, and can be shown to be secure in the random model with a tight security reduction.
0W@W: Chinese Acad Sci, State Key Lab Informat Secur, Beijing 100080, Peoples R China; Chinese Acad Sci, Inst Sofware, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China
¯\O0W@W: Zhang, ZF, Chinese Acad Sci, State Key Lab Informat Secur, Beijing 100080, Peoples R China.
5uP[®±{0W@W: zfzhang@is.iscas.ac.cn
_(uvÂSe.spe: 22
«_!k: 3
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-30934-9
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 13
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDQ16

--------------------------------------------------------------------------------
>f:y 43 agÿqQ 119 ag
\O: Xu, G; Ma, JG; Huang, T
: Zhuge, H; Fox, GC
h: A XML-based composition event approach as an integration and cooperation middleware
egnúQHrir: GRID AND COOPERATIVE COMPUTING - GCC 2005, PROCEEDINGS, 3795: 436-442 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Symposium on Trustworthy Global Computing
O®åeg: APR 07-09, 2005
O®0W¹p: Edinburgh, SCOTLAND
Xd: Content-based Pub/Sub systems are gaining increasing popularity as an integration and cooperation middleware supporting large-scale distributed applications, especially for Grid. However, existing content-based Pub/Sub systems mainly focus on the "one-to-one" event matching, not on the composite event matching. The composite event matching enables application components to express more interest in the occurrence of event composite patterns. In this paper, we present a XML-based composite event model that consists of the temporal logical model and the event composite pattern. Based on the composite event model, a subscription language (EXML-QL) is introduced by extending XML-QL to support the XML-based composite event computing. Finally, in terms of the peculiarities of the subscription language, a composite event matching process is presented and analyzed.
0W@W: Chinese Acad Sci, Technol Ctr Software Engn, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Xu, G, Chinese Acad Sci, Technol Ctr Software Engn, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: xugang@otcaix.iscas.ac.cn; mjg@otcaix.iscas.ac.cn; tao@otcaix.iscas.ac.cn
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-30510-6
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDQ17

--------------------------------------------------------------------------------
>f:y 44 agÿqQ 119 ag
\O: Xu, J; Zhang, ZF; Feng, DG
: Desmedt, YG; Wang, H; Mu, Y; Li, Y
h: ID-based aggregate signatures from bilinear pairings
egnúQHrir: CRYPTOLOGY AND NETWORK SECURITY, PROCEEDINGS, 3810: 110-119 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Conference on Cryptology and Network Security
O®åeg: DEC 14-16, 2005
O®0W¹p: Xiamen, PEOPLES R CHINA
O®^©RFU: Fujian Normal Univ.; Fujian Digital Certificate Author Co Ltd.; Int Assoc Cryptol Res.
\OsQ.Í: ID-based signatures; aggregate signatures; bilinear pairings
KeyWords Plus: CRYPTOSYSTEMS
Xd: Aggregate signature scheme was recently proposed by Boneh, Gentry, Lynn and Shacham, which presented a method for combining n signatures from n different signers on n different messages into one signature. In this paper, we propose an identity-based aggregate signature scheme based on the bilinear pairings. This enhances the efficiency of communication and signature verification process. We show that the security of our scheme is tightly related to the computational Diffie-Hellman assumption in the random oracle model.
0W@W: Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
5uP[®±{0W@W: xujing@is.iscas.ac.cn; zfzhang@is.iscas.ac.cn; feng@is.iscas.ac.cn
_(uvÂSe.spe: 16
«_!k: 4
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-30849-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDP94

--------------------------------------------------------------------------------
>f:y 45 agÿqQ 119 ag
\O: Zhang, ZF; Xu, J; Feng, DG
: Desmedt, YG; Wang, H; Mu, Y; Li, Y
h: Efficient identity-based protocol for fair certified e-mail delivery
egnúQHrir: CRYPTOLOGY AND NETWORK SECURITY, PROCEEDINGS, 3810: 200-210 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Conference on Cryptology and Network Security
O®åeg: DEC 14-16, 2005
O®0W¹p: Xiamen, PEOPLES R CHINA
O®^©RFU: Fujian Normal Univ.; Fujian Digital Certificate Author Co Ltd.; Int Assoc Cryptol Res.
\OsQ.Í: fair exchange; certified e-mail; security protocol; identity-based signature
KeyWords Plus: SIGNATURES; EXCHANGE
Xd: Certified e-mail delivery has become one of the basic requirement in performing business transactions over the Internet securely. How to construct efficient fair protocols for certified e-mail delivery is of great interest. The notion of identity based cryptosystem has attracted much interest since its introduction by Shamir in 1984, as it eliminates the need of certificates and simplifies the key management. In this paper, we propose a fair protocol for certified e-mail delivery based on identity-based signatures. A semi-trust third party (TTP) is involved in our protocol to ensure fairness, who does not need to store anything except its own private-key. There is no need for an additional registration between users and TTP. The proposed scheme is the first identity-based protocol with such a concise frame and is computation- and communication-efficient.
0W@W: Chinese Acad Sci, State Key Lab Informat Secur, Beijing 100080, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China
¯\O0W@W: Zhang, ZF, Chinese Acad Sci, State Key Lab Informat Secur, Beijing 100080, Peoples R China.
5uP[®±{0W@W: zfzhang@is.iscas.ac.cn
_(uvÂSe.spe: 24
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-30849-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 11
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDP94

--------------------------------------------------------------------------------
>f:y 46 agÿqQ 119 ag
\O: Wang, XC; Qin, YY; Tian, F; Dai, GZ
: Tao, J; Picard, RW
h: Scenario-based interactive intention understanding in pen-based user interfaces
egnúQHrir: AFFECTIVE COMPUTING AND INTELLIGENT INTERACTION, PROCEEDINGS, 3784: 828-835 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Conference on Affective Computing and Intelligent Interaction
O®åeg: OCT 22-24, 2005
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Nokia Ltd.; Siemens Ltd.; Int Speech Commun Assoc.; Natl Nat Sci Fdn China.; Chinese Assoc Automat.; China Soc Image & Graph.; China Comp Federat.; Natl High-Tech Res & Dev Program.
Xd: Interactive intention understanding is important for Penbased User Interface (PUI). Many works on this topic are reported, and focus on handwriting or sketching recognition algorithms at the lexical layer. But these algorithms cannot totally solve the problem of intention understanding and can not provide the pen-based softwaxe with high usability. Hence, a scenario-based interactive intention understanding framework is presented in this paper, and is used to simulate human cognitive mechanisms and cognitive habits. By providing the understanding environment supporting the framework, we can apply the framework to the practical PUI system. The evaluation of the Scientific Training Management System for the Chinese National Diving Team shows that the framework is effective in improving the usability and enhancing the intention understanding capacity of this system.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Wang, XC, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
5uP[®±{0W@W: xiaochun02@iscas.cn
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-29621-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDM83

--------------------------------------------------------------------------------
>f:y 47 agÿqQ 119 ag
\O: Feng, DG; Xiang, J
fNM|âVSO\O: IEEE Comp Soc
h: Experience on intrusion tolerance distributed systems
egnúQHrir: Proceedings of the 29th Annual International Computer Software and Applications Conference: 270-271 2005
NfNh: PROCEEDINGS - INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE
í: English
e.s{|W: Proceedings Paper
O®h: 29th Annual International Computer Software and Applications Conference
O®åeg: JUL 26-28, 2005
O®0W¹p: Edinburgh, SCOTLAND
O®^©RFU: IEEE Comp Soc.
Xd: Distributed systems today are very vulnerable to malicious attacks, either from insiders or outsiders. When an attacker controls a component of the system, he may steal some sensitive information, create some false information, or prevent legitimate users from using the system. An intrusion-tolerant distributed system is a system which is designed so that any intrusion into a part of the system will not endanger confidentiality, integrity and availability. This paper describes two such systems we are developing: an intrusion tolerance CA system and a survivable repository, which are highly resilient to both insider and outsider attacks that compromise one or more components.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Feng, DG, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 1
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 0730-3157
ISBN: 0-7695-2413-3
29 W[&{vegnúQHrir
Tðy)Q: P INT COMP SOFTW APPL CONF
egne.sux¡pe: 2
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BCW71

--------------------------------------------------------------------------------
>f:y 48 agÿqQ 119 ag
\O: Sun, JC; Yang, C
: Zhang, W; Chen, Z; Glowinski, R; Tong, W
h: On construction of difference schemes and finite elements over hexagon partitions
egnúQHrir: Current Trends in High Performance Computing and Its Applications, Proceedings: 123-134 2005
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on High Performance Computing and Its Applications
O®åeg: AUG 08-10, 2004
O®0W¹p: Shanghai, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; Inst Appl Phys & Computat Math.; Natl Nat Sci Fdn China.; Shanghai Comp Soc.; Shanghai Jiaotong Univ.; Shanghai Supercomp Ctr.; Shanghai Univ.; Shanghai Univ Dingtech Co Ltd.; Sybase China.; Xian Jiaotong Univ.
\OsQ.Í: numerical PDE; non-traditional partition; hexagon partition; 4-point difference scheme; hexagonal finite element
Xd: In this paper we proposed a so-called coupled 4-point difference scheme for Laplacian operator over hexagon partition. It is shown that the scheme has the same order accuracy to the usual 7-point scheme in 3-direction mesh and 5-point scheme in rectangle mesh, though the local truncation error only has first order accuracy. Several hexagonal finite elements, such as piecewise quadratic and cubic, rational functions, are also investigated. Some numerical tests are given.
0W@W: Chinese Acad Sci, Inst Software, Lab Parallel Comp, Beijing 100864, Peoples R China
¯\O0W@W: Sun, JC, Chinese Acad Sci, Inst Software, Lab Parallel Comp, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 6
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISBN: 3-540-25785-3
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCY06

--------------------------------------------------------------------------------
>f:y 49 agÿqQ 119 ag
\O: Cao, TJ; Lin, DD; Xue, R
: Shih, TK; Shibata, Y
h: An efficient ID-based deniable authentication protocol from pairings
egnúQHrir: 19th International Conference on Advanced Information Networking and Applications, Vol 1, Proceedings - AINA 2005 : 388-391 2005
í: English
e.s{|W: Proceedings Paper
O®h: 19th International Conference on Advanced Information Networking and Applications
O®åeg: MAR 28-30, 2005
O®0W¹p: Taipei, TAIWAN
O®^©RFU: IEEE Comp Soc Tech Comm Distributed Proc.; Tamkang Univ.; Asian Off Aerosp Res & Dev.; USA Asian Res Off.
KeyWords Plus: IDENTITY-BASED ENCRYPTION; SIGNATURE
Xd: Deniability is a privacy property that ensures protocol participants can later deny taking part in a particular protocol run. A deniable authentication protocol enables an intended receiver to identify the source of a given message, but not prove the identity of the sender to a third party even if the intended receiver is willing to reveal his secret-key. In this paper, we present an efficient ID-based deniable authentication protocol from pairings. The proposed protocol satisfies the correctness, authentication and deniability properties.
0W@W: Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Cao, TJ, Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 14
«_!k: 1
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2249-1
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Theory & Methods; Telecommunications
ISI e.s O÷S: BCI51

--------------------------------------------------------------------------------
>f:y 50 agÿqQ 119 ag
\O: Cao, TJ; Lin, DD; Xue, R
: Shih, TK; Shibata, Y
h: ID-based ring authenticated encryption
egnúQHrir: 19th International Conference on Advanced Information Networking and Applications, Vol 1, Proceedings - AINA 2005 : 591-596 2005
í: English
e.s{|W: Proceedings Paper
O®h: 19th International Conference on Advanced Information Networking and Applications
O®åeg: MAR 28-30, 2005
O®0W¹p: Taipei, TAIWAN
O®^©RFU: IEEE Comp Soc Tech Comm Distributed Proc.; Tamkang Univ.; Asian Off Aerosp Res & Dev.; USA Asian Res Off.
KeyWords Plus: SIGNATURE
Xd: Ring authenticated encryption has the following security requirements: semantic-security, recipient-designation, verification-dependence, verification-convertibility, recipient-ambiguity, recipient-verifiability, signer-ambiguity and signer-verfiability. Ring authenticated encryption can be used to enhance user privacy. In this paper, based on Boneh and Frankliny's ID-based encryption scheme and Zhang and Kim's ID-based ring signature scheme, we propose an ID-based ring authenticated encryption scheme. We also show that the proposed scheme satisfies the correctness property and all security requirements.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Cao, TJ, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2249-1
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Theory & Methods; Telecommunications
ISI e.s O÷S: BCI51

--------------------------------------------------------------------------------
>f:y 51 agÿqQ 119 ag
\O: Ji, JF; Wu, EH; Li, S; Liu, XH
: Guo, B; Pfister, H; Samaras, D
h: Dynamic LOD on GPU
egnúQHrir: Computer Graphics International 2005, Proceedings: 108-+ 2005
í: English
e.s{|W: Proceedings Paper
O®h: Computer Graphics International Conference (CGI 2005)
O®åeg: JUN 22-24, 2005
O®0W¹p: Stony Brook, NY
O®^©RFU: IEEE Comp Soc, VGTC.; ACM SIGGRAPH.
\OsQ.Í: LOD; GPU; texture atlas; quadtree
Xd: This paper presents a novel approach to implementing dynamic LOD on GPU. For our purpose, a quadtree structure is created based on seamless geometry image atlas, which is a 3D surface representation in parameter space by combining the features of geometry images and poly-cube maps. All the nodes in the quadtree are packed into the atlas textures. There are two rendering passes in our approach. In the first pass, the LOD selection is performed in the fragment shaders. The resultant buffer is taken as the input texture to the second rendering pass by vertex texturing, and thus the node culling and triangulation can be performed in the vertex shaders. Our LOD algorithm can generate adaptive meshes dynamically, and can be fully implemented on GPU. It improves the efficiency of LOD selection, and alleviates the computing load on CPU.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing, Peoples R China
¯\O0W@W: Ji, JF, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing, Peoples R China.
_(uvÂSe.spe: 22
«_!k: 5
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-9330-9
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BCR33

--------------------------------------------------------------------------------
>f:y 52 agÿqQ 119 ag
\O: Teng, DX; Wang, HG; Dai, GZ; Dong, XH
: Shen, W; James, A; Chao, KM; Younas, M; Lin, Z; Barthes, JP
h: A collaborative editing environment for 3D shape object
egnúQHrir: PROCEEDINGS OF THE NINTH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, VOLS 1 AND 2: 558-563 2005
NfNh: International Conference on Computer Supported Cooperative Work in Design
í: English
e.s{|W: Proceedings Paper
O®h: 9th International Conference on Computer Supported Cooperative Work in Design
O®åeg: MAY 24-26, 2005
O®0W¹p: Coventry, ENGLAND
O®^©RFU: Coventry Univ.; IEEE.; IEE.; British Comp Soc.
\OsQ.Í: collaborative editing; real time performance; real time performance; natural interaction
Xd: Innovation on 3D shape design relies on advanced product design theory and effective design tools. The requirements for design tools mainly include collaborative performance and natural performance of interaction. In this paper, a 3D collaborative editing environment based on interactive transaction log is put forward and moreover the system architecture is presented The collaborative mechanism is discussed and the collision detection of manipulation and application strategy during the course of multi-user concurrency editing is studied, the interactive gesture appropriate to 3D model and application methods are studied too. Finally a prototype system is built, which obtains satisfied result in practice.
0W@W: Chinese Acad Sci, Inst Software, Integrated Intelligence Engn Lab, Beijing, Peoples R China
¯\O0W@W: Teng, DX, Chinese Acad Sci, Inst Software, Integrated Intelligence Engn Lab, Beijing, Peoples R China.
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: COVENTRY UNIV
úQHrFU0W@W: SCHOOL MATHEMATICAL & INFORMATION SCIENCES, PRIORY STREET, CONVENTRY CV1 5FB, ENGLAND
ISBN: 1-84600-002-5
29 W[&{vegnúQHrir
Tðy)Q: INT CONF COMP SUPP COOP WORK
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Interdisciplinary Applications
ISI e.s O÷S: BCO78

--------------------------------------------------------------------------------
>f:y 53 agÿqQ 119 ag
\O: Li, HY; Sun, JC
: Zhang, W; Chen, Z; Glowinski, R; Tong, W
h: Fast Fourier transform on hexagons
egnúQHrir: Current Trends in High Performance Computing and Its Applications, Proceedings: 357-362 2005
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on High Performance Computing and Its Applications
O®åeg: AUG 08-10, 2004
O®0W¹p: Shanghai, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; Inst Appl Phys & Computat Math.; Natl Nat Sci Fdn China.; Shanghai Comp Soc.; Shanghai Jiaotong Univ.; Shanghai Supercomp Ctr.; Shanghai Univ.; Shanghai Univ Dingtech Co Ltd.; Sybase China.; Xian Jiaotong Univ.
\OsQ.Í: Fast Fourier transforms; algorithms; hexagon; non-tensor-product
KeyWords Plus: ALGORITHM; SIGNALS; SERIES
Xd: We propose fast algorithms for computing the discrete Fourier transforms on hexagon. These algorithms are easy to implement, they reduce the computation complexity from O(M-2) to 0 (M log M), where M is the total number of sampling points.
0W@W: Chinese Acad Sci, Lab Parallel Comp, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Li, HY, Chinese Acad Sci, Lab Parallel Comp, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISBN: 3-540-25785-3
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCY06

--------------------------------------------------------------------------------
>f:y 54 agÿqQ 119 ag
\O: Cao, JW
: Craig, A; Lai, CH; Pericleous, KA
h: A parallel preconditioning algorithm for numerical petroleum reservoir simulation
egnúQHrir: DCABES and ICPACE Joint Conference on Distributed Algorithms for Science and Engineering: 35-38 2005
í: English
e.s{|W: Proceedings Paper
O®h: Joint Meeting of the International Symposium on Distributed Computing and Applications to Business, Engineering and Science/International Conference on Parallel Algorithms and Computing Evironments
O®åeg: AUG 25-27, 2005
O®0W¹p: Greenwich, ENGLAND
O®;NR¹e: Univ Greenwich, Maritime Greenwich Campus
Xd: Solving large scale linear systems efficiently is important for a petroleum reservoir simulator; the keynote part is how to choose an effective parallel preconditioner. Properly choosing a good preconditioner has been beyond of pure algebraic filed, which should also include such components as physical background, geometry information and parallelism strategy etc. In this paper, we construct an integrated preconditioner which is based on large scale distributed parallel processing, and reservoir simulation oriented. It is made of a combination of several precondition components including AMG, relaxed ILU, additive Schwarz, row scaling, Watts correction, CRP-like (constraint residual precondition), block elimination, among others. During the construction of CRP-like precondition, restarted GMRES is used to solve the projected small linear system.
0W@W: Chinese Acad Sci, Inst Software, Parallel Comp Lab, Beijing 100080, Peoples R China
¯\O0W@W: Cao, JW, Chinese Acad Sci, Inst Software, Parallel Comp Lab, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: UNIV GREENWICH, SCH COMPUTING & MATHEMATICAL SCIENCES
úQHrFU0W@W: MARITIME GREENWICH CAMPUS, OLD ROYAL NAVAL COLLEGE, PARK ROW, LONDON, SE10 9LS, ENGLAND
ISBN: 1-904521-27-4
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Theory & Methods; Imaging Science & Photographic Technology
ISI e.s O÷S: BDA79

--------------------------------------------------------------------------------
>f:y 55 agÿqQ 119 ag
\O: Zhang, YQ
: Craig, A; Lai, CH; Pericleous, KA
h: Performance characteristics of Itanium2 and Opteron for numerical scientific computing: A common user's view
egnúQHrir: DCABES and ICPACE Joint Conference on Distributed Algorithms for Science and Engineering: 85-88 2005
í: English
e.s{|W: Proceedings Paper
O®h: Joint Meeting of the International Symposium on Distributed Computing and Applications to Business, Engineering and Science/International Conference on Parallel Algorithms and Computing Evironments
O®åeg: AUG 25-27, 2005
O®0W¹p: Greenwich, ENGLAND
O®;NR¹e: Univ Greenwich, Maritime Greenwich Campus
Xd: In this paper, we conducted performance comparison and analysis of two state-of-the-art 64 bits processors, Intel Itanium2 and AMD Opteron, using blocked DGEMM. We found out that in most cases, the Itanium2 processor has performance advantages over Opteron processor; however, it needs further improvement on its ability of dealing with non-contiguous memory accesses.
0W@W: Chinese Acad Sci, Inst Software, Lab Parallel Comp, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, YQ, Chinese Acad Sci, Inst Software, Lab Parallel Comp, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 3
«_!k: 0
úQHrFU: UNIV GREENWICH, SCH COMPUTING & MATHEMATICAL SCIENCES
úQHrFU0W@W: MARITIME GREENWICH CAMPUS, OLD ROYAL NAVAL COLLEGE, PARK ROW, LONDON, SE10 9LS, ENGLAND
ISBN: 1-904521-27-4
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Theory & Methods; Imaging Science & Photographic Technology
ISI e.s O÷S: BDA79

--------------------------------------------------------------------------------
>f:y 56 agÿqQ 119 ag
\O: Xiao, JC; Wang, Q
: Wei, D; Xie, Z; Wang, H; Shi, B
fNM|\O: Gu, N
h: Contract-driven cooperation development process for software outsourcing
egnúQHrir: Fifth International Conference on Computer and Information Technology - Proceedings: 1104-1108 2005
í: English
e.s{|W: Proceedings Paper
O®h: 5th International Conference on Computer and Information Technology
O®åeg: SEP 21-23, 2005
O®0W¹p: Shanghai, PEOPLES R CHINA
O®^©RFU: Fundan Univ, Dept Comp & Informat Technol, Sch Informat Sci & Engn.
Xd: Software outsourcing is a process in which part of the work is outsourced to the other organizations by contract. The contract, core of the process, forms the basis of cooperation work The content of the contract and cooperative mechanism determine whether the development can proceed successfully or if the software can meet the demand By analyzing the process of contract-driven outsourcing cooperation development, this paper points out that the cooperation according with the contract is the prerequisite and basis of cooperation process. The crux of the problem in software outsourcing is how to share the vision and how to achieve effective engagement. In addition, this paper depicts the major contents of the structured contract and, with the application of the token ring, provides us with a process of software outsourcing development. Furthermore, solutions are offered to solve the problems about authority control, contract-based development and inconsistency avoidance.
0W@W: Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China
¯\O0W@W: Xiao, JC, Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2432-X
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BDF38

--------------------------------------------------------------------------------
>f:y 57 agÿqQ 119 ag
\O: Xu, G; Xu, W; Huang, T
: Yang, YK
h: Extending OBDD graphs for composite event matching in content-based pub/sub systems
egnúQHrir: FOURTH ANNUAL ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE, PROCEEDINGS: 519-525 2005
í: English
e.s{|W: Proceedings Paper
O®h: 4th Annual International Conference on Computer and Information Science (ICIS 2005)
O®åeg: JUL 14-16, 2005
O®0W¹p: Jeju Isl, SOUTH KOREA
O®^©RFU: Korea Informat Proc Soc.; Int Assoc Comp & Informat Sci.; Inst Informat Technol Assessment.
Xd: Content-based publish/subscribe offers a convenient abstraction for the information producers and consumers, supporting a large-scale system design and evolution by integrating several distributed independent application systems. Its core problem is how to match events by predicates on the content of events. In this paper, we propose three matching models, extend the simple matching to the multi-semantic matching and introduce the temporal constraint variable. The multi-semantic matching allows using different operations in accordance with different semantics; the temporal constraint variable supports processing the discrete events in the temporal sequence. Then, we extend OBDD graphs into hierarchy coloured OBDD graphs and prove the equivalence of the transformation. At last, based on OBDD graphs the composite matching algorithm is presented and analysed. By experiments, we show the proposed algorithm is efficient.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Xu, G, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2296-3
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BCT97

--------------------------------------------------------------------------------
>f:y 58 agÿqQ 119 ag
\O: Chen, NJ; Wei, J; Yang, B; Wang, JL; Huang, T
fNM|âVSO\O: IEEE
h: A QoS-enable failure detection framework for ME application server
egnúQHrir: ISADS 2005: International Symposium on Autonomous Decentralized Systems,Proceedings: 542-546 2005
í: English
e.s{|W: Proceedings Paper
O®h: International Symposium on Autonomous Decentralized Systems (ISADS 2005)
O®åeg: APR 04-08, 2005
O®0W¹p: Chengdu, PEOPLES R CHINA
O®^©RFU: IEEE Comp Soc.; Inst Elect, Informat & Commun Engineers.; Informat Proc Soc Japan.; Soc Instrument & Control Engineers.; Chinese Acad Engn.; Chinese Assoc Artificial Intelligence.; Int Federat Informat Proc.; Int Federat Automat Control.; Object Management Grp.; SW Jiatotong Univ.; Sichuan Normal Univ.
Xd: As a basic reliability guarantee technology in distributed systems, failure detection provides the ability of timely detecting the liveliness of runtime systems. Effective Failure Detection is very important to J2EE application server (JAS), the leading middleware in Web computing environment, and it also needs to meet the requirements of reconfiguration, flexibility and adaptability. Based on the QoS (Quality of Service) specification of failure detector, this paper presents a QoS-enable failure detection framework for JAS, which satisfies the requirements of dynamically adjusting qualities and flexible integration of failure detectors. The work has been implemented in OnceAS application server that is developed by Institute Of Software, Chinese Academy of Sciences. The experiments show that the framework can provide good QoS of failure detection in JAS.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing, Peoples R China
¯\O0W@W: Chen, NJ, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing, Peoples R China.
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-8963-8
egne.sux¡pe: 5
f[Ñy{|+R: Automation & Control Systems; Computer Science, Artificial Intelligence; Computer Science, Theory & Methods; Telecommunications
ISI e.s O÷S: BCW67

--------------------------------------------------------------------------------
>f:y 59 agÿqQ 119 ag
\O: Ren, X; Cao, DL; Jin, BH
: Zhu, Q
h: An efficient StAX based XML parser
egnúQHrir: Proceedings of the 11th Joint International Computer Conference: 203-207 2005
í: English
e.s{|W: Proceedings Paper
O®h: 11th Joint International Computer Conference (JICC 2005)
O®åeg: NOV 10-12, 2005
O®0W¹p: Chongqing, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; Hong Kong Comp Soc.; Chongqing Informat Ind Bur.; Chongqing Univ.; Chongqing Univ Post & Telecommun.
\OsQ.Í: XML parser; StAX; performance optimization
Xd: StAX is presented by JCP JSR-173 specification which supports XML pull parsing and gives more parsing control to users. This paper describes the design of pushdown automaton model for XML syntax analysis and illustrates the implementation of StAX parser OnceStAXParser. After passing the rigorous XML conformance tests and StAX API conformance tests, OnceStAXParser is optimized from many aspects such as the implementation of pushdown automaton, arranged pre-allocation and lazy processing, appropriate encapsulation strategy, etc. The performance test results from XML Test suite show that the throughput of OnceStAXParser is 28% more than that of BEA StAX RI on the average.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Ren, X, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 1
úQHrFU: WORLD SCIENTIFIC PUBL CO PTE LTD
úQHrFU0W@W: PO BOX 128 FARRER RD, SINGAPORE 9128, SINGAPORE
ISBN: 981-256-532-9
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Software Engineering; Imaging Science & Photographic Technology; Telecommunications
ISI e.s O÷S: BDF35

--------------------------------------------------------------------------------
>f:y 60 agÿqQ 119 ag
\O: Zheng, YJ; Zhu, YL; Xue, JY
: Zhu, Q
h: Partially introducing formal methods in software evolution: A quality metrics driven approach
egnúQHrir: Proceedings of the 11th Joint International Computer Conference: 708-713 2005
í: English
e.s{|W: Proceedings Paper
O®h: 11th Joint International Computer Conference (JICC 2005)
O®åeg: NOV 10-12, 2005
O®0W¹p: Chongqing, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; Hong Kong Comp Soc.; Chongqing Informat Ind Bur.; Chongqing Univ.; Chongqing Univ Post & Telecommun.
\OsQ.Í: formal methods software evolution; quality metrics
Xd: Though contributing to the significant improvement of software quality, the application of formal methods is limited by rigorous constraints, especially in large systems. As an alternative, partially introducing formal methods avoids the high cost for entire projects. During software evolution, software quality metrics of the existing system can be useful heuristic criteria for selecting worthwhile parts for formal treatment. We first select extensive candidates with high failure rate or high complexity, and then eliminate those with low customer problems, minimal development or maintenance efforts, thereby get a subset of the system to which applying formal development techniques can be most likely payable. Case studies with three real-world systems are presented to illustrate our approach.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zheng, YJ, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: WORLD SCIENTIFIC PUBL CO PTE LTD
úQHrFU0W@W: PO BOX 128 FARRER RD, SINGAPORE 9128, SINGAPORE
ISBN: 981-256-532-9
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Software Engineering; Imaging Science & Photographic Technology; Telecommunications
ISI e.s O÷S: BDF35

--------------------------------------------------------------------------------
>f:y 61 agÿqQ 119 ag
\O: Tian, Y; Liu, JF; Qi, X
: Zhu, Q
h: Research on dynamic change in software process
egnúQHrir: Proceedings of the 11th Joint International Computer Conference: 742-747 2005
í: English
e.s{|W: Proceedings Paper
O®h: 11th Joint International Computer Conference (JICC 2005)
O®åeg: NOV 10-12, 2005
O®0W¹p: Chongqing, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; Hong Kong Comp Soc.; Chongqing Informat Ind Bur.; Chongqing Univ.; Chongqing Univ Post & Telecommun.
\OsQ.Í: software process; process change; dynamic change; exceptions cost
Xd: Process change extremely affects software quality and development efficiency, and process dynamic change realizes flexible enactment. Supporting dynamic change and flexibility is required when PSEE (Process-centered Software Engineering Environment) is employed. However, there are few researches on change management involved completed activities, which is regular in software process because of its iteration. In this paper, we consider change management in software process. Firstly we analyze reasons and corresponding strategies of dynamic change; then propose the criteria of "Correct Termination" to judge the rationality of software process dynamic change; finally, we analyze the cost of dynamic change and present a research prototype --- SPEFE, which supports process dynamic change.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Tian, Y, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: WORLD SCIENTIFIC PUBL CO PTE LTD
úQHrFU0W@W: PO BOX 128 FARRER RD, SINGAPORE 9128, SINGAPORE
ISBN: 981-256-532-9
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Software Engineering; Imaging Science & Photographic Technology; Telecommunications
ISI e.s O÷S: BDF35

--------------------------------------------------------------------------------
>f:y 62 agÿqQ 119 ag
\O: Wu, P
fNM|âVSO\O: IEEE Comp Soc
h: Iterative metamorphic testing
egnúQHrir: Proceedings of the 29th Annual International Computer Software and Applications Conference: 19-24 2005
NfNh: PROCEEDINGS - INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE
í: English
e.s{|W: Proceedings Paper
O®h: 29th Annual International Computer Software and Applications Conference
O®åeg: JUL 26-28, 2005
O®0W¹p: Edinburgh, SCOTLAND
O®^©RFU: IEEE Comp Soc.
Xd: An enhanced version of metamorphic testing, namely n-iterative metamorphic testing, is proposed to systematically exploit more information out of metamorphic tests by applying metamorphic relations in a chain style. A contrastive case study, conducted within an integrated testing environment West, shows that n-iterative metamorphic testing exceeds metamorphic testing and special case testing in terms of their fault detection capabilities. Another advantage of n-iterative metamorphic testing is its high efficiency in test case generation.
0W@W: Chinese Acad Sci, Grad Sch, Lab Comp Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Wu, P, Chinese Acad Sci, Grad Sch, Lab Comp Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 0730-3157
ISBN: 0-7695-2413-3
29 W[&{vegnúQHrir
Tðy)Q: P INT COMP SOFTW APPL CONF
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BCW71

--------------------------------------------------------------------------------
>f:y 63 agÿqQ 119 ag
\O: Deng, WJ; Lin, HM
fNM|âVSO\O: IEEE Comp Soc
h: Extended symbolic transition graphs with assignment
egnúQHrir: Proceedings of the 29th Annual International Computer Software and Applications Conference: 227-232 2005
NfNh: PROCEEDINGS - INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE
í: English
e.s{|W: Proceedings Paper
O®h: 29th Annual International Computer Software and Applications Conference
O®åeg: JUL 26-28, 2005
O®0W¹p: Edinburgh, SCOTLAND
O®^©RFU: IEEE Comp Soc.
\OsQ.Í: concurrent systems; process algebra; value-passing; symbolic transition graphs; verification; model checking; bisimulation checking
Xd: An extension of symbolic transition graphs with assignment is proposed which combines the advantages of both the assignment-before-action and the assignment after-action approaches: like the former it allows a simple set of rules to be designed for generating finite symbolic graphs from regular value-passing process descriptions; like the later it avoids creating multiple copies in the graph for a recursive process definition. Experiences show that, in most cases, considerable reductions in verification time and space can be achieved using the new approach.
0W@W: Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Deng, WJ, Chinese Acad Sci, Comp Sci Lab, Inst Software, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 0730-3157
ISBN: 0-7695-2413-3
29 W[&{vegnúQHrir
Tðy)Q: P INT COMP SOFTW APPL CONF
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BCW71

--------------------------------------------------------------------------------
>f:y 64 agÿqQ 119 ag
\O: Wu, P; Lin, HM
: Cai, KY; Ohnishi, A; Lau, MF
h: Model-based testing of concurrent programs with predicate sequencing constraints
egnúQHrir: QSIC 2005: FIFTH INTERNATIONAL CONFERENCE ON QUALITY SOFTWARE, PROCEEDINGS: 3-10 2005
í: English
e.s{|W: Proceedings Paper
O®h: 5th International Conference on Quality Software (QSIC 2005)
O®åeg: SEP 19-20, 2005
O®0W¹p: Melbourne, AUSTRALIA
Xd: A Predicate sequencing constraint logic (PSCL) is proposed to represent test purpose for testing of concurrent programs. The advantage of PSCL rests in its capability of expressing not only sequencing relationships among I/O events, but also data dependencies between event parameters. A PSCL-based symbolic test case generation method is also proposed to automatically derive symbolic test cases that incorporate given data dependency constraints as verdict conditions. The method works in a syntactic way without referring to concrete program states and the derived test cases allow for dynamic test data selection according to the response from the software under test. A case study shows the PSCL-based test case generation can achieve transition coverage with smaller number of test steps.
0W@W: Chinese Acad Sci, Grad Sch, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Wu, P, Chinese Acad Sci, Grad Sch, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 22
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2472-9
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BDJ04

--------------------------------------------------------------------------------
>f:y 65 agÿqQ 119 ag
\O: Liu, X; Wang, Q
: Cai, KY; Ohnishi, A; Lau, MF
h: Study on application of a quantitative evaluation approach for software architecture adaptability
egnúQHrir: QSIC 2005: Fifth International Conference on Quality Software, Proceedings: 265-272 2005
í: English
e.s{|W: Proceedings Paper
O®h: 5th International Conference on Quality Software (QSIC 2005)
O®åeg: SEP 19-20, 2005
O®0W¹p: Melbourne, AUSTRALIA
KeyWords Plus: SELF-ADAPTIVE SOFTWARE
Xd: Due to the rapid changes of business environment and changing technologies, adaptability and measurement of the degree to which software is adaptable are critical factors for survival of software systems. Software are often claimed to be adaptable, however there is no explicit and concrete definition of architecture adaptability. This paper first gives a definition of architecture adaptability, and then presents a metric and a quantitative evaluation approach to evaluate the architecture adaptability based on adaptability scenario profile and impact analysis. The purpose of this study is to provide a structural adaptability evaluation method to support architecture improving and decision making for choosing among candidate architectures.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Liu, X, Chinese Acad Sci, Inst Software, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2472-9
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BDJ04

--------------------------------------------------------------------------------
>f:y 66 agÿqQ 119 ag
\O: Duan, YC; Cheung, SC; Fu, XL; Gu, YQ
: Lee, R; Lee, KW; Malloy, B
h: A metamodel based model transformation approach
egnúQHrir: Third ACIS International Conference on Software Engineering Research, Managment and Applications, Proceedings: 184-191 2005
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Software Engineering Research, Management and Applications
O®åeg: AUG 11-13, 2005
O®0W¹p: Mt Pleasant, MI
O®;NR¹e: Cent Michigan Univ
Xd: The information transformation problem of model driven software development (MDSD) processes is gaining increasing attentions. In this paper, we present an indepth analysis of the major causes leading to the ambiguities of existing transformation. A metamodel based approach is then proposed to address these causes. A mechanism to generate transformation rules is devised based on a classification of the UML metamodel elements to be used in subsequent transformation processes. Some other critical issues relating to the generated transformation system are also discussed.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Duan, YC, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2297-1
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BCX73

--------------------------------------------------------------------------------
>f:y 67 agÿqQ 119 ag
\O: Deng, CZ; Wang, CQ; Wang, HG; Dai, GZ
: Shen, W; James, A; Chao, KM; Younas, M; Lin, Z; Barthes, JP
h: Applying distributed cognition to cooperative design
egnúQHrir: PROCEEDINGS OF THE NINTH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, VOLS 1 AND 2: 820-823 2005
NfNh: International Conference on Computer Supported Cooperative Work in Design
í: English
e.s{|W: Proceedings Paper
O®h: 9th International Conference on Computer Supported Cooperative Work in Design
O®åeg: MAY 24-26, 2005
O®0W¹p: Coventry, ENGLAND
O®^©RFU: Coventry Univ.; IEEE.; IEE.; British Comp Soc.
\OsQ.Í: distributed cognition; cooperative design; distributed cognition framework
Xd: Cooperative design is one of the most important subjects of the researches on CSCW. Distributed cognition is a useful theoretical framework applied to analyzing, designing, implementing, and evaluating cooperative design systems. In this paper, we construct a detailed distributed cognition framework, explain these terms in it, and implement a prototype of the cooperative design system, Smart Cooperative Design System (SCDS), based on the framework. In SCDS, the computer can infer not only local participant intent but also team intent by capturing information distributed external environment and individual historical interactions. Cooperative participants can learn the intent each other through information representation distributed over individuals and artifacts. In some extent, this avoids some collaborative Conflict.
0W@W: Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100864, Peoples R China
¯\O0W@W: Deng, CZ, Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 18
«_!k: 0
úQHrFU: COVENTRY UNIV
úQHrFU0W@W: SCHOOL MATHEMATICAL & INFORMATION SCIENCES, PRIORY STREET, CONVENTRY CV1 5FB, ENGLAND
ISBN: 1-84600-002-5
29 W[&{vegnúQHrir
Tðy)Q: INT CONF COMP SUPP COOP WORK
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Interdisciplinary Applications
ISI e.s O÷S: BCO78

--------------------------------------------------------------------------------
>f:y 68 agÿqQ 119 ag
\O: Xu, J; Zhang, ZF; Feng, DG
: Chen, G; Pan, Y; Guo, M; Lu, J
h: ID-based proxy signature using bilinear pairings
egnúQHrir: PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS - ISPA 2005 WORKSHOPS, 3759: 359-367 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: ISPA 2005 International Workshops AEPP, ASTED, BIOS, GCIC, IASD, MASN, SGCA and WISA
O®åeg: NOV 02-05, 2005
O®0W¹p: Nanjing, PEOPLES R CHINA
O®^©RFU: Nanjing Univ, State Key Lab Novel Software Technol.
\OsQ.Í: ID-based signatures; proxy signatures; bilinear pairings; provable security
Xd: Identity-based (ID-based) public key cryptosystem can be a good alternative for certificate-based public key setting, especially when efficient key management and moderate security are required. A proxy signature scheme permits an entity to delegate its signing rights to another entity. But to date, no ID-based proxy signature scheme with provable security has been proposed. In this paper, we formalize a notion of security for ID-based proxy signature schemes and propose a scheme based on the bilinear pairings. We show that the security of our scheme is tightly related to the computational Diffie-Hellman assumption in the random oracle model.
0W@W: Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
5uP[®±{0W@W: xujing@is.iscas.ac.cn; zfzhang@is.iscas.ac.cn; feng@is.iscas.ac.cn
_(uvÂSe.spe: 17
«_!k: 4
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-29770-7
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDJ16

--------------------------------------------------------------------------------
>f:y 69 agÿqQ 119 ag
\O: Zhang, ZF; Feng, DG
: Chen, G; Pan, Y; Guo, M; Lu, J
h: Efficient fair certified e-mail delivery based on RSA
egnúQHrir: PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS - ISPA 2005 WORKSHOPS, 3759: 368-377 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: ISPA 2005 International Workshops AEPP, ASTED, BIOS, GCIC, IASD, MASN, SGCA and WISA
O®åeg: NOV 02-05, 2005
O®0W¹p: Nanjing, PEOPLES R CHINA
O®^©RFU: Nanjing Univ, State Key Lab Novel Software Technol.
\OsQ.Í: fair exchange; RSA; e-mail; security protocol
KeyWords Plus: SIGNATURES; EXCHANGE
Xd: Certified e-mail delivery (CEMD) has become one of the basic requirement in performing business transactions over the Internet securely. How to construct fair protocols for certified e-mail delivery based on the RSA cryptosystem is of great interest.
Recently, Nenadic etc. proposed a novel RSA-based method for the verifiable and recoverable encrypted signature (VRES), anti utilized it to construct a security protocol for certified e-mail delivery, which are claimed to provide strong fairness to ensure that the recipient receives the e-mail if and only if the sender receives the receipt. However, as a building block, their RSA-based VRES is totally breakable. This papers shows that an adversary can generate a valid VRES which cannot be recovered by the designated TTP, and hence the proposed certified e-mail delivery protocol cannot guarantee the required fairness.
Based on probabilistic signatures, we proposed a novel fair CEMD protocol which works with the RSA cryptosystem and guarantees strong fairness. Moreover, there is no need for a registration phase between a party and TTP, and the proposed protocol is more computation and communication efficient.
0W@W: Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, ZF, Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: zfzhang@is.iscas.ac.cn
_(uvÂSe.spe: 17
«_!k: 3
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-29770-7
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDJ16

--------------------------------------------------------------------------------
>f:y 70 agÿqQ 119 ag
\O: Zhang, LW; Feng, DG
: Chen, G; Pan, Y; Guo, M; Lu, J
h: Intrusion tolerant CA scheme with cheaters detection ability
egnúQHrir: PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS - ISPA 2005 WORKSHOPS, 3759: 378-386 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: ISPA 2005 International Workshops AEPP, ASTED, BIOS, GCIC, IASD, MASN, SGCA and WISA
O®åeg: NOV 02-05, 2005
O®0W¹p: Nanjing, PEOPLES R CHINA
O®^©RFU: Nanjing Univ, State Key Lab Novel Software Technol.
\OsQ.Í: intrusion tolerance; threshold signature; CA; proactive
Xd: In this paper, we put forward a practical intrusion tolerant CA scheme with the ability of cheater detection. Compared to the scheme of ITTC's project[1], the scheme has built-in ability of detecting cheaters, and has ability to generate signature without specifying one group of servers in the serial mode. We also present shares proactive refresh protocol to prevent key shares from gradually exposed or corrupted. Our scheme can be changed from (t, n) scheme to (t, n + 1) scheme.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, LW, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China.
5uP[®±{0W@W: zlw@is.iscas.ac.cn
_(uvÂSe.spe: 10
«_!k: 2
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-29770-7
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDJ16

--------------------------------------------------------------------------------
>f:y 71 agÿqQ 119 ag
\O: Cong, LL; Jin, BH; Cao, DL; Cao, JN
: Pan, Y; Chen, D; Guo, M; Cao, JN; Dongarra, J
h: GCPM: A model for efficient call admission control in wireless cellular networks
egnúQHrir: PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, 3758: 945-954 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Parallel and Distributed Processing and Applications
O®åeg: NOV 02-05, 2005
O®0W¹p: Nanjing, PEOPLES R CHINA
O®^©RFU: Nanjing Univ, State Key Lab Novel Software Technol.
\OsQ.Í: call admission control; guard channel; guard channel prediction model (GCPM); quality of service (QoS); wireless/mobile cellular networks
Xd: Call Admission Control (CAC) is crucial for assuring the quality of service (QoS) of communication in wireless cellular networks. In this paper, we propose a model, called Guard Channel Prediction Model (GCPM), for efficient call admission control satisfying the QoS requirements. A predictive value of the appropriate number of guard channels can be calculated based on this model by using statistical properties of new and handoff call arrival rates and mean call residency time, as well as the total capacity of a specific cell. Simulation studies are carried out to evaluate the performance in comparison with an existing adaptive algorithm under variable traffic loads and mobility patterns. Simulation results show that our proposed GCPM, using the static and fractional Guard Channel policy to process both types of incoming calls based on the predictive values, has gained better QoS with less blocking probabilities of both types of calls and meanwhile, larger network utilizations.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing, Peoples R China; Hong Kong Polytech Univ, Dept Comp, Hong Kong, Hong Kong, Peoples R China
¯\O0W@W: Cong, LL, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
5uP[®±{0W@W: lanlan@otcaix.iscas.ac.cn; jbh@otcaix.iscas.ac.cn; caodl@otcaix.iscas.ac.cn; csjcao@comp.polyu.edu.hk
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-29769-3
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDJ13

--------------------------------------------------------------------------------
>f:y 72 agÿqQ 119 ag
\O: Wang, JF; Zhou, HX; Xu, FJ; Li, L
: Pan, Y; Chen, D; Guo, M; Cao, JN; Dongarra, J
h: Hyper-Erlang based model for network traffic approximation
egnúQHrir: PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, 3758: 1012-1023 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Parallel and Distributed Processing and Applications
O®åeg: NOV 02-05, 2005
O®0W¹p: Nanjing, PEOPLES R CHINA
O®^©RFU: Nanjing Univ, State Key Lab Novel Software Technol.
KeyWords Plus: TAIL DISTRIBUTIONS
Xd: The long-tailed distribution characterizes many properties of Internet traffic. The property is often modeled by Lognormal distribution, Weibull or Pareto distribution theoretically. However, it hinders us in traffic analysis and evaluation studies directly from these models due to their complex representations and theoretical properties. This paper proposes a Hyper-Erlang Model (Mixed Erlang distribution) for such long-tailed network traffic approximation. It fits network traffic with long-tailed characteristic into a mixed Erlang distribution directly to facilitate our further analysis. Compared with the well-known hyperexponential based method, the mixed Erlang model is more accurate in fitting the tail behavior and also computationally efficient.
0W@W: Chinese Acad Sci, Natl Key Lab Integrated Informat Syst Technol, Inst Software, Beijing 100080, Peoples R China; Chongqing Commun Inst, Chongqing 400035, Peoples R China
¯\O0W@W: Wang, JF, Chinese Acad Sci, Natl Key Lab Integrated Informat Syst Technol, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: mailwangjf@yahoo.com.cn
_(uvÂSe.spe: 19
«_!k: 2
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-29769-3
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDJ13

--------------------------------------------------------------------------------
>f:y 73 agÿqQ 119 ag
\O: Ding, XN; Zhang, X; Jin, BH; Huang, T
: Meersman, R; Tari, Z; Hacid, MS; Mylopoulos, J; Pernici, B; Babaoglu, O; Jacobsen, HA; Loyall, J; Kifer, M; Spaccapietra, S
h: A task-type aware transaction scheduling algorithm in J2EE
egnúQHrir: ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS 2005: COOPIS, DOA, AND ODBASE, PT 2, PROCEEDINGS, 3761: 1034-1045 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: OTM Confederated International Conference and Workshop
O®åeg: OCT 31-NOV 04, 2005
O®0W¹p: Agia Napa, CYPRUS
O®^©RFU: RMIT Univ.; Vrije Univ Brussels, Dept Comp Sci.; Interop.
Xd: A large number of J2EE applications use entity beans as their application persistence mechanism, while current J2EE scheduling to entity beans is still a simple First-Come First-Served (FCFS) policy, Due to this simple policy, the scheduling does not distinguish the key transactions from the trivial ones. A task-type aware scheduling algorithm should be adopted to provide better service for key transactions. However, some characteristics of ME middleware transaction processing, such as the absence of necessary scheduling information and the interactive executing model, made it impossible to apply the traditional priority-driven scheduling algorithms. This paper puts forward a scheduling algorithm named TMPBP, which offers a new dynamic priority assignment algorithm HRS that can recognize the key tasks at runtime heuristically. Additionally, TMPBP add some extra techniques to the traditional concurrency control policies according to the features of ME The algorithm is proven to be safe and will not produce starvation or priority inversion, The experimental evaluations indicated that TMPBP improves the Quality of Service (QoS) of key tasks effectively, especially when the server is under a heavy load.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing, Peoples R China
¯\O0W@W: Ding, XN, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
5uP[®±{0W@W: dxn@otcaix.iscas.ac.cn; zhangxin@otcaix.iscas.ac.cn; jbh@otcaix.iscas.ac.cn; tao@otcaix.iscas.ac.cn
_(uvÂSe.spe: 17
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-29738-3
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDJ18

--------------------------------------------------------------------------------
>f:y 74 agÿqQ 119 ag
\O: Wang, P; Feng, DG; Wu, WL
: Zhou, J; Lopez, J; Deng, RH; Bao, F
h: On the security of tweakable modes of operation: TBC and TAE
egnúQHrir: INFORMATION SECURITY, PROCEEDINGS, 3650: 274-287 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on Information Security
O®åeg: SEP 20-23, 2005
O®0W¹p: Singapore, SINGAPORE
O®^©RFU: Inst Infocomm Res.; Singapore Management Univ.
\OsQ.Í: blockcipher; tweakable blockcipher; modes of operation; symmetric encryption; authenticated encryption
KeyWords Plus: BLOCK-CIPHER
Xd: We investigate the security of two tweakable-blockcipher-based modes TBC and TAE proposed in [13]. Our results show that: (1) The TBC encryption mode, whether randomized or stateful, is secure in the sense of indistinguishability from random bits; (2) Theorem 3 in [13] is wrong. A simple counterexample against the authenticity of TAE is presented, which shows that the secure tweakable blockcipher against chosen plaintext attack is not sufficient for the security of the TAE mode.
0W@W: Chinese Acad Sci, State Key Lab Informat Secur, Grad Sch, Beijing 100049, Peoples R China; Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Wang, P, Chinese Acad Sci, State Key Lab Informat Secur, Grad Sch, Beijing 100049, Peoples R China.
5uP[®±{0W@W: wang_peng@mails.gscas.ac.cn; feng@is.iscas.ac.cn; wwl@is.iscas.ac.cn
_(uvÂSe.spe: 21
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-29001-X
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 14
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDI50

--------------------------------------------------------------------------------
>f:y 75 agÿqQ 119 ag
\O: Zhan, NJ; Majster-Cederbaum, M
: Wang, F
h: Deriving non-determinism from conjunction and disjunction
egnúQHrir: FORMAL TECHNIQUES FOR NETWORKED AND DISTRIBUTED SYSTEMS - FORTE 2005, 3731: 351-365 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 25th International Conference on Formal Techniques for Networked and Distributed Systems
O®åeg: OCT 02-05, 2005
O®0W¹p: Taipei, TAIWAN
O®^©RFU: IFIP Working Grp 6 1.
\OsQ.Í: non-determinism; synchronization tree logic; mu-calculus; process algebra
KeyWords Plus: PROPOSITIONAL MU-CALCULUS
Xd: In this paper, we show that the non-deterministic choice "+", which was proposed as a primitive operator in Synchronization Tree Logic (STL for short) can be defined essentially by conjunction and disjunction in the mu-calculus (mu M for short). This is obtained by extending the mu-calculus with the non-deterministic choice "+" (denoted by mu M+) and then showing that mu M+ can be translated into mu M. Furthermore, we also prove that STL can be encoded into mu M+ and therefore into mu M.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China; Univ Mannheim, Fak Math & Informat, Lehrstuhl Prakt Informat 2, D-68163 Mannheim, Germany
¯\O0W@W: Zhan, NJ, Chinese Acad Sci, Inst Software, Comp Sci Lab, S 4th St 4, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-29189-X
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 15
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDI24

--------------------------------------------------------------------------------
>f:y 76 agÿqQ 119 ag
\O: Li, YJ
: Wang, F
h: The inductive approach to strand space
egnúQHrir: FORMAL TECHNIQUES FOR NETWORKED AND DISTRIBUTED SYSTEMS - FORTE 2005, 3731: 547-552 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 25th International Conference on Formal Techniques for Networked and Distributed Systems
O®åeg: OCT 02-05, 2005
O®0W¹p: Taipei, TAIWAN
O®^©RFU: IFIP Working Grp 6 1.
Xd: Strand space is a promising technique developed by Guttman et al. from MITRE company, and it provides us an intuitive and clear framework to analyze security protocols, but its mechanics of the proof tend to be quite intricate and not necessarily easy to be formalized. In this paper, we combine the inductive approach with strand space. We introduce an inductive definition for bundles, and it not only provides us a constructive illustration for a bundle, but also introduces an effective and rigorous technique of rule induction to prove properties of bundles. Using this induction principle, we not only prove that a bundle is a casually well-founded graph, but also give a rigorous proof for results of authentication tests. Our result of authentication test extends Guttman's result to a more general case, and its proof is also much easier and clearer. As a trivial case study, we prove authentication properties of Needham-Schroeder-Lowe protocol. Our approach has been mechanized using Isabelle/HOL.
0W@W: Chinese Acad Sci, Key Lab Comp Sci, Beijing, Peoples R China; Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing, Peoples R China
¯\O0W@W: Li, YJ, Chinese Acad Sci, Key Lab Comp Sci, POB 8718, Beijing, Peoples R China.
5uP[®±{0W@W: lyj238@ios.ac.cn
_(uvÂSe.spe: 3
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-29189-X
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDI24

--------------------------------------------------------------------------------
>f:y 77 agÿqQ 119 ag
\O: Wu, P; Zhang, DM
: Wang, F
h: Compositional modelling and verification of IPv6 mobility
egnúQHrir: FORMAL TECHNIQUES FOR NETWORKED AND DISTRIBUTED SYSTEMS - FORTE 2005, 3731: 553-556 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 25th International Conference on Formal Techniques for Networked and Distributed Systems
O®åeg: OCT 02-05, 2005
O®0W¹p: Taipei, TAIWAN
O®^©RFU: IFIP Working Grp 6 1.
Xd: An enhanced compositional framework is presented for modelling network protocols with symbolic transition graphs. In the context of the modelling framework, a sufficient condition for deadlock freedom of network protocols, namely interoperability, is reconstructed in a more concise way with an advantage that it allows for symbolic verification without referring to protocol states. Furthermore, a case study with Mobile IPv6 illustrates the effectiveness of the improved modelling framework and also discloses some infrangibilities of Mobile IPv6 in the sense that it can not maintain the binding coherency all the time, which may result in unreachable or unstable routes.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Grad Sch, Beijing 100080, Peoples R China; Beijing Univ Posts & Telecommun, Sch Comp Sci & Technol, Beijing 100876, Peoples R China
¯\O0W@W: Wu, P, Chinese Acad Sci, Inst Software, Comp Sci Lab, Grad Sch, Beijing 100080, Peoples R China.
5uP[®±{0W@W: wp@ios.ac.cn; zhangdm@bupt.edu.cn
_(uvÂSe.spe: 5
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-29189-X
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDI24

--------------------------------------------------------------------------------
>f:y 78 agÿqQ 119 ag
\O: Zhan, NJ; Wu, JZ
: VanHung, D; Wirsing, M
h: Compositionality of fixpoint logic with chop
egnúQHrir: THEORETICAL ASPECTS OF COMPUTING - ICTAC 2005, 3722: 136-150 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Colloquium on Theoretical Aspects of Computing
O®åeg: OCT 17-21, 2005
O®0W¹p: Hanoi, VIETNAM
O®^©RFU: United Nations Univ, Int Inst Software Technol.; Vietnam Natl Univ.; Vietnam Acad Sci & Technol.
\OsQ.Í: FLC; compositionality; verification; bisimulation; characteristic formula; basic process algebra
KeyWords Plus: DIVERGENCE
Xd: Compositionality plays an important role in designing reactive systems as it allows one to compose/decompose a complex system from/to several simpler components. Generally speaking, it is hard to design a complex system in a logical frame in a compositional way because it is difficult to find a connection between the structure of a system to be developed and that of its specification given by the logic. In this paper, we investigate the compositionality of the Fixpoint Logic with Chop (FLC for short). To this end, we extend FLC with the nondeterministic choice "+" (FLC+ for the extension) and then establish a correspondence between the logic and the basic process algebra with deadlock and termination (abbreviated BPA(delta)(epsilon)). Subsequently, we show that the choice is definable in FLC.
As an application of the compositionality of FLC, an algorithm is given to construct characteristic formulae of BPA(delta)(epsilon) up to strong bisimulation directly from the syntax of processes in a compositional manner.
0W@W: Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100080, Peoples R China; Univ Mannheim, Lehrstuhl Prakt Informat 2, Fak Math & Informat, D-68163 Mannheim, Germany
¯\O0W@W: Zhan, NJ, Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 28
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-29107-5
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 15
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDG72

--------------------------------------------------------------------------------
>f:y 79 agÿqQ 119 ag
\O: Yan, RJ; Li, GY; Tang, ZS
: VanHung, D; Wirsing, M
h: Symbolic model checking of finite precision timed automata
egnúQHrir: THEORETICAL ASPECTS OF COMPUTING - ICTAC 2005, 3722: 272-287 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Colloquium on Theoretical Aspects of Computing
O®åeg: OCT 17-21, 2005
O®0W¹p: Hanoi, VIETNAM
O®^©RFU: United Nations Univ, Int Inst Software Technol.; Vietnam Natl Univ.; Vietnam Acad Sci & Technol.
\OsQ.Í: finite precision timed automata; model checking; symbolic methods
KeyWords Plus: VERIFICATION; ALGORITHMS
Xd: This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FPTAs only record the integer values of clock variables together with the order of their most recent resets. We provide constraints under which the reachability checking of a timed automaton can be reduced to that of the corresponding FPTA, and then present an algorithm for reachability analysis. Finally, the paper reports some preliminary experimental results, and analyzes the advantages and disadvantages of the new data structure.
0W@W: Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China
¯\O0W@W: Yan, RJ, Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: yrj@ios.ac.cn; ligy@ios.ac.cn
_(uvÂSe.spe: 25
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-29107-5
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 16
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDG72

--------------------------------------------------------------------------------
>f:y 80 agÿqQ 119 ag
\O: Sun, JC
: Hobbs, M; Goscinski, AM; Zhou, W
h: Multi-color difference schemes of Helmholtz equation and its parallel fast solver over 3-D dodecahedron partitions
egnúQHrir: DISTRIBUTED AND PARALLEL COMPUTING, 3719: 301-308 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 6th International Conference on Algorithms and Architectures for Parallel Processing
O®åeg: OCT 02-03, 2005
O®0W¹p: Melbourne, AUSTRALIA
O®^©RFU: Deakin Univ, Sch IT.; Martin Lack & Associates.; Deakin Univ, Fac Sci & Technol.; Natl ICT Australia.; Alexander Technol.
Xd: In this paper, the problem of partitioning parallel dodecahedrons in 3D is examined. Two schemes are introduced and their convergence rate discussed. A parallel fast solver was implemented and tested experimentally, with the performance results presented.
0W@W: Chinese Acad Sci, Inst Software, R&D Ctr Parallel Software, Beijing 100080, Peoples R China
¯\O0W@W: Sun, JC, Chinese Acad Sci, Inst Software, R&D Ctr Parallel Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: sun@mail.rdcps.ac.cn
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-29235-7
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDG70

--------------------------------------------------------------------------------
>f:y 81 agÿqQ 119 ag
\O: Zhang, Z; Che, HY; Shi, PF; Sun, Y; Gu, J
: Fan, W; Wu, Z; Yang, J
h: An algebraic framework for schema matching
egnúQHrir: ADVANCES IN WEB-AGE INFORMATION MANAGEMENT, PROCEEDINGS, 3739: 694-699 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 6th International Conference on Web -Age Informational Management
O®åeg: OCT 11-13, 2005
O®0W¹p: Hangzhou, PEOPLES R CHINA
O®^©RFU: DatabaseSoc China Comp Federat.; Natl Sci Fdn China.; Zhejiang Univ, Y C Tang Disciplinary Dev & Fund.; Oracle China.
Xd: It is well known that a formal framework for the schema matching problem (SMP) is important because it facilitates the building of algorithm model and the evaluation of algorithms. First, based on universal algebra, we propose a meta-meta structure for schema. This definition has a distinctive feature: it is able to describe any particular style of schemas, and transforms a schema and other matching information into a finite structure over specific signature. Then, we formulize SMP as a schema homomorphism problem, and prove that SMP is equivalent to finding a semantic homomorphism from one schema to another. These results lead to the main contribution of this paper: an algebraic framework for SMP. Thirdly, we show a classification of schema matching based on the algebraic framework.
0W@W: Shanghai Jiao Tong Univ, Inst Image Proc & Pattern Recognit, Shanghai 200030, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Hong Kong Univ Sci & Technol, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
¯\O0W@W: Zhang, Z, Shanghai Jiao Tong Univ, Inst Image Proc & Pattern Recognit, Shanghai 200030, Peoples R China.
5uP[®±{0W@W: zzh@sjtu.edu.cn; pfshi@sjtu.edu.cn
_(uvÂSe.spe: 13
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-29227-6
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDG49

--------------------------------------------------------------------------------
>f:y 82 agÿqQ 119 ag
\O: Li, SJ; Ou, WJ; Yu, JQ
: Fan, W; Wu, Z; Yang, J
h: Ontology-based HTML to XML conversion
egnúQHrir: ADVANCES IN WEB-AGE INFORMATION MANAGEMENT, PROCEEDINGS, 3739: 888-893 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 6th International Conference on Web -Age Informational Management
O®åeg: OCT 11-13, 2005
O®0W¹p: Hangzhou, PEOPLES R CHINA
O®^©RFU: DatabaseSoc China Comp Federat.; Natl Sci Fdn China.; Zhejiang Univ, Y C Tang Disciplinary Dev & Fund.; Oracle China.
KeyWords Plus: EXTRACTION
Xd: Current wrapper approaches break down in extracting data from differently structured and frequently changing Web pages. To tackle this challenge, this paper defines domain-specific ontology, captures the semantic hierarchy in Web pages automatically by exploiting both structural information and common formatting information, and recognizes and extracts data by using ontology-based semantic matching without relying on page-specific formatting. It is adaptive to differently structured and frequently changing Web pages for a domain of interest.
0W@W: Wuhan Univ, Sch Comp, Wuhan 430072, Peoples R China; Chinese Acad Sci, Lab Comp Sci, Inst Software, Beijing 100080, Peoples R China; Huazhong Univ Sci & Technol, Coll Comp Sci & Technol, Wuhan 430074, Peoples R China
¯\O0W@W: Li, SJ, Wuhan Univ, Sch Comp, Wuhan 430072, Peoples R China.
5uP[®±{0W@W: shjli@public.wh.hb.cn; ouwj1981@sohu.com; yjqinghust@126.com
_(uvÂSe.spe: 10
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-29227-6
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDG49

--------------------------------------------------------------------------------
>f:y 83 agÿqQ 119 ag
\O: Shen, YD; Yang, Q
: Kramer, S; Pfahringer, B
h: Deriving a stationary dynamic Bayesian network from a logic program with recursive loops
egnúQHrir: INDUCTIVE LOGIC PROGRAMMING, PROCEEDINGS, 3625: 330-347 2005
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: 15th International Conference on Inductive Logic Programming (ILP 2005)
O®åeg: AUG 10-13, 2005
O®0W¹p: Bonn, GERMANY
O®^©RFU: Gesell Informat.; Bioinformat Initiat Munich.; TU Munich.; PASCAL European Network Excellence.; Machine Learning Journal.
\OsQ.Í: probabilistic logic programming (PLP); the well-founded semantics; SLG-resolution; stationary dynamic Bayesian networks
KeyWords Plus: WELL-FOUNDED SEMANTICS; QUERIES
Xd: Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never stop. On the other hand, they generate cyclic influences, which are disallowed in Bayesian networks. Therefore, in existing PLP approaches logic programs with recursive loops are considered to be problematic and thus are excluded. In this paper, we propose an approach that makes use of recursive loops to build a stationary dynamic Bayesian network. Our work stems from an observation that recursive loops in a logic program imply a time sequence and thus can be used to model a stationary dynamic Bayesian network without using explicit time parameters. We introduce a Bayesian knowledge base with logic clauses of the form A f:y 84 agÿqQ 119 ag
\O: Liao, Y; Li, MS
: Wu, ZH; Chen, C; Guo, MY; Bu, JJ
h: A QoS-aware component-based middleware for pervasive computing
egnúQHrir: EMBEDDED SOFTWARE AND SYSTEMS, 3605: 229-235 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Conference on Embedded Software and Systems
O®åeg: DEC 09-10, 2004
O®0W¹p: Hangzhou, PEOPLES R CHINA
O®^©RFU: Zhejiang Univ.; Intel Corp.; China Putian Corp.; Hopen Software Engn Co Ltdq.; ZTE Corp.; Huawei Technologies Co Ltd.; CoreTekl Syst Inc.; China Mobile Software League.
Xd: In this paper, a QoS-aware component-based middleware for pervasive computing is given. The design rationale is to cope with many constraints of pervasive computing application including resource awareness, diversity, QoS-sensitive. To introduce how we achieve those system goals, we describe the details of this middleware including system architecture, service model, QoS model, algorithms of service setup, implementation, and experimentation.
0W@W: Chinese Acad Sci, Inst Software, Internet Software Technol Lab, Beijing 100080, Peoples R China
¯\O0W@W: Liao, Y, Chinese Acad Sci, Inst Software, Internet Software Technol Lab, Beijing 100080, Peoples R China.
5uP[®±{0W@W: liaoy@intec.iscas.ac.cn; mingshuli@intec.iscas.ac.cn
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-28128-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDE41

--------------------------------------------------------------------------------
>f:y 85 agÿqQ 119 ag
\O: Jia, ZP; Li, X
: Wu, ZH; Chen, C; Guo, MY; Bu, JJ
h: OPC-based architecture of Embedded Web Server
egnúQHrir: EMBEDDED SOFTWARE AND SYSTEMS, 3605: 362-367 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Conference on Embedded Software and Systems
O®åeg: DEC 09-10, 2004
O®0W¹p: Hangzhou, PEOPLES R CHINA
O®^©RFU: Zhejiang Univ.; Intel Corp.; China Putian Corp.; Hopen Software Engn Co Ltdq.; ZTE Corp.; Huawei Technologies Co Ltd.; CoreTekl Syst Inc.; China Mobile Software League.
Xd: This paper combines OPC (OLE for Process Control) standard to EWS (Embedded Web Server) in order to distribute an integrated service for accessing real-time and history data from control networks. A layer of OPC XML-DA (Data Access) service is added between web services interfaces and embedded operation system in OPC-EWS. Architecture of DCS (Distributed Control System) with OPC-EWS is described too. This OPC-EWS applies such technologies as OPC, Java and XML and links to Internet through TCP/IP. Therefore, accesses to all kinds of embedded devices and data share in the heterogeneous Internet/Intranet environment are implemented. At last real-time performance and security of OPC-EWS are analyzed. The experiments and application have demonstrated that the architecture has good performance and is feasible for real-time operation in DCS.
0W@W: Shandong Univ, Sch Comp Sci & Technol, Shandong 250061, Peoples R China; Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100080, Peoples R China
¯\O0W@W: Jia, ZP, Shandong Univ, Sch Comp Sci & Technol, Shandong 250061, Peoples R China.
5uP[®±{0W@W: zhipingj@sdu.edu.cn; lixin@mail.sdu.edu.cn
_(uvÂSe.spe: 4
«_!k: 3
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-28128-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDE41

--------------------------------------------------------------------------------
>f:y 86 agÿqQ 119 ag
\O: Ma, B; Zhang, Y; Shi, XG
: Wu, ZH; Chen, C; Guo, MY; Bu, JJ
h: Applying component-based meta-service in liquid operating system for pervasive computing
egnúQHrir: EMBEDDED SOFTWARE AND SYSTEMS, 3605: 406-411 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Conference on Embedded Software and Systems
O®åeg: DEC 09-10, 2004
O®0W¹p: Hangzhou, PEOPLES R CHINA
O®^©RFU: Zhejiang Univ.; Intel Corp.; China Putian Corp.; Hopen Software Engn Co Ltdq.; ZTE Corp.; Huawei Technologies Co Ltd.; CoreTekl Syst Inc.; China Mobile Software League.
Xd: Liquid meta-service, a component-based operating system layer, is intended to enable embedded operating system to support pervasive computing by meeting the requirements of being spontaneous and adaptive. This is accomplished through two key features: (1) configurable, component-based infrastructure services called meta-service, and (2) a meta-service components trading service, which provides selecting and configuring mechanism for meta-service components. In this paper, we discuss the design principle, component model, implementations of some meta-service, and analyze the performance impact of using meta-service in embedded operating system.
0W@W: Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing, Peoples R China
¯\O0W@W: Ma, B, Chinese Acad Sci, Inst Software, Lab Internet Software Technol, 4 S 4th St, Beijing, Peoples R China.
5uP[®±{0W@W: mabo@itechs.iscas.ac.cn; zhangyi@itechs.iscas.ac.cn; shi@itechs.iscas.ac.cn
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-28128-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDE41

--------------------------------------------------------------------------------
>f:y 87 agÿqQ 119 ag
\O: Cheng, W; Lin, HS; Sun, YF
: Khosla, R; Howlett, RJ; Jain, LC
h: An efficient schema matcing algorithm
egnúQHrir: KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 2, PROCEEDINGS, 3682: 972-978 2005
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: 9th International Conference on Knowledge-Based Intelligent Information and Engineering Systems
O®åeg: SEP 14-16, 2005
O®0W¹p: Melbourne, AUSTRALIA
O®;NR¹e: La Trobe Univ
Xd: Schema matching, the problem of finding semantic correspondences between elements of source and warehouse schemas, plays a key role in data warehousing. Currently, the mappings are largely determined manually by domain experts, thus a time-consuming process. In this paper, based on a multistrategy schema matching framework, we develop a linguistic matching algorithm using semantic distances between words to compute their semantic similarity, and propose a structural matching algorithm based on semantic similarity propagation. After describe our approach, we present experimental results on several real-world domains, and show that the algorithm discovers semantic mappings with a high degree of accuracy.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Cheng, W, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: chengwei@iscas.cn; heshui02@iscas.cn; yufang@iscas.cn
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-28895-3
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BDC78

--------------------------------------------------------------------------------
>f:y 88 agÿqQ 119 ag
\O: Cheng, W; Sun, YF
: Wang, L; Jin, Y
h: GSMA: A structural matching algorithm for schema matching in data warehousing
egnúQHrir: FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, PT 2, PROCEEDINGS, 3614: 408-411 Part 2 2005
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Conference on Fuzzy Systems and Knowledge Discovery
O®åeg: AUG 27-29, 2005
O®0W¹p: Changsha, PEOPLES R CHINA
O®^©RFU: Xiangtan Univ.; IEEE Circuits & Syst Soc.; IEEE Computat IntelligenceSoc.; IEEE Control Syst Soc.; Int Neural Network Soc.; European Neural Network Soc.; Chinese Assoc Artifiical Intelligence.; Japanese Neural Network Soc.; Int Fuzzy Syst Assoc.; Asia-Pacific Neural Network Assembly.; Fuzzy Math & Syst Assoc Chine.; Hunan Comp Federat.
Xd: Schema matching, the problem of finding semantic correspondences between elements of source and warehouse schemas, plays a key role in data warehousing. Currently, schema mapping is largely determined manually by domain experts, thus a labor-intensive process. In this paper, we propose a structural matching algorithm based on semantic similarity propagation. Experimental results on several real-world domains are presented, and show that the algorithm discovers semantic mappings with a high degree of accuracy.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Cheng, W, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: Chengwei@ios.cn; yufang@ios.cn
_(uvÂSe.spe: 8
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-28331-5
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BDA17

--------------------------------------------------------------------------------
>f:y 89 agÿqQ 119 ag
\O: Zheng, QH; Qian, YT; Yao, M
: Wang, L; Jin, Y
h: Non-deterministic event correlation based on C-F model
egnúQHrir: FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, PT 2, PROCEEDINGS, 3614: 1107-1117 Part 2 2005
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Conference on Fuzzy Systems and Knowledge Discovery
O®åeg: AUG 27-29, 2005
O®0W¹p: Changsha, PEOPLES R CHINA
O®^©RFU: Xiangtan Univ.; IEEE Circuits & Syst Soc.; IEEE Computat IntelligenceSoc.; IEEE Control Syst Soc.; Int Neural Network Soc.; European Neural Network Soc.; Chinese Assoc Artifiical Intelligence.; Japanese Neural Network Soc.; Int Fuzzy Syst Assoc.; Asia-Pacific Neural Network Assembly.; Fuzzy Math & Syst Assoc Chine.; Hunan Comp Federat.
KeyWords Plus: FAULT IDENTIFICATION; COMMUNICATION-NETWORKS
Xd: This paper proposes a non-deterministic event correlation technique for diagnosis problem of end-to-end service in network, which uses an event - fault model based on path domain of events. The technique utilizes a refined heuristic approach to create and update fault hypotheses that can explain these events received by system, and computes these hypotheses' belief by C-F model method. The result of event correlation is the hypothesis with maximum belief. Simulation shows this approach can get a high accuracy even in the case of low observability events ratio.
0W@W: Zhejiang Univ, Computat Intelligence Res Lab, Coll Comp Sci, Hangzhou, Zhejiang, Peoples R China; Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Zheng, QH, Zhejiang Univ, Computat Intelligence Res Lab, Coll Comp Sci, Hangzhou, Zhejiang, Peoples R China.
5uP[®±{0W@W: zheng_qiuhua@163.com; ytqian@zju.edu.cn
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-28331-5
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 11
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BDA17

--------------------------------------------------------------------------------
>f:y 90 agÿqQ 119 ag
\O: Jin, H; Wang, HG; Wang, H; Wang, DL
: Wang, L; Jin, Y
h: Scheduling design of controllers with fuzzy deadline
egnúQHrir: FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, PT 1, PROCEEDINGS, 3613: 861-864 2005
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Conference on Fuzzy Systems and Knowledge Discovery
O®åeg: AUG 27-29, 2005
O®0W¹p: Changsha, PEOPLES R CHINA
O®^©RFU: Xiangtan Univ.; IEEE Circuits & Syst Soc.; IEEE Computat IntelligenceSoc.; IEEE Control Syst Soc.; Int Neural Network Soc.; European Neural Network Soc.; Chinese Assoc Artifiical Intelligence.; Japanese Neural Network Soc.; Int Fuzzy Syst Assoc.; Asia-Pacific Neural Network Assembly.; Fuzzy Math & Syst Assoc Chine.; Hunan Comp Federat.
Xd: Because some timing-constraints of a controller task may be not determined as a real-time system engineer thinks of, its scheduling with uncertain attributes can not be usually and simply dealt with according to classic manners used in real-time systems. The model of a controller task with fuzzy deadline and its scheduling are studied. The dedication concept and the scheduling policy of largest dedication first are proposed first. Simulation shows that the scheduling of controller tasks with fuzzy deadline can be implemented by using the proposed method, whilst the control performance coat gets guaranteed.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Jin, H, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: hjin@iel.iscas.ac.cn; wha@iel.iscas.ac.cn; hui.wang@iel.iscas.ac.cn; dlwang@iel.iscas.ac.cn
_(uvÂSe.spe: 6
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-28312-9
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BDA15

--------------------------------------------------------------------------------
>f:y 91 agÿqQ 119 ag
\O: Sun, LM; Yan, TX; Bi, YZ; Zhu, HS
: Huang, DS; Zhang, XP; Huang, GB
h: A self-adaptive energy-aware data gathering mechanism for wireless sensor networks
egnúQHrir: ADVANCES IN INTELLIGENT COMPUTING, PT 2, PROCEEDINGS, 3645: 588-597 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Intelligent Computing
O®åeg: AUG 23-26, 2005
O®0W¹p: Hefei, PEOPLES R CHINA
O®^©RFU: Inst Intelligent Machines.; Univ Sci Technol.; IEEE Computat Intelligence Soc.; Hong Kong Computat Intelligence Chapter.
Xd: Sensor networks are composed of a large number of densely deployed sensors. The sensor nodes are self-organized and form an ad hoc network. As the energy supply to sensor nodes is limited and cannot be replenished, energy efficiency is an important design consideration for sensor networks. We design and evaluate an energy efficient routing algorithm for data querying sensor networks that propagates routing instructions and build data paths by considering both the hop count to the sink node and the minimum residual energy of that path. The proposed Dynamic Energy Aware Routing (DEAR) algorithm can effectively choose a data path with low energy consumption and high residual energy. The simulation results show that DEAR can prolong the lifetime of networks compared with Directed Diffusion, Minimum Transmission Energy routing and Energy Aware Routing.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Sun, LM, Chinese Acad Sci, Inst Software, POB 8718, Beijing 100080, Peoples R China.
5uP[®±{0W@W: sunlimin@ios.cn; tingxin03@ios.cn; yanzhong02@ios.cn; hongsong@ios.cn
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-28227-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDC10

--------------------------------------------------------------------------------
>f:y 92 agÿqQ 119 ag
\O: Liu, YQ; Zhu, HB; Liu, XH; Wu, EH
h: Real-time simulation of physically based on-surface flow
egnúQHrir: VISUAL COMPUTER, 21 (8-10): 727-734 Sp. Iss. SI SEP 2005
í: English
e.s{|W: Proceedings Paper
O®h: 13th Pacific Conference on Computer Graphics and Applications
O®åeg: OCT 12-14, 2005
O®0W¹p: Macao, PEOPLES R CHINA
\OsQ.Í: on-surface flow; Navier-Stokes equations; wetting; real time
Xd: Although many papers have been published in the field of fluid simulation, little attention has been paid to on-surface flow involving wetting and stain transportation as well as erosion and deposition phenomena. In this paper, we introduce nonzero divergence in the mass equation of Navier-Stokes equations to simulate water penetration from on-surface flow into substrate material. Also, the volume of fluid method is adopted to track the free surface. With a computation of the actual amount of absorbed water we render the wetting effects with fully dry and fully wet texture images simultaneously. Using our model, the on-surface flow that accompanies water absorption can be simulated realistically in real time with OpenGL preview rendering. Experimental results illustrate that our model can be widely applied to solve various problems related to on-surface flow.
0W@W: Univ Macau, Fac Sci & Technol, Dept Comp & Informat Sci, Macao, Peoples R China; Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100864, Peoples R China
¯\O0W@W: Liu, YQ, Univ Macau, Fac Sci & Technol, Dept Comp & Informat Sci, Macao, Peoples R China.
5uP[®±{0W@W: lyq@ios.ac.cn; zhuhb@ios.ac.cn; lxh@ios.ac.cn; ehwu@umac.mo
_(uvÂSe.spe: 16
«_!k: 8
úQHrFU: SPRINGER
úQHrFU0W@W: 233 SPRING STREET, NEW YORK, NY 10013 USA
ISSN: 0178-2789
DOI: 10.1007/s00371-005-0314-2
29 W[&{vegnúQHrir
Tðy)Q: VISUAL COMPUT
ISO egne.súQHrir
Tðy)Q: Visual Comput.
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: 964CX

--------------------------------------------------------------------------------
>f:y 93 agÿqQ 119 ag
\O: He, Y; Zhang, Y; Guo, J
: Lu, X; Zhao, W
h: On mitigating network partitioning in peer-to-peer massively multiplayer games
egnúQHrir: NETWORKING AND MOBILE COMPUTING, PROCEEDINGS, 3619: 481-490 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Computer Networks and Mobile Computing (ICCNMC 2005)
O®åeg: AUG 02-04, 2005
O®0W¹p: Zhangjiajie, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; IEEE Comp Soc Beijing Chapter.; Hunan Comp Soc.; IEEE TC Distributed Proc.
Xd: Recently, peer-to-peer infrastructure has been proposed to support massively multiplayer games in the literature. However, when underlying network partitions due to network outages, the game world will partition into several parallel game worlds and it is difficult and costly to merge them when the network partitions disappear. Existing approaches resort to a centralized server to arbitrate. Aiming at mitigating the effects brought by network partitions, we propose a fully distributed algorithm based on state-stack matching. Our theoretical analysis and numerical results show that our approach can resolve the merging issue at the least loss of game states with high probability.
0W@W: Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China; Univ Toronto, Dept Elect & Comp Engn, Toronto, ON, Canada
¯\O0W@W: He, Y, Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China.
5uP[®±{0W@W: heyuan@itechs.iscas.ac.cn; zhangyi@itechs.iscas.ac.cn; jguo@eecg.toronto.edu
_(uvÂSe.spe: 5
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-28102-9
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCT45

--------------------------------------------------------------------------------
>f:y 94 agÿqQ 119 ag
\O: Yan, TX; Bi, YZ; Sun, LM; Zhu, HS
: Lu, X; Zhao, W
h: Probability based dynamic load-balancing tree algorithm for wireless sensor networks
egnúQHrir: NETWORKING AND MOBILE COMPUTING, PROCEEDINGS, 3619: 682-691 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Computer Networks and Mobile Computing (ICCNMC 2005)
O®åeg: AUG 02-04, 2005
O®0W¹p: Zhangjiajie, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; IEEE Comp Soc Beijing Chapter.; Hunan Comp Soc.; IEEE TC Distributed Proc.
Xd: Load balance can reduce hot spots, maintain network connectivity and prolong lifetime of wireless sensor networks. In large scale and randomly deployed wireless sensor networks, the energy consumption is sharply uneven among sensor nodes. We propose a new routing mechanism to achieve load balance through constructing a dynamic load-balancing tree (DLBT) in wireless sensor networks. The DLBT structure is a tree-like topology with a critical character that one node may have more than one candidates of parent node. DLBT achieves load balance by adjusting the forwarding probability to each parent candidate according to its traffic burden. We also provide a distributed algorithm to construct and maintain the DLBT structure. Simulation results show that our DLBT routing provides much higher load balance than the shortest path tree mechanism.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Yan, TX, Chinese Acad Sci, Inst Software, POB 8718, Beijing 100080, Peoples R China.
5uP[®±{0W@W: tingxin03@ios.cn; yanzhong02@ios.cn; sunlimin@ios.cn; hongsong@ios.cn
_(uvÂSe.spe: 13
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-28102-9
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCT45

--------------------------------------------------------------------------------
>f:y 95 agÿqQ 119 ag
\O: Zhou, H; Wang, YJ; Wang, Q
: Lu, X; Zhao, W
h: Measuring Internet bottlenecks: Location, capacity, and available bandwidth
egnúQHrir: NETWORKING AND MOBILE COMPUTING, PROCEEDINGS, 3619: 1052-1062 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Computer Networks and Mobile Computing (ICCNMC 2005)
O®åeg: AUG 02-04, 2005
O®0W¹p: Zhangjiajie, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; IEEE Comp Soc Beijing Chapter.; Hunan Comp Soc.; IEEE TC Distributed Proc.
KeyWords Plus: DYNAMICS
Xd: The ability to measure the location, capacity and available bandwidth of bottleneck in end-to-end network path is of major importance in congestion control, streaming applications, quality-of-service, overlay network and traffic engineering. Existing algorithms either fail to measure 0 the three bottleneck properties, or generate a large amount of probing packets. In addition, they often require deployment in both end hosts. A novel technique, called BNeck, is presented in this paper. It allows end users to efficiently and accurately measure the three bottleneck properties. The key idea of BNeck is that the per-link dispersion of probing packet train can be applied to measure the properties of congested links. The accuracy and efficiency of BNeck have been verified with elaborately designed simulation. The simulation result indicates that various applications can adopt BNeck to probe for the three bottleneck properties without loss of performance.
0W@W: Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China; Chinese Acad Sci, Inst Software, Key Lab Comp Sci, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China
¯\O0W@W: Zhou, H, Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China.
5uP[®±{0W@W: hzhou@itechs.iscas.ac.cn; ywang@itechs.iscas.ac.cn; wq@itechs.iscas.ac.cn
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-28102-9
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 11
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCT45

--------------------------------------------------------------------------------
>f:y 96 agÿqQ 119 ag
\O: Wu, FG; Sun, FC; Sun, ZQ; Zheng, CW
h: A neuro-fuzzy controller for networked control systems via a discrete-time jump fuzzy system approach
egnúQHrir: DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 1: 417-421 Sp. Iss. SI 2005
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Conference on Engineering Applications and Computational Algorithms
O®åeg: JUL 27-29, 2005
O®0W¹p: Guelph, CANADA
O®^©RFU: DCDIS.
O®;NR¹e: Univ Guelph
KeyWords Plus: OUTPUT-FEEDBACK CONTROL; H-INFINITY-CONTROL; LINEAR-SYSTEMS; NONLINEAR-SYSTEMS; CONTROL DESIGN; LMI APPROACH; STABILITY; STABILIZABILITY; PARAMETERS
Xd: The network delay and packets dropout in the networked control systems (NCSs) can degrade the system performance or stability. Aiming at the stochastic but bounded delay and packets dropout in the NCSs, the discrete-time jump fuzzy system is proposed, which implements the modeling of the networked control system with stochastic but bounded delay and packets dropout. Based on this model, a neuro-fuzzy controller is designed with three parts: a guaranteed cost state-feedback controller, an adaptive neuro-fuzzy inference system (ANFIS) predictor and a fuzzy controller. Simulation example is carried out to the correctness and the validity of the proposed theory.
0W@W: Tsing Hua Univ, Dept Comp Sci & Technol, Natl Key Lab Intelligent Technol & Syst, Beijing 100084, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Wu, FG, Tsing Hua Univ, Dept Comp Sci & Technol, Natl Key Lab Intelligent Technol & Syst, Beijing 100084, Peoples R China.
5uP[®±{0W@W: wfg02@mails.tsinghua.edu.cn
_(uvÂSe.spe: 24
«_!k: 0
úQHrFU: WATAM PRESS
úQHrFU0W@W: C/O DCDIS JOURNAL, 317 KAREN PLACE, WATERLOO, ONTARIO N2L 6K8, CANADA
ISSN: 1492-8760
29 W[&{vegnúQHrir
Tðy)Q: DYN CONT DISCR IMP SYST SER B
ISO egne.súQHrir
Tðy)Q: Dyn. Contin. Discret. Impuls. Syst. Ser. B-Appl. Algorithms
egne.sux¡pe: 5
f[Ñy{|+R: Mathematics, Applied
ISI e.s O÷S: 962FM

--------------------------------------------------------------------------------
>f:y 97 agÿqQ 119 ag
\O: Zhang, J
: Nieuwenhuis, R
h: Computer search for counterexamples to Wilkie's identity
egnúQHrir: AUTOMATED DEDUCTION - CADE-20, PROCEEDINGS, 3632: 441-451 2005
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: 20th International Conference on Automated Deduction (CADE-20)
O®åeg: JUL 22-27, 2005
O®0W¹p: Tallinn, ESTONIA
KeyWords Plus: ALGEBRAS
Xd: 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.
0W@W: Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Zhang, J, Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100864, Peoples R China.
5uP[®±{0W@W: zj@ios.ac.cn
_(uvÂSe.spe: 14
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-28005-7
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 11
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BCS47

--------------------------------------------------------------------------------
>f:y 98 agÿqQ 119 ag
\O: Li, AS
: Cooper, SB; Lowe, B; Torenvliet, L
h: The low splitting theorem in the difference hierarchy
egnúQHrir: NEW COMPUTATIONAL PARADIGMS, 3526: 287-296 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st Conference on Computability in Europe (CiE 2005)
O®åeg: JUN 08-12, 2005
O®0W¹p: Amsterdam, NETHERLANDS
KeyWords Plus: RECURSIVELY ENUMERABLE DEGREES; MINIMAL DEGREES; DEGREES LESS; DRE DEGREES; RE DEGREES; DENSE
Xd: It is shown that for any 2-computably enumerable Turing degrees a, l, if l' = 0', and l infinity) Ls(n)/n together with an upper bound are given. A necessary and sufficient condition for the existence of lim(n ->infinity) Ls(n)/n is also given.
0W@W: Chinese Acad Sci, Grad Sch, State Key Lab Informat Secur, Beijing 100039, Peoples R China; Kyushu Inst Technol, Dept Comp Sci & Elect, Fukuoka 8208502, Japan; Chinese Acad Sci, Software Inst, Beijing 100080, Peoples R China
¯\O0W@W: Dai, ZD, Chinese Acad Sci, Grad Sch, State Key Lab Informat Secur, Beijing 100039, Peoples R China.
5uP[®±{0W@W: yangdai@public.bta.net.cn; imamura@cse.kyutech.ac.jp
_(uvÂSe.spe: 9
«_!k: 8
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-26084-6
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 14
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCN33

--------------------------------------------------------------------------------
>f:y 100 agÿqQ 119 ag
\O: Dai, ZD; Feng, XT; Yang, JH
: Helleseth, T; Sarwate, D; Song, HY; Yang, K
h: Multi-continued fraction algorithm and generalized B-M algorithm over F-2*
egnúQHrir: SEQUENCES AND THEIR APPLICATIONS - SETA 2004, 3486: 339-354 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference Sequences and Their Applications (SETA 2004)
O®åeg: OCT 24-28, 2004
O®0W¹p: Seoul, SOUTH KOREA
KeyWords Plus: BERLEKAMP-MASSEY ALGORITHM; SHIFT-REGISTER SYNTHESIS
Xd: It is shown that the generalized Berlekamp-Massey algorithm (GBMA, in short) for solving the linear synthesis problem of a multi-sequence (r) under bar over F-2 can be obtained naturally from a special form of the multi-continued fraction algorithm, called the multi-strict continued fraction algorithm (m-SCFA, in short). Moreover, the discrepancy sequence in acting GBMA on (r) under bar is expressed explicitly by the data associated to the multi-strict continued fraction expansion C((r) under bar) which is obtained by applying m-SCFA on (r) under bar. As a consequence, a 1-1 correspondence between multi-sequences of any given length and certain multi-strict continued fractions is established.
0W@W: Chinese Acad Sci, Grad Sch, State Key Lab Informat Secur, Beijing 100049, Peoples R China; Chinese Acad Sci, Software Inst, Beijing 100049, Peoples R China
¯\O0W@W: Dai, ZD, Chinese Acad Sci, Grad Sch, State Key Lab Informat Secur, Beijing 100049, Peoples R China.
5uP[®±{0W@W: yangdai@public.bta.net.cn; fengxt@mails.gscas.ac.cn
_(uvÂSe.spe: 14
«_!k: 7
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-26084-6
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 16
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCN33

--------------------------------------------------------------------------------
>f:y 101 agÿqQ 119 ag
\O: Yang, L; Zuo, C; Wang, YG
: Wang, J; Liao, X; Yi, Z
h: An effective two-stage neural network model and its application on flood loss prediction
egnúQHrir: ADVANCES IN NEURAL NETWORKS - ISNN 2005, PT 3, PROCEEDINGS, 3498: 1010-1016 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Symposium on Neural Networks
O®åeg: MAY 30-JUN 01, 2005
O®0W¹p: Chongqing, PEOPLES R CHINA
O®^©RFU: Chongqing Univ.; SW Normal Univ.; Chongqing Univ, Posts& Telecommun.; SW Agr Univ.; Chongqing Educ Coll.; Chinese Univ Hong Kong.; Asia Pacific Neural Network Assembly.; European Neural Network Soc.; IEEE Circuits & Syst Soc.; IEEE Computat Intelligence Soc.; Natl Nat Sci Fdn China.; K C Wong Educ Fdn Hong Kong.
Xd: In this study, a two-stage radial basis function neural network based model is employed to develop flood loss prediction model for insurance company. In the first stage, self-organizing map clustering is used to measuring the similarity of the input data, unlike k-means approach, number and centers of clusters can be determined dynamically and automatically. The Value-related Self Organizing Map (VSOM) is proposed to improve predicting accuracy for high loss subject. During the second stage, the weights from the hidden layer to output layer are determined by multivariate linear regression method. Simulation results show that the proposed approach can be applied successfully to build flood loss prediction models and provide higher accuracy and more direct decision support compared to current approaches.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Yang, L, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: yangli@sinosoft.com.cn; zuochun@sinosoft.com.cn; wyg@sinosoft.com.cn
_(uvÂSe.spe: 6
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-25914-7
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCN43

--------------------------------------------------------------------------------
>f:y 102 agÿqQ 119 ag
\O: Xing, F; Guo, P
: Wang, J; Liao, X; Yi, Z
h: Support vector regression for software reliability growth modeling and prediction
egnúQHrir: ADVANCES IN NEURAL NETWORKS - ISNN 2005, PT 1, PROCEEDINGS, 3496: 925-930 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Symposium on Neural Networks
O®åeg: MAY 30-JUN 01, 2005
O®0W¹p: Chongqing, PEOPLES R CHINA
O®^©RFU: Chongqing Univ.; SW Normal Univ.; Chongqing Univ, Posts& Telecommun.; SW Agr Univ.; Chongqing Educ Coll.; Chinese Univ Hong Kong.; Asia Pacific Neural Network Assembly.; European Neural Network Soc.; IEEE Circuits & Syst Soc.; IEEE Computat Intelligence Soc.; Natl Nat Sci Fdn China.; K C Wong Educ Fdn Hong Kong.
KeyWords Plus: NETWORKS
Xd: In this work, we propose to apply support vector regression (SVR) to build software reliability growth model (SRCM). SRGM is an important aspect in software reliability engineering. Software reliability is the probability that a given software will be functioning without failure during a specified period of time in a specified environment. In order to obtain the better performance of SRGM, practical selection of parameter C for SVR is discussed in the experiments. Experimental results with the classical Sys1 and Sys3 SRGM data set show that the performance of the proposed SVR-based SRCM is better than conventional SRGMs and relative good prediction and generalization ability are achieved.
0W@W: Beijing Normal Univ, Dept Comp Sci, Beijing 100875, Peoples R China; Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Xing, F, Beijing Normal Univ, Dept Comp Sci, Beijing 100875, Peoples R China.
5uP[®±{0W@W: xsoar@163.com; pguo@ieee.org
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-25912-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCN38

--------------------------------------------------------------------------------
>f:y 103 agÿqQ 119 ag
\O: Wang, GL; Qing, SH
: Gervasi, O; Gavrilova, ML; Kumar, V; Lagana, A; Lee, HP; Mun, Y; Taniar, D; Tan, CJK
h: Security flaws in several group signatures proposed by Popescu
egnúQHrir: COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2005, PT 3, 3482: 711-718 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Computational Science and Its Applications (ICCSA 2005)
O®åeg: MAY 09-12, 2005
O®0W¹p: Singapore, SINGAPORE
O®^©RFU: Inst High Performance Comp.; Univ Perugia.; Univ Calgary.; Univ Minnesota.; Queens Univ Belfast.; Soc Ind & Appl Math.; IEE.; OptimaNumerics Ltd.; MASTER UP.
\OsQ.Í: group signature; digital signature; information security
KeyWords Plus: SCHEME
Xd: In resent years, Popescu et al. proposed several group signature schemes in [8, 9, 10, 11] that based on the Okamoto-Shiraishi assumption. Their schemes are claimed to be secure. However, we identify several security flaws in their schemes and then show that these schemes are all insecure. By exploiting those flaws, anybody (not necessarily a group member) can forge valid group signatures on arbitrary messages of his/her choice. In other words, these schemes are universally forgeable.
0W@W: Inst Infocomm Res, Singapore 119613, Singapore; Chinese Acad Sci, Inst Software, ERCIST, Beijing 100080, Peoples R China
¯\O0W@W: Wang, GL, Inst Infocomm Res, 21 Heng Mui Keng Terrace, Singapore 119613, Singapore.
5uP[®±{0W@W: glwang@i2r.a-star.edu.sg; qsihan@yahoo.com
_(uvÂSe.spe: 13
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-25862-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCK21

--------------------------------------------------------------------------------
>f:y 104 agÿqQ 119 ag
\O: Ji, JF; Li, S; Wu, EH; Liu, XH
: Gervasi, O; Gavrilova, ML; Kumar, V; Lagana, A; Lee, HP; Mun, Y; Taniar, D; Tan, CJK
h: Interactive transmission of highly detailed surfaces
egnúQHrir: COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2005, PT 3, 3482: 1167-1176 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Computational Science and Its Applications (ICCSA 2005)
O®åeg: MAY 09-12, 2005
O®0W¹p: Singapore, SINGAPORE
O®^©RFU: Inst High Performance Comp.; Univ Perugia.; Univ Calgary.; Univ Minnesota.; Queens Univ Belfast.; Soc Ind & Appl Math.; IEE.; OptimaNumerics Ltd.; MASTER UP.
Xd: It is a challenging work for transmitting the highly detailed surfaces interactively to meet real time requirement of the large-scale model visualization from clients. In this paper, we propose a novel approach to interactive transmission of highly detailed surfaces according to the viewpoint. We firstly map the 3D surfaces onto the parameter space through surface parametrization, and the geometry images (GIM) and normal map atlas are obtained by regular re-sampling. Then the quadtree-based hierarchical representation can be constructed based on GIM. Since the hierarchical structure is regular, an efficient compression scheme can be applied to encode the structure and vertices of its nodes. The encoded nodes can be transmitted in arbitrary order, so the extreme flexibility in transmission could be achieved. By taking advantage of normal texture atlas, the rendering result of the partial transmitted model is improved greatly, and then only the geometry on the silhouette to the current viewpoint need be refined and transmitted, and so the amount of data needed to transfer each frame is greatly reduced,
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing, Peoples R China; Univ Macao, Dept Comp & Informat Sci, Macao, Peoples R China; Peking Univ, Sch Elect Engn & Comp Sci, Beijing, Peoples R China
¯\O0W@W: Ji, JF, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing, Peoples R China.
5uP[®±{0W@W: jjf@ios.ac.cn; ls@ios.ac.cn; weh@ios.ac.cn; lxh@ios.ac.cn
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-25862-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCK21

--------------------------------------------------------------------------------
>f:y 105 agÿqQ 119 ag
\O: Qu, HP; Su, PR; Lin, DD; Feng, DG
: Lorenz, P; Dini, P
h: A packet marking scheme for IP traceback
egnúQHrir: NETWORKING - ICN 2005, PT 2, 3421: 964-971 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Conference on Networking (ICN 2005)
O®åeg: APR 17-21, 2005
O®0W¹p: Reunion Isl, FRANCE
Xd: DDoS attack is a big problem to the Internet community due to its high-profile, severe damage, and the difficulty in defending against it. Several countermeasures are proposed for it in the literature, among which, Probabilistic Packet Marking (PPM) first developed by Savage et al. is promising. However, the PPM marking schemes have the limitations in two main aspects: high computation overhead and large number of false positives. In this paper, a new packet marking scheme is proposed, which is more practical because of higher precision, and computationally more efficient compared with the PPM scheme proposed by Savage. Furthermore, this scheme can achieve a more higher precision than Advanced Marking Schemes in case of the victim knowing the map of its upstream routers.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China
¯\O0W@W: Qu, HP, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, POB 8718, Beijing 100080, Peoples R China.
5uP[®±{0W@W: haipeng@acm.org
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-25338-6
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCF68

--------------------------------------------------------------------------------
>f:y 106 agÿqQ 119 ag
\O: Su, PR; Li, DQ; Qu, HP; Feng, DG
: Lorenz, P; Dini, P
h: Detecting the deviations of privileged process execution
egnúQHrir: NETWORKING - ICN 2005, PT 2, 3421: 980-988 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Conference on Networking (ICN 2005)
O®åeg: APR 17-21, 2005
O®0W¹p: Reunion Isl, FRANCE
Xd: Most intruders access system unauthorizedly by exploiting vulnerabilities of privileged processes. Respectively monitoring privileged processes via system call sequences is one of effective methods to detect intrusions. Based on the analysis of popular attacks, we bring forward a new intrusion detection model monitoring the system call sequences, which use locally fuzzy matching to improve the detection accuracy. And the model adopts a novel profile generation method, which could easily generate better profile. The experimental results show that both the accuracy and the efficiency have been improved.
0W@W: Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China
¯\O0W@W: Su, PR, Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: supurui@is.iscas.ac.cn; lidequan@is.iscas.ac.cn; hqu@is.iscas.ac.cn; fengdg@is.iscas.ac.cn
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-25338-6
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCF68

--------------------------------------------------------------------------------
>f:y 107 agÿqQ 119 ag
\O: Liang, B; Liu, H; Shi, WC; Wu, YJ
: Deng, RH; Bao, F; Pang, HH; Zhou, JY
h: Enforcing the principle of least privilege with a state-based privilege control model
egnúQHrir: INFORMATION SECURITY PRACTICE AND EXPERIENCE, 3439: 109-120 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st Information Security Practice and Experience Conference
O®åeg: APR 11-14, 2005
O®0W¹p: Singapore, SINGAPORE
O®^©RFU: Inst Infocomm Res.; Singapore Management UNiv.; Sch Informat Syst.; Singapore Management Univ.
Xd: In order to provide effective support to the principle of least privilege, considering the limitation of traditional privilege mechanisms, this paper proposes a new privilege control model called State-Based Privilege Control (SBPC) and presents the design and implementation of a prototype system for SBPC called Controlled Privilege Framework (CPF) on the Linux operating system platform. SBPC decomposes the time space of a process' lifetime into a series of privilege states according to activities of the process and its need for special permissions. The privilege state is closely related to the application logic of a process. It is the privilege state transfer event that stimulates a process to transfer from one privilege state into another one. For a specified process, there is a specific set of privileges corresponding to every privilege state of the process. With the implementation of CPF, experiment results show that fine-grain and automatic privilege control can be exercised transparently to traditional applications, threats of intrusion to a system can be reduced greatly, and support to the principle of least privilege can therefore be achieved effectively.
0W@W: Tsing Hua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China; Venus Info Tech Inc, Beijing 100081, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Liang, B, Tsing Hua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China.
5uP[®±{0W@W: Liangbin@venustech.com.cn; Liuheng@venustech.com.cn; Wenchang@ios.cn; Yanjun03@ios.cn
_(uvÂSe.spe: 10
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-25584-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCG09

--------------------------------------------------------------------------------
>f:y 108 agÿqQ 119 ag
\O: Wu, YJ; Shi, WC; Liang, HL; Shang, QH; Yuan, CY; Liang, B
: Deng, RH; Bao, F; Pang, HH; Zhou, JY
h: Security on-demand architecture with multiple modules support
egnúQHrir: INFORMATION SECURITY PRACTICE AND EXPERIENCE, 3439: 121-131 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st Information Security Practice and Experience Conference
O®åeg: APR 11-14, 2005
O®0W¹p: Singapore, SINGAPORE
O®^©RFU: Inst Infocomm Res.; Singapore Management UNiv.; Sch Informat Syst.; Singapore Management Univ.
Xd: It's very important for a general-purpose operating system to have a security-tunable feature to meet different security requirements. This can be achieved by supporting diverse security modules, invoking them on demand. However, the security architectures of existing projects on Linux kernels do not support this feature or have some drawbacks in their supporting. Thus we introduce a layered architecture which consists of original kernel layer, module coordination layer and module decision layer. The architecture supports multiple modules register, resolves policy-conflicts of modules by changing their invoking order, and allow user to customize the security by enabling or disabling modules during runtime. The detailed structure and implementation in Linux based system, SECIMOS is described. The caching issue and performance are also discussed. Our practice showed the architecture helps us achieve flexible adaptation in different environments.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing, Peoples R China
¯\O0W@W: Wu, YJ, Chinese Acad Sci, Inst Software, 712,POB 1871, Beijing, Peoples R China.
5uP[®±{0W@W: yanjun03@ios.cn
_(uvÂSe.spe: 9
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-25584-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 11
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCG09

--------------------------------------------------------------------------------
>f:y 109 agÿqQ 119 ag
\O: Tan, ZW; Liu, ZJ; Wang, MS
: Deng, RH; Bao, F; Pang, HH; Zhou, JY
h: On the security of some nonrepudiable threshold proxy signature schemes
egnúQHrir: INFORMATION SECURITY PRACTICE AND EXPERIENCE, 3439: 374-385 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st Information Security Practice and Experience Conference
O®åeg: APR 11-14, 2005
O®0W¹p: Singapore, SINGAPORE
O®^©RFU: Inst Infocomm Res.; Singapore Management UNiv.; Sch Informat Syst.; Singapore Management Univ.
KeyWords Plus: SIGNERS
Xd: A (t, n) threshold proxy signature scheme enables an original signer or a group of original signers to delegate the signature authority to a proxy group of n members such that not less than t proxy signers can cooperatively sign messages on behalf of the original signer or the original signer group. In the paper, we show that Sun's and Yang et al.'s threshold proxy signature schemes are insecure against the original signer's forgery, and that Tzeng et al.'s threshold multi-proxy multi-signature scheme is vulnerable against the actual original signer group's forgery. We also show that Hsu et al.'s threshold proxy signature scheme suffers from the conspiracy of the original signer and the secret share dealer SA, and that Hwang et al.'s threshold proxy signature scheme is universally forgeable. In other words, none of the above-mentioned schemes holds the unforgeability and provides non-repudiation.
0W@W: CAS, AMSS, Key Lab Math Mechanizat, Beijing 100080, Peoples R China; CAS, State Key Lab Informat Secur, Grad Sch, Beijing 100039, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Tan, ZW, CAS, AMSS, Key Lab Math Mechanizat, Beijing 100080, Peoples R China.
5uP[®±{0W@W: ztan@163.com; zliu@mmrc.iss.ac.cn; mingsheng-wang@yahoo.com.cn
_(uvÂSe.spe: 22
«_!k: 2
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-25584-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCG09

--------------------------------------------------------------------------------
>f:y 110 agÿqQ 119 ag
\O: Lin, HM
: Liu, Z; Araki, K
h: A predicate spatial logic and model checking for mobile processes
egnúQHrir: THEORETICAL ASPECTS OF COMPUTING - ICTAC 2004, 3407: 36-36 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Colloquium on Theoretical Aspects of Computing (ICTAC 2004)
O®åeg: SEP 20-24, 2004
O®0W¹p: Guiyang, PEOPLES R CHINA
O®^©RFU: UN Univ, Int Inst Software Technol.; Guizhou Acad Sci.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100864, Peoples R China
¯\O0W@W: Lin, HM, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100864, Peoples R China.
5uP[®±{0W@W: lhm@ios.ac.cn
_(uvÂSe.spe: 0
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-25304-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 1
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCF19

--------------------------------------------------------------------------------
>f:y 111 agÿqQ 119 ag
\O: Ma, YL; Wei, J; Jin, BH; Liu, SH
: Liu, Z; Araki, K
h: A formal framework for ontology integration based on a default extension to DDL
egnúQHrir: THEORETICAL ASPECTS OF COMPUTING - ICTAC 2004, 3407: 154-169 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Colloquium on Theoretical Aspects of Computing (ICTAC 2004)
O®åeg: SEP 20-24, 2004
O®0W¹p: Guiyang, PEOPLES R CHINA
O®^©RFU: UN Univ, Int Inst Software Technol.; Guizhou Acad Sci.
\OsQ.Í: ontology integration; distributed description logics; default extension; Tableau algorithm; semantic query
KeyWords Plus: SEMANTIC WEB
Xd: The information society demands complete information from multiple sources, where available information is often heterogeneous and distributed. Because of semantic heterogeneities among ontologies of different information sources, it is rather difficult to integrate these local ontologies and get completely available information. In this paper, we propose a formal framework for integration of multiple ontologies from distributed information sources. To achieve this goal, implicit default information is extensively considered. We make a default extension to distributed description logics (DDL) for ontology integration and complete information query. A complete information query based on the integrated ontologies can boil down to checking default satisfiability of complex concept in accord with the query. Default satisfiability can be detected through an adapted tableau algorithm. Based on the proposed formal framework, a prototype system is developed, which can integrate strict as well as default information from multiple distributed information sources and global semantic information query can be performed.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Ma, YL, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, POB 8718, Beijing 100080, Peoples R China.
5uP[®±{0W@W: m_y_long@otcaix.iscas.ac.cn; wj@otcaix.iscas.ac.cn; jbh@otcaix.iscas.ac.cn; ham_liu@otcaix.iscas.ac.cn
_(uvÂSe.spe: 24
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-25304-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 16
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCF19

--------------------------------------------------------------------------------
>f:y 112 agÿqQ 119 ag
\O: Zhou, CX; Zheng, H; Yu, W; Yao, JF; Li, YC
h: Digital analysis technology for morphology of polymer chain coils in flow fields
egnúQHrir: CHINESE JOURNAL OF POLYMER SCIENCE, 23 (2): 155-158 MAR 2005
í: English
e.s{|W: Proceedings Paper
O®h: 6th International Symposium on Polymer Physics
O®åeg: JUN 01-05, 2004
O®0W¹p: Dali, PEOPLES R CHINA
O®^©RFU: State Key Lab Polymer Phys & Chem.; Univ Akron.; Tohohy Univ.; Inst Charles Sadron.; Natl Nat Sci Fdn China.; Chinese Acad Sci.; Inst Chem.; CAS, Changchum Inst Appl Chem.; CAS, Polymer Div Chinese Chem Soc.
\OsQ.Í: morphology of polymer chain; complex flows; conformation tensor; finite element method (FEM); software DAMPC
KeyWords Plus: MELTS
Xd: Polymer chain coils with entanglement is a crucial scale of structures in polymer materials since their relaxation times are matching practical processing times. Based on the phenomenological model of polymer chain coils and a new finite element approach, we have designed a computer software including solver, pre- and post-processing modules, and developed a digital analysis technology for the morphology of polymer chain coils in flow fields (DAMPC). Using this technology we may simulate the morphology development of chain coils in various flow fields, such as simple shear flow, elongational flow, and any complex flow at transient or steady state. The applications made up to now show that the software predictions are comparable with experimental results.
0W@W: Shanghai Jiao Tong Univ, Dept Polymer Sci & Engn, Shanghai 200240, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhou, CX, Shanghai Jiao Tong Univ, Dept Polymer Sci & Engn, Shanghai 200240, Peoples R China.
5uP[®±{0W@W: cxzhou@mail.sjtu.edu.cn
_(uvÂSe.spe: 5
«_!k: 0
úQHrFU: SPRINGER HEIDELBERG
úQHrFU0W@W: TIERGARTENSTRASSE 17, D-69121 HEIDELBERG, GERMANY
ISSN: 0256-7679
29 W[&{vegnúQHrir
Tðy)Q: CHINESE J POLYM SCI
ISO egne.súQHrir
Tðy)Q: Chin. J. Polym. Sci.
egne.sux¡pe: 4
f[Ñy{|+R: Polymer Science
ISI e.s O÷S: 932MG

--------------------------------------------------------------------------------
>f:y 113 agÿqQ 119 ag
\O: Liu, N; Yan, J; Bai, F; Zhang, BY; Xi, WS; Fan, WG; Chen, Z; Ji, L; Hu, CY; Ma, WY
: Zhang, Y; Tanaka, K; Yu, JX; Wang, S; Li, M
h: A similarity reinforcement algorithm for heterogeneous Web pages
egnúQHrir: WEB TECHNOLOGIES RESEARCH AND DEVELOPMENT - APWEB 2005, 3399: 121-132 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 7th Asia-Pacific Web Conference
O®åeg: MAR 29-APR 01, 2005
O®0W¹p: Shanghai, PEOPLES R CHINA
O®^©RFU: Natl Inst Informat & Commun Technol.; Shanghai Jiao Tong Univ.; Victoria Univ.; Natl Nat Sci Fdn China.; ARC Res Netwp=ork Enterprise Informat Infrastructure.; Microsoft Res Asia.; WISE Soc.; Database Soc China Comp Federat.
Xd: Many machine learning and data mining algorithms crucially rely on the similarity metrics. However, most early research works such as Vector Space Model or Latent Semantic Index only used single relationship to measure the similarity of data objects. In this paper, we first use an Intra- and Inter- Type Relationship Matrix (IITRM) to represent a set of heterogeneous data objects and their inter-relationships. Then, we propose a novel similarity-calculating algorithm over the Inter- and Intra- Type Relationship Matrix. It tries to integrate information from heterogeneous sources to serve their purposes by iteratively computing. This algorithm can help detect latent relationships among heterogeneous data objects. Our new algorithm is based on the intuition that the intrarelationship should affect the inter-relationship, and vice versa. Experimental results on the MSN logs dataset show that our algorithm outperforms the traditional Cosine similarity.
0W@W: Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China; Peking Univ, Sch Math Sci, Dept Informat Sci, LMAM, Beijing, Peoples R China; Microsoft Res Asia, Beijing, Peoples R China; Virginia Polytech Inst & State Univ, Blacksburg, VA 24061 USA; Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing, Peoples R China
¯\O0W@W: Liu, N, Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China.
5uP[®±{0W@W: liun01@mails.tsinghua.edu.cn; yanjun@math.pku.edu.cn; fbai@math.tsinghua.edu.cn
_(uvÂSe.spe: 30
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-25207-X
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCD84

--------------------------------------------------------------------------------
>f:y 114 agÿqQ 119 ag
\O: Che, HY; Zhang, JC; Yu, SQ; Gu, J
: Zhang, Y; Tanaka, K; Yu, JX; Wang, S; Li, M
h: IWWS: A reliability-based WWW collaborative recommender system
egnúQHrir: WEB TECHNOLOGIES RESEARCH AND DEVELOPMENT - APWEB 2005, 3399: 375-380 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 7th Asia-Pacific Web Conference
O®åeg: MAR 29-APR 01, 2005
O®0W¹p: Shanghai, PEOPLES R CHINA
O®^©RFU: Natl Inst Informat & Commun Technol.; Shanghai Jiao Tong Univ.; Victoria Univ.; Natl Nat Sci Fdn China.; ARC Res Netwp=ork Enterprise Informat Infrastructure.; Microsoft Res Asia.; WISE Soc.; Database Soc China Comp Federat.
Xd: Recommender systems using collaborative filtering are a popular technique for reducing information overload and finding products. In this paper, we present a reliability-based WWW collaborative recommender system IWWS (Intelligent Web Wizard System), mainly aiming to attack so-called "Matchmaker" problem in collaborative filtering. The "Matchmaker" problem steins from false assumptions that users are counted only by their similarity and high similarity means good advisers. In order to find good advisers for every user, we construct a matchmaker's reliability mode based on the algorithm deriving from Hits, and apply it in IWWS. Comparative experimental results also show that IWWS contrastively improves performance.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Beijing Normal Univ, Coll Informat Sci, Beijing 100875, Peoples R China; Sci & Technol Univ, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
¯\O0W@W: Che, HY, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-25207-X
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCD84

--------------------------------------------------------------------------------
>f:y 115 agÿqQ 119 ag
\O: Hui, CY; Wang, YJ; Zhang, BY; Yang, Q; Wang, Q; Zhou, JH; He, R; Yan, Y
: Zhang, Y; Tanaka, K; Yu, JX; Wang, S; Li, M
h: Mining quantitative associations in large database
egnúQHrir: WEB TECHNOLOGIES RESEARCH AND DEVELOPMENT - APWEB 2005, 3399: 405-416 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 7th Asia-Pacific Web Conference
O®åeg: MAR 29-APR 01, 2005
O®0W¹p: Shanghai, PEOPLES R CHINA
O®^©RFU: Natl Inst Informat & Commun Technol.; Shanghai Jiao Tong Univ.; Victoria Univ.; Natl Nat Sci Fdn China.; ARC Res Netwp=ork Enterprise Informat Infrastructure.; Microsoft Res Asia.; WISE Soc.; Database Soc China Comp Federat.
Xd: Association Rule Mining algorithms operate on a data matrix to derive association rule, discarding the quantities of the items, which contains valuable information. In order to make full use of the knowledge inherent in the quantities of the items, an extension named Ratio Rules [6] is proposed to capture the quantitative association. However, the approach, which is addressed in [6], 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 association rules' application. In this paper, a new method, called Principal Non-negative Sparse Coding (PNSC), is provided for learning the associations between itemsets in the form of Ratio Rules. Experiments on several datasets illustrate that the proposed method performs well for the purpose of discovering latent associations between itemsets in large datasets.
0W@W: Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing, Peoples R China; Hong Kong Univ Sci & Technol, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China; Peking Univ, Sch Math Sci, Dept Informat Sci, Beijing, Peoples R China
¯\O0W@W: Hui, CY, Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing, Peoples R China.
5uP[®±{0W@W: huchenyong@itechs.iscas.ac.cn; ywang@itechs.iscas.ac..cn; byzhang@microsoft.com; qyang@cs.ust.hk; wq@itechs.iscas.ac.cn; jinhui@itechs.iscas.ac.cn; heran@itechs.iscas.ac..cn; yanjun@math.pku.edu.cn
_(uvÂSe.spe: 19
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-25207-X
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCD84

--------------------------------------------------------------------------------
>f:y 116 agÿqQ 119 ag
\O: Wu, WL; Feng, DG; Chen, H
: Handschuh, H; Hasan, MA
h: Collision attack and pseudorandomness of reduced-round Camellia
egnúQHrir: SELECTED AREAS IN CRYPTOGRAPHY, 3357: 252-266 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 11th Annual International Workshop on Selected Areas in Cryptography
O®åeg: AUG 09-10, 2004
O®0W¹p: Waterloo, CANADA
O®^©RFU: Mitsubishi Elect Corp.; Res Mot Ltd.; Queens Univ Kingston.
O®;NR¹e: Univ Waterloo
\OsQ.Í: block cipher; Camellia; data complexity; time complexity; pseudorandomness
KeyWords Plus: PERMUTATIONS
Xd: Camellia is the final winner of 128-bit block cipher in NESSIE. In this paper, we construct some efficient distinguishers between 4-round Camellia and random permutation of the blocks space. By using collision-searching techniques, the distinguishers are used to attack 6,7,8 and 9 rounds of Camellia with 128-bit key and 8,9 and 10 rounds of Camellia with 192/256-bit key. The attack on 6-round of 128-bit key Camellia is more efficient than known attacks. The complexities of the attack on 7(8,9,10)-round Camellia without FL/FL-1 functions are less than that of previous attacks. Furthermore, we prove that the 4-round primitive-wise idealized Camellia is not pseudorandom permutation and the 5-round primitive-wise idealized Camellia is super-pseudorandom permutation for non-adaptive adversaries.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Wu, WL, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China.
5uP[®±{0W@W: wwl@is.iscas.ac.cn; feng@is.iscas.ac.cn; chenhua@is.iscas.ac.cn
_(uvÂSe.spe: 15
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-24327-5
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 15
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BCB96

--------------------------------------------------------------------------------
>f:y 117 agÿqQ 119 ag
\O: Zhang, JL; Sun, L; Qu, WM; Du, L; Sun, YF
: Su, KY; Tsujii, J; Lee, JH; Kwong, OY
h: A three level cache-based adaptive Chinese language model
egnúQHrir: NATURAL LANGUAGE PROCESSING - IJCNLP 2004, 3248: 487-492 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Joint Conference on Natural Language Processing (IJCNLP 2004)
O®åeg: MAR 22-24, 2004
O®0W¹p: Hainan Isl, PEOPLES R CHINA
Xd: Even if n-grams were proved to be very powerful and robust in various tasks involving language models, they have a certain handicap that the dependency is limited to very short local context because of the Markov assumption. This article presents an improved cache based approach to Chinese statistical language modeling. We extend this model by introducing the Chinese concept lexicon into it. The cache of the extended language model contains not only the words occurred recently but also the semantically related words. Experiments have shown that the performance of the adaptive model has been improved greatly.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, JL, Chinese Acad Sci, Inst Software, POB 8717, Beijing 100080, Peoples R China.
5uP[®±{0W@W: Junlin01@iscas.cn
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-24475-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BBZ57

--------------------------------------------------------------------------------
>f:y 118 agÿqQ 119 ag
\O: Xu, J; Zhang, ZF; Feng, DG
: Lim, CH; Yung, M
h: A ring signature scheme using bilinear pairings
egnúQHrir: INFORMATION SECURITY APPLICATIONS, 3325: 160-169 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 5th International Workshop on Information Security Applications
O®åeg: AUG 23-25, 2004
O®0W¹p: Jeju Isl, SOUTH KOREA
O®^©RFU: Korea Inst Informat Security & Cryptol.; Elect & Telecommun Res Inst.; Minist Informat & Commun.
KeyWords Plus: AD-HOC GROUPS; CRYPTOSYSTEMS
Xd: The bilinear pairings such as Weil pairing or Tate pairing over elliptic curves and hyperelliptic curves have been found various applications in cryptography very recently. Ring signature is a very useful tool to provide the user's anonymity and the signer's privacy. In this paper, we propose a ring signature scheme based on the bilinear pairings, which is secure against chosen message attacks without random oracles. Moreover, we use this ring signature scheme to construct a concurrent signature scheme for fair exchange of signatures.
0W@W: Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
5uP[®±{0W@W: xujing@is.iscas.ac.cn; zfzhang@is.iscas.ac.cn; feng@is.iscas.ac.cn
_(uvÂSe.spe: 16
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-24015-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BBR79

--------------------------------------------------------------------------------
>f:y 119 agÿqQ 119 ag
\O: Yao, G; Feng, DG
: Lim, CH; Yung, M
h: A new k-anonymous message transmission protocol
egnúQHrir: INFORMATION SECURITY APPLICATIONS, 3325: 388-399 2005
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 5th International Workshop on Information Security Applications
O®åeg: AUG 23-25, 2004
O®0W¹p: Jeju Isl, SOUTH KOREA
O®^©RFU: Korea Inst Informat Security & Cryptol.; Elect & Telecommun Res Inst.; Minist Informat & Commun.
\OsQ.Í: anonymous transmission; cryptographic protocol; security
KeyWords Plus: PRIVACY
Xd: Public and private communication networks have a growing importance for our daily life. The globally networked society places great demand on the dissemination and sharing of person-specific data. In order to protect the anonymity of individuals to whom released the data refer, data holders often remove or encrypt explicit identifiers such as names, addresses and phone numbers. But these cannot solve the problem well. Anonymous communication protocols address the problem of concealing who communicates with whom, as in the case of letters from a secret admirer. To gain efficiency, k-anonymous message transmission is presented.
Informally, a communication protocol is sender k-anonymous if it can guarantee that an adversary, trying to determine the sender of a particular message, can only narrow down its search to a set of k suspects. Receiver k-anonymity places a similar guarantee on the receiver: an adversary, at best, can only narrow down the possible receivers to a set of size k. In this paper, a k-anonymous transmission protocol is presented. The protocol is based on asymmetric encryption algorithm. All the members in the protocol is divided into smaller groups, and if all the members in the group perform the protocol correctly, the protocol is sender k-anonymous and receiver k-anonymous. Furthermore, as long as the asymmetric encryption algorithm is secure, our protocol is secure, too.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Yao, G, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China.
5uP[®±{0W@W: g.yao@is.iscas.ac.cn; fengdg@263.net
_(uvÂSe.spe: 18
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-24015-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BBR79

ISTP 2006
>f:y 1 agÿqQ 128 ag
\O: Lv, YH (Lv, Yuanhua); Sun, L (Sun, Le); Zhang, JL (Zhang, Junlin); Nie, JY (Nie, Jian-Yun); Chen, W (Chen, Wan); Zhang, W (Zhang, Wei)
fNM|âVSO\O: COLING
h: An Iterative Implicit Feedback Approach to Personalized Search
egnúQHrir: COLING/ACL 2006, VOLS 1 AND 2, PROCEEDINGS OF THE CONFERENCE: 585-592 2006
í: English
e.s{|W: Proceedings Paper
O®h: 21st International Conference on Computational Linguistics/44th Annual Meeting of the Association for Computational Linguistics
O®åeg: JUL 17-21, 2006
O®0W¹p: Sydney, AUSTRALIA
O®^©RFU: Assoc Computat Linguist.
KeyWords Plus: WEB SEARCH
Xd: General information retrieval systems are designed to serve all users without considering individual needs. In this paper, we propose a novel approach to personalized search. It can, in a unified way, exploit and utilize implicit feedback information, such as query logs and immediately viewed documents. Moreover, our approach can implement result re-ranking and query expansion simultaneously and collaboratively. Based on this approach, we develop a client-side personalized web search agent PAIR (Personalized Assistant for Information Retrieval), which supports both English and Chinese. Our experiments on TREC and HTRDP collections clearly show that the new approach is both effective and efficient.
0W@W: [Lv, Yuanhua] Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Lv, YH, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 19
«_!k: 0
úQHrFU: ASSOC COMPUTATIONAL LINGUISTICS-ACL
úQHrFU0W@W: 209 N EIGHTH STREET, STROUDSBURG, PA 18360 USA
ISBN: 978-1-932432-65-7
egne.sux¡pe: 8
ISI e.s O÷S: BNG36

--------------------------------------------------------------------------------
>f:y 2 agÿqQ 128 ag
\O: Wang, HB (Wang, Hong-Bing); Fan, ZH (Fan, Zhi-Hua); She, CD (She, Chun-Dong)
: Ardil, C
h: Federal Open Agent System Platform
egnúQHrir: PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 14, 14: 216-221 2006
NfNh: Proceedings of World Academy of Science Engineering and Technology
í: English
e.s{|W: Proceedings Paper
O®h: Conference of the World-Academy-of-Science-Engineering-and-Technology
O®åeg: AUG 25-27, 2006
O®0W¹p: Prague, CZECH REPUBLIC
O®^©RFU: World Acad Sci Engn & Technol.
\OsQ.Í: Open Agent System; High Level Architecture; Heterogeneous Agents; Wrapper
Xd: Open Agent System platform based on High Level Architecture is firstly proposed to support the application involving heterogeneous agents. The basic idea is to develop different wrappers for different agent systems, which are wrapped as federates to join a federation. The platform is based on High Level Architecture and the advantages for this open standard are naturally inherited, such as system interoperability and reuse. Especially, the federal architecture allows different federates to be heterogeneous so as to support the integration of different agent systems. Furthermore, both implicit communication and explicit communication between agents can be supported. Then, as the wrapper RTI_JADE an example, the components are discussed. Finally, the performance of RTI_JADE is analyzed. The results show that RTI_JADE works very efficiently.
0W@W: [Wang, Hong-Bing] Chinese Acad Sci, Gen Software Lab, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Wang, HB, Chinese Acad Sci, Gen Software Lab, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 19
«_!k: 0
úQHrFU: WORLD ACAD SCI, ENG & TECH-WASET
úQHrFU0W@W: PO BOX 125, CANAKKALE, 17100, TURKEY
ISSN: 1307-6884
29 W[&{vegnúQHrir
Tðy)Q: PROC WRLD ACAD SCI ENG TECH
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Interdisciplinary Applications; Computer Science, Theory & Methods; Engineering, Multidisciplinary; Engineering, Electrical & Electronic
ISI e.s O÷S: BII14

--------------------------------------------------------------------------------
>f:y 3 agÿqQ 128 ag
\O: Yuan, P (Yuan, P.)
: Callaos, N; Lesso, W; Tremante, A; Baralt, J; Rebielak, J
h: A buy-time fault tolerant method in distributed multi-robot real-time control systems
egnúQHrir: WMSCI 2006: 10TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL VII, PROCEEDINGS: 524-529 2006
í: English
e.s{|W: Proceedings Paper
O®h: 10th World Multi-Conference on Systemics, Cybernetics and Informatics/12th International Conference on Information Systems Analysis and Synthesis
O®åeg: JUL 16-19, 2006
O®0W¹p: Orlando, FL
O®^©RFU: Int Inst Informat & System.
\OsQ.Í: real-time; fault identification; fault tolerant control; parameter estimation; distributed telerobot
KeyWords Plus: RECONFIGURABLE CONTROL-SYSTEMS; DYNAMIC-SYSTEMS; DESIGN; ROBOTS
Xd: In this paper, a new buy-time fault tolerant method is proposed based on a bounding parameter estimation algorithm. The system parameters are confined within given bounds. The size of the bounds shrinks as more information becomes available. In this case, the reconfigurable control scheme can rely on the estimated parameter bounds to provide preliminary control to stabilize the system and slow down the deterioration of the system performance. Thus longer time can he gained for further identification and control reconfiguration to recover the system performance gradually. The simulation result shows that with this method, the safety critical system can buy some time before the final crash happens.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Yuan, P, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: INT INST INFORMATICS & SYSTEMICS
úQHrFU0W@W: 14269 LORD BARCLAY DR, ORLANDO, FL 32837 USA
ISBN: 978-980-6560-72-7
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Cybernetics; Computer Science, Information Systems
ISI e.s O÷S: BHA60

--------------------------------------------------------------------------------
>f:y 4 agÿqQ 128 ag
\O: Zuo, L (Zuo Lin); Liu, SH (Liu Shaohua); Wei, J (Wei Jun)
fNM|âVSO\O: IEEE Computer Society
h: A fault-tolerant scheme for complex transaction patterns in J2EE
egnúQHrir: 10th IEEE International Enterprise Distributed Object Computing Conference, Proceedings: 165-174 2006
NfNh: IEEE International Enterprise Distributed Object Computing (EDOC) Conference
í: English
e.s{|W: Proceedings Paper
O®h: 10th IEEE International Enterprise Distributed Object Computing Conference
O®åeg: OCT 16-20, 2006
O®0W¹p: Hong Kong, PEOPLES R CHINA
O®^©RFU: IEEE Comp Soc.; IEEE Commun Soc.; City Univ Hong Kong.; Hong Kong Polytech Univ.; Hong Kong Web Soc.; IEEE IT Profess Magazine.; AMC.; KC Wong Educ Fdn.; IEEE Hong Kong Chapter.
KeyWords Plus: 3-TIER ARCHITECTURES; CORBA; REPLICATION; SYSTEMS
Xd: End-to-End Reliability is an important issue in building large-scale distributed enterprise applications based on multi-tier architecture, but the support of reliability as adopted in conventional replication or transactions mechanisms is not enough due to their distinct objectives - replication guarantees the liveness of computational operations by using forward error recovery, while transactions guarantee the safety of application data by using backward error recovery. Combining the two mechanisms for stronger reliability is a challenging task. Current solutions, however, are typically on the assumption of simple transaction pattern where a request from a single client executes in the context of exactly one transaction at the middle-tier application server, and seldom think about some complex patterns, such as client transaction enclosing multiple client requests or nested transactions. In this paper, we first identify four transaction pattern classes, and then propose a fault-tolerant scheme that can uniformly provide exactly-once semantic reliability support for these patterns. In this scheme, application servers are passively replicated to endow business logics with high reliability and high availability. In addition, by replicating transaction coordinator, the blocking problem of 2PC protocol during distributed transactions processing is eliminated. We have implemented this approach and integrated it into our own J2EE application server, OnceAS Also, its effectiveness is discussed in different transaction patterns and the corresponding performance is evaluated.
0W@W: Chinese Acad Sci, Technol Ctr Software, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zuo, L, Chinese Acad Sci, Technol Ctr Software, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 20
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 1541-7719
ISBN: 0-7695-2558-X
29 W[&{vegnúQHrir
Tðy)Q: IEEE EDOC CONF
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Hardware & Architecture; Engineering, Electrical & Electronic
ISI e.s O÷S: BFK73

--------------------------------------------------------------------------------
>f:y 5 agÿqQ 128 ag
\O: Feng, LX (Feng, Li Xiao); Guo, FD (Guo, Feng Deng)
fNM|âVSO\O: IEEE Computer Society
h: Composing administrative scope of delegation policies based on extended XACML
egnúQHrir: 10th IEEE International Enterprise Distributed Object Computing Conference, Proceedings: 467-470 2006
NfNh: IEEE International Enterprise Distributed Object Computing (EDOC) Conference
í: English
e.s{|W: Proceedings Paper
O®h: 10th IEEE International Enterprise Distributed Object Computing Conference
O®åeg: OCT 16-20, 2006
O®0W¹p: Hong Kong, PEOPLES R CHINA
O®^©RFU: IEEE Comp Soc.; IEEE Commun Soc.; City Univ Hong Kong.; Hong Kong Polytech Univ.; Hong Kong Web Soc.; IEEE IT Profess Magazine.; AMC.; KC Wong Educ Fdn.; IEEE Hong Kong Chapter.
Xd: XACML as a language of access policy and access context request based on attributes is widely accepted. Current XACML specification's main shortcoming is not considering delegation. A TC in OASIS proposed a draft about administrative policy, which extended XACML to describe delegation policies and stated how to process delegation policies in access decisions. In some cases, a supervisor may need to know administration authorities possessed by a manager who gets them through delegation policies. For providing such information, access control management systems should calculate total administration authority of a manager according to related delegation policies. Current XACML related works haven't addressed this topic. In this paper we define basic administrative scope and its simple XML schema, use a set of administrative scope representing administrative authority. Using these definitions, we formally describe the calculation of a manager's total administrative scope.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Feng, LX, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 1541-7719
ISBN: 0-7695-2558-X
29 W[&{vegnúQHrir
Tðy)Q: IEEE EDOC CONF
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Hardware & Architecture; Engineering, Electrical & Electronic
ISI e.s O÷S: BFK73

--------------------------------------------------------------------------------
>f:y 6 agÿqQ 128 ag
\O: Wang, JF (Wang, Junfeng); Zhou, HX (Zhou, Hongxia); Xu, FJ (Xu, Fanjiang); Zhou, MT (Zhou, Mingtian)
fNM|âVSO\O: IEEE
h: Polar LEO satellite constellation measurement by delay probing
egnúQHrir: 2006 IEEE International Performance Computing and Communications Conference, Vols 1 and 2: 303-310 2006
NfNh: IEEE International Performance, Computing and Communications Conference (IPCCC)
í: English
e.s{|W: Proceedings Paper
O®h: 25th IEEE International Performance Computing and Communications Conference
O®åeg: APR 10-12, 2006
O®0W¹p: Phoenix, AZ
O®^©RFU: IEEE.
KeyWords Plus: IP NETWORKS; TRANSPORT PROTOCOL; ROUTING ALGORITHM; INTERNET; SCHEME
Xd: Low Earth Orbit (LEO) satellite networks are capable of providing wireless connectivity seamlessly and continuously to any part of the world with guaranteed short round-trip propagation delay. As a key part of Next Generation Network (NGN) infrastructure, next generation satellite networks are expected to support a variety of applications with diverse performance requirements. This paper argues that the constellation tomography for the LEO satellite network is a preliminary step for efficient satellite network monitoring and performance promotion.
To measure the constellation, a divide-and-conquer mechanism is developed for each parameter estimation by delay probing. The delay measurement is only carried out between two terminals located at the same geographic positions. Performance evaluation on several popular polar LEO constellations proves the accuracy and efficiency of the developed constellation tomography algorithms in divide-and-conquer manner The geographic position limitation of the delay probing terminals for valid constellation inference is also analyzed in the paper.
0W@W: Chinese Acad Sci, Natl Key Lab Integrated Informat Syst Technol, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Wang, JF, Chinese Acad Sci, Natl Key Lab Integrated Informat Syst Technol, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISSN: 1097-2641
ISBN: 1-4244-0197-6
29 W[&{vegnúQHrir
Tðy)Q: IEEE IPCCC
egne.sux¡pe: 8
f[Ñy{|+R: Telecommunications
ISI e.s O÷S: BFN68

--------------------------------------------------------------------------------
>f:y 7 agÿqQ 128 ag
\O: Wang, JF (Wang, Junfeng); Hu, YM (Hu, Yuemei); Zhou, HX (Zhou, Hongxia); Zhou, MT (Zhou, Mingtian)
fNM|âVSO\O: IEEE
h: Topological dynamics characterization for layered satellite networks
egnúQHrir: 2006 IEEE International Performance Computing and Communications Conference, Vols 1 and 2: 349-356 2006
NfNh: IEEE International Performance, Computing and Communications Conference (IPCCC)
í: English
e.s{|W: Proceedings Paper
O®h: 25th IEEE International Performance Computing and Communications Conference
O®åeg: APR 10-12, 2006
O®0W¹p: Phoenix, AZ
O®^©RFU: IEEE.
KeyWords Plus: MANAGEMENT
Xd: The highly topological dynamics characterize the most fundamental property of satellite networks contrary to the terrestrial networks. This manifest feature directs the researches on various aspects of satellite networks, including routing and switching architecture selection, routing protocol and reliable transmission control protocol design and enhancement, etc,. The paper quantifies the dynamical activates of layered satellite network topologies. The number and length of network snapshots of one-layered satellite constellations are formulated concisely The snapshot distributions of typical multi-layered constellations are also evaluated. With this work, it compensates for the simplified topological assumptions in many satellite network related investigations. The thorough understanding of this basic feature not only provides for an accurate quantification of network behavior but also guides constellation design for future satellite networks.
0W@W: Chinese Acad Sci, Natl Key Lab Integrated Informat Syst Technol, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Wang, JF, Chinese Acad Sci, Natl Key Lab Integrated Informat Syst Technol, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 17
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISSN: 1097-2641
ISBN: 1-4244-0197-6
29 W[&{vegnúQHrir
Tðy)Q: IEEE IPCCC
egne.sux¡pe: 8
f[Ñy{|+R: Telecommunications
ISI e.s O÷S: BFN68

--------------------------------------------------------------------------------
>f:y 8 agÿqQ 128 ag
\O: Wang, XL (Wang, Xiuli); Wang, YJ (Wang, Yongji); Zeng, HT (Zeng, Haitao); Zhou, H (Zhou, Hui)
: Cheung, YM; Wang, Y; Lium, H
h: Particle Swarm Optimization with Escape Velocity
egnúQHrir: 2006 International Conference on Computational Intelligence and Security, Pts 1 and 2, Proceedings: 457-460 2006
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Computational-Intelligence and Security
O®åeg: NOV 03-06, 2006
O®0W¹p: Guangzhou, PEOPLES R CHINA
O®^©RFU: IEEE Hong Kong Computat Intelligence Chapter.; Guangdong Univ Technol.; Xidian Univ.; Hong Kong Baptist Univ.; Jian Univ.
Xd: This paper presents a model of Particle Swarm Optimization with Escape Velocity (EVPSO) in order to overcome premature convergence in the basic Particle Swarm Optimization (PSO). The EVPSO model equips particles with the escape velocity to avoid them trapping into local minima and increase the diversity of population. A simulation study shows that the EVPSO outperforms the basic PSO, especially for high dimension function. The EVPSO model facilitates solving multi-modal optimization problems.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Wang, XL, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-0604-3
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Theory & Methods
ISI e.s O÷S: BFP93

--------------------------------------------------------------------------------
>f:y 9 agÿqQ 128 ag
\O: Zhou, CC (Zhou Chaochen)
: Liu, Z; He, J
h: Program verification through computer algebra
egnúQHrir: Formal Methods and Software Engineering, Proceedings, 4260: 1-1 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on Formal Engineering Methods (ICFEM 2006)
O®åeg: NOV 01-03, 2006
O®0W¹p: Macao, PEOPLES R CHINA
O®^©RFU: United Nat Univ, Int Inst Software Technol.; Univ Macau.; Macai Polytech Inst.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Zhou, CC, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 5
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-47460-9
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 1
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BFM90

--------------------------------------------------------------------------------
>f:y 10 agÿqQ 128 ag
\O: Ding, XN (Ding, Xiaoning); Wei, J (Wei, Jun); Huang, T (Huang, Tao)
: Liu, Z; He, J
h: User-defined atomicity constraint: A more flexible transaction model for reliable service composition
egnúQHrir: Formal Methods and Software Engineering, Proceedings, 4260: 168-184 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on Formal Engineering Methods (ICFEM 2006)
O®åeg: NOV 01-03, 2006
O®0W¹p: Macao, PEOPLES R CHINA
O®^©RFU: United Nat Univ, Int Inst Software Technol.; Univ Macau.; Macai Polytech Inst.
Xd: Transaction is the key mechanism to make service composition reliable. To ensure the relaxed atomicity of transactional composite service (TCS), existing research depends on the analysis to composition structure and exception handling mechanism. However, this approach can not handle various application-specific requirements, and causes lots of unnecessary failure recoveries or even aborts. In this paper, we propose a relaxed transaction model, including system mode, relaxed atomicity criterion, static checking algorithm and dynamic enforcement algorithm. Users can define different relaxed atomicity constraint for different TCS according to the specific application requirements, including accepted configurations and the preference order. The checking algorithm determines whether the constraint can be satisfied. The enforcement algorithm monitors the execution and performs transaction management works according to the constraint. Compared to existing work, our approach is flexible enough to handle complex application requirements and performs the transaction management works automatically. We apply the approach into web service composition language WS-BPEL and illustrate the above advantages through a concrete example.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100080, Peoples R China
¯\O0W@W: Ding, XN, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 14
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-47460-9
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 17
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BFM90

--------------------------------------------------------------------------------
>f:y 11 agÿqQ 128 ag
\O: Sun, LM (Sun, Limin); Sun, YY (Sun, Yuyan); Shu, J (Shu, Jian); He, QW (He, Qingwei)
: Xiao, N; Buyya, R; Lium, YH; Yang, GG
h: MotePlat: A monitoring and control platform for wireless sensor networks
egnúQHrir: GCC 2006: Fifth International Conference on Grid and Cooperative Computing Workshops, Proceedings: 452-458 2006
í: English
e.s{|W: Proceedings Paper
O®h: 5th International Conference on Grid and Cooperative Computing (GCC 2006)
O®åeg: OCT 21-23, 2006
O®0W¹p: Hunan, PEOPLES R CHINA
O®^©RFU: Natl Lab Parallel & Distributed Proc.; Hong Kong Univ Sci & Technol.; Platform Comp.; NSFC.; IEEE Beijing Sect.; IEEE TC SVC.
Xd: With the wide application of Wireless sensor networks, the surveillance of wireless sensor networks itself has drawn more and more attention in recent years. Based on sensor nodes under TinyOS, we develop a monitoring and control platform called MotePlat (1) to facilitate our development of WSN application systems. MotePlat employs a three-tier application framework and adopts an agent mechanism in the software architecture of sensor nodes and sink nodes. Users can remotely acquire node status information, such as its residual energy, a list of its neighbor nodes and link quality to each neighbor through this platform. They can also adjust configuration of sensor nodes, control the network to accomplish various tasks,, debug software modules of sensor nodes and test the network performance. In this paper, we describe some key technologies in MotePlat including node status information acquisition and network controlling mechanism, nodes' software architecture, and the workflow in the process of monitoring, control, debug and test.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Sun, LM, Chinese Acad Sci, Inst Software, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 1
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2695-0
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BFK65

--------------------------------------------------------------------------------
>f:y 12 agÿqQ 128 ag
\O: Zhang, H (Zhang, Hong); He, YP (He, Yeping); Shi, ZG (Shi, Zhiguo)
: Rhee, MS; Lee, B
h: Spatial context in role-based access control
egnúQHrir: Information Security and Cryptology - ICISC 2006, Proceedings, 4296: 166-178 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 9th International Conference on Information Security and Cryptology
O®åeg: NOV 30-DEC 01, 2006
O®0W¹p: Busan, SOUTH KOREA
Xd: Controlling access to resources in location-based services and mobile applications require the definition of spatially aware access control systems. However, traditional RBAC model does not specify these requirements. In this paper, we present an extension of the RBAC model to deal with spatial and location-based information, which called LRBAC. In LRBAC, the final permission set of a user depends on the physical location in which a user is situated. The ability to specify the spatial boundary of the role allows LRBAC to be flexible and express a variety of access policies that can provide tight and just-in-time role activation. Besides a real position obtained from a specific mobile terminal, users are also assigned a logical location domain that is application dependent. Then, we extend LRBAC to deal with hierarchies and present how complex spatial role hierarchies in the location-dependent case can be generated by applying Cartesian products as an arithmetic operation over role hierarchies and logical location domain hierarchies.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100049, Peoples R China
¯\O0W@W: Zhang, H, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 20
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-49112-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 13
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BFN06

--------------------------------------------------------------------------------
>f:y 13 agÿqQ 128 ag
\O: Li, Y (Li Yang); Chen, NJ (Chen Ningjiang); Huang, T (Huang Tao)
: Mei, H
h: An event-driven adaptive differentiated service web container architecture
egnúQHrir: QSIC 2006: Sixth International Conference on Quality Software, Proceedings: 22-29 2006
NfNh: International Conference on Quality Software
í: English
e.s{|W: Proceedings Paper
O®h: 6th International Conference on Quality Software
O®åeg: OCT 27-28, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Peking Univ.
\OsQ.Í: event driven; web container architecture; differentiated service
Xd: Web container conforming to J2EE specification is adopted by more and more web servers to provide dynamic content services for internet-based applications. Web applications with complex business require web container to provide differentiated services for requests from different clients according to role or payment etc. However, most traditional web containers still adopt the best-effort service mode. Some approaches such as admission control and priority scheduling have been provided to do with the problem, but they do not solve the problem completely for lack of the considerations in the architecture. This paper brings forward an event-driven adaptive differentiated service web container architecture named EADWA. In EADWA, requests from clients are encapsulated into request events which connect a group of self-management units (SMU) to compose request process flow that is called SMU chain. EADWA provides both SMU-based and SMU chain-based differentiated services for requests from different clients according to SLA (Service Level Agreement) defined by application developer. In addition, SMU-based differentiated services can select proper differentiated service strategies adaptively. The experiments on prototype show the effect of EADWA.
0W@W: Chinese Acad Sci, Inst Software, Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Li, Y, Chinese Acad Sci, Inst Software, Ctr Software Engn, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 15
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 1550-6002
ISBN: 0-7695-2718-3
29 W[&{vegnúQHrir
Tðy)Q: INT CONF QUAL SOFTW
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BFK86

--------------------------------------------------------------------------------
>f:y 14 agÿqQ 128 ag
\O: Xu, ZX (Xu, Zhongxing); Zhang, J (Zhang, Jian)
: Mei, H
h: A test data generation tool for unit testing of C programs
egnúQHrir: QSIC 2006: Sixth International Conference on Quality Software, Proceedings: 107-114 2006
NfNh: International Conference on Quality Software
í: English
e.s{|W: Proceedings Paper
O®h: 6th International Conference on Quality Software
O®åeg: OCT 27-28, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Peking Univ.
\OsQ.Í: test data generation; symbolic execution; pointer operation; unit testing
KeyWords Plus: SYMBOLIC EXECUTION
Xd: This paper describes a prototype tool, called SimC, which automatically generates test data for unit testing of C programs. The tool symbolically simulates the execution of the given program. It simulates pointer operations precisely. This makes it capable of generating test data for programs involving pointer and structure operations. Experiments on real-world programs including the GNU coreutils are presented. Some trade-offs of simulation schemes are also discussed.
0W@W: Chinese Acad Sci, Grad Univ, Inst Software, State Key Lab Comp Sci, Beijing 100864, Peoples R China
¯\O0W@W: Xu, ZX, Chinese Acad Sci, Grad Univ, Inst Software, State Key Lab Comp Sci, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 18
«_!k: 1
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 1550-6002
ISBN: 0-7695-2718-3
29 W[&{vegnúQHrir
Tðy)Q: INT CONF QUAL SOFTW
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BFK86

--------------------------------------------------------------------------------
>f:y 15 agÿqQ 128 ag
\O: Jin, BH (Jin, Beihong); Li, G (Li, Gang); Zhang, L (Zhang, Liang)
: Mei, H
h: Reconstruct the distributed transaction monitor OnceTX
egnúQHrir: QSIC 2006: Sixth International Conference on Quality Software, Proceedings: 393-400 2006
NfNh: International Conference on Quality Software
í: English
e.s{|W: Proceedings Paper
O®h: 6th International Conference on Quality Software
O®åeg: OCT 27-28, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Peking Univ.
\OsQ.Í: distributed transaction monitor; scalability; concurrency control; dynamic configuration; optimization
Xd: Distributed transaction monitor is the fundamental software for critical transactional applications across network. We concern its quality from the point of view of practicality. This paper presents the key technologies during the reconstruction of the distributed transaction monitor OnceTX1.0 to OnceTX2.0, including scalable architecture, multi-phase concurrency control, dynamic configuration and access for system services, and optimization of message organization and processing. OnceTX2.0 is now applicable to not only small-scale and tight-coupling transaction applications, but also geographically dispersed applications with transaction demands. Its performance has also been enhanced, which is proved by the benchmark results. Moreover, extensibility and maintainability are achieved.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Jin, BH, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 1550-6002
ISBN: 0-7695-2718-3
29 W[&{vegnúQHrir
Tðy)Q: INT CONF QUAL SOFTW
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BFK86

--------------------------------------------------------------------------------
>f:y 16 agÿqQ 128 ag
\O: Pu, F (Pu, Fei); Zhang, WH (Zhang, Wenhui)
: Mei, H
h: LTL model checking via search space partition
egnúQHrir: QSIC 2006: Sixth International Conference on Quality Software, Proceedings: 418-425 2006
NfNh: International Conference on Quality Software
í: English
e.s{|W: Proceedings Paper
O®h: 6th International Conference on Quality Software
O®åeg: OCT 27-28, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Peking Univ.
KeyWords Plus: VERIFICATION; PROTOCOLS; SYSTEMS
Xd: The applicability of model checking is often limited by the size of the industrial system. This is known as state space explosion problem. Compositional verification has been particularly successful in this regard. This paper presents an approach based on a refinement of search space partition for reducing the complexity in verification of models with non-deterministic choices and open environment. The refinement depends on the representation of each portion of search space. Especially, search space can be refined stepwise to get better reduction. As reported in the case studies, search space partition improves the efficiency of verification with respect to the requirement of memory and obtains significant advantage over the use of the original one.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Pu, F, Chinese Acad Sci, Inst Software, Comp Sci Lab, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 15
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 1550-6002
ISBN: 0-7695-2718-3
29 W[&{vegnúQHrir
Tðy)Q: INT CONF QUAL SOFTW
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BFK86

--------------------------------------------------------------------------------
>f:y 17 agÿqQ 128 ag
\O: Zhang, Y (Zhang, Yong); Huang, T (Huang, Tao); Wei, J (Wei, Jun); Chen, NJ (Chen, Ningjiang)
: Sacha, K
h: A performance analysis infrastructure for component-based system hos ted by middleware
egnúQHrir: Software Engineering Techniques: Design for Quality, 227: 97-108 2006
NfNh: INTERNATIONAL FEDERATION FOR INFORMATION PROCESSING
í: English
e.s{|W: Proceedings Paper
O®h: IFIP Working Conference on Software Engineering Techniques
O®åeg: OCT 17-20, 2006
O®0W¹p: Warsaw, POLAND
O®^©RFU: IFIP.
KeyWords Plus: PREDICTION; DESIGN; MODELS
Xd: An infrastructure is proposed for automatically modeling the impact of middleware to component-based system at architectural level performance evaluation. The basic ideas behind infrastructure are separation of performance modeling concerns between application and middleware, and declarative performance modeling manner. Taking container style middleware for example, the details of proposed infrastructure are illustrated in this paper, which are well-founded on other existing and proven approaches, such as UML Profile for Schedulability, Performance and Time (UML SPT profile) and Layered Queueing Network performance model generation techniques. To validate proposed infrastructure, a case study is conducted.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, Y, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 20
«_!k: 1
úQHrFU: SPRINGER
úQHrFU0W@W: 233 SPRING STREET, NEW YORK, NY 10013, UNITED STATES
ISSN: 1571-5736
ISBN: 0-387-39387-0
29 W[&{vegnúQHrir
Tðy)Q: INT FED INFO PROC
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Information Systems; Computer Science, Theory & Methods
ISI e.s O÷S: BFJ43

--------------------------------------------------------------------------------
>f:y 18 agÿqQ 128 ag
\O: Guan, HQ (Guan, Heqing); Wan, SC (Wan, ShuChao); Wei, J (Wei, Jun)
: Chi, CH; Bastani, F; Xue, XY
h: Jenova: New approach on concurrency control in web service transaction management
egnúQHrir: SOSE 2006: Second IEEE International Symposium on Service-Oriented System Engineering, Proceedings: 134-140 2006
í: English
e.s{|W: Proceedings Paper
O®h: 2nd IEEE International Symposium on Service-Oriented System Engineering
O®åeg: OCT 25-26, 2006
O®0W¹p: Shanghai, PEOPLES R CHINA
O®^©RFU: IEEE Comp Soc TCEC.
Xd: The existed web service transaction (WST) models and protocols depend too much on web service providers when solving concurrent conflicts or performing rollback, which make individual service providers bear big burden, and the cost for rolling back a WST may be very high. In this paper, we present a novel concurrency control mechanism named Jenova, which incorporates two enhancements to support WSTs: nested transactions and admission control. Jenova can provide a higher degree of concurrency for WSTs and the cost of rollback can be greatly decreased The prototypal framework on the J2EE platform and the experiments prove the efficiency of the mechanism.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Guan, HQ, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 17
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2726-4
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BFL14

--------------------------------------------------------------------------------
>f:y 19 agÿqQ 128 ag
\O: Qing, SH (Qing, Sihan); Shen, QN (Shen, Qingni); Ji, QG (Ji, Qingguang); He, YP (He, Yeping)
fNM|âVSO\O: IEEE
h: A dynamically modified privilege control policy
egnúQHrir: 2006 IEEE Information Assurance Workshop: 340-347 2006
í: English
e.s{|W: Proceedings Paper
O®h: 7th Annual IEEE Information Assurance Workshop
O®åeg: JUN 21-23, 2006
O®0W¹p: W Point, NY
\OsQ.Í: access control; capability inheritance algorithm; computer security; least privilege
Xd: Trusted systems typically include trusted processes which possess special privileges. Such privileges can circumvent certain security checks but should be used in a controlled manner. This paper proposes a privilege control policy called DMPC (Dynamically Modified Privilege Control). It has two components: a hybrid privilege control model and a new POSIX (Port-able Operating System Interface) capability inheritance algorithm. The privilege control model in DMPC is a combination of Role Based Access Control (RBAC), Domain and Type Enforcement (DTE) and POSIX capability mechanism while the capability inheritance algorithm serves as an engine to effectively enforce the hybrid privilege control model on a secure operating system. The DMPC's design has given a high priority to supporting least privilege to a finer level of granularity on trusted systems. Additional (sub-) goals for the DMPC policy are: realizing separation of duties among privileged users, achieving separation of trusted functions from untrusted ones and providing a flexible and dynamically mediated capability mechanism. We show that RBAC alone is insufficient to enforce the principle of least privilege in a dynamic context, and that DTE and POSIX capability mechanism can successfully be conjugated with RBAC for this purpose. We also describe an implementation of the DMPC policy on a real system and report on experimental results.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Qing, SH, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-0129-1
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BFR98

--------------------------------------------------------------------------------
>f:y 20 agÿqQ 128 ag
\O: Shen, JJ (Shen, Jianjun); Qing, SH (Qing, Sihan); Shen, QN (Shen, Qingni)
fNM|âVSO\O: IEEE
h: Design of a micro-kernel based secure system architecture
egnúQHrir: 2006 IEEE Information Assurance Workshop: 384-385 2006
í: English
e.s{|W: Proceedings Paper
O®h: 7th Annual IEEE Information Assurance Workshop
O®åeg: JUN 21-23, 2006
O®0W¹p: W Point, NY
Xd: We describe the Trium secure system architecture. It is based on Fiasco - an implementation of the L4 microkernel interface - and LAEnv - a programming environment for 1.4 systems. Compared to previous work on microkernel based secure systems, such as TMach and DTOS, Trium tries to minimize the trusted computing base (TCB) of a secure system by moving most functions of an operating system (OS) out of the TCB, and it emphasizes on the reuse of legacy software. We also try to achieve better isolation, privilege control and flexible configuration of system components taking advantage of the specific features of the L4 microkernel as a second generation microkernel.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Shen, JJ, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 4
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-0129-1
egne.sux¡pe: 2
f[Ñy{|+R: Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BFR98

--------------------------------------------------------------------------------
>f:y 21 agÿqQ 128 ag
\O: Liu, LX (Liu, Lixiang); Zhao, JS (Zhao, Junsuo); Zhang, WJ (Zhang, Wenjun); Xu, FJ (Xu, Fanjiang)
: Sun, F; Liu, HP
h: A new congestion control model based on fuzzy neural networks
egnúQHrir: 2006 IMACS: Multiconference on Computational Engineering in Systems Applications, Vols 1 and 2: 223-230 2006
í: English
e.s{|W: Proceedings Paper
O®h: IMACS Multiconference on Computational Engineering in Systems Applications (CESA 2006)
O®åeg: OCT 04-06, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: IMACS.; IEEE SMC Soc.; Tsinghua Univ.; Ecole Centrale Lille.; Ecole Natl Superieure Arts & Ind Textiles.; Natl Nat Sci Fdn China.
\OsQ.Í: P2P; congestion control; fuzzy neural networks (FNNs)
KeyWords Plus: TIME-SERIES; SYSTEM
Xd: In this paper, a new congestion control model based on fuzzy neural networks (FNNs) is proposed for P2P network, which considers the practical status of data buffer and P2P traffic. The proposed model divides buffer into two queues which store P2P data packets and non-P2P data packets respectively. It predicts and evaluates conditions of buffer queues through FNN, and directs space allocation of each queue through constructing an evaluation function. Thus, this model is able to control congestion condition of each queue and resize allocation of queues in the buffer automatically, and then it can avoid lock-out of the buffer by dropping packets actively before the buffer is overflow. Simulation results show the model is good both ensuring equitable network resource allocation and decreasing the delay of packet queuing and the dropping ratio, thus improving the ability of routers in dealing with network congestion.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Liu, LX, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: TSINGHUA UNIVERSITY PRESS
úQHrFU0W@W: TSINGHUA UNIVERSITY HAIDIANQU, BEIJING 100084, PEOPLES R CHINA
ISBN: 978-7-302-13922-5
egne.sux¡pe: 8
f[Ñy{|+R: Automation & Control Systems; Computer Science, Artificial Intelligence; Computer Science, Interdisciplinary Applications; Telecommunications
ISI e.s O÷S: BFR75

--------------------------------------------------------------------------------
>f:y 22 agÿqQ 128 ag
\O: Zheng, G (Zheng, Gang); Zeng, WL (Zeng, Wenli); Xu, FJ (Xu, Fanjiang)
: Sun, F; Liu, HP
h: Design on the optimal feedback control law of networked control systems with multiple switching modes
egnúQHrir: 2006 IMACS: Multiconference on Computational Engineering in Systems Applications, Vols 1 and 2: 564-569 2006
í: English
e.s{|W: Proceedings Paper
O®h: IMACS Multiconference on Computational Engineering in Systems Applications (CESA 2006)
O®åeg: OCT 04-06, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: IMACS.; IEEE SMC Soc.; Tsinghua Univ.; Ecole Centrale Lille.; Ecole Natl Superieure Arts & Ind Textiles.; Natl Nat Sci Fdn China.
\OsQ.Í: networked control systems; hybrid systems; optimal control; dynamic program; multiparametric program
Xd: The networked control systems with multiple switching modes in high speed local area network environment are modeled as a hybrid system and the corresponding optimal control problem is addressed, where initial state is a parametric vector. Moreover, a dynamic program technique is proposed, in every step of the technique, the feasible region is divided into evenly distributed grid points, the solution to the optimal control law is to maximize the lower bound of the cost function in grid points of the feasible region, which is mainly based on the Bellman type inequality. Finally, an example is given to illustrate the optimal computation results.
0W@W: Chinese Acad Sci, Natl Key Lab Integrated Informat Syst Technol, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zheng, G, Chinese Acad Sci, Natl Key Lab Integrated Informat Syst Technol, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: TSINGHUA UNIVERSITY PRESS
úQHrFU0W@W: TSINGHUA UNIVERSITY HAIDIANQU, BEIJING 100084, PEOPLES R CHINA
ISBN: 978-7-302-13922-5
egne.sux¡pe: 6
f[Ñy{|+R: Automation & Control Systems; Computer Science, Artificial Intelligence; Computer Science, Interdisciplinary Applications; Telecommunications
ISI e.s O÷S: BFR75

--------------------------------------------------------------------------------
>f:y 23 agÿqQ 128 ag
\O: Zheng, CW (Zheng, Changwen); Xu, FJ (Xu, Fanjiang); Hu, XH (Hu, Xiaohui); Sun, FC (Sun, Fuchun); Yan, P (Yan, Ping)
: Sun, F; Liu, HP
h: Online route planner for unmanned air vehicle navigation in unknown battlefield environment
egnúQHrir: 2006 IMACS: MULTICONFERENCE ON COMPUTATIONAL ENGINEERING IN SYSTEMS APPLICATIONS, VOLS 1 AND 2: 814-818 2006
í: English
e.s{|W: Proceedings Paper
O®h: IMACS Multiconference on Computational Engineering in Systems Applications (CESA 2006)
O®åeg: OCT 04-06, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: IMACS.; IEEE SMC Soc.; Tsinghua Univ.; Ecole Centrale Lille.; Ecole Natl Superieure Arts & Ind Textiles.; Natl Nat Sci Fdn China.
\OsQ.Í: route planning; 3-D route; online; navigation; unmanned air vehicle (UAV)
KeyWords Plus: ALGORITHM
Xd: In this paper, the problem of on-line route planning problem of unmanned air vehicle is discussed with the proposal of a new real-time planner. By interleaving route planning with the flying of the vehicle, our algorithm can adjust the time of search and meet for the requirements of real-time in-flight applications. With more search time, the planner can enhance the performance of the resultant routes effectively and steer clear of the threat area successfully. The experimental results illustrated that our algorithm can take into account different kinds of mission constraints and generate desired solutions in real-time.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zheng, CW, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: TSINGHUA UNIVERSITY PRESS
úQHrFU0W@W: TSINGHUA UNIVERSITY HAIDIANQU, BEIJING 100084, PEOPLES R CHINA
ISBN: 978-7-302-13922-5
egne.sux¡pe: 5
f[Ñy{|+R: Automation & Control Systems; Computer Science, Artificial Intelligence; Computer Science, Interdisciplinary Applications; Telecommunications
ISI e.s O÷S: BFR75

--------------------------------------------------------------------------------
>f:y 24 agÿqQ 128 ag
\O: Yan, P (Yan, Ping); Zheng, CW (Zheng, Changwen)
: Sun, F; Liu, HP
h: Evolutionary tabu search in task allocation of unmanned aerial vehicles
egnúQHrir: 2006 IMACS: Multiconference on Computational Engineering in Systems Applications, Vols 1 and 2: 932-938 2006
í: English
e.s{|W: Proceedings Paper
O®h: IMACS Multiconference on Computational Engineering in Systems Applications (CESA 2006)
O®åeg: OCT 04-06, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: IMACS.; IEEE SMC Soc.; Tsinghua Univ.; Ecole Centrale Lille.; Ecole Natl Superieure Arts & Ind Textiles.; Natl Nat Sci Fdn China.
\OsQ.Í: UAV; task allocation; evolutionary computation; tabu search
Xd: This paper addresses the problem of task allocation problem for a fleet of unmanned aerial vehicles (AVs). An evolutionary tabu search (TS) algorithm is proposed to search the optimal solution to the task allocation problem. In this algorithm, TS serves, as the mutation operator in evolutionary algorithm. Evolutionary computation (EC) gives appropriate initial value and TS helps to find a better solution. In order to meet the requirements of task reallocation in dynamic environment, a partially regroup strategy based on K-mean clustering is employed to find the new solutions in real time while keeping the optimality of results. Our algorithm incorporates domain-specific knowledge and takes into account different kinds of mission constraints. Simulation results validate the feasibility and efficiency of our algorithm.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Yan, P, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 13
«_!k: 0
úQHrFU: TSINGHUA UNIVERSITY PRESS
úQHrFU0W@W: TSINGHUA UNIVERSITY HAIDIANQU, BEIJING 100084, PEOPLES R CHINA
ISBN: 978-7-302-13922-5
egne.sux¡pe: 7
f[Ñy{|+R: Automation & Control Systems; Computer Science, Artificial Intelligence; Computer Science, Interdisciplinary Applications; Telecommunications
ISI e.s O÷S: BFR75

--------------------------------------------------------------------------------
>f:y 25 agÿqQ 128 ag
\O: Fu, Y (Fu, Yong); Wang, HG (Wang, Hongan); Lu, CY (Lu, Chenyang); Chandra, RS (Chandra, Ramu Sharat)
fNM|âVSO\O: IEEE COMPUTER SOC
h: Distributed utilization control for real-time clusters with load balancing
egnúQHrir: 27TH IEEE INTERNATIONAL REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS: 137-146 2006
NfNh: REAL-TIME SYSTEMS SYMPOSIUM - PROCEEDINGS
í: English
e.s{|W: Proceedings Paper
O®h: 27th IEEE International Real-Time Systems Symposium
O®åeg: DEC 05-08, 2006
O®0W¹p: Rio de Janeiro, BRAZIL
O®^©RFU: IEEE.
KeyWords Plus: SYSTEMS; ALGORITHMS; DESIGN
Xd: Recent years have seen rapid growth of online services that rely on large-scale server clusters to handle high volume of requests. Such clusters must adaptively control the CPU utilizations of many processors in order to maintain desired soft real-time performance and prevent system overload in face of unpredictable workloads. This paper presents DUC-LB, a novel distributed utilization control algorithm for cluster-based soft real-time applications. Compared to earlier works on utilization control, a distinguishing feature of DUC-LB is its capability to handle system dynamics caused by load balancing, which is a common and essential component of most clusters today. Simulation results and control-theoretic analysis demonstrate that DUC-LB can provide robust utilization control and effective load balancing in large-scale clusters.
0W@W: Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100864, Peoples R China
¯\O0W@W: Fu, Y, Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 37
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 1052-8725
ISBN: 978-0-7695-2761-1
29 W[&{vegnúQHrir
Tðy)Q: REAL TIM SYST SYMP PROC
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Hardware & Architecture
ISI e.s O÷S: BFS94

--------------------------------------------------------------------------------
>f:y 26 agÿqQ 128 ag
\O: Li, J (Li Jian); Jin, BH (Jin Beihong)
: Gelbukh, A; Guerra, SS
h: Query division and reformullation in ontology-based heterogeneous information integration
egnúQHrir: CIC 2006: 15th International Conference on Computing, Proceedings: 186-193 2006
í: English
e.s{|W: Proceedings Paper
O®h: 15th International Conference on Computing
O®åeg: NOV 21-24, 2006
O®0W¹p: Mexico City, MEXICO
Xd: People could obtain information from heterogeneous data resources by semantic querying based on ontologies. In ontology-based heterogeneous information integration, dividing and reformulating a global query for ontology concepts' instances into multiple sub-queries over those local information sources is a fundamental challenge. This paper presents a kind of uniform expression for concept instances' queries and a method to divide the global query into local ones. All local query results could be integrated as answers of the global query according to the integration expression got by query division.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Li, J, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 978-0-7695-2708-6
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BFR78

--------------------------------------------------------------------------------
>f:y 27 agÿqQ 128 ag
\O: Feng, WL (Feng, Wenlan); Zhang, L (Zhang, Liang); Jin, BH (Jin, Beihong); Fan, ZH (Fan, Zhihua)
: Tsai, WT; Chung, JY; Younas, M
h: Context-aware caching for wireless Internet applications
egnúQHrir: ICEBE 2006: IEEE INTERNATIONAL CONFERENCE ON E-BUSINESS ENGINEERING, PROCEEDINGS: 450-455 2006
NfNh: International Conference on e-Business Engineering
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on e-Business Engineering
O®åeg: OCT 24-26, 2006
O®0W¹p: Shanghai, PEOPLES R CHINA
O®^©RFU: IEEE Comp Soc, TCEC.
Xd: The recent advances in wireless networking technologies and the growing success of mobile computing devices, such as PDA, pocket PC and third generation mobile phone, are enabling new classes of applications that present challenging problems to designers. The intrinsic constraints from limited device resources andfirequent mobile disconnections cause that wireless applications can not be working smoothly as those in the traditional wired internet. Context-aware caching is a suitable approach to improve the quality of services in wireless applications. In this paper, we describe a context model, by which all contexts is divided into three categories as sensed, defined and derived. For the context prediction and selection in caching, we propose a weight-based data hoarding algorithm to select or update cached data objects. Two applications are introduced throughout in this paper to illustrate effectiveness of context-aware caching.
0W@W: Chinese Acad Sci, Inst Software, Tecnol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Feng, WL, Chinese Acad Sci, Inst Software, Tecnol Ctr Software Engn, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 1
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 978-0-7695-2645-4
29 W[&{vegnúQHrir
Tðy)Q: INT CONF E BUS ENGINEERING
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Interdisciplinary Applications
ISI e.s O÷S: BFQ40

--------------------------------------------------------------------------------
>f:y 28 agÿqQ 128 ag
\O: Song, JY (Song, Jingyu); Wei, J (Wei, Jun); Wan, SC (Wan, Shuchao); Zhong, H (Zhong, Hua)
: Tsai, WT; Chung, JY; Younas, M
h: A presentation feature based approach to improving interactive web service discovery in web portals
egnúQHrir: ICEBE 2006: IEEE INTERNATIONAL CONFERENCE ON E-BUSINESS ENGINEERING, PROCEEDINGS: 563-570 2006
NfNh: International Conference on e-Business Engineering
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on e-Business Engineering
O®åeg: OCT 24-26, 2006
O®0W¹p: Shanghai, PEOPLES R CHINA
O®^©RFU: IEEE Comp Soc, TCEC.
Xd: Presentation level integration now becomes an important and fast growing trend in enterprise computing and portal-based composite applications are the mainstream to realize it. Such applications use portlet and interactive web service, which usually offers several portlets, as their basic constituents. Hence, portlet description and discovery are the key issues that have to be considered. This paper proposes a novel concept POI (Presentation Oriented Interface) to describe the presentation features of a portlet, so that interactive web services may be extended to facilitate the selection and interoperation of portlets. Interactive web services discovery can be effectively achieved based on the calculation of POI similarity that considers both type and structure similarity. Experiments show that the proposed approach can improve the satisfaction of service discovery, thereby achieving better application integration at presentation level.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Song, JY, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 13
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 978-0-7695-2645-4
29 W[&{vegnúQHrir
Tðy)Q: INT CONF E BUS ENGINEERING
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Interdisciplinary Applications
ISI e.s O÷S: BFQ40

--------------------------------------------------------------------------------
>f:y 29 agÿqQ 128 ag
\O: Cui, XL (Cui, Xiaoling); Li, L (Li, Lei); Wei, J (Wei, Jun)
: OConner, L
h: A novel SOAP attachment-oriented security model
egnúQHrir: ISSRE 2006:17th International Symposium on Software Reliability Engineering, Proceedings: 127-135 2006
í: English
e.s{|W: Proceedings Paper
O®h: 17th International Symposium on Software Reliability Engineering
O®åeg: NOV 07-10, 2006
O®0W¹p: Raleigh, NC
O®^©RFU: IEEE Comp Soc.; IEEE Comp Soc Tech Council Software Engn.; IEEE Reliab Soc.
Xd: Security is playing an increasingly important role in nowadays business. However at present there isn't an effective method to secure SOAP attachments. This paper proposes a novel security model for SOAP attachments, which encrypts the attachments and provides digital signature without changing clients and servers implementations. In the multi-intermediaries scenario, the whole message is divided into two parts and sent respectively: the primary part goes through as the original message path via intermediaries, while the attachments are sent directly from client to server via no intermediary. Therefore, it improves the efficiency of services and reduces the probability of the attachments' being attacked. A prototype of this security model is implemented on the Web application server and the experiment results show the feasibility of secure attachments in enterprise applications.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Cui, XL, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 4
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 978-0-7695-2684-3
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BFR93

--------------------------------------------------------------------------------
>f:y 30 agÿqQ 128 ag
\O: Zuo, L (Zuo, Lin); Liu, SH (Liu, Shaohua); Wei, J (Wei, Jun)
: OConner, L
h: Combining replication with transaction processing for enhanced reliability in J2EE
egnúQHrir: ISSRE 2006:17th International Symposium on Software Reliability Engineering, Proceedings: 279-288 2006
í: English
e.s{|W: Proceedings Paper
O®h: 17th International Symposium on Software Reliability Engineering
O®åeg: NOV 07-10, 2006
O®0W¹p: Raleigh, NC
O®^©RFU: IEEE Comp Soc.; IEEE Comp Soc Tech Council Software Engn.; IEEE Reliab Soc.
KeyWords Plus: 3-TIER ARCHITECTURES; SYSTEMS
Xd: The multi-tier architecture of J2EE provides good modularity and scalability by partitioning an application into several tiers, and becomes the mainstream for distributed applications development on Internet/Intranet. Current reliability solutions in this architecture are typically dependent on either replication, which provides at-least-once guarantee, or transaction processing, which guarantees at-most-once semantics. In practice, the end-to-end reliability guarantee of exactly-once semantics is necessary, especially for some complex transaction scenarios, such as client transaction or nested transaction. In this paper, we describe a fault-tolerant algorithm that can provide this enhanced reliability support through combining replication and transaction processing. We use passive replication to protect business processing at middle-tier application server. A client stub transparently intercepts client request and automatically resubmits it in the case of failure. In addition, transaction coordinator is passively replicated to prevent the blocking problem of distributed transaction. Also, different application scenarios are discussed to illustrate the effectivity of this algorithm, and a performance study based on our implementation in J2EE application server, OnceAS, shows the overhead of it is acceptable.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Zuo, L, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 23
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 978-0-7695-2684-3
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BFR93

--------------------------------------------------------------------------------
>f:y 31 agÿqQ 128 ag
\O: Xu, J (Xu, Jin); Wu, ZM (Wu, Zhimei)
fNM|âVSO\O: IEEE
h: Joint adaptive intra refreshment and unequally error protection algorithms for robust transmission of H.264/AVC video
egnúQHrir: 2006 IEEE International Conference on Multimedia and Expo - ICME 2006, Vols 1-5, Proceedings: 693-696 2006
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on Multimedia and Expo (ICME 2006)
O®åeg: JUL 09-12, 2006
O®0W¹p: Toronto, CANADA
O®^©RFU: IEEE.; IEEE Circuits & Syst Soc.; IEEE Commun Soc.; IEEE Comp Soc.; IEEE Signal Proc Soc.
KeyWords Plus: MODE SELECTION
Xd: In this paper, we propose an efficient intra refreshment algorithm, which can achieve both the global optimization in determining the intra refreshing ratio and the local accuracy in selecting the proper, macroblocks to be intracoded before the current frame is actually encoded. Furthermore, incorporated with our proposed intra refreshment algorithm, an effective UEP scheme based on a dynamic FMO mapping mode is also proposed in this paper to better protect the intra macroblocks in a frame. The experimental results show that our joint intra refreshment and UEP algorithm can remarkably improve the reconstructed video quality in the packet lossy network.
0W@W: Chinese Acad Sci, Inst Software, Multimedia Commun Res Ctr, Beijing 100080, Peoples R China
¯\O0W@W: Xu, J, Chinese Acad Sci, Inst Software, Multimedia Commun Res Ctr, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 6
«_!k: 1
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-0366-0
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Imaging Science & Photographic Technology; Telecommunications
ISI e.s O÷S: BFY01

--------------------------------------------------------------------------------
>f:y 32 agÿqQ 128 ag
\O: Zhang, B (Zhang, Bin); Feng, DG (Feng, Dengguo)
fNM|âVSO\O: IEEE
h: A new variant of the self-shrinking generator
egnúQHrir: 2006 IEEE International Symposium on Information Theory, Vols 1-6, Proceedings: 1619-1622 2006
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Symposium on Information Theory
O®åeg: JUL 09-14, 2006
O®0W¹p: Seattle, WA
O®^©RFU: IEEE Informat Theory Soc.; USN, Dept Navy Sci & Technol.; Microsoft.; Natl Sci Fdn.
KeyWords Plus: KEYSTREAM GENERATORS; ALGEBRAIC ATTACKS; LINEAR FEEDBACK; STREAM CIPHERS; CRYPTANALYSIS
Xd: In this paper, we present a new variant of the self-shrinking generator (SSG). The new construction inherits the conceptual simplicity and indispensable security properties of the SSG and all the known attacks on the SSG can be frustrated by the new model. Besides, its keystream has ideal run distribution and the flexibility of the new construction allows for efficient practical implementations at a large scale.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing, Peoples R China
¯\O0W@W: Zhang, B, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-0505-3
egne.sux¡pe: 4
f[Ñy{|+R: Telecommunications
ISI e.s O÷S: BFX53

--------------------------------------------------------------------------------
>f:y 33 agÿqQ 128 ag
\O: Yuan, PJ (Yuan, Peijiang)
fNM|âVSO\O: IEEE
h: An adaptive feedback scheduling algorithm for robot assembly and real-time control systems
egnúQHrir: 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems, Vols 1-12: 2226-2231 2006
í: English
e.s{|W: Proceedings Paper
O®h: IEEE/RSJ International Conference on Intelligent Robots and Systems
O®åeg: OCT 09-13, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: IEEE.; RSJ.
KeyWords Plus: IMPEDANCE CONTROL; MANIPULATORS; SIMULATION
Xd: In this paper, we present an adaptive feedback controller for nonlinear multi-robot systems with unknown execution times and task dependencies. An adaptive self-tuning PID controller is discussed. A real-time force/torque leading controller for industrial multi-robot cooperation is addressed. Previously reported impedance control and hybrid control approaches are reviewed. Trajectory and velocity following issues for industrial manipulators are considered by using an error-reduction admittance control method. A number of experiments are presented. Experimental results show that this adaptive feedback controller can be used in industrial multi-robot coordination and force-guided assembly. With the proposed adaptive feedback scheduling algorithm, the system performance and the deadline miss ratio can be improved compared with the traditional feedback scheduling algorithm.
0W@W: Univ Western Ontario, Dept Elect & Comp Engn, London, ON N6A 5B8, Canada; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Yuan, PJ, Univ Western Ontario, Dept Elect & Comp Engn, London, ON N6A 5B8, Canada.
_(uvÂSe.spe: 17
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-0258-8
egne.sux¡pe: 6
f[Ñy{|+R: Automation & Control Systems; Computer Science, Artificial Intelligence; Robotics
ISI e.s O÷S: BFY57

--------------------------------------------------------------------------------
>f:y 34 agÿqQ 128 ag
\O: Liu, S (Liu, Sheng); Zhang, J (Zhang, Jian)
fNM|âVSO\O: IEEE COMPUTER SOC
h: Retrieving and matching RDF graphs by solving the satisfiability problem*
egnúQHrir: 2006 IEEE/WIC/ACM International Conference on Web Intelligence, (WI 2006 Main Conference Proceedings): 510-513 2006
í: English
e.s{|W: Proceedings Paper
O®h: IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT 2006)
O®åeg: DEC 18-22, 2006
O®0W¹p: Hong Kong, PEOPLES R CHINA
O®^©RFU: IEEE.; WIC.; ACM.
Xd: The Resource Description Framework (RDF) has been accepted as a standard for semantic representation of resources. Efficient methods and tools are needed to solve problems emerging from RDF based systems, for example, checking equality of two RDF graphs and retrieving subgraphs from another RDF graph. This paper proposes a method that encodes these problems into satisfiability (SAT) instances and solves them by employing efficient SAT solvers. A prototype tool is implemented and preliminary experimental results are given.
0W@W: Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Liu, S, Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 978-0-7695-2747-5
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems
ISI e.s O÷S: BFY84

--------------------------------------------------------------------------------
>f:y 35 agÿqQ 128 ag
\O: Wang, XL (Wang, Xiuli); Wang, YJ (Wang, Yongji); Zhou, H (Zhou, Hui)
fNM|âVSO\O: IEEE COMPUTER SOC
h: QSCM: Engineering QoS in web-based software configuration management system
egnúQHrir: 2006 IEEE/WIC/ACM International Conference on Web Intelligence, (WI 2006 Main Conference Proceedings): 1050-1053 2006
í: English
e.s{|W: Proceedings Paper
O®h: IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT 2006)
O®åeg: DEC 18-22, 2006
O®0W¹p: Hong Kong, PEOPLES R CHINA
O®^©RFU: IEEE.; WIC.; ACM.
Xd: The conventional Software Configuration Management (SCM) tools have shown their weakness in large and complex software systems with the development of modern software. This paper provides a better SCM tool with high availability to facilitate software development process. A novel approach named Quality of Service (QoS)-based SCM (QSCM) is presented, which introduces QoS guarantee techniques at the application level to web-based SCM system in order to improve SCM system's performance. QSCM classifies users together with SCM activities and treats with requests according to their priority. When the server is overloaded it stops treatment with new requests so that to avoid from crash. The work described here is a first step towards this goal.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Wang, XL, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 978-0-7695-2747-5
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems
ISI e.s O÷S: BFY84

--------------------------------------------------------------------------------
>f:y 36 agÿqQ 128 ag
\O: Wang, XL (Wang, Xiuli); Wang, YJ (Wang, Yongji); Zhou, H (Zhou, Hui); Huai, XY (Huai, Xiaoyong)
fNM|âVSO\O: IEEE
h: PSO-PID: A novel controller for AQM routers
egnúQHrir: 2006 IFIP International Conference on Wireless and Optical Communications Networks: 746-750 2006
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Wireless and Optical Communications Networks
O®åeg: APR 11-13, 2006
O®0W¹p: Bangalore, INDIA
O®^©RFU: IFIP.; IEEE.
KeyWords Plus: ACTIVE QUEUE MANAGEMENT; ALGORITHM
Xd: This paper presents an improved TCP/Active Queue Management (AQM) model and a novel AQM control system, called Particle Swarm Optimization (PSO) -Proportional-Integral-Differential (PID) controller, under large-delay network situations. First, we present the improved model including the delay term ignored by the previous simplified version. Using this model, we next design an AQM router applying PSO to tune efficiently the PID controller parameters. A simulation study shows that the PSO-PID controller controls congestion effectively and predictively and outperforms the Random Early Detection (RED) and Proportional-Integral (PI) algorithms in terms of the packet loss rate, the link utilization, and so on.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Wang, XL, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 23
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-0339-4
egne.sux¡pe: 5
f[Ñy{|+R: Telecommunications
ISI e.s O÷S: BFW71

--------------------------------------------------------------------------------
>f:y 37 agÿqQ 128 ag
\O: Zhang, B (Zhang, Bin); Feng, DG (Feng, Dengguo)
: Lai, XJ; Chen, K
h: New guess-and-determine attack on the self-shrinking generator
egnúQHrir: Advances in Cryptology - ASIACRYPT 2006, 4284: 54-68 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 12th International Conference on the Theory of Application of Cryptology and Information Security
O®åeg: DEC 03-07, 2006
O®0W¹p: Shanghai, PEOPLES R CHINA
O®^©RFU: Int Assoc Cryptol Res.; Chinese Acad Sci, State Key Lab Informat Secur.; Lab Cryptog & Informat Secur.; Shanghai Jiao Tong Univ.; Nat Sci Fdn China.
\OsQ.Í: stream cipher; self-shrinking; guess-and-determine; linear feedback shift register (LFSR)
KeyWords Plus: STREAM CIPHERS; ALGEBRAIC ATTACKS; LINEAR FEEDBACK; CRYPTANALYSIS; COMPLEXITY
Xd: We propose a new type of guess-and-determine attack on the self-shrinking generator (SSG). The inherent flexibility of the new attack enables us to deal with different attack conditions and requirements smoothly. For the SSG with a length L LFSR of arbitrary form, our attack can reliably restore the initial state with time complexity O(2(0.556L)), memory complexity O(L-2) from O(2(0.161L))-bit keystream for L >= 100 and time complexity O(2(0.571L)), memory complexity O(L-2) from O(2(0.194L))-bit keystrearn for L < 100. Therefore, our attack is better than all the previously known attacks on the SSG and especially, it compares favorably with the time/memory/data tradeoff attack which typically has time complexity O(2(0.5L)), memory complexity O(2(0.5L)) and data complexity O(2(0.25L))-bit keystream after a pre-computation phase of complexity O(2(0.75L)). It is well-known that one of the open research problems in stream ciphers specified by the European STORK (Strategic Roadmap for Crypto) project is to find an attack on the self-shrinking generator with complexity lower than that of a generic time/memory/data tradeoff attack. Our result is the best answer to this problem known so far.
0W@W: Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, B, Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 31
«_!k: 2
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 978-3-540-49475-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 15
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BFU40

--------------------------------------------------------------------------------
>f:y 38 agÿqQ 128 ag
\O: Yue, WY (Yue, Weiya); Xu, YY (Xu, Yanyan); Su, KL (Su, Kaile)
: Sattar, A; Kang, BH
h: BDDRPA*: An efficient BDD-based incremental heuristic search algorithm for replanning
egnúQHrir: AI 2006: Advances in Artificial Intelligence, Proceedings, 4304: 627-636 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 19th Australian Joint Conference on Artificial Intelligence
O®åeg: DEC 04-08, 2006
O®0W¹p: Hobart, AUSTRALIA
KeyWords Plus: SHORTEST; TREES
Xd: We introduce a new algorithm, BDDRPA*, which is an efficient BDD-based incremental heuristic search algorithm for replanning. BDDRPA* combines the incremental heuristic search with BDD-based search to efficiently solve replanning search problems in artificial intelligence. We do a lot of experiments and our experiment evaluation proves BDDRPA* to be a powerful incremental search algorithm. BDDRPA* outperforms breadth-first search by several orders of magnitude for huge size search problems. When the changes to the search problems are small, BDDRPA* needs less runtime by reusing previous information, and even when the changes reach to 20 percent of the size of the problems, BDDRPA* still works more efficiently.
0W@W: Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing, Peoples R China
¯\O0W@W: Su, KL, Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 978-3-540-49787-5
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BFV69

--------------------------------------------------------------------------------
>f:y 39 agÿqQ 128 ag
\O: Wang, LM (Wang, Liming); Wu, CK (Wu, Chuan-Kun)
: Pointcheval, D; Mu, Y; Chen, K
h: Authenticated group key agreement for multicast
egnúQHrir: Cryptology and Network Security, Proceedings, 4301: 55-72 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 5th International Conference on Cryptology and Network Security
O®åeg: DEC 08-10, 2006
O®0W¹p: Suzhou, PEOPLES R CHINA
O®^©RFU: Int Assoc Cryptol Res.; Shanghai JiaoTong Univ.; Natl Nat Sci Fdn China.
KeyWords Plus: IDENTITY-BASED ENCRYPTION; CRYPTOSYSTEMS; MANAGEMENT; PAIRINGS; TREE
Xd: Secure multicast communication provides an efficient way to deliver data to a large group of recipients. Scalability, efficiency and authenticity are the key challenges for secure multicast. In this paper, we propose a novel group key agreement scheme called logical identity hierarchy(LIH) for multicast to support secure communications for large and dynamic groups, which is based on bilinear pairing. Compared with the previous tree-based schemes, LIH provides dual authentication between group controller(GC) and group members and hierarchical authentication among group members. GC and all the users do not need to execute any encryption/ decrypt ion process during the rekeying operation. Moreover, in LIH, the group members can be stateless receivers, who do not need to update their state during the protocol execution. Using a public board, CC does not need to multicast any rekeying message when a user joins/leaves the communication group. Security analysis shows that LIH satisfies both backward secrecy and forward secrecy.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Wang, LM, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 34
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 978-3-540-49462-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 18
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BFU73

--------------------------------------------------------------------------------
>f:y 40 agÿqQ 128 ag
\O: Zhou, SJ (Zhou, Sujing); Lin, DD (Lin, Dongdai)
: Pointcheval, D; Mu, Y; Chen, K
h: Shorter verifier-local revocation group signatures from bilinear maps
egnúQHrir: Cryptology and Network Security, Proceedings, 4301: 126-143 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 5th International Conference on Cryptology and Network Security
O®åeg: DEC 08-10, 2006
O®0W¹p: Suzhou, PEOPLES R CHINA
O®^©RFU: Int Assoc Cryptol Res.; Shanghai JiaoTong Univ.; Natl Nat Sci Fdn China.
\OsQ.Í: LRSW assumption; group signature; verifier-local revocation; bilinear map
KeyWords Plus: ANONYMOUS CREDENTIALS; EFFICIENT; SCHEMES; SECURE; ACCUMULATORS; PAIRINGS
Xd: We propose a new computational complexity assumption from bilinear map, based on which we construct Verifier-Local Revocation group signatures with shorter lengths than previous ones.
0W@W: Chinese Acad Sci, Inst Software, SKLOIS Lab, Beijing, Peoples R China
¯\O0W@W: Zhou, SJ, Chinese Acad Sci, Inst Software, SKLOIS Lab, Beijing, Peoples R China.
_(uvÂSe.spe: 28
«_!k: 4
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 978-3-540-49462-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 18
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BFU73

--------------------------------------------------------------------------------
>f:y 41 agÿqQ 128 ag
\O: Ma, JG (Ma, JianGang); Xu, G (Xu, Gang); Wang, JL (Wang, JinLing); Huang, T (Huang, Tao)
fNM|âVSO\O: IEEE
h: A semantic publish/subscribe system for selective dissemination of the RSS documents
egnúQHrir: GCC 2005: Fifth International Conference on Grid and Cooperative Computing, Proceedings: 432-439 2006
í: English
e.s{|W: Proceedings Paper
O®h: 5th International Conference on Grid and Cooperative Computing (GCC 2006)
O®åeg: OCT 21-23, 2006
O®0W¹p: Hunan, PEOPLES R CHINA
O®^©RFU: Natl Lab Parallel & Distributed Proc.; Hong Kong Univ Sci & Technol.; Platform Comp.; NSFC.; IEEE Beijing Sect.; IEEE TC SVC.
\OsQ.Í: content-based cooperation; publish/subscribe; RDF; OWL; RSS
KeyWords Plus: XML DOCUMENTS; EFFICIENT
Xd: Content-based publish/subscribe systems as a cooperation and integration middleware are gaining increasing popularity due to its loose coupling and scalable integration capability. Recently Web-based collaboration develops very fast. RDF as a standard for information exchange in the semantic web and RDF Site Summary (RSS) based on RDF is becoming popular on the web, however the RSS systems based on pull architecture do not scale well because the websites hosting the popular RSS feeds face high loads imposed by active polling and clients don't detect updates in time. It needs a novel architecture as publish/subscribe system to improve its scalability and efficiency. However existing publish/subscribe systems only have the simple subscription mechanism, and lack of supporting the RDF data. In the paper we introduce a scalable semantic publish/subscribe system for efficient dissemination of the RSS documents. Our system adopts RDF and OWL ontology language to understand the semantic of events. We also propose a highly efficient event matching algorithm based on RDF graph. The prototype of SPS (Semantic Publish/subscribe System) was developed to selectively disseminate the RSS documents, and the performance tests demonstrated its efficiency and scalability.
0W@W: Chinese Acad Sci, Technol Ctr Software Engn, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Ma, JG, Chinese Acad Sci, Technol Ctr Software Engn, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 19
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 978-0-7695-2694-2
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BFW84

--------------------------------------------------------------------------------
>f:y 42 agÿqQ 128 ag
\O: Deng, LL (Deng, Lingli); He, YP (He, Yeping); Xu, ZY (Xu, Ziyao); Yuan, CY (Yuan, Chunyang)
: Ning, P; Qing, S; Li, N
h: An enhanced N-way exchange-based incentive scheme for P2P file sharing (Short paper)
egnúQHrir: Information and Communications Security, Proceedings, 4307: 322-331 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on Information and Communications Security
O®åeg: DEC 04-07, 2006
O®0W¹p: Raleigh, NC
\OsQ.Í: peer-to-peer security; incentives for cooperation; incentives for enforcement; exchange-based incentive schemes; fake object attacks
Xd: Cooperation between participants is essential to P2P applications' viability. Due to obscure possibility to match peers' needs and supplies in pairs, the widely used pair-wise exchange-based incentive schemes perform poorly. The N-way exchange-based incentive scheme enlarges the matching possibility by introducing n person exchanges. But some old problems remain and some new ones emerge with the N-way design. In this paper we present an enhanced n-way exchange-based incentive scheme for P2P file sharing systems. By distributing extra tasks to all the peers involved in an n-way exchange, the proposed scheme eliminates prohibitive computation and communication cost on the cooperators, resulting in greater efficiency, effectiveness, and security.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Deng, LL, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 20
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 978-3-540-49496-6
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BFV30

--------------------------------------------------------------------------------
>f:y 43 agÿqQ 128 ag
\O: Wang, DY (Wang, Dayin); Lin, DD (Lin, Dongdai); Wu, WL (Wu, Wenling)
: Lipmaa, H; Yung, M; Lin, DD
h: OPMAC: One-Key Poly1305 MAC
egnúQHrir: INFORMATION SECURITY AND CRYPTOLOGY, PROCEEDINGS, 4318: 78-87 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd SKLOIS Conference on Information Security and Cryptology
O®åeg: NOV 29-DEC 01, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Acad Sci, State Key Lab Informat Secur.; Inst Software.; Chinese Acad Sci.; CAS, Grad Univ.; Natl Nat Sci Fdn China.
\OsQ.Í: Message Authentication Code; Carter-Wegman MAC; Universal Hash Family; block cipher; Pseudorandom Permutation; Pseudorandom Function
KeyWords Plus: HASH FUNCTIONS; AUTHENTICATION; SECURITY
Xd: In this paper, we present One-Key Poly1305 MAC(OPMAC) and prove its security for arbitrary length message. OPMAC is deterministic and takes only one 16-byte key. Previously, Poly1305 MAC is nonce-based and requires two 16-byte keys and a 16-byte nonce, 48-byte in total.
0W@W: Chinese Acad Sci, Inst Software, Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Wang, DY, Chinese Acad Sci, Inst Software, Key Lab Informat Secur, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 978-3-540-49608-3
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BFU41

--------------------------------------------------------------------------------
>f:y 44 agÿqQ 128 ag
\O: Yuan, CY (Yuan, Chunyang); He, YP (He, Yeping); He, JB (He, Jianbo); Zhou, ZY (Zhou, Zhouyi)
: Lipmaa, H; Yung, M; Lin, DD
h: A verifiable formal specification for RBAC model with constraints of separation of duty
egnúQHrir: Information Security and Cryptology, Proceedings, 4318: 196-210 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd SKLOIS Conference on Information Security and Cryptology
O®åeg: NOV 29-DEC 01, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Acad Sci, State Key Lab Informat Secur.; Inst Software.; Chinese Acad Sci.; CAS, Grad Univ.; Natl Nat Sci Fdn China.
\OsQ.Í: formal specification; verification; RBAC; separation of duty.
Xd: Formal method provides a way to achieve an exact and consistent definition of security for a given scenario. This paper presents a formal state-based verifiable RBAC model described with Z language, in which the state-transition functions are specified formally. Based on the separation of duty policy, the constraint rules and security theorems are constructed. Using a case study, we show how to specify and verify the consistency of formal RBAC system with theorem proving. By specifying RBAC model formally, it provides a precise description for the system security requirements. The internal consistency of this model can be validated by verification of the model.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Yuan, CY, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 17
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 978-3-540-49608-3
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 15
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BFU41

--------------------------------------------------------------------------------
>f:y 45 agÿqQ 128 ag
\O: Tang, LY (Tang, Liuying); Qing, SH (Qing, Sihan)
: Lipmaa, H; Yung, M; Lin, DD
h: A practical alternative to Domain and Type Enforcement integrity formal models
egnúQHrir: Information Security and Cryptology, Proceedings, 4318: 225-237 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd SKLOIS Conference on Information Security and Cryptology
O®åeg: NOV 29-DEC 01, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Acad Sci, State Key Lab Informat Secur.; Inst Software.; Chinese Acad Sci.; CAS, Grad Univ.; Natl Nat Sci Fdn China.
\OsQ.Í: security label; security goal; integrity; information flow; formal model
Xd: Much secure system policy development uses the DTE (Domain and Type Enforcement) model, but the DTE model cannot explicitly provide the security goals of the policy. The invariants of the only based-DTE integrity protection formal model are too complex and make the model impractical. A DTE-Biba integrity formal model is proposed, in which DTE is the underlying component and the Biba integrity is the security goal. The DTE-Biba formal model describes direct Biba control relationships, and ignores the integrity level of objects. The aim is to provide the foundation for supporting effective policy configuration, policy integrity analysis and integrity verification of the DTE secure systems.
0W@W: Chinese Acad Sci, Inst Software, Engn Res Ctr Fundamental Software, Beijing 100080, Peoples R China
¯\O0W@W: Tang, LY, Chinese Acad Sci, Inst Software, Engn Res Ctr Fundamental Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 978-3-540-49608-3
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 13
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BFU41

--------------------------------------------------------------------------------
>f:y 46 agÿqQ 128 ag
\O: Li, Y (Li, Yongjian); Pang, J (Pang, Jun)
fNM|âVSO\O: IEEE Comp Soc
h: Generalized unsolicited tests for authentication protocol analysis
egnúQHrir: SEVENTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS: 509-514 2006
í: English
e.s{|W: Proceedings Paper
O®h: 7th International Conference on Parallel and Distrubuted Computing, Applications and Technologies
O®åeg: DEC 04-07, 2006
O®0W¹p: Taipei, TAIWAN
O®^©RFU: IEEE Comp Soc.; Inst Elect, Informat & Commun Engineers.; Inst Informat Sci Acad Sinica.; Natl United Univ.; Natl TaiwanUniv Sci & Technol.
\OsQ.Í: strand space; authentication; cryptographic protocols; the Otway-Rees protocol
Xd: Guttman and Javier Thayer introduced the notion of unsolicited authentication tests, and used it to prove the correctness of security protocols in which a key server authenticate its clients. As an example, they have applied unsolicited authentication tests to prove the authentication goals of the Otway-Rees protocol. However unsolicited authentication tests seem not to be fully explored in that case study, and the proofs were complicated. In this paper, we revisit the unsolicited authentication tests, and show how to strengthen and apply them in more general cases. To justify our work, we also use this extension to prove all agents' authentication guarantee of the Otway-Rees protocol.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100864, Peoples R China
¯\O0W@W: Li, Y, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 978-0-7695-2736-9
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BFW37

--------------------------------------------------------------------------------
>f:y 47 agÿqQ 128 ag
\O: Wang, XL (Wang, Xiuli); Wang, YJ (Wang, Yongji); Zhou, H (Zhou, Hui)
fNM|âVSO\O: IEEE
h: Optimal design of AQM routers with D-stable regions based on ITAE performance
egnúQHrir: 2006 First International Conference on Communications and Electronics: 78-83 2006
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Conference on Communications and Electronics (ICCE 2006)
O®åeg: OCT 10-11, 2006
O®0W¹p: Hanoi, VIETNAM
O®^©RFU: IEEE.
O®;NR¹e: Hanoi Univ Technol
\OsQ.Í: congesiion control; active queue management; PID controller; D-stability; ITAE
KeyWords Plus: ACTIVE QUEUE MANAGEMENT
Xd: This paper applies a novel optimization method for Proportional-Integral-DifferentiaI (PID) controller design with D-stable regions based on Integral of Time-weighted Absolute Error (ITAE) performance to Active Queue Management (AQM) routers that permits the designer to control the desired dynamic performance of a closed-loop system. A set of desired D-stable regions in the complex plane is first specified and then a numerical optimization algorithm based on ITAE performance is run to find the controller parameters such that all the roots of the closed-loop system are within the specified regions. This controller for AQM routers can detect and control the congestion effectively and predictively. Compared with the Random Early Detection (RED) and Proportional-Integral (PI) algorithms via experimental simulations in Network Simulator Version 2 (NS2), the proposed method, called DITAE-PID method, is indeed more efficient and robust in achieving the smaller queuing delay and higher throughput of an AQM router.
0W@W: Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China
¯\O0W@W: Wang, XL, Chinese Acad Sci, Inst Software, Lab Internet Software Technol, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 20
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-0568-8
egne.sux¡pe: 6
f[Ñy{|+R: Engineering, Electrical & Electronic; Telecommunications
ISI e.s O÷S: BGH53

--------------------------------------------------------------------------------
>f:y 48 agÿqQ 128 ag
\O: Li, Q (Li, Qi); Zhang, XW (Zhang, Xinwen); Qing, SH (Qing, Sihan); Xu, MW (Xu, Mingwei)
fNM|âVSO\O: IEEE
h: Supporting ad-hoc collaboration with group-based RBAC model - (Invited paper)
egnúQHrir: 2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing: 390-397 2006
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Collaborative Computing - Networking, Applications and Worksharing
O®åeg: NOV 17-20, 2006
O®0W¹p: Athens, GA
O®^©RFU: IEEE.
Xd: With the increasing accessibility of information and data, Role-Based Access Control(RBAC) has become a popular technique for security and privacy purposes. However, trusted collaboration between different groups in large corporate Intranets is still an unresolved problem. The challenge is how to extend existing access control model for efficient security management and administration to allow trusted collaboration between different groups. In this paper, we propose a group-based RBAC model (GB-RBAC) for this purpose. In particular, virtual group is proposed in our model to allow secure information and resource sharing in multi-group collaboration environments. All the members of a virtual group build trust relation between themselves and are authorized to join the collaborative work. The scheme and strategies provided in this paper meet the requirements of security, autonomy, and privacy for collaborations. As a result, our scheme provides an easy way to employ RBAC policies to secure ad-hoc collaboration.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Li, Q, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-0428-5
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods; Telecommunications
ISI e.s O÷S: BGF39

--------------------------------------------------------------------------------
>f:y 49 agÿqQ 128 ag
\O: Li, Z (Li, Z.); Sun, F (Sun, F.); Wu, F (Wu, F.); Liu, L (Liu, L.); Huang, Y (Huang, Y.); Li, L (Li, L.)
h: A QoS-based dynamic bandwidth allocation algorithm for LEO satellite networks
egnúQHrir: DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 13E: 3193-3197 Part 7 Suppl. S DEC 2006
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Sensing, Computing and Automation
O®åeg: MAY 08-11, 2006
O®0W¹p: Chongqing, PEOPLES R CHINA
Xd: Low Earth Orbit (LEO) satellite networks are expected to provide a global coverage and to support varying Quality of Service (QoS) requirements traffic including real-time multimedia communications. However, the LEO satellite bandwidth in essential is an invaluable resource, it must be effectively assigned in order to maximize network throughput and provide acceptable communications quality to all users. In this paper, a QoS-based dynamic bandwidth allocation (QDBA) algorithm with the ability to adapt the variations of channel conditions and traffic loads is proposed. The data rates provided to each queue of each Satellite Gateway (SG) are allocated to differentiate between multiple QoS priority levels, provide fairness, and to maximize system capacity. Simulation results comparing QDBA with an algorithm that does not have the ability to alter the data rate show significant improvement in terms of system throughput and delay.
0W@W: Tsing Hua Univ, Dept Comp Sci & Technol, Natl Key Lab Intelligent Technol & Syst, Beijing 100084, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Li, Z, Tsing Hua Univ, Dept Comp Sci & Technol, Natl Key Lab Intelligent Technol & Syst, Beijing 100084, Peoples R China.
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: WATAM PRESS
úQHrFU0W@W: C/O DCDIS JOURNAL, 317 KAREN PLACE, WATERLOO, ONTARIO N2L 6K8, CANADA
ISSN: 1492-8760
29 W[&{vegnúQHrir
Tðy)Q: DYN CONT DISCR IMP SYST SER B
ISO egne.súQHrir
Tðy)Q: Dyn. Contin. Discret. Impuls. Syst. Ser. B-Appl. Algorithms
egne.sux¡pe: 5
f[Ñy{|+R: Mathematics, Applied
ISI e.s O÷S: 201OW

--------------------------------------------------------------------------------
>f:y 50 agÿqQ 128 ag
\O: Wang, HA (Wang, H. A.); Jin, H (Jin, H.); Wang, H (Wang, H.); Dai, GZ (Dai, G. Z.)
h: Energy-aware optimization design of digital control systems with evolution strategy
egnúQHrir: DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 13E: 1893-1898 Part 4 Suppl. S DEC 2006
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Sensing, Computing and Automation
O®åeg: MAY 08-11, 2006
O®0W¹p: Chongqing, PEOPLES R CHINA
Xd: The energy-aware optimization design in the co-design between control and real-time scheduling is considered. For an adjustable voltage processor, a control task can execute at different processor speed from other tasks by using dynamic voltage scaling technology. Hence when more than one control tasks with a sampling period uncertain in an interval are scheduled on a single processor, an optimization problem of both sampling period and processor speed appears. The mathematic description of optimization is presented, and the proposed performance index involves both control performance and energy consumption. A static energy-aware optimization solution using evolution strategy is proposed to obtain a set of sampling periods and processor speeds for given control tasks. The performances of proposed solution are revealed via simulation studies, which show that the optimization design of sampling periods and processor speeds can be implemented by using the evolution strategy method, whilst the proposed control performance index and energy consumption get minimized as possible.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Wang, HA, Chinese Acad Sci, Inst Software, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: WATAM PRESS
úQHrFU0W@W: C/O DCDIS JOURNAL, 317 KAREN PLACE, WATERLOO, ONTARIO N2L 6K8, CANADA
ISSN: 1492-8760
29 W[&{vegnúQHrir
Tðy)Q: DYN CONT DISCR IMP SYST SER B
ISO egne.súQHrir
Tðy)Q: Dyn. Contin. Discret. Impuls. Syst. Ser. B-Appl. Algorithms
egne.sux¡pe: 6
f[Ñy{|+R: Mathematics, Applied
ISI e.s O÷S: 201OS

--------------------------------------------------------------------------------
>f:y 51 agÿqQ 128 ag
\O: Wu, F (Wu, F.); Sun, F (Sun, F.); Zheng, C (Zheng, C.); Li, Z (Li, Z.)
h: An output feedback jump fuzzy control to networked control systems
egnúQHrir: DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 13E: 2021-2026 Part 4 Suppl. S DEC 2006
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Sensing, Computing and Automation
O®åeg: MAY 08-11, 2006
O®0W¹p: Chongqing, PEOPLES R CHINA
KeyWords Plus: STABILITY; DELAYS
Xd: The network-induced delay and packets dropout in the networked control systems can degrade the system dynamic performance and are sources of potential instability. So a discrete-time jump fuzzy system is developed to model networked control systems (NCSs). Based on this, an output feedback fuzzy controller can be obtained by solving a set of Linear Matrix Inequalities (LMI). The basic idea of the output feedback controller is to construct the sub-optimal performance controller for the discrete-time jump fuzzy systems in such a way that a piecewise quadratic Lyapunov function can be used to establish the global stability of the resulting close loop fuzzy control systems. Finally simulation examples are carried out to validate the effectiveness of the proposed approach.
0W@W: Tsing Hua Univ, Dept Comp Sci & Technol, Natl Key Lab Intelligent Technol & Syst, Beijing 100084, Peoples R China; Chinese Acad Sci, GS Lab, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Wu, F, Tsing Hua Univ, Dept Comp Sci & Technol, Natl Key Lab Intelligent Technol & Syst, Beijing 100084, Peoples R China.
_(uvÂSe.spe: 15
«_!k: 0
úQHrFU: WATAM PRESS
úQHrFU0W@W: C/O DCDIS JOURNAL, 317 KAREN PLACE, WATERLOO, ONTARIO N2L 6K8, CANADA
ISSN: 1492-8760
29 W[&{vegnúQHrir
Tðy)Q: DYN CONT DISCR IMP SYST SER B
ISO egne.súQHrir
Tðy)Q: Dyn. Contin. Discret. Impuls. Syst. Ser. B-Appl. Algorithms
egne.sux¡pe: 6
f[Ñy{|+R: Mathematics, Applied
ISI e.s O÷S: 201OS

--------------------------------------------------------------------------------
>f:y 52 agÿqQ 128 ag
\O: Qiao, Y (Qiao, Ying); Zhong, K (Zhong, Kang); Wang, H (Wang, Hongan); Li, X (Li, Xiang)
: Syrmos, VL; Hamza, MH
h: Novel graphical event-condition-action rules with enhanced expressiveness
egnúQHrir: PROCEEDINGS OF THE NINTH IASTED INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS AND CONTROL: 194-199 2006
í: English
e.s{|W: Proceedings Paper
O®h: 9th IASTED International Conference on Intelligent Systems and Control
O®åeg: AUG 14-16, 2006
O®0W¹p: Honolulu, HI
O®^©RFU: Int Assoc Sci & Technol Dev.; Int Assoc Sci & Technol Dev, Tech Comm Control.; Int Assoc Sci & Technol Dev, Tech Comm Intelligents Syst & Control.
\OsQ.Í: event-condition-action rules; real-time active database; temporal; reasoning; graphical user interface; events
KeyWords Plus: SYSTEM
Xd: To support higher level of intelligence in real-time applications, the real-time active database (RTADB) should have powerful reasoning capability to solve complicated problems, especially the problems with temporal properties. This consequently requires the event-condition-action (ECA) rules in RTADB to have strong expressiveness for complicated temporal information in the system. In this paper, we present a novel graphical ECA rule to describe high-level complicated temporal information that is close to user's view. Furthermore, smart home applications are used to validate the proposed rule.
0W@W: Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100080, Peoples R China
¯\O0W@W: Qiao, Y, Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: ACTA PRESS ANAHEIM
úQHrFU0W@W: PO BOX 5124, ANAHEIM, CA 92814-5124 USA
ISBN: 978-0-88986-591-4
egne.sux¡pe: 6
f[Ñy{|+R: Automation & Control Systems; Computer Science, Artificial Intelligence
ISI e.s O÷S: BGE32

--------------------------------------------------------------------------------
>f:y 53 agÿqQ 128 ag
\O: Zhang, Y (Zhang, Yong); Huang, T (Huang, Tao); Wei, J (Wei, Jun)
: VanHung, D; Pandya, P
h: Declarative performance modeling for component-based system using UML profile for schedulability, performance and time
egnúQHrir: SEFM 2006: FOURTH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND FORMAL METHODS, PROCEEDINGS: 246-255 2006
NfNh: International Conference on Software Engineering and Formal Methods - SEFM
í: English
e.s{|W: Proceedings Paper
O®h: 4th IEEE International Conference on Software Engineering and Formal Methods
O®åeg: SEP 11-15, 2006
O®0W¹p: Pune, INDIA
O®^©RFU: IEEE.; Comp Soc India.; United Nat Univ, Int Inst Software Technol.; Tata Res Dev & Design Ctr.; Indian Assoc Res Comp Sci.; European Assoc Software Sci & Technol.
KeyWords Plus: PREDICTION
Xd: In this paper we propose a declarative method for modeling the performance impact of container middleware to component-based system. The method abstracts the major performance impact,factors, and these factors are modeled as sub-models by using UML activity diagram with UML Profile for Schedulability, Performance and Time annotations. Through a model assembly descriptor file associated with specific component application, the model assembling algorithm proposed in this paper can automatically composite the performance impacting,factors into component application UML model. The declarative method helps to realize the separation of concerns between component application performance modeling and middleware impact. Using a case study, we validate proposed method.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, Y, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: yzhang@otcaix.iscas.ac.cn
_(uvÂSe.spe: 17
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 1551-0255
ISBN: 0-7695-2678-0
29 W[&{vegnúQHrir
Tðy)Q: INT CONF SOFTW ENG FORMAL MET
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BFJ52

--------------------------------------------------------------------------------
>f:y 54 agÿqQ 128 ag
\O: Luan, SM (Luan, Shangmin); Magnani, L (Magnani, Lorenzo); Dai, GZ (Dai, Guozhong)
h: Algorithms for computing minimal conflicts
egnúQHrir: LOGIC JOURNAL OF THE IGPL, 14 (2): 391-406 MAR 2006
í: English
e.s{|W: Proceedings Paper
O®h: International Conference Model-Based Reasoning in Science and Engineering - Abduction, Visualization, Simulation (MBR04)
O®åeg: DEC, 2004
O®0W¹p: Pavis, ITALY
O®;NR¹e: Univ Pavis
\OsQ.Í: model-based diagnosis; minimal conflict; algorithm; observation
KeyWords Plus: DIAGNOSIS; SYSTEMS
Xd: In this paper we present some algorithms for computing minimal conflicts. First of all we discuss the relationship between minimal conflicts and minimally inconsistent subsets. Then we introduce an algorithm for computing all minimally inconsistent subsets, which is applied to generating all minimal conflicts. Furthermore, an algorithm for computing all minimal conflicts using structured description is introduced, and its correctness is proved; its time complexity is also shown. The algorithm using structured description terminates in polynomial time for some special system, such as the tree-structured systems. The algorithms are also compared with related works.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China; Beijing Inst Technol, Sch Comp Sci & Technol, Beijing 100081, Peoples R China; Univ Pavia, Dept Philosophy, I-27100 Pavia, Italy; Univ Pavia, Computat Philosophy Lab, I-27100 Pavia, Italy; Sun Yat Sen Univ, Guangzhou, Peoples R China
¯\O0W@W: Luan, SM, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
5uP[®±{0W@W: shangmin@iscas.cn; lmagnani@unipv.it; guozhong@admin.iscas.ac.cn
_(uvÂSe.spe: 18
«_!k: 1
úQHrFU: OXFORD UNIV PRESS
úQHrFU0W@W: GREAT CLARENDON ST, OXFORD OX2 6DP, ENGLAND
ISSN: 1367-0751
DOI: 10.1093/jigpal/jzk026
29 W[&{vegnúQHrir
Tðy)Q: LOG J IGPL
ISO egne.súQHrir
Tðy)Q: Log. J. IGPL
egne.sux¡pe: 16
f[Ñy{|+R: Mathematics, Applied; Mathematics
ISI e.s O÷S: 116KH

--------------------------------------------------------------------------------
>f:y 55 agÿqQ 128 ag
\O: Duan, YC (Duan, Yucong); Gu, YQ (Gu, Yuqing); Cheung, SC (Cheung, S. C.); Fu, XL (Fu, Xiaolan ]); Wang, J (Wang, Jing); Hu, QW (Hu, Qingwu)
: Riebisch, M; Tabeling, P; Zorn, W
h: Distinguishing between automatic and manual aspects of model driven development
egnúQHrir: 13th Annual IEEE International Symposium and Workshop on Engineering of Computer Based Systems, Proceedings - MASTERING THE COMPLEXITY OF COMPUTER-BASED SYSTEMS : 487-488 2006
í: English
e.s{|W: Proceedings Paper
O®h: 13th Annual IEEE International Symposium and Workshop on Engineering of Computer Based Systems
O®åeg: MAR 27-30, 2006
O®0W¹p: Potsdam, GERMANY
O®^©RFU: IEEE Comp Soc.; Univ Potsdam, Hasso Plattner Inst Software Syst Engn.
Xd: Manual portion and automatable aspects are often not explicitly differentiated and defined in most model driven software development (AdDSD). This may hinder the advancement of the automation level of AMSD with problems such as defining the boundaries of automation tasks, and measuring the workload for model transformations (MT), etc. In common senses, the two parts are not distinguishable because they belong to irrespective subjective and objective conceptual areas respectively. By discussing this issue specifically for AMSD, a conceptual exclusion approach for differentiation based on an extended Entity Relationship (ER) model is proposed A conceptual framework called MIB/CSD (manual work, inheritance, behaviorism/cardinality, static, dynamic) to implement the differentiation approach is designed Feasibility of the differentiation work with regard to UML is discussed in both the theoretical aspect with the extended ER model and the practical aspect with some existing evidences.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Duan, YC, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 2
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2546-6
egne.sux¡pe: 2
f[Ñy{|+R: Computer Science, Hardware & Architecture; Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BEG20

--------------------------------------------------------------------------------
>f:y 56 agÿqQ 128 ag
\O: Shen, JJ (Shen, Jianjun); Qing, SH (Qing, Sihan); Shen, QN (Shen, Qingni); Li, LP (Li, Liping)
fNM|âVSO\O: IEEE Comp Soc
h: Optimization of covert channel identification
egnúQHrir: Third International IEEE Security in Storage Workshop, Proceedings: 95-107 2006
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International IEEE Security in Storage Workshop
O®åeg: DEC 13, 2005
O®0W¹p: San Francisco, CA
O®^©RFU: IEEE Comp Soc.; Task Force Informat Assurance.; IEEE Informat Assurance Activit.; IEEE Mass Storage Syst Tech Comm.; Int Assoc Cryptol Res.
Xd: We characterize the properties of covert channels and present a taxonomy of covert channels. Information flow sequence is adopted to represent information flows and covert channels. Covert channels are categorized according to their information flow characteristics. On this basis, we explore the optimization of convert channel identification with the Shared Resource Matrix method adopted for demonstration. A general framework for covert channel identification founded on information flow analysis is proposed. We also review previous work within our framework. The application of our approach to a practical system is shown. At last, a new class of covert channels which used to be omitted by previous work is introduced.
0W@W: Chinese Acad Sci, Grad Univ, Beijing ZhongkeAnsheng Corp Informat Technol, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Shen, JJ, Chinese Acad Sci, Grad Univ, Beijing ZhongkeAnsheng Corp Informat Technol, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 21
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2537-7
egne.sux¡pe: 13
f[Ñy{|+R: Computer Science, Hardware & Architecture; Computer Science, Theory & Methods
ISI e.s O÷S: BEG93

--------------------------------------------------------------------------------
>f:y 57 agÿqQ 128 ag
\O: Xiao, MH (Xiao, Meihua); Xue, JY (Xue, Jinyun)
: Zhang, YQ; Lin, TY
h: Formal automatic verification of security protocols
egnúQHrir: 2006 IEEE International Conference on Granular Computing: 566-569 2006
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on Granular Computing
O®åeg: MAY 10-12, 2006
O®0W¹p: Atlanta, GA
O®^©RFU: IEEE Computat Intelligence Soc.; Georgia State Univ.
\OsQ.Í: cryptographic protocols; security; algorithmic knowledge; intruder model
KeyWords Plus: SPIN
Xd: Security protocols flaws are notoriously difficult to detect. Comparatively little attention has been given to logics of knowledge, although such logics have been proven to be very useful in the specifications of protocols for communication systems. We address ourselves to the analysis of security protocols under the Dolev-Yao model by using a logic of algorithmic knowledge, and propose a general method to describe formally the data structures used in the verification, such as messages, traces, intruders, and so on. We explore the use of our methodology for the verification of security protocols. The Horng-Hsu attack to Helsinki protocol has been found successfully in this setting by using SPIN.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China
¯\O0W@W: Xiao, MH, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 1-4244-0133-X
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Theory & Methods
ISI e.s O÷S: BEN81

--------------------------------------------------------------------------------
>f:y 58 agÿqQ 128 ag
\O: Zhang, F (Zhang Fan); Feng, DG (Feng Deng-Guo)
: Martin, DC
h: Identity-based PKI scheme for Machine Readable Travel Document
egnúQHrir: 20th International Conference on Advanced Information Networking and Applications, Vol 2, Proceedings: 461-465 2006
í: English
e.s{|W: Proceedings Paper
O®h: 20th International Conference on Advanced Information Networking and Applications
O®åeg: APR 18-20, 2006
O®0W¹p: Vienna, AUSTRIA
O®^©RFU: IEEE Comp Soc Tech Comm Distributed Proc.; Vienna Univ Technol.
\OsQ.Í: identity-based signature; PKI; MRTD; PKD; DSI; DSPK
Xd: Certificate-based Public Key Infrastructure (PKI) scheme of International Civil Aviation Organization (ICAQ) has some problems, especially with the distribution of public key. In this paper, we propose an identity-based PKI scheme for Machine Readable Travel Document (MRTD). By virtue of simple key management on identity-based signature, our scheme facilitates public key distribution among participating countries, and eliminates the need of a global Public Key Directory (PKD).
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, F, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2466-4
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Information Systems; Computer Science, Theory & Methods; Telecommunications
ISI e.s O÷S: BEN86

--------------------------------------------------------------------------------
>f:y 59 agÿqQ 128 ag
\O: Ma, CX (Ma, Cuixia); Dai, GZ (Dai, Guozhong); Wang, HG (Wang, Hongan)
: Callaghan, V; Hu, B; Lin, Z; Zhang, H
h: Capturing invisible design: Modeling multi-modal interaction in pervasive computing
egnúQHrir: 2006 1ST INTERNATIONAL SYMPOSIUM ON PERVASIVE COMPUTING AND APPLICATIONS, PROCEEDINGS: 162-167 2006
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Symposium on Pervasive Computing and Applications
O®åeg: AUG 03-05, 2006
O®0W¹p: Urumchi, PEOPLES R CHINA
O®^©RFU: IEEE Beijing Sect.; BCS.; UCE.; GUT.; SDUW.; XIFE.
\OsQ.Í: Pervasive Computing; multi-modal interaction; invisible design; sketch; Context Technology
KeyWords Plus: SYSTEMS; INTERFACE
Xd: As technologies are rapidly evolving in the area of storage, recognition and displays, the vision of multi-modal interaction is positioning the human needs central to pervasive access to services. Users expect better looking interfaces that are also easy to use to improve high efficiency and productivity and to focus on task itself instead of tools as providing the invisibility in pervasive computing. However, it is hard to obtain the right service at the right time naturally.. in the multimedia environment based on current interaction approaches. In this paper, we propose a framework for multi-modal interaction which offers the sketch and speech interactive models without limitation of the diversity and richness of the provided services in the pervasive computing environment. Furthermore, it is applied to describe sample application and shows how it is used to create a new interface with high performance.
0W@W: Chinese Acad Sci, Human Computer Interact & Intelligent Informat Pr, Inst Software, Beijing, Peoples R China
¯\O0W@W: Ma, CX, Chinese Acad Sci, Human Computer Interact & Intelligent Informat Pr, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 20
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 1-4244-0325-1
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BFB62

--------------------------------------------------------------------------------
>f:y 60 agÿqQ 128 ag
\O: Qiao, XQ (Qiao Xiaoqiang); Wei, J (Wei Jun)
: OConner, L
h: A decentralized services choreography approach for business collaboration
egnúQHrir: 2006 IEEE International Conference on Services Computing, Proceedings: 190-197 2006
í: English
e.s{|W: Proceedings Paper
O®h: IEEE Services Computing Workshops
O®åeg: SEP 18-22, 2006
O®0W¹p: Chicago, IL
O®^©RFU: IEEE Comp Soc, TC Serv Comp.
Xd: In E-service environment, enterprises need to collaborate to achieve a common business goal in loose-coupling manner Therefore, it is of great necessity to develop a service interoperation technique that is capable of handling the collaboration among distributed business processes. The Web services architecture defines separate specifications for the choreography and orchestration of Web services. This paper proposes a service choreography solution for business collaboration across organizations boundaries while preserving the local autonomy of their own business processes. A centralized service choreography process is built for specification of the global business process, and then it is transformed to decentralized choreography processes amongst the participants for peer-to-peer interaction. For each participant, a data dependency based process mediation model is developed to facilitate the adaptation between the local pre-established business process and its corresponding decentralized choreography process. This mediation means can ensure the privacy and autonomy of local business process and the adaptability of choreography process. A system architecture is implemented to support our solution in ONCE PI project.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Qiao, XQ, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2670-5
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Information Systems; Computer Science, Interdisciplinary Applications
ISI e.s O÷S: BFG53

--------------------------------------------------------------------------------
>f:y 61 agÿqQ 128 ag
\O: Yan, J (Yan, Jun); Zhang, J (Zhang, Jian)
fNM|âVSO\O: IEEE COMPUTER SOC
h: Backtracking algorithms and search heuristics to generate test suites for combinatorial testing
egnúQHrir: 30th Annual International Computer Software and Applications Conference, Vol 1, Regular Papers/Panels, Proceedings: 385-392 2006
NfNh: PROCEEDINGS - INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE
í: English
e.s{|W: Proceedings Paper
O®h: 30th Annual International Computer Software and Applications Conference
O®åeg: SEP 17-21, 2006
O®0W¹p: Chicago, IL
O®^©RFU: IEEE Comp Soc.
Xd: Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach and a backtracking search algorithm are presented to solve the problem. A novel pruning strategy called SCEH is proposed to increase the efficiency of the methods. Several existing search heuristics and symmetry breaking techniques are also used in the backtracking search algorithm. Lastly, this paper introduces a tool called EXACT (EXhaustive seArch of Combinatorial Test suites) which implements all the above techniques to construct the covering arrays automatically The experimental results show that our backtracking search method outperforms other methods in many small size cases.
0W@W: Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Yan, J, Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 4
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 0730-3157
ISBN: 0-7695-2655-1
29 W[&{vegnúQHrir
Tðy)Q: P INT COMP SOFTW APPL CONF
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BFF95

--------------------------------------------------------------------------------
>f:y 62 agÿqQ 128 ag
\O: Ruan, L (Ruan, Li); Wang, YJ (Wang, Yongji); Wang, Q (Wang, Qing); Shu, FD (Shu, Fengdi); Zeng, HT (Zeng, Haitao); Zhang, S (Zhang, Shen)
fNM|âVSO\O: IEEE COMPUTER SOC
h: ARIMAmmse: An improved ARIMA-based software productivity prediction method
egnúQHrir: 30th Annual International Computer Software and Applications Conference, Vol 2, Short Papers/Workshops/Fast Abstracts/Doctoral Symposium, Proceedings: 135-138 2006
NfNh: PROCEEDINGS - INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE
í: English
e.s{|W: Proceedings Paper
O®h: 30th Annual International Computer Software and Applications Conference
O®åeg: SEP 17-21, 2006
O®0W¹p: Chicago, IL
O®^©RFU: IEEE Comp Soc.
Xd: Productivity is a critical performance index of process resources. As successive history productivity data tends to be auto-correlated, time series prediction method based on Auto-Regressive Integrated Moving Average (ARIMA) model was introduced into software productivity prediction by Humphrey et al. In this paper, a variant of their prediction method named ARIMAmmse is proposed. This variant formulates the ARIMA parameter estimation issue as a minimum mean square error (MMSE) based constrained optimization problem. The ARIMA model is used to describe constraints of the parameter estimation problem, while MMSE is used as the objective function of the constrained optimization problem. According to the optimization theory, ARIMAmmse will definitely achieve a higher MMSE prediction precision than Humphrey et al's which is based on the Yule-Walk estimation technique. Two comparative experiments are also presented. The experimental results further confirm the theoretical superiority of ARIMAmmse.
0W@W: Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China
¯\O0W@W: Ruan, L, Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISSN: 0730-3157
ISBN: 0-7695-2655-1
29 W[&{vegnúQHrir
Tðy)Q: P INT COMP SOFTW APPL CONF
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BFF96

--------------------------------------------------------------------------------
>f:y 63 agÿqQ 128 ag
\O: Guo, XF (Guo, Xiangfeng); Ding, XN (Ding, Xiaoning); Zhong, H (Zhong, Hua); Li, J (Li, Jing)
fNM|âVSO\O: INSTICC
h: A new performance optimization strategy for Java Message Service system
egnúQHrir: ICEIS 2006: Proceedings of the Eighth International Conference on Enterprise Information Systems - INFORMATION SYSTEMS ANALYSIS AND SPECIFICATION : 520-523 2006
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on Enterprise Information Systems (ICEIS 2006)
O®åeg: MAY 23-27, 2006
O®0W¹p: Paphos, CYPRUS
O®^©RFU: Inst Syst & Technol Informat, Control & Commun.; Cyprus Comp Soc.; Univ Cyprus.; Aristotle Univ Thessaloniki.; Athens Univ Econ & Business.
\OsQ.Í: Java Message Service; performance optimization
Xd: Well suited to the loosely coupled nature of distributed interaction, message oriented middleware has been applied in many distributed applications. Efficiently transmitting messages with reliability is a key feature of message oriented middleware. Due to the necessary persistence facilities, the performance of transmitting is subject greatly to the persistence action. The Openness of Java platform has made the systems conforming to Java Message Service Specification supported widely. In these applications, many consumers get messages periodically. We bring forward a new efficient strategy using different persistence methods with different kinds of messages, which improves system performance greatly. The strategy also utilizes daemon threads to reduce its influence to the system. The strategy has been implemented in our Java Message Service conformed system, ONCEAS MQ.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Guo, XF, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: INSTICC-INST SYST TECHNOLOGIES INFORMATION CONTROL & COMMUNICATION
úQHrFU0W@W: AVENIDA D MANUEL L, 27A 2 ESQUERDO, SETUBAL, 2910-595, PORTUGAL
ISBN: 972-8865-43-0
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Information Systems
ISI e.s O÷S: BFH82

--------------------------------------------------------------------------------
>f:y 64 agÿqQ 128 ag
\O: Ding, XN (Ding, Xiaoning); Guo, XF (Guo, Xiangfeng); Jin, BH (Jin, Beihong); Huang, T (Huang, Tao)
fNM|âVSO\O: INSTICC
h: A new approach to implement extended transaction models in J2EE
egnúQHrir: ICEIS 2006: Proceedings of the Eighth International Conference on Enterprise Informational Systems - DATABASES AND INFORMATION SYSTEMS INTEGRATION : 118-123 2006
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on Enterprise Information Systems (ICEIS 2006)
O®åeg: MAY 23-27, 2006
O®0W¹p: Paphos, CYPRUS
O®^©RFU: Inst Syst & Technol Informat, Control & Commun.; Cyprus Comp Soc.; Univ Cyprus.; Aristotle Univ Thessaloniki.; Athens Univ Econ & Business.
\OsQ.Í: extended transaction models; J2EE; entity beans
Xd: Extended transaction model (ETM) is a powerful mechanism to ensure the consistency and reliability of complicated enterprise applications. However, there is few implementation of ETM in REE. The existing research is deficient in supporting range and requires some special database supporting. This paper explores the obstacle which prevents J2EE from supporting ETMs, and argues it is because of the limitation of J2EE XAResource interface and underlying databases. To overcome the obstacle, we propose a new approach, which processes concurrency control inside J2EE application server instead of in database. Furthermore, we implement TX/E service in Moss to validate the approach, which is an enhanced J2EE transaction service supporting extended transaction models. Compared to existing work, TX/E supports user-defined transaction models and does not require any special database supporting.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Ding, XN, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: INSTICC-INST SYST TECHNOLOGIES INFORMATION CONTROL & COMMUNICATION
úQHrFU0W@W: AVENIDA D MANUEL L, 27A 2 ESQUERDO, SETUBAL, 2910-595, PORTUGAL
ISBN: 972-8865-41-4
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Information Systems
ISI e.s O÷S: BFH81

--------------------------------------------------------------------------------
>f:y 65 agÿqQ 128 ag
\O: Wan, SC (Wan, Shuchao); Wei, J (Wei, Jun); Song, JY (Song, Jingyu); Guan, HQ (Guan, Heqing)
fNM|âVSO\O: IEEE COMPUTER SOC
h: Developing a selection model for Interactive Web Services
egnúQHrir: ICWS 2006: IEEE International Conference on Web Services, Proceedings: 231-238 2006
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on Web Services (ICWS 2006)
O®åeg: SEP 18-22, 2006
O®0W¹p: Chicago, IL
O®^©RFU: IEEE Comp Soc, TCSC.
Xd: Traditional web services are function oriented, where various developed standards mainly assist business applications to expose their functional descriptions, but each service consumer is required to develop different presentation logics for the same business logic respectively. Although works on the Interactive Web Service (IWS) make some progress and achieve the result of WSRP, researchers keep on making efforts to encapsulate user interface with the functional interface so as to present available information of content and facilitate the direct interactions between users and back-end services. Regarding IWS. this paradigm of web services, service selection will shift focus from function orientation to presentation orientation. This paper proposes a novel IWS description model with the extension of an element - View and its three sub-elements including presentation, content and interaction, with which IWS can be described more completely and accurately. Based on the description model, an IWS selection model with matching rules is developed, which can meet diverse selection requirements of service consumers at multiple levels and aspects.
0W@W: Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Wan, SC, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 1
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 0-7695-2669-1
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Information Systems; Telecommunications
ISI e.s O÷S: BFF72

--------------------------------------------------------------------------------
>f:y 66 agÿqQ 128 ag
\O: Li, J (Li Jiao)
: Mohammadian, M
h: Decomposition of nets and verification in terms of decomposition
egnúQHrir: International Conference on Computational Intelligence for Modelling, Control & Automation Jointly with International Conference on Intelligent Agents, Web Technologies & Internet Commerce, Vol 2, Proceedings: 804-809 2006
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Computational Intelligence for Modelling, Control and Automation/International Conference on Intelligent Agents Web Technologies and International Commerce
O®åeg: NOV 28-30, 2005
O®0W¹p: Vienna, AUSTRIA
O®^©RFU: IEEE Computat Intelligence Soc.; European Soc Fuzzy Log & Technol.; European Neural Network Soc.; Int Assoc Fuzzy Set Management & Econ.; Japan Soc Fuzzy Theory & Intelligent Informat.; Taiwan Fuzzy Syst Assoc.; World Wide Web Business Intelligence.; Hungarian Fuzzy Assoc.; Univ Canberra.
KeyWords Plus: LIVENESS
Xd: Decomposition is an important technique in design and verification based on Petri nets. This paper introduces two kinds of decomposition methods in terms of places and transitions, respectively. For each method, the strategy used in this paper is to require such a decomposition to preserve the desirable properties including liveness and boundedness of the system in the resulting components. Besides, this paper shows that the two decomposition methods may also be used for verifying the properties of a given system.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing, Peoples R China
¯\O0W@W: Li, J, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing, Peoples R China.
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7695-2504-0
egne.sux¡pe: 6
f[Ñy{|+R: Automation & Control Systems; Computer Science, Artificial Intelligence
ISI e.s O÷S: BEW91

--------------------------------------------------------------------------------
>f:y 67 agÿqQ 128 ag
\O: Weng, Y (Weng Yao); Zhao, H (Zhao Hong)
: Lan, H
h: Internet brand niche measuring and developing strategy
egnúQHrir: Proceedings of the 2006 International Conference on Management Science & Engineering (13th), Vols 1-3: 827-831 2006
í: English
e.s{|W: Proceedings Paper
O®h: 13th International Conference on Management Science and Engineering
O®åeg: OCT 05-07, 2006
O®0W¹p: Lille, FRANCE
O®^©RFU: Univ Sci & Tecnol Lille.; Harbin Inst Technol.; State Univ Management.; IEEE Engn Management Soc.; Natl Nat Sci Fdn.
\OsQ.Í: brand niche; brand niche overlapping; brand niche extension; internet brand; niche breadth
Xd: Borrowing from the theory on ecology, the author put forwards the concepts of brand niche and the measuring of brand niche-brand niche breadth; The formula of brand niche breadth is given on the basis of Levins formula. Meanwhile, Niche overlapping phenomenon is used to describe the competition of brands in the market environment. Finally, the five major Chinese Internet Portal Brands are analyzed, and the developing strategies are given from the perspective of niche theory.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Weng, Y, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: HARBIN INSTITUTE TECHNOLOGY PUBLISHERS
úQHrFU0W@W: 16 FUXINGJIE NANGANGQU, HARBIN 150006, HEILONGJIANG, PEOPLES R CHINA
ISBN: 7-5603-2355-3
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Engineering, Industrial; Engineering, Electrical & Electronic; Operations Research & Management Science
ISI e.s O÷S: BFI54

--------------------------------------------------------------------------------
>f:y 68 agÿqQ 128 ag
\O: Xu, J (Xu, Jin); Wu, ZM (Wu, Zhimei)
fNM|âVSO\O: IEEE
h: A perceptual sensitivity based redundant slices coding scheme for error-resilient transmission H.264/AVC video
egnúQHrir: 2006 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS PROCEEDINGS, VOLS 1-4 - VOL 1: SIGNAL PROCESSING - VOL 2: COMMUNICATION THEORY AND SYSTEM - VOL 3: COMPUTER, OPTICAL AND BROADBAND COMMUNICATIONS, COMPUTATIONAL INTELLIGENCE - VOL 4: CIRCUITS & SYSTEMS : 139-142 2006
NfNh: International Conference on Communications, Circuits and Systems
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Conference on Communications, Circuits and Systems (ICCCAS 2006)
O®åeg: JUN 25-28, 2006
O®0W¹p: Guilin, PEOPLES R CHINA
Xd: In this paper, redundant slices feature of the H.264/AVC codec is evaluated. In order to trade off compression efficiency and error robustness of a H.264/AVC codec with redundant slice capability, we propose a novel perceptual sensitivity based redundant slices coding scheme. The perceptually sensitive regions are determined by using a simple yet effective perceptual sensitivity analysis technique, which analyzes both the motion and the texture structures in the original video sequence. The experimental results show that our proposed algorithm can remarkably improve the reconstructed video quality in the packet lossy network.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Xu, J, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 6
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 0-7803-9584-0
29 W[&{vegnúQHrir
Tðy)Q: INT CONF COMMUN CIRCUITS SYS
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Engineering, Electrical & Electronic; Imaging Science & Photographic Technology; Telecommunications
ISI e.s O÷S: BFD81

--------------------------------------------------------------------------------
>f:y 69 agÿqQ 128 ag
\O: Hong, ZG (Hong, Zhiguo); Sun, FC (Sun, Fuchun); Xu, FJ (Xu, Fanjiang); Fan, ZH (Fan, Zhihua); Zheng, G (Zheng, Gang)
fNM|âVSO\O: IEEE
h: A Stochastic Reward Net-based performance analysis of LEO satellite networks
egnúQHrir: PROCEEDINGS OF THE 2006 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL: 24-28 2006
NfNh: IEEE International Conference on Networking, Sensing and Control
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on Networking, Sensing and Control
O®åeg: APR 23-25, 2006
O®0W¹p: Ft Lauderdale, FL
O®^©RFU: IEEE Syst, Man & Cybernet Soc.
KeyWords Plus: SYSTEMS; ATM
Xd: In this paper, a Stochastic Reward Net (SRN) model is constructed to analyze the performance of Low Earth Orbit (LEO) satellite networks in the case of packet loss. A lemma is proved to calculate the packet loss probability. Then, the impact of buffer size, arrival rate and packet size on packet loss probability is also analyzed using Stochastic Petri Net Package (SPNP) 6.0. Through numerical results, some new results are derived thereby.
0W@W: Chinese Acad Sci, Inst Software, Gen Software Lab, Beijing 100080, Peoples R China
¯\O0W@W: Hong, ZG, Chinese Acad Sci, Inst Software, Gen Software Lab, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 23
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISSN: 1810-7869
ISBN: 1-4244-0065-1
29 W[&{vegnúQHrir
Tðy)Q: IEEE INT CONF NETW SENS CONTR
egne.sux¡pe: 5
f[Ñy{|+R: Automation & Control Systems; Computer Science, Hardware & Architecture; Remote Sensing; Telecommunications
ISI e.s O÷S: BER46

--------------------------------------------------------------------------------
>f:y 70 agÿqQ 128 ag
\O: Tian, F (Tian, Feng); Wang, HG (Wang, Hongan); Zhang, FJ (Zhang, Fengjun); Dai, GZ (Dai, Guozhong)
: Shen, W; Lin, ZK; Barthes, JP; Luo, JH; Deng, JM; Li, XP; Yong, JM; Hao, Q
h: Co-CreativePen Toolkit: A pen-based 3D toolkit for children cooperatly designing virtual environment
egnúQHrir: 2006 10TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, PROCEEDINGS, VOLS 1 AND 2: 360-364 2006
NfNh: International Conference on Computer Supported Cooperative Work in Design
í: English
e.s{|W: Proceedings Paper
O®h: 10th International Conference on Computer Supported Cooperative Work in Design
O®åeg: MAY 03-05, 2006
O®0W¹p: Nanjing, PEOPLES R CHINA
O®^©RFU: SE Univ.; IEEE Beijing Sect.; Natl Nat Sci Fdn China.; CIMS Comm.; KC Wong Educ Fdn.
\OsQ.Í: pen-based interaction; 3D interaction; toolkit
Xd: Co-CreativePen Toolkit is a pen-based 3D toolkit for children cooperatly designing virtual environment. This toolkit is used to construct different applications involved with distributed pen-based 3D interaction. In this toolkit, sketch method is encapsulated as kinds of interaction techniques. Children can use pen to construct 3D and IBR objects, to navigate in the virtual world, to select and manipulate virtual objects, and to communicate with other children. Children can use pen to select other children in the virtual world, and use pen to write message to children selected. The distributed architecture of Co-CreativePen Toolkit is based on the CORBA. A common scene graph is managed in the server with several copies of this graph are managed in every client. Every changes of the scene graph in client will cause the change in the server and other client.
0W@W: Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100080, Peoples R China
¯\O0W@W: Tian, F, Chinese Acad Sci, Inst Software, Intelligence Engn Lab, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 1-4244-0164-X
29 W[&{vegnúQHrir
Tðy)Q: INT CONF COMP SUPP COOP WORK
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Interdisciplinary Applications
ISI e.s O÷S: BFD79

--------------------------------------------------------------------------------
>f:y 71 agÿqQ 128 ag
\O: Liu, S (Liu, Sheng); Zhang, J (Zhang, Jian)
: Calmet, J; Ida, T; Wang, D
h: Using Hajos' construction to generate hard graph 3-colorability instances
egnúQHrir: ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION, PROCEEDINGS, 4120: 211-225 2006
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on Artificial Intelligence and Symbolic Computation
O®åeg: SEP 20-22, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
KeyWords Plus: ALGORITHM
Xd: In this paper we propose a constructive algorithm using constraint propagation to generate 4-critical graph units (4-CGUs) which have only one triangle as subgraph. Based on these units we construct 4-critical graphs using Hajos' join construction. By choosing Grotztsch graph as the initial graph and carefully selecting the edge to be joined, we make sure that the generated graphs are 4-critical and triangle-free. Experiments show that these graphs are exceptionally hard for backtracking algorithms adopting Brelaz's heuristics. We also give some preliminary analysis on the source of hardness.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China; Grad Univ, Chinese Acad Sci, Beijing 100049, Peoples R China
¯\O0W@W: Liu, S, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China.
5uP[®±{0W@W: lius@ios.ac.cn; zj@ios.ac.cn
_(uvÂSe.spe: 17
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-39728-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 15
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BFI97

--------------------------------------------------------------------------------
>f:y 72 agÿqQ 128 ag
\O: Yan, J (Yan, Jun); Zhang, J (Zhang, Jian); Xu, ZX (Xu, Zhongxing)
: Calmet, J; Ida, T; Wang, D
h: Finding relations among linear constraints
egnúQHrir: ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION, PROCEEDINGS, 4120: 226-240 2006
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on Artificial Intelligence and Symbolic Computation
O®åeg: SEP 20-22, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
Xd: In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among these constraints first. This paper studies the problem of finding Boolean relations among a set of linear numerical constraints. The relations can be represented by rules. It is believed that we can not generate all the rules in polynomial-time. A search based algorithm with some heuristics to speed up the search process is proposed. All the techniques are implemented in a tool called MALL which can generate the rules automatically. Experimental results with various examples show that our method can generate enough rules in acceptable time. Our method can also handle other types of constraints if proper numeric solvers are available.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100864, Peoples R China; Grad Univ, Chinese Acad Sci, Beijing, Peoples R China
¯\O0W@W: Yan, J, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100864, Peoples R China.
5uP[®±{0W@W: yanjun@ios.ac.cn; zj@ios.ac.cn; xzx@ios.ac.cn
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-39728-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 15
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BFI97

--------------------------------------------------------------------------------
>f:y 73 agÿqQ 128 ag
\O: Jockusch, CG (Jockusch, Carl G., Jr.); Li, AS (Li, Angsheng)
h: Restricted jump interpolation in the d.c.e. degrees
egnúQHrir: MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 16 (5): 841-865 OCT 2006
í: English
e.s{|W: Proceedings Paper
O®h: 1st Conference on Computability in Europe - New Computational Paradigms
O®åeg: JUN, 2005
O®0W¹p: Amsterdam, NETHERLANDS
O®;NR¹e: Univ Amsterdam
KeyWords Plus: RECURSIVELY ENUMERABLE DEGREES; DENSE
Xd: We show that for any 2-computably enumerable Turing degree l, any computably enumerable degree a and any Turing degree s, if l' = 0', l = 0', and s is c.e. in a, then there is a 2-computably enumerable degree x with the following properties:
(1) l f:y 89 agÿqQ 128 ag
\O: Jie, Y (Jie, Yang); Bo, Y (Bo, Yan); Lee, S (Lee, Sungyoung); Cho, J (Cho, Jinsung)
: Sha, E; Han, SK; Xu, CZ; Kim, MH; Yang, LT; Xiao, B
h: SAQA: Spatial and attribute based query aggregation in wireless sensor networks
egnúQHrir: EMBEDDED AND UBIQUITOUS COMPUTING, PROCEEDINGS, 4096: 15-24 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Embedded and Ubiquitous Computing
O®åeg: AUG 01-04, 2006
O®0W¹p: Seoul, SOUTH KOREA
O®^©RFU: Int Federat Informat Proc.
Xd: In most wireless sensor networks, applications submit their requests as queries and wireless sensor network transmits the requested data to the applications. However, most existing work in this area focuses on data aggregation, not much attention has been paid to query aggregation. For many applications, especially ones with high query rates, query aggregation is very important. In this paper, we design an effective query aggregation algorithm SAQA to reduce the number of duplicate/overlapping queries and save overall energy consumption in the wireless sensor networks. This new aggregation algorithm focuses on the duplicate/overlapping spatial and attribute information in the original queries submitted by the applications. Our performance evaluations show that by applying our query aggregation algorithm, the overall energy consumption can be significantly reduced and the sensor network lifetime can be prolonged correspondingly.
0W@W: Kyung Hee Univ, Dept Comp Engn, Seoul, South Korea; Chinese Acad Sci, Inst Software, Intelligent Engn Lab, Beijing 100864, Peoples R China
¯\O0W@W: Lee, S, Kyung Hee Univ, Dept Comp Engn, Seoul, South Korea.
5uP[®±{0W@W: yangjie@oslab.khu.ac.kr; yan_bo04@mails.gucas.ac.cn; sylee@oslab.khu.ac.kr; chojs@khu.ac.kr
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-36679-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEU96

--------------------------------------------------------------------------------
>f:y 90 agÿqQ 128 ag
\O: Ma, YL (Ma, Yinglong); Wu, KH (Wu, Kehe); Jin, BH (Jin, Beihong); Li, W (Li, Wei)
: Shi, ZZ; Sadananda, R
h: Combination framework for semantic based query across multiple ontologies
egnúQHrir: AGENT COMPUTING AND MULTI-AGENT SYSTEMS, 4088: 463-470 2006
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: 9th Pacific Rim International Workshop on Multi-Agents
O®åeg: AUG 07-08, 2006
O®0W¹p: Guilin, PEOPLES R CHINA
Xd: It is crucial for ontology engineers to compose these heterogeneous ontologies for effective and scalable interoperability among Web agents. In this paper, we propose a combination framework based on effective and scalable ontology interoperability for high-quality query answering. We also put forward a specifical process to substantiate our combination approach. The underlying theoretical and empirical analyses are exploited for ensuring effectiveness and correctness of the approach. Experimental results from our prototype system show that high-quality query results but sacrifice some of reasoning complexity.
0W@W: N China Elect Power Univ, Sch Comp Sci & Technol, Beijing 102206, Peoples R China; Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Ma, YL, N China Elect Power Univ, Sch Comp Sci & Technol, Beijing 102206, Peoples R China.
5uP[®±{0W@W: m_y_long@otcaix.iscas.ac.cn; epuwkh@126.com; jbh@otcaix.iscas.ac.cn
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-36707-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BEV65

--------------------------------------------------------------------------------
>f:y 91 agÿqQ 128 ag
\O: Zheng, YJ (Zheng, Yujun); Wang, LL (Wang, Lianlai); Xue, JY (Xue, Jinyun)
: Shi, ZZ; Sadananda, R
h: An A-Team based architecture for constraint programming
egnúQHrir: AGENT COMPUTING AND MULTI-AGENT SYSTEMS, 4088: 552-557 2006
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: 9th Pacific Rim International Workshop on Multi-Agents
O®åeg: AUG 07-08, 2006
O®0W¹p: Guilin, PEOPLES R CHINA
Xd: The paper proposes an agent-based constraint programming architecture that we have successfully applied to solve large, particularly combinatorial, operations problems. The architecture is based on the asynchronous team (A-Team) in which multiple problem solving agents cooperate with each other by exchanging results to produce a set of non-dominated solutions. We extend the A-Team by introducing CSP-specific agents, explicitly defining solution states, and enabling solution decomposition/composition, and thereby improve the performance, reliability, and automation of constraint programming significantly.
0W@W: Syst Engn Inst Engn Equipment, Beijing 100093, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Jiangxi Normal Univ, Coll Comp Informat & Engn, Nanchang 330027, Peoples R China
¯\O0W@W: Zheng, YJ, Syst Engn Inst Engn Equipment, Beijing 100093, Peoples R China.
5uP[®±{0W@W: uchengz@yahoo.com.cn
_(uvÂSe.spe: 12
«_!k: 5
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-36707-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BEV65

--------------------------------------------------------------------------------
>f:y 92 agÿqQ 128 ag
\O: Lv, P (Lv, Pin); Zhang, JF (Zhang, Jin-Fang); Lit, M (Lit, Min)
: Ali, M; Dapoigny, R
h: An optimal method for multiple observers sitting on terrain based on improved simulated annealing techniques
egnúQHrir: ADVANCES IN APPLIED ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 4031: 373-382 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 19th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems
O®åeg: JUN 27-30, 2006
O®0W¹p: Annecy, FRANCE
O®^©RFU: Univ Savoie, Dept Comp Sci.; Int Soc Appl Intelligence.; LISTIC/ESIA.; AIAA.; ACM SIGART.; AFIA.; CSCSI/SCEIO.; ECCAI.; ENNS.; INNS.; JSAI.; TAAI.; Texas State Univ.
KeyWords Plus: VISIBILITY; FEATURES; MODELS
Xd: The problem of multiple observers sitting on terrain (MOST) is an important part in visibility-based terrain reasoning (VBTR), but it is difficult because of the unacceptable computing time. Recent developments in this field focus on involving spatial optimization techniques, such as a heuristic algorithm. In this paper, a new method is developed based on the Improved Simulated Annealing (ISA) algorithm through the analysis of different terrain characters. A new annealing function and a new state function are designed to make the improved algorithm fit the problem better. Experiment results show that without loss of precision, use of the ISA algorithm reduces time cost 50%similar to 70% when compared with the traditional SA.
0W@W: Chinese Acad Sci, Inst Software, Natl Key Lab Integrated Informat Syst Technol, Beijing 10080, Peoples R China
¯\O0W@W: Lv, P, Chinese Acad Sci, Inst Software, Natl Key Lab Integrated Informat Syst Technol, Beijing 10080, Peoples R China.
5uP[®±{0W@W: lvpin04@ios.cn; jinfang@ios.cn; lumin03@ios.cn
_(uvÂSe.spe: 20
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-35453-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEV62

--------------------------------------------------------------------------------
>f:y 93 agÿqQ 128 ag
\O: Ma, YL (Ma, Yinglong); Wu, KH (Wu, Kehe); Jin, BH (Jin, Beihong); Liu, SH (Liu, Shaohua)
: Wang, G; Peters, JF; Skowron, YY; Yao, YY
h: Approximate semantic query based on multi-agent systems
egnúQHrir: ROUGH SETS AND KNOWLEDGE TECHNOLOGY, PROCEEDINGS, 4062: 735-741 2006
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Conference on Rough Sets and Knowledge Technology (RSKT 2006)
O®åeg: JUL 24-26, 2006
O®0W¹p: Chongqing, PEOPLES R CHINA
O®^©RFU: Int Rough Set Soc.; Rough Set & Soft Computat Soc.; Chinese Assoc Artificial Intelligence.; Natl Nat Sci Fdn China.; Chongqing Univ Posts & Telecommun.; Chongqing Inst Technol.; Chongqing Jiaotong Univ.; Chongqing Educ Commiss.; Chongqing Sci & Technol Commiss.; Chongqing Informat Ind Bur.; Chongqing Assoc Sci & Tecjmp;.
\OsQ.Í: ontology; multi-agent system; description logic
KeyWords Plus: WEB
Xd: Within multi-agent systems, it is almost impossible for multiple Web agents to completely share a same vocabulary. This makes multi-agent communication difficult. In this paper, we proposed an approach for better multi-agent communication using approximation technology of semantic terminology across multiple ontolgies. This method uses description logic language for describing ontological information and perform approximate query across multiple ontologies.
0W@W: N China Elect Power Univ, Sch Comp Sci & Technol, Beijing 102206, Peoples R China; Chinese Acad Sci, Technol Ctr Software Engn, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Ma, YL, N China Elect Power Univ, Sch Comp Sci & Technol, Beijing 102206, Peoples R China.
5uP[®±{0W@W: m_y_long@otcaix.iscas.ac.cn; ncepuwkh@126.com; jbh@otcaix.iscas.ac.cn; ham_1iu@otcaix.iscas.ac.cn
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-36297-5
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BEV60

--------------------------------------------------------------------------------
>f:y 94 agÿqQ 128 ag
\O: Liu, BQ (Liu, Baoquan); Wu, EH (Wu, Enhua); Liu, XH (Liu, Xuehui)
: Nishita, T; Peng, Q; Seidel, HP
h: Interactively rendering dynamic caustics on GPU
egnúQHrir: ADVANCES IN COMPUTER GRAPHICS, PROCEEDINGS, 4035: 136-147 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 24th Computer Graphics International Conference
O®åeg: JUN 26-28, 2006
O®0W¹p: Hangzhou, PEOPLES R CHINA
Xd: In this paper, a new technique is presented for interactive rendering of caustics fully processed on GPU. Without any pre-computation required, the algorithm can directly render refractive caustics from complex deformable transparent objects onto an opaque receiver surface. By the technique we accurately trace the path of the photons and calculate the energy carried by the photons emitted from the light source, and distribute the energy onto the receiver surface according to Gauss basis function. As a result, photorealistic caustic image is calculated without post-processing and temporal filtering over recent frames. We demonstrate that the interactive caustics can be rendered by our method in real-time for non-uniform deformation of both refractive object and receiver surface, and at the same time, interactive change of light and camera in terms of position and direction could be made.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China
¯\O0W@W: Liu, BQ, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China.
5uP[®±{0W@W: lbq@ios.ac.cn; ehwu@umac.mo; lxh@ios.ac.cn
_(uvÂSe.spe: 13
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-35638-X
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BET89

--------------------------------------------------------------------------------
>f:y 95 agÿqQ 128 ag
\O: Tian, F (Tian, Feng); Cheng, TG (Cheng, Tiegang); Wang, HG (Wang, Hongan); Dai, GZ (Dai, Guozhong)
: Nishita, T; Peng, Q; Seidel, HP
h: Research on user-centered design and recognition pen gestures
egnúQHrir: ADVANCES IN COMPUTER GRAPHICS, PROCEEDINGS, 4035: 312-323 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 24th Computer Graphics International Conference
O®åeg: JUN 26-28, 2006
O®0W¹p: Hangzhou, PEOPLES R CHINA
KeyWords Plus: ENVIRONMENTS; INTERFACES
Xd: Pen-based user interface has become a hot research field in recent years. Pen gesture plays an important role in Pen-based user interfaces. But it's difficult for UI designers to design, and for users to learn and use. In this purpose, we performed a research on user-centered design and recognition pen gestures. We performed a survey of 100 pen gestures in twelve famous pen-bases systems to find problems of pen gestures currently used. And we conducted a questionnaire to evaluate the matching degree between commands and pen gestures to discover the characteristics that a good pen gestures should have. Then cognition theories were applied to analyze the advantages of those characteristics in helping improving the learnability of pen gestures. From these, we analyzed the pen gesture recognition effect and presented some improvements on features selection in recognition algorithm of pen gestures. Finally we used a couple of psychology experiments to evaluate twelve pen gestures designed based on the research. It shows those gestures is better for user to learn and use. Research results of this paper can be used for designer as a primary principle to design pen gestures in pen-based systems.
0W@W: Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100864, Peoples R China
¯\O0W@W: Tian, F, Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100864, Peoples R China.
5uP[®±{0W@W: tf@iel.iscas.ac.cn; ctg@iel.iscas.ac.cn; wha@iel.iscas.ac.cn; dgz@iel.iscas.ac.cn
_(uvÂSe.spe: 29
«_!k: 2
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-35638-X
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BET89

--------------------------------------------------------------------------------
>f:y 96 agÿqQ 128 ag
\O: Hu, BC (Hu, Bessie C.); Wong, DS (Wong, Duncan S.); Zhang, ZF (Zhang, Zhenfeng); Deng, XT (Deng, Xiaotie)
: Batten, LM; SafaviNaini, R
h: Key replacement attack against a generic construction of certificateless signature
egnúQHrir: INFORMATION SECURITY AND PRIVACY, PROCEEDINGS, 4058: 235-246 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 11th Australasian Conference on Information Security and Privacy
O®åeg: JUL 03-05, 2006
O®0W¹p: Melbourne, AUSTRALIA
KeyWords Plus: SCHEME; SECURITY
Xd: Certificateless cryptography involves a Key Generation Center (KGC) which issues a partial key to a user and the user also independently generates an additional public/secret key pair in such a way that the KGC who knows only the partial key but not the additional secret key is not able to do any cryptographic operation on behalf of the user; and a third party who replaces the public/secret key pair but does not know the partial key cannot do any cryptographic operation as the user either. We call this attack launched by the third party as the key replacement attack. In ACISP 2004, Yum and Lee proposed a generic construction of digital signature schemes under the framework of certificateless cryptography. In this paper, we show that their generic construction is insecure against key replacement attack. In particular, we show that the security requirements of their generic building blocks are insufficient to support some security claim stated in their paper. We then propose a modification of their scheme and show its security in a new and simplified security model. We show that our simplified definition and adversarial model not only capture all the distinct features of certificateless signature but are also more versatile when compared with all the comparable ones. We believe that the model itself is of independent interest.
0W@W: City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China; Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Hu, BC, City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China.
5uP[®±{0W@W: bessiehu@cs.cityu.edu.hk; duncan@cs.cityu.edu.hk; zfzhang@is.iscas.ac.cn; deng@cs.cityu.edu.hk
_(uvÂSe.spe: 12
«_!k: 35
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-35458-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BET74

--------------------------------------------------------------------------------
>f:y 97 agÿqQ 128 ag
\O: Zhang, KP (Zhang, Kunpeng); Xu, Y (Xu, Yun); Shen, YF (Shen, Yifei); Chen, GL (Chen, Guoliang)
: Wang, J; Yi, Z; Zurada, JM; Lu, BL; Yin, H
h: Using a neural networking method to predict the protein phosphorylation sites with specific kinase
egnúQHrir: ADVANCES IN NEURAL NETWORKS - ISNN 2006, PT 3, PROCEEDINGS, 3973: 682-689 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Symposium on Neural Networks (ISNN 2006)
O®åeg: MAY 28-31, 2006
O®0W¹p: Chengdu, PEOPLES R CHINA
O®^©RFU: Univ Electr Sci & Technol China.; Chinese Univ Hong Kong.; Asia Pacific Neural Network Assembly.; European Neural Network Soc.; IEEE Circuits & Syst Soc.; IEEE Computat Intelligence Soc.; Int Neural Network Soc.; Natl Nat Sci Fdn China.; KC Wong Educ Fdn Hong Kong.
\OsQ.Í: Neural Network; phosphorylation site predicting; protein kinase; protein structure; PKA; IKK
KeyWords Plus: SECONDARY STRUCTURE PREDICTION; STRUCTURAL BASIS; SEQUENCE; GENOME
Xd: Protein phosphorylation at Serine(S), Threonine(T) or Tyrosine(Y) residues is an important reversible post-translational modification, and it is an important mechanism for modulating(regulating) many cellular processes such as proliferation, differentiation and apoptosis. Experimental identification of phosphorylation site is labor-intensive and often limited by the availability and optimization of enzymatic reaction. In silico prediction methods may facilitate the identification of potential phosphorylation sites with ease. Methods based on primary protein sequences is much desirable and popular for its convenience and fast speed. It is obvious that structural-based methods show excellent performance, however, the 3-D structure information of protein is very limited compared to the huge number of protein in the public databases. Here we present a novel and accurate computational method named NNPhos-PhoK: sequence and structural-based neural network method of protein phosphorylation sites prediction with considering specific kinase. The data in this paper is from Phospho.ELM[1].We test NNPhosPhoK with both simulational and real data, whatever in speed or in accuracy, we can realize that NNPhosPhoK shows greater computational ability with superior performance compared to two existing phosphorylation sites prediction system: ScanSite 2.0[2] and PredPhospho[3].
0W@W: Univ Sci & Technol China, Dept Comp Sci, Hefei 230026, Peoples R China; Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, KP, Univ Sci & Technol China, Dept Comp Sci, Hefei 230026, Peoples R China.
5uP[®±{0W@W: kpzhang@mail.ustc.edu.cn
_(uvÂSe.spe: 21
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-34482-9
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BET87

--------------------------------------------------------------------------------
>f:y 98 agÿqQ 128 ag
\O: Jun, W (Jun, Wei); Lei, H (Lei, Hua); Niu, CL (Niu Chunlei); Zheng, HR (Zheng Haoran)
: Eliassen, F; Montresor, A
h: High performance SOAP processing driven by data mapping template
egnúQHrir: DISTRIBUTED APPLICATIONS AND INTEROPERABLE SYSTEMS, PROCEEDINGS, 4025: 152-168 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 6th International Conference on Distributed Applications and Interoperable Systems
O®åeg: JUN 14-16, 2006
O®0W¹p: Bologna, ITALY
O®^©RFU: Univ Bologna.; IFIP WG 6 1.
Xd: Web Services, with loosely-coupled, high-interoperable and platform-independent characteristics, is gaining popularity in distributed computing. However, web services suffers performance penalty because its protocol stack is based on XML. SOAP is used to specify wire message format in web services, and SOAP processing largely affects the performance of web services. In this paper, we firstly analyze the performance of web services on Java platform, and identify that data model mapping between XML data and Java data is the main impact factor on performance. Therefore, we propose a new scheme of data model mapping "Dynamic Early Binding" which enables to improve SOAP processing by avoiding Java reflection operations and proactively generating processing codes. This dynamic early binding is realized by Data Mapping Template (DMT), which is specified by extended context free grammar and implemented by pushdown automaton with output. We introduce the technique into our developed SOAP engine - SOAPExpress. The effectiveness is illustrated by yielding over 100% speedups compared to Apache Axis 1.2 in our benchmark.
0W@W: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
¯\O0W@W: Jun, W, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China.
5uP[®±{0W@W: wj@otcaix.iscas.ac.cn
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-35126-4
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 17
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BER47

--------------------------------------------------------------------------------
>f:y 99 agÿqQ 128 ag
\O: Wang, DY (Wang, Dayin); Lin, DD (Lin, Dongdai); Wu, WL (Wu, Wenling)
: Zhou, J; Yung, M; Bao, F
h: An improved Poly1305 MAC
egnúQHrir: APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PROCEEDINGS, 3989: 284-292 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Conference on Applied Cryptography and Network Security
O®åeg: JUN 06-09, 2006
O®0W¹p: Singapore, SINGAPORE
O®^©RFU: Inst Infocomm Res.
Xd: In this paper, we propose an improved Poly1305 MAC, called IPMAC. IPMAC is a refinement of Poly1305 MAC shown by Bernstein. We use only one 16-byte key and one 16-byte nonce for IPMAC while Poly1305 MAC uses two 16-byte keys and one 16-byte nonce, 48-byte in total. The cost of reducing the size of secret keys is almost negligible: only one encryption. Similarly to Poly1305 MAC, our algorithm correctly and efficiently handles messages of arbitrary bit length.
0W@W: Chinese Acad Sci, Inst Software, Key Lab Informat Secur, Beijing 100080, Peoples R China
¯\O0W@W: Wang, DY, Chinese Acad Sci, Inst Software, Key Lab Informat Secur, Beijing 100080, Peoples R China.
5uP[®±{0W@W: wdy@is.iscas.ac.cn; ddlin@is.iscas.ac.cn; wwl@is.iscas.ac.cn
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-34703-8
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEP41

--------------------------------------------------------------------------------
>f:y 100 agÿqQ 128 ag
\O: Zhang, ZF (Zhang, Zhenfeng); Wong, DS (Wong, Duncan S.); Xu, J (Xu, Jing); Feng, DG (Feng, Dengguo)
: Zhou, J; Yung, M; Bao, F
h: Certificateless public-key signature: Security model and efficient construction
egnúQHrir: APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PROCEEDINGS, 3989: 293-308 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Conference on Applied Cryptography and Network Security
O®åeg: JUN 06-09, 2006
O®0W¹p: Singapore, SINGAPORE
O®^©RFU: Inst Infocomm Res.
KeyWords Plus: PAIRING-BASED CRYPTOSYSTEMS; GENERIC CONSTRUCTION; CRYPTOGRAPHY; ENCRYPTION; SCHEMES
Xd: "Certificateless public-key cryptosystem" is a new and attractive paradigm, which avoids the inherent key escrow property in identity-based public-key cryptosystems, and does not need expensive certificates as in the public key infrastructure. A strong security model for certificateless public key encryption was established by Al-Riyami and Paterson in 2003. In this paper, we first present a security model for certificateless public-key signature schemes, and then propose an efficient construction based on bilinear pairings. The security of the proposed scheme can be proved to be equivalent to the computational Diffie-Hellman problem in the random oracle model with a tight reduction.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China; City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China; Grad Univ Chinese Acad Sci, Beijing 100039, Peoples R China
¯\O0W@W: Zhang, ZF, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China.
5uP[®±{0W@W: zfzhang@is.iscas.ac.cn; duncan@cityu.edu.hk
_(uvÂSe.spe: 17
«_!k: 30
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-34703-8
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 16
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEP41

--------------------------------------------------------------------------------
>f:y 101 agÿqQ 128 ag
\O: Wu, WL (Wu, Wenling); Zhang, WT (Zhang, Wentao); Feng, DG (Feng, Dengguo)
: Won, D; Kim, S
h: Integral cryptanalysis of reduced FOX block cipher
egnúQHrir: INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2005, 3935: 229-241 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on Information Security an Cryptology (ICISC 2005)
O®åeg: DEC 01-02, 2005
O®0W¹p: Seoul, SOUTH KOREA
O®^©RFU: Minist Informat & Commun.; Inst Informat Technol Assessment.; Solmaze Co Ltd.; K Bell Co Ltd.; HAN Infocomm Co Ltd.
KeyWords Plus: ATTACKS
Xd: FOX is a family of block ciphers presented recently, which is based upon some results of provable security and has high performances on various platforms. In this paper, we construct some distinguishers between 3-round FOX and a random permutation of the blocks space. By using integral attack and collision-searching techniques, the distinguishers are used to attack 4, 5, 6 and 7-round FOX64, 4 and 5-round FOX128. The attack is more efficient than previous integral attacks on FOX. The complexity of improved integral attack is 2(77.6) on 4-round FOX128, 2(205.6) against 5-round FOX128 respectively. For FOX64, the complexity of improved integral attack is 2(45.4) on 4-round FOX64, 2(109.4) against 5-round FOX64, 2(173.4) against 6-round FOX64, 2(237.4) against 7-round FOX64 respectively. Therefore, 4-round FOX64/64, 5-round FOX64/128, 6-round FOX64/192, 7-round FOX64/256 and 5-round FOX128/256 are not immune to the attack in this paper.
0W@W: Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China; Grad Univ, Chinese Acad Sci, State Key Lab Informat Secur, Beijing, Peoples R China
¯\O0W@W: Wu, WL, Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: wwl@is.iscas.ac.cn; zhangwt@gscas.ac.cn; feng@is.iscas.ac.cn
_(uvÂSe.spe: 23
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-33354-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 13
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEN37

--------------------------------------------------------------------------------
>f:y 102 agÿqQ 128 ag
\O: Zhang, B (Zhang, Bin); Wu, HJ (Wu, Hongjun); Feng, DG (Feng, Dengguo); Wang, H (Wang, Hong)
: Won, D; Kim, S
h: Weaknesses of COSvd (2,128) stream cipher
egnúQHrir: INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2005, 3935: 270-283 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on Information Security an Cryptology (ICISC 2005)
O®åeg: DEC 01-02, 2005
O®0W¹p: Seoul, SOUTH KOREA
O®^©RFU: Minist Informat & Commun.; Inst Informat Technol Assessment.; Solmaze Co Ltd.; K Bell Co Ltd.; HAN Infocomm Co Ltd.
\OsQ.Í: stream cipher; COS cipher; divide-and-conquer; non-linear feedback shift register
Xd: The COSvd (2,128) cipher was proposed at the ECRYPT SASC'2004 workshop by Filiol et. al to strengthen the past COS (2,128) stream cipher. It uses clock-controlled non-linear feedback registers filtered by a highly non-linear output function and was claimed to prevent any existing attacks. However, as we will show in this paper, there are some serious security weaknesses in COSvd (2,128). The poorly designed S-box generates biased keystream and the message could be restored by a ciphertext-only attack in some broadcast applications. Besides, we launch a divide-and-conquer attack to recover the secret keys from O(2(26))-byte known plaintext with high success rate and complexity O(2(113)), which is much lower than 2(512), the complexity of exhaustive search.
0W@W: Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China; Katholieke Univ Leuven, Dept ESAT COSIC, Louvain, Belgium; Chinese Acad Sci, State Key Lab Informat Secur, Grad Sch, Beijing 100039, Peoples R China
¯\O0W@W: Zhang, B, Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: martin_zhangbin@yahoo.com.cn; wu.hongjun@esat.kuleuven.be
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-33354-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 14
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEN37

--------------------------------------------------------------------------------
>f:y 103 agÿqQ 128 ag
\O: Chen, X (Chen, Xiang); Hu, SL (Hu, Shan-li)
: Yeung, DS; Liu, ZQ; Wang, XZ; Yan, H
h: A Vickrey-type multi-attribute auction model
egnúQHrir: ADVANCES IN MACHINE LEARNING AND CYBERNETICS, 3930: 21-29 2006
NfNh: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Conference on Machine Learning and Cybernetics
O®åeg: AUG 18-21, 2005
O®0W¹p: Guangzhou, PEOPLES R CHINA
O®^©RFU: IEEE Systems, Man & Cybernet TCC.; Hong Kong Polytechn Univ.; Hebei Univ.; S China Univ Technol.; Chongqing Univ.; Sun Yatsen Univ.; Harbin Inst Technol.; Int Univ Germany.
Xd: Internet auction is not only an integral part of Electronic Commerce but is also becoming a promising field for applying autonomous agents and multi-agent system (MAS) technologies. And auction, as an efficient resource allocation method, has an important role in MAS problems and as such is receiving increasing attention from scholars. This paper suggests a protocol (VAMA) and strategies for multi-attribute auction. Some useful properties such as strategy-proof are also proven. This paper also includes an analysis of the strategy of the buyer, and gives a decentralized mechanism for VAMA implementation as well as discussing some questions about VAMA. Finally, this protocol is compared with existing ones, improving on the work of Esther David etc.
0W@W: Fuzhou Univ, Dept Comp Sci & Technol, Fuzhou 350002, Peoples R China; Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Chen, X, Fuzhou Univ, Dept Comp Sci & Technol, Fuzhou 350002, Peoples R China.
5uP[®±{0W@W: angus_cx@yahoo.com.cn; hus1@fzu.edu.cr
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-33584-6
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE ARTIF INTELL
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Artificial Intelligence
ISI e.s O÷S: BEN35

--------------------------------------------------------------------------------
>f:y 104 agÿqQ 128 ag
\O: Jin, H (Jin, Hong); Wang, H (Wang, Hui); Wang, H (Wang, Hongan); Dai, G (Dai, Guozhong)
: Cai, JY; Cooper, SB; Li, A
h: An ACO-based approach for task assignment and scheduling of multiprocessor control systems
egnúQHrir: THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 3959: 138-147 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Theory and Applications of Models of Computation (TAMC 2006)
O®åeg: MAY 15-20, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Acad Sci, Inst Software.; Univ Leeds.; Univ Wisconsin.; Natl Nat Sci Fdn China.
KeyWords Plus: ANT COLONY OPTIMIZATION
Xd: In order to solve whether a set of periodic tasks can be assigned to a set of identical processors in such a way that all timing constraints can be met, the model of travelling salesman problem is used to describe the task assignment and scheduling in real-time multiprocessor control systems. Combined with the scheduling characteristics of multiprocessor systems, a new feasible algorithm based on ant colony optimization metaheuristic is presented for solving this problem. Both the scheduling performance index and the control performance index are proposed and used as fitness functions of optimization. Simulation results show that the proposed approach can solve the task assignment and scheduling problem in multiprocessor control systems.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Jin, H, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: hjin@iel.iscas.ac.cn; hui.wang@iel.iscas.ac.cn; wha@iel.iscas.ac.cn; dgz@iel.iscas.ac.cn
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-34021-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEM07

--------------------------------------------------------------------------------
>f:y 105 agÿqQ 128 ag
\O: Zhang, P (Zhang, Peng)
: Cai, JY; Cooper, SB; Li, A
h: A new approximation algorithm for the k-facility location problem
egnúQHrir: THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 3959: 217-230 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Theory and Applications of Models of Computation (TAMC 2006)
O®åeg: MAY 15-20, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Acad Sci, Inst Software.; Univ Leeds.; Univ Wisconsin.; Natl Nat Sci Fdn China.
Xd: The k-facility location problem is a common generalization of the facility location and the k-median problems. For the metric uncapacitated k-facility location problem, we propose a polynomial-time 2 + congruent to root 3 + e-approximation algorithm using the local search approach, which significantly improves the previously known approximation ratio 4, given by Jain et al. using the greedy method (J. ACM 50 (2003) 795-824).
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Grad Univ Chinese Acad Sci, Beijing, Peoples R China
¯\O0W@W: Zhang, P, Chinese Acad Sci, Inst Software, POB 8718, Beijing 100080, Peoples R China.
5uP[®±{0W@W: zhp@gcl.iscas.ac.cn
_(uvÂSe.spe: 14
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-34021-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 14
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEM07

--------------------------------------------------------------------------------
>f:y 106 agÿqQ 128 ag
\O: Xia, MJ (Xia, Mingji); Zhao, WB (Zhao, Wenbo)
: Cai, JY; Cooper, SB; Li, A
h: #3-regular bipartite planar vertex cover is #P-complete
egnúQHrir: THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 3959: 356-364 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Theory and Applications of Models of Computation (TAMC 2006)
O®åeg: MAY 15-20, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Acad Sci, Inst Software.; Univ Leeds.; Univ Wisconsin.; Natl Nat Sci Fdn China.
KeyWords Plus: SPARSE
Xd: We generalize the polynomial interpolation method by giving a sufficient condition, which guarantees that the coefficients of a polynomial are uniquely determined by its values on a recurrence sequence. Using this method, we show that #3-Regular Bipartite Planar Vertex Cover is #P-complete. The result is unexpected, since the same question for 2-regular graph is in FP.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Chinese Acad Sci, Beijing, Peoples R China
¯\O0W@W: Xia, MJ, Chinese Acad Sci, Inst Software, POB 8717, Beijing 100080, Peoples R China.
5uP[®±{0W@W: xmj@gcl.iscas.ac.cn; zwenbo@gcl.iscas.ac.cn
_(uvÂSe.spe: 7
«_!k: 2
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-34021-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEM07

--------------------------------------------------------------------------------
>f:y 107 agÿqQ 128 ag
\O: Chen, H (Chen, Haiming); Dong, Y (Dong, Yunmei)
: Cai, JY; Cooper, SB; Li, A
h: Towards practical computable functions on context-free languages
egnúQHrir: THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 3959: 555-565 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Theory and Applications of Models of Computation (TAMC 2006)
O®åeg: MAY 15-20, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Acad Sci, Inst Software.; Univ Leeds.; Univ Wisconsin.; Natl Nat Sci Fdn China.
\OsQ.Í: recursive function; context-free language; structured data; operator; computability
Xd: Many structures used in computer science and software can be represented by context-free languages. This paper discusses computable functions on such languages, which give a useful model for studies of computability and algorithms involving complex data structures. This paper further tackles some practical issues for using the functions. Some practical schemes of the functions are presented. A subclass of functions is provided, which can be implemented efficiently.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Chen, H, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China.
5uP[®±{0W@W: chm@ios.ac.cn; dym@ios.ac.cn
_(uvÂSe.spe: 21
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-34021-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 11
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEM07

--------------------------------------------------------------------------------
>f:y 108 agÿqQ 128 ag
\O: Zheng, YJ (Zheng, Yujun); Xue, JY (Xue, Jinyun); Liu, WB (Liu, Weibo)
: Cai, JY; Cooper, SB; Li, A
h: Object-oriented specification composition and refinement via category theoretic computations - Extended abstract
egnúQHrir: THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 3959: 601-610 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Theory and Applications of Models of Computation (TAMC 2006)
O®åeg: MAY 15-20, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Acad Sci, Inst Software.; Univ Leeds.; Univ Wisconsin.; Natl Nat Sci Fdn China.
Xd: Most of the existing formal object-oriented methods use classes or objects as the basic unit of design, and therefore lack a precise semantics for specifying high-granularity components. The paper presents a framework of categorical models that focus concern on the interactive relationships between objects, and that explicitly support specification composition and refinement at different levels of abstraction and granularity in object-oriented design. A case study of implementing templated design patterns demonstrates the ability of category theoretic computations to mechanize software development.
0W@W: Syst Engn Inst Engineer Equipment, Beijing 100093, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Jiangxi Normal Univ, Nanchang 330027, Peoples R China
¯\O0W@W: Zheng, YJ, Syst Engn Inst Engineer Equipment, Beijing 100093, Peoples R China.
5uP[®±{0W@W: uchengz@yahoo.com.cn
_(uvÂSe.spe: 16
«_!k: 3
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-34021-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEM07

--------------------------------------------------------------------------------
>f:y 109 agÿqQ 128 ag
\O: Li, AS (Li, Angsheng); Song, Y (Song, Yan); Wu, GH (Wu, Guohua)
: Cai, JY; Cooper, SB; Li, A
h: Universal cupping degrees
egnúQHrir: THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 3959: 721-730 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 3rd International Conference on Theory and Applications of Models of Computation (TAMC 2006)
O®åeg: MAY 15-20, 2006
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: Chinese Acad Sci, Inst Software.; Univ Leeds.; Univ Wisconsin.; Natl Nat Sci Fdn China.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Nanyang Technol Univ, Sch Phys & Math Sci, Singapore 639798, Singapore
¯\O0W@W: Li, AS, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 14
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-34021-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEM07

--------------------------------------------------------------------------------
>f:y 110 agÿqQ 128 ag
\O: Wang, DL (Wang, Danli); Zhang, J (Zhang, Jie); Dai, GZ (Dai, Guozhong)
: Pan, ZG; Diener, H; Jin, XG; Gobel, S; Li, L
h: A multimodal fusion framework for children's storytelling systems
egnúQHrir: TECHNOLOGIES FOR E-LEARNING AND DIGITAL ENTERTAINMENT, PROCEEDINGS, 3942: 585-588 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st International Conference on Technologies for E-Learning and Digital Entertainment (Edutainment 2006)
O®åeg: APR 16-19, 2006
O®0W¹p: Hangzhou, PEOPLES R CHINA
O®^©RFU: Zhejiang Univ, DEARC, Sch Comp Sci.; China Soc Image & Graph, VR Comm.; Zhejiang Prov, Hangzhou Natl Animat Base.; Zhejiang Univ, State Key Lab CAD&CG.; INI GraphicsNet.; Int Journal Virtual Real.; IFIF SG 16 Entertainment Comp.; Nat Sci Fdn China.; Peking Univ, Natl Lab Machine Percept.; Bhihang Univ, Key Lab VR Tech MOE.; Sun Yatsen Univ, Inst Comp Applicat.; Hangzhou Dianzi Univ.; Nanjing Normal Univ.; Hong Kong Polytechn Univ.
Xd: Storytelling by a child, as a training activity, influences significantly a child's linguistic abilities, logic and thought process, imagination, and creativity. There presently exist many software-based storytelling applications. However, most are deemed incompatible or not suitable to Chinese children. Due to the limited vocabulary of pre-school and lower-level grade school children, speech-based and pen-based input models are considered the most effective way of input. But now there is not an effective multimodal mode to solve the problem for children's storytelling systems. In this paper, we propose a multimodal fusion framework that utilizes pen and speech techniques to incorporate both context information and linguistic attributes of the Chinese language into the design. Based on the proposed framework, we formulated specific methods of integration, and developed a prototype for our proposed system.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Wang, DL, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: danli@ios.cn; zhangjie@ios.cn; guozhong@ios.cn
_(uvÂSe.spe: 10
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-33423-8
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEM03

--------------------------------------------------------------------------------
>f:y 111 agÿqQ 128 ag
\O: Li, MS (Li, Mingshu)
: Wang, Q; Pfahl, D; Raffo, DM; Wernick, P
h: Assessing 3-D integrated software development processes: A new benchmark
egnúQHrir: SOFTWARE PROCESS CHANGE, 3966: 15-38 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st Joint Conference of the Software Process Workshop/International Workshop on Software Process Simulation and Modeling (SPW/ProSim 2006)
O®åeg: MAY 20-21, 2006
O®0W¹p: Shanghai, PEOPLES R CHINA
KeyWords Plus: SIMULATION; IMPROVEMENT
Xd: The increasing complexity and dynamic of software development have become the most critical challenges for large projects. As one of the new emerged methodologies to these problems, TRISO-Model uses an integrated three-dimensional structure to classify and organize the essential elements in software development. In order to simulate and evaluate the modeling ability of TRISO-Model, a new benchmark is created in this paper, called SPW-2006 Example, by extending the ISPW-6 Example. It may be used to evaluate other software process models, and/or to evaluate software organizations, software projects and also software development processes, particularly 3-D integrated software development processes. With the SPW-2006 Example and its evolution for quantitative evaluation to 3-D integrated software development processes, a new approach of TRISO-Model based assessment and improvement is enabled.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China; Chinese Acad Sci, Lab Internet Software Technol, Beijing 100080, Peoples R China
¯\O0W@W: Li, MS, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, 4 S 4th St, Beijing 100080, Peoples R China.
5uP[®±{0W@W: mingshu@iscas.ac.cn
_(uvÂSe.spe: 49
«_!k: 2
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-34199-4
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 24
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEM16

--------------------------------------------------------------------------------
>f:y 112 agÿqQ 128 ag
\O: Zhang, S (Zhang, Shen); Wang, YJ (Wang, Yongji); Tong, J (Tong, Jie); Zhou, JH (Zhou, Jinhui); Ruan, L (Ruan, Li)
: Wang, Q; Pfahl, D; Raffo, DM; Wernick, P
h: Evaluation of project quality: A DEA-based approach
egnúQHrir: SOFTWARE PROCESS CHANGE, 3966: 88-96 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st Joint Conference of the Software Process Workshop/International Workshop on Software Process Simulation and Modeling (SPW/ProSim 2006)
O®åeg: MAY 20-21, 2006
O®0W¹p: Shanghai, PEOPLES R CHINA
KeyWords Plus: DATA ENVELOPMENT ANALYSIS; EFFICIENCY
Xd: The evaluation of project quality exhibits multivariable, VRS (variable return to scale) and decision maker's preference properties. In this paper, we present a Data Envelopment Analysis (DEA) based evaluation approach. The DEA VRS model, which handles multivariable and VRS effectively, is used to measure project quality. And the DEA cone ratio model, which utilizes Analytical Hierarchy Process (AHP) to constrain quality metrics with respect to decision maker's preference, is also adopted to analyze the return to scale of the projects. A case study, which assesses 10 projects from ITECHS and 20 "Top active" projects on sourceforge.net with the novel method, is demonstrated. The results indicate that our approach is effective for quality evaluation and can get accurate estimates of future possible improvements.
0W@W: Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China; Chinese Acad Sci, Key Lab Comp Sci, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Univ, Beijing 100039, Peoples R China
¯\O0W@W: Zhang, S, Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China.
5uP[®±{0W@W: zhangshen@itechs.iscas.ac.cn; ywang@itechs.iscas.ac.cn; tongjie@itechs.iscas.ac.cn; jinhui@itechs.iscas.ac.cn; ruanli@itechs.iscas.ac.cn
_(uvÂSe.spe: 10
«_!k: 3
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-34199-4
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEM16

--------------------------------------------------------------------------------
>f:y 113 agÿqQ 128 ag
\O: Li, MS (Li, Mingshu); Yang, QS (Yang, Qiusong); Zhai, J (Zhai, Jian); Yang, GW (Yang, Guowei)
: Wang, Q; Pfahl, D; Raffo, DM; Wernick, P
h: On mobility of software processes
egnúQHrir: SOFTWARE PROCESS CHANGE, 3966: 105-114 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st Joint Conference of the Software Process Workshop/International Workshop on Software Process Simulation and Modeling (SPW/ProSim 2006)
O®åeg: MAY 20-21, 2006
O®0W¹p: Shanghai, PEOPLES R CHINA
KeyWords Plus: ENGINEERING ENVIRONMENTS
Xd: In this paper, the mobility of software processes is proposed as a novel concept. It is defined as the structural change in a software process resulting from interactions among linked process elements. The concept addresses the essential change in a software process which brings a high variability and unpredictability to process performance. Three categories of the mobility that lead to the structural change are identified and expounded upon. A reference model for describing the concept is put forward based on the polyadic pi-calculus. With the mobility of software processes, it is possible to design a new PCSEE and associated PML with increased flexibilities.
0W@W: Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China; Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Univ, Beijing 100039, Peoples R China
¯\O0W@W: Li, MS, Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China.
5uP[®±{0W@W: mingshu@itechs.iscas.ac.cn; qiusong-yang@itechs.iscas.ac.cn; zhaijian@itechs.iscas.ac.cn; yangguowei@itechs.iscas.ac.cn
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-34199-4
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEM16

--------------------------------------------------------------------------------
>f:y 114 agÿqQ 128 ag
\O: Wang, Q (Wang, Qing); Xiao, JC (Xiao, Junchao); Li, MS (Li, Mingshu); Nisar, MW (Nisar, M. Wasif); Yuan, R (Yuan, Rong); Zhang, L (Zhang, Lei)
: Wang, Q; Pfahl, D; Raffo, DM; Wernick, P
h: A process-agent construction method for software process modeling in SoftPM
egnúQHrir: SOFTWARE PROCESS CHANGE, 3966: 204-213 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st Joint Conference of the Software Process Workshop/International Workshop on Software Process Simulation and Modeling (SPW/ProSim 2006)
O®åeg: MAY 20-21, 2006
O®0W¹p: Shanghai, PEOPLES R CHINA
Xd: Software development, unlike manufacturing industry, is highly dependent on the capabilities of individual software engineers and software development teams. SEI presents PSP and TSP to establish personal and team capabilities in the software process, to maintain them and assist organizations in conducting CMMI-Based process improvement. Thus, executors' capabilities should be taken into account as a key issue of the software process modeling method. ISCAS conducts research on,Qrganization-Entities capabilities-based software process modeling and presents a corresponding method. The Organization-Entities have definite capabilities and are called Process-Agents. The modeling method applies Agent technology to organize the basic process units and to establish the project process system self-adaptively according to the special project goal and constraining environment. In this paper, we present the method for constructing the Process-Agent. Each Process-Agent is comprised of two parts: Firstly, the infrastructure to describe Process-Agent's knowledge, and secondly the engine driven by external environment, used for reasoning Process-Agent's behavior based on its knowledge.
0W@W: Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Univ, Beijing 100039, Peoples R China; Chinese Acad Sci, Key Lab Comp Sci, Beijing 100080, Peoples R China
¯\O0W@W: Wang, Q, Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China.
5uP[®±{0W@W: wq@itechs.iscas.ac.cn; xiaojunchao@itechs.iscas.ac.cn; mingshu@itechs.iscas.ac.cn; wasif@itechs.iscas.ac.cn; yuanrong@itechs.iscas.ac.cn; zhanglei@itechs.iscas.ac.cn
_(uvÂSe.spe: 14
«_!k: 2
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-34199-4
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEM16

--------------------------------------------------------------------------------
>f:y 115 agÿqQ 128 ag
\O: Xiao, JC (Xiao, Junchao); Osterweil, LJ (Osterweil, Leon J.); Zhang, L (Zhang, Lei); Wise, A (Wise, Alexander); Wang, Q (Wang, Qing)
: Wang, Q; Pfahl, D; Raffo, DM; Wernick, P
h: Applying little-JIL to describe process-agent knowledge in SoftPM
egnúQHrir: SOFTWARE PROCESS CHANGE, 3966: 214-221 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st Joint Conference of the Software Process Workshop/International Workshop on Software Process Simulation and Modeling (SPW/ProSim 2006)
O®åeg: MAY 20-21, 2006
O®0W¹p: Shanghai, PEOPLES R CHINA
Xd: In a software process modeling method based upon the Organization-Entity capability, the Process-Agent is a well-defined unit whose role is to encapsulate an entity's knowledge, skill etc. The Process-Agent's infrastructure comprises descriptive knowledge, process knowledge and an experience library. The process knowledge is represented by process steps, whose execution determines the behaviors of the Process-Agent. This causes Process-Agent knowledge to be precisely described and well organized. In this paper, Little-JIL, a well-known process modeling language, is used to define a Process-Agent's process knowledge. Benefits for process element knowledge representation arising from Little-JIL's simplicity, semantic richness, expressiveness, formal and precise yet graphical syntax etc., are described.
0W@W: Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China; Grad Univ, Chinese Acad Sci, Beijing 100039, Peoples R China; Univ Massachusetts, Dept Comp Sci, Amherst, MA 01003 USA
¯\O0W@W: Xiao, JC, Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China.
5uP[®±{0W@W: xiaojunchao@itechs.iscas.ac.cn; ljo@cs.umass.edu; zhanglei@itechs.iscas.ac.cn; wise@cs.umass.edu; wq@itechs.iscas.ac.cn
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-34199-4
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEM16

--------------------------------------------------------------------------------
>f:y 116 agÿqQ 128 ag
\O: Wang, Q (Wang, Qing); Jiang, N (Jiang, Nan); Gou, L (Gou, Lang); Che, MR (Che, Meiru); Zhang, RH (Zhang, Ronghui)
: Wang, Q; Pfahl, D; Raffo, DM; Wernick, P
h: Practical experiences of cost/schedule measure through earned value management and statistical process control
egnúQHrir: SOFTWARE PROCESS CHANGE, 3966: 348-354 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 1st Joint Conference of the Software Process Workshop/International Workshop on Software Process Simulation and Modeling (SPW/ProSim 2006)
O®åeg: MAY 20-21, 2006
O®0W¹p: Shanghai, PEOPLES R CHINA
Xd: Cost and schedule measures are the most important support activities for the success of a project; it provides the basis for process improvement and project management. This paper reports practical experiences on using EVM (Earned Value Management) and SPC(Statistical Process Control) in cost/ schedule measure. The analysis of experience data indicates the distributions of CPI(Cost Performance Index) and SPI(Schedule Performance Index) index are generally following the normal distribution. And consequently, it is reasonable and effective to employ SPC in EVM.
0W@W: Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China; Grad Univ, Chinese Acad Sci, Beijing 100039, Peoples R China
¯\O0W@W: Wang, Q, Chinese Acad Sci, Inst Software, Lab Internet Software Technol, Beijing 100080, Peoples R China.
5uP[®±{0W@W: wq@itechs.iscas.ac.cn; jiangnan@itechs.iscas.ac.cn; goulang@itechs.iscas.ac.cn; chemeiru@itechs.iscas.ac.cn; hangronghui@itechs.iscas.ac.cn
_(uvÂSe.spe: 13
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-34199-4
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEM16

--------------------------------------------------------------------------------
>f:y 117 agÿqQ 128 ag
\O: Pu, F; Zhang, WH; Wang, SC
: Guelfi, N; Savidis, A
h: An improved case-based approach to LTL model checking
egnúQHrir: RAPID INTEGRATION OF SOFTWARE ENGINEERING TECHNIQUES, 3943: 190-202 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Workshop on Rapid Integration of Software Engineering Techniques (RISE 2005)
O®åeg: SEP 08-09, 2005
O®0W¹p: Heraklion, GREECE
O®^©RFU: ECRIM.; Inst Comp Sci, FORTH.; Fdn Res & Technol Hellas.; Fonds Natl Rech.; Software Engn Competence Ctr.
KeyWords Plus: STATIC ANALYSIS
Xd: The state space explosion is the key obstacle of model checking. Even a relatively small system specification may yield a very large state space. The case-based approach based on search space partition has been proposed in [18,19] for reducing model checking complexity. This paper extends the approach by considering wider ranges of case-bases of models and multiple case-bases such that it can be applied to more types of applications. The improved approach also combines the search space partition and static analysis or expert knowledge for guaranteeing the completeness of the cases. The case study demonstrates the potential advantages of the strategy and show that the strategy may improve the efficiency of system verification and therefore scale up the applicability of the verification approach.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Pu, F, Chinese Acad Sci, Inst Software, Comp Sci Lab, POB 8718, Beijing 100080, Peoples R China.
5uP[®±{0W@W: pufei@ios.ac.cn; zwh@ios.ac.cn; scwang@ios.ac.cn
_(uvÂSe.spe: 19
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-34063-7
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 13
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEL99

--------------------------------------------------------------------------------
>f:y 118 agÿqQ 128 ag
\O: Duan, YC; Fu, XL; Hu, QW; Gu, YQ
: Gavrilova, M; Gervasi, O; Kumar, V; Tan, CJK; Taniar, D; Lagana, A; Mun, Y; Choo, H
h: An ontology definition framework for model driven development
egnúQHrir: COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 4, 3983: 746-755 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Computational Science and Its Applications (ICCSA 2006)
O®åeg: MAY 08-AUG 11, 2003
O®0W¹p: Glasgow, SCOTLAND
O®^©RFU: IEE.; Univ Perugia.; Univ Calgary.; Univ Minnesota.; Queens Univ Belfast.; ERCIM.; OptimaNumerics.; INTEL.; AMD.
Xd: Ontologies are increasingly adopted to facilitate the model driven software development (MDSD). The issue of intertransformations among various ontologies is quickly growing prominent. Some explain that variation of ontology definition should be accepted as a must. We would agree with the point that the definition of ontology for the MDSD should be further standardized with tools. In this paper, the ontology definition for the MDSD is systematically analyzed from the philosophical and human cognitional views. Based on a few metaconcepts, ontology creation and evaluation modes are proposed. By providing general precise and consistent semantics for development elements, this framework will considerably improve the development of models of automation oriented development MDSD processes. Experimental applications on intertransformations and unifications of semantics of existing modeling languages are very encouraging.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Chinese Acad Sci, Inst Psychol, State Key Lab Brain & Cognit Sci, Beijing 100101, Peoples R China
¯\O0W@W: Duan, YC, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: duanyucong@263.net; fuxl@psych.ac.cn; huqingwu@bjronghai.com; guyq@sinosoftgroup.com
_(uvÂSe.spe: 29
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-34077-7
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEL02

--------------------------------------------------------------------------------
>f:y 119 agÿqQ 128 ag
\O: Ji, JF; Wu, EH; Li, S; Liu, XH
h: View-dependent refinement of multiresolution meshes using programmable graphics hardware
egnúQHrir: VISUAL COMPUTER, 22 (6): 424-433 JUN 2006
í: English
e.s{|W: Proceedings Paper
O®h: Computer Graphics International Conference (CGI 2005)
O®åeg: JUN 22-24, 2005
O®0W¹p: Stony Brook, NY
O®^©RFU: IEEE Comp Soc, VGTC.; ACM SIGGRAPH.
\OsQ.Í: view-dependent multiresolution rendering; level of detail (LOD); quadtree; texture atlas; graphics processing unit (GPU)
Xd: View-dependent multiresolution rendering places a heavy load on CPU. This paper presents a new method on view-dependent refinement of multiresolution meshes by using the computation power of modern programmable graphics hardware (GPU). Two rendering passes using this method are included. During the first pass, the level of detail selection is performed in the fragment shaders. The resultant buffer from the first pass is taken as the input texture to the second rendering pass by vertex texturing, and then the node culling and triangulation can be performed in the vertex shaders. Our approach can generate adaptive meshes in real-time, and can be fully implemented on GPU. The method improves the efficiency of mesh simplification, and significantly alleviates the computing load on CPU.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China; Univ Macau, Fac Sci & Technol, Dept Comp & Informat Sci, Macao, Peoples R China; Chinese Acad Sci, Grad Univ, Beijing, Peoples R China; State Informat Ctr, Beijing, Peoples R China; Peking Univ, Sch Elect Engn & Comp Sci, Beijing 100871, Peoples R China
¯\O0W@W: Ji, JF, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China.
5uP[®±{0W@W: jijfn@cei.gov.cn; ehwu@umac.mo; lisheng@graphics.pku.edu.cn; lxh@ios.ac.cn
_(uvÂSe.spe: 0
«_!k: 1
úQHrFU: SPRINGER
úQHrFU0W@W: 233 SPRING STREET, NEW YORK, NY 10013 USA
ISSN: 0178-2789
DOI: 10.1007/s00371-006-0020-8
29 W[&{vegnúQHrir
Tðy)Q: VISUAL COMPUT
ISO egne.súQHrir
Tðy)Q: Visual Comput.
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: 053BL

--------------------------------------------------------------------------------
>f:y 120 agÿqQ 128 ag
\O: Cao, TJ; Mao, XP; Lin, DD
: Chen, K; Deng, R; Lai, XJ; Zhou, JY
h: Security analysis of a server-aided RSA key generation protocol
egnúQHrir: INFORMATION SECURITY PRACTICE AND EXPERIENCE, PROCEEDINGS, 3903: 314-320 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd Information Security Practice and Experience Conference (ISPEC 2006)
O®åeg: APR 11-14, 2006
O®0W¹p: Hangzhou, PEOPLES R CHINA
O®^©RFU: Shanghai Jiaotong Univ.; Singapore Management Univ.; Inst Infocomm Res.
\OsQ.Í: collusion attack; server-aided RSA key generation; handheld device
Xd: Modadugu, Boneh and Kim proposed two RSA key generation protocols (MBK Protocols) to generate the RSA keys efficiently on a low-power handheld device with the help of the untrusted servers, and the servers do not get any useful information about the keys they helped generation. The security of MBK Protocols is based on the assumption that the two servers are unable to share information with each other. To resists a "collusion attack" namely the attack which the two servers collude to share information in MBK Protocols, Chen et al. proposed two improved protocols and claimed that their protocols are secure against such collusion attack. This paper shows that Chen et al.'s standard RSA key generation protocol cannot resist collusion attack and then cannot be used in practice.
0W@W: China Univ Min & Technol, Sch Comp Sci & Technol, Xuzhou 221008, Peoples R China; Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China
¯\O0W@W: Cao, TJ, China Univ Min & Technol, Sch Comp Sci & Technol, Xuzhou 221008, Peoples R China.
5uP[®±{0W@W: tjcao@is.iscas.ac.cn
_(uvÂSe.spe: 19
«_!k: 4
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-33052-6
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEG62

--------------------------------------------------------------------------------
>f:y 121 agÿqQ 128 ag
\O: Jiang, ZH; Lin, DD; Xu, L; Lin, L
: Chen, K; Deng, R; Lai, XJ; Zhou, JY
h: Integrating grid with cryptographic computing
egnúQHrir: INFORMATION SECURITY PRACTICE AND EXPERIENCE, PROCEEDINGS, 3903: 321-331 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 2nd Information Security Practice and Experience Conference (ISPEC 2006)
O®åeg: APR 11-14, 2006
O®0W¹p: Hangzhou, PEOPLES R CHINA
O®^©RFU: Shanghai Jiaotong Univ.; Singapore Management Univ.; Inst Infocomm Res.
Xd: Cryptographic and information security applications often involve many time-consuming computations, which need to be completed over heterogenous and geographically distributed computers. However, there lacks a general-purpose cryptographic computing environment. Grid technology can play a significant role in providing an efficient computational support for cryptographic applications. In this paper, we describe a general-purpose software architecture called Crypto-Grid for distributed high-performance cryptographic computing, which is designed on the top level of computational grid mechanisms, supported by grid environments such as Globus. The prototype implementation of Crypto-Grid under CT4 and experiment evaluation are also revealed.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China
¯\O0W@W: Jiang, ZH, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China.
5uP[®±{0W@W: jzh@is.iscas.ac.cn; ddlin@is.iscas.ac.cn; xulin@is.iscas.ac.cn; rockylin@is.iscas.ac.cn
_(uvÂSe.spe: 15
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-33052-6
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 11
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEG62

--------------------------------------------------------------------------------
>f:y 122 agÿqQ 128 ag
\O: Wang, WC; Li, KY; Wu, EH
h: Stick textures for image-based rendering
egnúQHrir: GRAPHICAL MODELS, 68 (3): 294-306 MAY 2006
í: English
e.s{|W: Proceedings Paper
O®h: 10th Symposium on Solid and Physical Modelling
O®åeg: JUN 13-15, 2005
O®0W¹p: Cambridge, MA
O®;NR¹e: MIT
\OsQ.Í: graphics data structures and data types; graphics processors; image-based rendering; object representation
Xd: This paper presents a new data structure, called stick textures, to give a continuous and compact 3D representation of the scene displayed in depth images. A stick texture is constructed for each pixel of a depth image, composed of the interpolated pixels to fill the gaps between the pixel and its neighbour pixels covered by a same continuous surface. Thus, rendering sticks instead of pixels can save operations on hole-filling for acceleration, and produce high quality novel images with 3D details and view motion parallax displayed very well. In addition, stick textures are always short, and every stick texture can be rendered as a pixel. Therefore, stick textures have not a high storage requirement, and they can be easily integrated with existing image-based rendering methods to achieve high rendering efficiency, e.g., using GPUs for acceleration and conveniently handling large-scale scenes, even the scenes with multi-layered objects. Experimental results demonstrate the advantages of stick textures in image quality, rendering speed and storage requirement. (c) 2006 Elsevier Inc. All rights reserved.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China; Univ Macau, Fac S&T, Dept Comp & Informat Sci, Macao, Peoples R China
¯\O0W@W: Wang, WC, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China.
5uP[®±{0W@W: whn@ios.ac.cn
_(uvÂSe.spe: 28
«_!k: 1
úQHrFU: ACADEMIC PRESS INC ELSEVIER SCIENCE
úQHrFU0W@W: 525 B ST, STE 1900, SAN DIEGO, CA 92101-4495 USA
ISSN: 1524-0703
DOI: 10.1016/j.gmod.2006.02.002
29 W[&{vegnúQHrir
Tðy)Q: GRAPH MODELS
ISO egne.súQHrir
Tðy)Q: Graph. Models
egne.sux¡pe: 13
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: 042HQ

--------------------------------------------------------------------------------
>f:y 123 agÿqQ 128 ag
\O: Teng, DX (Teng, Dongxing); Ma, CX (Ma, CuiXia); Zhou, MJ (Zhou, Mingjun); Wang, HG (Wang, Hongan); Dai, GZ (Dai, Guozhong); Dong, XH (Dong, Xinghui); Wu, HY (Wu, Huiyue)
: Shen, W; Chao, KM; Lin, Z; Barthes, JPA; James, A
h: Research on collaborative editing environment for conceptual design of 3D object
egnúQHrir: COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN II, 3865: 445-454 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 9th International Conference on Computer Supported Cooperative Work in Design
O®åeg: MAY 24-26, 2005
O®0W¹p: Coventry, ENGLAND
O®^©RFU: Coventry Univ.; IEEE.; IEE.; British Comp Soc.
Xd: Effective editing tools are very important to innovative design of 3D object. The technologies for designing tools presented in this paper mainly involve collaborative mechanism and natural interaction for collaborative editing environment. For collaborative mechanism, three aspects are covered in this paper: one aspect is 3D object attributes analysis which is essential to the conflict solution of collaborative design process. Interaction transaction log of 3D collaborative editing environment and the system architecture are put forward and addressed as another two aspects. Furthermore, based on interactive transaction log, the collaborative editing mechanism is constructed and the conflict detection strategy during multi-user concurrency editing process is also discussed. As for interaction naturalness, the pen-based gestures appropriate to manipulating 3D model are covered briefly. Finally a prototype system has been built to fully explore the above technologies.
0W@W: Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing, Peoples R China; Capital Normal Univ, Informat Engn Coll, Beijing, Peoples R China
¯\O0W@W: Teng, DX, Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing, Peoples R China.
5uP[®±{0W@W: tengdongxing@tsinghua.org.cn; dongxinghui@tsinghua.org.cn; wuhuiyue@sohu.com
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-32969-2
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BEF13

--------------------------------------------------------------------------------
>f:y 124 agÿqQ 128 ag
\O: Wang, WC; Wei, F; Wu, EH
h: View dependent sequential point trees
egnúQHrir: JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 21 (2): 181-188 MAR 2006
í: English
e.s{|W: Proceedings Paper
O®h: 13th Pacific Conference on Computer Graphics and Applications
O®åeg: OCT 12-14, 2005
O®0W¹p: Macao, PEOPLES R CHINA
\OsQ.Í: view dependence; visibility culling; CPU; point-based rendering; real time rendering
Xd: Sequential point trees provide the state-of-the-art technique for rendering point models, by re-arranging hierarchical points sequentially according to geometric errors running on CPU for fast rendering. This paper presents a view dependent method to augment sequential point trees by embedding the hierarchical tree structures in the sequential list of hierarchical points. By the method, two kinds of indices are constructed to facilitate the points rendering in an order mostly from near to far and from coarse to fine. As a result, invisible points can be culled view-dependently in high efficiency for hardware acceleration, and at the same time, the advantage of sequential point trees could be still fully taken. Therefore; the new method can run much faster than the conventional sequential point trees, and the acceleration can be highly promoted particularly when the objects possess complex occlusion relationship and viewed closely because invisible points would be in a high percentage of the points at finer levels.
0W@W: Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China; Univ Macau, Fac Sci & Technol, Dept Comp & Informat Sci, Macao, Peoples R China; Grad Univ, Chinese Acad Sci, Beijing 100039, Peoples R China
¯\O0W@W: Wang, WC, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China.
5uP[®±{0W@W: whn@ios.ac.cn; weif@ios.ac.cn; ehwu@umac.mo
_(uvÂSe.spe: 25
«_!k: 0
úQHrFU: SCIENCE PRESS
úQHrFU0W@W: 16 DONGHUANGCHENGGEN NORTH ST, BEIJING 100717, PEOPLES R CHINA
ISSN: 1000-9000
29 W[&{vegnúQHrir
Tðy)Q: J COMPUT SCI TECHNOL
ISO egne.súQHrir
Tðy)Q: J. Comput. Sci. Technol.
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Hardware & Architecture; Computer Science, Software Engineering
ISI e.s O÷S: 025UP

--------------------------------------------------------------------------------
>f:y 125 agÿqQ 128 ag
\O: Huang, L; Li, L; Tan, Q
: Shen, HT; Li, JB; Li, ML; Ni, J; Wang, W
h: Behavior-based trust in wireless sensor network
egnúQHrir: ADVANCED WEB AND NETWORK TECHNOLOGIES, AND APPLICATIONS, PROCEEDINGS, 3842: 214-223 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 8th Asia-Pacific Web Conference and Workshops (APWeb 2006)
O®åeg: JAN 16-18, 2006
O®0W¹p: Harbin, PEOPLES R CHINA
O®^©RFU: Natl Nat Sci Fdn China.; Australian Res Council Res Network EII.; Harbin Inst Technol.; Heilongjiang Univ.; Hohai Univ.; Yellow River Conservat Commiss.
Xd: The resource constraints of wireless sensor network make it easy to attack and hard to protect. Although carefully designed cryptography and authentication help to make WSN securer, they are not good at dealing with compromised node and ageing node, whose misbehavior may impair the function of WSN. Behavior-based trust mechanism, which is a variant of reputation-based trust in eCommerce, can be used to address this problem. The framework and related techniques of behavior-based trust are discussed in this paper.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Huang, L, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
5uP[®±{0W@W: huanglei04@ios.cn; lili@ios.cn; tqhlff@public3.bta.net.cn
_(uvÂSe.spe: 26
«_!k: 1
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-31158-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDV63

--------------------------------------------------------------------------------
>f:y 126 agÿqQ 128 ag
\O: Li, J; Gu, Y; Zhang, W; Zhao, BH
: Shen, HT; Li, JB; Li, ML; Ni, J; Wang, W
h: MIMO techniques in cluster-based wireless sensor networks
egnúQHrir: ADVANCED WEB AND NETWORK TECHNOLOGIES, AND APPLICATIONS, PROCEEDINGS, 3842: 291-296 2006
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 8th Asia-Pacific Web Conference and Workshops (APWeb 2006)
O®åeg: JAN 16-18, 2006
O®0W¹p: Harbin, PEOPLES R CHINA
O®^©RFU: Natl Nat Sci Fdn China.; Australian Res Council Res Network EII.; Harbin Inst Technol.; Heilongjiang Univ.; Hohai Univ.; Yellow River Conservat Commiss.
Xd: Advances in microsensor and radio technology will enable small but smart sensors to be deployed for a wide range of environment monitoring applications. Most architectures of wireless sensor networks (WSN) are built as homogeneous networks, where all sensor nodes have the same structure. But it is not suitable for cluster-based WSN. By using multi-antenna sensor node (MASN) as the cluster head (CH), we import multi-input-multi-output (MIMO) and single-input-multi-output (SIMO) communication modes into WSN. In this network scenario, tremendous energy saving is possible when transmission range is larger than a given threshold. This paper motivates and describes the realization of the inhomogeneous network, special communication scheme and simulation of energy consumption and delay model of it.
0W@W: Univ Sci & Technol China, Dept Comp Sci, Hefei 230027, Anhui, Peoples R China; Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Li, J, Univ Sci & Technol China, Dept Comp Sci, Hefei 230027, Anhui, Peoples R China.
5uP[®±{0W@W: ajing@mail.ustc.edu.cn; guyu@mail.ustc.edu.cn; bho@mail.ustc.edu.cn; bhzhao@ustc.edu.cn
_(uvÂSe.spe: 5
«_!k: 2
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 3-540-31158-0
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BDV63

--------------------------------------------------------------------------------
>f:y 127 agÿqQ 128 ag
\O: Sun, HC
h: Approximate eigen-decomposition preconditioners for solving numerical PDE problems
egnúQHrir: APPLIED MATHEMATICS AND COMPUTATION, 172 (2): 772-787 JAN 15 2006
í: English
e.s{|W: Proceedings Paper
O®h: Meeting on Scientific Computing in Numerical PDEs, Matrix Theory and Engineering Application
O®åeg: JAN 12, 2004
O®0W¹p: Hong Kong, PEOPLES R CHINA
O®;NR¹e: Univ Hong Kong
Xd: Approximate matrix inverse has played key role in constructing preconditioners since last 1990s, because of their solid theoretical background, Sparse approximate inverse preconditioners (SAIPs) have attracted much attention recently, because their potential usefulness in a parallel environment. As a general matrix approach, in this paper, we propose an approximate eigen-decomposition preconditioners by combining a FFT-like multiplication algorithm. Some numerical tests are given to show this algorithm is more effective than the traditional method such as ILU with PETSc for solving a wide class of discrete elliptic problems. (c) 2004 Elsevier Inc. All rights reserved.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Sun, HC, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
5uP[®±{0W@W: sun@mail.rdcps.ac.cn
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: ELSEVIER SCIENCE INC
úQHrFU0W@W: 360 PARK AVE SOUTH, NEW YORK, NY 10010-1710 USA
ISSN: 0096-3003
DOI: 10.1016/j.amc.2004.11.018
29 W[&{vegnúQHrir
Tðy)Q: APPL MATH COMPUT
ISO egne.súQHrir
Tðy)Q: Appl. Math. Comput.
egne.sux¡pe: 16
f[Ñy{|+R: Mathematics, Applied
ISI e.s O÷S: 015NF

--------------------------------------------------------------------------------
>f:y 128 agÿqQ 128 ag
\O: Chong, CT; Li, A; Yang, Y
h: The existence of high nonbounding degrees in the difference hierarchy
egnúQHrir: ANNALS OF PURE AND APPLIED LOGIC, 138 (1-3): 31-51 MAR 2006
í: English
e.s{|W: Proceedings Paper
O®h: NZIMA Logic and Computation Workshop
O®åeg: JAN 11-16, 2004
O®0W¹p: Tahuna Beach, NEW ZEALAND
O®^©RFU: New Zealand Inst Math & Applicat.
\OsQ.Í: nonbounding; jump classes; Ershov hierarchy
KeyWords Plus: MINIMAL PAIRS
Xd: We study the jump hierarchy of d.c.e. Turing degrees and show that there exists a high d.c.e. degree d which does not bound any minimal pair of d.c.e. degrees. (c) 2005 Elsevier B.V. All rights reserved.
0W@W: Natl Univ Singapore, Fac Sci, Dept Math, Singapore 119260, Singapore; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Yang, Y, Natl Univ Singapore, Fac Sci, Dept Math, Lower Kent Ridge Rd, Singapore 119260, Singapore.
5uP[®±{0W@W: chongct@math.nus.edu.sg; angsheng@gcl.iscas.ac.cn; matyangy@leonis.nus.edu.sg
_(uvÂSe.spe: 14
«_!k: 1
úQHrFU: ELSEVIER SCIENCE BV
úQHrFU0W@W: PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
ISSN: 0168-0072
DOI: 10.1016/j.apal.2005.06.005
29 W[&{vegnúQHrir
Tðy)Q: ANN PURE APPL LOGIC
ISO egne.súQHrir
Tðy)Q: Ann. Pure Appl. Log.
egne.sux¡pe: 21
f[Ñy{|+R: Mathematics, Applied; Mathematics
ISI e.s O÷S: 995KA

ISTP 2007
>f:y 1 agÿqQ 114 ag
\O: Qiao, Y (Qiao, Ying); Zhong, K (Zhong, Kang); Wang, HA (Wang, HongAn); Li, X (Li, Xiang)
fNM|âVSO\O: ACM
h: Developing Event-condition-action Rules in Real-time Active Database
egnúQHrir: APPLIED COMPUTING 2007, VOL 1 AND 2: 511-516 2007
í: English
e.s{|W: Proceedings Paper
O®h: 22nd ACM Symposium on Applied Computing
O®åeg: MAR 11-15, 2007
O®0W¹p: Seoul, SOUTH KOREA
O®^©RFU: ACM.
\OsQ.Í: Event-condition-action Rules; Real-time Active Database; Temporal; Reasoning; Event
KeyWords Plus: SYSTEM
Xd: Traditional event-condition-action (ECA) rules in real-time active database (RTADB) lack the capabilities to express complicated quantitative temporal information in the system. To solve this problem, in this paper, we present graphical ECA rules with a set of novel temporal events to specify Teal-time constraints. Smart home applications are used to validate the proposed rules.
0W@W: [Qiao, Ying; Zhong, Kang; Wang, HongAn; Li, Xiang] Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100080, Peoples R China
¯\O0W@W: Qiao, Y, Chinese Acad Sci, Inst Software, Intelligence Engn Lab, 4 S 4th St, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 1
úQHrFU: ASSOC COMPUTING MACHINERY
úQHrFU0W@W: 1515 BROADWAY, NEW YORK, NY 10036-9998 USA
ISBN: 978-1-59593-480-2
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Interdisciplinary Applications
ISI e.s O÷S: BKI57

--------------------------------------------------------------------------------
>f:y 2 agÿqQ 114 ag
\O: Cheng, XW (Cheng, Xinwu); Li, L (Li, Lei); Wei, J (Wei, Jun)
fNM|âVSO\O: ACM
h: Automatic Enactment of Message Exchange Pattern for Web Services
egnúQHrir: APPLIED COMPUTING 2007, VOL 1 AND 2: 1649-1653 2007
í: English
e.s{|W: Proceedings Paper
O®h: 22nd ACM Symposium on Applied Computing
O®åeg: MAR 11-15, 2007
O®0W¹p: Seoul, SOUTH KOREA
O®^©RFU: ACM.
\OsQ.Í: Message exchange pattern; automatic; enactment; formalization
Xd: Message Exchange Pattern (MEP) is a challenging problem in the interaction of Web services. However, by means of the non-formal descriptions, such as in SOAP and WSDL, it is impossible to conduct precise definition of MEPs, thus leading to potential ambiguities that can degrade the interoperability of Web services. Moreover, it is difficult to enact the MEPs automatically, which means the Web services infrastructure has to hard-code the support for various MEP's and it is also difficult to be extended. In this paper, we propose an automatic enactment of MEPs for Web services. The enactment consists of two parts. The first part is the formal description method for MEPs, which is used to define MEP accurately with no ambiguities. The second part is the automatic enactment framework, which will automatically enact a new MEP through a MEP process machine that is generated according to the MEP definition. New MEPs would become easy to be engaged in Web services.
0W@W: [Cheng, Xinwu; Wei, Jun] Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing, Peoples R China
¯\O0W@W: Cheng, XW, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing, Peoples R China.
_(uvÂSe.spe: 10
«_!k: 0
úQHrFU: ASSOC COMPUTING MACHINERY
úQHrFU0W@W: 1515 BROADWAY, NEW YORK, NY 10036-9998 USA
ISBN: 978-1-59593-480-2
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Interdisciplinary Applications
ISI e.s O÷S: BKI57

--------------------------------------------------------------------------------
>f:y 3 agÿqQ 114 ag
\O: Flatt, M (Flatt, Matthew); Yu, G (Yu, Gang); Findler, RB (Findler, Robert Bruce); Felleisen, M (Felleisen, Matthias)
fNM|âVSO\O: ACM
h: Adding Delimited and Composable Control to a Production Programming Environment
egnúQHrir: ICFP'07 PROCEEDINGS OF THE 2007 ACM SIGPLAN INTERNATIONAL CONFERENCE ON FUNCTIONAL PROGRAMMING: 165-176 2007
í: English
e.s{|W: Proceedings Paper
O®h: 12th ACM SIGPLAN International Conference on Functional Programming
O®åeg: OCT 01-03, 2007
O®0W¹p: Freiburg, GERMANY
Xd: Operators for delimiting control and for capturing composable continuations litter the landscape of theoretical programming language research. Numerous papers explain their advantages, how the operators explain each other (or don't), and other aspects of the operators' existence. Production programming languages, however, do not support these operators, partly because their relationship to existing and demonstrably useful constructs-such as exceptions and dynamic binding-remains relatively unexplored.
In this paper, we report on our effort of translating the theory of delimited and composable control into a viable implementation for a production system. The report shows how this effort involved a substantial design element, including work with a formal model, as well as significant practical exploration and engineering.
The resulting version of PUT Scheme incorporates the expressive combination of delimited and composable control alongside dynamic-wind, dynamic binding, and exception handling. None of the additional operators subvert the intended benefits of existing control operators, so that programmers can freely mix and match control operators.
0W@W: [Flatt, Matthew] Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Flatt, M, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 32
«_!k: 0
úQHrFU: ASSOC COMPUTING MACHINERY
úQHrFU0W@W: 1515 BROADWAY, NEW YORK, NY 10036-9998 USA
ISBN: 978-1-59593-815-2
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: BJT62

--------------------------------------------------------------------------------
>f:y 4 agÿqQ 114 ag
\O: Tian, F (Tian, Feng); Ao, X (Ao, Xiang); Wang, HA (Wang, Hongan); Setlur, V (Setlur, Vidya); Dai, GZ (Dai, Guozhong)
fNM|âVSO\O: ACM
h: The Tilt Cursor: Enhancing Stimulus-Response Compatibility by Providing 3D Orientation Cue of Pen
egnúQHrir: CONFERENCE ON HUMAN FACTORS IN COMPUTING SYSTEMS, VOL 1 AND 2: 303-306 2007
í: English
e.s{|W: Proceedings Paper
O®h: Conference on Human Factors in Computing Systems
O®åeg: APR 28-MAY 03, 2007
O®0W¹p: San Jose, CA
O®^©RFU: SIGCHI.; Assoc Comp Machinery.
\OsQ.Í: Cursor; Pen; Orientation; Stimulus-Response Compatibility
Xd: In order to improve stimulus-response compatibility of touchpad in pen-based user interface, we present the tilt cursor, i.e. a cursor dynamically reshapes itself to providing the 3D orientation cue of pen. We also present two experiments that evaluate the tilt cursor's performance in circular menu selection and specific marking menu selection tasks. Results show that in a specific marking menu selection task, the tilt cursor significantly outperforms the shape-fixed arrow cursor and the live cursor [4]. In addition, results show that by using the tilt cursor, the response latencies for adjusting drawing directions are smaller than that by using the other two kinds of cursors.
0W@W: [Tian, Feng; Ao, Xiang; Wang, Hongan; Dai, Guozhong] Chinese Acad Sci, Intelligence Engn Lab, Inst Software, Beijing, Peoples R China
¯\O0W@W: Tian, F, Chinese Acad Sci, Intelligence Engn Lab, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: ASSOC COMPUTING MACHINERY
úQHrFU0W@W: 1515 BROADWAY, NEW YORK, NY 10036-9998 USA
ISBN: 978-1-59593-593-9
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Cybernetics
ISI e.s O÷S: BJT07

--------------------------------------------------------------------------------
>f:y 5 agÿqQ 114 ag
\O: Zhu, HB (Zhu, Hongbin); Bao, K (Bao, Kai); Wu, EH (Wu, Enhua); Liu, XH (Liu, Xuehui)
fNM|âVSO\O: ACM
h: Stable and Efficient Miscible Liquid-liquid Interactions
egnúQHrir: VRST 2007: ACM SYMPOSIUM ON VIRTUAL REALITY SOFTWARE AND TECHNOLOGY, PROCEEDINGS: 55-63 2007
í: English
e.s{|W: Proceedings Paper
O®h: ACM Symposium on Virtual Reality Software and Technology
O®åeg: NOV 05-07, 2007
O®0W¹p: Newport Beach, CA
O®^©RFU: ACM SIGGRAPH.; ACM SIGCHI.
\OsQ.Í: miscible mixture; lattice Boltzmann method; subgrid model; free surface; stability; control; memory optimization; multi-core system
KeyWords Plus: LATTICE BOLTZMANN METHOD; SMOKE ANIMATION; ENVIRONMENT; SIMULATION
Xd: In our surrounding environment, we may often see many various miscible liquid-liquid mixture phenomena, like pouring honey or ink into water, Coca Cola into strong wine etc., while few papers have devoted to the simulation of the phenomena. In this paper, we use a two-fluid lattice Boltzmann method (TFLBM) to simulate the underlying dynamics of miscible mixtures. By the method, a subgrid model is applied to improve its numerical stability so that the free surface of the mixture, accompanying with higher Reynolds number, can be simulated. We also apply control forces to the mixture with interesting animation created. By optimizing the memory structure and taking the advantage of dual-core or multi-core systems, we achieve real time computation for a domain in 64(3) cells full of' fluid mixtures.
0W@W: [Zhu, Hongbin; Liu, Xuehui] Chinese Acad Sci, State Key Lab Comp Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Zhu, HB, Chinese Acad Sci, State Key Lab Comp Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 41
«_!k: 0
úQHrFU: ASSOC COMPUTING MACHINERY
úQHrFU0W@W: 1515 BROADWAY, NEW YORK, NY 10036-9998 USA
ISBN: 978-1-59593-863-3
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Software Engineering; Imaging Science & Photographic Technology
ISI e.s O÷S: BJI48

--------------------------------------------------------------------------------
>f:y 6 agÿqQ 114 ag
\O: Huang, L (Huang, Lei); Li, L (Li, Lei); Liu, LX (Liu, Lixiang); Zhang, HB (Zhang, Haibin); Tang, LS (Tang, Linsha)
fNM|âVSO\O: ACM
h: Stimulating Cooperation in Route Discovery of Ad Hoc Networks
egnúQHrir: Q2SWINET'07: PROCEEDINGS OF THE THIRD ACM WORKSHOP ON Q2S AND SECURITY FOR WIRELESS AND MOBILE NETWORKS: 39-46 2007
í: English
e.s{|W: Proceedings Paper
O®h: 2rd ACM Workshop on Q26 and Security for Wireless and Mobile Networks
O®åeg: OCT 22, 2007
O®0W¹p: Chania, GREECE
O®^©RFU: ACM SIGSIM.
\OsQ.Í: Ad hoc network; Routing cooperation; Reputation-based incentive mechanism; Game theory
Xd: In autonomous ad hoc network, nodes belonging to different entities try to maximize their own utilities. Selfish dropping of route control packets relieves node of relaying packets for others and saves its own resources. Current watchdog or ACK-based detection scheme cannot cope with it, effectively. Based on statistics relation of route control packets within neighborhood, this paper proposed an energy-efficient distributed algorithm to detect the selfishness in route discovery. Relation between key parameter setting, algorithm's effectiveness and performance was analyzed with tool of game theory. Extensive simulations showed that the algorithm could detect and punish the selfish nodes effectively.
0W@W: [Huang, Lei; Li, Lei; Liu, Lixiang; Zhang, Haibin; Tang, Linsha] Chinese Acad Sci, Gen Software Lab, Inst Software, Beijing, Peoples R China
¯\O0W@W: Huang, L, Chinese Acad Sci, Gen Software Lab, Inst Software, Zhong Guan Cun S 4th St, Beijing, Peoples R China.
_(uvÂSe.spe: 22
«_!k: 0
úQHrFU: ASSOC COMPUTING MACHINERY
úQHrFU0W@W: 1515 BROADWAY, NEW YORK, NY 10036-9998 USA
ISBN: 978-1-59593-806-0
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Hardware & Architecture; Computer Science, Theory & Methods; Telecommunications
ISI e.s O÷S: BJI46

--------------------------------------------------------------------------------
>f:y 7 agÿqQ 114 ag
\O: Wan, XY (Wan, Xiying); Zhang, XW (Zhang, Xiwen); Dai, GZ (Dai, Guozhong)
: Puerta, A; Lau, T
h: Tracking of Deformable Human Hand in Real Time as Continuous Input for Gesture-based Interaction
egnúQHrir: 2007 INTERNATIONAL CONFERENCE ON INTELLIGENT USER INTERFACES: 235-242 2007
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Intelligent User Interfaces
O®åeg: JAN 28-31, 2007
O®0W¹p: Hawaii, HI
O®^©RFU: ACM SIGART.; ACM SIGGHI.
\OsQ.Í: Hand tracking; Multi-finger tracking; Gesture input; Gesture-based interaction
KeyWords Plus: RECOGNITION; MODELS
Xd: Gesture input is a natural and effective interactive model. The tracking of deformable hand gesture is a very important task in gesture-based interaction. A novel real-time tracking approach is proposed to capture hand motion with single camera. It combines the characters of model-based and appearance-based method. The presented approach achieves auto-initialization by posture recognition and matching with image features. It solves the problem of interference among fingers Successfully by the integration of K-Means clustering and Particle Filters. Moreover, tracking detection realizes resumption from tracking failure and automatic update of hand model. Experiments show that, the proposed method can achieve continuous real-time tracking of deformable hand gesture, and meets the requirements for gesture-based Human-Cornputer Interaction.
0W@W: [Wan, Xiying; Zhang, Xiwen; Dai, Guozhong] Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing, Peoples R China
¯\O0W@W: Wan, XY, Chinese Acad Sci, Inst Software, Intelligence Engn Lab, POB 8718, Beijing, Peoples R China.
_(uvÂSe.spe: 22
«_!k: 0
úQHrFU: ASSOC COMPUTING MACHINERY
úQHrFU0W@W: 1515 BROADWAY, NEW YORK, NY 10036-9998 USA
ISBN: 978-1-59593-481-9
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Artificial Intelligence; Imaging Science & Photographic Technology
ISI e.s O÷S: BJG98

--------------------------------------------------------------------------------
>f:y 8 agÿqQ 114 ag
\O: Ao, X (Ao, Xiang); Wang, XG (Wang, Xugang); Tian, F (Tian, Feng); Dai, GZ (Dai, Guozhong); Wang, HG (Wang, Hongan)
: Puerta, A; Lau, T
h: Crossmodal Error Correction of Continuous Handwriting Recognition by Speech
egnúQHrir: 2007 INTERNATIONAL CONFERENCE ON INTELLIGENT USER INTERFACES: 243-250 2007
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Intelligent User Interfaces
O®åeg: JAN 28-31, 2007
O®0W¹p: Hawaii, HI
O®^©RFU: ACM SIGART.; ACM SIGGHI.
\OsQ.Í: Error correction; multimodal fusion; handwriting recognition; speech; phoneme; weighted phoneme
KeyWords Plus: STRATEGIES; RECOVERY
Xd: In recognition-based user interface, users' satisfaction is determined not only by recognition accuracy but also by effort to correct recognition errors. In this paper, we introduce a crossmodal error correction technique, Which allows users to correct errors of Chinese handwriting recognition by speech. The focus of the paper is a multimodal fusion algorithm supporting the crossmodal error correction. By fusing handwriting and speech recognition, the algorithm can correct errors in both character extraction and recognition of handwriting. The experimental result indicates that the algorithm is effective and efficient. Moreover, the evaluation also shows the correction technique can help users to correct errors in handwriting recognition more efficiently than the other two error correction techniques.
0W@W: [Ao, Xiang; Wang, Xugang; Tian, Feng; Dai, Guozhong; Wang, Hongan] Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing, Peoples R China
¯\O0W@W: Ao, X, Chinese Acad Sci, Inst Software, Intelligence Engn Lab, POB 8718, Beijing, Peoples R China.
_(uvÂSe.spe: 20
«_!k: 0
úQHrFU: ASSOC COMPUTING MACHINERY
úQHrFU0W@W: 1515 BROADWAY, NEW YORK, NY 10036-9998 USA
ISBN: 978-1-59593-481-9
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Artificial Intelligence; Imaging Science & Photographic Technology
ISI e.s O÷S: BJG98

--------------------------------------------------------------------------------
>f:y 9 agÿqQ 114 ag
\O: Zhang, YH (Zhang, Yuanhai); Xu, J (Xu, Jin); Huangfu, W (Huangfu, Wei); Li, KH (Li, Kaihui); Xu, CQ (Xu, Changqiao)
fNM|âVSO\O: IEEE
h: Joint sender/receiver rate control algorithm for scalable video streaming
egnúQHrir: GLOBECOM 2007: 2007 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-11: 2048-2052 2007
NfNh: IEEE Global Telecommunications Conference (Globecom)
í: English
e.s{|W: Proceedings Paper
O®h: IEEE Global Telecommunications Conference (GLOBECOM 07)
O®åeg: NOV 26-30, 2007
O®0W¹p: Washington, DC
O®^©RFU: IEEE.
Xd: In this paper we firstly improve a virtual network buffer model (VB), based on which we propose a joint sender/receiver rate control algorithm for scalable video streaming. A transmission rate is determined by a rate control algorithm at the sender which employs the Program Clock Reference (PCR) embedded in the video streams to work in a refined way. An over-boundary playback rate adjustment mechanism based on Proportional-Integra (PI) controller is performed at the receiver to maximize the visual quality of the displayed video according to the receiver buffer occupancy. Simulation results show that our proposed algorithm can reduce the overflow and underflow of the sender and receiver buffer, and achieve better video quality and quality smoothness than traditional rate control algorithms.
0W@W: [Zhang, Yuanhai; Xu, Jin; Huangfu, Wei; Li, Kaihui; Xu, Changqiao] Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, YH, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISSN: 1930-529X
ISBN: 978-1-4244-1042-2
29 W[&{vegnúQHrir
Tðy)Q: GLOB TELECOMM CONF
egne.sux¡pe: 5
f[Ñy{|+R: Telecommunications
ISI e.s O÷S: BHY77

--------------------------------------------------------------------------------
>f:y 10 agÿqQ 114 ag
\O: Wang, SY (Wang, Shuyan); Zheng, CW (Zheng, Changwen); Wang, YX (Wang, Yuxin)
fNM|âVSO\O: IEEE
h: A time-fuel optimal algorithm for spacecraft: Formation reconfiguration
egnúQHrir: 2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS: 994-998 2007
NfNh: IEEE Congress on Evolutionary Computation
í: English
e.s{|W: Proceedings Paper
O®h: IEEE Congress on Evolutionary Computation
O®åeg: SEP 25-28, 2007
O®0W¹p: Singapore, SINGAPORE
O®^©RFU: IEEE.
Xd: In this paper, trajectory planning for spacecraft formation reconfiguration is modeled as a MOP and a niched evolutionary algorithm is proposed. With a problem specific real-valued representation of candidate solutions and evolutionary operators, the algorithm could find the Time-Fuel front of this problem and generate mulitple solutions simultaneously. Higher selected probability of better individuals and the diversity of the front are guaranteed by equivalence class sharing. The algorithm is immune to issues of local minima and solutions are global optimal or near global optimal.
0W@W: [Wang, Shuyan; Zheng, Changwen; Wang, Yuxin] Chinese Acad Sci, Natl Key Lab Integrated Informat Syst Technol, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Wang, SY, Chinese Acad Sci, Natl Key Lab Integrated Informat Syst Technol, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-1339-3
29 W[&{vegnúQHrir
Tðy)Q: IEEE CONGRESS EVOLUT COMPUTAT
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Theory & Methods
ISI e.s O÷S: BHT10

--------------------------------------------------------------------------------
>f:y 11 agÿqQ 114 ag
\O: Min-Allah, N (Min-Allah, Nasro); Kazmi, AR (Kazmi, Asad-Raza); Ali, I (Ali, Ishtiaq); Xing, JS (Xing Jian-Sheng); Wang, YJ (Wang Yong-Ji)
fNM|âVSO\O: IEEE
h: Minimizing response time implication in DVS scheduling for low power embedded systems
egnúQHrir: 2007 INNOVATIONS IN INFORMATION TECHNOLOGIES, VOLS 1 AND 2: 289-293 2007
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Conference on Innovations in Information Technology
O®åeg: NOV 18-20, 2007
O®0W¹p: Dubai, U ARAB EMIRATES
O®^©RFU: IEEE.
Xd: Recently, a lot of work has been done on minimizing energy consumption of real time embedded systems by exploiting hardware characteristics of latest processors. However, these techniques are effective to energy reduction at the expense of delayed responsiveness; a feature highly discouraged in real time embedded systems. As opposed to the previous works, we value response time of higher importance than energy reduction after reliability, when a tradeoff is involved. In this paper, we present a novel technique for scheduling mixed tasks on single dynamic voltage scaling enabled processor The proposed algorithm, preserves all timings constraints for hard periodic tasks under worst case execution time scenario, improves responsiveness to periodic tasks and, saves as much energy as possible for hybrid workload.
0W@W: [Min-Allah, Nasro; Xing Jian-Sheng; Wang Yong-Ji] Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Min-Allah, N, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 25
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-1840-4
egne.sux¡pe: 5
f[Ñy{|+R: Engineering, Multidisciplinary; Engineering, Electrical & Electronic
ISI e.s O÷S: BHS69

--------------------------------------------------------------------------------
>f:y 12 agÿqQ 114 ag
\O: Min-Allah, N (Min-Allah, Nasro); Ali, I (Ali, Imran); Jian-Sheng, X (Jian-Sheng, Xing); Yong-Ji, W (Yong-Ji, Wang)
fNM|âVSO\O: IEEE
h: Online feasibility analysis with composite-deadline
egnúQHrir: 2007 INNOVATIONS IN INFORMATION TECHNOLOGIES, VOLS 1 AND 2: 447-451 2007
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Conference on Innovations in Information Technology
O®åeg: NOV 18-20, 2007
O®0W¹p: Dubai, U ARAB EMIRATES
O®^©RFU: IEEE.
KeyWords Plus: REAL-TIME TASKS
Xd: Scheduling analysis of fixed priority systems can generally be divided into two categories 1)utilization based approaches and 2) response time analysis. The farmer class is more efficient but propose a bound on system utilization, while the later posses pseudo-polynomial time complexity and considered to be slow, although its importance has been recognized. For periodic tasks with larger deadlines, we introduce the concept of composite deadline; a deadline which is shared by all jobs released in a given interval. Integrating this concept with response time analysis, we propose a novel solution which is both necessary and sufficient condition, and prove that it is suffix to analyze task feasibility at only one point.
0W@W: [Min-Allah, Nasro; Jian-Sheng, Xing; Yong-Ji, Wang] Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Min-Allah, N, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 24
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-1840-4
egne.sux¡pe: 5
f[Ñy{|+R: Engineering, Multidisciplinary; Engineering, Electrical & Electronic
ISI e.s O÷S: BHS69

--------------------------------------------------------------------------------
>f:y 13 agÿqQ 114 ag
\O: Ma, H (Ma Hengtai); Hong, ZG (Hong Zhiguo); Zhu, DK (Zhu Dengke); Zheng, G (Zheng Gang)
: Wang, C; Zhong, S; Wei, JL
h: Simulation and research on security enhancement policies of space network protocols - art. no. 679555
egnúQHrir: SECOND INTERNATIONAL CONFERENCE ON SPACE INFORMATION TECHNOLOGY, PTS 1-3, 6795: 79555-79555 Part 1-3 2007
NfNh: PROCEEDINGS OF THE SOCIETY OF PHOTO-OPTICAL INSTRUMENTATION ENGINEERS (SPIE)
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Conference on Space Information Technology
O®åeg: NOV 10-11, 2007
O®0W¹p: Wuhan, PEOPLES R CHINA
O®^©RFU: Huazhong Univ Sci & Technol.; Second Acad China Aerosp Sci & Ind Corp.; Natl Nat Sci Fdn China.; Chinese Acad Space Technol.; China Aerosp Sci & Ind Corp.; Third Acad China Aero Sci & Ind Corp.; Unmanned Aircraft Soc Chinese Soc Astronaut.; Natl Univ Def Technol.; Harbin Inst Technol.; Eighth Acad China Aerosp Sci & Technol Corp.; Tsinghua Univ.; Beijing Univ Aeronaut & Astronaut.; NW Polytech Univ.; Univ Elect Sci & Technol China.
\OsQ.Í: satellite network; BGP-S; Stochastic Petri nets model; performance analysis; security scheme
Xd: In this paper, the state of the art of network protocols and security problems of space networks are firstly introduced. Then, it analyzes some security protocols that can be applicable to satellite networks. To validate the effect of security protocols in space networks, we use Stochastic Petri Nets (SPN) to model the communication process of Border Gateway Protocol - Satellite version (BGP-S). Furthermore, by comparison and analysis, the effect of three security protocols on average time delay is also analyzed from the SPN model with Stochastic Petri Net Package (SPNP) 6.0. What's more, the policies on choosing security shemes are discussed. Finally, a NS-2-based simulation for BGP-S is implemented and with the addition of security data flow test is made by comparison and analysis. Simulation results are basically in accordance with the numerical results of the SPN model.
0W@W: [Ma Hengtai; Hong Zhiguo; Zhu Dengke; Zheng Gang] Chinese Acad Sci, Inst Software, Natl Key Lab Integrated Informat Syst Technol, Beijing 100080, Peoples R China
¯\O0W@W: Ma, H, Chinese Acad Sci, Inst Software, Natl Key Lab Integrated Informat Syst Technol, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 22
«_!k: 0
úQHrFU: SPIE-INT SOC OPTICAL ENGINEERING
úQHrFU0W@W: 1000 20TH ST, PO BOX 10, BELLINGHAM, WA 98227-0010 USA
ISSN: 0277-786X
ISBN: 978-0-8194-6960-1
29 W[&{vegnúQHrir
Tðy)Q: P SOC PHOTO-OPT INSTRUM ENG
egne.sux¡pe: 6
f[Ñy{|+R: Engineering, Aerospace; Remote Sensing; Telecommunications
ISI e.s O÷S: BHK09

--------------------------------------------------------------------------------
>f:y 14 agÿqQ 114 ag
\O: Xia, YL (Xia, Yonglin); Wei, J (Wei, Jun)
: Li, J; Guo, M; Jin, Q; Zhang, Y; Zhang, LJ; Jin, H; Mambo, M; Tanaka, J; Hayashi, H
h: Automated resource management framework for adapting business service capability.
egnúQHrir: 2ND IEEE ASIA-PACIFIC SERVICES COMPUTING CONFERENCE, PROCEEDINGS: 3-9 2007
í: English
e.s{|W: Proceedings Paper
O®h: 2nd IEEE Asia-Pacific Service Computing Conference (APSCC 2007)
O®åeg: DEC 11-14, 2007
O®0W¹p: Tsukuba, JAPAN
O®^©RFU: IEEE Comp Soc TCSC.
\OsQ.Í: service level agreement (SLA); resource management; QoS
Xd: The value of business service is depended on efficient resource management in meeting Service Level Agreements (SLAs) with clients and other business objectives. Agreement based resource management in service environment enable service provider to know customer demand in advance and allocate the required resources for the service. However, traditional resource management scheduling systems for the service model have tended to be statically configured and to be non-adaptive at run-time, and have addressed coordination across resources in a limited fashion. In this paper we present a novel resource management framework in which resources can be flexible assigned to business process tasks in an efficient and adaptive way to adjust business service capability when service requirements change. The framework also uniformly accommodates an extensible set of resource types that may be both fine-grained and abstract. In addition, it is highly configurable and extensible in terms of pluggable strategies, and supports flexible run-time adaptation to fluctuating application demand and resource availability. It thus comprises a QoS driven and potentially autonomic resource management facility.
0W@W: [Xia, Yonglin; Wei, Jun] Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Xia, YL, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 17
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 978-0-7695-3051-2
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Interdisciplinary Applications; Computer Science, Theory & Methods; Engineering, Electrical & Electronic
ISI e.s O÷S: BHM80

--------------------------------------------------------------------------------
>f:y 15 agÿqQ 114 ag
\O: Ma, CX (Ma, Cuixia); Teng, DX (Teng, Dongxing); Wang, HG (Wang, Hongan); Dai, GZ (Dai, Guozhong)
fNM|âVSO\O: IEEE
h: A sketch-based interface for interactive process planning design in pervasive computing environment
egnúQHrir: 2007 2ND INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND APPLICATIONS, VOLS 1 AND 2: 100-105 2007
í: English
e.s{|W: Proceedings Paper
O®h: 2nd International Conference on Pervasice Computing and Applications
O®åeg: JUL 26-27, 2007
O®0W¹p: Birmingham, ENGLAND
\OsQ.Í: sketch-based interface; pervasive computing; context technology
Xd: In this paper, we present a new interface for rapidly creating and modifying the process planning design for knitting garments. Designers (or like technologist for process planning) expect better looking interfaces that are also easy to use to improve high efficiency and productivity and to focus on task itself instead of tools as providing the invisibility in pervasive computing. With the benefits of traditional pen and pencil metaphor, sketch-based interface can meet the requirements Of personality and diversification during the process planning. It allows users to conduct the process planning drawings by sketching, exploring and modifying their ideas interactively, with immediate visual feedback. Our results show that the system can be used to create a broad range of clothes naturally and effectively.
0W@W: [Ma, Cuixia; Teng, Dongxing; Wang, Hongan; Dai, Guozhong] Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Ma, CX, Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-0970-9
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Hardware & Architecture; Computer Science, Theory & Methods; Engineering, Electrical & Electronic
ISI e.s O÷S: BHI81

--------------------------------------------------------------------------------
>f:y 16 agÿqQ 114 ag
\O: Cheng, GY (Cheng Guangyao)
fNM|âVSO\O: IEEE Comp Soc
h: Research on the recommending method used in C2C online trading
egnúQHrir: PROCEEDING OF THE 2007 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY, WORKSHOPS: 103-106 2007
í: English
e.s{|W: Proceedings Paper
O®h: IEEE/WIC/ACM International Conference on Intelligent Agent Technology and Web Intelligence
O®åeg: NOV 02-05, 2007
O®0W¹p: Fremont, CA
O®^©RFU: IEEE Comp Soc TCII.; Web Intelligence Consortium.; AMC SIGART.
Xd: Electronic commerce becomes more, and more frequent and the online trading bases on C2C context are more common. However, the ever-increasing user size and commodities cause the problem of information overload. Collaborative filtering technology is the most popular and successful method to overcome the problem in E-commerce recommender systems. Since there is much difference between B2C and C2C context where not only the buyer preference but also the seller preference is taken into account. This paper analyzes the user behaviors on the website and constructs the user preference model under the C2C context. and the author defines trust vector in this paper. Based on this definition, a new recommend trust model is proposed. The simulation shows that compared with the current recommending method, the proposed one is more effective.
0W@W: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Cheng, GY, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 978-0-7695-3028-4
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Information Systems; Computer Science, Software Engineering; Engineering, Electrical & Electronic
ISI e.s O÷S: BHH68

--------------------------------------------------------------------------------
>f:y 17 agÿqQ 114 ag
\O: Zhang, L (Zhang, Liang); Jin, BL (Jin, Beiliong); Lin, L (Lin, Li); Feng, YL (Feng, Yulin)
: Cardoso, J; Cordeiro, J; Filipe, J
h: An efficient system for EJB mobilization
egnúQHrir: ICEIS 2007: PROCEEDINGS OF THE NINTH INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS - SOFTWARE AGENTS AND INTERNET COMPUTING : 173-178 2007
í: English
e.s{|W: Proceedings Paper
O®h: 9th International Conference on Enterprise Information Systems (ICEIS 2007)
O®åeg: JUN 12-16, 2007
O®0W¹p: Funchal, PORTUGAL
O®^©RFU: INSTICC.; Univ Maderia.; FCT.; ACM SIGMIS.; Assoc Advancement Artificial Intelligence.
\OsQ.Í: mobile computing; middleware; EJB; MIDP
Xd: In these days, conducting business requires more and more employees to be mobile. To be efficient, these mobile workers need to access the enterprise applications with their mobile devices at anytime and anywhere. How to efficiently extend the enterprise applications to the mobile devices becomes a challenging task to the enterprise. In this paper, we present our recently developed system for mobilizing enterprise applications. Considering the characteristics of wireless media, our system can dynamically choose the most appropriate communication method and provide the synchronous exactly-once communication semantic. Security is explored by providing data encryption, two-way authentication and a simple tool for managing the access control list. We also develop a mechanism for supporting priority service. Thread pool and object caching are implemented to increase the efficiency. Lastly, our system offers various tools to enhance the development automatism, while still allowing the programming flexibility by providing a rich set of APIs.
0W@W: [Zhang, Liang; Jin, Beiliong; Lin, Li; Feng, Yulin] Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Zhang, L, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: INSTICC-INST SYST TECHNOLOGIES INFORMATION CONTROL & COMMUNICATION
úQHrFU0W@W: AVENIDA D MANUEL L, 27A 2 ESQUERDO, SETUBAL, 2910-595, PORTUGAL
ISBN: 978-972-8865-91-7
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Information Systems; Computer Science, Software Engineering; Mathematics, Applied
ISI e.s O÷S: BHH61

--------------------------------------------------------------------------------
>f:y 18 agÿqQ 114 ag
\O: Chen, H (Chen, Hua); Feng, DG (Feng, Dengguo)
: Wang, Y; Cheung, YM; Zhang, Q; Wang, PSP
h: An effective genetic algorithm for self-inverse S-boxes
egnúQHrir: CIS: 2007 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, PROCEEDINGS: 618-622 2007
í: English
e.s{|W: Proceedings Paper
O®h: International Conference on Computational Intelligence and Security
O®åeg: DEC 15-19, 2007
O®0W¹p: Harbin, PEOPLES R CHINA
O®^©RFU: Harbin Inst Technol.; Guangdong Univ Technol.; IEEE Hong Kong, Computat Intelligence Chapter.; Hong Kong Baptist Univ.; Xidian Univ.; IEEE Comp Soc Press.
Xd: As unique nonlinear components of most block ciphers, S-boxes provide the most important confusion effect. How to design secure S-boxes is a key problem in the design of block ciphers. There have existed many methods to design S-boxes, among which the method with genetic algorithms has attracted much interest in recent years. In this paper, an effective genetic algorithm is provided for the current popular self-inverse S-boxes, which consists of fitness function, breeding function, selection function and mutation function. Under the given algorithm, a large number of good self-inverse S-boxes can be obtained.
0W@W: [Chen, Hua; Feng, Dengguo] Inst Software Chinese Acad Sci, State Key Lab Informat Secur, Beijing, Peoples R China
¯\O0W@W: Chen, H, Inst Software Chinese Acad Sci, State Key Lab Informat Secur, 4 S 4th St,Zhong Guan Cun, Beijing, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 978-0-7695-3072-7
egne.sux¡pe: 5
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Software Engineering; Computer Science, Theory & Methods
ISI e.s O÷S: BHI03

--------------------------------------------------------------------------------
>f:y 19 agÿqQ 114 ag
\O: Flatt, M (Flatt, Matthew); Yu, G (Yu, Gang); Findler, RB (Findler, Robert Bruce); Felleisen, M (Felleisen, Matthias)
h: Adding delimited and composable control to a production programming environment
egnúQHrir: ACM SIGPLAN NOTICES, 42 (9): 165-176 SEP 2007
í: English
e.s{|W: Proceedings Paper
O®h: 12th ACM SIGPLAN International Conference on Functional Programming
O®åeg: OCT 01-03, 2007
O®0W¹p: Freiburg, GERMANY
\OsQ.Í: design; languages
Xd: Operators for delimiting control and for capturing composable continuations litter the landscape of theoretical programming language research. Numerous papers explain their advantages, how the operators explain each other (or don't), and other aspects of the operators' existence. Production programming languages, however, do not support these operators, partly because their relationship to existing and demonstrably useful constructs-such as exceptions and dynamic binding-remains relatively unexplored.
In this paper, we report on our effort of translating the theory of delimited and composable control into a viable implementation for a production system. The report shows how this effort involved a substantial design element, including work with a formal model, as well as significant practical exploration and engineering.
The resulting version of PLT Scheme incorporates the expressive combination of delimited and composable control alongside dynamic-wind, dynamic binding, and exception handling. None of the additional operators subvert the intended benefits of existing control operators, so that programmers can freely mix and match control operators.
0W@W: [Flatt, Matthew] Univ Utah, Salt Lake City, UT 84112 USA; [Yu, Gang] Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China; [Findler, Robert Bruce] Univ Chicago, Chicago, IL 60637 USA; [Felleisen, Matthias] Northeastern Univ, Boston, MA 02115 USA
¯\O0W@W: Flatt, M, Univ Utah, Salt Lake City, UT 84112 USA.
5uP[®±{0W@W: mflatt@cs.utah.edu; yug@ios.ac.cn; robby@cs.uchicago.edu; matthias@ccs.neu.edu
_(uvÂSe.spe: 32
«_!k: 0
úQHrFU: ASSOC COMPUTING MACHINERY
úQHrFU0W@W: 2 PENN PLAZA, STE 701, NEW YORK, NY 10121-0701 USA
ISSN: 0362-1340
29 W[&{vegnúQHrir
Tðy)Q: ACM SIGPLAN NOTICES
ISO egne.súQHrir
Tðy)Q: ACM Sigplan Not.
egne.sux¡pe: 12
f[Ñy{|+R: Computer Science, Software Engineering
ISI e.s O÷S: 266CV

--------------------------------------------------------------------------------
>f:y 20 agÿqQ 114 ag
\O: Li, YJ (Li, Yongjian); Pang, J (Pang, Jun)
: Munro, DS; Shen, H; Sheng, QZ; Detmold, H; Falkner, KE; Izu, C; Coddington, PD; Alexander, B; Zheng, SQ
h: Extending the strand space method to verify Kerberos V
egnúQHrir: EIGHTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PROCEEDINGS: 437-444 2007
í: English
e.s{|W: Proceedings Paper
O®h: 8th International Conference on Parallel and Distributed Computing, Applications and Technologies
O®åeg: DEC 03-06, 2007
O®0W¹p: Adelaide, AUSTRALIA
O®^©RFU: IEEE S Australian Chapter.; Univ Adelaide.; SAPAC.
KeyWords Plus: CRYPTOGRAPHIC PROTOCOLS
Xd: In this paper we present two extensions of the strand space method to model Kerberos V First, we include time and timestamps to model security protocols with timestamps: we relate a key to a crack time and combine it with timestamps in order to define a notion of recency. Therefore, we can check replay attacks in this new framework. Second, we extend the classic strand space theory to model protocol mixture. The main idea is to introduce a new relation -> to model the causal relation between one primary protocol session and one of its following secondary protocol session. Accordingly, we also revisit the definition of unsolicited authentication test. To demonstrate the power of this new theory, we model the Kerberos V protocol, and prove its secrecy and authentication goals. Our framework and the proofs of the example have been mechanized using Isabelle/HOL.
0W@W: [Li, Yongjian] Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing, Peoples R China
¯\O0W@W: Li, YJ, Chinese Acad Sci, Inst Software, Comp Sci Lab, POB 8718, Beijing, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 978-0-7695-3049-9
egne.sux¡pe: 8
f[Ñy{|+R: Computer Science, Hardware & Architecture; Engineering, Electrical & Electronic
ISI e.s O÷S: BHG95

--------------------------------------------------------------------------------
>f:y 21 agÿqQ 114 ag
\O: Zhang, YH (Zhang, Yuanhai); Wei, HF (Wei Huangfu)
: Ip, HHS; Au, OC; Leung, H; Sun, MT; Ma, WY; Hu, SM
h: A practical server-side transmission control method for multi-channel DTV streaming system
egnúQHrir: ADVANCES IN MULTIMEDIA INFORMATION PROCESSING - PCM 2007, 4810: 695-703 2007
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 8th Pacific Rim Conference on Multimedia
O®åeg: DEC 11-14, 2007
O®0W¹p: Hong Kong, PEOPLES R CHINA
O®;NR¹e: City Univ Hong Kong
\OsQ.Í: adaptive video streaming; PCR; HD; traffic control
Xd: In this paper, we propose a practical design and implementation of multi-channel High Definition (HD) and Standard Definition (SD) MPEG-2 video streaming system using server-side video rate adaptation and rate shaping over digital community network. For video rate adaptation, we employ Program Clock Reference (PCR) embedded in the MPEG-2 streams to enhance packet timing control precision and regulate the transmission rate in a refined way. For rate shaping, we introduce Traffic Control (TC) ingeniously to separate streams of different channels at the network card of server and avoid bandwidth contesting between them. Experimental results show that the proposed system can mitigate the quality degradation of video streaming due to the fluctuations of time-varying channel and simultaneously support 33-channel HDTV streams.
0W@W: [Zhang, Yuanhai; Wei Huangfu] Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, YH, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 9
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 978-3-540-77254-5
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 9
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BHG81

--------------------------------------------------------------------------------
>f:y 22 agÿqQ 114 ag
\O: Zhang, WT (Zhang, Wentao); Zhang, L (Zhang, Lei); Wu, WL (Wu, Wenling); Feng, DG (Feng, Dengguo)
: Srinathan, K; Rangan, CP; Yung, M
h: Related-key differential-linear attacks on reduced AES-192
egnúQHrir: PROGRESS IN CRYPTOLOGY - INDOCRYPT 2007, 4859: 73-85 2007
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 8th Annual International Conference on Cryptology in India
O®åeg: DEC 09-13, 2007
O®0W¹p: Chennai, INDIA
O®^©RFU: SETS, India.; Microsoft Res.; Prince Shri Venkateshwara Padmavathy Engn Coll.; Cryptol Res Soc India.; Indian Inst Technol.
\OsQ.Í: AES; cryptanalysis; related-key; differential-linear attack
KeyWords Plus: RECTANGLE ATTACKS; CRYPTANALYSIS; BOOMERANG
Xd: In this paper, we study the security of AES-192 against related-key differential-linear cryptanalysis, which is the first attempt using this technique. Among our results, we present two variant attacks on 7-round AES-192 and one attack on 8 rounds using a 5-round related-key differential-linear distinguisher. One key point of the construction of the distinguisher is the special property of MC operation of AES. Compared with the best known results of related-key impossible differential attacks and related-key rectangle attacks on AES-192, the results presented in this paper are not better than them, but the work is a new attempt, and we hope further work may be done to derive better results in the future.
0W@W: [Zhang, Wentao] Chinese Acad Sci, Grad Univ, State Key Lab Informat Secur, Beijing 100049, Peoples R China; [Zhang, Lei; Wu, Wenling] Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, WT, Chinese Acad Sci, Grad Univ, State Key Lab Informat Secur, Beijing 100049, Peoples R China.
_(uvÂSe.spe: 13
«_!k: 2
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 978-3-540-77025-1
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 13
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BHF99

--------------------------------------------------------------------------------
>f:y 23 agÿqQ 114 ag
\O: Li, X (Li, Xin); Ma, L (Ma, Li); Li, K (Li, Kun); Wang, K (Wang, Kun); Wang, HA (Wang, Hong-An)
: Lei, J; Yu, J; Zhou, SG
h: Adaptive load management over real-time data streams
egnúQHrir: FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 2, PROCEEDINGS: 719-725 2007
í: English
e.s{|W: Proceedings Paper
O®h: 4th International Conference on Fuzzy Systems and Knowledge Discovery
O®åeg: AUG 24-27, 2007
O®0W¹p: Haikou, PEOPLES R CHINA
O®^©RFU: Hainan Univ.; IEEE Reliabil Soc.; Asia Pacific Neural Network Assembly.
KeyWords Plus: APERIODIC TASKS
Xd: Streaming applications require long-running query services against data streams. Existing data stream management systems (DSMSs) are poor at processing long-running queries with timing constrains. To address this problem, we present a real-time DSMS which can support real-time query services in unpredictable environments. In this system, long-running queries over data streams are divided into two classes: periodic and continuous queries. A mixed query model is introduced to characterize these two kinds of real-time queries. Furthermore, an Adaptive Load Management (ALM) strategy based on dynamic execution time, prediction is proposed to distribute processor time among all query instances. The objective of the ALM strategy is to provide certain guarantee on the deadline miss ratio of periodic queries and reduce the one of continuous queries, meanwhile maximizing overall query quality. A series of experiments confirm that the ALM strategy is effective in improving query quality and managing workload fluctuations.
0W@W: [Li, Xin; Ma, Li; Li, Kun; Wang, Kun; Wang, Hong-An] Chinese Acad Sci, Intelligence Engn Lab, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Li, X, Chinese Acad Sci, Intelligence Engn Lab, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
egne.sux¡pe: 7
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Theory & Methods; Engineering, Electrical & Electronic
ISI e.s O÷S: BHE43

--------------------------------------------------------------------------------
>f:y 24 agÿqQ 114 ag
\O: Zhang, W (Zhang, Wenhui)
: Butler, M; Hinchey, MG; LarrondoPetrie, MM
h: Model checking with SAT-based characterization of ACTL formulas
egnúQHrir: FORMAL METHODS AND SOFTWARE ENGINEERING, PROCEEDINGS, 4789: 191-211 2007
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 9th International Conference on Formal Engineering Methods (ICFEM 2007)
O®åeg: NOV 14-15, 2007
O®0W¹p: Boca Raton, FL
O®;NR¹e: Florida Atlantic Univ
KeyWords Plus: VERIFICATION; CTL
Xd: Bounded semantics of LTL with existential interpretation and that of ECTL (the existential fragment of CTL), and the characterization of these existentially interpreted properties have been studied and used as the theoretical basis for SAT-based bounded model checking [2,18]. This has led to a lot of successful work with respect to error detection in the checking of LTL and ACTL (the universal fragment of CTL) properties by satisfiability testing. Bounded semantics of LTL with the universal interpretation and that of ACTL, and the characterization of such properties by propositional formulas have not been successfully established and this hinders practical verification of valid universal properties by satisfiability checking. This paper studies this problem and the contribution is a bounded semantics for ACTL and a characterization of ACTL properties by propositional formulas. Firstly, we provide a simple bounded semantics for ACTL without considering the practical aspect of the semantics, based on converting a Kripke model to a model (called a k-model) in which the transition relation is captured by a set of k-paths (each path with k transitions). This bounded semantics is not practically useful for the evaluation of a formula, since it involves too many paths in the k-model. Then the technique is to divide the k-model into submodels with a limited number of k-paths (which depends on k and the ACTL property to be verified) such that if an ACTL property is true in every such model, then it is true in the k-model as well. This characterization can then be used as the basis for practical verification of valid ACTL properties by satisfiability checking. A simple case study is provided to show the use of this approach for both verification and error detection of an abstract two-process program written as a first order transition system.
0W@W: Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, W, Chinese Acad Sci, Inst Software, Comp Sci Lab, POB 8718, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 25
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 978-3-540-76648-3
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 21
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BHF59

--------------------------------------------------------------------------------
>f:y 25 agÿqQ 114 ag
\O: Li, KH (Li, Kaihui); Zhang, YH (Zhang, Yuanhai); Xu, J (Xu, Jin); Xu, CQ (Xu, Changqiao)
fNM|âVSO\O: IEEE
h: Dynamic memory allocation and data sharing schedule in media server
egnúQHrir: 2007 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO, VOLS 1-5: 72-75 2007
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on Multimedia and Expo (ICME 2007)
O®åeg: JUL 02-05, 2007
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: IEEE Signal Proc Soc.; IEEE Circuits & Syst Soc.; IEEE Commun Soc.; IEEE Comp Soc.
Xd: Most of the existing buffer allocation and sharing schemes can not make full use of the system resources while being implemented independently. Here, based on analysis of the existing schemes, we propose a new algorithm, Balanced Buffer Sharing of Limited Resource (BBSLR), which allocates resources for each request according to the available cache and disk bandwidth, and adjusts buffer size according to the current request distribution and available resources dynamically. It does a good job of managing resources to maximize the number of simultaneous clients and enhance start-up delay. With BBSLR, the resources consumption will be balanced by rational allocation of the available resources, the average start-up delay will be reduced by caching the data at start and more clients will be served consequently. These conclusions are proved by comparing with several existing methods experimentally.
0W@W: [Li, Kaihui; Zhang, Yuanhai; Xu, Jin; Xu, Changqiao] Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Li, KH, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-1016-3
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Engineering, Electrical & Electronic; Imaging Science & Photographic Technology
ISI e.s O÷S: BHD68

--------------------------------------------------------------------------------
>f:y 26 agÿqQ 114 ag
\O: Li, KH (Li, Kaihui); Xu, CQ (Xu, Changqiao); Xu, J (Xu, Jin); Zhang, YH (Zhang, Yuanhai)
fNM|âVSO\O: IEEE
h: An efficient and scalable smoothing algorithm of VBR streams
egnúQHrir: 2007 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO, VOLS 1-5: 244-247 2007
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on Multimedia and Expo (ICME 2007)
O®åeg: JUL 02-05, 2007
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: IEEE Signal Proc Soc.; IEEE Circuits & Syst Soc.; IEEE Commun Soc.; IEEE Comp Soc.
KeyWords Plus: VIDEO
Xd: In order to obtain better video quality, media files are required to use variable-bit-rate (VBR) encoding. However, it produces traffic burst and unbalanced resource utilizations to translate VBR-encoded video. In this paper, we propose a novel bandwidth smoothing algorithm, Buffer Sharing and Bandwidth Smoothing of VBR Streams (BSBS-VBR), which combines with prefetching and interval caching, allows video server to transmit a VBR-encoded stream at a fixed rate and makes users to share a disk stream. BSBS-VBR can also allocate and adjust buffer size dynamically according to the current request distribution and available resources. It can reduce the peak requirements of disk bandwidth and network bandwidth, improve utility of the resources, and serve more users by using this algorithm. These conclusions are proved by comparing with several existing methods experimentally.
0W@W: [Li, Kaihui; Xu, Changqiao; Xu, Jin; Zhang, Yuanhai] Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Li, KH, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 12
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-1016-3
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Engineering, Electrical & Electronic; Imaging Science & Photographic Technology
ISI e.s O÷S: BHD68

--------------------------------------------------------------------------------
>f:y 27 agÿqQ 114 ag
\O: Zhang, Y (Zhang, Yuanhai); Wei, HF (Wei Huangfu); Xu, J (Xu, Jin); Li, KH (Li, Kaihui); Xu, CQ (Xu, Changqiao)
fNM|âVSO\O: IEEE
h: Integrated rate control and buffer management for scalable video streaming
egnúQHrir: 2007 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO, VOLS 1-5: 248-251 2007
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on Multimedia and Expo (ICME 2007)
O®åeg: JUL 02-05, 2007
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: IEEE Signal Proc Soc.; IEEE Circuits & Syst Soc.; IEEE Commun Soc.; IEEE Comp Soc.
Xd: In this paper we present a video communication scheme that integrates rate control and buffer management at the source. A transmission rate is obtained via a rate control algorithm, which employs the Program Clock References (PCR) embedded in the video streams to regulate the transmission rate in a refined way and thus reduce the client buffer requirement. The server side also maintains multiple buffers to trade off random loss for controlled loss of visually less important data. We test our system with Standard Definition Television (SDTV) and High Definition Television (HDTV) traces, and find that the proposed scheme serves best for the transmission by slowing down the transmission rate without higher buffer requirement in both cases.
0W@W: [Zhang, Yuanhai; Wei Huangfu; Xu, Jin; Li, Kaihui; Xu, Changqiao] Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Zhang, Y, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 5
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-1016-3
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Engineering, Electrical & Electronic; Imaging Science & Photographic Technology
ISI e.s O÷S: BHD68

--------------------------------------------------------------------------------
>f:y 28 agÿqQ 114 ag
\O: Zhang, YC (Zhang, Yanci); Sun, HQ (Sun, Hanqiu); Wu, EH (Wu, Enhua)
: Wang, G; Li, H; Zha, HB; Zhou, BF
h: B-spline surfaces of clustered point sets with normal maps
egnúQHrir: PROCEEDINGS OF 2007 10TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN AND COMPUTER GRAPHICS: 59-64 2007
í: English
e.s{|W: Proceedings Paper
O®h: 10th International Conference on Computer-Aided Design and Computer Graphics
O®åeg: OCT 15-18, 2007
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; IEEE Beijing Sect.; Peking Univ, Inst Comp Sci & Technol.; Peking Univ, Sch EECS.; Natl Nat Sci Fdn China.; Microsoft Res Asia.; Peking Univ, Natl Lab Machine Percept.; Key Lab High Confidence Software Technologies, Minist Educ.
O®;NR¹e: Peking Univ
Xd: In this paper, we propose a novel method that represents the highly-complex point sets by clustering the points to normal-mapped B-spline surfaces (NBSs). The main idea is to construct elaborate normal maps on simple surfaces for the realistic rendering of complex point-set models. Based on this observation, we developed the coarse, normal-mapped B-spline surfaces to approximate the original point datasets with fine surface details. In our algorithm, a genetic clustering algorithm is proposed to automatically segment the point samples into several clusters according to their statistical properties, and a network of B-spline patches with normal maps are constructed according to the clustering results. Our experimental results show that this representation facilitates the modeling and rendering of complex point sets without losing the visual qualities.
0W@W: [Zhang, Yanci; Sun, Hanqiu; Wu, Enhua] Chinese Acad Sci, State Key Lab Comp Sci, Inst Software, Beijing 100864, Peoples R China
¯\O0W@W: Zhang, YC, Chinese Acad Sci, State Key Lab Comp Sci, Inst Software, Beijing 100864, Peoples R China.
_(uvÂSe.spe: 17
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-1578-6
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Theory & Methods; Engineering, Electrical & Electronic; Imaging Science & Photographic Technology
ISI e.s O÷S: BHD88

--------------------------------------------------------------------------------
>f:y 29 agÿqQ 114 ag
\O: Wu, JZ (Jinzhong Wu); Liu, XH (Xuehui Liu); Wu, EH (Enhua Wu)
: Wang, G; Li, H; Zha, HB; Zhou, BF
h: Mesh deformation under skeleton-based detail-preservation
egnúQHrir: PROCEEDINGS OF 2007 10TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN AND COMPUTER GRAPHICS: 453-456 2007
í: English
e.s{|W: Proceedings Paper
O®h: 10th International Conference on Computer-Aided Design and Computer Graphics
O®åeg: OCT 15-18, 2007
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; IEEE Beijing Sect.; Peking Univ, Inst Comp Sci & Technol.; Peking Univ, Sch EECS.; Natl Nat Sci Fdn China.; Microsoft Res Asia.; Peking Univ, Natl Lab Machine Percept.; Key Lab High Confidence Software Technologies, Minist Educ.
O®;NR¹e: Peking Univ
Xd: With in skeleton based deformation, two issues are waiting for investigation, large angle rotation and artifacts near joint regions. In this paper we propose rotation angle decomposition and detail preserving method to conquer them. A skeleton with multiple connected bones is prior computed for a triangle mesh. While deforming, large angle rotation is simulated by several progressive small angle rotations. We also introduce a distortion metric function E to quantify the difference between mesh edge vectors before and after deformation, preserving the detail of mesh surfaces. Nearby vertex position blending is enforced. We use sparse conjugate gradient method for the minimization of metric function E. Results show our method is suitable for 3D modeling and character animation applications, making the deformation near joint regions more natural.
0W@W: [Jinzhong Wu] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China; [Xuehui Liu] Univ Macau, Dept Comp & Informat Sci, Macao, Peoples R China; [Enhua Wu] Chinese Acad Sci, Grad Univ, Beijing, Peoples R China
¯\O0W@W: Wu, JZ, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China.
_(uvÂSe.spe: 11
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-1578-6
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Theory & Methods; Engineering, Electrical & Electronic; Imaging Science & Photographic Technology
ISI e.s O÷S: BHD88

--------------------------------------------------------------------------------
>f:y 30 agÿqQ 114 ag
\O: Gu, YT (Yuanting Gu); Wu, EH (Enhua Wu)
: Wang, G; Li, H; Zha, HB; Zhou, BF
h: Feature analysis and texture synthesis
egnúQHrir: PROCEEDINGS OF 2007 10TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN AND COMPUTER GRAPHICS: 473-476 2007
í: English
e.s{|W: Proceedings Paper
O®h: 10th International Conference on Computer-Aided Design and Computer Graphics
O®åeg: OCT 15-18, 2007
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; IEEE Beijing Sect.; Peking Univ, Inst Comp Sci & Technol.; Peking Univ, Sch EECS.; Natl Nat Sci Fdn China.; Microsoft Res Asia.; Peking Univ, Natl Lab Machine Percept.; Key Lab High Confidence Software Technologies, Minist Educ.
O®;NR¹e: Peking Univ
Xd: Most texture synthesis algorithms explicitly or implicitly adopt Markov Random Field or similar distribution as their basic model to guide the synthesis process. However, MRF-like models can't handle textures well with large scale structure or unstable structure due to their inherent local and stable assumptions. To make improvement in this regard, we propose a new texture analysis/synthesis framework that combines two main ideas. Firstly, in material space we decompose the texture contents into units with "basic shape" and, "feature vector". Based on this, the space spanned by a set of sampled textons is constructed to help introduce additional changes upon textons. Secondly, in pattern space, using the idea of 'feature texture" acquired from texture swatch for different properties especially for distribution rules of textons, we may capture and manipulate the global structure flexibly. By this formulization, we are able to obtain a satisfactory texture appearance, and also a rich control ability as well.
0W@W: [Yuanting Gu; Enhua Wu] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China
¯\O0W@W: Gu, YT, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China.
_(uvÂSe.spe: 7
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-1578-6
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Theory & Methods; Engineering, Electrical & Electronic; Imaging Science & Photographic Technology
ISI e.s O÷S: BHD88

--------------------------------------------------------------------------------
>f:y 31 agÿqQ 114 ag
\O: Lu, M (Min Lu); Zhang, JF (Jinfang Zhang); Lv, P (Pin Lv); Fan, ZH (Zhihua Fan)
: Wang, G; Li, H; Zha, HB; Zhou, BF
h: Max/min path visual coverage problems in raster terrain
egnúQHrir: PROCEEDINGS OF 2007 10TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN AND COMPUTER GRAPHICS: 497-500 2007
í: English
e.s{|W: Proceedings Paper
O®h: 10th International Conference on Computer-Aided Design and Computer Graphics
O®åeg: OCT 15-18, 2007
O®0W¹p: Beijing, PEOPLES R CHINA
O®^©RFU: China Comp Federat.; IEEE Beijing Sect.; Peking Univ, Inst Comp Sci & Technol.; Peking Univ, Sch EECS.; Natl Nat Sci Fdn China.; Microsoft Res Asia.; Peking Univ, Natl Lab Machine Percept.; Key Lab High Confidence Software Technologies, Minist Educ.
O®;NR¹e: Peking Univ
Xd: Path visual coverage is the region which could be seen from the path in the terrain. This paper advances the concept of "average horizon" which represents the wide extent of the visual field of each path point to analyze and model the max and min path visual coverage problems, and resolves them utilizing simulated annealing algorithm based on the operation of viewshed amalgamation with pre-computed and stored viewshed information.
0W@W: [Min Lu; Jinfang Zhang; Pin Lv; Zhihua Fan] Chinese Acad Sci, Inst Software, Natl Key Lab Integrated Informat Syst Informat, Beijing 100080, Peoples R China
¯\O0W@W: Lu, M, Chinese Acad Sci, Inst Software, Natl Key Lab Integrated Informat Syst Informat, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 8
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-1578-6
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Theory & Methods; Engineering, Electrical & Electronic; Imaging Science & Photographic Technology
ISI e.s O÷S: BHD88

--------------------------------------------------------------------------------
>f:y 32 agÿqQ 114 ag
\O: Jin, BH (Jin, Beihong); Yu, S (Yu, Shuang); Zhao, XC (Zhao, Xinchao); Long, ZY (Long, Zhenyue); Qian, YF (Qian, Yifeng)
: Cheung, SC; Li, YS; Chao, KM; Younas, M; Chung, JY
h: Subscribing and matching RFID-related events
egnúQHrir: ICEBE 2007: IEEE INTERNATIONAL CONFERENCE ON E-BUSINESS ENGINEERING, PROCEEDINGS: 41-47 2007
NfNh: International Conference on e-Business Engineering
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on e-Business Engineering
O®åeg: OCT 24-26, 2007
O®0W¹p: Hong Kong, PEOPLES R CHINA
O®^©RFU: IEEE Comp Soc TCEC.; Univ Hong Kong.; Hong Kong Univ Sci & Technol.
Xd: Publish/subscribe service can deliver customized events and increase product visibility for users in RFID applications such as logistics supporting systems. This paper herein presents a composite subscription specification for RFID-related application scenarios, permitting to subscribe predicates for RFID-codes as well as temporal events. Moreover an effective matching algorithm for RFID-code subscriptions together with a corresponding algorithm for detecting complex events is proposed Finally, experiments are conducted to quantify the performances and costs of the above algorithms.
0W@W: [Jin, Beihong; Yu, Shuang; Zhao, Xinchao; Long, Zhenyue; Qian, Yifeng] Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100864, Peoples R China
_(uvÂSe.spe: 15
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 978-0-7695-3003-1
29 W[&{vegnúQHrir
Tðy)Q: INT CONF E BUS ENGINEERING
egne.sux¡pe: 7
f[Ñy{|+R: Business; Computer Science, Hardware & Architecture; Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods; Engineering, Electrical & Electronic; Information Science & Library Science; Management
ISI e.s O÷S: BHE60

--------------------------------------------------------------------------------
>f:y 33 agÿqQ 114 ag
\O: Hu, JJ (Hu, Jianjun); Guan, HQ (Guan, Heqing); Zhong, H (Zhong, Hua); Huang, T (Huang, Tao)
: Cheung, SC; Li, YS; Chao, KM; Younas, M; Chung, JY
h: Adaptive self-configuration of EJB server: A performance model approach
egnúQHrir: ICEBE 2007: IEEE INTERNATIONAL CONFERENCE ON E-BUSINESS ENGINEERING, PROCEEDINGS: 115-122 2007
NfNh: International Conference on e-Business Engineering
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on e-Business Engineering
O®åeg: OCT 24-26, 2007
O®0W¹p: Hong Kong, PEOPLES R CHINA
O®^©RFU: IEEE Comp Soc TCEC.; Univ Hong Kong.; Hong Kong Univ Sci & Technol.
Xd: High dynamic computing environment makes quality of service (QoS) guarantee more important to distributed system. It should possess self-tuning capability reacting to external environment variation such as fluctuating workload. This paper proposed an adaptive self-configuration framework for EJB platfrom, which can automatically tune configuration parameters to preserve QoS when workload changed. The key point of this framework is a performance model based on layered queuing network, which guides the search for the best combination of configuration parameters to satisfy performance requirement of EJB application. We have prototyped this self-configuration framework on an EJB server named OnceAS, and the experiment results showed that through the framework's control, system performs well on QoS goal.
0W@W: [Hu, Jianjun; Guan, Heqing; Zhong, Hua; Huang, Tao] Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100864, Peoples R China
_(uvÂSe.spe: 18
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 978-0-7695-3003-1
29 W[&{vegnúQHrir
Tðy)Q: INT CONF E BUS ENGINEERING
egne.sux¡pe: 8
f[Ñy{|+R: Business; Computer Science, Hardware & Architecture; Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods; Engineering, Electrical & Electronic; Information Science & Library Science; Management
ISI e.s O÷S: BHE60

--------------------------------------------------------------------------------
>f:y 34 agÿqQ 114 ag
\O: Wang, W (Wang, Wei); Zhang, WB (Zhang, Wenbo); Zhang, L (Zhang, Lei); Huang, T (Huang, Tao)
: Cheung, SC; Li, YS; Chao, KM; Younas, M; Chung, JY
h: WMQ: Towards a fine-grained QoS control for e-business servers
egnúQHrir: ICEBE 2007: IEEE INTERNATIONAL CONFERENCE ON E-BUSINESS ENGINEERING, PROCEEDINGS: 139-146 2007
NfNh: International Conference on e-Business Engineering
í: English
e.s{|W: Proceedings Paper
O®h: IEEE International Conference on e-Business Engineering
O®åeg: OCT 24-26, 2007
O®0W¹p: Hong Kong, PEOPLES R CHINA
O®^©RFU: IEEE Comp Soc TCEC.; Univ Hong Kong.; Hong Kong Univ Sci & Technol.
Xd: As the Internet increases explosively, the QoS support in e-business server is becoming more and more important. However, the implementation of a fine-grained QoS control model in the e-business servers is a challenging task. In this paper, we propose a WorkManager-based QoS scheduling framework (WMQ) for e-business servers. This framework hides the complexity of QoS scheme implementations and provides a flexible architecture supporting fine-grained QoS control. A prototype of our framework has been implemented within the open-source server Tomcat. The evaluation of this prototype shows that our approach allows Tomcat to effectively meet the QoS requirement of the applications h, fine-grained QoS control. Our experience also shows that the WMQ framework can efficiently simplify and reduce the implementation effort involved in developing QoS-enabled e-business servers.
0W@W: [Wang, Wei; Zhang, Wenbo; Zhang, Lei; Huang, Tao] Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China
_(uvÂSe.spe: 16
«_!k: 0
úQHrFU: IEEE COMPUTER SOC
úQHrFU0W@W: 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
ISBN: 978-0-7695-3003-1
29 W[&{vegnúQHrir
Tðy)Q: INT CONF E BUS ENGINEERING
egne.sux¡pe: 8
f[Ñy{|+R: Business; Computer Science, Hardware & Architecture; Computer Science, Information Systems; Computer Science, Software Engineering; Computer Science, Theory & Methods; Engineering, Electrical & Electronic; Information Science & Library Science; Management
ISI e.s O÷S: BHE60

--------------------------------------------------------------------------------
>f:y 35 agÿqQ 114 ag
\O: Zhang, L (Zhang, Liang); Jin, BH (Jin, Beihong); Cao, JN (Cao, Jiannong)
: Kuo, TW; Sha, E; Guo, M; Yang, LT; Shao, Z
h: Adding adaptability to mailbox-based Mobile IP
egnúQHrir: EMBEDDED AND UBIQUITOUS COMPUTING, PROCEEDINGS, 4808: 283-293 2007
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: IFIP International Conference Embedded and Ubiquitous Computing
O®åeg: DEC 17-20, 2007
O®0W¹p: Taipei, TAIWAN
O®^©RFU: IFIP.
\OsQ.Í: mobile computing; mailbox; mobile IP; dynamic programming
Xd: Mobile IP is one of the dominating protocols that provide mobility support in the Internet. However, even with some proposed optimization techniques, there is still space for improving the performance. In this paper, we present a mailbox-based scheme to further improve the performance. In this scheme, each mobile node migrating to a foreign network is associated with a mailbox. A sender sends packets to the receiver's mailbox, which will in turn forward them to the receiver. During each handoff, a mobile node can decide whether to move its mailbox and report the handoff to the home agent, or simply to report the handoff to the mailbox. In this way, both the workload on the home agent and the registration delay can be reduced. Also, the scheme is adaptive. By applying the dynamic programming to compute the optimal mailbox's migration policy, the scheme can make the total cost minimized.
0W@W: [Zhang, Liang; Jin, Beihong] Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Zhang, L, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 6
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 978-3-540-77091-6
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 11
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BHD22

--------------------------------------------------------------------------------
>f:y 36 agÿqQ 114 ag
\O: Zhang, L (Zhang, Liang); Jin, BH (Jin, Beihong)
: Kuo, TW; Sha, E; Guo, M; Yang, LT; Shao, Z
h: A service query dissemination algorithm for accommodating sophisticated QoS requirements in a service discovery system
egnúQHrir: EMBEDDED AND UBIQUITOUS COMPUTING, PROCEEDINGS, 4808: 577-586 2007
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: IFIP International Conference Embedded and Ubiquitous Computing
O®åeg: DEC 17-20, 2007
O®0W¹p: Taipei, TAIWAN
O®^©RFU: IFIP.
\OsQ.Í: QoS; multicast; service discovery; mobile computing; NP-complete
Xd: For many service discovery protocols, user service queries need to be disseminated to some service directories within the system for discovering matched services. The scope of dissemination identifies the scope of service discovery. How to determine the service discovery scope needs to be discussed. In this paper, we present a service query dissemination algorithm in our developing service discovery system, Service CatalogNet. In this system, users can pose different QoS requirements upon their service queries in order to manually control the scope of service discovery. The service query dissemination algorithm will dynamically transform the QoS requirements into a set of directories as well as the routing paths to them. The performance analysis shows a sound result of our algorithm.
0W@W: [Zhang, Liang; Jin, Beihong] Chinese Acad Sci, Inst Software, Beijing, Peoples R China
¯\O0W@W: Zhang, L, Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
_(uvÂSe.spe: 6
«_!k: 0
úQHrFU: SPRINGER-VERLAG BERLIN
úQHrFU0W@W: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 978-3-540-77091-6
29 W[&{vegnúQHrir
Tðy)Q: LECT NOTE COMPUT SCI
egne.sux¡pe: 10
f[Ñy{|+R: Computer Science, Theory & Methods
ISI e.s O÷S: BHD22

--------------------------------------------------------------------------------
>f:y 37 agÿqQ 114 ag
\O: Wang, XY (Wang, Xiying); Dai, GZ (Dai, Guozhong)
fNM|âVSO\O: IEEE
h: A novel method to recognize complex dynamic gesture by combining HMM and FNN models
egnúQHrir: 2007 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN IMAGE AND SIGNAL PROCESSING: 13-18 2007
í: English
e.s{|W: Proceedings Paper
O®h: IEEE Symposium on Computational Intelligence in Image and Signal Processing
O®åeg: APR 01-05, 2007
O®0W¹p: Honolulu, HI
O®^©RFU: IEEE.
KeyWords Plus: REPRESENTATION
Xd: Recognition of dynamic gesture is an important task for gesture-based Human-Computer Interaction. A novel HMM-FNN model is proposed in this paper for the modeling and recognition of complex dynamic gesture. It combines temporal modeling capability of Hidden Markov Model, and ability of Fuzzy Neural Network for fuzzy rule modeling and fuzzy inference. Complex dynamic gesture has two important properties: its motion can be decomposed and usually being defined in a fuzzy way. By HMM-FNN model, dynamic gesture is firstly decomposed into three independent parts: posture changing, 2D motion trajectory and movement in Z-axis direction, and each of part is modeled by a group of HMM models which represent all fuzzy classes it possibly belongs to. The likelihood probability of HMM model to observation sequence is considered as fuzzy membership for INN model. In our method, high dimensional gesture feature is transformed into several low dimensional features, which leads to the reduction of model complexity. By means of fuzzy inference, it achieves a higher recognition rate than conventional HMM model. Besides, human's experience can be taken advantaged to build and optimize model structure. Experiments show that the proposed approach is an effective method for the modeling and recognition of complex dynamic gesture.
0W@W: [Wang, Xiying; Dai, Guozhong] Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Wang, XY, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 18
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-0707-1
egne.sux¡pe: 6
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Theory & Methods; Imaging Science & Photographic Technology
ISI e.s O÷S: BHD28

--------------------------------------------------------------------------------
>f:y 38 agÿqQ 114 ag
\O: Wang, XY (Wang, Xiying); Dai, GZ (Dai, Guozhong)
fNM|âVSO\O: IEEE
h: A new invariant descriptor for shape representation and recognition
egnúQHrir: 2007 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN IMAGE AND SIGNAL PROCESSING: 48-51 2007
í: English
e.s{|W: Proceedings Paper
O®h: IEEE Symposium on Computational Intelligence in Image and Signal Processing
O®åeg: APR 01-05, 2007
O®0W¹p: Honolulu, HI
O®^©RFU: IEEE.
KeyWords Plus: PATTERN-RECOGNITION; FOURIER DESCRIPTORS; MOMENT INVARIANTS
Xd: Traditional Fourier Descriptor suffers the drawback of being sensitive to translation, rotation and scale transform. This paper presents a new method of shape representation, Polygon Fourier Descriptor (PFD), which can achieve the invariance on translation, rotation and scale transform naturally and without need of a process of normalization. By applying polygonal approximation to the contour firstly, the contour can be represented more efficiently. Moreover, PFD is robust enough to represent the contour even if some transformations happened to it. Finally, we apply PFD to the recognition of static gestures and obtain satisfying results.
0W@W: [Wang, Xiying; Dai, Guozhong] Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
¯\O0W@W: Wang, XY, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
_(uvÂSe.spe: 13
«_!k: 0
úQHrFU: IEEE
úQHrFU0W@W: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISBN: 978-1-4244-0707-1
egne.sux¡pe: 4
f[Ñy{|+R: Computer Science, Artificial Intelligence; Computer Science, Theory & Methods; Imaging Science & Photographic Technology
ISI e.s O÷S: BHD28

--------------------------------------------------------------------------------
>f:y 39 agÿqQ 114 ag
\O: Xue, R (Xue, Rui); Feng, DG (Feng, Dengguo)
: Qing, S; Imai, H; Wang, G
h: Toward practical anonymous rerandomizable RCCA secure encryptions
egnúQHrir: INFORMATION AND COMMUNICATIONS SECURITY, PROCEEDINGS, 4681: 239-253 2007
NfNh: LECTURE NOTES IN COMPUTER SCIENCE
í: English
e.s{|W: Proceedings Paper
O®h: 9th International Conference on Information and Communications Security
O®åeg: DEC 12-15, 2007
O®0W¹p: Zhengzhou, PEOPLES R CHINA
O®^©RFU: Chinese Acad Sci.; Beijing Nat Sci Fdn China.; Inst Software.; Chinese Acad Sci.; Inst Software & Microelect.; Peking Univ.; ZhongAn Sci & Technol Grp.; Informatizat Off Provincial Govt Henan.; China & Int Commun & Informat Security Assoc.
KeyWords Plus: PUBLIC-KEY ENCRYPTION; CHOSEN CIPHERTEXT ATTACK; UNIVERSAL RE-ENCRYPTION
Xd: Replayable adaptively chosen ciphertext attack (RCCA) security is a relaxation of popular adaptively chosen ciphertext attack (CCA) security for public key encryption system. Unlike CCA security, RCCA security allows modifying a ciphertext into a new ciphertext of the same message. One of the open questions is that if there exists a perfectly rerandomizable RCCA secure encryption [4]. Prabhakaran and Rosulek recently answered this question affirmatively [14]. The scheme they proposed (PR scheme for short) is composed of a double-strands Cramer-Shoup schemes that involves as many as 56 exponents in encryption and 65 exponents in decryption, and 55 exponents operations during rerandomization.
#ïXïï(ðVððÑó¸ô!÷øfùúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrfùùùàù^úúªúû ûþû"ü$üÆüäü
ý6ý¸ý°þXÿrÿ¤ÿBp°ÞÄÞ¨4

úúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdr

$
6

$NªÄ¢ÆÈj

²
RÖFÀ0XÀÚìúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrìDHb$&Èæ~ªÜ`ÐJºÿ!"8#R#d#¼#$À$Ú$úúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrÚ$x&&&@'`''ø'( ):)l)ð)*`*Ú*Æ-.8/T/f/¾/0Â0Ü0z22 2B3b3úúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrb33ø34505b5æ56V6Ð6n9:6;P;b;º;>?^??ò?~@A"Aúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdr"ATAØABHBÂBðB¦F2GÚGöGH`H:IdI~IK@KBKäKLPLrLMfMM²MªNÂNþNúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrþNJPdQ¼QÒRÛSUÂV´WÐWâWXXÄXÞXÔYøYúYZ¼Z
[D[¤[n\\º\]¾]þ]aúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdraàbgªhniiiòitjj¸jk¦k¨kJljlÌlîlªmÐnênoüo*pTpnq*rÈu¶vwúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdròlªm´mÐnÔnênòno$oüop*p2pTp^pnqxq*r.rtFtvLxvx®yRzBDPzöj`ÔþzBK¬ Ö ¼¡`¢ë¦¨ª¬f®®v¯°T¶L·ì·:¸:ºH»Ú½¾B¿æ¿0Æ(ÇÎÇÈÊHË`ÍÍÈÎlÏÎÔæÖØÄØÐÙtÚ0àðàßâ@åç>çé´étðóîóîóîóîóîóîóîóîóîóãßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîßîhrhrhrmHsH hro(hrhrmHo(sHXw¶wÈwôwLxvxxy®y°yRzrzzözb{T|n| |J}x}¤}~DÐz¦ìPzúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrzÒöøºøP²¤¾ðÈôÔ`þ*pÔþVz|úúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdr>hj0bÐþBæÊ°ÊÜ ¬ Ö ð ¡¼¡¾¡`¢¢¶¢P£þ£ª¤úúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrª¤Ä¤ö¤d¥¥Ö¥§«¨¬hÆf®®ª®R¯v¯x¯°:°°Ö°@±Z²t²¦²´.´T´úúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrT´L·ì·:¸H»T¼ö¼½"½p½Ú½¾¾¿B¿D¿æ¿ÀHÀÀÁ6ÂPÂÂÜÃ
Ä0Ä(ÇÎÇÈúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrÈHËÔË|ÌÌ¨ÌöÌ`ÍÍ¤Í¤ÎÈÎÊÎlÏÏìÏHÐÑÑ¸ÑêÑBÒpÒ²ÒÓæÖd×ü×Ø(Øúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdr(Ø>ØØÄØÞØ¬ÙÐÙÒÙtÚÚÒÚÛ¬ÛâÜüÜ.ÝºÝðÝ0Þðà¾á@åÌåtææ¢æ¸æç>çXçúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrXçìèéé´éÔéþéBê°êtëÆëàëì|ìªìêìtîþð\ò6óPóbóóô*ôTô¢ô¼ôõ4õúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrtðþðôTô4õØõüzÆð>

¬èä6`>:$æ'*B*|+ ,*246B6|7 8D888î8ò8z992:::Ð:Ô:ê:ò:;$;Ø;à;bd(f¸4h4*56.6`67J778B9v9hè>@6@8@Ú@ü@fAA*BC.C`CDJDDE&FªJ6KÜKøK
LJLúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrJLØL
M$MNNrNtNO8OPBPâPQòQR>R´RâRS:SSWºXY¨YºYêYZ¬ZÞZúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrÞZ2[N[°[Ô[Ö[x\\ò\*]è]^²^ä^H_v_¬_rb4cd*deXe fÄfÆfhgúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrÖ`rbe>eÄfhgçlprÎrÖsztz~ ÒÚ~¤"&BF¬¶¤¬ÖÞfnºÄbfü1dÆ`0Æú@Üê¡(¢¤¦:¨l¨©.ªÖ¦®¦°ð±"´T´Æ´jµö¸n¹·º¾zÀ¬ÀÁ@Â1ÈÊfÌÌÍ*ÎCÔjÖØ²Ø ÙDÚüÝbÞ1àâü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ë÷ë÷ë÷ë÷ë÷ë÷ë÷ë÷ë÷ë÷ë÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ü÷ührhrmHo(sH hro(hr]hggThhiæiZjtj¦j$kRkkÎkoÀpqºqÌqüqrÎr(sBs²sÖsØszttZu¢uúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdr¢utvBw¶wÐwxx®xðx*yQ}Â~¢¾Ð Ò,F¶ÚÜ~ "B¬¤úúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdr¤Öfºbdð²ÄôÆàn@\¸ÜÞ¢öî : Ê ø &¡ê¡(¢®¥Â¦§úúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdr§¶§È§Þ§:¨l¨¨f©©©.ªPªºªÖª4`44ä4þ4Z5~55"6D6b77889.:H:z:;F;l;;Â?Ê@°AÊAÜAB¬Búúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdr¬BÎBøBRClCfDDD.EPEF6FÐF"H,>4>>²>V?éDü÷ü÷ü÷ë÷ëàë÷ë÷ë÷ë÷ü÷ü÷ë÷ëàë÷ë÷ë÷ë÷ü÷ü÷ü÷ë÷ëàë÷ë÷ë÷ë÷ü÷ü÷ü÷ë÷ëàë÷ë÷ë÷ë÷ü÷ü÷ë÷ëàë÷ë÷ë÷ë÷ü÷hrhrmHsHhrhrmHo(sH hro(hrX¾à~ Î |
h´N|¸È
üF*ÂÞð*¸â0JÂÄfúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrfT²,^ÞLøú!î!®"Ê"Ü"##¤#Î# $:$$À$Â$d%úúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrd%%ì%.&°&D'¤'¾'ð'p((Þ()²)m+h-0.ª.Æ.Ø./~/ /Ê/0600¼0¾0`1úúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdr`11L22L3ä3D4^445>5~5*6´9B;þ; ²>´>V?x?úúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrx?â?@®@(AA¢AÔAVBBªB^CÒC¤HºI~JJ¬JæJRKtKKðKLnLLL6MXMìMúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdréD¤HRKKL6MþQ6RTPVÄXøXYdY°Y¶YÎYZZZ&ZZ¤ZH[0__Ï`bâde eeÎeÔeìe f0f:fBffÀfdg2mBqr¶rÀr"snstss¼sÌsØsàs,tPtôt`zºz]|~Hh¦TZr¢²¾Æ6Új \üHNfü÷ü÷ü÷ü÷ü÷ë÷ëàë÷ë÷ë÷ë÷ü÷ü÷ü÷ë÷ëàë÷ë÷ë÷ë÷ü÷ü÷ë÷ëàë÷ë÷ë÷ë÷ü÷ü÷ü÷ü÷ë÷ëàë÷ë÷ë÷ë÷ü÷ü÷ü÷ë÷ëàë÷hrhrmHsHhrhrmHo(sH hro(hrXìM*NòNOðO
PQþQ6RPV\WXX¬X¾XøXdYY°YZZZ¤Z¦ZH[j[\úúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdr\,\¶\f]Æ]à]^Ä^ò^0__±apcNd°dÊdÜdee¤eÎe f:ffÀfÂfdgg
hFhúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrFhêh~iÐiêijÆjôj2kBqÎqNrjr|r¶r"sDsns¼sØs,tPtRtôtuÞu.v w¢wôwúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrôwx@x¬xÚx
y4z`zºz~Hø4Pb*T¢¾68ÚüÀpJúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrJðB\Âð$j ¦P(DVüH²*,Îð²b~úúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrf¦²º*Îk¦Lz 8¦Ö©|¬°¬º¬hn¶ÆÒÚ&®J®î®W´¶þ¸2¹ßäâLäåêåææPæ¼æÞæçZçtçÖçúçüçèÀèNééêêâêüêúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrZæ¼æçç&çZçjçtç|çÖçúçèîñ2ófópóÒóô$ô´ä´úúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrä´µDµ¶b¶Q»æ¼½½®½@¾Ð¾¿¿ò¿ÀÀºÀÜÀBÁÁÂúÂÃFÃÜÃ
ÄHÄÅjÈúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdr
ÄÄHÄRÄÅÇÆjÈ`ËËÊÌnÍÍÎÎ.Ï8ÏÏÏ´Ï¼ÏæÏîÏ|ÐÐªÐ²ÐÜÐæÐÑÓØÚÚÜâtâêâ:ãèÊèé®éÀéðéúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrðéêÂêÜêë®ë°ëRìtìâìRíî¼îï(ïZïºïèï,ðdðÚð²õÈöt÷÷ ÷Ú÷FøhøøúúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrøèøùVùzù|ùú@úûZûÚû^ü°üÊüüüý®ýÚýâþjÿâÿø&`Ìî úúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdr nÞ¦È Ì @
&@r:x
X
´$ö$Tô(*úúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdr
X
¬(Ìò*.¶¾"*T\òú (LVÌÐfh#¾%&ô&'Ô-ð0,3^3 4D5v9¢9¢;>Î@ABBæB`ILXNNÌOpPHVLV:X6Â6v7úúúúúúúúúúúúúúúúúúúúúúúúúúúúúgdrv77Â7R88À8v9¢9>?.@J@\@r@Î@AABBBDBæBCðCD¬D`EzE¬E

Other exersises:

B.Tech (Computer Science & Engineering) - Punjabi University ...
IMI - Free.fr
La méthode - Examen corrige
Démo 1 - Exercices corriges
CAPTEURS
TD ? TP de rayonnement : pyrométrie
Correction des exercices 4 et 6 du TD4 et 5 du TD5
EX 5 : Mesure de température par thermocouple - B. Arros
S - Raymond Rodriguez - Free
Correction du TP3 Correction exemple 1 Doc. 1 et 2 : Le croisement ...
Évaluation de l'application actuelle des instruments des Nations ...
Différents types de bénéfice par action - Free