ISI Web of Knowledge

1.

检索条件

地址 =(((Inst Sofware) OR (Inst Software) OR (Software Inst)) SAME (Chin* and aca*) SAME

Beijing) AND 出版年 =(2008)

入库时间 = 所有年份 . 数据库 =SCI-EXPANDED.

2.

检索结果

显示 1 条，共 51 条

作者 : Wang, XY (Wang, Xiang-Yang); Niu, PP (Niu, Pan-Pan); Qi, W (Qi, Wei)

标题 : A new adaptive digital audio watermarking based on support vector machine

来源出版物 : JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 31 (4): 735-749

NOV 2008

语言 : English

文献类型 : Article

作者关键词 : Audio watermarking; Desynchronization attack; Support vector machines;

Synchronization code; Statistics average value

KeyWords Plus: COPYRIGHT PROTECTION; ROBUST

摘要 : It is a challenging work to design a robust digital audio watermarking scheme against desynchronization attacks. On the basis of support vector machines (SVMs), a new robust digital audio watermarking algorithm against desynchronization attacks is proposed in this paper, and in this the audio statistics characteristics and synchronization code are utilized. Firstly, the optimal embedding positions are located adaptively by using the SVM theory. Secondly, the 16-bit Barker code is chosen as synchronization mark and embedded into the digital audio by modifying the statistics average value of several samples. Finally, the digital watermark are embedded into the statistics average value of low-frequency components in wavelet domain by making full use of auditory masking. Experimental results show that the proposed scheme is inaudible and robust against common signal processing such its MP3 compression, low-pass filtering, noise addition, equalization, etc., and is robust against desynchronization attacks such as random cropping, amplitude variation, pitch shifting, time-scale modification, jittering, etc. (C) 2007 Elsevier Ltd.

All rights reserved.

地址 : [Wang, Xiang-Yang; Niu, Pan-Pan; Qi, Wei] Liaoning Normal Univ, Sch Comp & Informat

Technol, Dalian 116029, Peoples R China; [Wang, Xiang-Yang] Chinese Acad Sci, State Key Lab

Informat Secur, Inst Software, Beijing 100039, Peoples R China

通讯作者地址 : Wang, XY, Liaoning Normal Univ, Sch Comp & Informat Technol, Dalian 116029,

Peoples R China.

电子邮箱地址 : wxy37@263.net

基金资助致谢 :

基金资助机构授权号

National Natural Science Foundation of China 60773031

Open Foundation of State Key Laboratory of Information Security of China 03-06

Open Foundation of State Key Laboratory for Novel Software Technology of China A200702

Open Foundation of National Laboratory on Machine Perception of China 05-03

This work was supported by the National Natural Science Foundation of China under Grant no.

60773031, the Open Foundation of State Key Laboratory of Information Security of China under

Grant no. 03-06, the Open Foundation of State Key Laboratory for Novel Software Technology of

China under Grant no. A200702 and the Open Foundation of National Laboratory on Machine

Perception of China under Grant no. 05-03.

引用的参考文献数 : 18

被引频次 : 2

出版商 : ACADEMIC PRESS LTD ELSEVIER SCIENCE LTD

出版商地址 : 24-28 OVAL RD, LONDON NW1 7DX, ENGLAND

ISSN: 1084-8045

DOI: 10.1016/j.jnca.2007.10.001

29 字符的来源出版物名称缩写 : J NETW COMPUT APPL

ISO 来源文献出版物名称缩写 : J. Netw. Comput. Appl.

来源文献页码计数 : 15

学科类别 : Computer Science, Hardware & Architecture; Computer Science, Interdisciplinary

Applications; Computer Science, Software Engineering

ISI 文献传递号 : 401NC

--------------------------------------------------------------------------------

显示 2 条，共 51 条

作者 : Jiao, L (Jiao, Li); Huang, HJ (Huang, Hejiao); Cheung, TY (Cheung, To-Yat)

标题 : HANDLING RESOURCE SHARING PROBLEM USING PROPERTY-PRESERVING

PLACE FUSIONS OF PETRI NETS

来源出版物 : JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 17 (3): 365-387 JUN

2008

语言 : English


作者关键词 : Petri nets; place fusions; property preservation; resource sharing; system design

KeyWords Plus: FLEXIBLE MANUFACTURING SYSTEMS; DEADLOCK-AVOIDANCE;

ALLOCATION SYSTEMS; LIVENESS

摘要 : Resource sharing is a very complex task in system design because it may induce undesirable properties such as deadlocks and overflows. This paper proposes a method for handling this task.

Resource sharing is formulated as a place fusion on a Petri net specification that satisfies a designated set of properties and includes some duplicated places representing accesses to the resources. If this fusion satisfies some conditions, the obtained net will preserve the original properties after the incorporation of resource sharing. This paper considers two classes of property-preserving place fusions. Each class specifies the Petri net type to be used, the structural relationship among the resource places and possibly some additional conditions for the place fusion to preserve a designated set of properties. As an illustration, these place fusion approaches are applied to solve a resource sharing problem in the design of manufacturing systems.

地址 : [Jiao, Li] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R

China; [Huang, Hejiao] Shenzhen Grad Sch, Harbin Inst Technol, Dept Comp Sci & Informat

Technol, Shenzhen, Peoples R China; [Cheung, To-Yat] City Univ Hong Kong, Dept Comp Sci,

Hong Kong, Hong Kong, Peoples R China

通讯作者地址 : Jiao, L, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing,

Peoples R China.

电子邮箱地址 : ljiao@ios.ac.cn




60421001

60633010

This work was financially supported by the National Natural Science Foundation of China ( Nos.

60473007, 60421001, and 60633010). We thank the editor and the anonymous referees for their valuable remarks and comments.


被引频次 : 0

出版商 : WORLD SCIENTIFIC PUBL CO PTE LTD

出版商地址 : 5 TOH TUCK LINK, SINGAPORE 596224, SINGAPORE

ISSN: 0218-1266

29 字符的来源出版物名称缩写 : J CIRCUITS SYSTEMS COMP

ISO 来源文献出版物名称缩写 : J. Circuits Syst. Comput.


学科类别 : Computer Science, Hardware & Architecture; Engineering, Electrical & Electronic

ISI 文献传递号 : 397FL

--------------------------------------------------------------------------------

显示 3 条，共 51 条

作者 : Ku, D (Ku, Daychyi); Qin, SF (Qin, Shengfeng); Wright, DK (Wright, David K.); Ma, CX

(Ma, Cuixia)

标题 : Online Personalised Non-photorealistic Rendering Technique for 3D Geometry from

Incremental Sketching

来源出版物 : COMPUTER GRAPHICS FORUM, 27 (7): 1861-1868 OCT 2008

语言 : English

文献类型 : Proceedings Paper

会议标题 : 16th Pacific Conference on Computer Graphics and Applications (Pacific Graphics

2008)

会议日期 : OCT 08-10, 2008

会议地点 : Tokyo, JAPAN

作者关键词 : Non-photorealistic rendering; incremental sketching; 3D geometry modelling; conceptual design

摘要 : This paper presents an online personalised non-photorealistic rendering (NPR) technique for

3D models generated from interactively sketched input. This technique has been integrated into a sketch-based modelling system. It lets users interact with computers by drawing naturally, without specifying the number, order, or direction of strokes. After sketches are interpreted as 3D objects, they can be rendered with personalised drawing styles so that the reconstructed 3D model can be presented in a sketchy style similar in appearance to what have been drawn for the 3D model. This technique captures the user's drawing style without using template or prior knowledge of the

sketching style. The personalised rendering style can be applied to both visible and initially invisible geometry. The rendering strokes are intelligently selected from the input sketches and mapped to edges of the 3D object. In addition, non-geometric information such as surface textures can be added to the recognised object in different sketching modes. This will integrate sketch-based incremental 3D modelling and NPR into conceptual design.

地址 : [Ku, Daychyi; Qin, Shengfeng; Wright, David K.] Brunel Univ, Sch Engn & Design,

Uxbridge UB8 3PH, Middx, England; [Ma, Cuixia] Chinese Acad Sci, Inst Software, Beijing

100080, Peoples R China

通讯作者地址 : Qin, SF, Brunel Univ, Sch Engn & Design, Uxbridge UB8 3PH, Middx, England.


被引频次 : 0

出版商 : BLACKWELL PUBLISHING

出版商地址 : 9600 GARSINGTON RD, OXFORD OX4 2DQ, OXON, ENGLAND

ISSN: 0167-7055

29 字符的来源出版物名称缩写 : COMPUTER GRAPHICS FORUM

ISO 来源文献出版物名称缩写 : Comput. Graph. Forum


学科类别 : Computer Science, Software Engineering

ISI 文献传递号 : 397ME

--------------------------------------------------------------------------------

显示 4 条，共 51 条

作者 : Tartary, C (Tartary, C.); Zhou, S (Zhou, S.); Lin, D (Lin, D.); Wang, H (Wang, H.); Pieprzyk,

J (Pieprzyk, J.)

标题 : Analysis of bilinear pairing-based accumulator for identity escrowing

来源出版物 : IET INFORMATION SECURITY, 2 (4): 99-107 DEC 2008

语言 : English


KeyWords Plus: GROUP SIGNATURE SCHEME

摘要 : An accumulator based on bilinear pairings was proposed at CT-RSA'05. Here, it is first demonstrated that the security model proposed by Lan Nguyen does lead to a cryptographic accumulator that is not collision resistant. Secondly, it is shown that collision-resistance can be provided by updating the adversary model appropriately. Finally, an improvement on Nguyen's identity escrow scheme, with membership revocation based on the accumulator, by removing the trusted third party is proposed.

地址 : [Zhou, S.] Chinese Acad Sci, Inst Software, SKLOIS Lab, Beijing 100080, Peoples R China;

[Wang, H.; Pieprzyk, J.] Macquarie Univ, Dept Comp, Ctr Adv Comp Algorithms & Cryptog, N

Ryde, NSW 2109, Australia; [Tartary, C.; Wang, H.] Nanyang Technol Univ, Sch Phys & Math Sci,

Div Math Sci, Singapore, Singapore

通讯作者地址 : Tartary, C, Tsinghua Univ, Inst Theoret Comp Sci, Beijing 100084, Peoples R

China.

电子邮箱地址 : ctortary@ntu.edu.sg




60673069

National Basic Research Program of China 2007CB807900

2007CB807901

973 Project of China 2004CB318004

Ministry of Education of Singapore T206B2204 iMURS scholarship

Australian Research Council DP0558773

DP0665035

The authors would like to thank Dr. Lan Nguyen for his comments related to the security, of his construction. We are grateful to the recommendations from the anonymous reviewers in order to improve the quality of this paper. This work was supported in part by the National Natural Science

Foundation of China Grant 60553001, 60673069, the National Basic Research Program of China

Grant 2007CB807900, 2007CB807901 and 973 Project of China (No. 2004CB318004). The research of Christophe Tartary, and Huaxiong Wang is also partially Supported by the Ministry of

Education of Singapore under grant T206B2204. Christophe Tartary did some of his work while being a PhD student at Macquarie University where his research was also funded by an iMURS scholarship as well as by the Australian Research Council under ARC Discovery Projects

DP0558773 and DP0665035.


被引频次 : 1

出版商 : INST ENGINEERING TECHNOLOGY-IET

出版商地址 : MICHAEL FARADAY HOUSE SIX HILLS WAY STEVENAGE, HERTFORD

SG1 2AY, ENGLAND

ISSN: 1751-8709

DOI: 10.1049/iet-ifs:20070091

29 字符的来源出版物名称缩写 : IET INF SECUR

ISO 来源文献出版物名称缩写 : IET Inf. Secur.


学科类别 : Computer Science, Information Systems; Computer Science, Theory & Methods

ISI 文献传递号 : 395WZ

--------------------------------------------------------------------------------

显示 5 条，共 51 条

作者 : Liu, F (Liu, F.); Wu, CK (Wu, C. K.); Lin, XJ (Lin, X. J.)

标题 : Colour visual cryptography schemes

来源出版物 : IET INFORMATION SECURITY, 2 (4): 151-165 DEC 2008

语言 : English


KeyWords Plus: SECRET SHARING SCHEME; IMAGES

摘要 : Visual cryptography scheme (VCS) is a kind of secret-sharing scheme which allows the encryption of a secret image into n shares that are distributed to n participants. The beauty of such

a scheme is that, the decryption of the secret image requires neither the knowledge of cryptography nor complex computation. Colour visual cryptography becomes an interesting research topic after the formal introduction of visual cryptography by Naor and Shamir in 1995.

The authors propose a colour (k, n)-VCS under the visual cryptography model of Naor and Shamir with no pixel expansion, and a colour (k, n)-extended visual cryptography scheme ((k, n)-EVCS) under the visual cryptography model of Naor and Shamir with pixel expansion the same as that of its corresponding black and white (k, n)-EVCS. Furthermore, the authors propose a black and white (k, n)-VCS and a black and white (k, n)-EVCS under the visual cryptography model of

Tuyls. Based on the black and white schemes, the authors propose a colour (k, n)-VCS and a colour (k, n)-EVCS under the same visual cryptography model, of which the pixel expansions are the same as that of their corresponding black and white (k, n)-VCS and (k, n)-EVCS, respectively.

The authors also give the experimental results of the proposed schemes, and compare the proposed scheme with known schemes in the literature.

地址 : [Liu, F.; Wu, C. K.] Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing

100190, Peoples R China; [Lin, X. J.] Ocean Univ China, Qingdao 266100, Peoples R China

通讯作者地址 : Liu, F, Chinese Acad Sci, Grad Univ, Beijing 100190, Peoples R China.

电子邮箱地址 : liufeng@is.iscas.ac.cn



China national 973 project 2004CB318004

China national 863 project 2006AA01Z423

Many thanks to the anonymous reviewers for their valuable comments. This work was supported by China national 973 project No. 2004CB318004 and China national 863 project No.

2006AA01Z423.


被引频次 : 1



SG1 2AY, ENGLAND

ISSN: 1751-8709

DOI: 10.1049/iet-ifs:20080066

29 字符的来源出版物名称缩写 : IET INF SECUR

ISO 来源文献出版物名称缩写 : IET Inf. Secur.


学科类别 : Computer Science, Information Systems; Computer Science, Theory & Methods

ISI 文献传递号 : 395WZ

--------------------------------------------------------------------------------

显示 6 条，共 51 条

作者 : Zhang, Y (Zhang, Yanci); Sun, H (Sun, Hanqiu); Wu, E (Wu, Enhua)

标题 : NBS: A new representation for point surfaces based on genetic clustering algorithm CAD and Graphics

来源出版物 : COMPUTERS & GRAPHICS-UK, 32 (6): 639-646 DEC 2008

语言 : English


会议标题 : 10th International Conference on Computer-Aided Design and Computer Graphics

会议日期 : OCT 15-18, 2007

会议地点 : Beijing, PEOPLES R CHINA

会议赞助商 : 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.

会议主办方 : Peking Univ

作者关键词 : Point-based modeling; Point-based rendering; Genetic algorithm; Normal maps

摘要 : In this paper, we propose a novel method that represents the highly complex point sets by clustering and reconstructing 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, NBSs 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. In respect to signal processing, our algorithm decouples the original data into two collections: coarse geometry information and fine surface details. The multi-level B-spline surfaces are employed to describe the coarse geometry information, and the normal maps are constructed to capture the fine surface details. Our experimental results show that this representation facilitates the modeling and rendering of complex point sets without losing the visual qualities. (c) 2008 Elsevier Ltd. All rights reserved.

地址 : [Zhang, Yanci; Wu, Enhua] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci,

Beijing 100864, Peoples R China; [Sun, Hanqiu] Chinese Univ Hong Kong, Dept Comp Sci &

Engn, Hong Kong, Hong Kong, Peoples R China; [Wu, Enhua] Univ Macau, Fac Sci & Technol,

Taipa, Peoples R China

通讯作者地址 : Zhang, Y, Sichuan Univ, Chengdu, Sichuan, Peoples R China.

电子邮箱地址 : yczhang@scu.edu.cn; hanqiu@cse.cuhk.edu.hk; EHWu@umac.mo


被引频次 : 0

出版商 : PERGAMON-ELSEVIER SCIENCE LTD

出版商地址 : THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB,

ENGLAND

ISSN: 0097-8493

DOI: 10.1016/j.cag.2008.09.002

29 字符的来源出版物名称缩写 : COMPUT GRAPH-UK

ISO 来源文献出版物名称缩写 : Comput. Graph.-UK



ISI 文献传递号 : 391XA

--------------------------------------------------------------------------------

显示 7 条，共 51 条

作者 : Yi-Chuan, J (Yi-Chuan, Jiang)

标题 : On Self-adjustment of Socila Conventions to Small Perturbations

来源出版物 : CHINESE PHYSICS LETTERS, 25 (12): 4215-4218 DEC 2008

语言 : English


KeyWords Plus: MOBILE AUTONOMOUS AGENTS; COORDINATION; EMERGENCE;

NETWORK

摘要 : We present a model for self-adjustment of social conventions to small perturbations, and investigate how perturbations can influence the convergence of social convention in different situations. The experimental results show that the sensitivity of social conventions is determined by not only the perturbations themselves but also the agent adjustment functions for the perturbations; and social conventions are more sensitive to the outlier agent number than to the strategy fluctuation magnitudes and localities of perturbations.

地址 : [Yi-Chuan, Jiang] Southeast Univ, Res Ctr Learning Sci, Nanjing 210096, Peoples R China;

[Yi-Chuan, Jiang] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100190,

Peoples R China

通讯作者地址 : Yi-Chuan, J, Southeast Univ, Res Ctr Learning Sci, Nanjing 210096, Peoples R

China.

电子邮箱地址 : yjiang@seu.edu.cn




Excellent Young Teachers Program of Southeast University

Supported by the National Natural Science Foundation of China under Grant No 60803060, and the Excellent Young Teachers Program of Southeast University.


被引频次 : 0

出版商 : IOP PUBLISHING LTD

出版商地址 : DIRAC HOUSE, TEMPLE BACK, BRISTOL BS1 6BE, ENGLAND

ISSN: 0256-307X

29 字符的来源出版物名称缩写 : CHIN PHYS LETT

ISO 来源文献出版物名称缩写 : Chin. Phys. Lett.


学科类别 : Physics, Multidisciplinary

ISI 文献传递号 : 384VK

--------------------------------------------------------------------------------

显示 8 条，共 51 条

作者 : Wang, DL (Wang, Danli); Dai, GZ (Dai, Guozhong); Wang, HA (Wang, Hongan); Chiu, SC

(Chiu, Steve C.)

标题 : Scenario-focused development method for a pen-based user interface: model and

applications

来源出版物 : JOURNAL OF SUPERCOMPUTING, 46 (2): 139-149 NOV 2008

语言 : English


作者关键词 : Scenario; Interface scenario; Scenario-focused development method; PUI

摘要 : Pen-based user interface (PUI) has drawn significant interest, owing to its intuitiveness and convenience. While much of the research focuses on the technology, the usability of a PUI has been relatively low since human factors have not been considered sufficiently. Scenario-centric designs are ideal ways to improve usability. However, such designs possess some problems in practical use. To cope with these design issues, the concept of "interface scenarios" is proposed in to facilitate the interface design, and to help users understand the interaction process in such designs. The proposed scenario-focused development method for PUI is coupled with a practical application to show its effectiveness and usability.

地址 : [Wang, Danli; Dai, Guozhong; Wang, Hongan] Chinese Acad Sci, Inst Software, Beijing

100080, Peoples R China; [Chiu, Steve C.] Idaho State Univ, Coll Engn, Pocatello, ID 83209 USA

通讯作者地址 : Wang, DL, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.

电子邮箱地址 : danli@ios.cn; dgz@iel.iscas.ac.cn; wha@iel.iscas.ac.cn; chiustev@isu.edu



National Grand Fundamental Research 973 Program 2002CB312103


Innovation Fund For Technology Based Firms 05C26221100020

National Knowledge Innovation Program KGCX2-YW-606

The authors appreciate the evaluation performed by Liu Rude, Cheng Tiegang, and the implementation of the meeting system by Yanyan Qin, and Lishuang Xu. This research is supported in part by the National Grand Fundamental Research 973 Program (under Grant No.

2002CB312103), the National Natural Science Foundation of China (under Grant No. 60373056), the Innovation Fund For Technology Based Firms (Grant No. 05C26221100020), and the CAS

Pilot Project of the National Knowledge Innovation Program "an action plan to aid the handicapped with science and technology (Grant No. KGCX2-YW-606)."


被引频次 : 0

出版商 : SPRINGER

出版商地址 : VAN GODEWIJCKSTRAAT 30, 3311 GZ DORDRECHT, NETHERLANDS

ISSN: 0920-8542

DOI: 10.1007/s11227-007-0161-1

29 字符的来源出版物名称缩写 : J SUPERCOMPUT

ISO 来源文献出版物名称缩写 : J. Supercomput.


学科类别 : Computer Science, Hardware & Architecture; Computer Science, Theory & Methods;

Engineering, Electrical & Electronic

ISI 文献传递号 : 363EM

--------------------------------------------------------------------------------

显示 9 条，共 51 条

作者 : Ji, YX (Ji, Yuxuan); Ma, HT (Ma, Hengtai); Zheng, G (Zheng, Gang)

标题 : Analysis and Design on Key Updating Policies for Satellite Networks

来源出版物 : INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS &

CONTROL, 3 (4): 343-352 DEC 2008

语言 : English


作者关键词 : key updating; satellite networks; model; protocol; simulation

摘要 : Satellite networks are becoming increasingly important because of the exciting global communication services they provide. Key management policies have been successfully deployed in terrestrial networks to guarantee the information security. However, long propagation, storage and computation constraints bring new challenges in designing efficient and cost-effective key updating policies for satellite networks. Based on the structure and communication features of satellite networks, a dynamic key management model for satellite networks (DKM-SN) is presented, which includes certificates owned by each satellite, primary keys and session keys both of which are shared between two satellites. Furthermore, a protocol is designed for updating certificates for satellites; different policies for updating primary and session keys are studied and their efficiency and security are analyzed and compared. In addition, simulation environment for satellite networks is built and the key updating processes are implemented in Walker constellation.

From the simulation results, further contrasts on key updating time and storage costs between the applications of IBM hybrid key management model (HKMM) and DKM-SN in satellite networks are presented. Finally, important suggestions in designing key updating policies are given.

地址 : [Ji, Yuxuan; Ma, Hengtai; Zheng, Gang] Chinese Acad Sci, Natl Key Lab Integrated

Informat Syst Technol, Inst Software, Beijing 100190, Peoples R China

通讯作者地址 : Ji, YX, Chinese Acad Sci, Natl Key Lab Integrated Informat Syst Technol, Inst

Software, 4 S 4th St, Beijing 100190, Peoples R China.

电子邮箱地址 : jiyuxuan06@gmail.com; htma@ios.cn; gangzhengcn@yahoo.com.cn


被引频次 : 0

出版商 : CCC PUBL-AGORA UNIV

出版商地址 : PIATA TINERETULUI 8, ORADEA, JUD, BIHOR, 410526, ROMANIA

ISSN: 1841-9836

29 字符的来源出版物名称缩写 : INT J COMPUT COMMUN CONTROL

ISO 来源文献出版物名称缩写 : Int. J. Comput. Commun. Control


学科类别 : Automation & Control Systems; Computer Science, Information Systems

ISI 文献传递号 : 362RM

--------------------------------------------------------------------------------

显示 10 条，共 51 条

作者 : Jiao, L (Jiao, Li)

标题 : A note on regular Petri nets

来源出版物 : INFORMATION PROCESSING LETTERS, 108 (3): 110-114 OCT 16 2008

语言 : English


作者关键词 : Regular Petri nets; Siphon; State machines; Trap; Formal methods

地址 : Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China

通讯作者地址 : Jiao, L, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing,

Peoples R China.





This work was financially supported by the National Natural Science Foundation of China (No.

60721061). We thank the anonymous referees for their valuable remarks and comments.


被引频次 : 0

出版商 : ELSEVIER SCIENCE BV

出版商地址 : PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS

ISSN: 0020-0190

DOI: 10.1016/j.ipl.2008.04.012

29 字符的来源出版物名称缩写 : INF PROCESS LETT

ISO 来源文献出版物名称缩写 : Inf. Process. Lett.


学科类别 : Computer Science, Information Systems

ISI 文献传递号 : 358ZF

--------------------------------------------------------------------------------

显示 11 条，共 51 条

作者 : Brodhead, P (Brodhead, Paul); Li, AS (Li, Angsheng); Li, WL (Li, Weilin)

标题 : Continuity of capping in C-bT

来源出版物 : ANNALS OF PURE AND APPLIED LOGIC, 155 (1): 1-15 AUG 2008

语言 : English


作者关键词 : Computability; Continuity; bT-degrees

KeyWords Plus: TURING DEGREES; WTT

摘要 : A set A subset of omega is called computably enumerable (c.e., for short), if there is an algorithm to enumerate the elements of it. For sets A, B C a), we say that A is bounded Turing reducible to (or alternatively, weakly truth table (wtt, for short) reducible to) B if there is a Turing functional, Phi say, with a computable bound of oracle query bits such that A is computed by Phi equipped with an oracle B, written A <=(bT) B. Let C-bT be the structure of the c.e. bT-degrees, the c.e. degrees under the bounded Turing reductions. In this paper we study the continuity properties in C-bT. We show that for any c.e. bT-degree b not equal 0, 0', there is a c.e. bT-degree a > b such that for any c.e. bT-degree x, b boolean AND x = 0 if and only if a boolean AND x = 0.

We prove that the analog of the Seetapun local noncappability theorem from the c.e. Tufing degrees also holds in C-bT. This theorem demonstrates that every b not equal 0, 0' is noncappable with any nontrivial degree below some a > b (i.e. if x < a and x boolean AND b = 0 then x = 0). (C)

2008 Elsevier B.V. All fights reserved.

地址 : [Brodhead, Paul] Univ Florida, Dept Math, Gainesville, FL 32611 USA; [Li, Angsheng; Li,

Weilin] Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China

通讯作者地址 : Brodhead, P, Univ Florida, Dept Math, 358 Little Hall,POB 118105, Gainesville,

FL 32611 USA.

电子邮箱地址 : brodhead@math.ufl.edu; angsheng@ios.ac.cn; liweilin06@mails.gucas.ac.cn



NSF 0714151

NSFC 60325206

60310213

Royal Society of the United Kingdom

The project was implemented when the first author was visiting the Institute of Software, Chinese

Academy of Sciences as part of the East Asia and Pacific Summer Institute (EAPSI) in China.

This program is a joint venture between the NSF (US), NSFC (China), and the Ministry of Science and Technology of P. R. China. The first author was funded by this program under NSF grant number 0714151. All authors acknowledge the support from this program. The second and the third authors are partially supported by NSFC grant number 60325206, and NSFC Grand

International Joint Project No. 60310213, and its matching fund from the Royal Society of the

United Kingdom. The authors would like to thank Bob Soare for the useful comments on the initial manuscript of the paper and for sending us the preliminary version of the first part of his new book: Computability Theory and Applications for our notations' reference.


被引频次 : 1



ISSN: 0168-0072

DOI: 10.1016/j.apal.2008.02.002

29 字符的来源出版物名称缩写 : ANN PURE APPL LOGIC

ISO 来源文献出版物名称缩写 : Ann. Pure Appl. Log.


学科类别 : Mathematics, Applied; Mathematics

ISI 文献传递号 : 360NA

--------------------------------------------------------------------------------

显示 12 条，共 51 条

作者 : Zhang, Z (Zhang, Zhi); Shi, PF (Shi, Pengfei); Che, HY (Che, Haoyang); Gu, J (Gu, Jun)

标题 : An algebraic framework for schema matching

来源出版物 : INFORMATICA, 19 (3): 421-446 2008

语言 : English


作者关键词 : schema matching; schema homomorphism; schema isomorphism; graph homomorphism; labeled graph matching; computation complexity

KeyWords Plus: CONSTRAINT SATISFACTION; HOMOMORPHISM

摘要 : 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.

An algebraic framework for schema matching is developed in this paper. First, based on universal algebra, we propose a meta-meta structure for schema, which is named multi-labeled schema. This definition has a distinctive feature: it is able to formally describe any particular style of schemas, and transforms a schema and other available information into a finite structure over specific signature. Later, we introduce a formal definition of schema matching that is called multivalent matching. 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. This framework builds the algorithm model for SMP. Thirdly, we show a classification of schema matching based on the algebraic framework. Finally, we discuss the relations between matching cardinality and subclasses of schema homomorphism.

地址 : [Zhang, Zhi; Shi, Pengfei] Shanghai Jiao Tong Univ, SAP Labs China, Inst Image Proc &

Pattern Recognit, Shanghai 200030, Peoples R China; [Che, Haoyang; Gu, Jun] Chinese Acad Sci,

Inst Software, Beijing 100080, Peoples R China

通讯作者地址 : Zhang, Z, Shanghai Jiao Tong Univ, SAP Labs China, Inst Image Proc & Pattern

Recognit, Shanghai 200030, Peoples R China.

电子邮箱地址 : uphenix@hotmail.com; chehy@hotmail.com



National 973 Information Technology and High-Performance Software Program of China

G1998030408

This work was supported in part by the National 973 Information Technology and

High-Performance Software Program of China under Grant No.G1998030408. This paper is the extended version of WAIM 2005. We would like to thank the anonymous reviewers for their careful work in evaluating an earlier version of this paper.


被引频次 : 0

出版商 : INST MATHEMATICS & INFORMATICS

出版商地址 : AKADEMIJOS 4, VILNIUS 2600, LITHUANIA

ISSN: 0868-4952

29 字符的来源出版物名称缩写 : INFORMATICA

ISO 来源文献出版物名称缩写 : Informatica


学科类别 : Computer Science, Information Systems; Mathematics, Applied

ISI 文献传递号 : 356MO

--------------------------------------------------------------------------------

显示 13 条，共 51 条

作者 : Lin, P (Lin, Pin); Wu, WL (Wu, Wenling); Wu, CK (Wu, Chuankun); Qiu, T (Qiu, Tian)

标题 : Analysis of all-or-nothing hash functions

来源出版物 : JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 24 (5):

1473-1484 SEP 2008

语言 : English


作者关键词 : hash functions; compression functions; random oracle; all-or-nothing; block cipher

KeyWords Plus: CONSTRUCTIONS; ATTACKS

摘要 : The most popular method to construct hash functions is to iterate a compression function on the input message. This method is called Merkle-Damgard method. Most hash functions used in practice such as MD4, MD5, SHA-0, SHA-1 are based on this method. However this method is not always the best. For example, this method can not resist multi-collision attack. Recently some modifications of this method are proposed. These modified methods are based on

Merkle-Damgard method and some improvements are made. A hash function based on

All-or-Nothing property is one of these improvements. All-or-nothing property is an encryption mode for block ciphers. It has the property that one must decrypt all cipher blocks to determine any plain-text block. All-or-nothing hash function is a kind of hash function constructed with the all-or-nothing property. The authors of it claim that it is more secure than those common hash functions. In this paper, we will show that this is not true and there are still some flaws on this improved method.

地址 : [Lin, Pin; Wu, Wenling; Wu, Chuankun] Chinese Acad Sci, Inst Software, State Key Lab

Informat Secur, Beijing 100190, Peoples R China; [Qiu, Tian] Natl Key Lab Integrated Informat

Syst Technol, Beijing 100190, Peoples R China; [Lin, Pin; Qiu, Tian] Chinese Acad Sci, Grad Sch,

Beijing 100190, Peoples R China

通讯作者地址 : Lin, P, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing

100190, Peoples R China.

电子邮箱地址 : ping_linux@163.com; wwl@is.iscas.ac.cn; ckwu@is.iscas.ac.cn; qiutian@ios.cn




Major State Basic Research Development Program of China (973 Program) 2004CB318004

National High-Tech Research and Development Program of China (863 Program)

2007AA01Z470

This work was supported by National Natural Science Foundation of China (grant No. 90604036),

Major State Basic Research Development Program of China (973 Program, grant No.

2004CB318004) and National High-Tech Research and Development Program of China (863

Program, grant No. 2007AA01Z470).


被引频次 : 0

出版商 : INST INFORMATION SCIENCE

出版商地址 : ACADEMIA SINICA, TAIPEI 115, TAIWAN

ISSN: 1016-2364

29 字符的来源出版物名称缩写 : J INF SCI ENG

ISO 来源文献出版物名称缩写 : J. Inf. Sci. Eng.



ISI 文献传递号 : 354TU

--------------------------------------------------------------------------------

显示 14 条，共 51 条

作者 : Zhang, ZF (Zhang, Zhifang); Liu, ML (Liu, Mulan); Xiao, LL (Xiao, Liangliang)

标题 : Rearrangements of access structures and their realizations in secret sharing schemes

来源出版物 : DISCRETE MATHEMATICS, 308 (21): 4882-4891 NOV 6 2008

语言 : English


作者关键词 : perfect secret sharing scheme; statistical secret sharing scheme; computational secret sharing scheme; rearrangement of access structures

摘要 : Firstly, the definitions of the secret sharing schemes (SSS), i.e. perfect SSS, statistical SSS and computational SSS are given in an uniform way, then some new schemes for several familiar rearrangements of access structures with respect to the above three types of SSS are constructed from the old schemes. It proves that the new schemes and the old schemes are of the same security.

A method of constructing the SSS which realizes the general access structure by rearranging some basic access structures is developed. The results of this paper can be used to key managements and access controls. (c) 2007 Elsevier B.V. All rights reserved,

地址 : [Zhang, Zhifang; Liu, Mulan] Chinese Acad Sci, Key Lab Math Mechanizat, Acad Math &

Syst Sci, Beijing 100080, Peoples R China; [Xiao, Liangliang] Chinese Acad Sci, Inst Software,


通讯作者地址 : Liu, ML, Chinese Acad Sci, Key Lab Math Mechanizat, Acad Math & Syst Sci,

Beijing 100080, Peoples R China.

电子邮箱地址 : mlliu@amss.ac.cn



Knowledge Innovation Program of the Chinese Academy of Sciences


973 project 2004CB318000

Supported by the Knowledge Innovation Program of the Chinese Academy of Sciences.

Supported by the National Natural Science Foundation of China (No. 90304012) and 973 project

(No. 2004CB318000).


被引频次 : 0



ISSN: 0012-365X

DOI: 10.1016/j.disc.2007.09.007

29 字符的来源出版物名称缩写 : DISCRETE MATH

ISO 来源文献出版物名称缩写 : Discret. Math.


学科类别 : Mathematics

ISI 文献传递号 : 355EG

--------------------------------------------------------------------------------

显示 15 条，共 51 条

作者 : Yan, J (Yan, Jun); Zhang, JA (Zhang, Jian)

标题 : A backtracking search tool for constructing combinatorial test suites

来源出版物 : JOURNAL OF SYSTEMS AND SOFTWARE, 81 (10): 1681-1693 OCT 2008

语言 : English


作者关键词 : software testing; combinatorial testing; optimal test set; covering array; orthogonal array

KeyWords Plus: COVERING ARRAYS; STRENGTH-3

摘要 : Combinatorial testing is an important testing method. It requires the test cases to cover various combinations of parameters of the system under test. The test generation problem for combinatorial testing can be modeled as constructing a matrix which has certain properties. This paper first discusses two combinatorial testing criteria: covering array and orthogonal array, and then proposes a backtracking search algorithm to construct matrices satisfying them. Several search heuristics and symmetry breaking techniques are used to reduce the search time. This paper also introduces some techniques to generate large covering array instances from smaller ones. All the techniques have been implemented in a tool called EXACT (EXhaustive seArch of

Combinatorial Test suites). A new optimal covering array is found by this tool. (C) 2008 Elsevier

Inc. All rights reserved.

地址 : [Yan, Jun; Zhang, Jian] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing


通讯作者地址 : Zhang, JA, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, 4 South

4th St,POB 8718, Beijing 100190, Peoples R China.

电子邮箱地址 : yanjun@ios.ac.cn; zj@ios.ac.cn




60633010

This work is partially supported by the National Natural Science Foundation of China (NSFC) under Grant No. 60673044 and 60633010.


被引频次 : 0

出版商 : ELSEVIER SCIENCE INC

出版商地址 : 360 PARK AVE SOUTH, NEW YORK, NY 10010-1710 USA

ISSN: 0164-1212

DOI: 10.1016/j.jss.2008.02.034

29 字符的来源出版物名称缩写 : J SYST SOFTWARE

ISO 来源文献出版物名称缩写 : J. Syst. Softw.


学科类别 : Computer Science, Software Engineering; Computer Science, Theory & Methods

ISI 文献传递号 : 351LZ

--------------------------------------------------------------------------------

显示 16 条，共 51 条

作者 : Shen, YD (Shen, Yi-Dong)

标题 : Reasoning with recursive loops under the PLP framework

来源出版物 : ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 9 (4): Art. No. 27 AUG

2008

语言 : English


作者关键词 : languages; theory; logic programming; Bayesian networks; recursive loops; cyclic influences; the well founded model

KeyWords Plus: GENERAL LOGIC PROGRAMS; WELL-FOUNDED SEMANTICS;

BAYESIAN NETWORKS; MECHANISMS; LANGUAGE; QUERIES

摘要 : Recursive loops in a logic program present a challenging problem to the PLP ( Probabilistic

Logic Programming) framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never stop. On the other hand, they may 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 article, we propose a novel solution to this problem by making use of recursive loops to build a stationary dynamic Bayesian network. We introduce a new PLP formalism, called a Bayesian knowledge base. It allows recursive loops and contains logic clauses of the form A <- A(1),...,Al, true, Context, Types, which naturally formulate the knowledge that the A(i)s have direct influences on A in the context Context under the type constraints Types. We use the well- founded model of a logic program to define the direct influence relation and apply SLG- resolution to compute the space of random variables together with their parental connections. This establishes a clear declarative semantics for a Bayesian knowledge base. We view a logic program with recursive loops as a special temporal model, where backward-chaining cycles of the form A <- ...

A <- ... are interpreted as feedbacks. This extends existing PLP approaches, which mainly aim at

(nontemporal) relational models.

地址 : Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R

China

通讯作者地址 : Shen, YD, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing


电子邮箱地址 : ydshen@ios.ac.cn




60673103

60421001

60373052

This work is supported in part by the National Natural Science Foundation of China (grants

60721016, 60673103, 60421001, and 60373052).


被引频次 : 0

出版商 : ASSOC COMPUTING MACHINERY

出版商地址 : 2 PENN PLAZA, STE 701, NEW YORK, NY 10121-0701 USA

ISSN: 1529-3785

文献编号 : 27

DOI: 10.1145/1380572.1380576

29 字符的来源出版物名称缩写 : ACM TRANS COMPUT LOG

ISO 来源文献出版物名称缩写 : ACM Trans. Comput. Log.


学科类别 : Computer Science, Theory & Methods

ISI 文献传递号 : 351NY

--------------------------------------------------------------------------------

显示 17 条，共 51 条

作者 : Cai, JY (Cai, Jin-Yi); Li, AS (Li, Ang-Sheng)

标题 : Preface

来源出版物 : JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 23 (5): 693-693

SEP 2008

语言 : English

文献类型 : Editorial Material

地址 : [Li, Ang-Sheng] Chinese Acad Sci, Inst Software, ISCAS, Beijing 100864, Peoples R China

通讯作者地址 : Cai, JY, Univ Wisconsin, Madison, WI 53706 USA.


被引频次 : 0

出版商 : SCIENCE CHINA PRESS

出版商地址 : 16 DONGHUANGCHENGGEN NORTH ST, BEIJING 100717, PEOPLES R

CHINA

ISSN: 1000-9000

29 字符的来源出版物名称缩写 : J COMPUT SCI TECHNOL

ISO 来源文献出版物名称缩写 : J. Comput. Sci. Technol.


学科类别 : Computer Science, Hardware & Architecture; Computer Science, Software

Engineering

ISI 文献传递号 : 349ZT

--------------------------------------------------------------------------------

显示 18 条，共 51 条

作者 : Li, WL (Li, Wei-Lin); Zhang, P (Zhang, Peng); Zhu, DM (Zhu, Da-Ming)

标题 : On constrained facility location problems


SEP 2008

语言 : English


作者关键词 : approximation algorithm; Facility Location; local search; approximation hardness

KeyWords Plus: IMPROVED APPROXIMATION ALGORITHMS; HEURISTICS

摘要 : Given m facilities each with an opening cost, n dernands, and distance between every demand and facility, the Facility Location problem Finds a solution which opens some facilities to connect every demand to an opened facility such that the total cost of the solution is minimized.

The k-Facility Location problem further requires that the number of opened facilities is at most k, where k is a parameter given in the instance of the problem. We consider the Facility Location problems satisfying that for every demand the ratio of the longest distance to facilities and the shortest distance to facilities is at most omega, where omega is a predefined constant. Using the local search approach with scaling technique and error control technique, for any arbitrarily small constant epsilon > 0, we give a polynomial-time approximation algorithm for the omega-constrained Facility Location problem with approximation ratio 1 + root omega+ 1 + epsilon, which significantly improves the previous best known ratio (omega + 1)/alpha for some 1

<= alpha <= 2; and a polynomial-time approximation algorithm for the omega-constrained k-Facility Location problem with approximation ratio omega + 1 + epsilon. On the aspect of approximation hardness, we prove that unless NP subset of DTIME(n(O(log log n))), the omega-constrained Facility Location problem cannot be approximated within 1 + ln root omega-1, which slightly improves the previous best known hardness result L.243 + 0.316 In(w - 1). The experimental results on the standard test instances of Facility Location problem show that our algorithm also has good performance in practice.

地址 : [Zhang, Peng; Zhu, Da-Ming] Shandong Univ, Sch Comp Sci & Technol, Jinan 250101,

Peoples R China; [Li, Wei-Lin] Chinese Acad Sci, Grad Univ, Beijing 100190, Peoples R China;

[Li, Wei-Lin] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100190, Peoples

R China

通讯作者地址 : Zhang, P, Shandong Univ, Sch Comp Sci & Technol, Jinan 250101, Peoples R

China.

电子邮箱地址 : liweilin06@mails.gucas.ac.cn; algzhang@gmail.com; dmzhu@sdu.edu.cn




60310213

60573024

Supported by the National Natural Science Foundation of China for Distinguished Young Scholars

under Grant No. 60325206, the National Natural Science Foundation of China for Major

International (Regional) Joint Research Project under Grant No. 60310213, and the National

Natural Science Foundation of China under Grant No. 60573024.


被引频次 : 0



CHINA

ISSN: 1000-9000





Engineering

ISI 文献传递号 : 349ZT

--------------------------------------------------------------------------------

显示 19 条，共 51 条

作者 : Zhou, X (Zhou, Xiang)

标题 : Ehrenfeucht-Fraisse games in finite set theory

来源出版物 : INFORMATION PROCESSING LETTERS, 108 (1): 3-9 SEP 15 2008

语言 : English


作者关键词 : specification languages; arithmetic predicates; finite set theory; fragments of first order logic; inexpressibility; Ehrenfeucht-Fraisse games

摘要 : In this article, with Ehrenfeucht-Fraisse games we prove that Delta(1) not equal Delta(0) on

BFR, which implies Delta not equal Delta(0) on BFR, and thus solve an open problem raised by

Albert Atserias in his dissertation (Delta(0), Delta(1), Delta are fragments of first order logic and

BFR is a class of finite sets which in essence is equivalent to a class of finite pure arithmetic structures with built-in BIT predicate). (c) 2008 Elsevier B.V. All rights reserved.

地址 : [Zhou, Xiang] Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100190, Peoples R

China; [Zhou, Xiang] Chinese Acad Sci, Grad Sch, Beijing 100049, Peoples R China

通讯作者地址 : Zhou, X, Chinese Acad Sci, Comp Sci Lab, Inst Software, POB 8718, Beijing


电子邮箱地址 : zhoux@ios.ac.cn




60721061

National Grand Fundamental Research 2002cb312200

Supported by the National Natural Science Foundation of China under Grant No. 60573012 and

60721061, and the National Grand Fundamental Research 973 Program of China under Grant No.

2002cb312200.


被引频次 : 0



ISSN: 0020-0190

DOI: 10.1016/j.ipl.2008.03.011





ISI 文献传递号 : 347IN

--------------------------------------------------------------------------------

显示 20 条，共 51 条

作者 : Zhu, WT (Zhu, Wen-Tao); Wu, CL (Wu, Chuan-Lun)

标题 : Security of the redefined Liaw's broadcasting cryptosystem

来源出版物 : COMPUTERS & MATHEMATICS WITH APPLICATIONS, 56 (7): 1665-1667

OCT 2008

语言 : English


作者关键词 : information security; cryptology; broadcasting cryptosystem; key management; cryptanalysis

KeyWords Plus: COMPUTER-NETWORKS; CRYPTANALYSIS

摘要 : Liaw proposed a broadcasting cryptosystem [H.T. Liaw, Broadcasting cryptosystem in computer networks, Computers & Mathematics with Applications 37 (Mar. 1999) 85-87] which claims to involve fewer broadcasting messages, and has attracted quite some research efforts on iterative analysis and improvement [H.M. Sun, Security of broadcasting cryptosystem in computer networks, Electronics Letters 35 (Nov. 1999) 2108-2109; Y.M. Tseng, J. K. Jan, Cryptanalysis of

Liaw's broadcasting cryptosystem, Computers & Mathematics with Applications 41 (Jun. 2001)

1575-1578: J.M. Masque, A. Peinado, Cryptanalysis of improved Liaw's broadcasting cryptosystem, journal of Information Science and Engineering 22 (Mar. 2006) 391-399]. We show that the redefined Liaw's broadcasting cryptosystem recently presented in [J.M. Masque, A.

Peinado, Cryptanalysis of improved Liaw's broadcasting cryptosystem, journal of Information

Science and Engineering 22 (Mar. 2006) 391-399] is still insecure in that an unauthorized user is able to obtain the shared secret, which is only intended for certain privileged users. (C) 2008

Elsevier Ltd. All rights reserved.

地址 : [Zhu, Wen-Tao] Chinese Acad Sci, Grad Univ, State Key Lab Informat Secur, Beijing

100049, Peoples R China; [Wu, Chuan-Lun] Chinese Acad Sci, Inst Software, State Key Lab

Informat Secur, Beijing 100190, Peoples R China

通讯作者地址 : Zhu, WT, Chinese Acad Sci, Grad Univ, State Key Lab Informat Secur, POB 4588,


电子邮箱地址 : wtzhu@ieee.org; ckwu@is.iscas.ac.cn



Natural Science Foundation of China 60503046

National Grand Fundamental Research (973) Program of China 2007CB807902

This work was supported by the Natural Science Foundation of China (NSFQ under Grant No.

60503046, and partially supported by the National Grand Fundamental Research (973) Program of

China under Grant No. 2007CB807902.


被引频次 : 2



ENGLAND

ISSN: 0898-1221

DOI: 10.1016/j.camwa.2008.03.025

29 字符的来源出版物名称缩写 : COMPUT MATH APPL

ISO 来源文献出版物名称缩写 : Comput. Math. Appl.


学科类别 : Computer Science, Interdisciplinary Applications; Mathematics, Applied

ISI 文献传递号 : 346JS

--------------------------------------------------------------------------------

显示 21 条，共 51 条

作者 : Huang, T (Huang, Tao); Li, L (Li, Lei); Wei, J (Wei, Jun)

标题 : Efficient approach for Web services selection with multi-QoS constraints

来源出版物 : INTERNATIONAL JOURNAL OF COOPERATIVE INFORMATION SYSTEMS,

17 (3): 349-371 SEP 2008

语言 : English


会议标题 : 5th International Conference on Service-Oriented Computing (ICSOC 2007)

会议日期 : SEP 17-20, 2007

会议地点 : Vienna, AUSTRIA

会议赞助商 : ACM SIGHH.; ACM SIGWeb.; ACM SIGSE.; Networked European Software &

Services Intitiat.

作者关键词 : QoS; Web services; performance; composite service selection

KeyWords Plus: ALGORITHMS; QUALITY

摘要 : With the increasing number of Web Services with similar or identical functionality, the non-functional properties of a Web Service will become more and more important. Hence, a choice needs to be made to determine which services are to participate in a given composite service. In general, multi-QoS constrained Web Services composition, with or without optimization, is a NP-complete problem on computational complexity that cannot be exactly solved in polynomial time. A lot of heuristics and approximation algorithms with polynomial- and pseudo-polynomial-time complexities have been designed to deal with this problem. However,

these approaches suffer from excessive computational complexities that cannot be used for service composition in runtime. In this paper, we propose a efficient approach for multi-QoS constrained

Web Services selection. Firstly, a user preference model was proposed to collect the user's preference. And then, a correlation model of candidate services are established in order to reduce the search space. Based on these two model, a heuristic algorithm is then proposed to find a feasible solution for multi-QoS constrained Web Services selection with high performance and high precision. The experimental results show that the proposed approach can achieve the expecting goal.

地址 : [Huang, Tao; Wei, Jun] Chinese Acad Sci, Technol Ctr Software Engn, Inst Software,

Beijing 100190, Peoples R China; [Li, Lei] Univ Sci & Technol China, Dept Comp Sci & Technol,


通讯作者地址 : Huang, T, Chinese Acad Sci, Technol Ctr Software Engn, Inst Software, POB

8718, Beijing 100190, Peoples R China.

电子邮箱地址 : huangtao@iscas.ac.cn; lilei@otcaix.iscas.ac.cn; wj@otcaix.iscas.ac.cn


被引频次 : 0



ISSN: 0218-8430

29 字符的来源出版物名称缩写 : INT J COOP INF SYST

ISO 来源文献出版物名称缩写 : Int. J. Coop. Inf. Syst.



ISI 文献传递号 : 342IS

--------------------------------------------------------------------------------

显示 22 条，共 51 条

作者 : Feng, DG (Feng Dengguo); Wang, XG (Wang Xingang); Xu, Z (Xu Zhen)

标题 : On policy evolution in centralized secure interoperation of multiple domains

来源出版物 : CHINESE JOURNAL OF ELECTRONICS, 17 (3): 389-395 JUL 2008

语言 : English


作者关键词 : secure interoperation; multi-domain; policy evolution; role-based access control

(RBAC)

摘要 : Many works have addressed secure interoperation in multi-domain environments in a centralized way. In these works, there is a global policy integrated or composed by a mediator for mediation of inter-domain resource access. During policy evolution, the global secure policy is recomposed or reintegrated, which is not appropriate for the dynamic environments where policy evolutes frequently. We present a scheme for policy evolution in centralized secure interoperation.

In our scheme, policy evolution is gradual; that is, the global policy changes partly and therefore need not be reformed wholly. Besides, for inter-domain resource accesses to be totally mediated in the local domains, the part of global policy for the mediation of inter-domain access of each domain's resources is isolated and copied to the domain; we make the isolated policies updated gradually upon gradual policy evolution too. Our scheme makes centralized interoperation

appropriate for the dynamic environments.

地址 : [Feng Dengguo; Wang Xingang; Xu Zhen] Chinese Acad Sci, State Key Lab Informat Secur,


通讯作者地址 : Feng, DG, Chinese Acad Sci, State Key Lab Informat Secur, Inst Software,


电子邮箱地址 : feng@is.iscas.ac.cn; wangxg@is.iscas.ac.cn; xu@is.iscas.ac.cn


被引频次 : 0

出版商 : TECHNOLOGY EXCHANGE LIMITED HONG KONG

出版商地址 : 26-28 AU PUI WAN ST, STE 1102, FO TAN INDUSTRIAL CENTRE, FO TAN,

SHATIN, 00000, PEOPLES R CHINA

ISSN: 1022-4653

29 字符的来源出版物名称缩写 : CHINESE J ELECTRON

ISO 来源文献出版物名称缩写 : Chin. J. Electron.


学科类别 : Engineering, Electrical & Electronic

ISI 文献传递号 : 340ZR

--------------------------------------------------------------------------------

显示 23 条，共 51 条

作者 : Yin, WP (Yin, Weiping); Yin, XL (Yin, Xiaolan)

标题 : On the solution of Dirichlet's problem of the complex Monge-Ampere equation for the

Cartan-Hartogs domain of the first type

来源出版物 : NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 69 (7):

2077-2085 OCT 1 2008

语言 : English


作者关键词 : complex Monge-Ampere equation; Dirichlet's problem; Cartan-Hartogs domain;

Kaehler-Einstein metric

摘要 : The complex Monge-Ampere equation is a nonlinear equation with high degree; therefore getting its solution is very difficult. In the present paper how to get the solution of Dirichlet's problem of the complex Monge-Ampere equation on the Cartan-Hartogs domain of the first type is discussed, using an analytic method. Firstly, the complex Monge-Ampere equation is reduced to a nonlinear ordinary differential equation, then the solution of Dirichlet's problem of the complex

Monge-Ampere equation is reduced to the solution of a two-point boundary value problem for a nonlinear second-order ordinary differential equation. Secondly, the solution of Dirichlet's problem is given as a semi-explicit formula, and in a special case the exact solution is obtained.

These results may be helpful for a numerical method approach to Dirichlet's problem of the complex Monge-Ampere equation on the Cartan-Hartogs domain of the first type. (C) 2007

Elsevier Ltd. All rights reserved.

地址 : [Yin, Xiaolan] Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing

100080, Peoples R China; [Yin, Weiping] Capital Normal Univ, Sch Math Sci, Beijing 100037,

Peoples R China; [Yin, Xiaolan] Chinese Acad Sci, Grad Univ, Beijing 100049, Peoples R China

通讯作者地址 : Yin, XL, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing


电子邮箱地址 : wpyin@263.net; wyin@mail.cnu.edu.cn


被引频次 : 1



ENGLAND

ISSN: 0362-546X

DOI: 10.1016/j.na.2007.07.046

29 字符的来源出版物名称缩写 : NONLINEAR ANAL-THEOR METH APP

ISO 来源文献出版物名称缩写 : Nonlinear Anal.-Theory Methods Appl.



ISI 文献传递号 : 336JE

--------------------------------------------------------------------------------

显示 24 条，共 51 条

作者 : Lin, XJ (Lin, X. -J.); Wu, CK (Wu, C. -K); Liu, F (Liu, F.)

标题 : Analysis of an authenticated identity-based multicast scheme

来源出版物 : IET COMMUNICATIONS, 2 (7): 935-937 AUG 2008

语言 : English


摘要 : In IEE Proceedings Communications, 2005, 152, (6), an efficient authenticated identity-based multicast scheme from bilinear pairing was proposed. Wang proved that the scheme is secure against the adversary who can forge a ciphertext, but it is shown that their scheme is not secure against an inside forger.

地址 : [Lin, X. -J.; Wu, C. -K; Liu, F.] Chinese Acad Sci, Inst Software, State Key Lab Informat

Secur, Beijing 100080, Peoples R China; [Lin, X. -J.; Liu, F.] Chinese Acad Sci, Grad Sch, Beijing


通讯作者地址 : Lin, XJ, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing


电子邮箱地址 : linxj77@is.iscas.ac.cn


被引频次 : 0



SG1 2AY, ENGLAND

ISSN: 1751-8628

DOI: 10.1049/iet-com:20070449

29 字符的来源出版物名称缩写 : IET COMMUN

ISO 来源文献出版物名称缩写 : IET Commun.



ISI 文献传递号 : 331VD

--------------------------------------------------------------------------------

显示 25 条，共 51 条

作者 : Wang, XY (Wang, Xiang-Yang); Yang, HY (Yang, Hong-Ying); Cui, CY (Cui, Chang-Ying)

标题 : An SVM-based robust digital image watermarking against desynchronization attacks

来源出版物 : SIGNAL PROCESSING, 88 (9): 2193-2205 SEP 2008

语言 : English


作者关键词 : image watermarking; desynchronization attacks; SVM; sum; variance

KeyWords Plus: SCHEME

摘要 : In image watermarking area, the robustness against desynchronization attacks, such as rotation, translation, scaling, row or column removal, cropping, and local random bend, is still one of the most challenging issues. This paper presents a support vector machine (SVM)-based digital image-watermarking scheme, which is robust against a variety of common image-processing attacks and desynchronization attacks. To protect the copyright of a digital image, a signature (a watermark), which is represented by a binary image, is embedded in the digital image. The watermark embedding and watermark extraction issues can be treated as a classification problem involving binary classes. Firstly, a set of training patterns is constructed by employing two image features, which are the sum and variance of some adjacent pixels. This set of training patterns is gathered from a pair of images, an original image and its corresponding watermarked image in the spatial domain. Secondly, a quasi-optimal hyperplane (a binary classifier) can be realized by an

SVM, and the SVM can be trained by utilizing the set of training patterns. Finally, the trained

SVM is applied to classify a set of testing patterns. Following the results produced by the classifier (the trained SVM), the digital watermark can be embedded and retrieved. Experimental results show that the proposed scheme is invisible and robust against common signals processing such as median filtering, sharpening, noise adding, and JPEG compression, etc., and robust against desynchronization attacks such as rotation, translation, scaling, row or column removal, cropping, and local random bend, etc. (c) 2008 Elsevier B.V. All rights reserved.

地址 : [Wang, Xiang-Yang; Yang, Hong-Ying; Cui, Chang-Ying] Liaoning Normal Univ, Sch

Comp & Informat Technol, Dalian 116029, Peoples R China; [Wang, Xiang-Yang] Chinese Acad

Sci, State Key Lab Informat Secur, Inst Software, Beijing 100039, Peoples R China

通讯作者地址 : Wang, XY, Liaoning Normal Univ, Sch Comp & Informat Technol, Dalian 116029,

Peoples R China.

电子邮箱地址 : wxy37@126.com


被引频次 : 2



ISSN: 0165-1684

DOI: 10.1016/j.sigpro.2008.03.005

29 字符的来源出版物名称缩写 : SIGNAL PROCESS

ISO 来源文献出版物名称缩写 : Signal Process.



ISI 文献传递号 : 325UZ

--------------------------------------------------------------------------------

显示 26 条，共 51 条

作者 : Yan, J (Yan, Jun); Zhang, J (Zhang, Jian)

标题 : An efficient method to generate feasible paths for basis path testing

来源出版物 : INFORMATION PROCESSING LETTERS, 107 (3-4): 87-92 JUL 31 2008

语言 : English


作者关键词 : software engineering; basis path testing; path feasibility; test data generation

摘要 : Basis path testing is a very powerful structural testing criterion. The number of test paths equals to the cyclomatic complexity of program defined by McCabe. Traditional test generation methods select the paths either without consideration of the constraints of variables or interactively. In this note, an efficient method is presented to generate a set of feasible basis paths.

The experiments show that this method can generate feasible basis paths for real-world C programs automatically in acceptable time. (C) 2008 Elsevier B.V. All rights reserved.

地址 : [Yan, Jun; Zhang, Jian] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing


通讯作者地址 : Zhang, J, 4 S 4th St,POB 8718, Beijing 100190, Peoples R China.

电子邮箱地址 : yanjun@ios.ac.cn; zj@ios.ac.cn


被引频次 : 1



ISSN: 0020-0190

DOI: 10.1016/j.ipl.2008.01.007





ISI 文献传递号 : 324PU

--------------------------------------------------------------------------------

显示 27 条，共 51 条

作者 : Sheng, B (Sheng, Bin); Wu, EH (Wu, Enhua); Sun, HQ (Sun, Hanqiu)

标题 : Sketching freeform meshes using graph rotation functions

来源出版物 : VISUAL COMPUTER, 24 (7-9): 745-752 JUL 2008

语言 : English


会议标题 : 26th International Conference on Computer Graphics

会议日期 : JUN 09-11, 2008

会议地点 : Istanbul, TURKEY

作者关键词 : freeform surfaces; subdivision; Laplace's equation

KeyWords Plus: DIFFUSION OPERATOR

摘要 : We present a new approach for sketching free form meshes with topology consistency.

Firstly, we interpret the given 2D curve to be the projection of the 3D curve with the minimum curvature. Then we adopt a topology-consistent strategy based on the graph rotation system, to trace the simple faces on the interconnecting 3D curves. With the face tracing algorithm, our system can identify the 3D surfaces automatically. After obtaining the boundary curves for the faces, we apply Delaunay triangulation on these faces. Finally, the shape of the triangle mesh that follows the 3D boundary curves is computed by using harmonic interpolation. Meanwhile our system provides real-time algorithms for both control curve generation and the subsequent surface optimization. With the incorporation of topological manipulation into geometrical modeling, we show that automatically generated models are both beneficial and feasible.

地址 : [Sheng, Bin] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Shatin, Hong Kong,

Peoples R China; [Wu, Enhua] Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China;

[Wu, Enhua] Univ Macau, Taipa, Peoples R China

通讯作者地址 : Sheng, B, Chinese Univ Hong Kong, Dept Comp Sci & Engn, Shatin, Hong Kong,

Peoples R China.

电子邮箱地址 : bsheng@cse.cuhk.edu.hk


被引频次 : 0


出版商地址 : 233 SPRING ST, NEW YORK, NY 10013 USA

ISSN: 0178-2789

DOI: 10.1007/s00371-008-0256-6

29 字符的来源出版物名称缩写 : VISUAL COMPUT

ISO 来源文献出版物名称缩写 : Visual Comput.



ISI 文献传递号 : 322OI

--------------------------------------------------------------------------------

显示 28 条，共 51 条

作者 : Yang, G (Yang, Gang); Sun, HQ (Sun, Hanqiu); Wu, EH (Wu, Enhua); Wang, LF (Wang,

Lifeng)

标题 : Interactive fur shaping and rendering using nonuniform-layered textures

来源出版物 : IEEE COMPUTER GRAPHICS AND APPLICATIONS, 28 (4): 85-93 JUL-AUG

2008

语言 : English


摘要 : This system represents surfaces as nonuniform layers of texture slices, automatically adjusting the layers to achieve efficient, high-quality rendering. It employs layered shadow maps to simulate self- shadowing. Interactive tools let users intuitively create and edit furry objects and instantly view the rendered objects.

地址 : [Yang, Gang] Beijing Forestry Univ, Sch Informat Sci & Technol, Beijing, Peoples R China;

[Sun, Hanqiu] Chinese Univ Hong Kong, Hong Kong, Hong Kong, Peoples R China; [Wu, Enhua]

Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China; [Wu, Enhua] Univ Macau,

Taipa, Peoples R China; [Wang, Lifeng] Autodesk Shanghai, Shanghai, Peoples R China

通讯作者地址 : Yang, G, Beijing Forestry Univ, Sch Informat Sci & Technol, Beijing, Peoples R

China.

电子邮箱地址 : yanggang@bjfu.edu.cn; hanqiu@cse.cuhk.edu.hk; ehwu@umac.mo; lifeng.wang@autodesk.com


被引频次 : 1

出版商 : IEEE COMPUTER SOC

出版商地址 : 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA

90720-1314 USA

ISSN: 0272-1716

29 字符的来源出版物名称缩写 : IEEE COMPUT GRAPH APPL

ISO 来源文献出版物名称缩写 : IEEE Comput. Graph. Appl.



ISI 文献传递号 : 321DO

--------------------------------------------------------------------------------

显示 29 条，共 51 条

作者 : Cooper, SB (Cooper, S. Barry); Li, AS (Li, Angsheng)

标题 : On Lachlan's major sub-degree problem

来源出版物 : ARCHIVE FOR MATHEMATICAL LOGIC, 47 (4): 341-434 AUG 2008

语言 : English


作者关键词 : computably enumerable set; Turing degree; Major sub-degree problem

KeyWords Plus: RECURSIVELY ENUMERABLE DEGREES; MINIMAL PAIRS; SETS

摘要 : The Major Sub-degree Problem of A. H. Lachlan (first posed in 1967) has become a long-standing open question concerning the structure of the computably enumerable (c.e.) degrees.

Its solution has important implications for Turing definability and for the ongoing programme of fully characterising the theory of the c.e. Turing degrees. A c.e. degree a is a major subdegree of a c.e. degree b > a if for any c.e. degree x, 0' = b v x if and only if 0' = a v x. In this paper, we show that every c.e. degree b not equal 0 or 0' has a major sub-degree, answering Lachlan's question affirmatively.

地址 : [Li, Angsheng] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100190,

Peoples R China; [Cooper, S. Barry] Univ Leeds, Dept Pure Math, Leeds LS2 9JT, W Yorkshire,

England

通讯作者地址 : Li, AS, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, POB 8718,


电子邮箱地址 : angsheng@ios.ac.cn


被引频次 : 1



ISSN: 1432-0665

DOI: 10.1007/s00153-008-0083-5

29 字符的来源出版物名称缩写 : ARCH MATH LOGIC

ISO 来源文献出版物名称缩写 : Arch. Math. Log.


学科类别 : Mathematics

ISI 文献传递号 : 322SG

--------------------------------------------------------------------------------

显示 30 条，共 51 条

作者 : Liu, YG (Liu, Yongguo); Pu, XR (Pu, Xiaorong); Yi, Z (Yi, Zhang); Liao, XF (Liao,

Xiaofeng); Chen, KF (Chen, Kefei)

标题 : Using noising method for clustering analysis

来源出版物 : INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION

AND CONTROL, 4 (6): 1465-1476 JUN 2008

语言 : English


作者关键词 : clustering; noising method; metaheuristics

KeyWords Plus: MULTIMINIMA FUNCTIONS; GLOBAL OPTIMIZATION; TABU SEARCH;

ALGORITHMS; STRATEGIES

摘要 : In this article, the clustering problem under the criterion of minimum sum of squares clustering is considered. This problem is a nonconvex program which possesses many local optima. Its solution often falls into these traps. In this paper, we propose a new noising method based clustering algorithm called Improved Noising Method based Clustering (INMC). In the

INMC algorithm, local iteration methods are integrated to improve the solution obtained during the iteration process. In addition, a mergence and partition mode is designed to establish the neighboring solution. Experimental results on artificial and real-life data sets are given to illustrate the superiority of the INMC algorithm over some known clustering methods.

地址 : [Liu, Yongguo; Pu, Xiaorong; Yi, Zhang] Univ Elect Sci & Technol China, Sch Engn &

Comp Sci, Chengdu 610054, Peoples R China; [Liu, Yongguo] Chinese Acad Sci, State Key Lab

Comp Sci, Inst Software, Beijing 100080, Peoples R China; [Liao, Xiaofeng] Chongqing Univ,

Dept Comp Sci & Engn, Chongqing 400044, Peoples R China; [Chen, Kefei] Shanghai Jiao Tong

Univ, Dept Comp Sci & Engn, Shanghai 200030, Peoples R China

通讯作者地址 : Liu, YG, Univ Elect Sci & Technol China, Sch Engn & Comp Sci, Chengdu


电子邮箱地址 : liuyg@uestc.edu.cn


被引频次 : 1

出版商 : ICIC INT

出版商地址 : KYUSHU TOKAI UNIV, 9-1-1, TOROKU, KUMAMOTO, 862-8652, JAPAN

ISSN: 1349-4198

29 字符的来源出版物名称缩写 : INT J INNOV COMPUT INF CONTRO

ISO 来源文献出版物名称缩写 : Int. J. Innov. Comp. Inf. Control


学科类别 : Automation & Control Systems; Computer Science, Artificial Intelligence

ISI 文献传递号 : 312ZH

--------------------------------------------------------------------------------

显示 31 条，共 51 条

作者 : Yin, XL (Yin, Xiaolan); Ding, ZM (Ding, Zhiming); Li, J (Li, Jing)

标题 : A shortest path algorithm for moving objects in spatial network databases

来源出版物 : PROGRESS IN NATURAL SCIENCE, 18 (7): 893-899 JUL 10 2008

语言 : English


作者关键词 : moving object; Spatial Network Databases; shortest path index; shortest path

KeyWords Plus: BUCKETS

摘要 : One of the most important kinds of queries in Spatial Network Databases (SNDB) to support location-based services (LBS) is the shortest path query. Given an object in a network, e. g. a location of a car on a road network, and a set of objects of interests, e. g. hotels, gas station, and car, the shortest path query returns the shortest path from the query object to interested objects.

The studies of shortest path query have two kinds of ways, online processing and preprocessing.

The studies of preprocessing suppose that the interest objects are static. This paper proposes a shortest path algorithm with a set of index structures to support the situation of moving objects.

This algorithm can transform a dynamic problem to a static problem. In this paper we focus on road networks. However, our algorithms do not use any domain specific information, and therefore can be applied to any network. This algorithm's complexity is O(klog(2)i), and traditional Dijkstra's complexity is O((i + k)(2)). (c) 2008 National Natural Science Foundation of

China and Chinese Academy of Sciences. Published by Elsevier Limited and Science in China

Press. All rights reserved.

地址 : [Yin, Xiaolan; Li, Jing] Chinese Acad Sci, Inst Software, Technol Ctr Software Engn,

Beijing 100080, Peoples R China; [Yin, Xiaolan] Chinese Acad Sci, Grad Univ, Beijing 100049,

Peoples R China; [Ding, Zhiming] Chinese Acad Sci, Inst Software, Technol Ctr Basic Software,


通讯作者地址 : Yin, XL, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, POB 8718,


电子邮箱地址 : xlyin@otcaix.iscas.ac.cn


被引频次 : 0

出版商 : ELSEVIER SCIENCE INC

出版商地址 : 360 PARK AVE SOUTH, NEW YORK, NY 10010-1710 USA

ISSN: 1002-0071

DOI: 10.1016/j.pnsc.2008.01.031

29 字符的来源出版物名称缩写 : PROG NAT SCI

ISO 来源文献出版物名称缩写 : Prog. Nat. Sci.


学科类别 : Multidisciplinary Sciences

ISI 文献传递号 : 306YN

--------------------------------------------------------------------------------

显示 32 条，共 51 条

作者 : Li, YJ (Li, Yongjian); Xue, R (Xue, Rui)

标题 : Design of a CIL connector to Spin

来源出版物 : INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND

KNOWLEDGE ENGINEERING, 18 (1): 65-91 FEB 2008

语言 : English


作者关键词 : model checking; cryptographic protocols; CAPSL; CIL; spin

摘要 : The CAPSL Integrated Protocol Environment effort aims at providing an intuitive and expressive language for specifying cryptographic authentication and key distribution protocols and supporting interfaces to various analysis tools. The CAPSL Intermediate Language (CIL) has been designed with the emphasis on simplifying translators from CIL to other analysis tools. In this paper we describe the design of a CIL-to-Spin connector. We describe how CIL concepts are translated into Spin and propose a general method to model the behaviors of honest principals and the intruder. Based on the method, a prototype connector has been implemented in Gentle, which automatically translates CIL specifications to Promela codes and LTL formulae, thus greatly simplifying the modeling and analysis process.

地址 : [Li, Yongjian] Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R

China; [Li, Yongjian; Xue, Rui] State Key Lab Informat Secur, Beijing 100080, Peoples R China

通讯作者地址 : Li, YJ, Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples

R China.

电子邮箱地址 : lyj238@ios.ac.cn


被引频次 : 0



ISSN: 0218-1940

29 字符的来源出版物名称缩写 : INT J SOFTW ENG KNOWL

ISO 来源文献出版物名称缩写 : Int. J. Softw. Eng. Knowl. Eng.


学科类别 : Computer Science, Artificial Intelligence; Computer Science, Software Engineering;

Engineering, Electrical & Electronic

ISI 文献传递号 : 290YP

--------------------------------------------------------------------------------

显示 33 条，共 51 条

作者 : Lu, M (Lu, M.); Zhang, JF (Zhang, J. F.); Lv, P (Lv, P.); Fan, ZH (Fan, Z. H.)

标题 : Least visible path analysis in raster terrain

来源出版物 : INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE,

22 (6): 645-656 2008

语言 : English


作者关键词 : reverse viewshed; amalgamation; visibility index; cumulative visibility; visibility surface

KeyWords Plus: VIEWSHED ANALYSIS; COST PATHS

摘要 : Least visible path analysis is a basic function in terrain visibility analysis. However, current least visible path planning is constrained to least-cost path computing on a cost surface obtained from visibility information of all the terrain points on digital elevation models. This kind of method ignores the visibility correlation caused by the overlapped part of the adjacent points' reverse viewsheds. With regard to such a correlation, this paper proposes a new method using the amalgamation of reverse viewsheds to find an optimal path with the minimal visibility dominance.

Both methods are implemented using C++ programming, and the experimental results show that the new method produces more accurate least visible paths than the traditional one does.

地址 : [Lu, M.; Zhang, J. F.; Lv, P.; Fan, Z. H.] Chinese Acad Sci, Natl Key Lab Integrated

Informat Syst Technol, Inst Software, Beijing 100080, Peoples R China

通讯作者地址 : Lu, M, Chinese Acad Sci, Natl Key Lab Integrated Informat Syst Technol, Inst

Software, Beijing 100080, Peoples R China.

电子邮箱地址 : lumin03@ios.cn


被引频次 : 0

出版商 : TAYLOR & FRANCIS LTD

出版商地址 : 4 PARK SQUARE, MILTON PARK, ABINGDON OX14 4RN, OXON, ENGLAND

ISSN: 1365-8816

DOI: 10.1080/13658810701602062

29 字符的来源出版物名称缩写 : INT J GEOGR INF SCI

ISO 来源文献出版物名称缩写 : Int. J. Geogr. Inf. Sci.


学科类别 : Computer Science, Information Systems; Geography; Geography, Physical;

Information Science & Library Science

ISI 文献传递号 : 292NB

--------------------------------------------------------------------------------

显示 34 条，共 51 条

作者 : Yuyue, D (Yuyue, Du); Changjun, J (Changjun, Jiang)

标题 : A formal approach for obligation analysis of E-commerce

来源出版物 : CHINESE JOURNAL OF ELECTRONICS, 17 (2): 200-204 APR 2008

语言 : English


作者关键词 : E-commerce system; labeled Petri net; formal modeling; verification; obligation analysis

KeyWords Plus: STOCK TRADING SYSTEMS; WORKFLOWS

摘要 : Existing methods for modeling E-commerce systems (ECSs) focus mostly on either mathematically abstract verification or graphical modeling, and cannot explicitly describe and analyze the obligations of partners. This work presents a new class of Labeled Petri nets for the modeling and analysis of ECSs. And the life cycle of a case and the time/date of firing an action are considered. It can model graphically the dynamic behavior of the systems, and analyze elegantly the obligations. This approach is illustrated with a nontrivial example of the modeling and analysis of the trading process of the Purchase transaction in the Internet open trading

protocol.

地址 : [Yuyue, Du] Shandong Univ Sci & Technol, Coll Informat Sci & Engn, Qingdao 266510,

Peoples R China; [Changjun, Jiang] Tongji Univ, Dept Comp Sci & Engn, Shanghai 200092,

Peoples R China; [Yuyue, Du] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing


通讯作者地址 : Yuyue, D, Shandong Univ Sci & Technol, Coll Informat Sci & Engn, Qingdao



被引频次 : 0




ISSN: 1022-4653





ISI 文献传递号 : 290DJ

--------------------------------------------------------------------------------

显示 35 条，共 51 条

作者 : Lei, H (Lei, Huang); Lixiang, L (Lixiang, Liu)

标题 : Mitigating selfishness in route discovery of on-demand routing in ad hoc networks

来源出版物 : CHINESE JOURNAL OF ELECTRONICS, 17 (2): 210-214 APR 2008

语言 : English


作者关键词 : ad hoc network; route discovery; cooperation stimulation; game theory

摘要 : In civil ad hoc networks, rational selfish nodes tend to save energy by dropping packets from and to other nodes. Incentive mechanisms proposed so far focus mainly on data forwarding stage and are not suitable to cope with selfish Route request packet (RREQ) dropping in route discovery stage of on demand routing. Based on the statistics relationship of relayed RREQ between two neighboring nodes, a distributed selfish dropping detection and punishment mechanism is proposed. Relation between key parameter setting and algorithm's effectiveness and performance is analyzed with tool of game theory. Simulation results show that the algorithm can detect and punish the selfish nodes effectively.

地址 : [Lei, Huang; Lixiang, Liu] Chinese Acad Sci, Natl Key Lab Integrated Informat Syst

Technol, Inst Software, Beijing 100080, Peoples R China

通讯作者地址 : Lei, H, Chinese Acad Sci, Natl Key Lab Integrated Informat Syst Technol, Inst

Software, Beijing 100080, Peoples R China.


被引频次 : 0




ISSN: 1022-4653





ISI 文献传递号 : 290DJ

--------------------------------------------------------------------------------

显示 36 条，共 51 条

作者 : Lin, XJ (Lin, Xi-Jun); Wu, CK (Wu, Chuan-Kun); Liu, F (Liu, Feng)

标题 : Many-to-one encryption and authentication scheme and its application

来源出版物 : JOURNAL OF COMMUNICATIONS AND NETWORKS, 10 (1): 18-27 MAR

2008

语言 : English


作者关键词 : authentication; dynamic accumulator; encryption; group-oriented cryptography; identity; many-to-one; pairing

KeyWords Plus: SIGNATURE SCHEME; CRYPTOGRAPHY; REVOCATION

摘要 : This paper is to study a subclass of group-oriented cryptographic scheme: Many-to-one encryption and authentication scheme. The many-to-one encryption and authentication scheme is to solve a practical problem, i.e., the scenario that the number of the receivers is very small compared with the number of the senders and a receiver may serve millions of senders. Compared with the traditional methods, the burdens of the receiver and the KG,C are reduced greatly. How to revoke a sender from his receiver's legitimate sender group is also proposed and it is efficient compared with some traditional methods. The proposed scheme is proven in the random oracle models. The computational complexity of our scheme is independent of the number of the senders.

At the end of the paper, an example is given to show how to use our scheme in online software registration and update.

地址 : [Lin, Xi-Jun; Wu, Chuan-Kun; Liu, Feng] Chinese Acad Sci, Inst Software, State Key Lab

Informat Secur, Beijing, Peoples R China; [Lin, Xi-Jun; Liu, Feng] Chinese Acad Sci, Grad Sch,

Beijing, Peoples R China

通讯作者地址 : Lin, XJ, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing,

Peoples R China.

电子邮箱地址 : linxj77@is.iscas.ac.cn; ckwu@is.iscas.ac.cn; li-uferg@is.iscas.ac.cn


被引频次 : 0

出版商 : KOREAN INST COMMUNICATIONS SCIENCES (K I C S)

出版商地址 : HYUNDAI KIRIM OFFICETEL 1504-6 SEOCHODONG 1330-18, SEOCHOKU,

SEOUL 137-070, SOUTH KOREA

ISSN: 1229-2370

29 字符的来源出版物名称缩写 : J COMMUN NETW

ISO 来源文献出版物名称缩写 : J. Commun. Netw.


学科类别 : Computer Science, Information Systems; Telecommunications

ISI 文献传递号 : 285WB

--------------------------------------------------------------------------------

显示 37 条，共 51 条

作者 : Qiao, Y (Qiao, Y.); Fallon, E (Fallon, E.); Murphy, J (Murphy, J.); Murphy, L (Murphy, L.);

Zhu, X (Zhu, X.); Hayes, G (Hayes, G.); Matthews, A (Matthews, A.); Hanley, A (Hanley, A.)

标题 : Performance analysis of multi-homed transport protocols with network failure tolerance

来源出版物 : IET COMMUNICATIONS, 2 (2): 336-345 FEB 2008

语言 : English


摘要 : The performance of multi-homed transport protocols tolerant of network failure is studied.

It evaluates the performance of different retransmission policies combined with path failure detection thresholds, infinite or finite receive buffers for various path bandwidths, delays and loss rate conditions through stream control transmission protocol simulation. The results show that retransmission policies perform differently with different path failure detection threshold configurations. It identifies that retransmission of all data on an alternate path with the path failure detection threshold set to zero performs the best in symmetric path conditions but its performance degrades acutely in asymmetric path conditions even when the alternate path delay is shorter than the primary path delay. It illustrates that retransmission of all data on the same path with the path failure detection threshold set to one or zero gives the most stable performance in all path configurations.

地址 : [Murphy, J.; Murphy, L.] Univ Coll Dublin, Performance Engn Lab, Dublin 2, Ireland;

[Qiao, Y.] Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China; [Qiao, Y.] Chinese

Acad Sci, Grad Univ, Beijing 100864, Peoples R China

电子邮箱地址 : ysqiao@ait.ie


被引频次 : 0



SG1 2AY, ENGLAND

ISSN: 1751-8628

DOI: 10.1049/iet-com:20070113

29 字符的来源出版物名称缩写 : IET COMMUN

ISO 来源文献出版物名称缩写 : IET Commun.



ISI 文献传递号 : 284CU

--------------------------------------------------------------------------------

显示 38 条，共 51 条

作者 : Sun, LM (Sun Limin); Zhu, HS (Zhu Hongsong); Li, XW (Li Xiaowei); Duan, B (Duan

Bin); Sun, Y (Sun Yi)

标题 : Analysis of forwarding mechanisms on Fine-grain Gradient Sinking model in WSN

来源出版物 : JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND

VIDEO TECHNOLOGY, 51 (2): 145-159 MAY 2008

语言 : English


作者关键词 : wireless sensor network; fine-grain gradient sinking model; forwarding strategy; communication efficiency

摘要 : The communication efficiency of large-scale WSNs with high node density is highly related with specific forwarding strategy in complicated wireless environments. Thus, it is the key problem that how to use the characteristic of high-density to select appropriate forwarding nodes to relieve the load imbalance and improve the communication efficiency. In this paper, we first propose a Fine-grain Gradient Sinking (FGS) model and several data forwarding strategies based on this model. Then we give the criteria of communication efficiency and emphatically analyze the communication efficiency of various forwarding strategies. Simulation results show that forwarding strategies under FGS model can achieve higher communication efficiency, and the efficiency can be further elevated by introducing the statistics of packet receive rate during the forwarding process.

地址 : [Sun Limin] Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; [Zhu

Hongsong; Li Xiaowei] Chinese Acad Sci, Inst Comp Technol, Beijing 100080, Peoples R China;

[Zhu Hongsong; Duan Bin; Sun Yi] Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R

China

通讯作者地址 : Sun, LM, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.


被引频次 : 0



ISSN: 1939-8018

DOI: 10.1007/s11265-007-0103-4

29 字符的来源出版物名称缩写 : J SIGNAL PROCESS SYST SIGNAL

ISO 来源文献出版物名称缩写 : J. Signal Process. Syst. Signal Image Video Technol.


学科类别 : Computer Science, Information Systems; Engineering, Electrical & Electronic

ISI 文献传递号 : 275ZO

--------------------------------------------------------------------------------

显示 39 条，共 51 条

作者 : Zhong, S (Zhong, Sheng); Xue, R (Xue, Rui)

标题 : Special section on data processing and security - Preface


MAR 2008

语言 : English

文献类型 : Editorial Material

地址 : [Zhong, Sheng] SUNY Buffalo, Buffalo, NY 14260 USA; [Xue, Rui] Chinese Acad Sci,


通讯作者地址 : Zhong, S, SUNY Buffalo, Buffalo, NY 14260 USA.


被引频次 : 0



CHINA

ISSN: 1000-9000





Engineering

ISI 文献传递号 : 275CR

--------------------------------------------------------------------------------

显示 40 条，共 51 条

作者 : Xue, R (Xue, Rui); Li, NH (Li, Ning-Hui); Li, JT (Li, Jiang-Tao)

标题 : Algebraic construction for zero-knowledge sets


MAR 2008

语言 : English


会议标题 : 1st International Symposium on Data, Privacy and E-Commerce

会议日期 : AUG, 2007

会议地点 : Chengdu, PEOPLES R CHINA

会议赞助商 : IEEE.

作者关键词 : zero knowledge set; Merkle tree; accumulator strong RSA assumption; random oracle

KeyWords Plus: ACCUMULATORS

摘要 : Zero knowledge sets is a new cryptographic primitive introduced by Micali, Rabin, and

Kilian in FOCS 2003. It has been intensively studied recently. However all the existing ZKS schemes follow the basic structure by Micali et al. That is, the schemes employ the Merkle tree as a basic structure and mercurial commitments as the commitment units to nodes of the tree. The proof for any query consists of an authentication chain. We propose in this paper a new algebraic scheme that is completely different from all the existing schemes. Our new scheme is computationally secure under the standard strong RSA assumption. Neither mercurial commitments nor tree structure is used in the new construction. In fact, the prover in our construction commits the desired set without any trapdoor information, which is another key important difference from the previous approaches.

地址 : [Xue, Rui] Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080,

Peoples R China; [Li, Ning-Hui] Purdue Univ, Dept Comp Sci, W Lafayette, IN 47907 USA; [Li,

Jiang-Tao] Intel Corp, Software & Solut Grp, Hillsboro, OR 97124 USA

通讯作者地址 : Xue, R, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing


电子邮箱地址 : rxue@is.iscas.ac.cn; ninghui@cs.purdue.edu; jiangtao.li@intel.com


被引频次 : 0



CHINA

ISSN: 1000-9000





Engineering


--------------------------------------------------------------------------------

显示 41 条，共 51 条

作者 : Liu, SL (Liu, Sheng-Li); Chen, XF (Chen, Xiao-Feng); Zhang, FG (Zhang, Fang-Guo)

标题 : Forgeability of Wang-Tang-Li's ID-based restrictive partially blind signature scheme


MAR 2008

语言 : English


作者关键词 : unforgeability; restrictive partially blind signature; ID-based cryptography; electronic cash

KeyWords Plus: ELECTRONIC CASH; CRYPTANALYSIS

摘要 : Restrictive partially blind signature (RPBS) plays an important role in designing secure electronic cash system. Very recently, Wang, Tang and Li proposed a new ID-based restrictive partially blind signature (ID-RPBS) and gave the security proof. In this paper, we present a cryptanalysis of the scheme and show that the signature scheme does not satisfy the property of unforgeability as claimed. More precisely, a user can forge a valid message-signature pair (ID, msg, info', sigma') instead of the original one (ID, msg, info, a), where info is the original common agreed information and info' not equal info. Therefore, it will be much dangerous if

Wang-Tang-Li's ID-RPBS scheme is applied to the off-line electronic cash system. For example, a bank is supposed to issue an electronic coin (or bill) of $100 to a user, while the user can change the denomination of the coin (bill) to any value, say $100 000 000, at his will.

地址 : [Liu, Sheng-Li] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai 200240,

Peoples R China; [Chen, Xiao-Feng] Sun Yat Sen Univ, Sch Informat Sci & Technol, Dept Comp

Sci, Guangzhou 510275, Peoples R China; [Zhang, Fang-Guo] Sun Yat Sen Univ, Sch Informat

Sci & Technol, Dept Elect & Commun Engn, Guangzhou 510275, Peoples R China; [Liu,

Sheng-Li] Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080,

Peoples R China

通讯作者地址 : Liu, SL, Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai 200240,

Peoples R China.

电子邮箱地址 : liu-sl@sjtu.edu.cn; isschxf@mail.sysu.edu.cn; isszhfg@mail.sysu.edu.cn


被引频次 : 0



CHINA

ISSN: 1000-9000





Engineering


--------------------------------------------------------------------------------

显示 42 条，共 51 条

作者 : Wan, SC (Wan Shuchao); Song, JY (Song Jingyu); Zhong, H (Zhong Hua); Li, J (Li Jing)

标题 : A selection model for interactive web services and its implementation in portal

来源出版物 : CHINESE JOURNAL OF ELECTRONICS, 17 (1): 115-122 JAN 2008

语言 : English


作者关键词 : interactive web services; description model; selection model; portal

摘要 : Traditional web services are function oriented, where various developed standards mainly assist business applications to expose their functional description without presentation logics.

Although works on the Interactive web service (IWS) has made some progress, researchers are keeping on making efforts to encapsulate user interface with the functional interface to 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 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 and similarity definitions is developed, which can meet diverse selection requirements of service consumers. Finally, models are proved to be feasible and effective by some experiments and implementation.

地址 : [Wan Shuchao; Song Jingyu; Zhong Hua; Li Jing] Chinese Acad Sci, Inst Software, Technol

Ctr Software Engn, Beijing 100080, Peoples R China; [Wan Shuchao] Chinese Acad Sci, Grad

Sch, Beijing 100039, Peoples R China

通讯作者地址 : Wan, SC, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing



被引频次 : 0




ISSN: 1022-4653





ISI 文献传递号 : 274SM

--------------------------------------------------------------------------------

显示 43 条，共 51 条

作者 : Luan, SM (Luan ShangMin); Dai, GZ (Dai GuoZhong)

标题 : An algebraic approach to revising propositional rule-based knowledge bases

来源出版物 : SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 51 (3): 240-257

MAR 2008

语言 : English


作者关键词 : knowledge base revision; consistency check; rule-based knowledge base; Petri net

KeyWords Plus: BELIEF CHANGE; PROGRAMMABLE APPROACH; LOGIC

摘要 : One of the important topics in knowledge base revision is to introduce an efficient implementation algorithm. Algebraic approaches have good characteristics and implementation method; they may be a choice to solve the problem. An algebraic approach is presented to revise propositional rule-based knowledge bases in this paper. A way is firstly introduced to transform a propositional rule-based knowledge base into a Petri net. A knowledge base is represented by a

Petri net, and facts are represented by the initial marking. Thus, the consistency check of a knowledge base is equivalent to the reachability problem of Petri nets. The reachability of Petri nets can be decided by whether the state equation has a solution; hence the consistency check can also be implemented by algebraic approach. Furthermore, algorithms are introduced to revise a propositional rule-based knowledge base, as well as extended logic programming. Compared with related works, the algorithms presented in the paper are efficient, and the time complexities of these algorithms are polynomial.

地址 : [Luan ShangMin] Beijing Inst Technol, Sch Comp Sci & Technol, Beijing 100081, Peoples

R China; [Luan ShangMin; Dai GuoZhong] Chinese Acad Sci, Inst Software, Beijing 100080,

Peoples R China

通讯作者地址 : Luan, SM, Beijing Inst Technol, Sch Comp Sci & Technol, Beijing 100081,

Peoples R China.

电子邮箱地址 : shangmin@iscas.cn


被引频次 : 0



CHINA

ISSN: 1009-2757

DOI: 10.1007/s11432-008-0021-5

29 字符的来源出版物名称缩写 : SCI CHINA SER F

ISO 来源文献出版物名称缩写 : Sci. China Ser. F-Inf. Sci.



ISI 文献传递号 : 258SN

--------------------------------------------------------------------------------

显示 44 条，共 51 条

作者 : Chen, JX (Chen, Jianxin); Duan, RY (Duan, Runyao); Ji, ZF (Ji, Zhengfeng); Ying, MS

(Ying, Mingsheng); Yu, J (Yu, Jun)

标题 : Existence of universal entangler

来源出版物 : JOURNAL OF MATHEMATICAL PHYSICS, 49 (1): Art. No. 012103 JAN 2008

语言 : English


KeyWords Plus: UNEXTENDIBLE PRODUCT BASES; BOUND ENTANGLEMENT;

OPERATIONS

摘要 : A gate is called an entangler if it transforms some (pure) product states to entangled states. A universal entangler is a gate which transforms all product states to entangled states. In practice, a universal entangler is a very powerful device for generating entanglements, and thus provides important physical resources for accomplishing many tasks in quantum computing and quantum information. This paper demonstrates that a universal entangler always exists except for a degenerated case. Nevertheless, the problem how to find a universal entangler remains open. (c)

2008 American Institute of Physics.

地址 : [Chen, Jianxin; Duan, Runyao; Ying, Mingsheng] Tsing Hua Univ, Dept Comp Sci &

Technol, State Key Lab Intelligent Technol & Syst, Beijing 100084, Peoples R China; [Ji,

Zhengfeng] Chinese Acad Sci, Inst Software, Key Lab Comp Sci, Beijing 100080, Peoples R

China; [Yu, Jun] Hong Kong Univ Sci & Technol, Dept Math, Kowloon, Hong Kong, Peoples R

China

通讯作者地址 : Chen, JX, Tsing Hua Univ, Dept Comp Sci & Technol, State Key Lab Intelligent

Technol & Syst, Beijing 100084, Peoples R China.

电子邮箱地址 : chenkenshin@gmail.com; dry@tsinghua.edu.cn; jizhengfeng98@mails.thu.edu.cn; yingmsh@tsinghua.edu.cn; majunyu@ust.hk


被引频次 : 0

出版商 : AMER INST PHYSICS

出版商地址 : CIRCULATION & FULFILLMENT DIV, 2 HUNTINGTON QUADRANGLE, STE

1 N O 1, MELVILLE, NY 11747-4501 USA

ISSN: 0022-2488

文献编号 : 012103

DOI: 10.1063/1.2829895

29 字符的来源出版物名称缩写 : J MATH PHYS-NY

ISO 来源文献出版物名称缩写 : J. Math. Phys.


学科类别 : Physics, Mathematical

ISI 文献传递号 : 257TL

--------------------------------------------------------------------------------

显示 45 条，共 51 条

作者 : Hu, HG (Hu, Honggang); Feng, DG (Feng, Dengguo)

标题 : On the 2-adic complexity and the kappa-error 2-adic complexity of periodic binary sequences

来源出版物 : IEEE TRANSACTIONS ON INFORMATION THEORY, 54 (2): 874-883 FEB

2008

语言 : English


会议标题 : 3rd International Conference Sequences and Their Applications (SETA 2004)

会议日期 : OCT 24-28, 2004

会议地点 : Seoul, SOUTH KOREA

作者关键词 : 2-adic complexity; expected value; k-error 2-adic complexity; k-error symmetric

2-adic complexity; l-sequence; periodic binary sequence; symmetric 2-adic complexity; variance

KeyWords Plus: LINEAR COMPLEXITY; FCSR-SEQUENCES; SPAN; ALGORITHM

摘要 : A significant difference between the linear complexity and the 2-adic complexity of periodic binary sequences is pointed out in this correspondence. Based on this observation, we present the concept of the symmetric 2-adic complexity of periodic binary sequences. The expected value of the 2-adic complexity is determined, and a lower bound on the expected value of the symmetric

2-adic complexity of periodic binary sequences is derived. We study the variance of the 2-adic complexity of periodic binary sequences, and the exact value for it is given. Because the 2-adic complexity of periodic binary sequences is unstable, we present the concepts of the k-error 2-adic complexity and the k-error symmetric 2-adic complexity, and lower bounds on them are also derived. In particular, we give tighter upper and lower bounds for the minimum 2-adic complexity of I-sequences by substituting two symbols within one period.

地址 : [Hu, Honggang; Feng, Dengguo] Chinese Acad Sci, Inst Software, State Key Lab Informat

Secur, Beijing 100080, Peoples R China

通讯作者地址 : Hu, HG, Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1,

Canada.

电子邮箱地址 : h7hu@uwaterloo.ca


被引频次 : 2

出版商 : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC

出版商地址 : 445 HOES LANE, PISCATAWAY, NJ 08855 USA

ISSN: 0018-9448

DOI: 10.1109/TTT.2007.913238

29 字符的来源出版物名称缩写 : IEEE TRANS INFORM THEORY

ISO 来源文献出版物名称缩写 : IEEE Trans. Inf. Theory


学科类别 : Computer Science, Information Systems; Engineering, Electrical & Electronic

ISI 文献传递号 : 254TZ

--------------------------------------------------------------------------------

显示 46 条，共 51 条

作者 : Wang, MS (Wang, Mingsheng)

标题 : Remarks on n-D polynomial matrix factorization problems

来源出版物 : IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS,

55 (1): 61-64 JAN 2008

语言 : English


作者关键词 : matrix factorizations; minor primeness; multidimensional (n-D) systems; n-D polynomial matrices; polynomial ring

KeyWords Plus: PRIME FACTORIZATIONS; SYSTEMS

摘要 : Multidimensional (n-D) polynomial matrix factorizations are intimately linked to many problems of multidimensional systems and Signal processing. This paper gives a new result for a n-D polynomial matrix to have an minor prime factorization using methods from computer algebra. This result may be regarded as a generalization of a previous criterion under a special restriction [IEEE Trans. Circuits Syst. II: Exp Briefs, vol.52, no. 9 (2005)]. Examples are given to illustrate results using computer algebra software system Singular.

地址 : Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R

China

通讯作者地址 : Wang, MS, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur,


电子邮箱地址 : mingsheng_wang@yahoo.com.cn


被引频次 : 6



ISSN: 1549-7747

DOI: 10.1109/TCSII.2007.909866

29 字符的来源出版物名称缩写 : IEEE TRANS CIRCUIT SYST-II

ISO 来源文献出版物名称缩写 : IEEE Trans. Circuits Syst. II-Express Briefs



ISI 文献传递号 : 254XZ

--------------------------------------------------------------------------------

显示 47 条，共 51 条

作者 : Deng, Y (Deng Yi); Lin, DD (Lin DongDai)

标题 : Novel Omega-protocols for NP

来源出版物 : SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 51 (1): 40-52 JAN

2008

语言 : English


作者关键词 : concurrent zero knowledge; Omega-protocols; Sigma-protocols; Hamiltonian cycle

摘要 : Omega-protocols, introduced by Garay, Mackenzie and Yang, is a variant of S-protocols with online extractor which is a useful tool to overcome the nest effect in concurrent scenario. In this work, we construct an Omega-protocol for Hamiltonian cycle problem, and therefore, it allows us to present Omega-protocol for any NP relation. For most general NP relations, our construction of Omega-protocols is much more efficient than the informal one described by Garay

et al. and we believe that the method for our construction may be of independent interest.

地址 : [Deng Yi; Lin DongDai] Chinese Acad Sci, Inst Software, State Key Lab Informat Secur,

Beijing 100080, Peoples R China; [Deng Yi] Chinese Acad Sci, Grad Univ, Beijing 100049,

Peoples R China

通讯作者地址 : Deng, Y, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing


电子邮箱地址 : ydeng@is.iscas.ac.cn


被引频次 : 0



CHINA

ISSN: 1009-2757

DOI: 10.1007/s11432-008-0004-6

29 字符的来源出版物名称缩写 : SCI CHINA SER F

ISO 来源文献出版物名称缩写 : Sci. China Ser. F-Inf. Sci.



ISI 文献传递号 : 245XO

--------------------------------------------------------------------------------

显示 48 条，共 51 条

作者 : Yin, WP (Yin, Weiping); Yin, XL (Yin, Xiaolan)

标题 : A research into the numerical method of Dirichlet's problem of complex Monge-Ampere equation on Cartan-Hartogs domain of the third type

来源出版物 : JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 339 (1):

295-302 MAR 1 2008

语言 : English


作者关键词 : complex Monge-Ampere equation; Dirichlet's problem; Cartan-Hartogs domain;

Kaehler-Einstein metric

摘要 : Monge-Ampere equation is a nonlinear equation with high degree, therefore its numerical solution is very important and very difficult. In present paper the numerical method of Dirichlet's problem of Monge-Ampere equation on Cartan-Hartogs domain of the third type is discussed by using the analytic method. Firstly, the Monge-Ampere equation is reduced to the nonlinear ordinary differential equation, then the numerical method of the Dirichlet problem of

Monge-Ampere equation becomes the numerical method of two point boundary value problem of the nonlinear ordinary differential equation. Secondly, the solution of the Dirichlet problem is given in explicit formula under the special case, which can be used to check the numerical solution of the Dirichlet problem. (c) 2007 Elsevier Inc. All rights reserved.

地址 : [Yin, Xiaolan] Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing

100080, Peoples R China; [Yin, Xiaolan] Chinese Acad Sci, Grad Univ, Beijing 100049, Peoples

R China; [Yin, Weiping] Capital Normal Univ, Sch Math Sci, Beijing 100037, Peoples R China

通讯作者地址 : Yin, XL, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing


电子邮箱地址 : wyin@mail.cnu.edu.cn; wpyin@263.net


被引频次 : 1

出版商 : ACADEMIC PRESS INC ELSEVIER SCIENCE

出版商地址 : 525 B ST, STE 1900, SAN DIEGO, CA 92101-4495 USA

ISSN: 0022-247X

DOI: 10.1016/j.jmaa.2007.07.005

29 字符的来源出版物名称缩写 : J MATH ANAL APPL

ISO 来源文献出版物名称缩写 : J. Math. Anal. Appl.



ISI 文献传递号 : 247DI

--------------------------------------------------------------------------------

显示 49 条，共 51 条

作者 : Du, YY (Du, YuYue); Jiang, CJ (Jiang, ChangJun); Zhou, MC (Zhou, MengChu)

标题 : A Petri-net-based correctness analysis of Internet stock trading systems

来源出版物 : IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART

C-APPLICATIONS AND REVIEWS, 38 (1): 93-99 JAN 2008

语言 : English


作者关键词 : correctness; formal verification; Petri nets (PNs); stock trading systems; temporal logic

KeyWords Plus: DESIGN; MODEL

摘要 : This paper shows how temporal Petri nets (TPNs) can be used to specify and analyze an

Internet stock trading system. The dynamical behavior of the system and causality between events can be explicitly described by temporal formulas. The functional correctness of the modeled system is formally verified by using the inferential rules in temporal logic. Important properties of the system are analyzed based on its TPN model such as liveness, eventuality, and fairness properties. This paper demonstrates that TPNs can provide significant advantages in the design and analysis of business processes.

地址 : [Du, YuYue] Shandong Univ Sci & Technol, Coll Informat Sci & Engn, Qingdao 266510,

Peoples R China; [Du, YuYue] Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100080,

Peoples R China; [Jiang, ChangJun] Tongji Univ, Dept Comp Sci & Engn, Shanghai 200092,

Peoples R China; [Zhou, MengChu] New Jersey Inst Technol, Dept Elect Comp Engn, Newark,

NJ 07102 USA; [Zhou, MengChu] Chinese Acad Sci, Inst Automat, Lab Complex Syst &

Intelligence Sci, Beijing 100080, Peoples R China

通讯作者地址 : Du, YY, Shandong Univ Sci & Technol, Coll Informat Sci & Engn, Qingdao


电子邮箱地址 : yydu001@163.com; cjjiang@online.sh.cn; zhou@njit.edu


被引频次 : 2



ISSN: 1094-6977

DOI: 10.1109/TSMCC.2007.896995

29 字符的来源出版物名称缩写 : IEEE TRANS SYST MAN CYBERN C

ISO 来源文献出版物名称缩写 : IEEE Trans. Syst. Man Cybern. Part C-Appl. Rev.


学科类别 : Computer Science, Artificial Intelligence; Computer Science, Cybernetics; Computer

Science, Interdisciplinary Applications

ISI 文献传递号 : 244BH

--------------------------------------------------------------------------------

显示 50 条，共 51 条

作者 : Li, JA (Li Jiao)

标题 : Refining and verifying regular Petri nets

来源出版物 : INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 39 (1): 17-27 2008

语言 : English


作者关键词 : boundedness; liveness; Petri net; refinement; regularity

KeyWords Plus: REFINEMENT

摘要 : This paper considers two kinds of refinement transformations in terms of places and transitions, and proves that regularity can be preserved automatically for pure and ordinary connected nets under the two refinement transformations. By discussing the relationship between siphons of the original net and the refined net, this paper proves that liveness and boundedness can also be preserved automatically for these refined regular Petri nets. The two property-preserved refinement transformations can be used to construct large and complex net models in

Petri-net-based system design and verification. An example coming from the manufacturing system is used to illustrate main results of this paper.

地址 : Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China

通讯作者地址 : Li, JA, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing,

Peoples R China.



被引频次 : 0

出版商 : TAYLOR & FRANCIS LTD

出版商地址 : 4 PARK SQUARE, MILTON PARK, ABINGDON OX14 4RN, OXON, ENGLAND

ISSN: 0020-7721

DOI: 10.1080/00207720701621959

29 字符的来源出版物名称缩写 : INT J SYST SCI

ISO 来源文献出版物名称缩写 : Int. J. Syst. Sci.


学科类别 : Automation & Control Systems; Computer Science, Theory & Methods; Operations

Research & Management Science

ISI 文献传递号 : 239KE

--------------------------------------------------------------------------------

显示 51 条，共 51 条

作者 : Wang, W (Wang, Wencheng); Li, J (Li, Jing); Sun, H (Sun, Hanqiu); Wu, E (Wu, Enhua)

标题 : Layer-based representation of polyhedrons for point containment tests

来源出版物 : IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS,

14 (1): 73-83 JAN-FEB 2008

语言 : English


作者关键词 : computational geometry; polyhedron; point containment; solid representation

KeyWords Plus: SPATIAL CONTAINMENT; GENERAL POLYHEDRA

摘要 : This paper presents the layer-based representation of polyhedrons and its use for point-in-polyhedron tests. In the representation, the facets and edges of a polyhedron are sequentially arranged, and so, the binary search algorithm is efficiently used to speed up inclusion tests. In comparison with conventional representation for polyhedrons, the layer-based representation that we propose greatly reduces the storage requirement because it represents much information implicitly though it still has a storage complexity O(n). It is simple to implement and robust for inclusion tests because many singularities are erased in constructing the layer-based representation. By incorporating an octree structure for organizing polyhedrons, our approach can run at a speed comparable with Binary Space Partitioning ( BSP)-based inclusion tests and, at the same time, greatly reduce storage and preprocessing time in treating large polyhedrons. We have developed an efficient solution for point-in-polyhedron tests, with the time complexity varying between O(n) and O(logn), depending on the polyhedron shape and the constructed representation, and less than O(log(3)n) in most cases. The time complexity of preprocess is between O(n) and

O(n(2)), varying with polyhedrons, where n is the edge number of a polyhedron.

地址 : Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R

China; Chinese Acad Sci, Grad Univ, Beijing 100080, Peoples R China; Chinese Univ Hong Kong,

Dept Comp Sci & Engn, Shatin, Hong Kong, Peoples R China; Univ Macau, Fac S&T, Dept

Comp & Informat Sci, Macao, Peoples R China

通讯作者地址 : Wang, W, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing


电子邮箱地址 : whn@ios.ac.cn; lij@ios.ac.cn; hanqiu@cse.cuhk.edu.hk; ehwu@umac.no


被引频次 : 0

出版商 : IEEE COMPUTER SOC

出版商地址 : 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA

90720-1314 USA

ISSN: 1077-2626

DOI: 10.1109/TVCG.2007.70407

29 字符的来源出版物名称缩写 : IEEE TRANS VISUAL COMPUT GR

ISO 来源文献出版物名称缩写 : IEEE Trans. Vis. Comput. Graph.



ISI 文献传递号 : 229FD

ISI Web of Knowledge

Related documents

Products

Support

ISI Web of Knowledge

Related documents

Add this document to collection(s)

Add this document to saved

Suggest us how to improve StudyLib