<RECORD 1> Accession number:20080311037818 Title:Agent based framework for emergency rescue and assistance planning Authors:Zheng, Yujun (1); Wang, Jinquan (1); Xue, Jinyun (2) Author affiliation:(1) Systems Engineering Institute of Engineer Equipment, Beijing 100093, China; (2) Institute of Software, Chinese Academy of Sciences, 100080 Beijing, China Corresponding author:Zheng, Y. (yujun.zheng@computer.org)

fancyfantasicΤεχνίτη Νοημοσύνη και Ρομποτική

7 Νοε 2013 (πριν από 4 χρόνια και 5 μέρες)

994 εμφανίσεις

<RECORD 1>

Accession number:20080311037818

Title:Agent based framework for emergency rescue and assistance planning

Authors:Zheng, Yujun (1); Wang, Jinquan (1); Xue, Jinyun (2)

Author affiliation:(1) Systems Engineering Institute of Engineer Equipment, Be
ijing 100093,
China; (2) Institute of Software, Chinese Academy of Sciences, 100080 Beijing, China

Corresponding author:Zheng, Y.




(yujun.zheng@computer.org)




Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Ar
tificial
Intelligence and Lecture Notes in Bioinformatics)

Abbreviated source title:Lect. Notes Comput. Sci.

Volume:4430 LNCS

Monograph title:Intelligence and Security Informatics
-

Pacific Asia Workshop, PAISI 2007,
Proceedings

Issue date:2007

Publication

year:2007

Pages:70
-
81

Language:English

ISSN:03029743

E
-
ISSN:16113349

ISBN
-
13:9783540715481

Document type:Conference article (CA)

Conference name:2007 Pacific Asia Workshop on Intelligence and Security Informatics, PAISI
2007

Conference date:April 11, 2007

-

April 12, 2007

Conference location:Chengdu, China

Conference code:71147

Publisher:Springer Verlag, Tiergartenstrasse 17, Heidelberg, D
-
69121, Germany

Abstract:Under the difficult circumstances such as catastrophic terrorism, emergency rescue and
assista
nce planning (ERAP) always involves complex sets of objectives and constraints. We
propose a multi
-
agent constraint programming framework which is aimed to tackling complex
operations problems during the emergency response processes. The framework employs
the
component
-
based agent model to support ERAP problem specification, solving,
composition/decomposition, feedback and dynamic control. A typical emergency response system
is composed of seven types of top
-
level agents, which are further composed of sub
-
a
gents at lower
levels of granularity. In particular, agents that play key roles in task control and problem solving
are based on asynchronous team (A
-
Team) in which sub
-
agents share a population and evolve an
optimized set of solutions. A case study is pre
sented to illustrate our approach. &copy;
Springer
-
Verlag Berlin Heidelberg 2007.

Number of references:21

Main heading:Multi agent systems

Controlled terms:Dynamic models
-

Dynamic programming
-

Large scale systems
-

Optimization
-

Problem solving

Uncontro
lled terms:Agent based framework
-

Assistance planning
-

Dynamic control
-

Emergency
rescue

Classification code:723.4 Artificial Intelligence
-

723.5 Computer Applications
-

921 Mathematics
-

921.5 Optimization Techniques
-

961 Systems Science

Treatment:Th
eoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 2>

Accession number:20072110613567

Title:Formal modeling and analysis of grid services

Authors:Zheng, Hong (1)

Author affiliation:(1) College of Infor
mation Science and Engineering, East China University of
Science and Technology, Shanghai 200237, China; (2) Institute of Software, Chinese Academy of
Sciences, Beijing 100080, China

Corresponding author:Zheng, H.

Source title:Journal of Computational Inf
ormation Systems

Abbreviated source title:J. Comput. Inf. Syst.

Volume:3

Issue:1

Issue date:February 2007

Publication year:2007

Pages:165
-
171

Language:English

ISSN:15539105

Document type:Journal article (JA)

Publisher:Binary Information Press, P.O. Box 162
, Bethel, CT 06801
-
0162, United States

Abstract:Grid computing is a complex undertaking as distributed applications. Grid services
provide for the controlled management in sophisticated distributed applications. But Grid services
do not contain integrated
formal descriptions and may be implemented in a variety of languages.
Petri nets are a powerful instrument for modeling, analyzing, and simulating dynamic systems
with concurrent and non
-
deterministic behavior. This paper introduces a high
-
level extended
c
olored Petri nets (ECPNs) to model the behaviors of Grid service interfaces provided by a formal
method on the basis of the ECPN. The results show the ECPN can model and represent explicitly
dynamic behavior of the functionality of the Grid service interfa
ce.

Number of references:13

Main heading:Grid computing

Controlled terms:Distributed computer systems
-

Dynamical systems
-

Formal methods
-

Petri nets

Uncontrolled terms:Extended colored Petri nets
-

Grid services

Classification code:722.4 Digital Compute
rs and Systems
-

723.5 Computer Applications
-

921.4
Combinatorial Mathematics, Includes Graph Theory, Set Theory

Treatment:Applications (APP)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 3>

Accession number:2007
2410652716

Title:Dynamic deployment problem and the algorithm of service component for pervasive
computing

Authors:Tang, Lei (1); Liao, Yuan (1); Li, Mingshu (1); Huai, Xiaoyong (1)

Author affiliation:(1) Laboratory for Internet Software Technologies, Ins
titute of Software,
Chinese Academy of Sciences, Beijing 100080, China; (2) Key Laboratory for Computer Science,
Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (3) Graduate
University, Chinese Academy of Sciences, Beijing 100049
, China

Corresponding author:Tang, L.




(tanglei@itechs.iscas.ac.cn)




Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development

Abbreviated source title:Jisuanji Yanjiu yu Fazhan

Volume:44

Issue:5

Issue date:May 2007

Publication yea
r:2007

Pages:815
-
822

Language:Chinese

ISSN:10001239

CODEN:JYYFEY

Document type:Journal article (JA)

Publisher:Science Press, 18,Shuangqing Street,Haidian, Beijing, 100085, China

Abstract:Due to resource limitation, the embedded devices connect with each ot
her through
network and share resources to provide flexible services in pervasive computing environment. In
order to reuse the component and reduce the software cost, the service components should be
composed to provide new service. Because the composite s
ervice can not run in one device, the
dynamic deployment problem of many service components for pervasive computing has become a
research focus. Based on Liquid
-
an embedded and component
-
based system, a dynamic
deployment problem and the algorithm of servi
ce component for pervasive computing are
presented. First, the service model is described and the problem of dynamic deployment in the
pervasive computing environment is defined. Second, according to the resource constraint
conditions and two deployment go
als of service component, the randomized algorithm and the
heuristic algorithm are given to solve the problem. Finally, the experiment data is given to analyze
and compare the performance of the different algorithms. According to the method, the service
co
mponents are deployed into the embedded devices to satisfy resource requirement and improve
the resource utilization. The algorithm simulation and analysis indicate that it can be applied to the
pervasive computing environment with more devices or service
components.

Number of references:12

Main heading:Ubiquitous computing

Controlled terms:Embedded systems
-

Heuristic algorithms
-

Quality of service

Uncontrolled terms:Algorithm simulation
-

Dynamic deployment
-

Embedded device
-

Pervasive
computing
-

Resou
rce requirement
-

Resource utilization
-

Service component
-

Service model
-

Software cost

Classification code:722.3 Data Communication, Equipment and Techniques
-

723.1 Computer
Programming
-

723.5 Computer Applications

Treatment:Theoretical (THR)

DOI:10.
1360/crad20070512

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 4>

Accession number:20080311025094

Title:On the complexity and approximation of the min
-
sum and min
-
max disjoint paths problems

Authors:Peng, Zhang (
1); Wenbo, Zhao (2)

Author affiliation:(1) State Key Laboratory of Computer Science, Institute of Software, Chinese
Academy of Sciences, P.O. Box 8718, Beijing, 100080, China; (2) Graduate University, Chinese
Academy of Sciences, Beijing, China

Correspon
ding author:Peng, Z.




(zhangpeng04@iscas.cn)




Source title:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics)

Abbreviated source title:Lect. Notes Comput. Sci.

Volum
e:4614 LNCS

Monograph title:Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
-

First
International Symposium, ESCAPE 2007, Revised Selected Papers

Issue date:2007

Publication year:2007

Pages:70
-
81

Language:English

ISSN:03029743

E
-
ISS
N:16113349

ISBN
-
13:9783540744498

Document type:Conference article (CA)

Conference name:1st International Symposium on Combinatorics, Algorithms, Probabilistic and
Experimental Methodologies, ESCAPE 2007

Conference date:April 7, 2007
-

April 9, 2007

Confere
nce location:Hangzhou, China

Conference code:71066

Publisher:Springer Verlag, Tiergartenstrasse 17, Heidelberg, D
-
69121, Germany

Abstract:Given a graph G = (V, E) and k source
-
sink pairs{(s<inf>1</inf>, t <inf>1</inf>),...,
(s<inf>k</inf>, t<inf>k</inf>)}
with each s<inf>i</inf>, t<inf>i</inf> &isin; V, the Min
-
Sum
Disjoint Paths problem asks k disjoint paths to connect all the source
-
sink pairs with minimized
total length, while the Min
-
Max Disjoint Paths problem asks also k disjoint paths to connect all
s
ource
-
sink pairs but with minimized length of the longest path. In this paper we show that the
weighted Min
-
Sum Disjoint Paths problem is FP <sup>NP</sup>
-
complete in general graph, and
the uniform Min
-
Sum Disjoint Paths and uniform Min
-
Max Disjoint Paths
problems can not be
approximated within &Omega;(m<sup>1
-
&Epsilon;</sup>) for any constant e &gt; 0 even in
planar graph if P &ne; NP, where m is the number of edges in G. Then we give at the first time a
simple bicriteria approximation algorithm for the un
iform Min
-
Max Edge
-
Disjoint Paths and the
weighted Min
-
Sum Edge
-
Disjoint Paths problems, with guaranteed performance ratio O(log k/ log
log k) and O(1) respectively. Our algorithm is based on randomized rounding. &copy;
Springer
-
Verlag Berlin Heidelberg 20
07.

Number of references:12

Main heading:Operations research

Controlled terms:Approximation theory
-

Graph theory
-

Optimization
-

Problem solving

Uncontrolled terms:Disjoint Paths problem
-

Min
-
Sum Disjoint Paths

Classification code:723.4 Artificial Intel
ligence
-

912.3 Operations Research
-

921.4
Combinatorial Mathematics, Includes Graph Theory, Set Theory
-

921.5 Optimization Techniques
-

921.6 Numerical Methods

Treatment:Theoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009

Elsevier Inc.


<RECORD 5>

Accession number:20072610681371

Title:On factor prime factorizations for n
-
D polynomial matrices

Authors:Wang, Mingsheng (1)

Author affiliation:(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Aca
demy of Sciences, Beijing 100080, China

Corresponding author:Wang, M.




(mingsheng_wang@yahoo.com.cn)




Source title:IEEE Transactions on Circuits and Systems I: Regular Papers

Abbreviated source title:IEEE Trans. Circuits Syst. Regul. Pap.

Volume:
54

Issue:6

Issue date:June 2007

Publication year:2007

Pages:1398
-
1405

Language:English

ISSN:10577122

Document type:Journal article (JA)

Publisher:Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331,
Piscataway, NJ 08855
-
13
31, United States

Abstract: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
-
p
roduct, 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. &copy; 2007 IEEE.

Number of references:27

Main heading:Factorization

Controlled terms:Algorithms
-

Matrix algebra
-

Poly
nomials

Uncontrolled terms:Factor prime matrix
-

Matrix factorization
-

Multidimensional system
-

Polynomial matrix
-

Polynomial ring

Classification code:921.1 Algebra
-

921.6 Numerical Methods

Treatment:Theoretical (THR)

DOI:10.1109/TCSI.2007.897720

Datab
ase:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 6>

Accession number:20074210876828

Title:Developing event
-
condition
-
action rules in real
-
time active database

Authors:Qiao, Ying (1); Zhong, Kang (1); Wang, Hongan (1); Li,

Xiang (1)

Author affiliation:(1) Intelligence Engineering Lab., Institute of Software, Chinese Academy of
Sciences, Zhong Guan Cun, Hai Dian District, Beijing 100080, China

Corresponding author:Qiao, Y.




(qiaoying@ios.cn)




Source title:Proceedi
ngs of the ACM Symposium on Applied Computing

Abbreviated source title:Proc ACM Symp Appl Computing

Monograph title:Proceedings of the 2007 ACM Symposium on Applied Computing

Issue date:2007

Publication year:2007

Pages:511
-
516

Language:English

ISBN
-
10:1595
934804

ISBN
-
13:9781595934802

Document type:Journal article (JA)

Conference name:2007 ACM Symposium on Applied Computing

Conference date:March 11, 2007
-

March 15, 2007

Conference location:Seoul, Korea, Republic of

Conference code:70408

Sponsor:ACM Special
Interest Group on Applied Computing

Publisher:Association for Computing Machinery, 1515 Broadway, 17th Floor, New York, NY
10036
-
5701, United States

Abstract:Traditional event
-
condition
-
action (ECA) rules in real
-
time active database (RTADB)
lack the capab
ilities to express complicated quantitative temporal information in the system. To
solve this problem, in this paper, we present graphical ECA rules with a set of novel temporal
events to specify real
-
time constraints. Smart home applications are used to v
alidate the proposed
rules. Copyright 2007 ACM.

Number of references:12

Main heading:Association rules

Controlled terms:Constraint theory
-

Database systems
-

Problem solving
-

Real time systems

Uncontrolled terms:Event
-
condition
-
action rules
-

Real
-
time a
ctive database
-

Smart home
applications

Classification code:722.4 Digital Computers and Systems
-

723.3 Database Systems
-

723.4
Artificial Intelligence
-

903.1 Information Sources and Analysis
-

961 Systems Science

Treatment:Theoretical (THR)

DOI:10.1145
/1244002.1244120

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 7>

Accession number:20070710418734

Title:DENCH: A density
-
based hierarchical clustering algorithm for gene expression data

Authors:Sun, Liang (1); Zha
o, Fang (2); Wang, Yongji (1)

Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China;
(2) Biometrics Research Center, Department of Computing, Hong Kong Polytechnic University,
Hong Kong, Hong Kong

Corresponding
author:Sun, L.




(sunliang@itechs.iscas.ac.cn)




Source title:Chinese Journal of Electronics

Abbreviated source title:Chin J Electron

Volume:16

Issue:1

Issue date:January 2007

Publication year:2007

Pages:24
-
29

Language:English

ISSN:10224653

CODEN:CH
JEEW

Document type:Journal article (JA)

Publisher:Chinese Institute of Electronics, P.O. Box 165, Beijing, 100036, China

Abstract:According to the characteristics of gene expression data, a density
-
based hierarchical
clustering algorithm called DENCH (DENs
ity
-
based hierarCHical clustering) is proposed. By
denning density for points, DENCH can find arbitrary
-
shaped clusters and filter 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 framework which overcomes the limit of the global density thresh
-
old in traditional
density
-
based clustering algorithms. The basic unit in the hierarchical fra
mework 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 ex
tracted in this way. Experimental results show that
DENCH outperforms many popular algorithms, including K
-
means, CAST, and some
model
-
based clustering algorithms.

Number of references:8

Main heading:Algorithms

Controlled terms:Data processing
-

Data struc
tures
-

Database systems
-

Hierarchical systems
-

Mathematical models

Uncontrolled terms:Budding yeast Saccharomyces cerevisiae
-

Cluster analysis
-

Density
-
based
clustering
-

Gene expression data
-

Hierarchical framework
-

Peak point

Classification code:7
23 Computer Software, Data Handling and Applications
-

723.2 Data
Processing and Image Processing
-

723.3 Database Systems
-

731.1 Control Systems
-

921
Mathematics

Treatment:Theoretical (THR); Experimental (EXP)

Database:Compendex

Compilation and indexing

terms, Copyright 2009 Elsevier Inc.


<RECORD 8>

Accession number:20073910831777

Title:Partition refinement in abstract model checking

Authors:Pu, Fei (1); Zhang, Wenhui (1)

Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Key La
boratory of
Computer Science, P.O.Box 8718, 100080 Beijing, China

Corresponding author:Pu, F.




(pufei@amss.ac.cn)




Source title:First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering,
TASE '07

Abbreviated source title:Firs
t Joint IEEE/IFIP Symp. Theor. Aspects Softw. Eng.

Monograph title:First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software
Engineering, TASE '07

Issue date:2007

Publication year:2007

Pages:209
-
218

Article number:4239965

Language:English

ISBN
-
10:
0769528562

ISBN
-
13:9780769528564

Document type:Conference article (CA)

Conference name:1st Joint IEEE/IFIP Symposium on Theoretical Aspects of Software
Engineering, TASE '07

Conference date:June 6, 2007
-

June 8, 2007

Conference location:Shanghai, China

Co
nference code:70262

Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane
-

P.O.Box 1331,
Piscataway, NJ 08855
-
1331, United States

Abstract:Model checking has been successfully applied to system verification. However, in model
checking, t
he state explosion problem occurs when one checks systems of industrial size.
Abstraction
-
based methods have been particularly successful in this regard. This paper describes a
technique to decompose a model checking problem into sub
-
problems by partitioni
ng the search
space. The partitioning is based on the usage of extra variables remembering the history of
non
-
deterministic choices in the model. Furthermore, the search space can be partitioned stepwise
in order to get better reduction. Finally, the parti
tion
-
refinement paradigm is extended to the
setting of abstract systems. We show how the partition
-
based approach used in abstract model
checking can improve the efficiency of verification with respect to the requirement of memory by
illustrating an applic
ation example. &copy; 2007 IEEE.

Number of references:22

Main heading:Model checking

Controlled terms:Abstracting
-

Data storage equipment
-

Mathematical models
-

Problem solving
-

Search engines

Uncontrolled terms:Partition refinement
-

Search space
-

Sta
te explosion problem
-

System
verification

Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming Theory
-

722.1 Data Storage, Equipment and Techniques
-

723.4 Artificial
Intelligence
-

903.1 Inform
ation Sources and Analysis
-

921 Mathematics

Treatment:Theoretical (THR)

DOI:10.1109/TASE.2007.36

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 9>

Accession number:20074210874202

Title:A Bayesian network based Qos

assessment model for web services

Authors:Guoquan, Wu (1); Jun, Wei (2); Xiaoqiang, Qiao (2); Lei, Li (1)

Author affiliation:(1) Department of Computer Science, University of Science and Technology of
China; (2) Institute of Software, Chinese Academy of
Sciences

Corresponding author:Guoquan, W.




(gqwu@otcaix.iscas.ac.cn)




Source title:Proceedings
-

2007 IEEE International Conference on Services Computing, SCC 2007

Abbreviated source title:Proc. IEEE Int. Conf. Serv. Comput.

Monograph title:Proce
edings
-

2007 IEEE International Conference on Services Computing, SCC
2007

Issue date:2007

Publication year:2007

Pages:498
-
505

Article number:4278696

Language:English

ISBN
-
10:0769529259

ISBN
-
13:9780769529257

Document type:Conference article (CA)

Conferenc
e name:2007 IEEE International Conference on Services Computing, SCC 2007

Conference date:July 9, 2007
-

July 13, 2007

Conference location:Salt Lake City, UT, United states

Conference code:70362

Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445

Hoes Lane
-

P.O.Box 1331,
Piscataway, NJ 08855
-
1331, United States

Abstract:Quality of Service (Qos) plays a key role in web services. In an open and volatile
environment, a provider may not deliver the Qos it declared. Hence, it's necessary to provide a
Qos assessment model to determine the likely behavior of a provider. Although many researches
have been done to develop models and techniques to assist users in Qos assessment, most of them
ignore various Qos requirements of users, which are great importan
t to evaluate a provider
adopting the policy based on service differentiation. In this paper, we propose an approach, called
Bayesian network based Qos assessment model, to Qos assessment. Through online learning, it
supports to update the corresponding Ba
yesian network dynamically. The salient feature of this
model is that it can correctly predict the provider's capability in various combinations of users '
Qos requirements, especially to the provider with different service levels. Experimental results
sho
w that the proposed Qos assessment model is effective. &copy; 2007 IEEE.

Number of references:16

Main heading:Bayesian networks

Controlled terms:Computer aided instruction
-

Learning systems
-

Mathematical models
-

Quality
of service
-

Web services

Uncontr
olled terms:Online learning
-

Qos assessment model

Classification code:723 Computer Software, Data Handling and Applications
-

723.5 Computer
Applications
-

731.5 Robotics
-

901.2 Education
-

903.4 Information Services
-

921.4
Combinatorial Mathematics, In
cludes Graph Theory, Set Theory

Treatment:Experimental (EXP)

DOI:10.1109/SCC.2007.1

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 10>

Accession number:20081811236073

Title:Self
-
adaptive evolutionary algorithm for
multispectral remote sensing image clustering

Authors:Chang, Dongxia (1); Zhang, Xianda (1); Zheng, Changwen (2)

Author affiliation:(1) Department of Automation, Tsinghua University, Beijing, 100084, China; (2)
National Key Lab. of Integrated Information
System Technology, Institute of Software, Chinese
Academy of Sciences, Beijing, 100080, China

Corresponding author:Chang, D.




(cdx05@mails.tsinghua.edu.cn)




Source title:Proceedings of SPIE
-

The International Society for Optical Engineering

Abbr
eviated source title:Proc SPIE Int Soc Opt Eng

Volume:6787

Monograph title:MIPPR 2007: Multispectral Image Processing

Issue date:2007

Publication year:2007

Article number:678702

Language:English

ISSN:0277786X

CODEN:PSISDG

ISBN
-
13:9780819469519

Document typ
e:Conference article (CA)

Conference name:MIPPR 2007: Multispectral Image Processing

Conference date:November 15, 2007
-

November 17, 2007

Conference location:Wuhan, China

Conference code:71950

Sponsor:State Key Lab. Multi
-
spectral Information Processing T
echnol.; Chinese Educ. Minist.
Key Lab. Image Process. Intell. Control; Huazhong University of Science and Technology; The
International Society for Optical Engineering (SPIE)

Publisher:SPIE, P.O. Box 10, Bellingham WA, WA 98227
-
0010, United States

Abstrac
t:In this paper, a self
-
adaptive evolutionary clustering algorithm is presented. This
algorithm uses the evolutionary programming (EP) to search the optimal clustering and bases on
the principles of the K
-
means algorithm. The proposed self
-
adaptive evoluti
onary (SAEP)
clustering algorithm self
-
adapts the vector of the step size appropriate for each parent. This is
different from other genetic
-
based algorithms. The algorithm can minimize the degeneracy in the
evolutionary process. The experimental results sh
ow that the KSAE clustering algorithm is
efficient in the unsupervised classification of the multispectral remote sensing image.

Number of references:14

Main heading:Image analysis

Controlled terms:Adaptive algorithms
-

Clustering algorithms
-

Genetic algo
rithms
-

Multispectral
scanners
-

Remote sensing

Uncontrolled terms:K means algorithms
-

Multispectral
-

Remote sensing images
-

Self adapts

Classification code:723 Computer Software, Data Handling and Applications
-

731.1 Control
Systems
-

741 Light, Opti
cs and Optical Devices
-

741.3 Optical Devices and Systems
-

903.1
Information Sources and Analysis

Treatment:Theoretical (THR)

DOI:10.1117/12.749691

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 11>

Accession num
ber:20082811367411

Title:A multilevel reputation system for peer
-
to
-
peer networks

Authors:Xu, Ziyao (1); He, Yeping (1); Deng, Lingli (1)

Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, No.4 NanSi Street,
ZhongGuanCun, Beijing,
China

Corresponding author:Xu, Z.




(ccxu@ercist.iscas.ac.cn)




Source title:Proceedings of the 6th International Conference on Grid and Cooperative Computing,
GCC 2007

Abbreviated source title:Proc. Int. Conf. Grid Coop. Comput., GCC

Monograph tit
le:Proceedings of the 6th International Conference on Grid and Cooperative
Computing, GCC 2007

Issue date:2007

Publication year:2007

Pages:67
-
74

Article number:4293762

Language:English

ISBN
-
10:0769528716

ISBN
-
13:9780769528717

Document type:Conference artic
le (CA)

Conference name:6th International Conference on Grid and Cooperative Computing, GCC 2007

Conference date:August 16, 2007
-

August 18, 2007

Conference location:Urumchi, Xinjiang, China

Conference code:72505

Publisher:Inst. of Elec. and Elec. Eng. Co
mputer Society, 445 Hoes Lane
-

P.O.Box 1331,
Piscataway, NJ 08855
-
1331, United States

Abstract:Among the five goals of peer
-
to
-
peer security, file authenticity and fair trading have
attracted the most attention. Reputation and incentive are two traditiona
l systems to deal with file
authenticity and fair trading problems, respectively. In this paper, we propose a multilevel
reputation system which also serves as the base of an incentive system. By introducing the concept
of reputation level to a reputation
system, we solve the Load Balance problem of peer
-
to
-
peer
security perfectly. It also helps to prevent the occurrence of Collusion and Cold
-
Start problems
with two proposed reputation level computation schemes, which are Level Up Reputation
Computation (LU
RC) scheme and Level Keeping Reputation Computation (LKRC) scheme. A
central reputation level computation and access control enforcement agent called Central
Computation and Enforcement Agent (CCEA) is introduced too, which maintains or raises each
peer's
reputation level according to its periodic contribution to other peers in the network. We also
propose a bootstrap process for our multilevel reputation system in a peer
-
to
-
peer network that has
all the peers in the lowest reputation level at the very begi
nning. &copy;2007 IEEE.

Number of references:13

Main heading:Computer systems

Controlled terms:Access control
-

Commerce
-

Distributed computer systems
-

Grid computing

Uncontrolled terms:(e ,3e) process
-

Cold
-
start
-

Cooperative computing
-

international

conferences
-

Load balancing
-

Peer
-
to
-
Peer (P2P) networks
-

Peer
-
to
-
peer (P2P) security
-

Peer
-
to
-
peer networks (P2PN)
-

Reputation systems
-

Traditional systems

Classification code:722 Computer Systems and Equipment
-

722.4 Digital Computers and
Systems

-

723 Computer Software, Data Handling and Applications
-

911.2 Industrial Economics

DOI:10.1109/GCC.2007.17

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 12>

Accession number:20083011394794

Title:WMQ: Towards a
fine
-
grained QoS control for E
-
business servers

Authors:Wang, Wei (1); Zhang, Wenbo (1); Zhang, Lei (1); Huang, Tao (1)

Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Science, Beijing 100080, Ch
ina

Corresponding author:Wang, W.




(wangwei@otcaix.iscas.ac.cn)




Source title:Proceedings
-

ICEBE 2007: IEEE International Conference on e
-
Business
Engineering
-

Workshops: SOAIC 2007; SOSE 2007; SOKM 2007

Abbreviated source title:Proc.
-

ICEBE I
EEE Int. Conf. e
-
Bus. Eng.; Workshops: SOAIC; SOSE;
SOKM

Monograph title:Proceedings
-

ICEBE 2007: IEEE International Conference on e
-
Business
Engineering
-

Workshops: SOAIC 2007; SOSE 2007; SOKM 2007

Issue date:2007

Publication year:2007

Pages:139
-
146

Art
icle number:4402085

Language:English

ISBN
-
10:0769530036

ISBN
-
13:9780769530031

Document type:Conference article (CA)

Conference name:ICEBE 2007: IEEE International Conference on e
-
Business Engineering
-

Workshops: SOAIC 2007; SOSE 2007; SOKM 2007

Conference

date:October 24, 2007
-

October 26, 2007

Conference location:Hong Kong, China

Conference code:72621

Sponsor:IEEE Comput. Soc., Tech. Comm. Electronic Commerce (TCEC); The University of
Hong Kong; The Hong Kong University of Science and Technology

Publishe
r:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane
-

P.O.Box 1331,
Piscataway, NJ 08855
-
1331, United States

Abstract:As the Internet increases explosively, the QoS support in e
-
business server is becoming
more and more important. However, the
implementation of a fine
-
grained QoS control model in
the e
-
business servers is a challenging task. In this paper, we propose a WorkManager
-
based QoS
scheduling framework (WMQ) for e
-
business servers. This framework hides the complexity of
QoS scheme imple
mentations and provides a flexible architecture supporting fine
-
grained QoS
control. A prototype of our framework has been implemented within the open
-
source server
Tomcat. The evaluation of this prototype shows that our approach allows Tomcat to effective
ly
meet the QoS requirement of the applications by fine
-
grained QoS control. Our experience also
shows that the WMQ framework can efficiently simplify and reduce the implementation effort
involved in developing QoS
-
enabled e
-
business servers. &copy; 2007 I
EEE.

Number of references:20

Main heading:Electronic commerce

Controlled terms:Arsenic compounds
-

Law enforcement
-

Servers
-

Software prototyping

Uncontrolled terms:Challenging task
-

E business
-

Flexible architectures
-

International
conferences
-

Open

sources
-

QOS control
-

QoS scheduling
-

QOS supports

Classification code:722 Computer Systems and Equipment
-

723.1 Computer Programming
-

723.5 Computer Applications
-

804.1 Organic Compounds
-

971 Social Sciences

DOI:10.1109/ICEBE.2007.10

Database:Comp
endex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 13>

Accession number:20080511071468

Title:Method of texture feature analysis and synthesis

Authors:Gu, Yuanting (0); Wu, Enhua (0)

Corresponding author:Gu, Y.




(guyt@ios.ac.c
n)




Corr. author affiliation:State Key Laboratory of Computer Science, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China

Source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer
-
Aided Design and
Computer Graphic
s

Abbreviated source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao

Volume:19

Issue:12

Issue date:December 2007

Publication year:2007

Pages:1535
-
1539

Language:Chinese

ISSN:10039775

CODEN:JFTXFX

Document type:Journal article (JA)

Publisher:Institute of Comp
uting Technology, Beijing, 100080, China

Abstract:Markov random field (MRF) as a basic model for texture synthesis is not good at
expressing large
-
size structures and unstable structures due to its inherent insufficiency on
long
-
range relevancy. In this re
gard, a novel two
-
phase framework constructed in pattern space
and material space is proposed in this paper to describe the texture structures. By the framework,
the basic shape and feature vectors are used to decompose textons' shape, while the feature
te
xtures are employed to encode the distribution of textons. The framework takes the advantage
both of the flexibility and the accuracy from MRF
-
like methods. Experiments show that for highly
structured textures, our method can generate better results, and a
lso produce certain special effects
in synthesis.

Number of references:11

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 14>

Accession number:20075110983263

Title:Research on integrity protection for network direct

reporting systems

Authors:Wu, Xin
-
Song (1); He, Ye
-
Ping (1); Yuan, Chun
-
Yang (1)

Author affiliation:(1) Institute of Software, Chinese Acad. of Sci., Beijing 100080, China; (2)
Graduate University, Chinese Acad. of Sci., Beijing 100049, China

Correspond
ing author:Wu, X.
-
S.

Source title:Tongxin Xuebao/Journal on Communication

Abbreviated source title:Tongxin Xuebao

Volume:28

Issue:SUPPL.

Issue date:November 2007

Publication year:2007

Pages:10
-
13

Language:Chinese

ISSN:1000436X

Document type:Journal article

(JA)

Publisher:Editorial Board of Journal on Communications, No.1 Binhe Road, Hepingli, Dongcheng
District, Beijing, 1000013, China

Abstract:The network direct reporting systems address the time
-
constraints, correctness and
consistency of national data re
porting systems. In network direct reporting systems, users at
different levels can report, verify, query, summarize and analyze the data through accessing
national data center. The integrity protection problems of these systems were analyzed. According
to

the analysis, an improved Clark
-
Wilson integrity model based on RBAC model was presented.
Furthermore, the implementation of the improved model in network direct reporting systems was
discussed.

Number of references:5

Main heading:Network security

Control
led terms:Computer networks
-

Mathematical models

Uncontrolled terms:Clark Wilson model
-

Integrity
-

Network direct reporting system
-

RBAC
model

Classification code:716 Telecommunication; Radar, Radio and Television
-

723 Computer
Software, Data Handling

and Applications
-

921 Mathematics

Treatment:Applications (APP); Experimental (EXP)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 15>

Accession number:20071610556267

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

Authors:Wang, Xiang
-
Yun (1); Zhang, Wenhui (2); Li, Yong
-
Chao (1); Cai, Kai
-
Yuan (1)

Author affiliation:(1) Department of Automatic Control, Beijing University of Aeronautics and
Astronautics, Beijing, 100083,
China; (2) LCS, Institute of Software, Chinese Academy of
Sciences, Beijing, 100080, China

Corresponding author:Wang, X.
-
Y.




(wangxy
-
18@sohu.com)




Source title:Information Sciences

Abbreviated source title:Inf Sci

Volume:177

Issue:13

Issue date:J
uly 1, 2007

Publication year:2007

Pages:2712
-
2725

Language:English

ISSN:00200255

CODEN:ISIJBC

Document type:Journal article (JA)

Publisher:Elsevier Inc., 360 Park Avenue South, New York, NY 10010, United States

Abstract:Because of the widespread increasing

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 propose the use of
the supervisory control

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 polyno
mial dynamic
system (PDS) model of DEDS. A necessary and sufficient condition for software existence and
two algorithms for such software design are presented. &copy; 2007 Elsevier Inc. All rights
reserved.

Number of references:31

Main heading:Software des
ign

Controlled terms:Algorithms
-

Control theory
-

Discrete event simulation
-

Dynamical systems
-

Polynomial approximation

Uncontrolled terms:Discrete event dynamic systems
-

Polynomial dynamic systems
-

Reactive
software
-

Software cybernetics
-

Supervis
ory control theory

Classification code:723.1 Computer Programming
-

723.5 Computer Applications
-

731.1 Control
Systems
-

921 Mathematics
-

921.6 Numerical Methods

Treatment:Theoretical (THR)

DOI:10.1016/j.ins.2007.01.025

Database:Compendex

Compilation and

indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 16>

Accession number:20072610677216

Title:Feedback fuzzy
-
DVS scheduling of control tasks

Authors:Jin, Hong (1); Wang, Danli (2); Wang, Hongan (2); Wang, Hui (3)

Author affiliation:(1) Beijing Institut
e of Control and Electronic Technology, P.O.Box 2115,
Beijing 100083, China; (2) IEL, Institute of Software, Chinese Academy of Sciences, Beijing
100080, China; (3) National Software and Integrated Circuit Promotion Center, Ministry of
Information Industry
, Beijing 100038, China

Corresponding author:Jin, H.




(hjin1121@yahoo.com.cn)




Source title:Journal of Supercomputing

Abbreviated source title:J Supercomput

Volume:41

Issue:2

Issue date:August 2007

Publication year:2007

Pages:147
-
162

Language:Eng
lish

ISSN:09208542

E
-
ISSN:15730484

CODEN:JOSUED

Document type:Journal article (JA)

Publisher:Kluwer Academic Publishers, Van Godewijckstraat 30, Dordrecht, 3311 GZ,
Netherlands

Abstract: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 energy consumption to extend the lifetime of the whole system. In this paper, the
scheduling problem of multiple control tasks i
s discussed based on an adjustable voltage processor.
A feedback fuzzy
-
DVS (dynamic voltage scaling) scheduling architecture is presented by applying
technologies of the feedback control and the fuzzy DVS. The simulation results show that, by
using the act
ual utilization as the feedback information to adjust the supply voltage of processor
dynamically, the high CPU utilization can be implemented 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. &copy; Springer Science+Business Media, LLC 2007.

Number of references:26

Main heading:Computer control systems

Controlled t
erms:Computer resource management
-

Computer simulation
-

Electric power
utilization
-

Feedback control
-

Fuzzy rules
-

Problem solving
-

Scheduling algorithms

Uncontrolled terms:Control performance
-

Control tasks
-

Dynamic voltage scaling
-

Scheduling
pr
oblem

Classification code:706.1 Electric Power Systems
-

723 Computer Software, Data Handling and
Applications
-

723.4 Artificial Intelligence
-

723.5 Computer Applications
-

731.1 Control
Systems

Treatment:Theoretical (THR)

DOI:10.1007/s11227
-
006
-
0027
-
y

D
atabase:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 17>

Accession number:20083011394791

Title:Adaptive self
-
configuration of EJB server: A performance model approach

Authors:Hu, Jianjun (1); Guan, Heqing (1); Zhong, Hua
(1); Huang, Tao (1)

Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences

Corresponding author:Hu, J.




(hujj@otcaix.iscas.ac.cn)




Source title:Proceedings
-

ICEBE 2007: IEEE Internat
ional Conference on e
-
Business
Engineering
-

Workshops: SOAIC 2007; SOSE 2007; SOKM 2007

Abbreviated source title:Proc.
-

ICEBE IEEE Int. Conf. e
-
Bus. Eng.; Workshops: SOAIC; SOSE;
SOKM

Monograph title:Proceedings
-

ICEBE 2007: IEEE International Conferenc
e on e
-
Business
Engineering
-

Workshops: SOAIC 2007; SOSE 2007; SOKM 2007

Issue date:2007

Publication year:2007

Pages:115
-
122

Article number:4402082

Language:English

ISBN
-
10:0769530036

ISBN
-
13:9780769530031

Document type:Conference article (CA)

Conference
name:ICEBE 2007: IEEE International Conference on e
-
Business Engineering
-

Workshops: SOAIC 2007; SOSE 2007; SOKM 2007

Conference date:October 24, 2007
-

October 26, 2007

Conference location:Hong Kong, China

Conference code:72621

Sponsor:IEEE Comput. Soc.,

Tech. Comm. Electronic Commerce (TCEC); The University of
Hong Kong; The Hong Kong University of Science and Technology

Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane
-

P.O.Box 1331,
Piscataway, NJ 08855
-
1331, United States

Abstra
ct:High dynamic computing environment makes quality of service (QoS) guarantee more
important to distributed system. It should possess self
-
tuning capability reacting to external
environment variation such as fluctuating workload. This paper proposed an ad
aptive
self
-
configuration framework for EJB platform, which can automatically tune configuration
parameters to preserve QoS when workload changed. The key point of this framework is a
performance model based on layered queuing network, which guides the sea
rch for the best
combination of configuration parameters to satisfy performance requirement of EJB application.
We have prototyped this self
-
configuration framework on an EJB server named OnceAS, and the
experiment results showed that through the framework
's control, system performs well on QoS
goal. &copy; 2007 IEEE.

Number of references:19

Main heading:Quality of service

Controlled terms:Canning
-

Computer systems
-

Electronic commerce
-

Tuning

Uncontrolled terms:Computing environments
-

Configuration par
ameters
-

Distributed systems
-

E
business
-

External environments
-

International conferences
-

Layered queuing
-

Performance
modelling
-

Performance requirements
-

Quality of service (QoS)
-

Self configuration
-

Self
tuning (ST)

Classification code:713
Electronic Circuits
-

716 Telecommunication; Radar, Radio and Television
-

722 Computer Systems and Equipment
-

723.5 Computer Applications
-

822.2 Food Processing
Operations

DOI:10.1109/ICEBE.2007.50

Database:Compendex

Compilation and indexing terms, Copy
right 2009 Elsevier Inc.


<RECORD 18>

Accession number:20082811364603

Title:Integrated rate control and buffer management for scalable video streaming

Authors:Yuanhai, Zhang (1); Wei, Huangfu (1); Jin, Xu (1); Kaihui, Li (1); Changqiao, Xu (1)

Author affi
liation:(1) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China;
(2) Graduate University, Chinese Academy of Sciences, Beijing 100039, China

Corresponding author:Yuanhai, Z.




(yuanhai02@ios.cn)




Source title:Proceedings of t
he 2007 IEEE International Conference on Multimedia and Expo,
ICME 2007

Abbreviated source title:Proc. IEEE Int. Conf. Multimedia and Expo, ICME

Monograph title:Proceedings of the 2007 IEEE International Conference on Multimedia and Expo,
ICME 2007

Issue d
ate:2007

Publication year:2007

Pages:248
-
251

Article number:4284633

Language:English

ISBN
-
10:1424410177

ISBN
-
13:9781424410170

Document type:Conference article (CA)

Conference name:IEEE International Conference onMultimedia and Expo, ICME 2007

Conference da
te:July 2, 2007
-

July 5, 2007

Conference location:Beijing, China

Conference code:72463

Sponsor:Institute of Electrical and Electronics Engineers; Circuits and Systems Society;
Communications Society; Computer Society; Signal Processing Society

Publisher:I
nst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane
-

P.O.Box 1331,
Piscataway, NJ 08855
-
1331, United States

Abstract:In this paper we present a video communication scheme that integrates rate control and
buffer management at the source. A transmi
ssion rate is obtained via a rate control algorithm,
which employs the Program Clock References (PCR) embedded in die video streams to regulate
the transmission rate in a refined way and thus reduce the client buffer requirement. The server
side also maint
ains multiple buffers to trade off random loss for controlled loss of visually less
important data. We test our system with Standard Definition Television (SDTV) and High
Definition Television (HDTV) traces, and find that the proposed scheme serves best fo
r the
transmission by slowing down the transmission rate without higher buffer requirement in both
cases. &copy; 2007 IEEE.

Number of references:5

Main heading:Television broadcasting

Controlled terms:Concurrency control
-

Digital television
-

Exhibitions
-

High definition
television
-

Image coding
-

Standards
-

Video streaming
-

Videotex

Uncontrolled terms:Buffer management
-

Buffer requirements
-

Client buffer
-

High
-
Definition
(HD)
-

international conferences
-

Random losses
-

Rate Control (RC)
-

Rate co
ntrol (RC)
algorithms
-

Scalable video streaming
-

SERVER side
-

Standard definition television (SDTV)
-

Trade offs
-

Transmission rates
-

video communications
-

Video streaming

Classification code:716 Telecommunication; Radar, Radio and Television
-

716.
4 Television
Systems and Equipment
-

723.3 Database Systems
-

741 Light, Optics and Optical Devices
-

902.2
Codes and Standards

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 19>

Accession number:20071610557973

Tit
le:Text segmentation based on PLSA model

Authors:Shi, Jing (1); Dai, Guozhong (1)

Author affiliation:(1) Computer
-
Human Interaction and Intelligent Information Processing
Laboratory, Institute of Software, Chinese Academy of Sciences, Beijing 100080, Chin
a

Corresponding author:Shi, J.




(crystal1087@126.com)




Source title:Jisuanji Yanjiu yu Fazhan/Computer Research and Development

Abbreviated source title:Jisuanji Yanjiu yu Fazhan

Volume:44

Issue:2

Issue date:February 2007

Publication year:2007

Pa
ges:242
-
248

Language:Chinese

ISSN:10001239

CODEN:JYYFEY

Document type:Journal article (JA)

Publisher:Science Press, 18,Shuangqing Street,Haidian, Beijing, 100085, China

Abstract:Text segmentation is very important for many fields including information retr
ieval,
summarization, language modeling, anaphora resolution and so on. Text segmentation based on
PLSA associates different latent topics with observable pairs of word and sentence. In the
experiments, Chinese whole sentences are taken as elementary block
s. Variety of similarity
metrics and several approaches to discovering boundaries are tried. The influences of repetition of
unknown words in adjacent sentences on similarity values are considered. The best results show
the error rate is 6.06%, which is fa
r lower than that of other algorithms of text segmentation.

Number of references:19

Main heading:Text processing

Controlled terms:Algorithms
-

Information retrieval
-

Natural language processing systems
-

Semantics

Uncontrolled terms:Adjacent sentences
-

A
naphora resolution
-

Boundary discovering
-

Chinese
whole sentences
-

Elementary block
-

Error rate
-

Language modeling
-

Probabilistic latent
semantic analysis (PLSA)
-

Similarity metric
-

Similarity value
-

Summarization
-

Text
segmentation

Classificati
on code:723.2 Data Processing and Image Processing
-

723.5 Computer Applications
-

903.3 Information Retrieval and Use
-

921 Mathematics

Treatment:Applications (APP); Experimental (EXP)

DOI:10.1360/crad20070208

Database:Compendex

Compilation and indexing t
erms, Copyright 2009 Elsevier Inc.


<RECORD 20>

Accession number:20074210877005

Title:Mechanized proofs for the parameter abstraction and guard strengthening principle in
parameterized verification of cache coherence protocols

Authors:Li, Yongjian (1)

Aut
hor affiliation:(1) Laboratory of Computer Science, Institute of Software, CAS, P.O.Box 8718,
Beijing, China

Corresponding author:Li, Y.




(lyj238@ios.ac.cn)




Source title:Proceedings of the ACM Symposium on Applied Computing

Abbreviated source ti
tle:Proc ACM Symp Appl Computing

Monograph title:Proceedings of the 2007 ACM Symposium on Applied Computing

Issue date:2007

Publication year:2007

Pages:1534
-
1535

Language:English

ISBN
-
10:1595934804

ISBN
-
13:9781595934802

Document type:Journal article (JA)

C
onference name:2007 ACM Symposium on Applied Computing

Conference date:March 11, 2007
-

March 15, 2007

Conference location:Seoul, Korea, Republic of

Conference code:70408

Sponsor:ACM Special Interest Group on Applied Computing

Publisher:Association for Com
puting Machinery, 1515 Broadway, 17th Floor, New York, NY
10036
-
5701, United States

Abstract:Chou, Mannava, and Park proposed a novel method for verification of safety properties
of cache protocols, which is underpinned by the principle of parameter abstra
ction and guard
strengthening. However, no one has formally proved the correctness of this method itself. In this
work, we want to fill the gap in the literature. We believe that our work provides an alternative to
formally justify this method. The key poi
nts of our theory are symmetry and the introduction of an
intermediate guard strengthening protocol. We mechanize our theory in Isabelle/HOL. Copyright
2007 ACM.

Number of references:3

Main heading:Network protocols

Controlled terms:Cache memory
-

Paramete
r estimation
-

Parameterization
-

Theorem proving

Uncontrolled terms:Guard strengthening
-

Parameter abstraction
-

Parameterized verification

Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching
Theory, Programming T
heory
-

722.1 Data Storage, Equipment and Techniques
-

723 Computer
Software, Data Handling and Applications
-

731.1 Control Systems
-

921 Mathematics

Treatment:Theoretical (THR); Experimental (EXP)

DOI:10.1145/1244002.1244329

Database:Compendex

Compilatio
n and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 21>

Accession number:20074110861941

Title:Probabilistic bisimulations for quantum processes

Authors:Feng, Yuan (1); Duan, Runyao (1); Ji, Zhengfeng (2); Ying, Mingsheng (1)

Author affiliation:(1)

State Key Laboratory of Intelligent Technology and Systems, Department of
Computer Science and Technology, Tsinghua University, Beijing, 100084, China; (2) State Key
Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beiji
ng,
100084, China

Corresponding author:Feng, Y.




(feng
-
y@tsinghua.edu.cn)




Source title:Information and Computation

Abbreviated source title:Inf Comput

Volume:205

Issue:11

Issue date:November 2007

Publication year:2007

Pages:1608
-
1639

Language:En
glish

ISSN:08905401

E
-
ISSN:10902651

CODEN:INFCEC

Document type:Journal article (JA)

Publisher:Elsevier Inc., 360 Park Avenue South, New York, NY 10010, United States

Abstract:Modeling and reasoning about concurrent quantum systems is very important for bot
h
distributed quantum computing and quantum protocol verification. As a consequence, a general
framework formally describing communication and concurrency in complex quantum systems is
necessary. For this purpose, we propose a model named qCCS. It is a nat
ural quantum extension
of classical value
-
passing 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 tran
sition system. This semantics has many
different 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 se
mantics, the notions of strong probabilistic bisimulation 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. &copy; 2007 Elsevier Inc. All rights reserved.

Number of references:40

Main heading:Quantum computers

Controlled terms:Computer simulation
-

Mathematical transformations
-

Probability
-

Semantics
-

Verification

Uncontrolled terms:Congruence
-

Pr
obabilistic bisimulation
-

Quantum process

Classification code:721.2 Logic Elements
-

722 Computer Systems and Equipment
-

723.5
Computer Applications
-

903.2 Information Dissemination
-

921.3 Mathematical Transformations

Treatment:Theoretical (THR)

DOI:10
.1016/j.ic.2007.08.001

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 22>

Accession number:20074110862602

Title:An integrated prefetching and caching scheme for mobile web caching system

Authors:Beihong, Jin (1); S
ihua, Tian (1); Chen, Lin (1); Xin, Ren (1); Yu, Huang (1)

Author affiliation:(1) Technology Center of Software Engineering, Institute of Software, Chinese
Academy of Sciences, Beijing, China

Corresponding author:Beihong, J.

Source title:Proceedings
-

SN
PD 2007: Eighth ACIS International Conference on Software
Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing

Abbreviated source title:Proc. Eighth ACIS Int. Conf. Softw. Eng. Artif. Intell. Netw. Parallel
Distrib. Comput.

Volume:2

Monograph title:Proceedings
-

SNPD 2007: Eighth ACIS International Conference on Software
Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing

Issue date:2007

Publication year:2007

Pages:522
-
527

Article number:42877
40

Language:English

ISBN
-
10:0769529097

ISBN
-
13:9780769529097

Document type:Conference article (CA)

Conference name:SNPD 2007: 8th ACIS International Conference on Software Engineering,
Artificial Intelligence, Networking, and Parallel/Distributed Computing

Conference date:July 30, 2007
-

August 1, 2007

Conference location:Qingdao, China

Conference code:70334

Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane
-

P.O.Box 1331,
Piscataway, NJ 08855
-
1331, United States

Abstract:Web caching a
nd prefetching play an important role in improving the performance of
Web access in wireless environment. In this paper, we present a compact set of algorithms for
integrating web caching and prefetching for wireless local area network, including
sequencem
ining based prediction algorithm, context
-
aware prefetching algorithm and
profit
-
driven caching replacement policy, and then implement them in Web caching system
OnceEasyCache. We also evaluate this integrated scheme by conducting the trace
-
based
experimen
ts on the OnceEasyCache system. &copy; 2007 IEEE.

Number of references:12

Main heading:Web services

Controlled terms:Algorithms
-

Cache memory
-

Public policy
-

Wireless networks

Uncontrolled terms:Caching scheme
-

Prediction algorithms
-

Web caching syste
m

Classification code:716.3 Radio Systems and Equipment
-

722.1 Data Storage, Equipment and
Techniques
-

722.3 Data Communication, Equipment and Techniques
-

723 Computer Software,
Data Handling and Applications
-

921 Mathematics

Treatment:Theoretical (THR
); Experimental (EXP)

DOI:10.1109/SNPD.2007.162

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 23>

Accession number:20083111428677

Title:Variable code
-
mode based connectivity compression for triangular meshes

Autho
rs:Liu, Ying (1); Liu, Xuehui (1); Wu, Enhua (1)

Author affiliation:(1) State Key Lab of Computer Science, Institute of Software, CAS, Beijing,
China; (2) University of Macau, Macao, China

Corresponding author:Liu, Y.




(Liuyingbj@yahoo.com)




Sou
rce title:Proceedings of 2007 10th IEEE International Conference on Computer Aided Design
and Computer Graphics, CAD/Graphics 2007

Abbreviated source title:Proc. IEEE Int. Conf. Comput. Aided Des. Comput. Graph., CAD/Graph.

Monograph title:Proceedings of 2
007 10th IEEE International Conference on Computer Aided
Design and Computer Graphics, CAD/Graphics 2007

Issue date:2007

Publication year:2007

Pages:276
-
281

Article number:4407894

Language:English

ISBN
-
13:9781424415793

Document type:Conference article (CA)

Conference name:2007 10th IEEE International Conference on Computer Aided Design and
Computer Graphics, CAD/Graphics 2007

Conference date:October 15, 2007
-

October 18, 2007

Conference location:Beijing, China

Conference code:72855

Sponsor:Chinese Computer

Federation; IEEE Beijing Section; Institute of Computer Science and
Technology, Peking University; School of EECS, Peking University; National Natural Science
Foundation of China

Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane
-

P.
O.Box 1331,
Piscataway, NJ 08855
-
1331, United States

Abstract:In this article, we present an efficient algorithm for encoding the connectivity
information of triangular meshes. By the method, all triangles are traversed first to obtain operator
series. The
n an arithmetic coder based on variable code
-
mode is applied to encode the operator
series. According to the operator last encoded, the property of triangular mesh and the method of
mesh traversal, a code
-
mode is calculated for each operator being encoded
currently, where the
operator with higher prediction probability is given a shorter binary strand. Then we can obtain the
binary strand according to its code
-
mode and encode every bit of this binary strand by adaptive
arithmetic coding method. Testing resu
lt shows that the compression ratio of our algorithm is very
high and even higher than the compression ratio by using TG algorithm, which is commonly
regarded as one of the best in terms of compression ratio. &copy; 2007 IEEE.

Number of references:12

Main
heading:Mesh generation

Controlled terms:Codes (standards)
-

Codes (symbols)
-

Color image processing
-

Compression
ratio (machinery)
-

Computational geometry
-

Computational methods
-

Computer aided design
-

Computer graphics
-

Data compression
-

Digital
arithmetic
-

Programming theory

Uncontrolled terms:Adaptive arithmetic coding
-

Arithmetic coders
-

Compression ratios
-

Connectivity compression
-

Connectivity information
-

Efficient algorithms
-

International
conferences
-

Triangular meshes

Classificat
ion code:902.2 Codes and Standards
-

741.1 Light/Optics
-

723.5 Computer
Applications
-

723.2 Data Processing and Image Processing
-

721.1 Computer Theory, Includes
Formal Logic, Automata Theory, Switching Theory, Programming Theory
-

716.1 Information
The
ory and Signal Processing
-

612.1 Internal Combustion Engines, General

DOI:10.1109/CADCG.2007.4407894

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 24>

<RECORD 1>

Accession number:20071410523873

Title:Extraction a
nd segmentation of tables from Chinese ink documents based on a matrix model

Authors:Zhang, Xi
-
wen (1); Lyu, Michael R. (2); Dai, Guo
-
zhong (1)

Author affiliation:(1) Laboratory of Human
-
Computer Interaction and Intelligent Information
Processing, Institu
te of Software, The Chinese Academy of Sciences, Beijing, 100080, China; (2)
Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin,
N.T., Hong Kong SAR, Hong Kong

Corresponding author:Zhang, X.
-
w.




(zxw19@hotmail
.com)




Source title:Pattern Recognition

Abbreviated source title:Pattern Recogn.

Volume:40

Issue:7

Issue date:July 2007

Publication year:2007

Pages:1855
-
1867

Language:English

ISSN:00313203

CODEN:PTNRA8

Document type:Journal article (JA)

Publisher:Elsev
ier Ltd, Langford Lane, Kidlington, Oxford, OX5 1GB, United Kingdom

Abstract:This paper presents an approach for extracting and segmenting tables from Chinese ink
documents based on a matrix model. An ink document is first modeled as a matrix containing in
k
rows, including writing and drawing ones. Each row consists of collinear ink lines containing ink
characters. Together with their associated drawing rows, adjacent writing rows having an identical
distribution of writing lines and{minus 45 degree rule}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.
&copy; 2007.

Number of refer
ences:33

Main heading:Feature extraction

Controlled terms:Image segmentation
-

Information retrieval
-

Ink
-

Mathematical models
-

Matrix
algebra

Uncontrolled terms:Chinese ink document
-

Digital ink
-

Handwriting
-

Matrix models
-

Table
extraction
-

Table

segmentation

Classification code:723.2 Data Processing and Image Processing
-

723.5 Computer Applications
-

804 Chemical Products Generally
-

903.3 Information Retrieval and Use
-

921 Mathematics

Treatment:Theoretical (THR); Experimental (EXP)

DOI:10.1016
/j.patcog.2006.05.029

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 25>

Accession number:20074910961902

Title:A protocol for a private set
-
operation

Authors:Li, Rong
-
Hua (1); Wu, Chuan
-
Kun (1)

Author affiliation:
(1) State Key Laboratory of Information Security, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China; (2) Graduate University, Chinese Academy of
Sciences, Beijing 100049, China

Corresponding author:Li, R.
-
H.




(lirh@is.iscas.ac
.cn)




Source title:Journal of Computer Science and Technology

Abbreviated source title:J Comput Sci Technol

Volume:22

Issue:6

Issue date:November 2007

Publication year:2007

Pages:822
-
829

Language:English

ISSN:10009000

CODEN:JCTEEM

Document type:Journal

article (JA)

Publisher:Springer New York LLC, 233 Springer Street, New York, 10013
-
1578, United States

Abstract: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 lead
er, S be P's secret set, and t (less than
n&isin;
-
&isin;1) be a threshold value. For each element w of S, if w appears more than t times in
the rest parties' sets, then P learns which parties' sets include w, otherwise P cannot know whether
w appears in an
y 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, and
the polynomial representation of sets. The protocol only needs constant rounds of

communication.
&copy; 2007 Science Press, Beijing, China and Springer Science + Business Media, LLC, USA.

Number of references:13

Main heading:Network protocols

Controlled terms:Computational methods
-

Problem solving
-

Public key cryptography
-

Security
of data
-

Semantics

Uncontrolled terms:Private set
-
operations
-

Secure multiparty computation
-

Secure protocols

Classification code:723 Computer Software, Data Handling and Applications
-

723.2 Data
Processing and Image Processing
-

903.2 Information Diss
emination
-

921 Mathematics

Treatment:Theoretical (THR)

DOI:10.1007/s11390
-
007
-
9098
-
3

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 26>

Accession number:20071110484760

Title:On string languages generated by spikin
g neural P systems

Authors:Chen, Haiming (1); Freund, Rudolf (2); Ionescu, Mihai (3); Pun, Gheorghe (4);
P&#233;rez
-
Jim&#233;nez, Mario J. (5)

Author affiliation:(1) Computer Science Laboratory, Institute of Software, Chinese Academy of
Sciences, 100080 B
eijing, China; (2) Faculty of Informatics, Technische Universit&#228;t Wien,
Favoritenstrae 9, A
-
1040 Wien, Austria; (3) Research Group on Mathematical Linguistics, Rovira
i Virgili University, Pl. Imperial Trraco 1, 43005 Tarragona, Spain; (4) Inst. of Ma
th., Romanian
Academy, PO Box 1
-
764, 014700 Bucharest, Romania; (5) Department of Computer Science and
AI, University of Sevilla, Avda Reina Mercedes s/n, 41012 Sevilla, Spain

Corresponding author:Pun, G.




(george.paun@imar.ro)




Source title:Fund
amenta Informaticae

Abbreviated source title:Fundam Inf

Volume:75

Issue:1
-
4

Monograph title:New Frontiers in Scientific Discovery
-

Commemorating the Life and Work of
Zdzislaw Pawlak

Issue date:2007

Publication year:2007

Pages:141
-
162

Language:English

ISSN
:01692968

CODEN:FUINE8

Document type:Journal article (JA)

Publisher:IOS Press, Nieuwe Hemweg 6B, Amsterdam, 1013 BG, Netherlands

Abstract:We continue the study of spiking neural P systems by considering these 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 "direct" generative
capacity of spiking neural P systems is rather restricted (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 languages generated by spiking neural P systems.

Number of r
eferences:18

Main heading:Neural networks

Controlled terms:Binary codes
-

Computer programming languages
-

Hierarchical systems
-

Systems analysis

Uncontrolled terms:Chomsky hierarchy
-

Membrane computing
-

Spike trains
-

Spiking neural P
systems

Classific
ation code:723.1.1 Computer Programming Languages
-

723.4 Artificial Intelligence
-

912.3 Operations Research
-

961 Systems Science

Treatment:Experimental (EXP)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 27>

Ac
cession number:20080111003344

Title:An interaction instance oriented approach for web application integration in portals

Authors:Song, Jingyu (1); Wei, Jun (1); Wan, Shuchao (1); Zhong, Hua (1)

Author affiliation:(1) Technology Center of Software Engineer
ing, Institute of Software, Chinese
Academy of Sciences, Beijing 100080, China

Corresponding author:Song, J.




(songjy@otcaix.iscas.ac.cn)




Source title:Proceedings
-

International Computer Software and Applications Conference

Abbreviated source t
itle:Proc Int Comput Software Appl Conf

Volume:1

Monograph title:Proceedings
-

31st Annual International Computer Software and Applications
Conference, COMPSAC 2007

Issue date:2007

Publication year:2007

Pages:353
-
360

Article number:4291024

Language:English

ISSN:07303157

CODEN:PSICD2

ISBN
-
13:9780769528700

Document type:Conference article (CA)

Conference name:31st Annual International Computer Software and Applications Conference,
COMPSAC 2007

Conference date:July 24, 2007
-

July 27, 2007

Conference location:
Beijing, China

Conference code:70797

Sponsor:IEEE Computer Society

Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane
-

P.O.Box 1331,
Piscataway, NJ 08855
-
1331, United States

Abstract:Currently, the significance of a portal stems not o
nly from being a handy way to access
data but also from being the means of facilitating the integration with web applications. This paper
proposes an interaction instance oriented approach for integrating web applications in portals. The
key aspect is to e
nable a user to have the same interaction experiences from a portal that he/she
accesses the web application directly. The approach is thus focused on the description of the
presentation layer of the interaction instances of a web application and a portlet
, which defines an
interaction instance as consecutive web pages or fragments. Web application integration is then
transformed to the problem that how to translate all web pages of an interaction instance of a web
application to certain view equivalence re
gions, which form the interaction instance of a portlet.
Experiments show that the approach is effective and efficient. &copy; 2007 IEEE.

Number of references:17

Main heading:Portals

Controlled terms:Data reduction
-

Human computer interaction
-

Problem so
lving
-

User interfaces
-

Web services

Uncontrolled terms:View equivalence regions
-

Web applications

Classification code:716 Telecommunication; Radar, Radio and Television
-

722.2 Computer
Peripheral Equipment
-

723.2 Data Processing and Image Processing
-

903.4 Information Services
-

921 Mathematics

Treatment:Experimental (EXP)

DOI:10.1109/COMPSAC.2007.67

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 28>

Accession number:20083111428722

Title:Max/min path visual c
overage problems in raster terrain

Authors:Lu, Min (1); Zhang, Jinfang (1); Lv, Pin (1); Fan, Zhihua (1)

Author affiliation:(1) National Key Laboratory of Integrated Information System Technology,
Institute of Software, Chinese Academy of Sciences, Beijin
g, 100080, China

Corresponding author:Lu, M.




(lumin03@ios.cn)




Source title:Proceedings of 2007 10th IEEE International Conference on Computer Aided Design
and Computer Graphics, CAD/Graphics 2007

Abbreviated source title:Proc. IEEE Int. Conf. C
omput. Aided Des. Comput. Graph., CAD/Graph.

Monograph title:Proceedings of 2007 10th IEEE International Conference on Computer Aided
Design and Computer Graphics, CAD/Graphics 2007

Issue date:2007

Publication year:2007

Pages:497
-
500

Article number:4407939

Language:English

ISBN
-
13:9781424415793

Document type:Conference article (CA)

Conference name:2007 10th IEEE International Conference on Computer Aided Design and
Computer Graphics, CAD/Graphics 2007

Conference date:October 15, 2007
-

October 18, 2007

Conf
erence location:Beijing, China

Conference code:72855

Sponsor:Chinese Computer Federation; IEEE Beijing Section; Institute of Computer Science and
Technology, Peking University; School of EECS, Peking University; National Natural Science
Foundation of China

Publisher:Inst. of Elec. and Elec. Eng. Computer Society, 445 Hoes Lane
-

P.O.Box 1331,
Piscataway, NJ 08855
-
1331, United States

Abstract:Path visual coverage is the region which could be seen from the path in the terrain. This
paper advances the concept
of "average horizon" which represents the wide extent of the visual
field of each path point to analyze and model the max and min path visual coverage problems, and
resolves them utilizing simulated annealing algorithm based on the operation of viewshed
am
algamation with pre
-
computed and stored viewshed information. &copy; 2007 IEEE.

Number of references:8

Main heading:Simulated annealing

Controlled terms:Alloys
-

Annealing
-

Color image processing
-

Computational geometry
-

Computer aided design
-

Computer

graphics

Uncontrolled terms:Coverage problems
-

International conferences
-

Simulated annealing
algorithm
-

Visual field

Classification code:531.1 Metallurgy
-

537.1 Heat Treatment Processes
-

723.5 Computer
Applications
-

741.1 Light/Optics

DOI:10.1109/C
ADCG.2007.4407939

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.


<RECORD 29>

Accession number:20074310881760

Title:TRISO
-
model: A new approach to integrated software process assessment and improvement

Authors:Li, Mingshu (
1)

Author affiliation:(1) State Key Lab of Computer Science, Institute of Software, Chinese