1. =(((Inst Sofware) OR (Inst Software) OR (Software Inst)) SAME (Chin* and aca*) SAME Beijing) AND =(2007) =. =SCI-EXPANDED. 2. 1 56 : Li, HY (Li, Huiyuan); Sun, JC (Sun, Jiachang); Xu, Y (Xu, Yuan) : Discrete Fourier analysis, cubature, and interpolation on a hexagon and a triangle

schoolmistInternet και Εφαρμογές Web

22 Οκτ 2013 (πριν από 3 χρόνια και 9 μήνες)

2.498 εμφανίσεις

1.

检索条件

地址
=(((Inst Sofware) OR (Inst Software) OR (Software Inst)) SAME (Chin* and aca*) SAME
Beijing) AND
出版年
=(2007)

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

2.

检索结果

显示

1
条,共

56



作者
: Li, HY (Li, Huiyuan); Sun, JC (Sun, Jiachang); Xu, Y (Xu, Yuan)

标题
: Discrete Fourier an
alysis, cubature, and interpolation on a hexagon and a triangle

来源出版物
: SIAM JOURNAL ON NUMERICAL ANALYSIS, 46 (4): 1653
-
1681 2007

语言
: English

文献类型
: Article

作者关键词
: discrete Fourier series; trigonometric; Lagrange interpolation; hexagon; triangle;
orthog
onal polynomials

KeyWords Plus: EQUILATERAL TRIANGLE; EIGENSTRUCTURE; FORMULAS

摘要
: Several problems of trigonometric approximation on a hexagon and a triangle are studied
using the discrete Fourier transform and orthogonal polynomials of two variables. A

discrete
Fourier analysis on the regular hexagon is developed in detail, from wh
ich the analysis on the
triangle is deduced. The results include cubature formulas and interpolation on these domains. In
particular, a trigonometric Lagrange interpolation on

a triangle is shown to satisfy an explicit
compact formula, which is equivalent to the polynomial interpolation on a planar region bounded
by Steiner's hypocycloid. The Lebesgue constant of the interpolation is shown to be in the order of
(logn)(2). Furth
ermore, a Gauss cubature is established on the hypocycloid.

地址
: [Li, Huiyuan; Sun, Jiachang] Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R
China; [Xu, Yuan] Univ Oregon, Dept Math, Eugene, OR 97403 USA

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

电子邮箱地址
: hynli@mail.rdcps.ac.cn; sun@mail.rdcps.ac.cn; yuan@math.uoregon.edu

引用的参考文献数
: 26

被引频次
: 0

出版商
: SIAM PUBLICATIONS

出版商地址
: 3600 UNIV CITY SCIENCE CENTER, PHILADELPHIA, PA 19104
-
2688 USA

ISSN: 0036
-
1429

DOI: 10.1137/060671851

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

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

来源文献页码计数
: 29

学科类别
: Mathematics, Applied

ISI
文献传递号
: 309IH


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

显示

2
条,共

56



作者
: Flatt, M (Flatt, Matthew); Yu, G (Yu, Gang); Findler, RB (Findler, Robert Bruce); Felleisen,
M (Felleisen, Matthias)

标题
: Adding delimited and composable control to a production programming environment

来源出版物
: ACM SIGPLAN NOTICES, 42 (9): 165
-
176 SEP 2
007

语言
: English

文献类型
: Proceedings Paper

会议标题
: 12th ACM SIGPLAN International Conference on Functional Programming

会议日期
: OCT 01
-
03, 2007

会议地点
: Freiburg, GERMANY

作者关键词
: design; languages

摘要
: Operators for delimiting control and for capturing composabl
e continuations litter the
landscape of theoretical programming language research. Numerous papers explain their
advantages, how the operators explain each other (or don't), and other aspects
of the operators'
existence. Production programming languages, h
owever, do not support these operators, partly
because their relationship to existing and demonstrably useful constructs
-
such as exceptions and
dynamic binding
-
remains relatively unexplored.

In this paper, we report on our effort of translating the theory
of delimited and composable control
into a viable implementation for a production system. The report shows how this effort involved a
substantial design element, including work with a formal model, as well as significant practical
exploration and engineeri
ng.

The resulting version of PLT Scheme incorporates the expressive combination of delimited and
composable control alongside dynamic
-
wind, dynamic binding, and exception handling. None of
the additional operators subvert the intended benefits of existing
control operators, so that
programmers can freely mix and match control operators.

地址
: [Flatt, Matthew] Univ Utah, Salt Lake City, UT 84112 USA; [Yu, Gang] Chinese Acad Sci,
Inst Software, Beijing 100864, Peoples R China; [Findler, Robert Bruce] Univ Chicago, Chicago,
IL 60637 USA; [Felleisen, Matthias] Northeastern Univ, Boston, MA 0211
5 USA

通讯作者地址
: Flatt, M, Univ Utah, Salt Lake City, UT 84112 USA.

电 子 邮 箱 地 址
: mflatt@cs.utah.edu; yug@ios.ac.cn; robby@cs.uchicago.edu;
matthias@ccs.neu.edu

引用的参考文献数
: 32

被引频次
: 0

出版商
: ASSOC COMPUTING MACHINERY

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

ISSN: 0362
-
1340

29
字符的来源出版物名称缩写
: ACM SIGPLAN NOTICES

ISO
来源文献出版物名称缩写
: ACM Sigplan Not.

来源文献页码计数
: 12

学科类别
: Computer Science, Software Engineering

ISI
文献传递号
: 266CV


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

显示

3
条,共

56



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

标题
: Clustering using an improved hybrid genetic algorithm

来源出版物
: INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGEN
CE TOOLS, 16 (6):
919
-
934 DEC 2007

语言
: English

文献类型
: Proceedings Paper

会议标题
: 4th Hellenic Conference on Artificial Intelligence

会议日期
: MAY 18
-
20, 2006

会议地点
: Iraklion, GREECE

会议赞助商
: EETN.

会议主办方
: Univ Crete

作者关键词
: clustering; genetic algorithms; local

iteration algorithm

KeyWords Plus: K
-
MEANS ALGORITHM; SEARCH

摘要
: In this article, a new genetic clustering algorithm called the Improved Hybrid Genetic
Clustering Algorithm (IHGCA) is proposed to deal with the clustering problem under the criterion
of m
inimum sum of squares clustering. In IHGCA, the improvement oper
ation including five local
iteration methods is developed to tune the individual and accelerate the convergence speed of the
clustering algorithm, and the partition
-
absorption mutation operati
on is designed to reassign
objects among different clusters. By experimental simulations, its superiority over some known
genetic clustering methods is demonstrated.

地址
: [Liu, Yongguo; Pu, Xiaorong; Yi, Zhang] Univ Elect Sci & Technol China, Coll Comp Sci
& Engn, Chengdu 610054, Peoples R China; [Liu, Yongguo; Shen, Yidong] Chinese Acad Sci,
Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China; [Liao, Xiaofeng]

Chongqing
Univ, Dept Comp Sci & Engn, Chongqing 400044, Peoples R China

通讯作者地址
: Liu, YG, Univ Elect Sci & Technol China, Coll Comp Sci & Engn, Chengdu
610054, Peoples R China.

电 子 邮 箱 地 址
: liuyg@uestc.edu.cn; puxiaor@uestc.edu.cn; ydshen@ios.ac.cn;
zhangyi@u
estc.edu.cn; xfliao@cqu.edu.cn

引用的参考文献数
: 26

被引频次
: 0

出版商
: WORLD SCIENTIFIC PUBL CO PTE LTD

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

ISSN: 0218
-
2130

29
字符的来源出版物名称缩写
: INT J ARTIF INTELL TOOLS

ISO
来源文献出版物名称缩写
: Int. J. Artif. Intell. Tools

来源
文献页码计数
: 16

学科类别
: Computer Science, Artificial Intelligence; Computer Science, Interdisciplinary
Applications

ISI
文献传递号
: 246ZO


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

显示

4
条,共

56



作者
: Zhang, YH (Zhang, Yuanhai)
; Wei, HF (Wei Huangfu); Qiao, YS (Qiao, Yuansong)

标题
: A multi
-
channel HD video streaming in digital community network: Video rate adaptation
and playback adjustment

来源出版物
: IEEE TRANSACTIONS ON CONSUMER ELECTRONICS, 53 (4): 1449
-
1455
NOV 2007

语言
: Englis
h

文献类型
: Article

作者关键词
: adaptive video streaming; PCR; HD; proportional
-
integra controller

KeyWords Plus: HOME

摘要
: In this paper, we propose design and implementation of a practical end
-
to
-
end system which
implements multi
-
channel digital television (DT
V) multicasting to the home over broadband
community access network using sender
-
driven video rate adaptation and
receiver
-
driven
playback adjustment. For video rate adaptation, we employ Program Clock Reference (PCR)
embedded in the MPEG
-
2 transport strea
m (TS) to e nhance packet timing control precision and
regulate the transmission rate in a refined way. At the same time, we integrate Traffic Control (TC)
ingeniously to separate streams of multiple channels at the network card of DTV server and thus
avoi
d bandwidth competition between them. For playback adjustment, we introduce control theory
and over
-
boundary strategy to reduce buffer jitter and maximize the visual quality of displayed
video according to the receiver buffer occupancy. We test our system
with Standard Definition
(SD) and High Definition (HD) MPEG
-
2 streams and find that the proposed algorithms can reduce
overflow and underflow of sender and receiver buffer, and achieve better video quality and more
concurrent channels than traditional solu
tions.(1).

地址
: [Zhang, Yuanhai; Wei Huangfu] Chinese Acad Sci, Inst Software, Beijing, Peoples R China;
[Qiao, Yuansong] Athlone Inst Technol, Appl Software Res Ctr, Athlone, Ireland

通讯作者地址
: Zhang, YH, Chinese Acad Sci, Inst Software, Beijing, Peoples R
China.

电子邮箱地址
: yuanhai02@ios.cn; huangfuwei@ios.cn; ysqiao@ait.ie

引用的参考文献数
: 14

被引频次
: 1

出版商
: IEEE
-
INST ELECTRICAL ELECTRONICS ENGINEERS INC

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

ISSN: 0098
-
3063

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

IS
O
来源文献出版物名称缩写
: IEEE Trans. Consum. Electron.

来源文献页码计数
: 7

学科类别
: Engineering, Electrical & Electronic; Telecommunications

ISI
文献传递号
: 248LQ


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

显示

5
条,共

56



作者
: Feng, Y (Feng,

Yuan); Duan, R (Duan, Runyao); Ji, Z (Ji, Zhengfeng); Ying, M (Ying,
Mingsheng)

标题
: Probabilistic bisimulations for quantum processes

来源出版物
: INFORMATION AND COMPUTATION, 205 (11): 1608
-
1639 NOV 2007

语言
: English

文献类型
: Article

作者关键词
: quantum process; p
robabilistic bisimulation; congruence

KeyWords Plus: PROGRAMMING
-
LANGUAGES; COMMUNICATION; BISIMILARITY;
MECHANICS; STATES

摘要
: Modeling and reasoning about concurrent quantum systems is very important for both
distributed quantum computing and quantum pr
otocol verification. As a consequence, a general
framework formally describing communication and concurrency in complex quant
um systems is
necessary. For this purpose, we propose a model named qCCS. It is a natural quantum extension
of classical value
-
pass
ing CCS which can deal with input and output of quantum states, and
unitary transformations and measurements on quantum systems. The operational semantics of
qCCS is given in terms of probabilistic labeled transition system. This semantics has many
differe
nt features compared with the proposals in the available literature in order to describe the
input and output of quantum systems which are possibly correlated with other components. Based
on this operational semantics, the notions of strong probabilistic b
isimulation and weak
probabilistic bisimulation between quantum processes are introduced. Furthermore, some
properties of these two probabilistic bisimulations, such as congruence under various combinators,
are examined. (c) 2007 Elsevier Inc. All rights r
eserved.

地址
: Tsing Hua Univ, Dept Comp Sci & Technol, State Key Lab Intelligent Technol & Syst,
Beijing 100084, Peoples R China; Chinese Acad Sci, Inst Software, State Key Lab Comp Sci,
Beijing 100084, Peoples R China

通讯作者地址
: Feng, Y, Tsing Hua Univ, Dep
t Comp Sci & Technol, State Key Lab Intelligent
Technol & Syst, Beijing 100084, Peoples R China.

电 子 邮 箱 地 址
: feng
-
y@tsinghua.edu.cn; dry@tsinghua.edu.cn;
Jizhengfeng98@mails.tsinghua.edu.cn; yingmsh@tsinghua.edu.cn

引用的参考文献数
: 40

被引频次
: 3

出版商
: ACADEMIC PRESS
INC ELSEVIER SCIENCE

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

ISSN: 0890
-
5401

DOI: 10.1016/j.ic.2007.08.001

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

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

来源文献页码计数
: 32

学科类别
: Computer Science, Theory & Methods; Mathematic
s, Applied

ISI
文献传递号
: 238EB


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

显示

6
条,共

56



作者
: Pu, F (Pu, Fei); Zhang, WH (Zhang, WenHui)

标题
: Combining search space partition and abstraction for LTL model checking

来源出版

: SCIENCE IN CHINA SERIES F
-
INFORMATION SCIENCES, 50 (6): 793
-
810
DEC 2007

语言
: English

文献类型
: Article

作者关键词
: search space partition; refinement; abstraction; LTL model checking

KeyWords Plus: SYSTEMS; REFINEMENT; ALGORITHM

摘要
: The state space explosio
n problem is still the key obstacle for applying model checking to
systems of industrial size. Abstraction
-
based methods have been particularly successful in this
regard. This paper presents an approach based on refinement of se
arch space partition and
abs
traction which combines these two techniques for reducing the complexity of model checking.
The refinement depends on the representation of each portion of search space. Especially, search
space can be refined stepwise to get a better reduction. As reporte
d in the case study, the
integration of search space partition and abstraction improves the efficiency of verification with
respect to the requirement of memory and obtains significant advantage over the use of each of
them in isolation.

地址
: Chinese Acad
Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R
China; Univ Western Sydney, Sch Comp & Math, Sydney, NSW, Australia

通讯作者地址
: Pu, F, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080,
Peoples R China.

电子邮箱地址
: puf
2008@gmail.com

引用的参考文献数
: 24

被引频次
: 0

出版商
: SCIENCE CHINA PRESS

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

ISSN: 1009
-
2757

DOI: 10.1007/s11432
-
007
-
0073
-
y

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

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

来源文献页码计数
: 18

学科类别
: Computer Science, Information Systems

ISI
文献传递号
: 232LF


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

显示

7
条,共

56



作者
: Li, RH (Li, Rong
-
Hua); Wu, CK (Wu, Chuan
-
Kun)

标题
: A protocol for a p
rivate set
-
operation

来源出版物
: JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 22 (6): 822
-
829
NOV 2007

语言
: English

文献类型
: Article

作者关键词
: secure multiparty computation; private set
-
operation; secure protocol

摘要
: A new private set
-
operation problem is proposed
. Suppose there are n parties with each
owning a secret set. Let one of them, say P, be the leader, S be P's secret set, and t (less than n
-
1)
be a threshold value. For each element w of S, if w appears mo
re than t times in the rest parties'
sets, then P l
earns which parties' sets include w, otherwise P cannot know whether w appears in
any party's set. For this problem, a secure protocol is proposed in the semi
-
honest model based on
semantically secure homomorphic encryption scheme, secure sharing scheme, a
nd the polynomial
representation of sets. The protocol only needs constant rounds of communication.

地址
: Chinese Acad Sci, State Key Lab Informat Security, Inst Software Engn, Beijing 100080,
Peoples R China; Grad Univ Chinese Acad Sci, Beijing 100049, Peo
ples R China

通讯作者地址
: Li, RH, Chinese Acad Sci, State Key Lab Informat Security, Inst Software Engn,
Beijing 100080, Peoples R China.

电子邮箱地址
: lirh@is.iscas.ac.cn; ckwu@is.iscas.ac.cn

引用的参考文献数
: 13

被引频次
: 0

出版商
: SCIENCE CHINA PRESS

出版商地址
: 16 DONGHUANGCHE
NGGEN NORTH ST, BEIJING 100717, PEOPLES R
CHINA

ISSN: 1000
-
9000

DOI: 10.1007/s11390
-
007
-
9098
-
3

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

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

来源文献页码计数
: 8

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

ISI
文献传递号
: 232HY


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

显示

8
条,共

56



作者
: Wang, MS (Wang Mingsheng)

标题
: Parameter choices on Guruswami
-
Sudan algorithm for polynomial reconstruction

来源
出版物
: FINITE FIELDS AND THEIR APPLICATIONS, 13 (4): 877
-
886 NOV 2007

语言
: English

文献类型
: Article

作者关键词
: finite fields; Reed
-
Solomon codes; polynomial reconstruction

KeyWords Plus: REED
-
SOLOMON; CODES

摘要
: Guruswami
-
Sudan algorithm for polynomial reconstru
ction problem plays an important role
in the study of error
-
correcting codes. In this paper, we study new better parameter choices in
Guruswami
-
Sudan algorithm for the polynomial reconstruction problem.

As a consequence, our
result gives a better upper bou
nd for the number of solutions for the polynomial reconstruction
problem comparing with the original algorithm. (c) 2005 Elsevier Inc. All rights reserved.

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

通讯作者地址
: Wang, MS, Chinese Acad Sci, Inst Software, Informat Secur Lab, POB 8718,
Beijing 100080, Peoples R China.

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

引用的参考文献数
: 9


引频次
: 1

出版商
: ACADEMIC PRESS INC ELSEVIER SCIENCE

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

ISSN: 1071
-
5797

DOI: 10.1016/j.ffa.2005.10.002

29
字符的来源出版物名称缩写
: FINITE FIELDS THEIR APPL

ISO
来源文献出版物名称缩写
: Finite Fields their Appl.

来源文献页码计数
: 10

学科类别
: Mathematics, Applied; Mathematics

ISI
文献传递号
: 228QO


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

显示

9
条,共

56



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

标题
: Multiplicati
ve linear secret sharing schemes based on connectivity of graphs

来源出版物
: IEEE TRANSACTIONS ON INFORMATION THEORY, 53 (11): 3973
-
3978 NOV
2007

语言
: English

文献类型
: Proceedings Paper

会议标题
: 1st SKLOIS Conference on Information Security and Cryptology

会议日期
: D
EC 15
-
17, 2005

会议地点
: Beijing, PEOPLES R CHINA

会议赞助商
: Chinese Acad Sci, State Key Lab Informat Secur.

作者关键词
: connectivity of graphs; monotone span program; multiparty computation;
multiplicative linear secret sharing scheme

KeyWords Plus: SECURE MULTIPA
RTY COMPUTATION

摘要
: The multiplicative property is important for a linear secret sharing scheme (LSSS) to be
used in constructing a multiparty computation (MPC) protocol. In general, an LSSS has to expand
its share size to obtain the multiplicative proper
ty. In this paper
, with respect to an MPC problem
based on connectivity of graphs we devise an ideal multiplicative LSSS, that is, the LSSS is of the
multiplicative property without expanding its share size. Moreover, it provides a new class of
access stru
ctures that have ideal multiplicative LSSSs.

地址
: Chinese Acad Sci, Key Lab Math Mech, Acad Math & Syst Sci, Beijing 100080, Peoples R
China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China

通讯作者地址
: Liu, ML, Chinese Acad Sci, Key Lab Math Mech, Acad Math & Syst Sci, Beijing
100080, Pe
oples R China.

电子邮箱地址
: mlliu@amss.ac.cn; xllemail2004@yahoo.com.cn

引用的参考文献数
: 14

被引频次
: 3

出版商
: IEEE
-
INST ELECTRICAL ELECTRONICS ENGINEERS INC

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

ISSN: 0018
-
9448

DOI: 10.1109/TIT.2007.907505

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

IEEE TRANS INFORM THEORY

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

来源文献页码计数
: 6

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

ISI
文献传递号
: 224LP


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

显示

10
条,共

56



作者
: Bi, Y (Bi, Yanzhong); Li, N (Li, Na); Sun, L (Sun, Limin)

标题
: DAR: An energy
-
balanced data
-
gathering scheme for wireless sensor networks

来源出版物
: COMPUTER COMMUNICATIONS, 30 (14
-
15): 2812
-
2825 OCT 15 2007

语言
: English

文献类型
: Ar
ticle

作者关键词
: wireless sensor network; data
-
gathering scheme; lifetime; energy balancing

摘要
: A wireless sensor network faces special challenges due to its inherent features, such as the
limited energy. The energy constraint drives research on how to utili
ze energy efficiently to
prolong the lifetime of the network. Because a sink node takes th
e responsibility of collecting data
from other nodes, a usual conception is to transfer data towards the sink node by multihop.
However, conventional data
-
gathering s
chemes based on the conception give rise to the hotspot
problem because of the nodes that run out of their energy sooner than other nodes, which results in
accelerating the end of the whole network. The closer sensor nodes are to the sink, the more
quickly

they exhaust their energy, which leaves an upper bound to the lifetime of the whole
network. Because of the bottleneck nodes, the network loses its service ability regardless of a large
amount of residual energy of the other nodes. In this paper, we propo
se a novel data
-
gathering
scheme, DAR, to handle the hotspot problem, in which all the nodes participate in the workload of
gathering data from the whole network and transferring the data directly to the sink. In our scheme,
the forwarding behavior of all
the nodes is scheduled to balance their burden of aggregating and
transmitting the network data and the nodes may send their data back against the sink, which
differs from the conventional schemes. We performed simulation experiments to evaluate the
perfor
mance of the DAR scheme, and the results show that our data
-
gathering scheme can balance
the energy consumption among all the nodes and extend the network lifetime notably. (C) 2007
Elsevier B.V. All rights reserved.

地址
: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad
Sch, Beijing 100039, Peoples R China; Chinese Acad Sci, Comp Network Informat Ctr, Beijing
100080, Peoples R China

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

电子邮箱地址
: yanzhong02@ios.cn; lina305@mails.gucas.ac.cn; sunlimin@ios.cn

引用的参考文献数
: 28

被引频次
: 1

出版商
: ELSEVIER SCIENCE BV

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

ISSN: 0140
-
3664

DOI: 10.1016/j.comcom.2007.05.02
1

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

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

来源文献页码计数
: 14

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

ISI
文献传递号
: 228RJ


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

显示

11
条,共

56



作者
: Ma, JG (Ma Jiangang); Huang, T (Huang Tao); Xu, G (Xu Gang); Wang, JL (Wang Jinling);
Ye, D (Ye Dan)

标题
: A timeliness assurance scheduling algorithm for distributed publish/subscribe system

来源出版物
: CHINESE

JOURNAL OF ELECTRONICS, 16 (4): 603
-
607 OCT 2007

语言
: English

文献类型
: Article

作者关键词
: publish/subscribe; delay model; scheduling algorithm; priority

摘要
: The publish/subscribe (pub/sub) communication paradigm will be used widely due to its
asynchronous, ma
ny
-
to
-
many and loosely
-
coupled communication properties. But existing
pub/sub systems can't satisfy application delay requirement under a dynamic dist
ributed
computing environment. So we extend the pub/sub system syntax, and set up the delay model, and
pro
pose a pricebased timeliness assurance scheduling algorithm named as MTEP (Maximum total
earning priority). The algorithm satisfies the specified delay requirement of both publisher and
subscriber, and makes use of available bandwidth efficiently, and adap
ts to the dynamic network
environment. The experimental results show that our algorithm can make subscribers receive
many more valid events and improve system earning significantly comparing with the classical
FCFS, fixed priority and least remaining time
priority algorithms.

地址
: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R
China; Chinese Acad Sci, Grad Sch, Beijing 100049, Peoples R China

通讯作者地址
: Ma, JG, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing
100080, People
s R China.

引用的参考文献数
: 6

被引频次
: 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
来源文献出版物名称缩写
: Chi
n. J. Electron.

来源文献页码计数
: 5

学科类别
: Engineering, Electrical & Electronic

ISI
文献传递号
: 223UO


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

显示

12
条,共

56



作者
: Xiao, MH (Xiao, Meihua); Xue, JY (Xue, Jinyun)

标题
: Formal ana
lysis of cryptographic protocols in a knowledge algorithm logic framework

来源出版物
: CHINESE JOURNAL OF ELECTRONICS, 16 (4): 701
-
706 OCT 2007

语言
: English

文献类型
: Article

作者关键词
: formal method; cryptographic protocols; model checking; logic of knowledge
algori
thm; intruder model

KeyWords Plus: SECURITY PROTOCOLS; SPIN

摘要
: Logics for security protocol analysis require the formalization of an intruder model that
specifies the capabilities of intruders. In this paper, we present a logic for security protocol
ana
lysis using knowledge algorithm under the Dolev
-
Yao model. Int
ruders are assumed to use
algorithms to compute explicitly their knowledge, as well as intruder capabilities are captured by
suitable restrictions on the algorithms used. The knowledge completen
ess of intruder capabilities
is proved for model checking of cryptographic protocols. To reduce the model checking
complexity, we develop some novel analysis strategies to simplify the intruder knowledge
representation in this framework. For illustration p
urposes, we explore the use of SPIN for the
security properties verification of BAN
-
Yahalom protocol and Helsinki protocol. Three attacks are
found in only one general model about BAN
-
Yahalom protocol, and the Horng
-
Hsu attack to
Helsinki protocol is expos
ed too. The experimental results show the verification validity and
effectiveness.

地址
: Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R
China; Jiangxi Normal Univ, Prov Key Lab High Performance Comp, Coll Comp Informat Engn,
Nanchang 330027, Peoples R China; Nanchang Univ, Sch Informat Engn, Dept Comp Sc
i,
Nanchang 330029, Peoples R China

通讯作者地址
: Xiao, MH, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing
100080, Peoples R China.

电子邮箱地址
: xiao_mh@263.net; jinyun@jxnu.edu.cn

引用的参考文献数
: 19

被引频次
: 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.

来源文献页码计数
: 6

学科类别
: Engineering, Electrical & Electronic

IS
I
文献传递号
: 223UO


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

显示

13
条,共

56



作者
: Li, J (Li, Jing); Wang, WC (Wang, Wencheng); Wu, EH (Wu, Enhua)

标题
: Point
-
in
-
polygon tests by convex decomposition

来源出版物
: COMPUTERS & GR
APHICS
-
UK, 31 (4): 636
-
648 AUG 2007

语言
: English

文献类型
: Article

作者关键词
: point containment; convex decomposition; BSP trees; polygon; computational
geometry

KeyWords Plus: INCLUSION TEST; COMPLEXITY; SETS

摘要
: The paper presents a new algorithm for point
-
i
n
-
polygon queries. By decomposing a
polygon into a set of convex polygons and then constructing a BSP tree, the algorithm performs an
inclusion query against the polygon in two steps. In the first step, it
finds the convex polygon that
is most likely to co
ntain the query point through the BSP tree, and then in the second step, it tests
whether the query point is in the convex polygon by employing advanced techniques for
point
-
in
-
convex
-
polygon queries. The new algorithm is immune of singularity and has a
pe
rformance of conducting a query by time demand in O(log n), and storage requirement in O(n).
The time complexity of the preprocessing is O(n log n) for convex decomposition and BSP tree
construction. The new algorithm has its performance in various aspects

comparable to the
state
-
of
-
art algorithms based on trapezoidation. Furthermore, as the number of convex Polygons is
always much fewer than the number of trapezoids in partitioning a polygon, and a high
-
quality
search tree can always be constructed to mana
ge the convex polygons, the new algorithm can run
much faster than the trapezoidation
-
based algorithms, up to over double folds in maximum.

(c) 2007 Elsevier Ltd. All rights reserved.

地址
: Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, P
eoples R China; Univ
Macau, Dept Comp & Informat Sci, Macao, Peoples R China; Chinese Acad Sci, Grad Univ,
Beijing, Peoples R China

通讯作者地址
: Li, J, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples
R China.

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


用的参考文献数
: 25

被引频次
: 4

出版商
: PERGAMON
-
ELSEVIER SCIENCE LTD

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

ISSN: 0097
-
8493

DOI: 10.1016/j.cag.2007.03.002

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

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

来源文献页
码计数
: 13

学科类别
: Computer Science, Software Engineering

ISI
文献传递号
: 224CV


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

显示

14
条,共

56



作者
: Tao, YH (Tao, Yu
-
Hong); Wang, QH (Wang, Qiong
-
Hua); Zhao, RL (Zhao, Ren
-
Liang);
T
ian, J (Tian, Jun); Zhao, WX (Zhao, Wu
-
Xiang)

标题
: Fabry
-
Perot microcavity luminescent screens for optically written display

来源出版物
: OPTICAL ENGINEERING, 46 (7): Art. No. 074001 JUL 2007

语言
: English

文献类型
: Article

作者关键词
: Fabry
-
Perot microcavity; luminesc
ent screens; thin films; display

KeyWords Plus: NEAR
-
INFRARED LIGHT; UP
-
CONVERSION

摘要
: Fabry
-
Perot microcavity luminescent screens for optically written display are presented.
The screens consist of dielectric mirrors sandwiching a luminescent layer. An
incident 975
-
nm
laser source excites the luminescent medium by upconversion for emiss
ion in red, green, or blue.
The Fabry
-
Perot microcavity serves to narrow the emission band, leading to more saturated color.
The design and fabrication are described. The
display creates good images with an unprecedented
color gamut. (c) 2007 Society of Photo
-
Optical Instrumentation Engineers.

地址
: Sichuan Univ, Sch Elect & Informat Engn, Chengdu 610065, Peoples R China; Chinese
Acad Sci, Inst Software, Beijing 100080, Peoples R China

通讯作者地址
: Tao, YH, Sichuan Univ, Sch Elect & Informat Engn, Chengdu 610065, Peoples R
China.

电子邮箱地址
: qhwang@cdnet
.edu.cn

引用的参考文献数
: 7

被引频次
: 1

出版商
: SPIE
-
SOC PHOTOPTICAL INSTRUMENTATION ENGINEERS

出版商地址
: 1000 20TH ST, PO BOX 10, BELLINGHAM, WA 98225 USA

ISSN: 0091
-
3286

文献编号
: 074001

DOI: 10.1117/1.2756816

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

ISO
来源文献出版物名称缩写
: Opt. Eng.

来源文献页
码计数
: 3

学科类别
: Optics

ISI
文献传递号
: 221BA


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

显示

15
条,共

56



作者
: Huang, HD (Huang, Hao
-
Da); Tong, X (Tong, Xin); Wang, WC (Wang, Wen
-
Cheng)

标题
: Accelerated parallel texture optim
ization

来源出版物
: JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 22 (5): 761
-
769
SEP 2007

语言
: English

文献类型
: Article

作者关键词
: texture synthesis; energy minimization; parallel; CPU; flow visualization

摘要
: Texture optimization is a texture synthesis method that
can efficiently reproduce various
features of exemplar textures. However, its slow synthesis speed limits its usage in many
interactive or real time applications. In this paper, we propose a paral
lel texture optimization
algorithm to run on GPUs. In our al
gorithm, k
-
coherence search and principle component analysis
(PCA) are used for hardware acceleration, and two acceleration techniques are further developed
to speed up our GPU
-
based texture optimization. With a reasonable precomputation cost, the
online s
ynthesis speed of our algorithm is 4000+ times faster than that of the original texture
optimization algorithm and thus our algorithm is capable of interactive applications. The
advantages of the new scheme are demonstrated by applying it to interactive ed
iting of
flow
-
guided synthesis.

地址
: Chinese Acad Sci, State Key Lab Comp Sci, Inst Software, Beijing 100080, Peoples R
China; Microsoft Res Asia, Beijing 100080, Peoples R China; Grad Univ Chinese Acad Sci,
Beijing 100080, Peoples R China

通讯作者地址
: Huang, HD, Chinese Acad Sci, State Key L
ab Comp Sci, Inst Software, Beijing
100080, Peoples R China.

电子邮箱地址
: haoda.huang@gmail.com; xtong@microsoft.com; whn@ios.ac.cn

引用的参考文献数
: 17

被引频次
: 3

出版商
: SCIENCE CHINA PRESS

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

ISSN: 1
000
-
9000

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

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

来源文献页码计数
: 9

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

ISI
文献传递号
: 218IN


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

显示

16
条,共

56



作者
: Cooper, B (Cooper, Barry); Li, AS (Li, Angsheng)

标题
: Preface: Theory and applications of models of computation

来源出版物
: THEORETICAL COMPUTER SCIENCE, 384 (1): 1
-
1 SEP 24 2007

语言
: English

文献类型
: Edi
torial Material

地址
: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Univ Leeds, Sch Math,
Leeds LS2 9JT, W Yorkshire, England

通讯作者地址
: Li, AS, Chinese Acad Sci, Inst Software, POB 8718, Beijing 100080, Peoples R
China.

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

引用的参考文献数
: 0

被引频次
: 0

出版商
: ELSEVIER SCIENCE BV

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

ISSN: 0304
-
3975

DOI: 10.1016/j.tcs.2007.05.013

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

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

来源文献页码计数
: 1

学科类别
: Compu
ter Science, Theory & Methods

ISI
文献传递号
: 213YY


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

显示

17
条,共

56



作者
: Xia, MJ (Xia, Mingji); Zhang, P (Zhang, Peng); Zhao, WB (Zhao, Wenbo)

标题
: Computational complexity of co
unting problems on 3
-
regular planar graphs

来源出版物
: THEORETICAL COMPUTER SCIENCE, 384 (1): 111
-
125 SEP 24 2007

语言
: English

文献类型
: Article

作者关键词
: #P
-
completeness; holographic reduction; vertex cover; matching

KeyWords Plus: STATISTICAL
-
MECHANICS; LATTICE;

NUMBER; DIMERS; SPARSE

摘要
: A variety of counting problems on 3
-
regular planar graphs are considered in this paper. We
give a sufficient condition which guarantees that the coefficients of a homogeneous polynomial
can be uniquely determined by its values
on a recurrence sequence.

This result enables us to use
the polynomial interpolation technique in high dimension to prove the #P
-
completeness of
problems on graphs with special requirements. Using this method, we show that #3
-
Regular
Bipartite Planar Verte
x Covers is #P
-
complete. Furthermore, we use Valiant's Holant Theorem to
construct a holographic reduction from it to #2,3
-
Regular Bipartite Planar Matchings, establishing
the #P
-
completeness of the latter. Finally, we completely classify the problems #Pla
nar Read
-
twice
3SAT with different ternary symmetric relations according to their computational complexity, by
giving several more applications of holographic reduction in proving the #P
-
completeness of the
corresponding counting problems. (c) 2007 Elsevie
r B.V. All rights reserved.

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

通讯作者地址
: Xia, MJ, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, POB 8717,
Beijing 100080, Peoples
R China.

电子邮箱地址
: xmjljx@gmail.com; algzhang@gmail.com; wbzhao1981@gmail.com

引用的参考文献数
: 18

被引频次
: 5

出版商
: ELSEVIER SCIENCE BV

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

ISSN: 0304
-
3975

DOI: 10.1016/j.tcs.2007.05.023

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

SCI

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

来源文献页码计数
: 15

学科类别
: Computer Science, Theory & Methods

ISI
文献传递号
: 213YY


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

显示

18
条,共

56



作者
: Zhang, P (Zhang, Peng)

标题
: A new ap
proximation algorithm for the k
-
facility location problem

来源出版物
: THEORETICAL COMPUTER SCIENCE, 384 (1): 126
-
135 SEP 24 2007

语言
: English

文献类型
: Article

作者关键词
: facility location; k
-
median; local search; approximation algorithm

摘要
: The k
-
facility location

problem is a common generalization of the facility location and the
k
-
median problems. For the metric uncapacitated k
-
facility location problem, we propose a
polynomial
-
time 2 + root 3 + epsilon
-
approximation algorithm using the

local search approach,
whi
ch significantly improves the previously known approximation ratio 4, given by Jain et al.
using the greedy method [K. Jain, M. Mahdian, E. Markakis, A. Saberi, V. Vazirani, Greedy
facility location algorithms analyzed using dual fitting with factor
-
reveal
ing LP, Journal of the
ACM 50 (2003) 795
-
824]. (c) 2007 Elsevier B.V. All rights reserved.

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

通讯作者地址
: Zhang, P
, Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, POB 8718,
Beijing 100080, Peoples R China.

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

引用的参考文献数
: 16

被引频次
: 2

出版商
: ELSEVIER SCIENCE BV

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

ISSN: 0304
-
3975

DOI: 1
0.1016/j.tcs.2007.05.024

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

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

来源文献页码计数
: 10

学科类别
: Computer Science, Theory & Methods

ISI
文献传递号
: 213YY


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




19
条,共

56



作者
: Liu, JW (Liu, Jinwang); Wang, MS (Wang, Mingsheng)

标题
: Further results on homogeneous Grobner bases under composition

来源出版物
: JOURNAL OF ALGEBRA, 315 (1): 134
-
143 SEP 1 2007

语言
: English

文献类型
: Article

作者关键词
: polynomial composition; we
ighted homogeneous Grobner bases

摘要
: Polynomial composition is the operation of replacing variables in a polynomial by other
polynomials. This paper studies when Grobner bases remain Grobner bases under composition
with respect to any fixed term ordering.

A complete characterization is gi
ven for homogeneous
Grobner bases under an arbitrary grading. This unifies the results of Hong (1998) and Liu and
Wang (2006). (C) 2007 Elsevier Inc. All fights reserved.

地址
: Chinese Acad Sci, Inst Software, State Key Lab

Informat Secur, Beijing 100080, Peoples R
China; Hunan Sci & Technol Univ, Coll Math & Computat, Xiangtan 411201, Hunan, Peoples R
China

通讯作者地址
: Wang, MS, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur,
Beijing 100080, Peoples R China.

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

引用的参考文献数
: 15

被引频次
: 0

出版商
: ACADEMIC PRESS INC ELSEVIER SCIENCE

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

ISSN: 0021
-
8693

DOI: 10.1016/j.jalgebra.2007.05.023

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

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

来源文献页码计数
: 10

学科类别
: Mathematics

ISI
文献传递号
: 206ZE


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

显示

20
条,共

56



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

标题
: Modeling and

analysis of real
-
time cooperative systems using Petri nets

来源出版物
: IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART
A
-
SYSTEMS AND HUMANS, 37 (5): 643
-
654 SEP 2007

语言
: English

文献类型
: Article

作者关键词
: interorganizational workflow; modeling; realtime co
operative system; temporal
logic; time Petri net (TPN); verification; workflow analysis

KeyWords Plus: WORKFLOW

摘要
: The existing formal techniques are not suitable for elegantly modeling passing value
indeterminacy and describing batch processing functio
n in real
-
time cooperative systems.
Moreover, the correct behavior of the systems depends on not only the logical
correctness of the
results obtained through running work
-
flows but also the time of producing them before critical
deadlines. For these purpos
es, this paper proposes an interorganizational logical workflow net
(ILWN) for modeling and analyzing real
-
time cooperative systems based on time Petri nets,
workflow techniques, and temporal logic. Through attaching logical expressions to some actions
of
an ILWN model, the size of the model is reduced. Thus, ILWNs can efficiently mitigate the
state explosion problem to some extent. Also, this paper analyzes the soundness of a subclass of
ILWNs: the OR
-
restricted ILWNs. A rigorous analysis approach is given

based on their static net
structures only. The concepts and techniques proposed in this paper are illustrated with a
seller
-
buyer example in electronic commerce.

地址
: Shadong Univ Sci & Technol, Coll Informat Sci & Engn, Qingdao 266510, Peoples R China;
Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China;
Tongji Univ, Dept Comp Sci & Engn, Shanghai 200092, Peoples R China; New Je
rsey Inst
Technol, Dept Elect Comp Engn, Newark, NJ 07102 USA; Xidian Univ, Sch Electromech Engn,
Xian 710071, Peoples R China

通讯作者地址
: Du, YY, Shadong Univ Sci & Technol, Coll Informat Sci & Engn, Qingdao
266510, Peoples R China.

电子邮箱地址
: yydu001@163.com;

cjjiang@online.sh.cn; zhou@njit.edu

引用的参考文献数
: 23

被引频次
: 7

出版商
: IEEE
-
INST ELECTRICAL ELECTRONICS ENGINEERS INC

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

ISSN: 1083
-
4427

DOI: 10.1109/TSMCA.2007.902622

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


ISO
来源文献出版物名称缩写
: IEEE Trans. Syst. Man Cybern. Paart A
-
Syst. Hum.

来源文献页码计数
: 12

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

ISI
文献传递号
: 204DX


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

显示

21
条,共

56



作者
: Shen, CX (Shen ChangXiang); Zhang, HG (Zhang HuangGuo); Feng, DG (Feng Dengguo);
Cao, ZF (Cao Zhenfu); Huang, JW (Huang Jiwu)

标题
: Survey of information security

来源出版物
: SCIENCE IN CHINA SERIES F
-
INFORMATION SCIENCES, 50 (3): 273
-
298
JU
N 2007

语言
: English

文献类型
: Review

作者关键词
: information security; cryptology; trusted computing; network security; information
hiding

KeyWords Plus: PUBLIC
-
KEY CRYPTOSYSTEM; SIGNATURE SCHEME; PROVABLY
SECURE; PROXY SIGNATURE; EFFICIENT; CRYPTOGRAPHY; WATERM
ARKING;
ENCRYPTION; ATTACKS; STEGANOGRAPHY

摘要
: The 21st century is the age of information when information becomes an important strategic
resource. The information obtaining, processing and security guarantee capability are playing
critical roles in compr
ehensive national power, and information sec
urity is related to the national
security and social stability. Therefore, we should take measures to ensure the information security
of our country. In recent years, momentous accomplishments have been obtained
with the rapid
development of information security technology. There are extensive theories about information
security and technology. However, due to the limitation of length, this article mainly focuses on
the research and development of cryptology, trus
ted computing, security of network, and
information hiding, etc.

地址
: Wuhan Univ, Sch Comp, Wuhan 430072, Peoples R China; Comp Technol Inst China Navy,
Beijing 100841, Peoples R China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R
China; Shan
ghai Jiao Tong Univ, Dept Comp Sci & Technol, Shanghai 200030, Peo
ples R China;
Zhongshan Univ, Inst Informat Technol, Guangzhou 510275, Peoples R China

通讯作者地址
: Shen, CX, Wuhan Univ, Sch Comp, Wuhan 430072, Peoples R China.

电子邮箱地址
: liss@whu.edu.cn

引用的参考
文献数
: 125

被引频次
: 3

出版商
: SCIENCE CHINA PRESS

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

ISSN: 1009
-
2757

DOI: 10.1007/s11432
-
007
-
0037
-
2

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

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

来源文献页码计数
: 2
6

学科类别
: Computer Science, Information Systems

ISI
文献传递号
: 187EI


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

显示

22
条,共

56



作者
: Lu, M (Lu MingXin); Lai, X (Lai XueJia); Xiao, G (Xiao GuoZhen); Qin, L (Qin Lei)

标题
: S
ymmetric
-
key cryptosystem with DNA technology

来源出版物
: SCIENCE IN CHINA SERIES F
-
INFORMATION SCIENCES, 50 (3): 324
-
333
JUN 2007

语言
: English

文献类型
: Article

作者关键词
: symmetric
-
key encryption; DNA cryptography; DNA computing

KeyWords Plus: MASS
-
SPECTROMETRY;
HYBRIDIZATION; OLIGONUCLEOTIDES;
CRYPTOGRAPHY; SCALE

摘要
: DNA cryptography is a new field which has emerged with progress in the research of DNA
computing. In our study, a symmetric
-
key cryptosystem was designed by applying a modern DNA
biotechnology, micr
oarray, into cryptographic technologies. This is refer
red to as DNA
symmetric
-
key cryptosystem (DNASC). In DNASC, both encryption and decryption keys are
formed by DNA probes, while its cipher
-
text is embedded in a specially designed DNA chip
(microarray).

The security of this system is mainly rooted in difficult biology processes and
problems, rather than conventional computing technology, thus it is unaffected by changes from
the attack of the coming quantum computer. The encryption process is a fabricati
on of a specially
designed DNA chip and the decryption process is the DNA hybridization. In DNASC, billions of
DNA probes are hybridized and identified at the same time, thus the decryption process is
conducted in a massive, parallel way. The great potenti
al in vast parallelism computation and the
extraordinary information density of DNA are displayed in DNASC to some degree.

地址
: Nanjing Univ, Dept Informat Management, Nanjing 210093, Peoples R China; Chinese
Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100049, Peoples R China;
Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai 200030, Peoples R China; Xi
dian
Univ, State Key Lab ISN, Xian 710071, Peoples R China; Queens Univ, Canc Res Inst, Kingston,
ON K7L 3N6, Canada

通讯作者地址
: Lu, M, Nanjing Univ, Dept Informat Management, Nanjing 210093, Peoples R
China.

电子邮箱地址
: lq@post.queensu.ca

引用的参考文献数
: 22

被引频次
: 0


出版商
: SCIENCE CHINA PRESS

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

ISSN: 1009
-
2757

DOI: 10.1007/s11432
-
007
-
0025
-
6

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

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

来源文献页码计数
: 10

学科类别
: Computer

Science, Information Systems

ISI
文献传递号
: 187EI


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

显示

23
条,共

56



作者
: Feng, DG (Feng DengGuo); Chen, WD (Chen WeiDong)

标题
: Modular approach to the design and analysis of pass
word
-
based security protocols

来源出版物
: SCIENCE IN CHINA SERIES F
-
INFORMATION SCIENCES, 50 (3): 381
-
398
JUN 2007

语言
: English

文献类型
: Article

作者关键词
: security protocols; weak computational indistinguishability; provable security;
random oracle model (ROM); st
andard model

摘要
: In this paper, a general framework for designing and analyzing password
-
based security
protocols is presented. First we introduce the concept of "weak computational indistinguishability"
based on current progress of password
-
based securit
y protocols. T
hen, we focus on cryptographic
foundations for password
-
based security protocols, i.e., the theory of "weak pseudorandomness".
Furthermore, based on the theory of weak pseudorandomness, we present a modular approach to
design and analysis of
password
-
based security protocols. Finally, applying the modular approach,
we design two kinds of password
-
based security protocols, i.e., password
-
based session key
distribution (PSKD) protocol and protected password change (PPC) protocol. In addition to
having forward secrecy and improved efficiency, new protocols are proved secure.

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

通讯作者地址
: Feng, DG, Chinese Acad Sci, State Key Lab Informat Secur, Inst Sof
tware,
Beijing 100080, Peoples R China.

电子邮箱地址
: feng@is.iseas.ac.cn

引用的参考文献数
: 14

被引频次
: 0

出版商
: SCIENCE CHINA PRESS

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

ISSN: 1009
-
2757

DOI: 10.1007/s11432
-
007
-
0034
-
5

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

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

来源文献页码计数
: 18

学科类别
: Computer Science, Information Systems

ISI
文献传递号
: 187EI


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

显示

24
条,共

56



作者
: Qing, SH (Qing

Sihan); Shen, CX (Shen ChangXiang)

标题
: Design of secure operating systems with high security levels

来源出版物
: SCIENCE IN CHINA SERIES F
-
INFORMATION SCIENCES, 50 (3): 399
-
418
JUN 2007

语言
: English

文献类型
: Article

作者关键词
: secure operating systems with high se
curity levels; architecture; security model;
covert channel analysis

KeyWords Plus: COVERT STORAGE CHANNELS

摘要
: Numerous Internet security incidents have shown that support from secure operating
systems is paramount to fighting threats posed by modern co
mputing environments. Based on the
requirements of the relevant national and international standards and crite
ria, in combination with
our experience in the design and development of the ANSHENG v4.0 secure operating system
with high security level (hereaf
ter simply referred to as ANSHENG OS), this paper addresses the
following key issues in the design of secure operating systems with high security levels: security
architecture, security policy models, and covert channel analysis. The design principles of s
ecurity
architecture and three basic security models: confidentiality, integrity, and privilege control
models are discussed, respectively. Three novel security models and new security architecture are
proposed. The prominent features of these proposals, a
s well as their applications to the
ANSHENG OS, are elaborated. Cover channel analysis (CCA) is a well
-
known hard problem in
the design of secure operating systems with high security levels since to date it lacks a sound
theoretical basis and systematic an
alysis approach. In order to resolve the fundamental difficulties
of CCA, we have set up a sound theoretical basis for completeness of covert channel identification
and have proposed a unified framework for covert channel identification and an efficient
ba
ckward tracking search method. The successful application of our new proposals to the
ANSHENG OS has shown that it can help ease and speedup the entire CCA process.

地址
: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Peking Univ, Sch
Software & Microelect, Beijing 102600, Peoples R China; Inst Comp Technol Navy, Beijing
100841, Peoples R China

通讯作者地址
: Qing, SH, Chinese Acad Sci, Inst Software, Beiji
ng 100080, Peoples R China.

电子邮箱地址
: qsihan@ercist.iscas.ac.cn

引用的参考文献数
: 32

被引频次
: 1

出版商
: SCIENCE CHINA PRESS

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

ISSN: 1009
-
2757

DOI: 10.1007/s11432
-
007
-
0028
-
3

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

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

来源文献页码计数
: 20

学科类别
: Computer Science, Information Systems

ISI
文献传递号
: 187EI


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

显示

25
条,共

56



作者
: Zhang, H (Zhang Hong
); He, YP (He YePing); Shi, ZG (Shi ZhiGuo)

标题
: A formal model for access control with supporting spatial context

来源出版物
: SCIENCE IN CHINA SERIES F
-
INFORMATION SCIENCES, 50 (3): 419
-
439
JUN 2007

语言
: English

文献类型
: Article

作者关键词
: information security; RB
AC; spatial context; lattice; MLS; constraints; formal
model

摘要
: There is an emerging recognition of the importance of utilizing contextual information in
authorization decisions. Controlling access to resources in the field of wireless and mobile
network
ing require the definition of a formal model for access contro
l with supporting spatial
context. However, traditional RBAC model does not specify these spatial requirements. In this
paper, we extend the existing RBAC model and propose the SC
-
RBAC model tha
t utilizes spatial
and location
-
based information in security policy definitions. The concept of spatial role is
presented, and the role is assigned a logical location domain to specify the spatial boundary. Roles
are activated based on the current physica
l position of the user which obtained from a specific
mobile terminal. We then extend SC
-
RBAC to deal with hierarchies, modeling permission, user
and activation inheritance, and prove that the hierarchical spatial roles are capable of constructing
a lattic
e which is a means for articulate multi
-
level security policy and more suitable to control the
information flow security for safety
-
critical location
-
aware information systems. Next, constrained
SC
-
RBAC allows express various spatial separations of duty co
nstraints, location
-
based
cardinality and temporal constraints for specify fine
-
grained spatial semantics that are typical in
location
-
aware systems. Finally, we introduce 9 invariants for the constrained SC
-
RBAC and its
basic security theorem is proven. T
he constrained SC
-
RBAC provides the foundation for
applications in need of the constrained spatial context aware access control.

地址
: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad
Sch, Beijing 100049, Peoples R China

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

电子邮箱地址
: hong@ercist.iscas.ac.cn

引用的参考文献

: 30

被引频次
: 1

出版商
: SCIENCE CHINA PRESS

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

ISSN: 1009
-
2757

DOI: 10.1007/s11432
-
007
-
0033
-
6

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

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

来源文献页码计数
: 21

学科类别
: Computer Science, Information Systems

ISI
文献传递号
: 187EI


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

显示

26
条,共

56



作者
: Yang, C (Yang, Chao); Sun, JC (Sun, Jiachang)

标题
: Edge
-
oriented hexagonal elements

来源出版物
:

JOURNAL OF COMPUTATIONAL MATHEMATICS, 25 (4): 430
-
439 JUL 2007

语言
: English

文献类型
: Article

作者关键词
: nonconforming finite element method; hexagonal element; Q(1) element

KeyWords Plus: FINITE
-
ELEMENTS

摘要
: In this paper, two new nonconforming hexagonal ele
ments are presented, which are based
on the trilinear function space Q(1)((3)) and are edge
-
oriented, analogical to the case of the rotated
Q(1) quadrilateral element. A priori error estimates are given

to show that the new elements
achieve first
-
order acc
uracy in the energy norm and second
-
order accuracy in the L
-
2 norm. This
theoretical result is confirmed by the numerical tests.

地址
: Chinese Acad Sci, Inst Software, Parallel Comp Lab, Beijing 100080, Peoples R China

通讯作者地址
: Yang, C, Chinese Acad Sci, Inst Software, Parallel Comp Lab, Beijing 100080,
Peoples R China.

电子邮箱地址
: yc@mail.rdcps.ac.cn; sun@mail.rdcps.ac.cn

引用的参考文献数
: 19

被引频次
: 0

出版商
: VSP BV

出版商地址
: BRILL ACADEMIC PUBLISHERS, PO BOX 9000, 2300 PA LEIDEN,
NETHERLANDS

ISSN: 0254
-
9409

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

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

来源文献页码计数
: 10

学科类别
: Mathematics, Applied; Mathematics

ISI
文献传递号
: 188XY


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

显示

27
条,共

56



作者
: Bi, YZ (Bi, Yanzhong); Sun, LM (Sun, Limin); Ma, J (Ma, Jian); Li, N (Li, Na); Khan, IA
(Khan, Imran Ali); Chen, CF (Chen, Canfeng)

标题
: HUMS: An autonomo
us moving strategy for mobile sinks in data
-
gathering sensor networks

来 源 出 版 物
: EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND
NETWORKING: Art. No. 64574 2007

语言
: English

文献类型
: Article

KeyWords Plus: PROTOCOLS

摘要
: Sink mobility has attracted much researc
h interest in recent years because it can improve
network performance such as energy efficiency and throughput. An energy
-
unconscious moving
strategy is potentially harmful to the balance of the energy consumptio
n among sensor nodes so as
to aggravate the
hotspot problem of sensor networks. In this paper, we propose an autonomous
moving strategy for the mobile sinks in data
-
gathering applications. In our solution, a mobile sink
approaches the nodes with high residual energy to force them to forward data for

other nodes and
tries to avoid passing by the nodes with low energy. We performed simulation experiments to
compare our solution with other three data
-
gathering schemes. The simulation results show that
our strategy cannot only extend network lifetime not
ably but also provides scalability and
topology adaptability. Copyright (c) 2007 Yanzhong Bi et al.

地址
: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad
Sch, Beijing 100039, Peoples R China; Nokia Res Ctr, Beijing 100013, Peoples R China; Chinese
Acad Sci, Comp Network Informat Ctr, Beijing 100080, Peoples R China

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

引用的参考文献数
: 37

被引频次
: 1

出版商
: HINDAWI PUBLISHING CORPORATION

出版商地址
: 410 PARK AVENUE, 15TH FLOOR, #287 PMB, NEW YORK, NY 10022 USA

ISSN: 1687
-
1499

文献编号
: 64574

DOI: 10.1155
/2007/64574

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

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

来源文献页码计数
: 15

学科类别
: Engineering, Electrical & Electronic; Telecommunications

ISI
文献传递号
: 196FP


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

显示

28
条,共

56



作者
: Huang, XL (Huang Xiaoli); Wu, CK (Wu Chuankun)

标题
: Improved cryptanalysis of the stream cipher polar bear

来源出版物
: CHINESE JOURNAL OF ELECTRONICS, 16 (3): 439
-
442 JUL 2007

语言
: English

文献类型
: Article

作者关键

: cryptanalysis; polar bear; stream cipher; guess
-
and
-
determine attack; eSTREAM

KeyWords Plus: ALGEBRAIC ATTACKS; LINEAR FEEDBACK

摘要
: This paper gives a guess
-
and
-
determine attack against polar bear, which is one of the
candidate stream ciphers of eSTRE
AM. We chose three different cleartext groups under different
assumptions, and only considered the first three cycles in each group.
Some values in each group
were recovered through known constant values and some relations in the previous and current
group
s. We recover the initial state of polar bear completely with time complexity O(2(36.86)). In
this respect, our results are much better than that of the two recent attacks whose time
complexities are O(2(79)) and O(2(57.4)) respectively. Our attack is base
d on known plaintext
scenario which requires knowledge of three different cleartext groups, where the first 12 bytes of
each group cleartext need to be known.

地址
: Chinese Acad Sci, Inst Software, State Key Lab Informat Security, Beijing 100080, Peoples
R
China; Chinese Acad Sci, Grad Sch, Beijing 100080, Peoples R China

通讯作者地址
: Huang, XL, Chinese Acad Sci, Inst Software, State Key Lab Informat Security,
Beijing 100080, Peoples R China.

引用的参考文献数
: 12

被引频次
: 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.

来源文献页码计数
: 4

学科类别
: Engineering, Electrical & Electronic

ISI
文献
传递号
: 188VW


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

显示

29
条,共

56



作者
: Xu, W (Xu, Wei); Cao, JN (Cao, Jiannong); Jin, BH (Jin, Beihong); Li, J (Li, Jing); Zhang,
L (Zhang, Liang)

标题
: GCS
-
MA: A group communication

system for mobile agents

来源出版物
: JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 30 (3):
1153
-
1172 AUG 2007

语言
: English

文献类型
: Article

作者关键词
: mobile agent; group communication; totally ordered multicast; fault tolerance

KeyWords Plus: MULTICAST PROTOCOL;

MECHANISMS; DESIGN

摘要
: Reliable messaging is a key component necessary for mobile agent systems. Current
researches focus on reliable one
-
to
-
one message delivery to mobile agents. But how to implement
a group communication system for mobile agents remain
s an open issue, whic
h is a powerful
block that facilitates the development of fault
-
tolerant mobile agent systems. In this paper, we
propose a group communication system for mobile agents (GCS
-
MA), which includes totally
ordered multicast and membership m
anagement functions. We divide a group of mobile agents
into several agent clusters, and each agent cluster consists of all mobile agents residing in the
same sub
-
network and is managed by a special module, named coordinator. Then, all coordinators
form a
ring
-
based overlay for interchanaing messages between clusters. We present a token
-
based
algorithm, an intra
-
cluster messaging algorithm and an inter
-
cluster migration algorithm to
achieve atomicity and total ordering properties of multicast messages, by b
uilding a membership
protocol on top of the clustering and failure detection mechanisms. Performance issues of the
proposed system have been analysed through simulations. We also describe the application of the
proposed system in the context of the service

cooperation middleware (SCM) project. (C) 2006
Elsevier Ltd. All rights reserved.

地址
: Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R
China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China; Hong Kong Poly
tech Univ,
Dept Comp, Kowloon, Hong Kong, Peoples R China

通讯作者地址
: Xu, W, Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, 4 S 4th
St,Zhong Guan Cun,POB 8718, Beijing 100080, Peoples R China.

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

引用的参考文献数
: 30

被引频次
: 2

出版商
: ACADEMIC PRESS LTD ELSEVIER SCIENCE LTD

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

ISSN: 1084
-
8045

DOI: 10.1016/j.jnca.2006.04.003

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

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

来源文献页码计数
: 20

学科类别
: Computer S
cience, Hardware & Architecture; Computer Science, Interdisciplinary
Applications; Computer Science, Software Engineering

ISI
文献传递号
: 185PQ


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

显示

30
条,共

56



作者
: Jin, H (Jin,
Hong); Wang, DL (Wang, Danli); Wang, HG (Wang, Hongan); Wang, H (Wang,
Hui)

标题
: Feedback fuzzy
-
DVS scheduling of control tasks

来源出版物
: JOURNAL OF SUPERCOMPUTING, 41 (2): 147
-
162 AUG 2007

语言
: English

文献类型
: Article

作者关键词
: control task; scheduling; feedba
ck control; fuzzy rule; dynamic voltage scaling

摘要
: To consider the energy
-
aware scheduling problem in computer
-
controlled systems is
necessary to improve the control performance, to use the limited computing resource sufficiently,
and to reduce the energ
y consumption to extend the lifetime of the whole

system. In this paper, the
scheduling problem of multiple control tasks is discussed based on an adjustable voltage processor.
A feedback fuzzy
-
DVS (dynamic voltage scaling) scheduling architecture is prese
nted by applying
technologies of the feedback control and the fuzzy DVS. The simulation results show that, by
using the actual utilization as the feedback information to adjust the supply voltage of processor
dynamically, the high CPU utilization can be im
plemented under the precondition of guaranteeing
the control performance, whilst the low energy consumption can be achieved as well. The
proposed method can be applied to the design in computer
-
controlled systems based on an
adjustable voltage processor.

地址
: Beijing Inst Control & Elect Technol, Beijing 100083, Peoples R China; Chinese Acad Sci,
Inst Software, IEL, Beijing 100080, Peoples R China; Natl Software & Integrated Circuit Promot
Ctr, Minist Informat Ind, Beijing 100038, Peoples R China

通讯作者地址
: J
in, H, Beijing Inst Control & Elect Technol, POB 2115, Beijing 100083, Peoples
R China.

电 子 邮 箱 地 址
: hjin1121@yahoo.com.cn; dlwang@iel.iscas.ac.cn; wha@iel.iscas.ac.cn;
wangh@csip.org.cn

引用的参考文献数
: 25

被引频次
: 2

出版商
: SPRINGER

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

ISSN: 0920
-
8542

DOI: 10.1007/s11227
-
006
-
0027
-
y

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

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

来源文献页码计数
: 16

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

ISI
文献传递号
: 183DM


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

显示

31
条,共

56



作者
: Chiu, SC (Chiu, Steve C.); Choudhary, AN (Choudhary, Alok N.); Wang, DL (Wang, Danli)

标题
: Network and device
-
l
evel impacts: performance and reliability of active I/O storage systems

来源出版物
: JOURNAL OF SUPERCOMPUTING, 41 (2): 163
-
178 AUG 2007

语言
: English

文献类型
: Article

作者关键词
: parallel I/O; distributed storage; MEMS; performance analysis; InfiniBand

摘要
: Distribut
ed active storage architectures are designed to offload user
-
level processing to the
peripheral from the host servers. In this paper, we report preliminary investigation on performance
and fault recovery designs, as impacted by emerging storag
e interconnec
t protocols and
state
-
of
-
the
-
art storage devices. Empirical results obtained using validated device
-
level and
interconnect data demonstrate the significance of the said parameters on the overall system
performance and reliability.

地址
: Idaho State Univ, Coll Engn, CS Program, Pocatello, ID 83209 USA; Northwestern Univ,
Dept EECS, Evanston, IL 60208 USA; Chinese Acad Sci, Inst Software, IEL, Beijing 100080,
Peoples R China

通讯作者地址
: Chiu, SC, Idaho State Univ, Coll Engn, CS Program, Po
catello, ID 83209 USA.

电子邮箱地址
: chiustev@isu.edu

引用的参考文献数
: 6

被引频次
: 0

出版商
: SPRINGER

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

ISSN: 0920
-
8542

DOI: 10.1007/s11227
-
006
-
0028
-
x

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

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

来源文献页码计数
: 16

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

ISI
文献传递号
: 183DM


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

显示

32
条,共

56



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

标题
: On a class of pseudorandom sequences from elliptic curves over finite fields

来源出版物
: IEEE TRANSACTIONS ON INFORMATION THEORY, 53 (7): 2598
-
2605 JUL
2007

语言
: English

文献类型
: Art
icle

作者关键词
: aperiodic correlation; elliptic curve; exponential sum on elliptic curve; least period;
linear complexity; periodic correlation; pseudo
-
random sequence; r
-
pattern

KeyWords Plus: LINEAR COMPLEXITY; EXPONENTIAL
-
SUMS; GALOIS RINGS;
CONSTRUCTIONS
; GENERATORS; CYCLICITY

摘要
: Following the idea of Xing et al., we investigate a general method for constructing families
of pseudorandom sequences with low correlation and large linear complexity from elliptic curves
over fields in this correspondence. Wi
th the help of the tool o
f exponential sums on elliptic curves,
we study their periods, linear complexities, linear complexity profiles, distributions of r
-
patterns,
periodic correlation, partial period distributions, and aperiodic correlation in detail. T
he results
show that they have nice randomness.

地址
: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R
China; Chinese Acad Sci, Grad Sch, State Key Lab Informat Secur, Beijing 100049, Peoples R
China

通讯作者地址
: Hu, HG, Chinese Acad Sci, Inst Software, State Key Lab In
format Secur, Beijing
100080, Peoples R China.

电子邮箱地址
: hghu@ustc.edu; hu@is.ac.cn; feng@is.iscas.ac.cn

引用的参考文献数
: 28

被引频次
: 3

出版商
: IEEE
-
INST ELECTRICAL ELECTRONICS ENGINEERS INC

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

ISSN: 0018
-
9448

DOI: 10.11
09/TIT.2007.899532

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

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

来源文献页码计数
: 8

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

ISI
文献传递号
: 183XS


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

显示

33
条,共

56



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

标题
: On quadratic bent functions in polynomial forms

来源出版物
: IEEE TRANSACTIONS ON INFORMATION THEORY, 53 (7): 2610
-
2615 JUL
2007

语言
: English

文献类型
: Article

作者关键词
: bent function; noolean function; hadamard transform; maximum nonlinearity;
quadratic form; semi
-
bent function

KeyWords Plus: BOOLEAN FUNCTIONS; BINARY SEQUENCES; SEMI
-
BENT;
CONSTRUCTION; FAMILIES

摘要
: In this correspondence, we const
ruct some new quadratic bent functions in polynomial
forms by using the theory of quadratic forms over finite fields. The results improve some previous
work. Moreover, we solve a problem left by Yu and Gong in 2006.

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

通讯作者地址
: Hu, HG, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing
100080, Peoples R China.

电子邮箱地址
: lighu@ustc.edu; feng@is.iscas.ac.cn

引用的参考文献数
: 22

被引频次
: 0

出版商
: IEEE
-
INST

ELECTRICAL ELECTRONICS ENGINEERS INC

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

ISSN: 0018
-
9448

DOI: 10.1109/TIT.2007.899553

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

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

来源文献页码计数
: 6

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

ISI
文献传递号
: 183XS


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

显示

34
条,共

56



作者
: Wang, MS (Wang, Mingsheng)

标题
: On factor prime factorizations for n
-
D polyno
mial matrices

来源出版物
: IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I
-
REGULAR PAPERS,
54 (6): 1398
-
1405 JUN 2007

语言
: English

文献类型
: Article

作者关键词
: factor prime matrix; matrix factorization; multidimensional systems; n
-
D
polynomial matrices; polynomial ring

KeyWords Plus: SYSTEMS

摘要
: This paper investigates the problem of factor prime factorizations for n
-
D polynomial
matrices and presents a criterion for the existence of factor prime factorizations for an important
class of n
-
D polynomial matrices. As a by
-
product, we also obtain
an algebraic algorithm to check
n
-
D factor primeness in some important cases which partially solves the long
-
standing open
problem of recognizing n
-
D factor prime matrices. Some problems related to the factorization
methods are also

studied. Several examples are given to illustrate the results. The results presented
in this paper are true over any coefficient field.

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

通讯作者地址
: Wang, MS,
Chinese Acad Sci, State Key Lab Informat Secur, Inst Software,
Beijing 100080, Peoples R China.

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

引用的参考文献数
: 27

被引频次
: 3

出版商
: IEEE
-
INST ELECTRICAL ELECTRONICS ENGINEERS INC

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


ISSN: 1549
-
8328

DOI: 10.1109/TCSI.2007.897720

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

ISO
来源文献出版物名称缩写
: IEEE Trans. Circuits Syst. I
-
Regul. Pap.

来源文献页码计数
: 8

学科类别
: Engineering, Electrical & Electronic

ISI
文献传递号
: 178YK


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

显示

35
条,共

56



作者
: Wu, WL (Wu, Wen
-
Ling); Zhang, WT (Zhang, Wen
-
Tao); Feng, DG (Feng, Deng
-
Guo)

标题
: Impossible differential cryptanalysis of reduced
-
round ARIA and Camellia

来源出版物
: JOURNAL OF COMPUTER

SCIENCE AND TECHNOLOGY, 22 (3): 449
-
456
MAY 2007

语言
: English

文献类型
: Article

作者关键词
: block cipher; ARIA; Camellia; data complexity; time complexity; impossible
differential cryptanalysis

KeyWords Plus: BLOCK CIPHERS; ATTACKS; AES

摘要
: This paper studies
the security of the block ciphers ARIA and Camellia against impossible
differential cryptanalysis. Our work improves the best impossible differential cryptanalysis of
ARIA and Camellia known so far. The designers of ARIA expected no
impossible differential
s
exist for 4
-
round ARIA. However, we found some nontrivial 4
-
round impossible differentials,
which may lead to a possible attack on 6
-
round ARIA. Moreover, we found some nontrivial
8
-
round impossible differentials for Camellia, whereas only 7
-
round imposs
ible differentials were
previously known. By using the 8
-
round impossible differentials, we presented an attack on
12
-
round Camellia without FL/FL
-
1 layers.

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

通讯作者地址
: Wu, WL, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing
100080, Peoples R China.

电子邮箱地址
: wwl@is.iscas.ac.cn; zhangwt@gucas.ac.cn;
feng@is..iscas.ac.cn

引用的参考文献数
: 28

被引频次
: 2

出版商
: 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.

来源文献页码计数
: 8

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

ISI
文献传递号
: 176IJ


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

显示

36
条,共

56



作者
: Huang, XL (Huang, Xiao
-
Li); Wu, CK (Wu, Chuan
-
Kun
)

标题
: Cryptanalysis of Achterbahn
-
Version 1 and
-
Version 2

来源出版物
: JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 22 (3): 469
-
475
MAY 2007

语言
: English

文献类型
: Article

作者关键词
: cryptology; cryptanalysis; distinguishing attack; stream cipher; Achterbahn;
eSTREA
M

KeyWords Plus: STREAM CIPHERS; KEYSTREAM GENERATORS; CORRELATION
ATTACKS; ALGEBRAIC ATTACKS; LINEAR FEEDBACK

摘要
: Achterbahn is one of the candidate stream ciphers submitted to the eSTREAM, which is the
ECRYPT Stream Cipher Project. The cipher Achterbah
n uses a new structure which is based on
several nonlinear feedback shift registers (NLFSR) and a nonlinear combi
ning output Boolean
function. This paper proposes distinguishing attacks on Achterbahn
-
Version 1 and
-
Version 2 on
the reduced mode and the ful
l mode. These distinguishing attacks are based on linear
approximations of the output functions. On the basis of these linear approximations and the
periods of the registers, parity checks with noticeable biases are found. Then distinguishing
attacks can b
e achieved through these biased parity checks. As to Achterbahn
-
Version 1, three
cases that the output function has three possibilities are analyzed. Achterbahn
-
Version 2, the
modification version of Achterbahn
-
Version 1, is designed to avert attacks based

on
approximations of the output Boolean function. Our attack with even much lower complexities on
Achterbahn
-
Version 2 shows that Achterbahn
-
Version 2 cannot prevent attacks based on linear
approximations.

地址
: Chinese Acad Sci, Inst Software, State Key L
ab Informat Secur, Beijing 100080, Peoples R
China; Grad Univ, Chinese Acad Sci, Beijing 100039, Peoples R China

通讯作者地址
: Huang, XL, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur,
Beijing 100080, Peoples R China.

电子邮箱地址
: huangxiaoli@is.isc
as.ac.cn; ckwu@is.iscas.ac.cn

引用的参考文献数
: 24

被引频次
: 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.

来源文献页码
计数
: 7

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

ISI
文献传递号
: 176IJ


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

显示

37
条,共

56



作者
: Abbasi, BH (Abbasi, Bilal Haider); Ahmed
, K (Ahmed, Khalique); Khalique, F (Khalique,
Feeroza); Ayub, N (Ayub, Najma); Liu, HJ (Liu, Hai Jun); Kazmi, SAR (Kazmi, Syed Asad Raza);
Aftab, MN (Aftab, Muhammad Nauman)

标题
: Rearing the cotton bollworm, Helicoverpa armigera, on a tapioca
-
based artific
ial diet

来源出版物
: JOURNAL OF INSECT SCIENCE, 7: Art. No. 35 MAY 23 2007

语言
: English

文献类型
: Article

作者关键词
: diet cost efficiency; life history; Manihot esculenta

KeyWords Plus: MACROLOPHUS
-
CALIGINOSUS; LIFE
-
HISTORY; LEPIDOPTERA;
NOCTUIDAE; TEMPERATURE; FEC
UNDITY; ECOLOGY

摘要
: The impact of a tapioca
-
based artificial diet on the developmental rate, life history
parameters, and fertility was examined over five consecutive generations for the cotton bollworm,
Helicoverpa armigera Hubner (Lepidoptera: Noctuidae
), a highly polyp
hagous pest of many
agricultural crops. The study showed that when fed the tapioca
-
based artificial diet during larval
stage, larval and pupal developmental period, percent pupating, pupal weight, emergence rate of
male and female, longevi
ty, fecundity and hatching were non
-
significantly different than that of
the control agar
-
based artificial diet. Moreover, the cost to rear on tapioca
-
based diet approached
2.13 times less than the cost of rearing on the agar
-
based artificial diet. These r
esults demonstrate
the effectiveness and potential cost savings of the tapioca
-
based artificial diet for rearing H.
armigera.

地址
: Grad Univ, Chinese Acad Sci, Natl Key Lab Biochem Engn, Inst Proc Engn, Beijing
100080, Peoples R China; Quaid I Azam Univ, D
ept Biol Sci, Islamabad 45320, Pakistan; NARC,
Pulses Program, Crop Sci Inst, Islamabad, Pakistan; Beijing Forestry Univ, Coll
Biol Sci &
Biotechnol, Beijing 100083, Peoples R China; Grad Univ, Chinese Acad Sci, State Key Lab Comp
Sci, Inst Software, Beiji
ng 100080, Peoples R China; Grad Univ, Chinese Acad Sci, Bioinformat
Lab, Inst Biophys, Beijing 100101, Peoples R China; Grad Univ, Chinese Acad Sci, Natl Lab
Biomacromol, Inst Biophys, Beijing 100101, Peoples R China

通讯作者地址
: Abbasi, BH, Grad Univ, Chines
e Acad Sci, Natl Key Lab Biochem Engn, Inst
Proc Engn, Beijing 100080, Peoples R China.

电子邮箱地址
: chinabilal@yahoo.com

引用的参考文献数
: 27

被引频次
: 1

出版商
: UNIV ARIZONA

出版商地址
: LIBRARY C327, TUCSON, AZ 85721 USA

ISSN: 1536
-
2442

文献编号
: 35

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

SCI

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

来源文献页码计数
: 7

学科类别
: Entomology

ISI
文献传递号
: 171KY


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

显示

38
条,共

56



作者
: Wang, XY (Wang, Xiang
-
Yun); Zhang, WH (Zhang, Wenhui); Li, YC (Li,
Yong
-
Chao); Cai,
KY (Cai, Kai
-
Yuan)

标题
: A polynomial dynamic system approach to software design for attractivity requirement

来源出版物
: INFORMATION SCIENCES, 177 (13): 2712
-
2725 JUL 1 2007

语言
: English

文献类型
: Article

作者关键词
: reactive software; discrete event

dynamic systems; supervisory control theory;
polynomial dynamic systems; software cybernetics

KeyWords Plus: DISCRETE
-
EVENT SYSTEMS; SELF
-
ADAPTIVE SOFTWARE;
SUPERVISORY CONTROL; REACTIVE SYSTEMS; CYBERNETICS; CONTEXT

摘要
: Because of the widespread increa
sing application of Web services and autonomic
computing, self
-
adaptive software is an area gaining increasing importance. Control theory
provides a theoretical foundation for self
-
adaptive software. In this paper, we pr
opose the use of
the supervisory con
trol theory of discrete event dynamic systems (DEDS) to provide a rigorous
foundation for designing software for reactive systems. This paper focuses in particular on design
of software with an attractivity requirement. It studies this problem using the po
lynomial dynamic
system (PDS) model of DEDS. A necessary and sufficient condition for software existence and
two algorithms for such software design are presented. (C) 2007 Elsevier Inc. All rights reserved.

地址
: Beijing Univ Aeronaut & Astronaut, Dept Aut
omat Control, Beijing 100083, Peoples R
China; Chinese Acad Sci, Inst Software, LCS, Beijing 100080, Peoples R China

通讯作者地址
: Wang, XY, Beijing Univ Aeronaut & Astronaut, Dept Automat Control, Beijing
100083, Peoples R China.

电子邮箱地址
: wangxy
-
18@sohu.com


用的参考文献数
: 31

被引频次
: 1

出版商
: ELSEVIER SCIENCE INC

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

ISSN: 0020
-
0255

DOI: 10.1016/j.ins.2007.01.025

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

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

来源文献页码计数
: 14

学科类别
: Computer Science, In
formation Systems

ISI
文献传递号
: 171NC


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

显示

39
条,共

56



作者
: Haiming, C (Haiming, Chen); Ishdorj, TO (Ishdorj, Tseren
-
Onolt); Paun, G (Paun,
Gheorghe)

标题
: Computing along the ax
on

来源出版物
: PROGRESS IN NATURAL SCIENCE, 17 (4): 417
-
423 APR 2007

语言
: English

文献类型
: Proceedings Paper

会议标题
: 1st International Conference Bio
-
Inspired Computing
-
Theory and Applications

会议日期
: SEP 18
-
22, 2006

会议地点
: Wuhan, PEOPLES R CHINA

作者关键词
: membrane

computing; spiking neural P systems; Chomsky hierarchy

摘要
: A special form of spiking neural P systems, called axon P systems, corresponding to the
activity of Ranvier nodes of neuron axon, is considered and a class of SN
-
like P systems where the
computat
ion is done along the axon is introduced and their langua
ge generative power is
investigated.

地址
: Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100080, Peoples R China; Univ
Seville, Dept CS & AI, Res Grp Nat Comp, E
-
41012 Seville, Spain; Romania
n Acad, Inst Math,
Bucharest 014700, Romania

通讯作者地址
: Haiming, C, Chinese Acad Sci, Comp Sci Lab, Inst Software, Beijing 100080,
Peoples R China.

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

引用的参考文献数
: 7

被引频次
: 0

出版商
: TAYLOR & FRANCIS LTD

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

ISSN: 1002
-
0071

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

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

来源文献页码计数
: 7

学科类别
: Multidisciplinary Sciences

ISI
文献传递号
: 174FS


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

显示

40
条,共

56



作者
: Zhang, XW (Zhang, Xi
-
wen); Lyu, MR (Lyu, Michael R.); Dai, GZ (Dai, Guo
-
zhong)

标题
: Extraction and segmentation of tables from Chinese ink documents based on a matrix model

来源出版物
: PATTERN RECOGNITION, 40 (7): 1855
-
1867 JUL 2007



: English

文献类型
: Article

作者关键词
: Chinese ink document; digital ink; handwriting; table extraction; table segmentation

KeyWords Plus: PERFORMANCE EVALUATION; RECOGNITION; IMAGES

摘要
: This paper presents an approach for extracting and segmenting tables fro
m Chinese ink
documents based on a matrix model. An ink document is first modeled as a matrix containing ink
rows, including writing and drawing ones. Each row consists of collinea
r ink lines containing ink
characters. Together with their associated drawin
g rows, adjacent writing rows having an identical
distribution of writing lines and
\
or the same associated drawing rows if available are extracted to
form a table. Row and column headers, nested sub
-
headers and cells are identified. Experiments
demonstrate

that the proposed approach is more effective and robust. (c) 2007 Published by
Elsevier Ltd on behalf of Pattern Recognition Society.

地址
: Chinese Acad Sci, Lab Human Comp Interact & Intelligent Informat Pr, Inst Software,
Beijing 100080, Peoples R China;

Chinese Univ Hong Kong, Dept Comp Sci & Engn, Shatin,
Hong Kong, Peoples R China

通讯作者地址
: Zhang, XW, Chinese Acad Sci, Lab Human Comp Interact, Inst Software, Beijing
100080, Peoples R China.

电子邮箱地址
: zxw19@hotmail.com

引用的参考文献数
: 24

被引频次
: 0

出版商
: PERGAMO
N
-
ELSEVIER SCIENCE LTD

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

ISSN: 0031
-
3203

DOI: 10.1016/j.patcog.2006.05.029

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

ISO
来源文献出版物名称缩写
: Pattern Recognit.

来源文献页码计数
: 13

学科类别
: Computer Science, Art
ificial Intelligence; Engineering, Electrical & Electronic

ISI
文献传递号
: 165UV


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

显示

41
条,共

56



作者
: Wang, HB (Wang Hongbing); Fan, ZH (Fan Zhihua); She, CD (She Chundong)

标题
:
Formal specification of role assignment for open multi agent system

来源出版物
: CHINESE JOURNAL OF ELECTRONICS, 16 (2): 212
-
216 APR 2007

语言
: English

文献类型
: Article

作者关键词
: open multi agent system; dynamic role assignment; Object
-
Z; formal specification

摘要
: T
he model of dynamic role assignment for open multi agent system is proposed. The basic
idea is to introduce a special agent to be responsible for assigning toles to agents. The formal
specification of role assignment using Object
-
Z is then presented.
Final
ly, the specification of role
assignment for a software team is developed on the formal basis.

地址
: Chinese Acad Sci, Gen Software Lab, Inst Software, Beijing 100080, Peoples R China

通讯作者地址
: Wang, HB, Chinese Acad Sci, Gen Software Lab, Inst Software, Bei
jing 100080,
Peoples R China.

电子邮箱地址
: wawahohobibi@163.com

引用的参考文献数
: 9

被引频次
: 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.

来源文献页码计数
: 5

学科类别
: Engineering, Electrical & Electronic

ISI
文献传递号
: 160TL


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

显示

42
条,共

56



作者
: Chen, ZX (Che
n Zhixiong); Lu, MX (Lu Mingxin); Xiao, GZ (Xiao Guozhen)

标题
: Distribution and nonlinear complexity of linear congruential generators over elliptic curves

来源出版物
: CHINESE JOURNAL OF ELECTRONICS, 16 (2): 263
-
266 APR 2007

语言
: English

文献类型
: Article

作者关键词
:

elliptic curves; exponential sums; linear congruential generators; discrepancy;
nonlinear complexity

KeyWords Plus: REINGOLD PSEUDORANDOM FUNCTION; MULTIDIMENSIONAL
DISTRIBUTION; EXPONENTIAL
-
SUMS; NUMBERS; PARTS

摘要
: Elliptic curve analogue of pseudo
-
ran
dom number generator is an attractive alternative to
the classical method for pseudo
-
random sequences or number generation. We present nontrivial
bounds on the discrepancy of sequences of linear congruential generat
ors over elliptic curves in
parts of the
period. The proof is based on some estimation for exponential sums along elliptic
curves. And we also present a lower bound on the nonlinear complexity profile of such sequences.

地址
: Putian Univ, Dept Math, Fujian 351100, Peoples R China; Nanjing Univ, De
pt Informat
Management, Nanjing 210093, Peoples R China; Chinese Acad Sci, Inst Software, State Key Lab
Informat Secur, Beijing 100049, Peoples R China

通讯作者地址
: Chen, ZX, Putian Univ, Dept Math, Fujian 351100, Peoples R China.

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

引用的参考
文献数
: 20

被引频次
: 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.

来源文献页码计数
: 4

学科类别
: Engineering, Electrical & Electronic

ISI
文献传递号
: 160TL


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

显示

43
条,共

56



作者
: Li, SM (Li, Shaoming); Yin, Q (Yin, Qian); Guo, P (Guo, Ping); Lyu, MR (Lyu, M
ichael R.)

标题
: A hierarchical mixture model for software reliability prediction

来源出版物
: APPLIED MATHEMATICS AND COMPUTATION, 185 (2): 1120
-
1130 FEB 15
2007

语言
: English

文献类型
: Proceedings Paper

会议标题
: International Conference on Intelligent Computing

会议日

: AUG 23
-
26, 2005

会议地点
: Hefei, PEOPLES R CHINA

会议赞助商
: Inst Intelligent Machines.; Univ Sci & Technol.; IEEE Computat Intelligence Soc.;
IEEE Hong Kong Computat Intelligence Chapter.

作者关键词
: software reliability model; HME; EM algorithm; prediction

摘要
:
It is important to develop general prediction models in current software reliability research.
In this paper, we propose a hierarchical mixture of software reliability models (HMSRM) for
software reliability prediction. This is an application of the hi
erar
chical mixtures of experts (HME)
architecture. In HMSRM, individual software reliability models are used as experts. During the
training of HMSRM, an Expectation
-
Maximizing (EM) algorithm is employed to estimate the
parameters of the model. Experiments ill
ustrate that our approach performs quite well in the later
stages of software development, and better than single classical software reliability models. We
show that the method can automatically select the most appropriate lower
-
level model for the data
an
d performances are well in prediction. (c) 2006 Elsevier Inc. All rights reserved.

地址
: Beijing Normal Univ, Dept Comp Sci, Beijing 100875, Peoples R China; Chinese Acad Sci,
Inst Software, Lab Comp Sci, Beijing 100080, Peoples R China; Chinese Univ Hong K
ong, Dept
Comp Sci & Engn, Shatin, Hong Kong, Peoples R China

通讯作者地址
: Guo, P, Beijing Normal Univ, Dept Comp Sci, Beijing 100875, Peoples R China.

电子邮箱地址
: pguo@ieee.org; lyu@cse.cuhk.edu.hk

引用的参考文献数
: 13

被引频次
: 3

出版商
: ELSEVIER SCIENCE INC

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

ISSN: 0096
-
3003

DOI: 10.1016/j.amc.2006.07.028

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

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

来源文献页码计数
: 11

学科类别
: Mathematics, Applied

ISI
文献传递号
: 158AI


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

显示

44
条,共

56



作者
: Hu, ZY (Hu ZhenYu); Lin, DD (Lin DongDai); Wu, WL (Wu WenLing); Feng, DG (Feng
DengGuo)

标题
: Constructing parallel long
-
message signcryption scheme from trapdoor permutation

来源出版物
: SCI
ENCE IN CHINA SERIES F
-
INFORMATION SCIENCES, 50 (1): 82
-
98 FEB
2007

语言
: English

文献类型
: Article

作者关键词
: authenticated encryption; signcryption; trapdoor permutations; parallel

KeyWords Plus: SECURITY

摘要
: A highly practical parallel signcryption scheme na
med PLSC from trapdoor permutations
(TDPs for short) was built to perform long messages directly. The new scheme follows the idea
"scramble all, and encrypt small", using some scrambling operation on me
ssage m along with the
user's identities, and then pas
sing, in parallel, small parts of the scrambling result through
corresponding TDPs. This design enables the scheme to flexibly perform long messages of
arbitrary length while avoid repeatedly invoking TDP operations such as the CBC mode, or
verbosely black
-
box composing symmetric encryption and signcryption, resulting in noticeable
practical savings in both message bandwidth and efficiency. Concretely, the signcryption scheme
requires exactly one computation of the "receiver's TDP" (for "encryption") and on
e inverse
computation of the "sender's TDP" (for "authentication"), which is of great practical significance
in directly performing long messages, since the major bottleneck for many public encryption
schemes is the excessive computational overhead of perf
orming TDP operations. Cutting out the
verbosely repeated padding, the newly proposed scheme is more efficient than a black
-
box hybrid
scheme. Most importantly, the proposed scheme has been proven to be tightly semantically secure
under adaptive chosen cip
hertext attacks (IND
-
CCA2) and to provide integrity of ciphertext
(INT
-
CTXT) as well as non
-
repudiation in the random oracle model. All of these security
guarantees are provided in the full multi
-
user, insider
-
security setting. Moreover, though the
scheme
is designed to perform long messages, it may also be appropriate for settings where it is
impractical to perform large block of messages (i.e. extremely low memory environments such as
smart cards).

地址
: Chinese Acad Sci, Inst Software, State Key Lab Infor
mat Secur, Beijing 100080, Peoples R
China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China

通讯作者地址
: Hu, ZY, Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing
100080, Peoples R China.

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

引用的参考文献数
: 19

被引频次
: 0

出版商
: SCIENCE CHINA PRESS

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

ISSN: 1009
-
2757

DOI: 10.1007/S11432
-
007
-
2018
-
X

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

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

来源文献页码计数
: 17

学科类别
:
Computer Science, Information Systems

ISI
文献传递号
: 156HV


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

显示

45
条,共

56



作者
: Liu, Q (Liu, Qiang); Huang, T (Huang, Tao); Liu, SH (Liu, Shao
-
Hua); Zhong, H (Zhong,
Hua)

标题
: A
n ontology
-
based approach for semantic conflict resolution in database integration

来源出版物
: JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 22 (2): 218
-
227
MAR 2007

语言
: English

文献类型
: Article

作者关键词
: database integration; semantic conflict resolution; ontology
; RDF; OWL

摘要
: An important task in database integration is to resolve data conflicts, on both schema
-
level
and semantic
-
level. Especially difficult the latter is. Some existing ontology
-
based approaches
have been criticized for their lack of domain gener
ality and se
mantic richness. With the aim to
overcome these limitations, this paper introduces a systematic approach for detecting and
resolving various semantic conflicts in heterogeneous databases, which includes two important
parts: a semantic conflict
representation model based on our classification framework of semantic
conflicts, and a methodology for detecting and resolving semantic conflicts based on this model.
The system has been developed, experimental evaluations on which indicate that this appr
oach can
resolve much of the semantic conflicts effectively, and keep independent of domains and
integration patterns.

地址
: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Chinese Acad Sci, Grad
Sch, Beijing 100080, Peoples R China

通讯作者地

: Liu, Q, Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.

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

引用的参考文献数
: 17

被引频次
: 1

出版商
: 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.

来源文献页码计数
: 10

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

ISI
文献传递号
: 152PS


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

显示

46
条,共

56



作者
: Wu, EH (Wu, Enhua); Zhu, HB (Zhu, Hongbin); Liu, XH (Liu, Xuehui); Liu, YQ (Liu,
Youquan)

标题
: Simulation and interaction of fluid dynamics

来源出版物
: VISUAL COMPUTER, 23 (5): 299
-
308 MAY 2007

语言
: English

文献类型
: Proce
edings Paper

会议标题
: International Conference on Cyberworlds (CW 2006)

会议日期
: NOV 28
-
29, 2006

会议地点
: Lausanne, SWITZERLAND

会议赞助商
: EPFL.; VRlab.

作者关键词
: physically based simulation; graphics processing unit; fluid; mixture; interaction

KeyWords Plus: ANIMA
TION; LIQUIDS; MESHES; FLOW

摘要
: In the fluid simulation, the fluids and their surroundings may greatly change properties such
as shape and temperature simultaneously, and different surroundings would characterize different
interactions, which would change

the shape and motion of the
fluids in different ways. On the
other hand, interactions among fluid mixtures of different kinds would generate more
comprehensive behavior. To investigate the interaction behavior in physically based simulation of
fluids, it
is of importance to build physically correct models to represent the varying interactions
between fluids and the environments, as well as interactions among the mixtures. In this paper, we
will make a simple review of the interactions, and focus on those m
ost interesting to us, and model
them with various physical solutions. In particular, more detail will be given on the simulation of
miscible and immiscible binary mixtures. In some of the methods, it is advantageous to be taken
with the graphics processin
g unit (GPU) to achieve real
-
time computation for middle
-
scale
simulation.

地址
: Univ Macau, FST, Dept Comp & Informat Sci, Macao, Peoples R China; Chinese Acad Sci,
Inst Software, State Key Lab Comp Sci, Beijing 100864, Peoples R China; Chinese Acad Sci,
G
rad Sch, Beijing 100864, Peoples R China; Rensselaer Polytech Inst, Dept Mec
h Aerosp & Nucl
Engn, New York, NY USA

通讯作者地址
: Wu, EH, Univ Macau, FST, Dept Comp & Informat Sci, Macao, Peoples R China.

电子邮箱地址
: ehwu@umac.mo; zhuhb@ios.ac.cn; lxh@ios.ac.cn; li
uy10@rpi.edu

引用的参考文献数
: 29

被引频次
: 1

出版商
: SPRINGER

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

ISSN: 0178
-
2789

DOI: 10.1007/s00371
-
007
-
0106
-
y

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

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

来源文献页码计数
: 10

学科类别
: Computer Science, So
ftware Engineering

ISI
文献传递号
: 154JS


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

显示

47
条,共

56



作者
: Tang, YF (Tang, Yifa); Cao, JW (Cao, Jianwen); Liu, XT (Liu, Xiangtao); Sun, YC (Sun,
Yuanchang)

标题
: Symplectic met
hods for the Ablowitz
-
Ladik discrete nonlinear Schrodinger equation

来源出版物
: JOURNAL OF PHYSICS A
-
MATHEMATICAL AND THEORETICAL, 40 (10):
2425
-
2437 MAR 9 2007

语言
: English

文献类型
: Article

KeyWords Plus: HAMILTONIAN
-
SYSTEMS

摘要
: Using several kinds of coordin
ate transformations, we standardize the noncanonical
symplectic structure of the Ablowitz
-

Ladik model ( A
-

L model) of nonlinear Schrodinger
equation (NLSE), then we employ some symplectic scheme to simulate the soliton
s motion and
test the evolution of

the discrete invariants of the A
-

L model and also the conserved quantities of
the original NLSE. In comparison with a higher order non
-
symplectic scheme applied directly to
the A
-

L model, we show the overwhelming superiorities of the symplectic method
. We also
compare the implementation of the same symplectic scheme to different standardized Hamiltonian
systems resulting from different coordinate transformations, and show that the symmetric
coordinate transformation improves the numerical results obtai
ned via the asymmetric one, in
preserving the invariants of the A
-

L model and the original NLSE.

地址
: Chinese Acad Sci, Acad Math & Syst Sci, LSEC, ICMSEC, Beijing 100080, Peoples R
China; Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China;

Chinese Acad Sci,
Grad Sch, Beijing 100080, Peoples R China

通讯作者地址
: Tang, YF, Chinese Acad Sci, Acad Math & Syst Sci, LSEC, ICMSEC, POB 2719,
Beijing 100080, Peoples R China.

电子邮箱地址
: tyf@lsec.cc.ac.cn

引用的参考文献数
: 19

被引频次
: 5

出版商
: IOP PUBLISHING LTD

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

ISSN: 1751
-
8113

DOI: 10.1088/1751
-
8113/40/10/012

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

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

来源文献页码计数
: 13

学科类别
: Physics, Multidisciplinary; Physics, Mathematical


ISI
文献传递号
: 147WM


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

显示

48
条,共

56



作者
: Wu, ZL (Wu, Zhilin)

标题
: A note on the characterization of TL[EF]

来源出版物
: INFORMATION PROCESSING LETTERS, 102 (2
-
3): 48
-
54 APR 30 2007


语言
: English

文献类型
: Article

作 者 关 键 词
: formal languages; branching
-
time temporal logic; tree languages;
Ehrenfeucht
-
Fraisse game

KeyWords Plus: TEMPORAL PROPERTIES

摘要
: In this note, we give a new proof for Bojanczyk and Walukiewicz's effective
characteriza
tion of TL[EF] (the fragments of Computation Tree Logic (CTL), with EF modality
only) following the Ehrenfeucht
-
Fraisse game approach. Then, we extend the proof to
the
effective characterization of TL[EFns] (F
-
ns is the non
-
strict "future" temporal operato
r, while F is
the strict one). (c) 2006 Elsevier B.V. All rights reserved.

地址
: Chinese Acad Sci, Inst Software, Lab Comp Sci, Beijing 100080, Peoples R China; Chinese
Acad Sci, Grad Sch, Beijing 100049, Peoples R China

通讯作者地址
: Wu, ZL, Chinese Acad Sci, I
nst Software, Lab Comp Sci, POB 8718, Beijing
100080, Peoples R China.

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

引用的参考文献数
: 8

被引频次
: 1

出版商
: ELSEVIER SCIENCE BV

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

ISSN: 0020
-
0190

DOI: 10.1016/j.ipl.2006.11.012

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

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

来源文献页码计数
: 7

学科类别
: Computer Science, Information Systems

ISI
文献传递号
: 147HN


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

显示

49
条,共

56



作者
: Ma, YL (Ma, Yingl
ong); Jin, BH (Jin, Beihong); Feng, YL (Feng, Yulin)

标题
: Dynamic evolutions based on ontologies

来源出版物
: KNOWLEDGE
-
BASED SYSTEMS, 20 (1): 98
-
109 FEB 2007

语言
: English

文献类型
: Article

作者关键词
: semantic web; ontology; description logic; ontology evolution

Key
Words Plus: SEMANTIC WEB; LANGUAGE

摘要
: With the continuous changes in application requirements of the enterprises, Web resources
must be updated, so do the underlying ontologies that are associated with the Web resources. In
the situation, it is very chal
lenging for ontological engineers to

specify the changes of ontologies,
keep their consistencies and achieve semantic query of Web resources based on the evolving
ontologies. We propose a construct called Prioritized Knowledge Base (PKB) based on SHOQ(D)
d
escription logic, and discuss some properties of PKB. PKB can be used for describing the
evolutions and updates of ontologies with conflicting information. Furthermore, we develop some
algorithms for checking conflict rules and performing semantic query ba
sed on PKB. (c) 2006
Elsevier B.V. All rights reserved.

地址
: N China Elect Power Univ, Sch Comp Sci & Technol, Beijing 102206, Peoples R China;
Chinese Acad Sci, Inst Software, Technol Ctr Software Engn, Beijing 100080, Peoples R China

通讯作者地址
: Ma, YL, N C
hina Elect Power Univ, Sch Comp Sci & Technol, Beijing 102206,
Peoples R China.

电子邮箱地址
: m_y_long@otcaix.iscas.ac.cn; jbh@otcaix.iscas.ac.cn; feng@otcaix.iscas.ac.cn

引用的参考文献数
: 31

被引频次
: 0

出版商
: ELSEVIER SCIENCE BV

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

ISSN: 0950
-
7051

DOI: 10.1016/j.knosys.2006.04.017

29
字符的来源出版物名称缩写
: KNOWL
-
BASED SYST

ISO
来源文献出版物名称缩写
: Knowledge
-
Based Syst.

来源文献页码计数
: 12

学科类别
: Computer Science, Artificial Intelligence

ISI
文献传递号
: 138ST


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

显示

50
条,共

56



作者
: Chen, HM (Chen, Haiming); Ionescu, M (Ionescu, Mihai); Perez
-
Jimenez, MJ
(Perez
-
Jimenez, Mario J.); Freund, R (Freund, Rudolf); Paun, G (Paun, Gheorghe)

标题
: On string languages generated by
spiking neural P systems

来源出版物
: FUNDAMENTA INFORMATICAE, 75 (1
-
4): 141
-
162 JAN 2007

语言
: English

文献类型
: Article

作者关键词
: membrane computing; spiking neural P systems; Chomsky hierarchy

摘要
: We continue the study of spiking neural P systems by considering t
hese computing devices
as binary string generators: the set of spike trains of halting computations of a given system
constitutes the language generated by that system. Although the "dir
ect" generative capacity of
spiking neural P systems is rather restric
ted (some very simple languages cannot be generated in
this framework), regular languages are inverse
-
morphic images of languages of finite spiking
neural P systems, and recursively enumerable languages are projections of inverse
-
morphic
images of language
s generated by spiking neural P systems.

地址
: Romanian Acad, Math Inst, Bucharest 014700, Romania; Univ Seville, Dept Comp Sci &
AI, Seville 41012, Spain; Vienna Univ Technol, Fac Informat, A
-
1040 Vienna, Austria; Chinese
Acad Sci, Comp Sci Lab, Beijing 10
0080, Peoples R China; Rovira & Virgili Un
iv, Res Grp Math
Linguist, Tarragona 43005, Spain

通讯作者地址
: Paun, G, Romanian Acad, Math Inst, POB 1
-
764, Bucharest 014700, Romania.

电子邮箱地址
: chm@ios.ac.cn; armandmihai.ionescu@urv.net; marper@us.es; rudi@emcc.at;
g
eorge.paun@imar.ro

引用的参考文献数
: 17

被引频次
: 8

出版商
: IOS PRESS

出版商地址
: NIEUWE HEMWEG 6B, 1013 BG AMSTERDAM, NETHERLANDS

ISSN: 0169
-
2968

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

ISO
来源文献出版物名称缩写
: Fundam. Inform.

来源文献页码计数
: 22

学科类别
: Computer Science, Software Engineerin
g; Mathematics, Applied

ISI
文献传递号
: 139IV


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

显示

51
条,共

56



作者
: Sun, L (Sun Liang); Zhao, F (Zhao Fang); Wang, YJ (Wang Yongji)

标题
: DENCH: A density
-
based hierarchical cluste
ring algorithm for gene expression data

来源出版物
: CHINESE JOURNAL OF ELECTRONICS, 16 (1): 24
-
29 JAN 2007

语言
: English

文献类型
: Article

作者关键词
: gene expression data; cluster analysis; density
-
based clustering; hierarchical
framework; peak point; budding yeast S
accharomyces cerevisiae

摘要
: According to the characteristics of gene expression data, a density
-
based hierarchical
clustering algorithm called DENCH (DENsity
-
based hierarCHical clustering) is proposed. By
defining density for points, DENCH can find arbitr
ary
-
shaped clusters and f
ilter noises effectively.
Compared with traditional density
-
based clustering algorithms, DENCH provides both the local
view and the global view of the data distribution. Particularly, DENCH arranges the points in a
hierarchical fra
mework which overcomes the limit of the global density threshold in traditional
density
-
based clustering algorithms. The basic unit in the hierarchical framework is a set of points
rather than one point, which also makes DENCH robust to noises and outliers
. DENCH also
provides the mechanism to transform the hierarchical structure into directly divided clusters, and
clusters with different densities can be extracted in this way. Experimental results show that
DENCH outperforms many popular algorithms, includ
ing K
-
means, CAST, and some
model
-
based clustering algorithms.

地址
: Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China; Hong Kong Polytech
Univ, Dept Comp, Biometr Res Ctr, Hong Kong, Hong Kong, Peoples R China

通讯作者地址
: Sun, L, Chinese Acad S
ci, Inst Software, Beijing 100080, Peoples R China.

电子邮箱地址
: sun
-
liang@itechs.iscas.ac.cn

引用的参考文献数
: 8

被引频次
: 0

出版商
: TECHNOLOGY EXCHANGE LIMITED HONG KONG

出版商地址
: 26
-
28 AU PUI WAN ST, STE 1102, FO TAN INDUSTRIAL CENTRE, FO TAN,
SHATIN, 00000, PEOPLES R CH
INA

ISSN: 1022
-
4653

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

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

来源文献页码计数
: 6

学科类别
: Engineering, Electrical & Electronic

ISI
文献传递号
: 132SE


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

显示

52
条,共

56



作者
: Hu, ZY (Hu Zhenyu); Lin, DD (Lin Dongdai); Wu, WL (Wu Wenling); Feng, DG (Feng
Dengguo)

标题
: On the security of encrypt
-
and
-
MAC paradigm

来源出版物
: CHINESE JOURNAL OF ELECTRONICS, 16 (1): 45
-
50 JAN 2007

语言
: English

文献类型
: Article

作者关键词
: enc
ryption; authentication; authenticated encryption; secure shell (SSH)

摘要
: A security notion of Message authentication (MAC) named Tag
-
secrecy was abstracted
from the pseudo
-
randomness of tagging algorithm, to characterize the security that is very
differe
nt from the unforgeability (which is the traditional security notion of

MAC). The
Tag
-
secrecy is weaker than the pseudo
-
randomness and can be met by widely used authentication
schemes. Under the assumption of Tag
-
secrecy, it is showed that the Encryptand
-
M
AC can
preserve Indistinguishability under Chosen
-
plaintext attacks (IND
-
CPA) and Integrity of Plaintext
(INT
-
PTXT) in general.

A security notion of encryption called Un
-
trivial forgeability of Ciphertext (UTF
-
CTXT) was
presented to characterize that for a
ny given ciphertext C, the adversary cannot forge a new
ciphertext C' to decrypt to the same plaintext as C (named trivial forgery). This UTF
-
CTXT was to
guarantee that any modification about the ciphertext must correspond to some change of the
plaintext.
It is proved to be much weaker than Integrity of Ciphertext (INT
-
CTXT) and satisfied
by many popular encryption schemes and modes.

With a Tag
-
secrecy MAC and an UTF
-
CTXT
-
secure encryption, Encrypt
-
and
-
MAC can satisfy the
both strongest security requirement
s
-
Indistinguishability under Chosen
-
ciphertext attacks
(IND
-
CCA) and INT
-
CTXT.

地址
: Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R
China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China

通讯作者地址
: Hu, ZY,

Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing
100080, Peoples R China.

电子邮箱地址
: hu_zhyu@sina.com.cn

引用的参考文献数
: 10

被引频次
: 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.

来源文献页码计数
: 6

学科类别
: Engineering, Electrical & Electronic

ISI
文献传递号
: 132SE


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

显示

53
条,共

56



作者
: Wang, LM (Wang Liming); Wu, CK (Wu Chuankun)

标题
: Efficient selective
-
identity based multicast schemes without random oracles

来源出版物
: CHINESE JOURNAL OF ELECTRONICS, 16 (1): 151
-
154 JAN 2007

语言
: Englis
h

文献类型
: Article

作者关键词
: key management; multicast; bilinear pairing

KeyWords Plus: ENCRYPTION

摘要
: Multicast is an internet service that provides efficient data delivery from a source to
multiple receivers. It greatly reduces the network bandwidth requir
ements and the host devices
transmission overhead. This makes multicast an ideal technology for c
ommunication among a
large group of participants. Secure multicast communication involves many services including
teleconferencing, pay
-
TV and real
-
time delive
ry of stock quotes. One of the important challenges
for multicast communication is to design secure and efficient group key management. In this paper,
we propose two efficient selective
-
identity based multicast schemes. They have distinct
advantages over t
he existing schemes in the sense of dynamic group key management. Our
schemes satisfy forward secrecy and backward secrecy. Moreover, in our schemes, the member
can be stateless receiver, who does not need to update his/her state from session to session.

地址
: Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R
China; Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China

通讯作者地址
: Wang, LM, Chinese Acad Sci, State Key Lab Informat Secur, Inst Software,
Beijing 100080
, Peoples R China.

引用的参考文献数
: 17

被引频次
: 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.

来源文献页码计数
: 4

学科类别
: Engineering, Electrical & Electronic

ISI
文献传递号
: 132SE


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

显示

54
条,共

56



作者
: Hu, BC (Hu, Bessie C.); Wong, DS (Wong, Duncan S.); Z
hang, ZF (Zhang, Zhenfeng);
Deng, XT (Deng, Xiaotie)

标题
: Certificateless signature: a new security model and an improved generic construction

来源出版物
: DESIGNS CODES AND CRYPTOGRAPHY, 42 (2): 109
-
126 FEB 2007

语言
: English

文献类型
: Article

作者关键词
: certificatel
ess cryptography; certificateless signature

KeyWords Plus: SCHEMES; ATTACKS; PROOFS

摘要
: Certificateless cryptography involves a Key Generation Center (KGC) which issues a partial
key to a user and the user also independently generates an additional publi
c/secret key pair in such
a way that the KGC who knows only the partial key but not th
e additional secret key is not able to
do any cryptographic operation on behalf of the user; and a third party who replaces the
public/secret key pair but does not know t
he partial key cannot do any cryptographic operation as
the user either. We call this attack launched by the third party as the key replacement attack. In
ACISP 2004, Yum and Lee proposed a generic construction of digital signature schemes under the
framew
ork of certificateless cryptography. In this paper, we show that their generic construction is
insecure against key replacement attack. In particular, we give some concrete examples to show
that the security requirements of some building blocks they specif
ied are insufficient to support
some of their security claims. We then propose a modification of their scheme and show its
security in a new and simplified security model. We show that our simplified definition and
adversarial model not only capture all th
e distinct features of certificateless signature but are also
more versatile when compared with all the comparable ones. We believe that the model itself is of
independent interest. A conventional certificateless signature scheme only achieves Girault's Le
vel
2 security. For achieving Level 3 security, that a conventional signature scheme in Public Key
Infrastructure does, we propose an extension to our definition of certificateless signature scheme
and introduce an additional security model for this extens
ion. We show that our generic
construction satisfies Level 3 security after some appropriate and simple modification.

地址
: City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China; Chinese
Acad Sci, State Key Lab Informat Secur, Inst Softw
are, Beijing 100080, Peoples R China

通讯作者地址
: Hu, BC, City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong,
Peoples R China.

电子邮箱地址
: bessiehu@cs.cityu.edu.hk; duncan@cs.cityu.edu.hk; zfzhang@is.iscas.ac.cn;
deng@cs.cityu.edu.hk

引用的参考文献数
: 15

被引频次
: 9

出版商
: SPRINGER

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

ISSN: 0925
-
1022

DOI: 10.1007/s10623
-
006
-
9022
-
9

29
字符的来源出版物名称缩写
: DESIGNS CODES CRYPTOGR

ISO
来源文献出版物名称缩写
: Designs Codes Cryptogr.

来源文献页码计数
: 18

学科类别
: Computer Science, Theory
& Methods; Mathematics, Applied

ISI
文献传递号
: 131PB


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

显示

55
条,共

56



作者
: Wang, WX (Wang, W. X.); Ming, CY (Ming, C. Y.); Lo, SH (Lo, S. H.)

标题
: Generation of triangular mesh w
ith specified size by circle packing

来源出版物
: ADVANCES IN ENGINEERING SOFTWARE, 38 (2): 133
-
142 FEB 2007

语言
: English

文献类型
: Article

作者关键词
: mesh generation; circle packing; advancing front; specified size; boundary recovery;
parametric surface

KeyWords Pl
us: ADVANCING FRONT; NONOBTUSE TRIANGULATION; SURFACES;
NEIGHBORS; DOMAINS; SCHEME

摘要
: This paper describes an algorithm for the generation of a finite element mesh with a
specified element size over an unbound 2D domain using the advancing front circle p
acking
technique. Unlike the conventional frontal method, the procedure does not sta
rt from the object
boundary but starts from a convenient point within the open domain. As soon as a circle is added
to the generation front, triangular elements are directl
y generated by properly connecting frontal
segments with the centre of the new circle. Circles are packed closely and in contact with the
existing circles. by an iterative procedure according to the specified size control function. In
contrast to other mes
h generation schemes, the domain boundary is not considered in the process
of circle packing, this reduces a lot of geometrical checks for intersection between frontal
segments. If the mesh generation of a physical object is required, the object boundary c
an be
introduced. The boundary recovery procedure is fast and robust by tracing neighbours of
triangular elements. The finite element mesh generated by circle packing can also be used through
a mapping process to produce parametric surface meshes of the re
quired characteristics. The sizes
of circles in the pack are controlled by the principal surface curvatures. Five examples are given to
show the effectiveness and robustness of mesh generation and the application of circle packing to
mesh generation over c
urved surfaces. (C) 2006 Elsevier Ltd. All rights reserved.

地址
: Chinese Acad Sci, Inst Software, Intelligence Engn Lab, Beijing 100080, Peoples R China;
Univ Sci & Technol Beijing, Appl Sci Sch, Beijing 100083, Peoples R China; Univ Hong Kong,
Dept Civil
Engn, Hong Kong, Hong Kong, Peoples R China

通讯作者地址
: Wang, WX, Chinese Acad Sci, Inst Software, Intelligence Engn Lab, POB 8718,
Beijing 100080, Peoples R China.

电子邮箱地址
: wangweixin@hotmail.com

引用的参考文献数
: 18

被引频次
: 2

出版商
: ELSEVIER SCI LTD

出版商地址
: THE BOUL
EVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB,
OXON, ENGLAND

ISSN: 0965
-
9978

DOI: 10.1016/j.advengsoft.2006.04.006

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

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

来源文献页码计数
: 10

学科类别
: Computer Science, Interdisciplinary Applications
; Computer Science, Software
Engineering

ISI
文献传递号
: 116DJ


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

显示

56
条,共

56



作者
: Wang, JF (Wang, Junfeng); Li, L (Li, Lei); Zhou, MT (Zhou, Mingtian)

标题
: Topological dynamics

characterization for LEO satellite networks

来源出版物
: COMPUTER NETWORKS, 51 (1): 43
-
53 JAN 17 2007

语言
: English

文献类型
: Article

作者关键词
: low earth orbit (LEO); satellite networks; topological dynamics; snapshots
characterization

KeyWords Plus: ROUTING ALGORI
THM; IP NETWORKS; TCP; PERFORMANCE;
MANAGEMENT; LINKS

摘要
: The highly topological dynamics characterizes the most fundamental property of satellite
networks with respect to terrestrial ones. The manifest feature directs the researches on various
aspects of

satellite networks, including protocol architecture in
vestigations, routing protocol and
reliable transmission control protocol design and enhancement, etc. This paper systematically
quantifies the dynamical activities of regular low earth orbit (LEO) sat
ellite network topologies.
The number and length of network snapshots are formulated concisely. With this work, it
compensates for the simplified topological assumptions in many LEO satellite network related
researches. The thorough understanding of this b
asic feature not only provides for an accurate
quantification of network behavior for researchers on satellite network community, but also could
act as a guidance for future satellite constellation design and optimization. (c) 2006 Elsevier B.V.
All rights

reserved.

地址
: Sichuan Univ, Sch Comp Sci & Engn, Chengdu 610064, Peoples R China; Chinese Acad
Sci, Inst Software, Natl Key Lab Integrated Informat Syst Technol, Beijing 100080, Peoples R
China

通讯作者地址
: Wang, JF, Sichuan Univ, Sch Comp Sci & Engn, Chengd
u 610064, Peoples R
China.

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

引用的参考文献数
: 24

被引频次
: 5

出版商
: ELSEVIER SCIENCE BV

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

ISSN: 1389
-
1286

DOI: 10.1016/j.comnet.2006.04.010

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

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

来源文献页码计数
: 11

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

ISI
文献传递号
: 101CC