A 3D shape retrieval framework for 3D smart citiesFrontiers of Computer Science in China - Tập 4 - Trang 394-404 - 2010
Biao Leng, Zhang Xiong, Xiangwei Fu
This paper introduces the importance of 3D shape retrieval frameworks in 3D
smart cities, and proposes a unified framework for 3D shape retrieval. The
proposed method is based on the concept of visual representation, where each
object is rendered with several depth images and binary images from distributed
vertices in the regular polyhedron. For each image, several shape descriptors
are utilized t... hiện toàn bộ
Monitoring of particle swarm optimizationFrontiers of Computer Science in China - Tập 3 - Trang 31-37 - 2009
Yuhui Shi, Russ Eberhart
In this paper, several diversity measurements will be discussed and defined. As
in other evolutionary algorithms, first the population position diversity will
be discussed followed by the discussion and definition of population velocity
diversity which is different from that in other evolutionary algorithms since
only PSO has the velocity parameter. Furthermore, a diversity measurement called
cogn... hiện toàn bộ
Learning multiple metrics for rankingFrontiers of Computer Science in China - Tập 5 - Trang 259-267 - 2011
Xiubo Geng, Xue-Qi Cheng
Directly optimizing an information retrieval (IR) metric has become a hot topic
in the field of learning to rank. Conventional wisdom believes that it is better
to train for the loss function on which will be used for evaluation. But we
often observe different results in reality. For example, directly optimizing
averaged precision achieves higher performance than directly optimizing
precision@3 wh... hiện toàn bộ
On the verification of polynomial system solversFrontiers of Computer Science in China - Tập 2 - Trang 55-66 - 2008
Changbo Chen, Marc Moreno Maza, Wei Pan, Yuzhen Xie
We discuss the verification of mathematical software solving polynomial systems
symbolically by way of triangular decomposition. Standard verification
techniques are highly resource consuming and apply only to polynomial systems
which are easy to solve. We exhibit a new approach which manipulates
constructible sets represented by regular systems. We provide comparative
benchmarks of different veri... hiện toàn bộ
An effective scheduling scheme for multi-hop multicast in wireless mesh networksFrontiers of Computer Science in China - Tập 4 - Trang 135-142 - 2010
Zheng Liu, Heng Dai, Farouk Alkadhi, Jufeng Dai
With the utilization of concurrent transmission strategy, a throughput-enhanced
scheduling scheme is devised for multicast service in wireless multi-hop mesh
networks. Since the performance of a multicast mechanism is constrained in a
wireless setting due to the interference among local wireless transmissions, the
interference relationships are first characterized by introducing a graph
transforma... hiện toàn bộ
The use of mathematics in software quality assuranceFrontiers of Computer Science in China - Tập 6 - Trang 3-16 - 2012
David Lorge Parnas
The use of mathematics for documenting, inspecting, and testing software is
explained and illustrated. Three measures of software quality are described and
discussed. Then three distinct complementary approaches to software quality
assurance are presented. A case study, the testing and inspection of a
safety-critical system, is discussed in detail.
Modeling default risk via a hidden Markov model of multiple sequencesFrontiers of Computer Science in China - Tập 4 - Trang 187-195 - 2010
Wai-Ki Ching, Ho-Yin Leung, Zhenyu Wu, Hao Jiang
Default risk in commercial lending is one of the major concerns of the
creditors. In this article, we introduce a new hidden Markov model (HMM) with
multiple observable sequences (MHMM), assuming that all the observable sequences
are driven by a common hidden sequence, and utilize it to analyze default data
in a network of sectors. Efficient estimation method is then adopted to estimate
the model ... hiện toàn bộ
Indeterminacy-aware service selection for reliable service compositionFrontiers of Computer Science in China - Tập 5 - Trang 26-36 - 2010
Xiaoqin Fan, Xianwen Fang, Zhijun Ding
With the development of Internet and Web service technology, Web service
composition has been an effective way to construct software applications;
service selection is the crucial element in the composition process. However,
the existing selection methods mostly generate static plans since they neglect
the inherent stochastic and dynamic nature of Web services. As a result, Web
service composition... hiện toàn bộ
Forecasting complex group behavior via multiple plan recognitionFrontiers of Computer Science in China - Tập 6 - Trang 102-110 - 2012
Xiaochen Li, Wenji Mao, Daniel Zeng
Group behavior forecasting is an emergent research and application field in
social computing. Most of the existing group behavior forecasting methods have
heavily relied on structured data which is usually hard to obtain. To ease the
heavy reliance on structured data, in this paper, we propose a computational
approach based on the recognition of multiple plans/intentions underlying group
behavior.... hiện toàn bộ
Improving bagging performance through multi-algorithm ensemblesFrontiers of Computer Science in China - Tập 6 - Trang 498-512 - 2012
Kuo-Wei Hsu, Jaideep Srivastava
Working as an ensemble method that establishes a committee of classifiers first
and then aggregates their outcomes through majority voting, bagging has
attracted considerable research interest and been applied in various application
domains. It has demonstrated several advantages, but in its present form,
bagging has been found to be less accurate than some other ensemble methods. To
unlock its po... hiện toàn bộ