深圳大学 ESI computer science 学科发表文章列表
第 1 条，共 274 条
标题: Joint representation and pattern learning for robust face recognition
作者: Yang, M (Yang, Meng); Zhu, PF (Zhu, Pengfei); Liu, F (Liu, Feng); Shen, LL (Shen, Linlin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Image feature is a significant factor for the success of robust face recognition. Recently sparse representation based
classifier (SRC) has been widely applied to robust face recognition by using sparse representation residuals to tolerate
disturbed image features (e.g., occluded pixels). In order to deal with more complicated image variations, robust
representation based classifier, which estimates feature weights (e.g., low weight values are given to the pixels with big
representation residuals), has attracted much attention in recent work. Although these methods have achieved improved
performance by estimating feature weights independently, structured information and prior knowledge of image features are
ignored in these works, resulting in unsatisfactory performance in some challenging cases. Thus how to better learn image
feature weight to fully exploit structure information and prior knowledge is still an open question in robust face recognition.
In this paper, we proposed a novel joint representation and pattern learning (JRPL) model, in which the feature pattern
weight is simultaneously learned with the representation of query image. Especially a feature pattern dictionary, which
captures structured information and prior knowledge of image features, are constructed to represent the unknown feature
pattern weight of a query image. An efficient algorithm to solve JRPL was also presented in this paper. The experiments of
face recognition with various variations and occlusions on several benchmark datasets clearly show the advantage of the
proposed JRPL in accuracy and efficiency. (C) 2015 Elsevier B.V. All rights reserved.
地址: [Yang, Meng; Liu, Feng; Shen, Linlin] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R
China.
[Zhu, Pengfei] Tianjin Univ, Sch Comp Sci & Technol, Tianjin 300072, Peoples R China.
通讯作者地址: Shen, LL (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
电子邮件地址: llshen@szu.edu.cn
第 2 条，共 274 条
标题: Lightness biased cartoon-and-texture decomposition for textile image segmentation
作者: Han, Y (Han, Yu); Xu, C (Xu, Chen); Baciu, G (Baciu, George); Li, M (Li, Min)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: With the development of robust image processing tools in the textile industry, fabric designers are beginning to use
feature extraction methods for both analysis and pattern design of fabric materials. In the design evaluation process, one of
the basic problems is the efficient segmentation for textile fabric images. This is equivalent to partitioning the images into
several meaningful regions that often correspond to units of design patterns, repeats, woven yarn or fibres. The main
challenge in this problem is identifying robustly the boundaries of various components of fabric materials. In this paper, we
propose a novel model to solve the problem. The model is established on the analysis of the characteristic of textile/fabric
images. The main contributions of the model are: (1) a cartoon-and-texture decomposition process is incorporated into the
model, which can reduce the influence of the random texture noise on the segmentation process; (2) to overcome the
drawback of the lightness inconsistency for the segmentation process, a bias field function is introduced to measure the
deviation degree between the cartoon image and the piecewise constant approximation of the cartoon image. Then, the
regions of textile images can be more accurately estimated; (3) following the advantages of the fuzzy region competition
based image segmentation models, we also use the fuzzy membership functions (FMFs) to indicate the regions of images.
However, to restrain the FMFs from degeneration, a new penalty term on the FMFs is introduced in our model. In addition,
by using the augmented Lagrange multiplier method and the Chambolle's dual projection method, we derive an efficient
algorithm to solve the model. Experimental results demonstrate that the proposed model can generate better segmentation
results for textile images than classical FMF based models. (C) 2015 Elsevier B.V. All rights reserved.
地址: [Han, Yu; Xu, Chen; Li, Min] Shenzhen Univ, Coll Math & Computat Sci, Shenzhen 518060, Guangdong, Peoples R
China.
[Baciu, George] Hong Kong Polytech Univ, Dept Comp, GAMA Lab, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Han, Y (通讯作者),Shenzhen Univ, Coll Math & Computat Sci, Shenzhen 518060, Guangdong, Peoples R
China.
电子邮件地址: hany@szu.edu.cn; xuchen@szu.edu.cn; csgeorge@comp.polyu.edu.hk; limin800@szu.edu.cn
第 3 条，共 274 条
标题: Study on novel Curvature Features for 3D fingerprint recognition
作者: Liu, F (Liu, Feng); Zhang, D (Zhang, David); Shen, LL (Shen, Linlin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: The human finger is a three-dimensional object. More information will be provided if 3D fingerprint images are
available compared with 2D fingerprints. This paper explores 3D fingerprint features, as well as their possible applications.
Novel fingerprint features, which are defined as Curvature Features (e.g. curve-skeleton, overall maximum curvatures), are
for the first time proposed and investigated in this paper. Those features are then employed to assist more accurate
fingerprint matching or classify human gender after analyzing their characteristics. A series of experiments are conducted to
evaluate the effectiveness of employing these novel fingerprint features to fingerprint recognition based on the established
database with 541 fingers. Results show that an Equal error Rate (EER) of similar to 15% can be achieved when only
curve-skeleton is used for recognition. But, promising EER of similar to 3.4% is realized by combining curve-skeleton with
classical 2D fingerprint features for recognition that indicates the prospect of 3D fingerprint recognition. The proposed
overall maximum curvatures are found to be helpful for human gender classification. (C) 2015 Elsevier B.V. All rights
reserved.
地址: [Liu, Feng; Shen, Linlin] Shenzhen Univ, Comp Vis Inst, Sch Comp Sci & Software Engn, Shenzhen, Guangdong,
Peoples R China.
[Zhang, David] Hong Kong Polytech Univ, Dept Comp, Kowloon, Hong Kong, Peoples R China.
通讯作者地址: Liu, F (通讯作者),Shenzhen Univ, Comp Vis Inst, Sch Comp Sci & Software Engn, Shenzhen,
Guangdong, Peoples R China.
电子邮件地址: csfliu87@gmail.com; csdzhang@comp.polyu.edu.hk; llshen@szu.edu.cn
第 4 条，共 274 条
标题: Recommending high-utility search engine queries via a query-recommending model
作者: Wang, JG (Wang, JianGuo); Huang, JZ (Huang, Joshua Zhexue); Guo, JF (Guo, Jiafeng); Lan, YY (Lan, Yanyan)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Query recommendation technology is of great importance for search engines, because it can assist users to find the
information they require. Many query recommendation algorithms have been proposed, but they all aim to recommend
similar queries and cannot guarantee the usefulness of the recommended queries. In this paper, we argue that it is more
important to recommend high-utility queries, i.e., queries that would induce users to search for more useful information. For
this purpose, we propose a query-recommending model to rank candidate queries according to their utilities and to
recommend those that are useful to users. The query-recommending model ranks a candidate query by assessing the joint
probability that the query is selected by the user, that the obtained search results are subsequently clicked by the user, and
that the clicked search results ultimately satisfy the user's information need. Three utilities were defined to solve the model:
query-level utility, representing the attractiveness of a query to the user; perceived utility, measuring the user's probability
of clicking on the search results; and posterior utility, measuring the useful information obtained by the user from the
clicked search results. The methods that were used to compute these three utilities from the query log data are presented.
The experimental results that were obtained by using real query log data demonstrated that the proposed
query-recommending model outperformed six other baseline methods in generating more useful recommendations. (C)
2015 Elsevier B.V. All rights reserved.
地址: [Wang, JianGuo] Univ Chinese Acad Sci, Shenzhen Coll Adv Technol, Shenzhen Key Lab High Performance Data
Min, Shenzhen Inst Adv Technol,Chinese Acad Sci, Shenzhen 518055, Peoples R China.
[Huang, Joshua Zhexue] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
[Guo, Jiafeng; Lan, Yanyan] Chinese Acad Sci, Inst Comp Technol, Beijing 100190, Peoples R China.
通讯作者地址: Wang, JG (通讯作者),Univ Chinese Acad Sci, Shenzhen Coll Adv Technol, Shenzhen Key Lab High
Performance Data Min, Shenzhen Inst Adv Technol,Chinese Acad Sci, 1068 Xueyuan Ave, Shenzhen 518055, Peoples R
China.
电子邮件地址: wangjg@siat.ac.cn
第 5 条，共 274 条
标题: Manifold discriminant regression learning for image classification
作者: Lu, YW (Lu, Yuwu); Lai, ZH (Lai, Zhihui); Fan, ZZ (Fan, Zizhu); Cui, JR (Cui, Jinrong); Zhu, Q (Zhu, Qi)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Least square regression (LSR) and its variants have been widely used for classification tasks. However, LSR-based
methods ignore the local geometry structure of the data and the transformation matrix is not sparse or robust. In this paper, a
novel linear regression (LR) framework is proposed for image classification. Two concrete algorithms are proposed under
the framework, which are named manifold discriminant regression learning (MDRL) and robust manifold discriminant
regression learning (RMDRL). MDRL introduces different norms for different purposes in the learning steps. MDRL
introduces a within-class graph and between-class graph to compute an optimal subspace that can separate data points
belonging to different class as far as possible and keep the data points from the same class closely. MDRL joints different
norms constraints to generate sparse projections for feature extraction and classification. To enhance the robustness of
discriminative LSR (DLSR), RMDRL uses the nuclear norm as a regularization term to learn a robust projection matrix.
Extensive experiments are conducted on many databases to evaluate the performance of the proposed methods and the
states-of-the-art algorithms. The experimental results indicate that our proposed methods outperform the related algorithms.
(C) 2015 Elsevier B.V. All rights reserved.
地址: [Lu, Yuwu] Harbin Inst Technol, Shenzhen Grad Sch, Biocomp Res Ctr, Shenzhen, Peoples R China.
[Lai, Zhihui] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Fan, Zizhu] East China Jiaotong Univ, Sch Basic Sci, Nanchang, Peoples R China.
[Cui, Jinrong] South China Agr Univ, Coll Informat, Guangzhou, Guangdong, Peoples R China.
[Zhu, Qi] Nanjing Univ Aeronaut & Astronaut, Coll Comp Sci & Technol, Nanjing, Jiangsu, Peoples R China.
通讯作者地址: Lu, YW (通讯作者),Harbin Inst Technol, Shenzhen Grad Sch, Biocomp Res Ctr, Shenzhen, Peoples R
China.
电子邮件地址: luyuwu2008@163.com
第 6 条，共 274 条
标题: A double-module immune algorithm for multi-objective optimization problems
作者: Liang, ZP (Liang, Zhengping); Song, RZ (Song, Ruizhen); Lin, QZ (Lin, Qiuzhen); Du, ZH (Du, Zhihua); Chen, JY
(Chen, Jianyong); Ming, Z (Ming, Zhong); Yu, JP (Yu, Jianping)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Multi-objective optimization problems (MOPs) have become a research hotspot, as they are commonly encountered
in scientific and engineering applications. When solving some complex MOPs, it is quite difficult to locate the entire
Pareto-optimal front. To better settle this problem, a novel double-module immune algorithm named DMMO is presented,
where two evolutionary modules are embedded to simultaneously improve the convergence speed and population diversity.
The first module is designed to optimize each objective independently by using a sub-population composed with the
competitive individuals in this objective. Differential evolution crossover is performed here to enhance the corresponding
objective. The second one follows the traditional procedures of immune algorithm, where proportional cloning,
recombination and hyper-mutation operators are operated to concurrently strengthen the multiple objectives. The
performance of DMMO is validated by 16 benchmark problems, and further compared with several multi-objective
algorithms, such as NSGA-II, SPEA2, SMSEMOA, MOEA/D, SMPSO, NNIA and MIMO. Experimental studies indicate
that DMMO performs better than the compared targets on most of test problems and the advantages of double modules in
DMMO are also analyzed. (C) 2015 Elsevier B.V. All rights reserved.
地址: [Liang, Zhengping; Song, Ruizhen; Lin, Qiuzhen; Du, Zhihua; Chen, Jianyong; Ming, Zhong; Yu, Jianping]
Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
通讯作者地址: Lin, QZ (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
电子邮件地址: qiuzhlin@szu.edu.cn
第 7 条，共 274 条
标题: A novel hybrid multi-objective immune algorithm with adaptive differential evolution
作者: Lin, QZ (Lin, Qiuzhen); Zhu, QL (Zhu, Qingling); Huang, PZ (Huang, Peizhi); Chen, JY (Chen, Jianyong); Ming, Z
(Ming, Zhong); Yu, JP (Yu, Jianping)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In this paper, we propose a novel hybrid multi-objective immune algorithm with adaptive differential evolution,
named ADE-MOIA, in which the introduction of differential evolution (DE) into multi-objective immune algorithm
(MOIA) combines their respective advantages and thus enhances the robustness to solve various kinds of MOPs. In
ADE-MOIA, in order to effectively cooperate DE with MOIA, we present a novel adaptive DE operator, which includes a
suitable parent selection strategy and a novel adaptive parameter control approach. When performing DE operation, two
parents are respectively picked from the current evolved and dominated population in order to provide a correct
evolutionary direction. Moreover, based on the evolutionary progress and the success rate of offspring, the crossover rate
and scaling factor in DE operator are adaptively varied for each individual. The proposed adaptive DE operator is able to
improve both of the convergence speed and population diversity, which are validated by the experimental studies. When
comparing ADE-MOIA with several nature-inspired heuristic algorithms, such as NSGA-II, SPEA2, AbYSS,
MOEA/D-DE, MIMO and (DMOPSO)-M-2, simulations show that ADE-MOIA performs better on most of 21 well-known
benchmark problems. (C) 2015 Published by Elsevier Ltd.
地址: [Lin, Qiuzhen; Zhu, Qingling; Huang, Peizhi; Chen, Jianyong; Ming, Zhong; Yu, Jianping] Shenzhen Univ, Coll
Comp Sci & Software Engn, Shenzhen, Peoples R China.
通讯作者地址: Chen, JY (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
电子邮件地址: qiuzhlin@szu.edu.cn; jychen@szu.edu.cn
第 8 条，共 274 条
标题: A novel hybrid shuffled frog leaping algorithm for vehicle routing problem with time windows
作者: Luo, JP (Luo, Jianping); Li, X (Li, Xia); Chen, MR (Chen, Min-Rong); Liu, HW (Liu, Hongwei)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: This paper proposes a novel hybrid shuffled frog leaping algorithm (HSFLA) for vehicle routing problem with time
windows (VRPTW). The diversity control strategy is developed to construct the memeplexes of the HSFLA and avoid
ending the search prematurely. The modified clone selection procedure is presented to improve the quality of the solutions
and bring more diversity to the population. Improved and extended extremal optimization (EO) with alternative move
operators is also introduced to the exploitation of the algorithm. Furthermore, the adaptive soft time windows penalty
measure is proposed to allow the existence of infeasible solutions in the evolution process. Our approach is estimated and
compared with other state-of-the-art heuristics using Solomon and Cordeau VRPTW test sets. The experimental results
show that the presented algorithm is very effective for handling VRPTW. (C) 2015 Elsevier Inc. All rights reserved.
地址: [Luo, Jianping; Li, Xia; Chen, Min-Rong; Liu, Hongwei] Shenzhen Univ, Coll Informat Engn, Shettzhen Key Lab
Adv Commun & Informat Proc, Shenzhen 518060, Peoples R China.
通讯作者地址: Luo, JP (通讯作者),Shenzhen Univ, Coll Informat Engn, Shettzhen Key Lab Adv Commun & Informat
Proc, Shenzhen 518060, Peoples R China.
电子邮件地址: camelrock@126.com
第 9 条，共 274 条
标题: Standard Plane Localization in Fetal Ultrasound via Domain Transferred Deep Neural Networks
作者: Chen, H (Chen, Hao); Ni, D (Ni, Dong); Qin, J (Qin, Jing); Li, SL (Li, Shengli); Yang, X (Yang, Xin); Wang, TF
(Wang, Tianfu); Heng, PA (Heng, Pheng Ann)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Automatic localization of the standard plane containing complicated anatomical structures in ultrasound (US) videos
remains a challenging problem. In this paper, we present a learning-based approach to locate the fetal abdominal standard
plane (FASP) in US videos by constructing a domain transferred deep convolutional neural network (CNN). Compared with
previous works based on low-level features, our approach is able to represent the complicated appearance of the FASP and
hence achieve better classification performance. More importantly, in order to reduce the overfitting problem caused by the
small amount of training samples, we propose a transfer learning strategy, which transfers the knowledge in the low layers
of a base CNN trained from a large database of natural images to our task-specific CNN. Extensive experiments
demonstrate that our approach outperforms the state-of-the-art method for the FASP localization as well as the CNN only
trained on the limited US training samples. The proposed approach can be easily extended to other similar medical image
computing problems, which often suffer from the insufficient training samples when exploiting the deep CNN to represent
high-level features.
地址: [Chen, Hao; Heng, Pheng Ann] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Hong Kong, Hong Kong,
Peoples R China.
[Ni, Dong; Qin, Jing; Yang, Xin; Wang, Tianfu] Shenzhen Univ, Sch Med, Guangdong Key Lab Biomed Measurements &
Ultrasoun, Natl Reg Key Technol Engn Lab Med Ultrasound, Shenzhen 518060, Guangdong, Peoples R China.
[Li, Shengli] Hosp Nanfang Med Univ, Affiliated Shenzhen Maternal & Child Healthcare, Dept Ultrasound, Shenzhen
518103, Peoples R China.
[Heng, Pheng Ann] Chinese Acad Sci, Shenzhen Inst Adv Technol, Ctr Human Comp Interact, Shenzhen 518055, Peoples
R China.
通讯作者地址: Chen, H (通讯作者),Chinese Univ Hong Kong, Dept Comp Sci & Engn, Hong Kong, Hong Kong, Peoples
R China.
电子邮件地址: nidong@szu.edu.cn; jqin@szu.edu.cn
第 10 条，共 274 条
标题: Anti-forensics of double JPEG compression with the same quantization matrix
作者: Li, HD (Li, Haodong); Luo, WQ (Luo, Weiqi); Huang, JW (Huang, Jiwu)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Double JPEG compression detection plays an important role in digital image forensics. Recently, Huang et al. (IEEE
Trans Inf Forensics Security 5(4):848-856, 2010) first pointed out that the number of different discrete cosine transform
(DCT) coefficients would monotonically decrease when repeatedly compressing a JPEG image with the same quantization
matrix, and a strategy based on random permutation was developed to expose such an operation successfully. In this paper,
we propose an anti-forensic method to fool this method. The proposed method tries to slightly modify the DCT coefficients
for confusing the traces introduced by double JPEG compression with the same quantization matrix. By investigating the
relationship between the DCT coefficients of the first compression and those of the second one, we determine the quantity
of modification by constructing a linear model. Furthermore, in order to improve the security of anti-forensics, the locations
of modification are adaptively selected according to the complexity of the image texture. The extensive experiments
evaluated on 10,000 natural images have shown that the proposed method can effectively confuse the detector proposed in
Huang et al. (IEEE Trans Inf Forensics Security 5(4):848-856, 2010), while keeping higher visual quality and leaving fewer
other detectable statistical artifacts.
地址: [Li, Haodong] Sun Yat Sen Univ, Sch Informat Sci & Technol, Guangzhou 510006, Guangdong, Peoples R China.
[Luo, Weiqi] Sun Yat Sen Univ, Sch Software, Guangzhou 510006, Guangdong, Peoples R China.
[Huang, Jiwu] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Luo, WQ (通讯作者),Sun Yat Sen Univ, Sch Software, Guangzhou 510006, Guangdong, Peoples R China.
电子邮件地址: lihaod@mail2.sysu.edu.cn; weiqi.luo@yahoo.com; jwhuang@szu.edu.cn
第 11 条，共 274 条
标题: A topic-biased user reputation model in rating systems
作者: Li, BC (Li, Baichuan); Li, RH (Li, Rong-Hua); King, I (King, Irwin); Lyu, MR (Lyu, Michael R.); Yu, JX (Yu,
Jeffrey Xu)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In rating systems like Epinions and Amazon's product review systems, users rate items on different topics to yield
item scores. Traditionally, item scores are estimated by averaging all the ratings with equal weights. To improve the
accuracy of estimated item scores, user reputation [a.k.a., user reputation (UR)] is incorporated. The existing algorithms on
UR, however, have underplayed the role of topics in rating systems. In this paper, we first reveal that UR is topic-biased
from our empirical investigation. However, existing algorithms cannot capture this characteristic in rating systems. To
address this issue, we propose a topic-biased model (TBM) to estimate UR in terms of different topics as well as item
scores. With TBM, we develop six topic-biased algorithms, which are subsequently evaluated with experiments using both
real-world and synthetic data sets. Results of the experiments demonstrate that the topic-biased algorithms effectively
estimate UR across different topics and produce more robust item scores than previous reputation-based algorithms, leading
to potentially more robust rating systems.
地址: [Li, Baichuan] Baidu, Shenzhen, Peoples R China.
[Li, Rong-Hua] Shenzhen Univ, Guangdong Prov Key Lab Popular High Performance C, Shenzhen, Peoples R China.
[King, Irwin; Lyu, Michael R.] Chinese Univ Hong Kong, Shenzhen Res Inst, Shenzhen Key Lab Rich Media Big Data
Analyt & App, Shenzhen, Peoples R China.
[King, Irwin; Lyu, Michael R.] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Shatin, Hong Kong, Peoples R China.
[Yu, Jeffrey Xu] Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Shatin, Hong Kong, Peoples R China.
通讯作者地址: Li, BC (通讯作者),Baidu, Shenzhen, Peoples R China.
电子邮件地址: tobcli@gmail.com
第 12 条，共 274 条
标题: Compressed knowledge transfer via factorization machine for heterogeneous collaborative recommendation
作者: Pan, WK (Pan, Weike); Liu, ZD (Liu, Zhuode); Ming, Z (Ming, Zhong); Zhong, H (Zhong, Hao); Wang, X (Wang,
Xin); Xu, CF (Xu, Congfu)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Collaborative recommendation has attracted various research works in recent years. However, an important problem
setting, i.e., "a user examined several items but only rated a few", has not received much attention yet. We coin this problem
heterogeneous collaborative recommendation (HCR) from the perspective of users' heterogeneous feedbacks of implicit
examinations and explicit ratings. In order to fully exploit such different types of feedbacks, we propose a novel and generic
solution called compressed knowledge transfer via factorization machine (CKT-FM). Specifically, we assume that the
compressed knowledge of user homophily and item correlation, i.e., user groups and item sets behind two types of
feedbacks, are similar and then design a two-step transfer learning solution including compressed knowledge mining and
integration. Our solution is able to transfer high quality knowledge via noise reduction, to model rich pairwise interactions
among individual-level and cluster-level entities, and to adapt the potential inconsistent knowledge from implicit feedbacks
to explicit feedbacks. Furthermore, the analysis on time complexity and space complexity shows that our solution is much
more efficient than the state-of-the-art method for heterogeneous feedbacks. Extensive empirical studies on two large data
sets show that our solution is significantly better than the state-of-the-art non-transfer learning method w.r.t.
recommendation accuracy, and is much more efficient than that of leveraging the raw implicit examinations directly instead
of compressed knowledge w.r.t. CPU time and memory usage. Hence, our CKT-FM strikes a good balance between
effectiveness and efficiency of knowledge transfer in HCR. (C) 2015 Elsevier B.V. All rights reserved.
地址: [Pan, Weike; Liu, Zhuode; Ming, Zhong] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Guangdong,
Peoples R China.
[Zhong, Hao; Wang, Xin; Xu, Congfu] Zhejiang Univ, Coll Comp Sci, Inst Artificial Intelligence, Hangzhou, Zhejiang,
Peoples R China.
通讯作者地址: Ming, Z (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Guangdong, Peoples R
China.
电子邮件地址: panweike@szu.edu.cn; zero.lzd@gmail.com; mingz@szu.edu.cn; haozhong@zju.edu.cn;
cswangxinm@zju.edu.cn; xucongfu@zju.edu.cn
第 13 条，共 274 条
标题: Improved Hash Functions for Cancelable Fingerprint Encryption Schemes
作者: Yang, YJ (Yang, Yijun); Yu, JP (Yu, Jianping); Zhang, Q (Zhang, Qian); Meng, FY (Meng, Fanyang)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In order to solve the prealignment problem, this paper constructs new fingerprint features which will not change
along with the rotation of fingerprint image. And then the SHA1 algorithm is improved in four aspects: the modification of
original register values, the modification of additive constants, the modification of logic functions, the modification of
compression functions, then this paper improves the SHA2 algorithm in two aspects: the modification of compression
functions and the modification of message word. Based on that, two cancelable and irreversible fingerprint encryption
schemes are proposed in this paper. The efficiency analysis and security authentication show that these schemes have
enhanced the security without increasing the complexity.
地址: [Yang, Yijun; Yu, Jianping; Zhang, Qian; Meng, Fanyang] Shenzhen Univ, ATR Key Lab, Shenzhen 518060,
Guangdong, Peoples R China.
[Yang, Yijun; Yu, Jianping; Zhang, Qian; Meng, Fanyang] Guangdong Regular Higher Educ Inst, Key Lab Intelligent
Informat Proc, Shenzhen, Guangdong, Peoples R China.
[Yang, Yijun; Yu, Jianping; Meng, Fanyang] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Guangdong, Peoples
R China.
[Zhang, Qian] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Guangdong, Peoples R China.
通讯作者地址: Yang, YJ (通讯作者),Shenzhen Univ, ATR Key Lab, Shenzhen 518060, Guangdong, Peoples R China.
电子邮件地址: yujpszu@tom.com
第 14 条，共 274 条
标题: A Strategy of Clustering Modification Directions in Spatial Image Steganography
作者: Li, B (Li, Bin); Wang, M (Wang, Ming); Li, XL (Li, Xiaolong); Tan, SQ (Tan, Shunquan); Huang, JW (Huang, Jiwu)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Most of the recently proposed steganographic schemes are based on minimizing an additive distortion function
defined as the sum of embedding costs for individual pixels. In such an approach, mutual embedding impacts are often
ignored. In this paper, we present an approach that can exploit the interactions among embedding changes in order to reduce
the risk of detection by steganalysis. It employs a novel strategy, called clustering modification directions (CMDs), based
on the assumption that when embedding modifications in heavily textured regions are locally heading toward the same
direction, the steganographic security might be improved. To implement the strategy, a cover image is decomposed into
several subimages, in which message segments are embedded with well-known schemes using additive distortion functions.
The costs of pixels are updated dynamically to take mutual embedding impacts into account. Specifically, when neighboring
pixels are changed toward a positive/negative direction, the cost of the considered pixel is biased toward the same direction.
Experimental results show that our proposed CMD strategy, incorporated into existing steganographic schemes, can
effectively overcome the challenges posed by the modern steganalyzers with high-dimensional features.
地址: [Li, Bin; Wang, Ming; Huang, Jiwu] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
[Li, Bin; Wang, Ming; Tan, Shunquan; Huang, Jiwu] Shenzhen Key Lab Media Secur, Shenzhen 518060, Peoples R China.
[Li, Xiaolong] Peking Univ, Inst Comp Sci & Technol, Beijing 100871, Peoples R China.
[Tan, Shunquan] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Li, B (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: libin@szu.edu.cn; 2120130422@szu.edu.cn; lixiaolong@pku.edu.cn; tansq@szu.edu.cn;
jwhuang@szu.edu.cn
第 15 条，共 274 条
标题: Defending jamming attack in wide-area monitoring system for smart grid
作者: Niu, JW (Niu, Jianwei); Ming, Z (Ming, Zhong); Qiu, MK (Qiu, Meikang); Su, H (Su, Hai); Gu, ZH (Gu, Zonghua);
Qin, X (Qin, Xiao)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Smart Grid is a promising technology to efficiently manage the power use, transmission and production. An efficient
and dependable smart power grid relies on the secure and reliable real-time data collection and transmission service
provided by an underlying backbone communication network. Cognitive radio network is an emerging wireless
communication technology that fits communication needs in smart grid. However, the cognitive radio is vulnerable to
jamming attacks that can disturb the real time communication. The loss of the timely information from the remotely
distributedly deployed sensors can cause the loss of control of the system. In this paper, we focus on the availability of the
communication services provided by the cognitive radio nodes deployed over the smart grid. We consider the jamming
attacks to this wireless network. We propose to defeat the jamming attacks by introducing the combined online optimization
and linear programming to the smart grid to enable the system to heal automatically from the jamming attack.
地址: [Niu, Jianwei] Beihang Univ, State Key Lab Software Dev Environm, Beijing 100191, Peoples R China.
[Ming, Zhong] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 310027, GD, Peoples R China.
[Qiu, Meikang] Pace Univ, Dept Comp Sci, New York, NY 10038 USA.
[Su, Hai] Univ Kentucky, Dept Elect & Comp Engn, Lexington, KY 40506 USA.
[Gu, Zonghua] Zhejiang Univ, Coll Comp Sci, Hangzhou 310027, Zhejiang, Peoples R China.
[Qin, Xiao] Auburn Univ, Dept Comp Sci & Software Engn, Auburn, AL 36849 USA.
通讯作者地址: Ming, Z (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 310027, GD, Peoples R
China.
电子邮件地址: niujianwei@buaa.edu.cn; mingz@szu.edu.cn; mqiu@pace.edu; hsu@engr.uky.edu; zgu@zju.edu.cn;
xqin@auburn.edu
第 16 条，共 274 条
标题: A Unifying Model and Analysis of P2P VoD Replication and Scheduling
作者: Zhou, YP (Zhou, Yipeng); Fu, TZJ (Fu, Tom Z. J.); Chiu, DM (Chiu, Dah Ming)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: We consider a peer-to-peer (P2P)-assisted video-on-demand (VoD) system where each peer can store a relatively
small number of movies to offload the server when these movies are requested. User requests are stochastic based on some
movie popularity distribution. The problem is how to replicate (or place) content at peer storage to minimize the server load.
Several variations of this replication problem have been studied recently with somewhat different conclusions. In this paper,
we first point out and explain that the main difference between these studies is in how they model the scheduling of peers to
serve user requests, and show that these different scheduling assumptions will lead to different "optimal" replication
strategies. We then propose a unifying request scheduling model, parameterized by the maximum number of peers that can
be used to serve a single request. This scheduling is called Fair Sharing with Bounded Degree (FSBD). Based on this
unifying model, we can compare the different replication strategies for different degree bounds and see how and why
different replication strategies are favored depending on the degree. We also propose a simple (primarily) distributed
replication algorithm and show that this algorithm is able to adapt itself to work well for different degrees in scheduling.
地址: [Zhou, Yipeng] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518000, Peoples R China.
[Fu, Tom Z. J.] Illinois Singapore Pte Ltd, Adv Digital Sci Ctr, Singapore 138632, Singapore.
[Chiu, Dah Ming] Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Zhou, YP (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518000, Peoples R
China.
电子邮件地址: ypzhou@szu.edu.cn; fuzhengjia@gmail.com; dmchiu@ie.cuhk.edu.hk
第 17 条，共 274 条
标题: Rotation invariant color texture classification using multiple sub-DLBPs
作者: Lian, GY (Lian, Guoyun)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: It is known that the rotations of real-world color textures will vary arbitrarily. This paper presents a novel, simple, yet
powerful method for rotation-invariant color texture classification. Firstly, we define a Distance-based Local Binary Pattern
(DLBP) descriptor to characterize the color texture. By learning the joint distribution of the rotation-invariant DLBP and
color intensity information, we define our Multiple Sub-DLBPs (MS_DLBP) descriptor. The MS_DLBP features defined in
this paper are invariant to rotation. Here, we also compared seven important color spaces in terms of their effectiveness in
our proposed MS_DLBP approach. The experimental results on the Outex and CUReT databases show the defined DLBP
descriptor performs better than the existing color LBP descriptors and the proposed MS_DLBP approach is very robust to
rotation invariance and outperforms state-of-the-art texture analysis methods. Also, HSV color space is shown to
outperform the other color spaces in many cases. (C) 2015 Elsevier Inc. All rights reserved.
地址: [Lian, Guoyun] Shenzhen Polytech, Sch Comp Engn, Shenzhen 518055, Peoples R China.
[Lian, Guoyun] Shenzhen Univ, Shenzhen 518060, Peoples R China.
通讯作者地址: Lian, GY (通讯作者),Shenzhen Polytech, Sch Comp Engn, Shenzhen 518055, Peoples R China.
电子邮件地址: lianguoyun@szpt.edu.cn
第 18 条，共 274 条
标题: A reversible data hiding method with contrast enhancement for medical images
作者: Wu, HT (Wu, Hao-Tian); Huang, JW (Huang, Jiwu); Shi, YQ (Shi, Yun-Qing)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In this paper, a reversible data hiding method with contrast enhancement is presented for medical images. Firstly,
image background segmentation is performed and the principal gray-scale values in the segmented background are
identified. By excluding the corresponding histogram bins from being expanded for data hiding, the contrast of region of
interest (ROI) in medical images can be selectively enhanced. Considering the characteristics of pixel distribution, we
develop a new pre-processing strategy to reduce the visual distortions that may be caused. With the proposed method, an
original image can be exactly recovered from the corresponding enhanced image by hiding the side information within it.
The experimental results on a set of medical images show that the visibility of ROI can be improved. Compared with the
previous method, the proposed method can achieve more contrast enhancement effects and better visual quality for medical
images. (C) 2015 Elsevier Inc. All rights reserved.
地址: [Wu, Hao-Tian] Jiangnan Univ, Sch Digital Media, Wuxi 214122, JS, Peoples R China.
[Huang, Jiwu] Shenzhen Univ, Coll Informat Engn, Shenzhen, Peoples R China.
[Shi, Yun-Qing] New Jersey Inst Technol, Dept ECE, Newark, NJ 07103 USA.
通讯作者地址: Wu, HT (通讯作者),Jiangnan Univ, Sch Digital Media, Wuxi 214122, JS, Peoples R China.
电子邮件地址: htwu@jiangnan.edu.cn; jwhuang@szu.edu.cn; shi@njit.edu
第 19 条，共 274 条
标题: Nonrigid Structure From Motion via Sparse Representation
作者: Li, K (Li, Kun); Yang, JY (Yang, Jingyu); Jiang, JM (Jiang, Jianmin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: This paper proposes a new approach for nonrigid structure from motion with occlusion, based on sparse
representation. We address the occlusion problem based on the latest developments on sparse representation: matrix
completion, which can recover the observation matrix that has high percentages of missing data and can also reduce the
noises and outliers in the known elements. We introduce sparse transform to the joint estimation of 3-D shapes and motions.
3-D shape trajectory space is fit by wavelet basis to achieve better modeling of complex motion. Experimental results on
datasets without and with occlusion show that our method can better estimate the 3-D shapes and motions, compared with
state-of-the-art algorithms.
地址: [Li, Kun] Tianjin Univ, Sch Comp Sci & Technol, Tianjin Key Lab Cognit Comp & Applicat, Tianjin 300072,
Peoples R China.
[Yang, Jingyu] Tianjin Univ, Sch Elect Informat Engn, Tianjin 300072, Peoples R China.
[Jiang, Jianmin] Shenzhen Univ, Res Inst Future Media Comp, Shenzhen 518060, Peoples R China.
通讯作者地址: Yang, JY (通讯作者),Tianjin Univ, Sch Elect Informat Engn, Tianjin 300072, Peoples R China.
电子邮件地址: lik@tju.edu.cn; yjy@tju.edu.cn; jianmin.jiang@szu.edu.cn
第 20 条，共 274 条
标题: Network-Based Robust H-2/H-infinity Control for Linear Systems With Two-Channel Random Packet Dropouts and
Time Delays
作者: Qiu, L (Qiu, Li); Shi, Y (Shi, Yang); Yao, FQ (Yao, Fengqi); Xu, G (Xu, Gang); Xu, BG (Xu, Bugong)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: This paper focuses on the robust output feedback H-2/H-infinity control issue for a class of discrete-time networked
control systems with uncertain parameters and external disturbance. Sensor-to-controller and controller-to-actuator packet
dropouts and time delays are considered simultaneously. According to the stochastic characteristic of the packet dropouts
and time delays, a model based on a Markov jump system framework is proposed to randomly compensate for the adverse
effect of the two-channel packet dropouts and time delays. To analyze the robust stability of the resulting closed-loop
system, a Lyapunov function is proposed, based on which sufficient conditions for the existence of the H-2/H-infinity
controller are derived in terms of linear matrix inequalities, ensuring robust stochastic stability as well as the prescribed H-2
and H-infinity performance. Finally, an angular positioning system is exploited to demonstrate the effectiveness and
applicability of the proposed design strategy.
地址: [Qiu, Li; Xu, Gang] Shenzhen Univ, Coll Mechatron & Control Engn, Shenzhen Key Lab Urban Rail Transit,
Shenzhen 518060, Peoples R China.
[Shi, Yang] Univ Victoria, Dept Mech Engn, Victoria, BC V8W 3P6, Canada.
[Shi, Yang] Hubei Univ Technol, Sch Elect & Elect Engn, Wuhan 430068, Peoples R China.
[Yao, Fengqi] Anhui Univ Technol, Sch Elect Engn & Informat, Maanshan 243000, Peoples R China.
[Xu, Bugong] S China Univ Technol, Sch Automat Sci & Engn, Guangzhou 510641, Guangdong, Peoples R China.
通讯作者地址: Qiu, L (通讯作者),Shenzhen Univ, Coll Mechatron & Control Engn, Shenzhen Key Lab Urban Rail
Transit, Shenzhen 518060, Peoples R China.
电子邮件地址: yshi@uvic.ca
第 21 条，共 274 条
标题: Visual-Patch-Attention-Aware Saliency Detection
作者: Jian, MW (Jian, Muwei); Lam, KM (Lam, Kin-Man); Dong, JY (Dong, Junyu); Shen, LL (Shen, Linlin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: The human visual system (HVS) can reliably perceive salient objects in an image, but, it remains a challenge to
computationally model the process of detecting salient objects without prior knowledge of the image contents. This paper
proposes a visual-attention-aware model to mimic the HVS for salient-object detection. The informative and directional
patches can be seen as visual stimuli, and used as neuronal cues for humans to interpret and detect salient objects. In order
to simulate this process, two typical patches are extracted individually and in parallel from the intensity channel and the
discriminant color channel, respectively, as the primitives. In our algorithm, an improved wavelet-based salient-patch
detector is used to extract the visually informative patches. In addition, as humans are sensitive to orientation features, and
as directional patches are reliable cues, we also propose a method for extracting directional patches. These two different
types of patches are then combined to form the most important patches, which are called preferential patches and are
considered as the visual stimuli applied to the HVS for salient-object detection. Compared with the state-of-the-art methods
for salient-object detection, experimental results using publicly available datasets show that our produced algorithm is
reliable and effective.
地址: [Jian, Muwei; Dong, Junyu] Ocean Univ China, Dept Comp Sci & Technol, Qingdao 266100, Peoples R China.
[Jian, Muwei; Lam, Kin-Man] Hong Kong Polytech Univ, Dept Elect & Informat Engn, Ctr Signal Proc, Hong Kong, Hong
Kong, Peoples R China.
[Jian, Muwei] Shandong Univ, Sch Mech Elect & Informat Engn, Weihai 264209, Peoples R China.
[Shen, Linlin] Shenzhen Univ, Coll Comp Sci & Software Engn, Comp Vis Inst, Shenzhen 518060, Peoples R China.
通讯作者地址: Lam, KM (通讯作者),Hong Kong Polytech Univ, Dept Elect & Informat Engn, Ctr Signal Proc, Hong
Kong, Hong Kong, Peoples R China.
电子邮件地址: muwei.jian@connect.polyu.hk; enkmlam@polyu.edu.hk; dongjunyu@ouc.edu.cn; llshen@szu.edu.cn
第 22 条，共 274 条
标题: Video Popularity Dynamics and Its Implication for Replication
作者: Zhou, YP (Zhou, Yipeng); Chen, L (Chen, Liang); Yang, CF (Yang, Chunfeng); Chiu, DM (Chiu, Dah Ming)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Popular online video-on-demand (VoD) services all maintain a large catalog of videos for their users to access. The
knowledge of video popularity is very important for system operation, such as video caching on content distribution
network (CDN) servers. The video popularity distribution at a given time is quite well understood. We study how the video
popularity changes with time, for different types of videos, and apply the results to design video caching strategies. Our
study is based on analyzing the video access levels over time, based on data provided by a large video service provider. Our
main finding is, while there are variations, the glory days of a video's popularity typically pass by quickly and the
probability of replaying a video by the same user is low. The reason appears to be due to fairly regular number of users and
view time per day for each user, and continuous arrival of new videos. All these facts will affect how video popularity
changes, hence also affect the optimal video caching strategy. Based on the observation from our measurement study, we
propose a mixed replication strategy (of LFU and FIFO) that can handle different kinds of videos. Offline strategy assuming
tomorrow's video popularity is known in advance is used as a performance benchmark. Through trace-driven simulation, we
show that the caching performance achieved by the mixed strategy is very close to the performance achieved by the offline
strategy.
地址: [Zhou, Yipeng] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518000, Peoples R China.
[Chen, Liang] Shenzhen Univ, Coll Informat Engn, Shenzhen 518000, Peoples R China.
[Yang, Chunfeng; Chiu, Dah Ming] Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong 999077, Hong Kong,
Peoples R China.
通讯作者地址: Chen, L (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518000, Peoples R China.
电子邮件地址: ypzhou@szu.edu.cn; lchen@szu.edu.cn; yc012@ie.cuhk.edu.hk; dmchiu@ie.cuhk.edu.hk
第 23 条，共 274 条
标题: An Adaptive Backoff Algorithm Based on Channel Utilization for IEEE 802.11
作者: Xie, N (Xie, Ning); Zhang, L (Zhang, Li); Wu, J (Wu, Jun); Wang, H (Wang, Hui)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Though the binary exponential backoff (BEB) is a popular algorithm of collision avoidance in the IEEE 802.11 MAC
protocol due to simple implementation, it causes the short-term unfair problem. Another popular algorithm is the history
based adaptive backoff (HBAB), HBAB has better performance than conventional backoff algorithm by taking the channel
states of past trials into account, where the length of its contention window (CW) is set artificially based on the prior
knowledge of channel states. However, the length of CW in HBAB cannot be dynamically allocated and it often diverges
from the optimal value. Therefore the application of HBAB will be limited in practical scenarios. In this paper, based on
HBAB, we propose a new backoff algorithm which can control the length of CW according to the channel utilization ratio
adaptively. The proposed algorithm is simple to implementation and can offer higher throughput and lower delay, compared
with BEB and HBAB. Simulation results validate the superiority of the proposed algorithm.
地址: [Xie, Ning; Zhang, Li; Wu, Jun; Wang, Hui] Shenzhen Univ, CIE, Shenzhen 518060, Guangdong, Peoples R China.
[Xie, Ning; Wang, Hui] Shenzhen Key Lab Adv Commun & Informat Proc, Shenzhen 518060, Peoples R China.
通讯作者地址: Xie, N (通讯作者),Shenzhen Univ, CIE, Shenzhen 518060, Guangdong, Peoples R China.
电子邮件地址: ningxie@szu.edu.cn
第 24 条，共 274 条
标题: Multiple strategies based orthogonal design particle swarm optimizer for numerical optimization
作者: Qin, QD (Qin, Quande); Cheng, S (Cheng, Shi); Zhang, QY (Zhang, Qingyu); Wei, YM (Wei, Yiming); Shi, YH
(Shi, Yuhui)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: In the canonical partide swarm optimization (PSO), each particle updates its velocity and position by taking its
historical best experience and its neighbors' best experience as exemplars and adding them together. Its performance is
largely dependent on the employed exemplars. However, this learning strategy in the canonical PSO is inefficient when
complex problems are being optimized. In this paper, Multiple Strategies based Orthogonal Design PSO (MSODPSO) is
presented, in which the social-only model or the cognition-only model is utilized in each particle's velocity update, and an
orthogonal design (OD) method is used with a small probability to construct a new exemplar in each iteration. In order to
enhance the efficiency of OD method and obtain more efficient exemplar, four auxiliary vector generating strategies are
designed. In addition, a global best mutation operator including non-uniform mutation and Gaussian mutation is employed
to improve its global search ability. The MSODPSO can be applied to PSO with the global or local structure, yielding
MSODPSO-G and MSODPSO-L algorithms, respectively. To verify the effectiveness of the proposed algorithms, a set of
24 benchmark functions in 30 and 100 dimensions are utilized in experimental studies. The proposed algorithm is also
tested on a real-world economic load dispatch (ELD) problem, which is modelled as a non-convex minimization problem
with constraints. The experimental results on the benchmark functions and ELD problems demonstrate that the proposed
MSODPSO-G and MSODPSO-L can offer high-quality solutions. (C) 2015 Elsevier Ltd. All rights reserved.
地址: [Qin, Quande; Zhang, Qingyu] Shenzhen Univ, Dept Management Sci, Shenzhen, Peoples R China.
[Qin, Quande; Zhang, Qingyu] Res Inst Business Analyt & Supply Chain Managemen, Shenzhen, Peoples R China.
[Qin, Quande; Wei, Yiming] Beijing Inst Technol, Sch Management & Econ, Beijing 100081, Peoples R China.
[Qin, Quande; Wei, Yiming] Beijing Inst Technol, Ctr Energy & Environm Policy Res, Beijing 100081, Peoples R China.
[Cheng, Shi] Univ Nottingham Ningbo, Div Comp Sci, Ningbo, Peoples R China.
[Cheng, Shi] Univ Nottingham Ningbo, Int Doctoral Innovat Ctr, Ningbo, Peoples R China.
[Shi, Yuhui] Xian Jiaotong Liverpool Univ, Dept Elect & Elect Engn, Suzhou, Peoples R China.
通讯作者地址: Cheng, S (通讯作者),Univ Nottingham Ningbo, Div Comp Sci, Ningbo, Peoples R China.
电子邮件地址: qinquande@gmail.com; shi.cheng@nottingham.edu.cn; q.yu.zhang@gmail.com; yuhui.shi@xjtlu.edu.cn
第 25 条，共 274 条
标题: Design of fractional order PID controller for automatic regulator voltage system based on multi-objective extremal
optimization
作者: Zeng, GQ (Zeng, Guo-Qiang); Chen, J (Chen, Jie); Dai, YX (Dai, Yu-Xing); Li, LM (Li, Li-Min); Zheng, CW
(Zheng, Chong-Wei); Chen, MR (Chen, Min-Rong)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Design of an effective and efficient fractional order PID (FOND) controller, as a generalization of a standard PID
controller based on fractional order calculus, for an industrial control system to obtain high-quality performances is of great
theoretical and practical significance. From the perspective of multi-objective optimization, this paper presents a novel
FOPID controller design method based on an improved multi-objective extremal optimization (MOEO) algorithm for an
automatic regulator voltage (AVR) system. The problem of designing FOND controller for AVR is firstly formulated as a
multi-objective optimization problem with three objective functions including minimization of integral of absolute error
(IAE), absolute steady-state error, and settling time. Then, an improved MOEO algorithm is proposed to solve this problem
by adopting individual-based iterated optimization mechanism and polynomial mutation (PLM). From the perspective of
algorithm design, the proposed MOEO algorithm is relatively simpler than NSGA-II and single-objective evolutionary
algorithms, such as genetic algorithm (GA), particle swarm optimization (PSO), chaotic anti swarm (CAS) due to its fewer
adjustable parameters. Furthermore, the superiority of proposed MOEO-FOPID condoner to NSGA-II-based FOPID,
single-objective evolutionary algorithms-based FOPID controllers, MOEO-based and NSGA-II-based PID controllers is
demonstrated by extensive experimental results on an AVR system in terms of accuracy and robustness. (C) 2015 Elsevier
B.V. All rights reserved.
地址: [Zeng, Guo-Qiang; Chen, Jie; Dai, Yu-Xing; Li, Li-Min; Zheng, Chong-Wei] Wenzhou Univ, Dept Elect & Elect
Engn, Wenzhou 325035, Peoples R China.
[Chen, Min-Rong] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Zeng, GQ (通讯作者),Wenzhou Univ, Dept Elect & Elect Engn, Wenzhou 325035, Peoples R China.
电子邮件地址: zeng.guoqiang5@gmail.com
第 26 条，共 274 条
标题: A novel discriminant criterion based on feature fusion strategy for face recognition
作者: Chen, WS (Chen, Wen-Sheng); Dai, XL (Dai, Xiuli); Pan, BB (Pan, Binbin); Huang, TQ (Huang, Taiquan)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Feature extraction is an important problem in face recognition. There are two kinds of structural features, namely the
Euclidean structure and the manifold structure. However, the single-structural feature extraction methods cannot fully
utilize the advantages of global feature and local feature simultaneously. Thus their performances will be degraded. To
overcome the limitations of the single-structural feature based face recognition schemes, this paper proposes a novel
discriminant criterion using Feature Fusion Strategy (FFS), which nonlinearly combines both Euclidean and manifold
structures in the face pattern space. The proposed discriminant criterion is suitable to develop an iterative algorithm. It is
able to automatically determine the optimal parameters and balance the tradeoff between Euclidean structure and manifold
structure. The proposed FFS algorithm is successfully applied to face recognition. Three publicly available face databases,
ORL, FERET and CMU PIE, are selected for evaluation. Compared with Linear Discriminant Analysis (LDA), Locality
Preserving Projection (LPP), Unsupervised Discriminant Projection (UDP) and Semi-Supervised LDA (SSLDA), the
experimental results show that the proposed method gives superior performance. (C) 2015 Elsevier B.V. All rights reserved.
地址: [Chen, Wen-Sheng; Dai, Xiuli; Pan, Binbin] Shenzhen Univ, Coll Math & Computat Sci, Shenzhen 518160, Peoples
R China.
[Chen, Wen-Sheng; Huang, Taiquan] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518160, Peoples R
China.
[Chen, Wen-Sheng; Pan, Binbin] Shenzhen Univ, Shenzhen Key Lab Media Secur, Shenzhen 518160, Peoples R China.
通讯作者地址: Pan, BB (通讯作者),Shenzhen Univ, Coll Math & Computat Sci, Shenzhen 518160, Peoples R China.
电子邮件地址: chenws@szu.edu.cn; pbb@szu.edu.cn
第 27 条，共 274 条
标题: Secure watermarking scheme against watermark attacks in the encrypted domain
作者: Guo, JT (Guo, Jianting); Zheng, PJ (Zheng, Peijia); Huang, JW (Huang, Jiwu)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: The homomorphic cryptosystems create a great opportunity for secure signal processing (SSP). Watermarking in the
encrypted domain provides a promising solution to the security of watermarking. However, the robust performance of the
watermarking scheme in the encrypted domain should be carefully considered. In this paper, we propose a robust
watermarking scheme in the encrypted domain, which protects the original images from the third party embedders. The
hybrid discrete wavelet transform (DWT) and discrete cosine transform (DCT) based method improves the robust
performance of the encrypted domain watermarking scheme. The watermark extraction can be performed on both the
plaintext and the encrypted domains. We also give an estimation of the expanding factor after watermark embedding in the
encrypted domain. At last, we discuss the watermark attacks that are available in the encrypted domain. Taking Haar
wavelet transform for example, we conduct the experiments on the visual quality and the robustness of our watermarking
scheme, which demonstrate that the entire performance is satisfactory. (C) 2015 Elsevier Inc. All rights reserved.
地址: [Guo, Jianting] Sun Yat Sen Univ, Sch Informat Sci & Technol, Guangzhou 510006, Guangdong, Peoples R China.
[Zheng, Peijia] Sun Yat Sen Univ, Sch Informat Management, Guangzhou 510006, Guangdong, Peoples R China.
[Huang, Jiwu] Shenzhen Univ, Coll Informat Engn, Shenzhen Key Lab Media Secur, Shenzhen 518060, Peoples R China.
通讯作者地址: Zheng, PJ (通讯作者),Sun Yat Sen Univ, Sch Informat Management, Guangzhou 510006, Guangdong,
Peoples R China.
电子邮件地址: zhpj@mail.sysu.edu.cn
第 28 条，共 274 条
标题: Tensor rank selection for multimedia analysis
作者: Zhang, JG (Zhang, Jianguang); Han, YH (Han, Yahong); Jiang, JM (Jiang, Jianmin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Tensors representations are widely used in multimedia applications. As a key step of tensor processing, the rank-1
tensor decomposition (i.e., the CANDECOMP/PARAFAC (CP) decomposition) always requires the estimation of the tensor
rank. The Pm-norm has been shown to be effective for tensor rank selection. The existing tensor rank selection algorithm
force the same columns of the tensor matrices to simultaneously become zero. However, the real sparse columns for
different factor matrices may be different. Such strategy does not really uncover the sparse information of each factor
matrix. In this paper, we add a separable l(2,1)-norm on multiple factor matrices to obtain real sparse results along to
different modes. And then different sparse results are assembled into a joint sparse pattern for tensor rank selection. This
added separable regularization term has twofold role in enhancing the effect of regularization for each factor matrix and
fully utilizing the knowledge of multiple factor matrices to facilitate decision making. In order to effectively exploit the
structure information of multimedia data, we propose a model of tensor bag of words (tBOW) as the direct input of our
algorithms. In the experiments, we apply the proposed algorithms to three representative tasks of multimedia analysis, i.e.,
image classification, video action recognition, and head pose estimation. Experimental results on three open benchmark
datasets show that our algorithms are effective to multimedia analysis. (C) 2015 Elsevier Inc. All rights reserved.
地址: [Zhang, Jianguang; Han, Yahong] Tianjin Univ, Sch Comp Sci & Technol, Tianjin, Peoples R China.
[Jiang, Jianmin] Shenzhen Univ, Sch Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Han, Yahong] Tianjin Univ, Tianjin Key Lab Cognit Comp & Applicat, Tianjin, Peoples R China.
[Zhang, Jianguang] Hengshui Univ, Dept Math & Comp Sci, Hengshui, Peoples R China.
通讯作者地址: Han, YH (通讯作者),Tianjin Univ, Sch Comp Sci & Technol, Tianjin, Peoples R China.
电子邮件地址: lynxzjg@tju.edu.cn; yahong@tju.edu.cn; jmjiang@tju.edu.cn
第 29 条，共 274 条
标题: Image decomposition combining a total variational filter and a Tikhonov quadratic filter
作者: Hao, Y (Hao, Yan); Xu, JL (Xu, Jianlou); Bai, J (Bai, Jian); Han, Y (Han, Yu)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In this paper, we propose a new variational model for image decomposition which separates an image into a cartoon,
consisting only of geometric objects and an oscillatory component, consisting of texture or noise. In the new model, the
-norm is considered as the data fitting term and the regularization term is composed of a total variational filter and a
Tikhonov quadratic filter. These two filters can be automatically selected by a soft threshold function. When the pixels
belong to the cartoon area, the total variational filter is adopted, which can preserve the geometric structures of image such
as the edges, well. When the pixels belong to texture region, the Tikhonov quadratic filter is chosen,which can extract the
texture of image well. To solve the proposed model effectively, the split Bregman method is employed. Experimental
results demonstrate that the proposed model and algorithm can obtain better decomposition results than those of classical
models.
地址: [Hao, Yan; Xu, Jianlou] Henan Univ Sci & Technol, Sch Math & Stat, Luoyang 471023, Henan, Peoples R China.
[Bai, Jian] Xidian Univ, Sch Sci, Xian 710071, Shaanxi, Peoples R China.
[Han, Yu] Shenzhen Univ, Coll Math & Computat Sci, Shenzhen 518060, Guangdong, Peoples R China.
通讯作者地址: Hao, Y (通讯作者),Henan Univ Sci & Technol, Sch Math & Stat, Luoyang 471023, Henan, Peoples R
China.
电子邮件地址: haoyan_@126.com; xujianlou@126.com; keywhite26@126.com; hany@szu.edu.cn
第 30 条，共 274 条
标题: Segment Based Decision Tree Induction With Continuous Valued Attributes
作者: Wang, R (Wang, Ran); Kwong, S (Kwong, Sam); Wang, XZ (Wang, Xi-Zhao); Jiang, QS (Jiang, Qingshan)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: A key issue in decision tree (DT) induction with continuous valued attributes is to design an effective strategy for
splitting nodes. The traditional approach to solving this problem is adopting the candidate cut point (CCP) with the highest
discriminative ability, which is evaluated by some frequency based heuristic measures. However, such methods ignore the
class permutation of examples in the node, and they cannot distinguish the CCPs with the same or similar frequency
information, thus may fail to induce a better and smaller tree. In this paper, a new concept, i. e., segment of examples, is
proposed to differentiate the CCPs with same frequency information. Then, a new hybrid scheme that combines the two
heuristic measures, i. e., frequency and segment, is developed for splitting DT nodes. The relationship between frequency
and the expected number of segments, which is regarded as a random variable, is also given. Experimental comparisons
demonstrate that the proposed scheme is not only effective to improve the generalization capability, but also valid to reduce
the size of the tree.
地址: [Wang, Ran; Kwong, Sam] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China.
[Wang, Ran; Jiang, Qingshan] Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen Key Lab High Performance Data
Min, Shenzhen 518055, Peoples R China.
[Wang, Xi-Zhao] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Wang, R (通讯作者),City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China.
电子邮件地址: ranwang3-c@my.cityu.edu.hk; cssamk@cityu.edu.hk; xizhaowang@ieee.org; qs.jiang@siat.ac.cn
第 31 条，共 274 条
标题: Objective measures for quality assessment of noise-suppressed speech
作者: Ding, HJ (Ding, Huijun); Lee, T (Lee, Tan); Soon, IY (Soon, Ing Yann); Yee, CK (Yee, Chai Kiat); Dai, P (Dai,
Peng); Dan, G (Dan, Guo)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Among all the existing objective measures, few are able to provide a clearly specific indication of speech distortion or
noise reduction, which are the two key metrics to assess the performance of speech enhancement algorithms and evaluate
the noise-suppressed speech quality. In this paper, new quantitative quality assessments are proposed to separately evaluate
the capabilities of single channel speech enhancement algorithms in terms of maintaining the clean speech, noise reduction
and overall performance. Based on these aspects, three evaluation results can be provided for any one test speech signal by
analyzing the residual signal which is the difference between the clean speech and the processed speech. Several common
speech enhancement algorithms are compared by these objective measures as well as subjective listening tests. High
correlations between the scores of the objective measures and subjective ratings clearly show the effectiveness of the
proposed evaluation methodologies on the different speech enhancement algorithms. (C) 2015 Elsevier B.V. All rights
reserved.
地址: [Ding, Huijun; Dan, Guo] Shenzhen Univ, Sch Med, Dept Biomed Engn, Shenzhen, Peoples R China.
[Ding, Huijun; Dan, Guo] Guangdong Key Lab Biomed Measurements & Ultrasoun, Shenzhen, Peoples R China.
[Lee, Tan] Chinese Univ Hong Kong, Dept Elect Engn, Hong Kong, Hong Kong, Peoples R China.
[Soon, Ing Yann] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore.
[Yee, Chai Kiat] Nanyang Technol Univ, Sch Comp Engn, Singapore 639798, Singapore.
[Dai, Peng] Univ Toronto, Dept Comp Sci, Toronto, ON, Canada.
[Dai, Peng] Univ Hlth Network, Toronto Rehabil Inst, Toronto, ON, Canada.
通讯作者地址: Dan, G (通讯作者),Shenzhen Univ, Sch Med, Dept Biomed Engn, Shenzhen, Peoples R China.
电子邮件地址: hjding@szu.edu.cn; tanlee@ee.cuhk.edu.hk; eiysoon@ntu.edu.sg; asckyeo@ntu.edu.sg; peng.dai@uhn.ca;
danguo@szu.edu.cn
第 32 条，共 274 条
标题: The Decision Delay in Finite-Length MMSE-DFE Systems
作者: Zhou, W (Zhou, Wen); Zhang, SL (Zhang, Shengli)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: This paper investigates the performance of the minimum mean square error (MMSE) decision feedback equalization
system and optimizes its key parameter, decision delay, to minimize the system MSE. For the first typical scenario where
the feedback filter length is larger than or equal to the channel order , we present an analytical expression of the system
MSE in terms of decision delay. A few results in previous literature can be regarded as special cases of this expression. For
the second typical scenario where feedback filter length is less than the channel order , it is difficult to obtain the explicit
solutions. We prove that at a given decision delay, the MSE for is always larger than or equal to that for . As a corollary of
two derived theorems, the optimum feedback filter length should be set to the channel order for large . Furthermore, in this
scenario, the optimal decision delay is conventionally found with an exhaustive search over all possible delays, whose
computational complexity is linear with the searching space and unaffordable. To lower the complexity, we then propose an
efficient algorithm to find the optimal decision delay. The complexity of our algorithm is only a log function of the
searching space and its MSE and symbol error rate performance is almost the same as the traditional exhaustive search .
地址: [Zhou, Wen] Shantou Univ, Dept Elect Engn, Shantou, Peoples R China.
[Zhou, Wen] Guangdong Prov Key Lab Digital Signal & Image Pro, Shantou, Peoples R China.
[Zhang, Shengli] Shenzhen Univ, Sch Informat Engn, Shenzhen, Peoples R China.
通讯作者地址: Zhou, W (通讯作者),Shantou Univ, Dept Elect Engn, Shantou, Peoples R China.
电子邮件地址: wzhou@stu.edu.cn; zsl@szu.edu.cn
第 33 条，共 274 条
标题: Dynamic non-parametric joint sentiment topic mixture model
作者: Fu, XH (Fu, Xianghua); Yang, K (Yang, Kun); Huang, JZ (Huang, Joshua Zhexue); Cui, LZ (Cui, Laizhong)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: The reviews in social media are produced continuously by a large and uncontrolled number of users. To capture the
mixture of sentiment and topics simultaneously in reviews is still a challenging task. In this paper, we present a novel
probabilistic model framework based on the non-parametric hierarchical Dirichlet process (HDP) topic model, called
non-parametric joint sentiment topic mixture model (NJST), which adds a sentiment level to the HDP topic model and
detects sentiment and topics simultaneously from reviews. Then considered the dynamic nature of social media data, we
propose dynamic NJST (dNJST), which adds time decay dependencies of historical epochs to the current epochs. Compared
with the existing sentiment topic mixture models which are based on latent Dirichlet allocation (LDA), the biggest
difference of NJST and dNJST is that they can determine topic number automatically. We implement NJST and dNJST
with online variational inference algorithms, and incorporate the sentiment priors of words into NJST and dNJST with
HowNet lexicon. The experiment results in some Chinese social media dataset show that dNJST can effectively detect and
track dynamic sentiment and topics. (C) 2015 Elsevier B.V. All rights reserved.
地址: [Fu, Xianghua; Yang, Kun; Huang, Joshua Zhexue; Cui, Laizhong] Shenzhen Univ, Coll Comp Sci & Software
Engn, Shenzhen 518060, Guangdong, Peoples R China.
通讯作者地址: Cui, LZ (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Guangdong,
Peoples R China.
电子邮件地址: cuilz@szu.edu.cn
第 34 条，共 274 条
标题: Biomimicry of parasitic behavior in a coevolutionary particle swarm optimization algorithm for global optimization
作者: Qin, QD (Qin, Quande); Cheng, S (Cheng, Shi); Zhang, QY (Zhang, Qingyu); Li, L (Li, Li); Shi, YH (Shi, Yuhui)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: The declining of population diversity is often considered as the primary reason for solutions falling into the local
optima in particle swarm optimization (PSO). Inspired by the phenomenon that parasitic behavior is beneficial to the natural
ecosystem for the promotion of its biodiversity, this paper presents a novel coevolutionary particle swarm optimizer with
parasitic behavior (PSOPB). The population of PSOPB consists of two swarms, which are host swarm and parasite swarm.
The characteristics of parasitic behavior are mimicked from three aspects: the parasites getting nourishments from the host,
the host immunity, and the evolution of the parasites. With a predefined probability, which reflects the characteristic of the
facultative parasitic behavior, the two swarms exchange particles according to particles' sorted fitness values in each swarm.
The host immunity is mimicked through two ways: the number of exchange particles is linearly decreased over iterations,
and particles in the host swarm can learn from the global best position in the parasite swarm. Two mutation operators are
utilized to simulate two aspects of the evolution of the parasites in PSOPB. In order to embody the law of "survival of the
fittest" in biological evolution, the particles with poor fitness in the host swarm are removed and replaced by the same
numbers of randomly initialized particles. The proposed algorithm is experimentally validated on a set of 21 benchmark
functions. The experimental results show that PSOPB performs better than other eight popular PSO variants in terms of
solution accuracy and convergence speed. (C) 2015 Elsevier B.V. All rights reserved.
地址: [Qin, Quande; Zhang, Qingyu; Li, Li] Shenzhen Univ, Coll Management, Dept Management Sci, Shenzhen, Peoples
R China.
[Qin, Quande; Zhang, Qingyu] Shenzhen Univ, Res Inst Business Analyt & Supply Chain Managemen, Shenzhen, Peoples
R China.
[Cheng, Shi] Univ Nottingham Ningbo, Div Comp Sci, Ningbo, Zhejiang, Peoples R China.
[Cheng, Shi] Univ Nottingham Ningbo, Int Doctoral Innovat Ctr, Ningbo, Zhejiang, Peoples R China.
[Shi, Yuhui] Xian Jiaotong Liverpool Univ, Dept Elect & Elect Engn, Suzhou, Peoples R China.
通讯作者地址: Cheng, S (通讯作者),Univ Nottingham Ningbo, Div Comp Sci, Ningbo, Zhejiang, Peoples R China.
电子邮件地址: qinquande@gmail.com; shi.cheng@nottingham.edu.cn; q.yu.zhang@gmail.com; yuhui.shi@xjtlu.edu.cn
第 35 条，共 274 条
标题: Large margin clustering on uncertain data by considering probability distribution similarity
作者: Xu, L (Xu, Lei); Hu, QH (Hu, Qinghua); Hung, E (Hung, Edward); Chen, BW (Chen, Baowen); Tan, X (Tan, Xu);
Liao, CR (Liao, Changrui)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: In this paper, the problem of clustering uncertain objects whose locations are uncertain and described by probability
density functions (pdf) is studied. Though some existing methods (i.e. K-means, DBSCAN) have been extended to handle
uncertain object clustering, there are still some limitations to be solved. K-means assumes that the objects are described by
reasonably separated spherical balls. Thus, UK-means based on K-means is limited in handling objects which are in
non-spherical shape. On the other hand, the probability density function is an important characteristic of uncertain data, but
few existing clustering methods consider the difference between objects relying on probability density functions. Therefore,
in this article, a clustering algorithm based on probability distribution similarity is proposed. Our method aims at finding the
largest margin between clusters to overcome the limitation of UK-means. Extensively experimental results verify the
performance of our method by effectiveness, efficiency and scalability on both synthetic and real data sets. (C) 2015
Elsevier B.V. All rights reserved.
地址: [Xu, Lei; Hung, Edward] Hong Kong Polytech Univ, Dept Comp, Hong Kong, Hong Kong, Peoples R China.
[Hu, Qinghua] Tianjin Univ, Sch Comp Sci & Technol, Tianjin 300072, Peoples R China.
[Chen, Baowen; Tan, Xu] Shenzhen Inst Informat Technol, Shenzhen, Peoples R China.
[Liao, Changrui] Shenzhen Univ, Coll Optoelect Engn, Key Lab Optoelect Devices & Syst, Minist Educ & Guangdong
Prov, Shenzhen 518060, Peoples R China.
通讯作者地址: Liao, CR (通讯作者),Shenzhen Univ, Coll Optoelect Engn, Key Lab Optoelect Devices & Syst, Minist
Educ & Guangdong Prov, Shenzhen 518060, Peoples R China.
第 36 条，共 274 条
标题: A linear threshold-hurdle model for product adoption prediction incorporating sOcial network effects
作者: Zhou, F (Zhou, Feng); Jiao, JX (Jiao, Jianxin (Roger)); Lei, BY (Lei, Baiying)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: With the development of social media, online social networks offer potential opportunities for firms to analyze user
behaviors. Among many, one of the fundamental questions is how to predict product adoption, and the answer to this
question lays the foundation for product adoption maximization and demand estimation in large social networks. However,
due to the inherent challenges resulting from the dynamic diffusion mechanism in online social networks, such as modeling
of activation thresholds and influence probability, differentiating between influence and adoption, and incorporating review
content, traditional diffusion models are often not adequate enough to predict product adoption accurately. In order to tackle
these challenges, we propose a linear threshold-hurdle model to predict product adoption incorporating social network
effects. First, we present a fine-grained activation threshold model based on the five categories of adopters. In addition, we
identify three operational factors underlying social network effects, including interaction strength, structural equivalence,
and social entity similarity, to model influence probabilities. Furthermore, we distinguish influence spread from adoption
spread by introducing a tattle state, in which users express opinions without adopting the product. Finally, we introduce the
notion of hurdle to capture the monetary aspect in users' decision making process of product adoption. Based on the
proposed linear threshold-hurdle model, two data mining methods based on the rough set technique, namely, decision rules
and decomposition trees, are employed to predict product adoption in a large social network. An empirical study of Kindle
Fire HD 7 in. tablets is used to illustrate the potential and feasibility of the proposed model. The results demonstrate the
predictive power of the proposed model with average F-scores of 89.8% for the week prediction model and of 86.7% for the
bi-week prediction model. (C) 2015 Elsevier Inc. All rights reserved.
地址: [Zhou, Feng; Jiao, Jianxin (Roger)] Shenzhen Univ, Coll Mechatron & Control Engn, Shenzhen 518060, Peoples R
China.
[Zhou, Feng] Georgia Inst Technol, George W Woodruff Sch Mech Engn, Atlanta, GA 30332 USA.
[Lei, Baiying] Shenzhen Univ, Guangdong Key Lab Biomed Measurements & Ultrasoun, Natl Reg Key Technol Engn Lab
Med Ultrasound, Dept Biomed Engn,Sch Med, Shenzhen 518060, Peoples R China.
通讯作者地址: Lei, BY (通讯作者),Shenzhen Univ, Guangdong Key Lab Biomed Measurements & Ultrasoun, Natl Reg
Key Technol Engn Lab Med Ultrasound, Dept Biomed Engn,Sch Med, Shenzhen 518060, Peoples R China.
电子邮件地址: leiby@szu.edu.cn
第 37 条，共 274 条
标题: Light-weight reference-based compression of FASTQ data
作者: Zhang, YP (Zhang, Yongpeng); Li, LS (Li, Linsen); Yang, YL (Yang, Yanli); Yang, X (Yang, Xiao); He, S (He,
Shan); Zhu, ZX (Zhu, Zexuan)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Background: The exponential growth of next generation sequencing (NGS) data has posed big challenges to data
storage, management and archive. Data compression is one of the effective solutions, where reference-based compression
strategies can typically achieve superior compression ratios compared to the ones not relying on any reference.
Results: This paper presents a lossless light-weight reference-based compression algorithm namely LW-FQZip to compress
FASTQ data. The three components of any given input, i.e., metadata, short reads and quality score strings, are first parsed
into three data streams in which the redundancy information are identified and eliminated independently. Particularly,
well-designed incremental and run-length-limited encoding schemes are utilized to compress the metadata and quality score
streams, respectively. To handle the short reads, LW-FQZip uses a novel light-weight mapping model to fast map them
against external reference sequence(s) and produce concise alignment results for storage. The three processed data streams
are then packed together with some general purpose compression algorithms like LZMA. LW-FQZip was evaluated on
eight real-world NGS data sets and achieved compression ratios in the range of 0.111-0.201. This is comparable or superior
to other state-of-the-art lossless NGS data compression algorithms.
Conclusions: LW-FQZip is a program that enables efficient lossless FASTQ data compression. It contributes to the state of
art applications for NGS data storage and transmission. LW-FQZip is freely available online at:
http://csse.szu.edu.cn/staff/zhuzx/LWFQZip.
地址: [Zhang, Yongpeng; Li, Linsen; Yang, Yanli; Zhu, Zexuan] Shenzhen Univ, Coll Comp Sci & Software Engn,
Shenzhen 518060, Peoples R China.
[Yang, Xiao] Broad Inst, Cambridge, MA 02142 USA.
[He, Shan] Univ Birmingham, Sch Comp Sci, Birmingham B15 2TT, W Midlands, England.
通讯作者地址: Zhu, ZX (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R
China.
电子邮件地址: zhuzx@szu.edu.cn
第 38 条，共 274 条
标题: Lazy-RTGC: A Real-Time Lazy Garbage Collection Mechanism with Jointly Optimizing Average and Worst
Performance for NAND Flash Memory Storage Systems
作者: Zhang, Q (Zhang, Qi); Li, XD (Li, Xuandong); Wang, LZ (Wang, Linzhang); Zhang, T (Zhang, Tian); Wang, Y
(Wang, Yi); Shao, ZL (Shao, Zili)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Due to many attractive and unique properties, NAND flash memory has been widely adopted in mission-critical hard
real-time systems and some soft real-time systems. However, the nondeterministic garbage collection operation in NAND
flash memory makes it difficult to predict the system response time of each data request. This article presents Lazy-RTGC,
a real-time lazy garbage collection mechanism for NAND flash memory storage systems. Lazy-RTGC adopts two design
optimization techniques: on-demand page-level address mappings, and partial garbage collection. On-demand page-level
address mappings can achieve high performance of address translation and can effectively manage the flash space with the
minimum RAM cost. On the other hand, partial garbage collection can provide the guaranteed system response time. By
adopting these techniques, Lazy-RTGC jointly optimizes both the average and the worst system response time, and provides
a lower bound of reclaimed free space. Lazy-RTGC is implemented in FlashSim and compared with representative
real-time NAND flash memory management schemes. Experimental results show that our technique can significantly
improve both the average and worst system performance with very low extra flash-space requirements.
地址: [Zhang, Qi; Li, Xuandong; Wang, Linzhang; Zhang, Tian] Nanjing Univ, Dept Comp Sci, State Key Lab Novel
Software Technol, Nanjing 210008, Jiangsu, Peoples R China.
[Wang, Yi] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Wang, Yi; Shao, Zili] Hong Kong Polytech Univ, Dept Comp, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Wang, Y (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
电子邮件地址: ssywang@comp.polyu.edu.hk
第 39 条，共 274 条
标题: A Survey of Energy Harvesting Communications: Models and Offline Optimal Policies
作者: He, YJ (He, Yejun); Cheng, XD (Cheng, Xudong); Peng, W (Peng, Wei); Stuber, GL (Stueber, Gordon L.)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: As people pay more attention to environmental protection and energy conservation issues, energy consumption in
communications have become a hot research field. In wireless communications networks such as wireless sensor networks,
traditional battery-operated devices or nodes have a short lifetime and die after the batteries are depleted, and replacing the
batteries may be very costly and sometimes will be impossible. Therefore, energy harvesting (EH) communications have
become a good means to solve this problem. EH communications mean the nodes can continue working by harvesting
ambient energy. EH communications are different from the traditional battery-operated communications, so we need new
models and optimal transmission policies to maximize the throughput. In this article we review different methods of
harvesting the ambient energy in EH communications and the models of EH communications. We focus on offline optimal
policies, then compare different policies and classify them into certain types. Finally, we propose several open research
challenges and directions for future work.
地址: [He, Yejun] Shenzhen Univ, Shenzhen, Peoples R China.
[Peng, Wei] Huazhong Univ Sci & Technol, Wuhan 430074, Hubei, Peoples R China.
[Stueber, Gordon L.] Georgia Inst Technol, Sch Elect & Comp Engn, Atlanta, GA 30332 USA.
[Cheng, Xudong] Shenzhen Univ, Coll Informat Engn, Shenzhen, Peoples R China.
通讯作者地址: He, YJ (通讯作者),Shenzhen Univ, Shenzhen, Peoples R China.
电子邮件地址: heyejun@ieee.org; cxd199181@126.com; pengwei@hust.edu.cn; stuber@ece.gatech.edu
第 40 条，共 274 条
标题: A Low Complexity Subband Adaptive Filter with Two-Stage Decomposition
作者: Xie, N (Xie, Ning); Ling, JY (Ling, Junyue); Wang, H (Wang, Hui)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: The conventional subband adaptive filter (SAF) based on poly-phase decomposition has fast convergence behavior
compared by fullband adaptive filter. However, the complexity for one-stage signal decomposition increases significantly,
as increasing the number of subband to improve the convergence further. To solve this problem, a new SAF is proposed in
this letter, which is constructed with two-stage decomposition. Based on the proposed structure, an adaptive algorithm of
updating coefficients is derived based on the principle of minimal disturbance. Compared to the conventional SAF with
one-stage decomposition, the proposed one has similar convergence rate with a lower complexity. Theoretical analysis and
simulation results validated the superiority of the proposed SAF.
地址: [Xie, Ning; Ling, Junyue; Wang, Hui] Shenzhen Univ, CIE, Shenzhen 518060, Guangdong, Peoples R China.
[Xie, Ning; Wang, Hui] Shenzhen Key Lab Adv Commun & Informat Proc, Shenzhen 518060, Peoples R China.
通讯作者地址: Xie, N (通讯作者),Shenzhen Univ, CIE, Shenzhen 518060, Guangdong, Peoples R China.
电子邮件地址: ningxie@szu.edu.cn
第 41 条，共 274 条
标题: Real-time scheduling for hybrid flowshop in ubiquitous manufacturing environment
作者: Luo, H (Luo, Hao); Fang, J (Fang, Ji); Huang, GQ (Huang, George Q.)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: This paper discusses the implementation of RFID technologies, which enable the shop floor visibility and reduce
uncertainties in the real-time scheduling for hybrid flowshop (HFS) production. In the real-time HFS environment, the
arriving of new jobs is dynamic, while the processes in work stages are not continuous. The decision makers in shop floor
level and stage level have different objectives. Therefore, classical off-line HFS scheduling approaches cannot be used
under these situations. In this research, two major measures are taken to deal with these specific real-time features. Firstly, a
ubiquitous manufacturing (UM) environment is created by deploying advanced wireless devices into value-adding points
for the collection and synchronization of real-time shop floor data. Secondly, a multi-:period hierarchical
scheduling,(MPHS) mechanism is developed to divide the planning time horizon into multiple shorter periods. The shop
floor manapr and stage managers can hierarchically make decisions for their own objectives. Finally, the proposed MPHS
mechanism is illustrated by a numerical case study. (C) 2014 Elsevier Ltd. All rights reserved.
地址: [Luo, Hao] Shenzhen Univ, Coll Econ, Shenzhen, Peoples R China.
[Luo, Hao; Fang, Ji; Huang, George Q.] Univ Hong Kong, Dept Ind & Mfg Syst Engn, HKU ZIRI Lab Phys Internet, Hong
Kong, Hong Kong, Peoples R China.
通讯作者地址: Luo, H (通讯作者),Shenzhen Univ, Coll Econ, Room 1501, Shenzhen, Peoples R China.
电子邮件地址: luohao403@gmail.com
第 42 条，共 274 条
标题: Semantic theories of programs with nested interrupts
作者: Huang, YH (Huang, Yanhong); He, JF (He, Jifeng); Zhu, HB (Zhu, Huibiao); Zhao, YX (Zhao, Yongxin); Shi, JQ
(Shi, Jianqi); Qin, SC (Qin, Shengchao)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In the design of dependable software for embedded and real-time operating systems, time analysis is a crucial but
extremely difficult issue, the challenge of which is exacerbated due to the randomness and nondeterminism of interrupt
handling behaviors. Thus research into a theory that integrates interrupt behaviors and time analysis seems to be important
and challenging. In this paper, we present a programming language to describe programs with interrupts that is comprised of
two essential parts: main program and interrupt handling programs.We also explore a timed operational semantics and a
denotational semantics to specify the meanings of our language. Furthermore, a strategy of deriving denotational semantics
from the timed operational semantics is provided to demonstrate the soundness of our operational semantics by showing the
consistency between the derived denotational semantics and the original denotational semantics.
地址: [Huang, Yanhong; Shi, Jianqi] E China Normal Univ, Natl Trusted Embedded Software Engn Technol Res C,
Shanghai 200062, Peoples R China.
[Huang, Yanhong; He, Jifeng; Zhu, Huibiao; Zhao, Yongxin; Shi, Jianqi] E China Normal Univ, Shanghai Key Lab
Trustworthy Comp, Shanghai 200062, Peoples R China.
[Qin, Shengchao] Shenzhen Univ, Sch Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Zhu, HB (通讯作者),E China Normal Univ, Shanghai Key Lab Trustworthy Comp, Shanghai 200062,
Peoples R China.
电子邮件地址: yhhuang@sei.ecnu.edu.cn; hbzhu@sei.ecnu.edu.cn
第 43 条，共 274 条
标题: The Capacity of Known Interference Channel
作者: Zhang, SL (Zhang, Shengli); Liew, SC (Liew, Soung Chang); Chen, JY (Chen, Jinyuan)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In this paper, we investigate the capacity of a known interference channel, where a transmitter sends information to a
receiver in the presence of a block-fading interference link, and the receiver knows the interference data but not the channel
gain of the interference link. An upper bound and a lower bound for the capacity of this known interference channel are
derived. Specifically, the capacity lower bound is achieved by a blind known interference cancellation (BKIC) scheme,
which can remove the interference without the knowledge of the interference channel gain. We further show that the
achievable lower bound of BKIC can approach the upper bound in high SNR regime. Our results show that the lack of the
knowledge of the channel gain of the interfering link causes only a small fractional loss of degrees of freedom (capacity
prelog).
地址: [Zhang, Shengli] Shenzhen Univ, Coll Informat Engn, Shenzhen MCSP Key Lab, Shenzhen 518060, Peoples R
China.
[Zhang, Shengli; Chen, Jinyuan] Stanford Univ, Dept Elect Engn, Stanford, CA 94305 USA.
[Liew, Soung Chang] Chinese Univ Hong Kong, Dept Informat Engn, Shatin, Hong Kong, Peoples R China.
通讯作者地址: Zhang, SL (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen MCSP Key Lab, Shenzhen 518060,
Peoples R China.
电子邮件地址: zsl@szu.edu.cn; soung@ie.cuhk.edu.hk; jinyuanc@stanford.edu
第 44 条，共 274 条
标题: On-Demand Block-Level Address Mapping in Large-Scale NAND Flash Storage Systems
作者: Chen, RH (Chen, Renhai); Qin, ZW (Qin, Zhiwei); Wang, Y (Wang, Yi); Liu, D (Liu, Duo); Shao, ZL (Shao, Zili);
Guan, Y (Guan, Yong)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: The density of flash memory chips has doubled every two years in the past decade and the trend is expected to
continue. The increasing capacity of NAND flash memory leads to large RAM footprint on address mapping management.
This paper proposes a novel Demand-based block-level Address mapping scheme with a two-level Caching mechanism
(DAC) for large-scale NAND flash storage systems. The objective is to reduce RAM footprint without excessively
compromising system response time. In our technique, the block-level address mapping table is stored in fixed pages (called
the translation pages) in the flash memory. Considering temporal locality that workloads exhibit, we maintain one cache in
RAM to store the on-demand address mapping entries. Meanwhile, by exploring both spatial locality and access frequency
of workloads with another two caches, the second-level cache is designed to cache selected translation pages. In such a way,
both the most-frequently-accessed and sequentially accessed address mapping entries can be stored in the cache so the
cache hit ratio can be increased and the system response time can be improved. To the best of our knowledge, this is the
first work to reduce the RAM cost by employing the demand-based approach on block-level address mapping schemes. The
experiments have been conducted on a real embedded platform. The experimental results show that our technique can
effectively reduce the RAM footprint while maintaining similar average system response time compared with previous
work.
地址: [Wang, Yi] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 630044, Peoples R China.
[Chen, Renhai; Qin, Zhiwei; Shao, Zili] Hong Kong Polytech Univ, Embedded Syst & CPS Lab, Dept Comp, Kowloon,
Hong Kong, Peoples R China.
[Liu, Duo] Chongqing Univ, Coll Comp Sci, Chongqing, Peoples R China.
[Guan, Yong] Capital Normal Univ, Coll Comp & Informat Management, Beijing, Peoples R China.
通讯作者地址: Wang, Y (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 630044, Peoples R
China.
电子邮件地址: csrchen@comp.polyu.edu.hk; cszqin@comp.polyu.edu.hk; csywang@comp.polyu.edu.hk;
csdliu@comp.polyu.edu.hk; cszlshao@comp.polyu.edu.hk; guanyxxxy@263.com
第 45 条，共 274 条
标题: Top-K structural diversity search in large networks
作者: Huang, X (Huang, Xin); Cheng, H (Cheng, Hong); Li, RH (Li, Rong-Hua); Qin, L (Qin, Lu); Yu, JX (Yu, Jeffrey
Xu)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Social contagion depicts a process of information (e.g., fads, opinions, news) diffusion in the online social networks.
A recent study reports that in a social contagion process, the probability of contagion is tightly controlled by the number of
connected components in an individual's neighborhood. Such a number is termed structural diversity of an individual, and it
is shown to be a key predictor in the social contagion process. Based on this, a fundamental issue in a social network is to
find top- users with the highest structural diversities. In this paper, we, for the first time, study the top- structural diversity
search problem in a large network. Specifically, we study two types of structural diversity measures, namely,
component-based structural diversity measure and core-based structural diversity measure. For component-based structural
diversity, we develop an effective upper bound of structural diversity for pruning the search space. The upper bound can be
incrementally refined in the search process. Based on such upper bound, we propose an efficient framework for topstructural diversity search. To further speed up the structural diversity evaluation in the search process, several carefully
devised search strategies are proposed. We also design efficient techniques to handle frequent updates in dynamic networks
and maintain the top- results. We further show how the techniques proposed in component-based structural diversity
measure can be extended to handle the core-based structural diversity measure. Extensive experimental studies are
conducted in real-world large networks and synthetic graphs, and the results demonstrate the efficiency and effectiveness of
the proposed methods.
地址: [Huang, Xin; Cheng, Hong; Yu, Jeffrey Xu] Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Hong
Kong, Hong Kong, Peoples R China.
[Li, Rong-Hua] Shenzhen Univ, Guangdong Prov Key Lab Popular High Performance C, Shenzhen, Peoples R China.
[Qin, Lu] Univ Technol Sydney, Quantum Computat & Intelligent Syst, Dept Engn & Informat Technol, Sydney, NSW
2007, Australia.
通讯作者地址: Cheng, H (通讯作者),Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Hong Kong, Hong
Kong, Peoples R China.
电子邮件地址: xhuang@se.cuhk.edu.hk; hcheng@se.cuhk.edu.hk; rhli@se.cuhk.edu.hk; lu.qin@uts.edu.au;
yu@se.cuhk.edu.hk
第 46 条，共 274 条
标题: QoS Constrained Optimization of Cell Association and Resource Allocation for Load Balancing in Downlink
Heterogeneous Cellular Networks
作者: Su, GC (Su, Gongchao); Chen, B (Chen, Bin); Lin, XH (Lin, Xiaohui); Wang, H (Wang, Hui); Li, LM (Li, Lemin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: This paper considers the optimal cell association and resource allocation for load balancing in a heterogeneous
cellular network subject to user's quality-of-service (QoS) constraints. We adopt the proportional fairness (PF) utility
maximization formulation which also accommodates the QoS constraints in terms of minimum rate requirements. With
equal resource allocation this joint optimization problem is either infeasible or requires relaxation that yields a solution
which is difficult to implement. Nevertheless, we show that this joint optimization problem can be effectively solved
without any priori assumption on resource allocation and yields a cell association scheme which enforces single BS
association for each user. We re-formulated the joint optimization problem as a network-wide resource allocation problem
with cardinality constraints. A reweighted heuristic l(1)-norm regularization method is used to obtain a sparse solution to
the re-formulated problem. The cell association scheme is then derived from the sparsity pattern of the solution, which
guarantees a single BS association for each user. Compared with the previously proposed method based on equal resource
allocation, the proposed framework results in a feasible cell association scheme and yields a robust solution on resource
allocation that satisfies the QoS constraints. Our simulations illustrate the impact of user's minimum rate requirements on
cell association and demonstrate that the proposed approach achieves load balancing and enforces single BS association for
users.
地址: [Su, Gongchao; Li, Lemin] Univ Elect Sci & Technol China, Sch Commun & Informat Engn, Chengdu 611731,
Peoples R China.
[Su, Gongchao; Chen, Bin; Lin, Xiaohui; Wang, Hui] Shenzhen Univ, Shenzhen Key Lab Adv Commun & Informat Proc,
Shenzhen 518060, Peoples R China.
通讯作者地址: Su, GC (通讯作者),Univ Elect Sci & Technol China, Sch Commun & Informat Engn, Chengdu 611731,
Peoples R China.
电子邮件地址: gcsu@szu.edu.cn
第 47 条，共 274 条
标题: System Utility Maximization With Interference Processing for Cognitive Radio Networks
作者: Qian, LP (Qian, Li Ping); Zhang, SL (Zhang, Shengli); Zhang, W (Zhang, Wei); Zhang, YJ (Zhang, Ying Jun)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In spectrum underlay cognitive radio networks, secondary users (SUs) are allowed to reuse the spectrum allocated to
a primary system. The interference between SUs actually carries information and can potentially be exploited to improve
the network performance through information-theoretic interference processing. In this paper, we design an optimal joint
power and rate control algorithm that maximizes the secondary system utility subject to the interference temperature
constraints of primary users based on the capacity-approaching interference processing scheme called as the Han-Kobayashi
scheme. The optimal solution is difficult to achieve because the optimization problem is in general non-convex. To make
the optimization problem tractable, this paper first transforms the problem into a monotonic optimization problem through
exploiting its hidden monotonicity. We then devise an effective algorithm to obtain the global optimal solution to the joint
power and rate control problem in the Han-Kobayashi scheme. The key idea behind the proposed algorithm is to construct a
sequence of shrinking polyblocks that approximate the upper boundary of the feasible region with increasing precision.
Numerical results further show that the achieved utility of our scheme significantly outperforms the utility of conventional
schemes which treat the interference between SUs as the noise.
地址: [Qian, Li Ping] Zhejiang Univ Technol, Coll Comp Sci & Technol, Hangzhou 310023, Zhejiang, Peoples R China.
[Qian, Li Ping] Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710162, Peoples R China.
[Zhang, Shengli] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
[Zhang, Wei] Univ New S Wales, Sch Elect Engn & Telecommun, Sydney, NSW 2052, Australia.
[Zhang, Ying Jun] Chinese Univ Hong Kong, Dept Informat Engn, Shatin, Hong Kong, Peoples R China.
[Zhang, Ying Jun] Chinese Univ Hong Kong, Shenzhen Res Inst, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Zhang, SL (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: lpqian@zjut.edu.cn; zsl@szu.edu.cn; wzhang@ee.unsw.edu.au; yjzhang@ie.cuhk.edu.hk
第 48 条，共 274 条
标题: A real time displacement estimation algorithm for ultrasound elastography
作者: Lu, MH (Lu, Minhua); Tang, YA (Tang, Yanan); Sun, RC (Sun, Ruichao); Wang, TF (Wang, Tianfu); Chen, SP
(Chen, Siping); Mao, R (Mao, Rui)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Motion tracking algorithms to derive the local displacement distribution inside soft tissue from ultrasonic radio
frequency (RF) signals are critical for ultrasound-based techniques, especially for ultrasound elastography. Normally, there
is a trade-off between precision and computational cost. In this study, we present a framework combined with block
matching algorithm (BMA) and phase shift method with prior estimation (PSPE). BMA is first applied to the RF signals,
the axial and lateral displacements obtained are then used as a prior estimates of the PS method to calculate a more
precision axial displacements. The performance of the algorithm is evaluated with synthetic ultrasound RF data, and it is
found that both SNRe and CNRe of our method are significantly higher than those of phase-shift as a prior estimation
(PSPE) method. Elasticity phantom and clinical data are also used to verify the usefulness of our algorithm, respectively.
The results show that our method is robust to image the complex tissue motions. (C) 2014 Elsevier B.V. All rights reserved.
地址: [Lu, Minhua; Tang, Yanan; Sun, Ruichao; Wang, Tianfu; Chen, Siping] Shenzhen Univ, Dept Biomed Engn, Natl
Reg Key Technol Engn Lab Med Ultrasound, Guangdong Key Lab Biomed Measurements & Ultrasoun, Shenzhen 518060,
Peoples R China.
[Mao, Rui] Shenzhen Univ, Coll Comp Sci & Software Engn, Guangdong Prov Key Lab Popular High Performance C,
Shenzhen 518060, Peoples R China.
通讯作者地址: Mao, R (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Guangdong Prov Key Lab Popular
High Performance C, Shenzhen 518060, Peoples R China.
电子邮件地址: mao@szu.edu.cn
第 49 条，共 274 条
标题: Diversity-aware retrieval of medical records
作者: Li, JQ (Li, Jianqiang); Liu, CC (Liu, Chunchen); Liu, B (Liu, Bo); Mao, R (Mao, Rui); Wang, YC (Wang, Yongcai);
Chen, S (Chen, Shi); Yang, JJ (Yang, Ji-Jiang); Pan, H (Pan, Hui); Wang, Q (Wang, Qing)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: The widely adoption of Electronic Medical Records (EMRs) causes an explosive growth of the medical and clinical
data. It makes the medical search technologies become critical to find useful patient information in the large medical
dataset. However, the high quality medical search is a challenging task, in particular due to the inherent complexity and
ambiguity of medical terminology. In this paper, by exploiting the uncertainty in ambiguous medical queries, we propose a
novel semantic-based approach to achieve the diversity-aware retrieval of EMRs, i.e., both the relevance and novelty are
considered for EMR ranking. With the support of medical domain ontologies, we first mine all the potential semantics
(concepts and relations between them) from a user query and consume them to model the multiple query aspects. Then, we
propose a novel diversification strategy, which considers not only the aspect importance but also the aspect similarity, to
perform the diversity-aware EMR ranking. A real-world pilot study, which utilizes the proposed medical search approach to
improve the second use of the EMRs, is reported. We believe that our experience can serve as an important reference for the
development of similar applications in a medical data utilization and sharing environment. (C) 2014 Elsevier B.V. All rights
reserved.
地址: [Li, Jianqiang; Mao, Rui] Shenzhen Univ, GDPHPC Labs, Shenzhen, Guangdong, Peoples R China.
[Li, Jianqiang] Beijing Univ Technol, Sch Software Engn, Beijing, Peoples R China.
[Liu, Chunchen] NEC Labs, Beijing, Peoples R China.
[Liu, Bo] NEC Labs, Spatiotemporal Data Anal Res Dept, Beijing, Peoples R China.
[Wang, Yongcai] Tsinghua Univ, Inst Interdisciplinary Informat Sci, Beijing 100084, Peoples R China.
[Yang, Ji-Jiang; Wang, Qing] Tsinghua Univ, Res Inst Informat & Technol, Beijing 100084, Peoples R China.
[Chen, Shi; Pan, Hui] Chinese Acad Med Sci, Dept Endocrinol, Peking Union Med Coll Hosp, Beijing 100730, Peoples R
China.
[Chen, Shi; Pan, Hui] Peking Union Med Coll, Beijing 100021, Peoples R China.
通讯作者地址: Mao, R (通讯作者),Shenzhen Univ, GDPHPC Labs, Shenzhen, Guangdong, Peoples R China.
电子邮件地址: mao@szu.edu.cn
第 50 条，共 274 条
标题: Visualization of bipartite relations between graphs and sets
作者: Zhou, H (Zhou, Hong); Xu, PP (Xu, Panpan); Qu, HM (Qu, Huamin)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: In many application domains, we encounter data which involves a graph encoding certain relationships and a set of
items related to the graph. One example is in social websites where the users interact with each other, and share their
interests on different items such as music or books. In this case, the direct interactions among the users can be represented
as a graph, and the items like music or books can be represented as a set. People are often interested in the bipartite relation
between the graph and the set. They might want to know the similarity or difference of the items liked by themselves and by
their friends. In this paper, we propose a visualization framework designed for the micro-exploration and detailed analysis
of relations involving a graph and a set. Our system consists of two major components: an enhanced graph view and a radial
view. The enhanced graph view shows a social network of people and statistical information about the items which people
are interested in, and the radial view is designed to show people's interests, the overlapping of their interests, and
recommended items based on their interests. The combined use of the two visualization components can facilitate the
discovery of various relational patterns underlying the links connecting the graph and the set. The experiment on the real
dataset demonstrates the effectiveness of our technique.
地址: [Zhou, Hong] Shenzhen Univ, Shenzhen, Guangdong, Peoples R China.
[Xu, Panpan; Qu, Huamin] Hong Kong Univ Sci & Technol, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Zhou, H (通讯作者),Shenzhen Univ, Shenzhen, Guangdong, Peoples R China.
电子邮件地址: hzhou@szu.edu.cn; pxu@cse.ust.hk; huamin@cse.ust.hk
第 51 条，共 274 条
标题: Joint Defragmentation of Optical Spectrum and IT Resources in Elastic Optical Datacenter Interconnections
作者: Fang, WJ (Fang, Wenjian); Lu, MH (Lu, Minhua); Liu, XH (Liu, Xiahe); Gong, L (Gong, Long); Zhu, ZQ (Zhu,
Zuqing)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: With its agile spectrum management in the optical layer, the flexible-grid elastic optical network can become a
promising physical infrastructure to efficiently support the highly dynamic traffic in future datacenter interconnections
(DCIs). While the resulting elastic optical DCIs (EO-DCIs) need to serve requests that not only require bandwidth resources
on fiber links but also require multidimensional IT resources in the DCs, multidimensional resource fragmentation can
occur during dynamic network operations and deteriorate the network performance. To address this issue, this paper
investigates the problem of joint defragmentation (DF) for the spectrum and IT resources in EO-DCIs. Specifically, we
reoptimize the allocations of multidimensional resources jointly with complexity-controlled network reconfigurations. For
the DFoperation, we first study the request selection process and propose a joint selection strategy that can perform the
spectrum-and IT-oriented selections adaptively according to the network status. Then, we formulate a mixed integer linear
programming model and design several heuristics to tackle the problem of network reconfiguration in the joint DF. The
proposed algorithms are evaluated with extensive simulations. Simulation results demonstrate that the proposed joint DF
algorithms can significantly reduce the blocking probability in EO-DCIs by consolidating the spectrum and IT resource
usages effectively.
地址: [Fang, Wenjian; Liu, Xiahe; Gong, Long; Zhu, Zuqing] Univ Sci & Technol China, Sch Informat Sci & Technol,
Hefei 230027, Anhui, Peoples R China.
[Lu, Minhua] Shenzhen Univ, Natl Reg Key Technol Engn Lab Med Ultrasound, Guangdong Key Lab Biomed
Measurements & Ultrasoun, Dept Biomed Engn, Shenzhen 518060, Guangdong, Peoples R China.
通讯作者地址: Fang, WJ (通讯作者),Univ Sci & Technol China, Sch Informat Sci & Technol, Hefei 230027, Anhui,
Peoples R China.
电子邮件地址: zqzhu@ieee.org
第 52 条，共 274 条
标题: A Precise RFID Indoor Localization System with Sensor Network Assistance
作者: Zhang, D (Zhang Dian); Lu, KZ (Lu Kezhong); Mao, R (Mao Rui)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Indoor localization is very critical for medical care applications, e.g., the patient localization or tracking inside the
building of the hospital. Traditional Radio Frequency Identification (RFID) technologies are very popular in this area since
their cost is very low. In such technologies, each tag acts as the transmitter and the Radio Signal Strength Indicator (RSSI)
information is measured from the readers. However, RSSI information suffers severely from the multi-path phenomenon.
As a result, if in a very large area, the localization accuracy will be affected seriously. In order to solve this problem, we
introduce Wireless Sensor Networks (WSNs) with only a few nodes, each of which acts as both transmitter and receiver. In
such networks, the change of signal strength (referred as dynamic of RSSI) is leveraged to select a cluster of reference tags
as candidates. Then the final target location is estimated by using the RSSI relationships between the target tag and
candidate reference tags. Thus, the localization accuracy and scalability are able to be improved. We proposed two
algorithms, SA-LANDMARC, and COCKTAIL. Experiments show that the localization accuracy of the two algorithms can
reach 0.7m and 0.45m, respectively. Compared to most traditional Radio Frequency (RF)-based approaches, the localization
accuracy is improved at least 50%.
地址: [Zhang Dian; Lu Kezhong; Mao Rui] Shenzhen Univ, Coll Comp Sci & Software Engn, Guangdong Prov Key Lab
Popular High Performance C, Shenzhen 518060, Guangdong, Peoples R China.
通讯作者地址: Mao, R (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Guangdong Prov Key Lab Popular
High Performance C, Nanhai Ave 3688, Shenzhen 518060, Guangdong, Peoples R China.
第 53 条，共 274 条
标题: Distributed Denial of Service Attacks in Software-Defined Networking with Cloud Computing
作者: Yan, Q (Yan, Qiao); Yu, FR (Yu, F. Richard)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Although software-defined networking (SDN) brings numerous benefits by decoupling the control plane from the
data plane, there is a contradictory relationship between SDN and distributed denial-of-service (DDoS) attacks. On one
hand, the capabilities of SDN make it easy to detect and to react to DDoS attacks. On the other hand, the separation of the
control plane from the data plane of SDN introduces new attacks. Consequently, SDN itself may be a target of DDoS
attacks. In this paper, we first discuss the new trends and characteristics of DDoS attacks in cloud computing environments.
We show that SDN brings us a new chance to defeat DDoS attacks in cloud computing environments, and we summarize
good features of SDN in defeating DDoS attacks. Then we review the studies about launching DDoS attacks on SDN and
the methods against DDoS attacks in SDN. In addition, we discuss a number of challenges that need to be addressed to
mitigate DDoS attached in SDN with cloud computing. This work can help understand how to make full use of SDN's
advantages to defeat DDoS attacks in cloud computing environments and how to prevent SDN itself from becoming a
victim of DDoS attacks.
地址: [Yan, Qiao] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Yu, F. Richard] Carleton Univ, Ottawa, ON K1S 5B6, Canada.
通讯作者地址: Yan, Q (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
电子邮件地址: yanci@szu.edu.cn; richard.yu@carleton.ca
第 54 条，共 274 条
标题: Smart Streaming for Online Video Services
作者: Chen, L (Chen, Liang); Zhou, YP (Zhou, Yipeng); Chiu, DM (Chiu, Dah Ming)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Bandwidth cost is a significant concern for online video service providers. Today's video streaming systems mostly
use HTTP streaming, with users accessing video segments as HTTP requests. A frequently used strategy is to serve all user
requests as fast as possible, as if the user is downloading a file. The downloading rate can often far exceed the playback
rate, when the system is below the peak load. This is known as progressive downloading. Since users may quit before
viewing the complete video, however, much of the downloaded video can be "wasted." By studying and exploiting the
predictability of users' departure behavior, the authors developed a smart streaming strategy that can significantly improve
overall streaming service quality under given server bandwidth. The improvement is achieved by avoiding the waste based
on predicted user departure behavior. The proposed smart streaming technique is evaluated by modeling, analysis, and
simulation, as well as experimentation using a prototype implementation.
地址: [Chen, Liang] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
[Zhou, Yipeng] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
[Chiu, Dah Ming] Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Zhou, YP (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R
China.
电子邮件地址: lchen@szu.edu.cn; ypzhou@szu.edu.cn; dmchiu@ie.cuhk.edu.hk
第 55 条，共 274 条
标题: Three-dimensional Gabor feature extraction for hyperspectral imagery classification using a memetic framework
作者: Zhu, ZX (Zhu, Zexuan); Jia, S (Jia, Sen); He, S (He, Shan); Sun, YW (Sun, Yiwen); Ji, Z (Ji, Zhen); Shen, LL (Shen,
Linlin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 1
摘要: Feature extraction based on three-dimensional (3D) wavelet transform is capable of improving the classification
accuracy of hyperspectral imagery data by simultaneously capturing the geometrical and statistical spectral spatial structure
of the data. Nevertheless, the design of wavelets is always proceeded with empirical parameters, which tends to involve a
large number of irrelevant and redundant spectral spatial features and results in suboptimal configuration. This paper
proposes a 3D Gabor wavelet feature extraction in a memetic framework, named M3DGFE, for hyperspectral imagery
classification. Particularly, the parameter setting of 3D Gabor wavelet feature extraction is optimized using memetic
algorithm so that discriminative and parsimonious feature set is acquired for accurate classification. M3DGFE is
characterized by an efficient fitness evaluation function and a pruning local search. In the fitness evaluation function, a new
concept of redundancy-free relevance based on conditional mutual information is proposed to measure the goodness of the
extracted candidate features. The pruning local search is specially designed to eliminate both irrelevant and redundant
features without sacrificing the discriminability of the obtained feature subset. M3DGFE is tested on both pixel-level and
image-level classification using real-world hyperspectral remote sensing data and hyperspectral face data, respectively. The
experimental results show that M3DGFE achieves promising classification accuracy with parsimonious feature subset. (C)
2014 Elsevier Inc. All rights reserved.
地址: [Zhu, Zexuan; Jia, Sen; Ji, Zhen; Shen, Linlin] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060,
Peoples R China.
[He, Shan] Univ Birmingham, Sch Comp Sci, Birmingham B15 2TT, W Midlands, England.
[Sun, Yiwen] Shenzhen Univ, Sch Med, Dept Biomed Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Shen, LL (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R
China.
电子邮件地址: llshen@szu.edu.cn
第 56 条，共 274 条
标题: Adaptive comprehensive learning bacterial foraging optimization and its application on vehicle routing problem with
time windows
作者: Tan, LJ (Tan, Lijing); Lin, FY (Lin, Fuyong); Wang, H (Wang, Hong)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: This paper proposes a variant of the bacterial foraging optimization (BFO) algorithm with time-varying chemotaxis
step length and comprehensive learning strategy which we call adaptive comprehensive learning bacterial foraging
optimization (ALCBFO). An adaptive non-linearly decreasing modulation model is used to keep a well balance between the
exploration and exploitation of the proposed algorithm. The comprehensive learning mechanism maintains the diversity of
the bacterial population and thus alleviates the premature convergence. Compared with the classical GA, PSO, the original
BFO and two improved BFO (BFO-LDC and BFO-NDC) algorithm, the proposed ACLBFO shows significantly better
performance in solving multimodal problems. We also assess the performance of the ACLBFO method on vehicle routing
problem with time windows (VRPTW). Compared with three other BFO algorithms, the proposed algorithm is superior and
confirms its potential to solve vehicle routing problem with time windows (VRPTW). (C) 2014 Elsevier B.V. All rights
reserved.
地址: [Tan, Lijing; Lin, Fuyong] Jinan Univ, Sch Management, Guangzhou 510632, Guangdong, Peoples R China.
[Wang, Hong] Shenzhen Univ, Coll Management, Shenzhen 518060, Peoples R China.
通讯作者地址: Lin, FY (通讯作者),Jinan Univ, Sch Management, Guangzhou 510632, Guangdong, Peoples R China.
电子邮件地址: drlinfuyong@163.com
第 57 条，共 274 条
标题: Hybrid learning particle swarm optimizer with genetic disturbance
作者: Liu, YM (Liu, Yanmin); Niu, B (Niu, Ben); Luo, YF (Luo, Yuanfeng)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: Particle swarm optimizer (PSO) is a population-based stochastic optimization technique which has already been
successfully applied to the engineering and other scientific fields. This paper presents a modification of PSO (hybrid
learning PSO with genetic disturbance, HLPSO-GD for short) intended to combat the problem of premature convergence
observed in many PSO variants. In HLPSO-GD, the swarm uses a hybrid learning strategy whereby all other particles'
previous best information is adopted to update a particle's position. Additionally, to better make use of the excellent
particle's information, the global external archive is introduced to store the best performing particle in the whole swarm.
Furthermore, the genetic disturbance (simulated binary crossover and polynomial mutation) is used to cross the
corresponding particle in the external archive, and generate new individuals which will improve the swarm ability to escape
from the local optima. Experiments were conducted on a set of traditional multimodal test functions and CEC 2013
benchmark functions. The results demonstrate the good performance of HLPSO-GD in solving multimodal problems when
compared with the other PSO variants. (C) 2014 Elsevier B.V. All rights reserved.
地址: [Liu, Yanmin; Luo, Yuanfeng] Zunyi Normal Coll, Sch Math & Comp Sci, Zunyi 563002, Peoples R China.
[Liu, Yanmin] Tongji Univ, Sch Econ & Management, Shanghai 200092, Peoples R China.
[Niu, Ben] Shenzhen Univ, Coll Management, Shenzhen 518060, Peoples R China.
[Niu, Ben] Chinese Acad Sci, Hefei Inst Intelligent Machines, Hefei 230031, Peoples R China.
通讯作者地址: Liu, YM (通讯作者),Zunyi Normal Coll, Sch Math & Comp Sci, Zunyi 563002, Peoples R China.
电子邮件地址: zync_lym@163.com
第 58 条，共 274 条
标题: Design of multivariable PID controllers using real-coded population-based extremal optimization
作者: Zeng, GQ (Zeng, Guo-Qiang); Chen, J (Chen, Jie); Chen, MR (Chen, Min-Rong); Dai, YX (Dai, Yu-Xing); Li, LM
(Li, Li-Min); Lu, KD (Lu, Kang-Di); Zheng, CW (Zheng, Chong-Wei)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: The issue of designing and tuning an effective and efficient multivariable PID controller for a multivariable control
system to obtain high-quality performance is of great theoretical importance and practical significance. As a novel
evolutionary algorithm inspired from statistical physics and coevolution, extremal optimization (EO) has successfully
applied to a variety of optimization problems while the applications of E0 into the design of multivariable PID and PI
controllers are relatively rare. This paper presents a novel real-coded population-based EO (RPEO) method for the design of
multivariable PID and PI controllers. The basic idea behind RPEO is based on population-based iterated optimization
process consisting of the following key operations including generation of a real-coded random initial population by
encoding the parameters of a multivariable PID or PI controller into a set of real values, evaluation of the individual fitness
by using a novel and reasonable control performance index, generation of new population based on multi-non-uniform
mutation and updating the population by accepting the new population unconditionally. From the perspectives of simplicity
and accuracy, the proposed RPEO algorithm is demonstrated to outperform other reported popular evolutionary algorithms,
such as real-coded genetic algorithm (RGA) with multi-crossover or simulated binary crossover, differential evolution (DE),
modified particle swarm optimization (MPSO), probability based discrete binary PSO (PBPSO), and covariance matrix
adaptation evolution strategy (CMAES) by the experimental results on the benchmark multivariable binary distillation
column plant. (C) 2014 Elsevier B.V. All rights reserved.
地址: [Zeng, Guo-Qiang; Chen, Jie; Dai, Yu-Xing; Li, Li-Min; Lu, Kang-Di; Zheng, Chong-Wei] Wenzhou Univ, Dept
Elect & Elect Engn, Wenzhou 325035, Peoples R China.
[Chen, Min-Rong] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Dai, YX (通讯作者),Wenzhou Univ, Dept Elect & Elect Engn, Wenzhou 325035, Peoples R China.
电子邮件地址: yuxingdai@yeah.net
第 59 条，共 274 条
标题: Global synchronization of nonlinear coupled complex dynamical networks with information exchanges at
discrete-time
作者: Tang, Z (Tang, Ze); Feng, JW (Feng, Jianwen); Zhao, Y (Zhao, Yi)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: This paper studies the problem of synchronization for a class of complex networks with discrete-time couplings. The
intrinsic local dynamical behaviors of the nodes in the complex networks are varied continuously while the manners of
information interaction between every two different nodes are discrete time-varying rather than proceeded continuously,
that is, the communications of the nodes only active at some discrete instants. Similar to the sampled data control systems,
we convert the discrete time coupling issue into an effective time-varying delayed coupling network. By constructing the
Lyapunov function skillfully, sufficient conditions are derived to guarantee the realization of the synchronization pattern for
all initial values based on the Lyapunov stability theorem and linear matrix inequalities. What is more, the maximum
allowable sampling period for communication is obtained through a optimization problem. Numerical simulations are also
exploited to demonstrate the effectiveness and validity of the main result. (C) 2014 Elsevier B.V. All rights reserved.
地址: [Tang, Ze; Feng, Jianwen; Zhao, Yi] Shenzhen Univ, Coll Math & Computat Sci, Shenzhen 518060, Peoples R
China.
[Tang, Ze] Yeungnam Univ, Dept Elect Engn, Kyongsan 712749, Gyeongbuk, South Korea.
通讯作者地址: Feng, JW (通讯作者),Shenzhen Univ, Coll Math & Computat Sci, Shenzhen 518060, Peoples R China.
电子邮件地址: fengjw@szu.edu.cn
第 60 条，共 274 条
标题: Secure Sharing and Searching for Real-Time Video Data in Mobile Cloud
作者: Liu, JK (Liu, Joseph K.); Au, MH (Au, Man Ho); Susilo, W (Susilo, Willy); Liang, KT (Liang, Kaitai); Lu, RX (Lu,
Rongxing); Srinivasan, B (Srinivasan, Bala)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In this article we propose an infrastructure that allows mobile users to securely share and search for their real-time
video data. Specifically, the proposed infrastructure takes the advantages of the cloud platform and 5G technology to
achieve its goals, where mobile users (connected with some external video taking device) can share their real-time video
with their friends or families through the cloud while any other user with no permission cannot get any information about
the video. More importantly, the infrastructure security is guaranteed even if the cloud server is hacked. In addition, our
infrastructure also allows secure searching within the user's own video data. We believe our solution is practical to be
deployed in the existing telecommunication platforms.
地址: [Liu, Joseph K.] Monash Univ, Clayton, Vic, Australia.
[Liu, Joseph K.] Shenzhen Univ, Shenzhen, Peoples R China.
[Au, Man Ho] Hong Kong Polytech Univ, Hong Kong, Hong Kong, Peoples R China.
[Susilo, Willy] Univ Wollongong, Sch Comp Sci & Software Engn, Wollongong, NSW, Australia.
[Susilo, Willy] Univ Wollongong, Ctr Comp & Informat Secur Res, Wollongong, NSW, Australia.
[Liang, Kaitai] Aalto Univ, Dept Informat & Comp Sci, Espoo, Finland.
[Lu, Rongxing] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore, Singapore.
[Srinivasan, Bala] Monash Univ, Informat Technol, Clayton, Vic, Australia.
通讯作者地址: Liu, JK (通讯作者),Monash Univ, Clayton, Vic, Australia.
第 61 条，共 274 条
标题: Towards Write-Activity-Aware Page Table Management for Non-volatile Main Memories
作者: Wang, TZ (Wang, Tianzheng); Liu, D (Liu, Duo); Wang, Y (Wang, Yi); Shao, ZL (Shao, Zili)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Non-volatile memories such as phase change memory (PCM) and memristor are being actively studied as an
alternative to DRAM-based main memory in embedded systems because of their properties, which include low power
consumption and high density. Though PCM is one of the most promising candidates with commercial products available,
its adoption has been greatly compromised by limited write endurance. As main memory is one of the most heavily
accessed components, it is critical to prolong the lifetime of PCM.
In this article, we present write-activity-aware page table management (WAPTM), a simple yet effective page table
management scheme for reducing unnecessary writes, by redesigning system software and exploiting write-activity-aware
features provided by the hardware. We implemented WAPTM in Google Android based on the ARM architecture and
evaluated it with real Android applications. Experimental results show that WAPTM can significantly reduce writes in page
tables, proving the feasibility and potential of prolonging the lifetime of PCM-based main memory through reducing writes
at the OS level.
地址: [Wang, Tianzheng] Univ Toronto, Dept Comp Sci, Toronto, ON M5S 3G4, Canada.
[Liu, Duo] Chongqing Univ, Coll Comp Sci, Chongqing 400044, Peoples R China.
[Wang, Yi] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
[Shao, Zili] Hong Kong Polytech Univ, Dept Comp, Kowloon, Hong Kong, Peoples R China.
通讯作者地址: Wang, TZ (通讯作者),Univ Toronto, Dept Comp Sci, 10 Kings Coll Rd,Rm 3302, Toronto, ON M5S 3G4,
Canada.
电子邮件地址: tzwang@cs.toronto.edu; liuduo@cqu.edu.cn; yiwang@szu.edu.cn
第 62 条，共 274 条
标题: General Construction Method of Multilength Optical Orthogonal Codes With Arbitrary Cross-Correlation Constraint
for OCDMA Multimedia Network
作者: Li, XB (Li, Xiaobin); Lu, LZ (Lu, Lizhi)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Due to the fact that we lack a general construction method of (N, w, lambda, lambda) multiple-length (ML) optical
orthogonal codes (OOCs), a general construction method with high efficiency for ML OOCs with arbitrary cross-correlation
lambda is presented. The main idea of the method is to construct a variable-length mapping sequence with unparallel
lambda positions, with which to map short-length-OOCs into long-length OOCs to realize the general construction of ML
OOCs with correlation value lambda with high efficiency by the Johnson bound. The cardinality of multiple-length
mapping sequences is derived. Based on the cardinality, the fundamentals of constructing the aforementioned
multiple-length mapping sequences are presented and proved. The construction method of ML OOCs with arbitrary
cross-correlation lambda is given. Simulation results show that the method can construct ML OOCs with arbitrary lambda;
the applications of ML OOCs show that the method is practical for constructing ML OOCs to support multiple service.
地址: [Li, Xiaobin] Shenzhen Univ, Shenzhen Key Lab Adv Commun & Informat Proc, Shenzhen, Peoples R China.
[Lu, Lizhi] Shenzhen Univ, Coll Informat Engn, Shenzhen, Peoples R China.
通讯作者地址: Li, XB (通讯作者),Shenzhen Univ, Shenzhen Key Lab Adv Commun & Informat Proc, Shenzhen, Peoples
R China.
电子邮件地址: lixbsz@126.com
第 63 条，共 274 条
标题: Sparse and Low-Rank Coupling Image Segmentation Model Via Nonconvex Regularization
作者: Zhang, XJ (Zhang, Xiujun); Xu, C (Xu, Chen); Li, M (Li, Min); Sun, XL (Sun, Xiaoli)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: This paper investigates how to boost region-based image segmentation by inheriting the advantages of sparse
representation and low-rank representation. A novel image segmentation model, called nonconvex regularization based
sparse and low-rank coupling model, is presented for such a purpose. We aim at finding the optimal solution which is
provided with sparse and low-rank simultaneously. This is achieved by relaxing sparse representation problem as L-1/2
norm minimization other than the L-1 norm minimization, while relaxing low-rank representation problem as the S-1/2
norm minimization other than the nuclear norm minimization. This coupled model can be solved efficiently through the
Augmented Lagrange Multiplier (ALM) method and half-threshold operator. Compared to the other state-of-the-art
methods, the new method is better at capturing the global structure of the whole data, the robustness is better and the
segmentation accuracy is also competitive. Experiments on two public image segmentation databases well validate the
superiority of our method.
地址: [Zhang, Xiujun] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Guangdong, Peoples R China.
[Xu, Chen] Shenzhen Univ, Inst Intelligent Comp Sci, Shenzhen 518060, Guangdong, Peoples R China.
[Li, Min; Sun, Xiaoli] Shenzhen Univ, Coll Math & Comp Sci, Shenzhen 518060, Guangdong, Peoples R China.
通讯作者地址: Xu, C (通讯作者),Shenzhen Univ, Inst Intelligent Comp Sci, Nanhai Ave 3688, Shenzhen 518060,
Guangdong, Peoples R China.
电子邮件地址: zhangxiujunszu@gmail.com; xuchen_szu@szu.edu.cn; limin800@szu.edu.cn; xlsun@szu.edu.cn
第 64 条，共 274 条
标题: Revealing the Trace of High-Quality JPEG Compression Through Quantization Noise Analysis
作者: Li, B (Li, Bin); Ng, TT (Ng, Tian-Tsong); Li, XL (Li, Xiaolong); Tan, SQ (Tan, Shunquan); Huang, JW (Huang,
Jiwu)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: To identify whether an image has been JPEG compressed is an important issue in forensic practice. The
state-of-the-art methods fail to identify high-quality compressed images, which are common on the Internet. In this paper,
we provide a novel quantization noise-based solution to reveal the traces of JPEG compression. Based on the analysis of
noises in multiple-cycle JPEG compression, we define a quantity called forward quantization noise. We analytically derive
that a decompressed JPEG image has a lower variance of forward quantization noise than its uncompressed counterpart.
With the conclusion, we develop a simple yet very effective detection algorithm to identify decompressed JPEG images.
We show that our method outperforms the state-of-the-art methods by a large margin especially for high-quality compressed
images through extensive experiments on various sources of images. We also demonstrate that the proposed method is
robust to small image size and chroma subsampling. The proposed algorithm can be applied in some practical applications,
such as Internet image classification and forgery detection.
地址: [Li, Bin; Huang, Jiwu] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
[Li, Bin] Shenzhen Key Lab Adv Commun & Informat Proc, Shenzhen 518060, Peoples R China.
[Ng, Tian-Tsong] Agcy Sci Technol & Res, Inst Infocomm Res, Singapore 138632, Singapore.
[Li, Xiaolong] Peking Univ, Inst Comp Sci & Technol, Beijing 100871, Peoples R China.
[Tan, Shunquan] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
[Tan, Shunquan; Huang, Jiwu] Shenzhen Key Lab Media Secur, Shenzhen 518060, Peoples R China.
通讯作者地址: Li, B (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: libin@szu.edu.cn; ttng@i2r.a-star.edu.sg; lixiaolong@pku.edu.cn; tansq@szu.edu.cn; jwhuang@szu.edu.cn
第 65 条，共 274 条
标题: A solution of dynamic VMs placement problem for energy consumption optimization based on evolutionary game
theory
作者: Xiao, ZJ (Xiao, Zhijiao); Jiang, JM (Jiang, Jianmin); Zhu, YY (Zhu, Yingying); Ming, Z (Ming, Zhong); Zhong, SH
(Zhong, Shenghua); Cai, SB (Cai, Shubin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Power saving of data centers has become an urgent problem in recent years. For a virtualized data center, optimizing
the placement of virtual machines (VMs) dynamically is one of the most effective methods for power savings. Based on a
deep study on VMs placement, a solution is proposed and described in this paper to solve the problem of dynamic
placement of VMs toward optimization of their energy consumptions. A computational model of energy consumption is
proposed and built. A novel algorithm based on evolutionary game theory is also presented, which successfully addresses
the challenges faced by dynamic placement of VMs. It is proved that the proposed algorithm can reach the optimal solutions
theoretically. Experimental results also demonstrate that, by adjusting VMs placement dynamically, the energy consumption
can be reduced correspondingly. In comparison with the existing state of the arts, our proposed method outperforms other
five algorithms tested and achieves savings of 30-40% on energy consumption. (C) 2014 Elsevier Inc. All rights reserved.
地址: [Xiao, Zhijiao; Jiang, Jianmin; Zhu, Yingying; Ming, Zhong; Zhong, Shenghua; Cai, Shubin] Shenzhen Univ, Coll
Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
[Xiao, Zhijiao; Ming, Zhong; Cai, Shubin] Shenzhen Univ, Shenzhen Engn Lab Mobile Internet Applicat Middle, Shenzhen
518060, Peoples R China.
[Xiao, Zhijiao; Jiang, Jianmin; Zhu, Yingying; Zhong, Shenghua] Shenzhen Univ, Res Inst Future Media Comp, Shenzhen
578060, Peoples R China.
通讯作者地址: Xiao, ZJ (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R
China.
电子邮件地址: cindyxzj@szu.edu.cn; jianmin.jiang@szu.edu.cn; zhuyy@szu.edu.cn; mingz@szu.edu.cn;
shubin@szu.edu.cn
第 66 条，共 274 条
标题: Deterministic process-based generative models for characterizing packet-level bursty error sequences
作者: He, YJ (He, Yejun); Salih, OS (Salih, Omar S.); Wang, CX (Wang, Cheng-Xiang); Yuan, DF (Yuan, Dongfeng)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 2
摘要: Errors encountered in digital wireless channels are not independent but rather form bursts or clusters. Error models
aim to investigate the statistical properties of bursty error sequences at either packet level or bit level. Packet-level error
models are crucial to the design and performance evaluation of high-layer wireless communication protocols. This paper
proposes a general design procedure for a packet-level generative model based on a sampled deterministic process with a
threshold detector and two parallel mappers. In order to assess the proposed method, target packet error sequences are
derived by computer simulations of a coded enhanced general packet radio service system. The target error sequences are
compared with the generated error sequences from the deterministic process-based generative model using some widely
used burst error statistics, such as error-free run distribution, error-free burst distribution, error burst distribution, error
cluster distribution, gap distribution, block error probability distribution, block burst probability distribution, packet error
correlation function, normalized covariance function, gap correlation function, and multigap distribution. The deterministic
process-based generative model is observed to outperform the widely used Markov models. Copyright (c) 2013 John Wiley
& Sons, Ltd.
地址: [He, Yejun] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
[Salih, Omar S.; Wang, Cheng-Xiang] Heriot Watt Univ, Joint Res Inst Signal & Image Proc, Sch Engn & Phys Sci,
Edinburgh EH14 4AS, Midlothian, Scotland.
[Wang, Cheng-Xiang; Yuan, Dongfeng] Shandong Univ, Sch Informat Sci & Engn, Jinan 250100, Shandong, Peoples R
China.
通讯作者地址: Wang, CX (通讯作者),Heriot Watt Univ, Joint Res Inst Signal & Image Proc, Sch Engn & Phys Sci,
Edinburgh EH14 4AS, Midlothian, Scotland.
电子邮件地址: cheng-xiang.wang@hw.ac.uk
第 67 条，共 274 条
标题: FR-KECA: Fuzzy robust kernel entropy component analysis
作者: Shi, J (Shi, Jun); Jiang, QK (Jiang, Qikun); Mao, R (Mao, Rui); Lu, MH (Lu, Minhua); Wang, TF (Wang, Tianfu)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 3
摘要: Kernel entropy component analysis (KECA) is a newly proposed spectral method for data transformation and
dimensionality reduction. Different from other spectral methods, KECA reveals structure related to the Renyi entropy of the
input space data set. Therefore, it is not necessary to select the top eigenvalues and eigenvectors of the kernel matrix.
Consequently, KECA has been successfully applied in many areas due to its special properties. However, similar to other
spectral methods. KECA also suffers from the problem of noise sensitivity, because small entropy values in the input space
may be associated with noise. To improve the robustness against noise of spectral methods, fuzzy set theory has been
successfully introduced into some spectral methods, which is a simple and effective solution. In this paper, we propose the
fuzzy robust KECA (FR-KECA) algorithm based on fuzzy set theory to improve the robustness. The main idea of
FR-KECA is to induce the fuzzy item to optimize the kernel entropy components in KECA, which makes the transformed
data more robust. Three FR-KECA algorithms are proposed, and then evaluated in three data transformation experiments
and two dimensionality reduction experiments with five commonly used datasets. The experimental results indicate that the
proposed three FR-KECA algorithms outperform the original KECA in both data transformation and dimensionality
reduction at least 0.7% up to 4.3% for different data sets, suggesting that the proposed FR-KECA algorithms have the
potential to be applied to noise-corrupted high dimensional data. (c) 2014 Elsevier B.V. All rights reserved,
地址: [Shi, Jun; Jiang, Qikun] Shanghai Univ, Sch Commun & Informat Engn, Shanghai 200041, Peoples R China.
[Mao, Rui] Shenzhen Univ, Coll Comp Sci & Software Engn, Guangdong Prov Key Lab Popular High Performance C,
Shenzhen 518060, Peoples R China.
[Mao, Rui] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen Key Lab Serv Comp & Applicat, Shenzhen
518060, Peoples R China.
[Lu, Minhua; Wang, Tianfu] Shenzhen Univ, Sch Med, Dept Biomed Engn, Natl Reg Key Technol Engn Lab Med
Ultrasound, Shenzhen 518060, Peoples R China.
[Lu, Minhua; Wang, Tianfu] Shenzhen Univ, Sch Med, Dept Biomed Engn, Guangdong Key Lab Biomed Measurements &
Ultrasoun, Shenzhen 518060, Peoples R China.
通讯作者地址: Lu, MH (通讯作者),Shenzhen Univ, Sch Med, Dept Biomed Engn, Natl Reg Key Technol Engn Lab Med
Ultrasound, Nanhai Ave 3688, Shenzhen 518060, Peoples R China.
电子邮件地址: luminhua@szu.edu.cn
第 68 条，共 274 条
标题: Single-trial ERPs denoising via collaborative filtering on ERPs images
作者: Huang, Y (Huang, Yue); Chen, X (Chen, Xin); Zhang, J (Zhang, Jun); Zeng, DL (Zeng, Delu); Zhang, DD (Zhang,
Dandan); Ding, XH (Ding, Xinghao)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: The single-trial denoising is still a challenge in both the neuroscience research and signal processing due to poor
signal-to-noise ratio. The Event-related Potentials (ERPs) denoising using ERPs image processing has received a significant
attention in recent years. Considering the importance of latency and amplitude details in the ERPs analysis, the desirable
methods for ERPs denoising are supposed to remove the large noise effectively while keeping the important information of
the ERPs signal, latency and amplitude. A collaborative filtering that includes image patch grouping, shrinkage in 3D
transform domain, and aggregation is applied to remove the background noise from the ERPs images. The denoising
experiments have been evaluated on simulated data and real data using waveform observation, objective criteria calculation,
and single-trial classification. The validations have demonstrated that the collaborative filtering is able to remove the noise
effectively compared to wavelet and non local means. Moreover, it also preserves the details of the ERPs signals for latency
and amplitude estimation simultaneously. (C) 2014 Elsevier B.V. All rights reserved.
地址: [Huang, Yue; Chen, Xin; Zhang, Jun; Zeng, Delu; Ding, Xinghao] Xiamen Univ, Coll Informat Sci & Engn, Xiamen
361005, Peoples R China.
[Zhang, Dandan] Shenzhen Univ, Inst Affect & Social Neurosci, Shenzhen 518060, Peoples R China.
通讯作者地址: Zhang, DD (通讯作者),Shenzhen Univ, Inst Affect & Social Neurosci, Shenzhen 518060, Peoples R
China.
电子邮件地址: zhangdd05@gmail.com; dxh@xmu.edu.cn
第 69 条，共 274 条
标题: A binary differential evolution algorithm learning from explored solutions
作者: Chen, Y (Chen, Yu); Xie, WC (Xie, Weicheng); Zou, XF (Zou, Xiufen)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Although real-coded differential evolution (DE) algorithm's can perform well on continuous optimization problems
(CoOPs), designing an efficient binary-coded DE algorithm is still a challenging task. Inspired by the learning mechanism
in particle swarm optimization (PSO) algorithms, we propose a binary learning differential evolution (BLDE) algorithm that
can efficiently locate the global optimal solutions by learning from the last population. Then, we theoretically prove the
global convergence of BLDE, and compare it with some existing binary-coded evolutionary algorithms (EAs) via numerical
experiments. Numerical results show that BLDE is competitive with the compared EAs. Further study is performed via the
change curves of a renewal metric and a refinement metric to investigate why BLDE cannot outperform some compared
EM for several selected benchmark problems. Finally, we employ BLDE in solving the unit commitment problem (UCP) in
power systems to show its applicability to practical problems. (C) 2014 Elsevier B.V. All rights reserved.
地址: [Chen, Yu] Wuhan Univ Technol, Sch Sci, Wuhan 430070, Peoples R China.
[Chen, Yu; Zou, Xiufen] Wuhan Univ, Sch Math & Stat, Wuhan 430072, Peoples R China.
[Xie, Weicheng] Shenzhen Univ, Sch Comp Sci & Software Engn, Shenzhen Key Lab Spatial Smart Sensing & Serv,
Shenzhen 518052, Peoples R China.
通讯作者地址: Chen, Y (通讯作者),Wuhan Univ Technol, Sch Sci, Wuhan 430070, Peoples R China.
电子邮件地址: chymath@gmail.com
第 70 条，共 274 条
标题: Analysis and Detection of Fake Views in Online Video Services
作者: Chen, L (Chen, Liang); Zhou, YP (Zhou, Yipeng); Chiu, DM (Chiu, Dah Ming)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Online video-on-demand(VoD) services invariably maintain a view count for each video they serve, and it has
become an important currency for various stakeholders, from viewers, to content owners, advertizers, and the online service
providers themselves. There is often significant financial incentive to use a robot (or a botnet) to artificially create fake
views. How can we detect fake views? Can we detect them (and stop them) efficiently? What is the extent of fake views
with current VoD service providers? These are the questions we study in this article. We develop some algorithms and show
that they are quite effective for this problem.
地址: [Chen, Liang] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
[Zhou, Yipeng] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
[Chiu, Dah Ming] Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Chen, L (通讯作者),Shenzhen Univ, Coll Informat Engn, Nanhai Ave 3688, Shenzhen 518060, Peoples R
China.
电子邮件地址: lchen@szu.edu.en; ypzhou@szu.edu.cn
第 71 条，共 274 条
标题: CompMap: a reference-based compression program to speed up read mapping to related reference sequences
作者: Zhu, ZX (Zhu, Zexuan); Li, LS (Li, Linsen); Zhang, YP (Zhang, Yongpeng); Yang, YL (Yang, Yanli); Yang, X
(Yang, Xiao)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Exhaustive mapping of next-generation sequencing data to a set of relevant reference sequences becomes an
important task in pathogen discovery and metagenomic classification. However, the runtime and memory usage increase as
the number of reference sequences and the repeat content among these sequences increase. In many applications, read
mapping time dominates the entire application. We developed CompMap, a reference-based compression program, to speed
up this process. CompMap enables the generation of a non-redundant representative sequence for the input sequences. We
have demonstrated that reads can be mapped to this representative sequence with a much reduced time and memory usage,
and the mapping to the original reference sequences can be recovered with high accuracy.
地址: [Zhu, Zexuan; Li, Linsen; Zhang, Yongpeng; Yang, Yanli] Shenzhen Univ, Coll Comp Sci & Software Engn,
Shenzhen 518060, Peoples R China.
[Yang, Xiao] Broad Inst, Infect Dis Initiat, Cambridge, MA 02142 USA.
通讯作者地址: Yang, X (通讯作者),Broad Inst, Infect Dis Initiat, Cambridge, MA 02142 USA.
电子邮件地址: xiaoyang@broadinstitute.org
第 72 条，共 274 条
标题: Exploiting the prefix information to enhance the performance of FSA-based RFID systems
作者: Lin, XH (Lin, Xiao-Hui); Wang, H (Wang, Hui); Kwok, YK (Kwok, Yu-Kwong); Chen, B (Chen, Bin); Dai, M (Dai,
Mingjun); Zhang, L (Zhang, Li)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: For a radio frequency identification (RFID) system deployed in dense environment, the reader must quickly and
reliably extract information from numerous tags. To harmonize the channel access among competing tags and reduce
collision probability, conventionally, framed slotted ALOHA (FSA) scheme is employed to resolve the collisions occurring
when numerous tags simultaneously respond to the query of the reader. Typically, FSA algorithm consists of two parts: (i)
estimating the number of available tags in vicinity, and (ii) base on the estimated value, setting the frame length
accordingly. However, in the FSA scheme, when collision happens, it is impossible to estimate how many colliding tags
simultaneously reply in a single slot, which, in turn, can lead to inaccuracy of the estimated cardinality and unreasonable
setting of the frame length. This will further result in under-utilization of channel resource and the degradation of the system
performance. The problem can be aggravated when all slots in the frame are entirely collided under a dense environment,
rendering the malfunction of the estimator.
To address this problem, in this paper, a prefix assisted approach, namely, PA-FSA, is proposed to enhance the estimation
accuracy of the traditional FSA. Specifically, in PA-FSA, each tag appends a prefix in front of RN16 short message. When
replying RN16 to the reader, a tag randomly and independently selects one bit in the prefix and sets the bit as active. By
synchronizing prefixes of multiple colliding replies and counting the number of active bits in the overlapping prefixes, the
reader can more precisely estimate how many tags have collided in a single slot, thus significantly improving the estimation
accuracy. Extensive simulation results indicate that, compared with the traditional schemes, PA-FSA can estimate the tag
cardinality more accurately and efficiently. Additionally, with PA-FSA adopted, system can reduce the communication
overhead for approximately 50% and shorten the tag identification time for about 15%. (C) 2014 Elsevier B.V. All rights
reserved.
地址: [Lin, Xiao-Hui; Wang, Hui; Chen, Bin; Dai, Mingjun; Zhang, Li] Shenzhen Univ, Dept Commun Engn, Shenzhen,
Peoples R China.
[Kwok, Yu-Kwong] Univ Hong Kong, Dept Elect & Elect Engn, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Chen, B (通讯作者),Shenzhen Univ, Dept Commun Engn, Shenzhen, Peoples R China.
电子邮件地址: xhlin@szu.edu.cn; bchen@szu.edu.cn
第 73 条，共 274 条
标题: Bacterial-inspired algorithms for solving constrained optimization problems
作者: Niu, B (Niu, Ben); Wang, JW (Wang, Jingwen); Wang, H (Wang, Hong)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: Bio-inspired optimization techniques using analogy of swarming principles and social behavior in nature have been
adopted to solve a variety of problems. In this paper Bacterial Foraging Optimization (BFO) is employed to achieve
high-quality solutions to the constrained optimization problems. However, the chemotaxis step was set as only a constant in
the original BFO, where no mechanism could keep the balance between global search and local search. To further improve
the performance of the original BFO, we also come up with two modified BFOs, i.e. BFO with linear decreasing
chemotaxis step (BFO-LDC) and BFO with non-linear decreasing chemotaxis step (BFO-NDC). In order to illustrate the
efficiency of the proposed method (BFO-LDC and BFO-NDC), six well-known constrained benchmark problems from the
optimization literature were selected as testing functions. The experimental results demonstrated that the modified BFOs are
of greater efficiency in the speed of convergence as well as fine tune the search in the multidimensional space, and they can
be used as a general approach for most nonlinear optimization problems with inequity constrains. (C) 2014 Published by
Elsevier B.V.
地址: [Niu, Ben; Wang, Jingwen; Wang, Hong] Shenzhen Univ, Coll Management, Shenzhen 518060, Peoples R China.
[Niu, Ben] Chinese Acad Sci, Hefei Inst Intelligent Machines, Hefei 230031, Peoples R China.
[Niu, Ben] Hong Kong Polytech Univ, Dept Ind & Syst Engn, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Niu, B (通讯作者),Shenzhen Univ, Coll Management, Shenzhen 518060, Peoples R China.
电子邮件地址: drniuben@gmail.com
第 74 条，共 274 条
标题: Robust twin boosting for feature selection from high-dimensional omics data with label noise
作者: He, S (He, Shan); Chen, HH (Chen, Huanhuan); Zhu, ZX (Zhu, Zexuan); Ward, DG (Ward, Douglas G.); Cooper, HJ
(Cooper, Helen J.); Viant, MR (Viant, Mark R.); Heath, JK (Heath, John K.); Yao, X (Yao, Xin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Omics data such as microarray transcriptomic and mass spectrometry proteomic data are typically characterized by
high dimensionality and relatively small sample sizes. In order to discover biomarkers for diagnosis and prognosis from
omics data, feature selection has become an indispensable step to find a parsimonious set of informative features. However,
many previous studies report considerable label noise in omics data, which will lead to unreliable inferences to select
uninformative features. Yet, to the best of our knowledge, very few feature selection methods are proposed to address this
problem. This paper proposes a novel ensemble feature selection algorithm, robust twin boosting feature selection (RTBFS),
which is robust to label noise in omics data. The algorithm has been validated on an omics feature selection test bed and
seven real-world heterogeneous omics datasets, of which some are known to have label noise. Compared with several
state-of-the-art ensemble feature selection methods, RTBFS can select more informative features despite label noise and
obtain better classification results. RTBFS is a general feature selection method and can be applied to other data with label
noise. MATLAB implementation of RTBFS and sample datasets are available at: http://www.cs.bham.ac.uk/similar to
szh/TReBFSMatlab.zip. (C) 2014 Elsevier Inc. All rights reserved.
地址: [He, Shan; Chen, Huanhuan; Yao, Xin] Univ Birmingham, Sch Comp Sci, CERCIA, Birmingham B15 2TT, W
Midlands, England.
[Zhu, Zexuan] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Ward, Douglas G.] Univ Birmingham, Sch Canc Sci, Birmingham B15 2TT, W Midlands, England.
[Cooper, Helen J.; Viant, Mark R.; Heath, John K.] Univ Birmingham, Sch Biosci, Birmingham B15 2TT, W Midlands,
England.
通讯作者地址: Zhu, ZX (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
电子邮件地址: s.he@cs.bham.ac.uk; h.chen@cs.bham.ac.uk; zhuzx@szu.edu.cn; d.g.ward@bham.ac.uk;
h.j.cooper@bham.ac.uk; m.viant@bham.ac.uk; j.k.heath@bham.ac.uk; x.yao@cs.bham.ac.uk
第 75 条，共 274 条
标题: Global path planning of wheeled robots using multi-objective memetic algorithms
作者: Zhu, ZX (Zhu, Zexuan); Xiao, J (Xiao, Jun); Li, JQ (Li, Jian-Qiang); Wang, FX (Wang, Fangxiao); Zhang, QF
(Zhang, Qingfu)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Global path planning is a fundamental problem of mobile robotics. The majority of global path planning methods are
designed to find a collision-free path from a start location to a target location while optimizing one or more objectives like
path length, smoothness, and safety at a time. It is noted that providing multiple tradeoff path solutions of different
objectives is much more beneficial to the user's choice than giving a single optimal solution in terms of some specific
criterion. This paper proposes a global path planning of wheeled robots using multi-objective memetic algorithms
(MOMAs). Particularly, two MOMAs are implemented based on conventional multi-objective genetic algorithms with
elitist non-dominated sorting and decomposition strategies respectively to optimize the path length and smoothness
simultaneously. Novel path encoding scheme, path refinement, and specific evolutionary operators are designed and
introduced to the MOMAs to enhance the search ability of the algorithms as well as guarantee the safety of the candidate
paths obtained in complex environments. Experimental results on both simulated and real environments show that the
proposed MOMAs are efficient in planning a set of valid tradeoff paths in complex environments.
地址: [Zhu, Zexuan; Xiao, Jun; Li, Jian-Qiang; Wang, Fangxiao] Shenzhen Univ, Coll Comp Sci & Software Engn,
Shenzhen, Guangdong, Peoples R China.
[Zhang, Qingfu] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Peoples R China.
[Zhang, Qingfu] Univ Essex, Sch Comp Sci & Elect Engn, Colchester CO4 3SQ, Essex, England.
通讯作者地址: Zhu, ZX (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Guangdong, Peoples R
China.
电子邮件地址: zhuzx@szu.edu.cn
第 76 条，共 274 条
标题: An Intelligent Wireless Sensor Networks System with Multiple Servers Communication
作者: Li, JQ (Li, Jian-qiang); He, SQ (He, Sui-qiang); Ming, Z (Ming, Zhong); Cai, SB (Cai, Shubin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: For shortcomings of current smart home system and power line carrier insufficient data transferring, an intelligent
sensor networks system based on intelligent gateway is studied in this paper. Smart home system includes internal network,
intelligent gateway, and external network. Multiple servers are designed in gateway, which start at the same time and
receive various forms of data. Then data is processed for internal network format. External network includes several modes
of communication such as TCP/IP, UDP, and pipe. Internal network includes ZigBee wireless and power line carrier (PLC)
communication. Power line carrier protocol is improved, and it expands data transmission capacity to accommodate
communication needs of modern family. Smart home system is designed as modules, such as intelligent gateway module,
power line carrier communication module, ZigBee wireless communication modules, and appliance within electric
equipment. Finally this system is physically designed and verified. The smart home system introduced in this paper has
easily used and has strong compatibility.
地址: [Li, Jian-qiang; He, Sui-qiang; Ming, Zhong; Cai, Shubin] Shenzhen Univ, Coll Comp Sci & Software Engn,
Shenzhen 518060, Peoples R China.
[Li, Jian-qiang; He, Sui-qiang; Ming, Zhong; Cai, Shubin] Shenzhen Univ, Shenzhen Engn Lab Mobile Internet Applicat
Middle, Shenzhen 518060, Peoples R China.
通讯作者地址: Li, JQ (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: lijq@szu.edu.cn; mingz@szu.edu.cn
第 77 条，共 274 条
标题: Two implementations of marginal distribution Bayes filter for nonlinear Gaussian models
作者: Liu, ZX (Liu, Zong-xiang); Li, LJ (Li, Li-juan); Xie, WX (Xie, Wei-xin); Li, LQ (Li, Liang-qun)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: The marginal distribution Bayes (MDB) filter is an efficient approach for tracking an unknown and time-varying
number of targets in the presence of clutter, noise, data association uncertainty, and detection uncertainty. This filter
propagates the marginal distributions and existence probabilities of each target in the filter recursion, and it admits a
closed-form solution for a linear Gaussian multi-target model. However, this closed-form solution is not general enough to
accommodate nonlinear multi-target models. In this paper, we propose two implementations of the MDB filter to
accommodate nonlinear multi-target models. The first is the first-order Taylor approximation MOB (FTA-MDB) filter
which is based on the linearization technique of nonlinear function, and the second is the unscented transform MDB
(UT-MDB) filter which is based on the unscented transform technique. Simulation results demonstrate that the proposed
implementations are better on multiple targets tracking than the UK-PHD filter. (C) 2015 Elsevier GmbH. All rights
reserved.
地址: [Liu, Zong-xiang; Li, Li-juan; Xie, Wei-xin; Li, Liang-qun] Shenzhen Univ, Coll Informat & Engn, ATR Key Lab,
Shenzhen 518060, Peoples R China.
通讯作者地址: Liu, ZX (通讯作者),Shenzhen Univ, Coll Informat & Engn, ATR Key Lab, Shenzhen 518060, Peoples R
China.
电子邮件地址: liuzx@szu.edu.cn
第 78 条，共 274 条
标题: Effective algorithms of the Moore-Penrose inverse matrices for extreme learning machine
作者: Lu, SX (Lu, Shuxia); Wang, XZ (Wang, Xizhao); Zhang, GQ (Zhang, Guiqiang); Zhou, X (Zhou, Xu)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Extreme learning machine (ELM) is a learning algorithm for single-hidden layer feedforward neural networks
(SLFNs) which randomly chooses hidden nodes and analytically determines the output weights of SLFNs. After the input
weights and the hidden layer biases are chosen randomly, ELM can be simply considered a linear system. However, the
learning time of ELM is mainly spent on calculating the Moore-Penrose inverse matrices of the hidden layer output matrix.
This paper focuses on effective computation of the Moore-Penrose inverse matrices for ELM, several methods are
proposed. They are the reduced QR factorization with column Pivoting and Geninv ELM (QRGeninv-ELM), tensor product
matrix ELM (TPM-ELM). And we compare QRGeninv-ELM, TPM-ELM with the relational algorithm of Moore-Penrose
inverse matrices for ELM, the relational algorithms are: Cholesky factorization of singular matrix ELM (Geninv-ELM), QR
factorization and Ginv ELM (QRGinv-ELM), the conjugate Gram-Schmidt process ELM (CGS-ELM). The experimental
results and the statistical analysis of the experimental results both demonstrate that QRGeninv-ELM, TPM-ELM and
Geninv-ELM are faster than other kinds of ELM and can reach comparable generalization performance.
地址: [Lu, Shuxia; Zhang, Guiqiang; Zhou, Xu] Hebei Univ, Coll Math & Informat Sci, Baoding 071002, Hebei, Peoples R
China.
[Lu, Shuxia] Key Lab Machine Learning & Computat Intelligence, Baoding, Hebei, Peoples R China.
[Wang, Xizhao] Shenzhen Univ, Coll Comp Sci & Software, Shenzhen, Peoples R China.
通讯作者地址: Lu, SX (通讯作者),Hebei Univ, Coll Math & Informat Sci, Baoding 071002, Hebei, Peoples R China.
电子邮件地址: cmclusx@126.com
第 79 条，共 274 条
标题: Learning from big data with uncertainty - editorial
作者: Wang, XZ (Wang, Xizhao)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Focusing on learning from big data with uncertainty, this special issue includes 5 papers; this editorial presents a
background of the special issue and a brief introduction to the 5 papers.
地址: ShenZhen Univ, Coll Comp Sci & Software Engn, Big Data Inst, Shenzhen, Peoples R China.
通讯作者地址: Wang, XZ (通讯作者),ShenZhen Univ, Coll Comp Sci & Software Engn, Big Data Inst, Shenzhen, Peoples
R China.
电子邮件地址: xizhaowang@ieee.org
第 80 条，共 274 条
标题: From QoS to QoE: A Tutorial on Video Quality Assessment
作者: Chen, YJ (Chen, Yanjiao); Wu, KS (Wu, Kaishun); Zhang, Q (Zhang, Qian)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Quality of experience (QoE) is the perceptual quality of service (QoS) from the users' perspective. For video service,
the relationship between QoE and QoS (such as coding parameters and network statistics) is complicated because users'
perceptual video quality is subjective and diversified in different environments. Traditionally, QoE is obtained from
subjective test, where human viewers evaluate the quality of tested videos under a laboratory environment. To avoid high
cost and offline nature of such tests, objective quality models are developed to predict QoE based on objective QoS
parameters, but it is still an indirect way to estimate QoE. With the rising popularity of video streaming over the Internet,
data-driven QoE analysis models have newly emerged due to availability of large-scale data. In this paper, we give a
comprehensive survey of the evolution of video quality assessment methods, analyzing their characteristics, advantages, and
drawbacks. We also introduce QoE-based video applications and, finally, identify the future research directions of QoE.
地址: [Chen, Yanjiao; Zhang, Qian] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Hong Kong,
Peoples R China.
[Wu, Kaishun] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
[Wu, Kaishun] Hong Kong Univ Sci & Technol, Fok Ying Tung Res Inst, Kowloon, Hong Kong, Peoples R China.
通讯作者地址: Chen, YJ (通讯作者),Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Hong Kong,
Peoples R China.
第 81 条，共 274 条
标题: Multiagent Reinforcement Social Learning toward Coordination in Cooperative Multiagent Systems
作者: Hao, JY (Hao, Jianye); Leung, HF (Leung, Ho-Fung); Ming, Z (Ming, Zhong)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Most previous works on coordination in cooperative multiagent systems study the problem of how two (or more)
players can coordinate on Pareto-optimal Nash equilibrium(s) through fixed and repeated interactions in the context of
cooperative games. However, in practical complex environments, the interactions between agents can be sparse, and each
agent's interacting partners may change frequently and randomly. To this end, we investigate the multiagent coordination
problems in cooperative environments under a social learning framework. We consider a large population of agents where
each agent interacts with another agent randomly chosen from the population in each round. Each agent learns its policy
through repeated interactions with the rest of the agents via social learning. It is not clear a priori if all agents can learn a
consistent optimal coordination policy in such a situation. We distinguish two different types of learners depending on the
amount of information each agent can perceive: individual action learner and joint action learner. The learning performance
of both types of learners is evaluated under a number of challenging deterministic and stochastic cooperative games, and the
influence of the information sharing degree on the learning performance also is investigated-a key difference from the
learning framework involving repeated interactions among fixed agents.
地址: [Hao, Jianye] MIT, Comp Sci & Artificial Intelligence Lab, Cambridge, MA 02139 USA.
[Leung, Ho-Fung] Chinese Univ Hong Kong, Shatin, Hong Kong, Peoples R China.
[Ming, Zhong] Shenzhen Univ, Sch Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Hao, Jianye] Shenzhen Univ, Shenzhen, Peoples R China.
通讯作者地址: Hao, JY (通讯作者),MIT, Comp Sci & Artificial Intelligence Lab, 32-G716, Cambridge, MA 02139 USA.
电子邮件地址: jianye@mit.edu; lhf@cuhk.edu.hk; mingz@szu.edu.cn.ng
第 82 条，共 274 条
标题: High-throughput DNA sequence data compression
作者: Zhu, ZX (Zhu, Zexuan); Zhang, YP (Zhang, Yongpeng); Ji, Z (Ji, Zhen); He, S (He, Shan); Yang, X (Yang, Xiao)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 3
摘要: The exponential growth of high-throughput DNA sequence data has posed great challenges to genomic data storage,
retrieval and transmission. Compression is a critical tool to address these challenges, where many methods have been
developed to reduce the storage size of the genomes and sequencing data (reads, quality scores and metadata). However,
genomic data are being generated faster than they could be meaningfully analyzed, leaving a large scope for developing
novel compression algorithms that could directly facilitate data analysis beyond data transfer and storage. In this article, we
categorize and provide a comprehensive review of the existing compression methods specialized for genomic data and
present experimental results on compression ratio, memory usage, time for compression and decompression. We further
present the remaining challenges and potential directions for future research.
地址: [Zhu, Zexuan; Ji, Zhen] Shenzhen Univ, Colloge Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Zhang, Yongpeng] Shenzhen Univ, Shenzhen, Peoples R China.
[He, Shan] Univ Birmingham, Sch Comp Sci, Birmingham B15 2TT, W Midlands, England.
[Yang, Xiao] Broad Inst, Cambridge, MA 02142 USA.
通讯作者地址: Yang, X (通讯作者),Broad Inst, 7 Cambridge Ctr, Cambridge, MA 02142 USA.
电子邮件地址: xiaoyang@broadinstitute.org
第 83 条，共 274 条
标题: Overcoming the Challenge of Variety: Big Data Abstraction, the Next Evolution of Data Management for AAL
Communication Systems
作者: Mao, R (Mao, Rui); Xu, HL (Xu, Honglong); Wu, WB (Wu, Wenbo); Li, JQ (Li, Jianqiang); Li, Y (Li, Yan); Lu,
MH (Lu, Minhua)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 2
摘要: With the extensive use of information technology in AAL communication systems, a data management model has
recently embodied the 3-V characteristics of big data: volume, velocity, and variety. A lot of work has been done on volume
and velocity, but not as much has been reported on variety. To handle the variety of data, universal solutions with
acceptable performance are usually much more cost effective than customized solutions. To achieve universality, a basic
idea is to first define a universal abstraction that covers a wide range of data types, and then build a universal system for
universal abstraction. Traditional database management systems commonly use a multidimensional data type, or feature
vectors, as a universal abstraction. However, many new data types in AAL systems cannot be abstracted into
multidimensional space. To find a more universal data abstraction and build more universal systems, we propose the
concept of big data abstraction, with metric space as a universal abstraction for AAL data types. Furthermore, to
demonstrate how metric-space data abstraction works, we survey the state of the art in metric space indexing, a fundamental
task in data management. Finally, open research issues are discussed.
地址: [Mao, Rui] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Xu, Honglong; Li, Yan] Shenzhen Univ, Shenzhen, Peoples R China.
[Lu, Minhua] Shenzhen Univ, Dept Biomed Engn, Shenzhen, Peoples R China.
[Wu, Wenbo] Univ Georgia, Athens, GA 30602 USA.
[Li, Jianqiang] Beijing Inst Technol, Beijing, Peoples R China.
通讯作者地址: Lu, MH (通讯作者),Shenzhen Univ, Dept Biomed Engn, Shenzhen, Peoples R China.
第 84 条，共 274 条
标题: Enabling Device-to-Device Communications in Millimeter-Wave 5G Cellular Networks
作者: Qiao, J (Qiao, Jian); Shen, XM (Shen, Xuemin (Sherman)); Mark, JW (Mark, Jon W.); Shen, QH (Shen, Qinghua);
He, YJ (He, Yejun); Lei, L (Lei, Lei)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Millimeter-wave communication is a promising technology for future 5G cellular networks to provide very high data
rate (multi-gigabits-per-second) for mobile devices. Enabling D2D communications over directional mmWave networks is
of critical importance to efficiently use the large bandwidth to increase network capacity. In this article, the propagation
features of mmWave communication and the associated impacts on 5G cellular networks are discussed. We introduce an
mmWave+4G system architecture with TDMA-based MAC structure as a candidate for 5G cellular networks. We propose
an effective resource sharing scheme by allowing non-interfering D2D links to operate concurrently. We also discuss
neighbor discovery for frequent handoffs in 5G cellular networks.
地址: [Qiao, Jian; Shen, Xuemin (Sherman); Mark, Jon W.; Shen, Qinghua] Univ Waterloo, Dept Elect & Comp Engn,
Waterloo, ON N2L 3G1, Canada.
[He, Yejun] Shenzhen Univ, Shenzhen, Peoples R China.
[Lei, Lei] Beijing Jiaotong Univ, State Key Lab Rail Traff Control & Safety, Beijing, Peoples R China.
通讯作者地址: Qiao, J (通讯作者),Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada.
电子邮件地址: qiaojian1@gmail.com
第 85 条，共 274 条
标题: Robust video identification approach based on local non-negative matrix factorization
作者: Lu, ZM (Lu, Zhe-Ming); Li, B (Li, Bo); Ji, QG (Ji, Qing-Ge); Tan, ZF (Tan, Zhi-Feng); Zhang, Y (Zhang, Yong)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: With the popularization of media-capture devices and the development of the Internet's basic facilities, video has
become the most popular media information in recent years. The massive capacity of video imposes the demand of
automatic video identification techniques which are very important to various applications such as content based video
retrieval and copy detection. Therefore, as a challenging problem, video identification has drawn more and more attention in
the past decade. The problem addressed here is to identify a given video clip in a given set of video sequences. In this paper,
a robust video identification algorithm based on local non-negative matrix factorization (LNMF) is presented. First, some
concepts about LNMF are described and the way of finding the factorized matrix is given. Then, its convergence is proven.
In addition, a LNMF based shot detection method is proposed for constructing a video identification framework completely
based on LNMF. Finally, a LNMF based identification approach using Hausdorff distance is introduced and a two-stage
search process is proposed. Experimental results show the robustness of the proposed approach to many kinds of
content-preserved distortions and its superiority to other algorithms. (C) 2014 Elsevier GmbH. All rights reserved.
地址: [Lu, Zhe-Ming; Li, Bo] Zhejiang Univ, Sch Aeronaut & Astronaut, Hangzhou 310027, Zhejiang, Peoples R China.
[Ji, Qing-Ge; Tan, Zhi-Feng] Sun Yat Sen Univ, Sch Informat Sci & Technol, Guangzhou 510006, Guangdong, Peoples R
China.
[Zhang, Yong] Shenzhen Univ, Coll Informat Engn, ATR Natl Def Technol Key Lab, Shenzhen 518060, Peoples R China.
通讯作者地址: Ji, QG (通讯作者),Sun Yat Sen Univ, Sch Informat Sci & Technol, Guangzhou 510006, Guangdong,
Peoples R China.
电子邮件地址: issjqg@mail.sysu.edu.cn
第 86 条，共 274 条
标题: Perception-based audio watermarking scheme in the compressed bitstream
作者: Lei, BY (Lei, Baiying); Soon, IY (Soon, Ing Yann)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In this paper, a new perception-based watermarking scheme for MPEG-4 scalable to lossless (SLS) audio is
proposed. Under the control of the psychoacoustic model, the significant part of integer modified discrete cosine transform
(IntMDCT) coefficients are adaptively modified during MPEG-4 SLS audio compression taking robustness,
imperceptibility and security into consideration. The chaotic watermark generated by chaos is simply embedded to ensure
security. Moreover, the adaptive spread spectrum method is exploited to further tradeoff robustness and transparency of this
scheme. Extensive experimental results confirm that the proposed scheme is robust against common signal processing
attacks while the inaudibility of the scheme is preserved. (C) 2014 Elsevier GmbH. All rights reserved.
地址: [Lei, Baiying] Shenzhen Univ, Sch Med, Dept Biomed Engn, Natl Reg Key Technol Engn Lab Med
Ultrasound,Guan, Shenzhen 518060, Peoples R China.
[Soon, Ing Yann] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore.
通讯作者地址: Lei, BY (通讯作者),Shenzhen Univ, Sch Med, Dept Biomed Engn, Natl Reg Key Technol Engn Lab Med
Ultrasound,Guan, Shenzhen 518060, Peoples R China.
电子邮件地址: leiby@szu.edu.cn
第 87 条，共 274 条
标题: Bearings-only maneuvering target tracking based on truncated quadrature Kalman filtering
作者: Li, LQ (Li Liang-qun); Xie, WX (Xie Wei-xin); Liu, ZX (Liu Zong-xiang)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: In this paper, a novel bearings-only maneuvering target tracking algorithm based on truncated quadrature Kalman
filtering (TQKF) is proposed. In the proposed method, when the target maneuvers, in order to reduce the effect on
performance duo to the increasing variance of the prior distribution, a modified prior distribution based on the current
measurement is proposed. In the update step, the first two moments of the modified prior distribution is approximately
estimated based on the least square estimation method and Gauss-Hermite quadrature rule, and the posterior distribution is
jointly updated by using the prior distribution and the modified prior distribution. Moreover, in order to adaptively choose
the estimated results obtained by the prior PDF and the truncated prior PDF, a fuzzy logic approach in which a Gaussian
membership function is employed is proposed to determine the weight a. Finally, the experiment results show that the
proposed algorithm results in more accurate tracking than the existing one, namely, the unscented Kalman filter (UKF), the
quadrature Kalman filter (QKF), interact multiple model extended Kalman filter (IMMEKF) and multiple model
Rao-Blackwellized particle filter (MMRBPF). (C) 2014 Elsevier GmbH. All rights reserved.
地址: [Li Liang-qun; Xie Wei-xin; Liu Zong-xiang] Shenzhen Univ, ATR Key Lab, Shenzhen 518060, Peoples R China.
通讯作者地址: Li, LQ (通讯作者),Shenzhen Univ, ATR Key Lab, Shenzhen 518060, Peoples R China.
电子邮件地址: lqli@szu.edu.cn
第 88 条，共 274 条
标题: Adaptive Bayesian personalized ranking for heterogeneous implicit feedbacks
作者: Pan, WK (Pan, Weike); Zhong, H (Zhong, Hao); Xu, CF (Xu, Congfu); Ming, Z (Ming, Zhong)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Implicit feedbacks have recently received much attention in recommendation communities due to their close
relationship with real industry problem settings. However, most works only exploit users' homogeneous implicit feedbacks
such as users' transaction records from "bought" activities, and ignore the other type of implicit feedbacks like examination
records from "browsed" activities. The latter are usually more abundant though they are associated with high uncertainty
w.r.t. users' true preferences. In this paper, we study a new recommendation problem called heterogeneous implicit
feedbacks (HIF), where the fundamental challenge is the uncertainty of the examination records. As a response, we design a
novel preference learning algorithm to learn a confidence for each uncertain examination record with the help of transaction
records. Specifically, we generalize Bayesian personalized ranking (BPR), a seminal pairwise learning algorithm for
homogeneous implicit feedbacks, and learn the confidence adaptively, which is thus called adaptive Bayesian personalized
ranking (ABPR). ABPR has the merits of uncertainty reduction on examination records and accurate pairwise preference
learning on implicit feedbacks. Experimental results on two public data sets show that ABPR is able to leverage uncertain
examination records effectively, and can achieve better recommendation performance than the state-of-the-art algorithm on
various ranking-oriented evaluation metrics. (C) 2014 Elsevier B.V. All rights reserved.
地址: [Pan, Weike; Ming, Zhong] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Zhong, Hao; Xu, Congfu] Zhejiang Univ, Coll Comp Sci, Inst Artificial Intelligence, Hangzhou, Zhejiang, Peoples R
China.
通讯作者地址: Xu, CF (通讯作者),Zhejiang Univ, Coll Comp Sci, Inst Artificial Intelligence, Hangzhou, Zhejiang,
Peoples R China.
电子邮件地址: panweike@szu.edu.cn; haozhong@zju.edu.cn; xucongfu@zju.edu.cn; mingz@szu.edu.cn
第 89 条，共 274 条
标题: A game theoretic approach to balancing energy consumption in heterogeneous wireless sensor networks
作者: Lin, XH (Lin, Xiao-Hui); Kwok, YK (Kwok, Yu-Kwong); Wang, H (Wang, Hui); Xie, N (Xie, Ning)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: Energy balancing is an effective technique in enhancing the lifetime of a wireless sensor network (WSN).
Specifically, balancing the energy consumption among sensors can prevent losing some critical sensors prematurely due to
energy exhaustion so that the WSN's coverage can be maintained. However, the heterogeneous hostile operating
conditionsdifferent transmission distances, varying fading environments, and distinct residual energy levelshave made
energy balancing a highly challenging task. A key issue in energy balancing is to maintain a certain level of energy fairness
in the whole WSN. To achieve energy fairness, the transmission load should be allocated among sensors such that,
regardless of a sensor's working conditions, no sensor node should be unfairly overburdened. In this paper, we model the
transmission load assignment in WSN as a game. With our novel utility function that can capture realistic sensors'
behaviors, we have derived the Nash equilibrium (NE) of the energy balancing game. Most importantly, under the NE,
while each sensor can maximize its own payoff, the global objective of energy balancing can also be achieved. Moreover,
by incorporating a penalty mechanism, the delivery rate and delay constraints imposed by the WSN application can be
satisfied. Through extensive simulations, our game theoretic approach is shown to be effective in that adequate energy
balancing is achieved and, consequently, network lifetime is significantly enhanced. Copyright (c) 2012 John Wiley &
Sons, Ltd.
地址: [Lin, Xiao-Hui; Wang, Hui; Xie, Ning] Shenzhen Univ, Dept Commun Engn, Shenzhen, Guangdong, Peoples R
China.
[Lin, Xiao-Hui] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100088,
Peoples R China.
[Kwok, Yu-Kwong] Univ Hong Kong, Dept Elect & Elect Engn, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Lin, XH (通讯作者),Shenzhen Univ, Dept Commun Engn, Shenzhen, Guangdong, Peoples R China.
电子邮件地址: xhlin@szu.edu.cn
第 90 条，共 274 条
标题: A MapReduce based parallel SVM for large-scale predicting protein-protein interactions
作者: You, ZH (You, Zhu-Hong); Yu, JZ (Yu, Jian-Zhong); Zhu, L (Zhu, Lin); Li, S (Li, Shuai); Wen, ZK (Wen,
Zhen-Kun)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: Protein-protein interactions (PPIs) are crucial to most biochemical processes, including metabolic cycles, DNA
transcription and replication, and signaling cascades. Although large amount of protein-protein interaction data for different
species has been generated by high-throughput experimental techniques, the number is still limited compared to the total
number of possible PPIs. Furthermore, the experimental methods for identifying PPIs are both time-consuming and
expensive. Therefore, it is urgent and challenging to develop automated computational methods to efficiently and accurately
predict PPIs. In this article, we propose a novel MapReduce-based parallel SVM model for large-scale predicting
protein-protein interactions only using the information of protein sequences. First, the local sequential features represented
by autocorrelation descriptor are extracted from protein sequences. Then the MapReduce framework is employed to train
support vector machine (SVM) classifiers in a distributed way, obtaining significant improvement in training time while
maintaining a high level of accuracy. The experimental results demonstrate that the proposed parallel algorithms not only
can tackle large-scale PPIs dataset, but also perform well in terms of the evaluation metrics of speedup and accuracy.
Consequently, the proposed approach can be considered as a new promising and powerful tools for large-scale predicting
PPI with excellent performance and less time. (C) 2014 Elsevier B.V. All rights reserved.
地址: [You, Zhu-Hong; Yu, Jian-Zhong; Wen, Zhen-Kun] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen
518060, Guangdong, Peoples R China.
[Zhu, Lin] Tongji Univ, Sch Elect & Informat Engn, Shanghai 201804, Peoples R China.
[Li, Shuai] Hong Kong Polytech Univ, Dept Comp, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Li, S (通讯作者),Hong Kong Polytech Univ, Dept Comp, Hong Kong, Hong Kong, Peoples R China.
电子邮件地址: zhyou@szu.edu.cn; shuaili@polyu.edu.hk
第 91 条，共 274 条
标题: Prediction of protein-protein interactions from amino acid sequences using a novel multi-scale continuous and
discontinuous feature set
作者: You, ZH (You, Zhu-Hong); Zhu, L (Zhu, Lin); Zheng, CH (Zheng, Chun-Hou); Yu, HJ (Yu, Hong-Jie); Deng, SP
(Deng, Su-Ping); Ji, Z (Ji, Zhen)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Background: Identifying protein-protein interactions (PPIs) is essential for elucidating protein functions and
understanding the molecular mechanisms inside the cell. However, the experimental methods for detecting PPIs are both
time-consuming and expensive. Therefore, computational prediction of protein interactions are becoming increasingly
popular, which can provide an inexpensive way of predicting the most likely set of interactions at the entire proteome scale,
and can be used to complement experimental approaches. Although much progress has already been achieved in this
direction, the problem is still far from being solved and new approaches are still required to overcome the limitations of the
current prediction models.
Results: In this work, a sequence-based approach is developed by combining a novel Multi-scale Continuous and
Discontinuous (MCD) feature representation and Support Vector Machine (SVM). The MCD representation gives adequate
consideration to the interactions between sequentially distant but spatially close amino acid residues, thus it can sufficiently
capture multiple overlapping continuous and discontinuous binding patterns within a protein sequence. An effective feature
selection method mRMR was employed to construct an optimized and more discriminative feature set by excluding
redundant features. Finally, a prediction model is trained and tested based on SVM algorithm to predict the interaction
probability of protein pairs.
Conclusions: When performed on the yeast PPIs data set, the proposed approach achieved 91.36% prediction accuracy with
91.94% precision at the sensitivity of 90.67%. Extensive experiments are conducted to compare our method with the
existing sequence-based method. Experimental results show that the performance of our predictor is better than several
other state-of-the-art predictors, whose average prediction accuracy is 84.91%, sensitivity is 83.24%, and precision is
86.12%. Achieved results show that the proposed approach is very promising for predicting PPI, so it can be a useful
supplementary tool for future proteomics studies. The source code and the datasets are freely available at
http:/?csse.szu.edu.cn?staff?youzh?MCDPPI.zip for academic use.
地址: [You, Zhu-Hong; Ji, Zhen] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Guangdong,
Peoples R China.
[Zhu, Lin; Deng, Su-Ping] Tongji Univ, Dept Comp Sci & Technol, Shanghai 201804, Peoples R China.
[Zheng, Chun-Hou] Anhui Univ, Coll Elect Engn & Automat, Hefei 230601, Anhui, Peoples R China.
[Yu, Hong-Jie] Anhui Sci & Technol Univ, Sch Sci, Dept Math, Fengyang 233100, Anhui, Peoples R China.
通讯作者地址: Ji, Z (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Guangdong, Peoples
R China.
电子邮件地址: jizhen@szu.edu.cn
第 92 条，共 274 条
标题: Compression of next-generation sequencing quality scores using memetic algorithm
作者: Zhou, JR (Zhou, Jiarui); Ji, Z (Ji, Zhen); Zhu, ZX (Zhu, Zexuan); He, S (He, Shan)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: Background: The exponential growth of next-generation sequencing (NGS) derived DNA data poses great challenges
to data storage and transmission. Although many compression algorithms have been proposed for DNA reads in NGS data,
few methods are designed specifically to handle the quality scores.
Results: In this paper we present a memetic algorithm (MA) based NGS quality score data compressor, namely MMQSC.
The algorithm extracts raw quality score sequences from FASTQ formatted files, and designs compression codebook using
MA based multimodal optimization. The input data is then compressed in a substitutional manner. Experimental results on
five representative NGS data sets show that MMQSC obtains higher compression ratio than the other state-of-the-art
methods. Particularly, MMQSC is a lossless reference-free compression algorithm, yet obtains an average compression ratio
of 22.82% on the experimental data sets.
Conclusions: The proposed MMQSC compresses NGS quality score data effectively. It can be utilized to improve the
overall compression ratio on FASTQ formatted files.
地址: [Zhou, Jiarui] Zhejiang Univ, Coll Biomed Engn & Instrument Sci, Hangzhou 310027, Zhejiang, Peoples R China.
[Zhou, Jiarui; Ji, Zhen; Zhu, Zexuan] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen City Key Lab Embedded
Syst Design, Shenzhen 518060, Peoples R China.
[He, Shan] Univ Birmingham, Sch Comp Sci, Birmingham B15 2TT, W Midlands, England.
通讯作者地址: Ji, Z (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen City Key Lab Embedded
Syst Design, Shenzhen 518060, Peoples R China.
电子邮件地址: jizhen@szu.edu.cn
第 93 条，共 274 条
标题: NETWORK CONVERGENCE: THEORY, ARCHITECTURES, AND APPLICATIONS
作者: Zhang, QT (Zhang, Q. T.); Chen, JY (Chen, Jiayi); Zhu, HB (Zhu, Hongbo)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: With ever increasing demand for highly correlated video services in wireless networks, network information sources
often carry vast redundancy in information contents, as exemplified by popular multimedia contents requested online by a
large number of mobile users. The consequence is the waste of two precious resources - spectrum and energy. A good
strategy is network convergence whereby commonly requested contents are transmitted via broadcast channels while
personal contents are unicast by cellular networks. This article studies crucial issues arising from network convergence
including its information-theoretic foundation, architectures, and feasible schemes for various application scenarios.
地址: [Zhang, Q. T.; Zhu, Hongbo] Nanjing Univ Posts & Telecommun, Nanjing, Jiangsu, Peoples R China.
[Chen, Jiayi] Shenzhen Univ, Shenzhen, Peoples R China.
通讯作者地址: Zhang, QT (通讯作者),Nanjing Univ Posts & Telecommun, Nanjing, Jiangsu, Peoples R China.
电子邮件地址: zhangqt@njupt.edu.cn; I.C.Jiayi@ieee.org; zhuhb@njupt.edu.cn
第 94 条，共 274 条
标题: LoyalTracker: Visualizing Loyalty Dynamics in Search Engines
作者: Shi, CL (Shi, Conglei); Wu, YC (Wu, Yingcai); Liu, SX (Liu, Shixia); Zhou, H (Zhou, Hong); Qu, HM (Qu,
Huamin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: The huge amount of user log data collected by search engine providers creates new opportunities to understand user
loyalty and defection behavior at an unprecedented scale. However, this also poses a great challenge to analyze the behavior
and glean insights into the complex, large data. In this paper, we introduce LoyalTracker, a visual analytics system to track
user loyalty and switching behavior towards multiple search engines from the vast amount of user log data. We propose a
new interactive visualization technique (flow view) based on a flow metaphor, which conveys a proper visual summary of
the dynamics of user loyalty of thousands of users over time. Two other visualization techniques, a density map and a word
cloud, are integrated to enable analysts to gain further insights into the patterns identified by the flow view. Case studies and
the interview with domain experts are conducted to demonstrate the usefulness of our technique in understanding user
loyalty and switching behavior in search engines.
地址: [Shi, Conglei; Qu, Huamin] Hong Kong Univ Sci & Technol, Hong Kong, Hong Kong, Peoples R China.
[Wu, Yingcai; Liu, Shixia] Microsoft Res Asia, Beijing, Peoples R China.
[Zhou, Hong] Shenzhen Univ, Shenzhen, Peoples R China.
通讯作者地址: Liu, SX (通讯作者),Microsoft Res Asia, Beijing, Peoples R China.
电子邮件地址: clshi@cse.ust.hk; yingcai.wu@microsoft.com; shixia.liu@microsoft.com; hzhou@szu.edu.cn;
huamin@cse.ust.hk
第 95 条，共 274 条
标题: Analytical QoE Models for Bit-Rate Switching in Dynamic Adaptive Streaming Systems
作者: Xu, YD (Xu, Yuedong); Zhou, YP (Zhou, Yipeng); Chiu, DM (Chiu, Dah-Ming)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Video streaming service in wireless networks is increasingly using dynamic selection of video bit-rates to provide a
high quality of user experience (QoE). The bit-rate switching mechanism, performed at client side, plays a key role in
determining QoE metrics. In this paper, we present the first analytical framework to compute starvation probability of
playout buffer, continuous playback time and mean video quality, given the bit-rate switching logics. Wireless channel is
modeled as a continuous time Markov process, and playout buffer is modeled as a fluid queue with Markov modulated fluid
arrival. We construct a set of ordinary differential equations (ODEs) to characterize the dynamics of starvation probability
and expected continuous playback time with regard to buffer length, and simple models to analyze mean bit-rate for
different bit-rate switching algorithms. Our framework is very general in that by adding appropriate parameters, it can be
utilized to predict the QoE metrics of dynamic adaptive streaming with a variety of features: i) buffer-aware bit-rate
switching ii) (im) patience of the user, and iii) receiver-side flow control.
地址: [Xu, Yuedong] Fudan Univ, Sch Informat Sci & Technol, Shanghai 200433, Peoples R China.
[Zhou, Yipeng] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Chiu, Dah-Ming] Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Xu, YD (通讯作者),Fudan Univ, Sch Informat Sci & Technol, Shanghai 200433, Peoples R China.
电子邮件地址: ydxu@fudan.edu.cn; ypzhou@szu.edu.cn; dmchiu@ie.cuhk.edu.hk
第 96 条，共 274 条
标题: The BeiHang Keystroke Dynamics Systems, Databases and baselines
作者: Liu, J (Liu, Juan); Zhang, BC (Zhang, Baochang); Zeng, HR (Zeng, Haoran); Shen, LL (Shen, Linlin); Liu, JZ (Liu,
Jianzhuang); Zhao, J (Zhao, Jason)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Keystroke dynamics is an important biometric branch for person authentication. Based upon keystroke dynamics, this
paper designs an embedded password protection device, develops an online system, collects two public databases for
promoting the research on keystroke authentication, exploits transformation methods to characterize keystroke dynamics,
and provides benchmark results of several popular classification algorithms, one-class support vector machine, Gaussian
classifier, and nearest neighbor classifier. (C) 2014 Elsevier B.V. All rights reserved.
地址: [Liu, Juan; Zeng, Haoran] Beihang Univ, Sci & Technol Aircraft Control Lab, Beijing 100191, Peoples R China.
[Zhang, Baochang] Beihang Univ, Sci & Technol Aircraft Control Lab, Sch Automat Sci & Elect Engn, Beijing 100191,
Peoples R China.
[Shen, Linlin] Shenzhen Univ, Sch Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Shen, Linlin; Liu, Jianzhuang] Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Hong Kong, Peoples R China.
[Zhao, Jason] Microdone Network Technol Co Ltd, Beijing, Peoples R China.
[Zhang, Baochang] IIT, Pattern Anal & Comp Vis PAVIS, I-16163 Genoa, Italy.
通讯作者地址: Zhang, BC (通讯作者),Beihang Univ, Sci & Technol Aircraft Control Lab, Sch Automat Sci & Elect Engn,
Beijing 100191, Peoples R China.
电子邮件地址: bczhang@buaa.edu.cn
第 97 条，共 274 条
标题: MODLoc: Localizing Multiple Objects in Dynamic Indoor Environment
作者: Guo, XN (Guo, Xiaonan); Zhang, D (Zhang, Dian); Wu, KS (Wu, Kaishun); Ni, LM (Ni, Lionel M.)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Radio frequency (RF) based technologies play an important role in indoor localization, since Radio Signal Strength
(RSS) can be easily measured by various wireless devices without additional cost. Among these, radio map based
technologies (also referred as fingerprinting technologies) are attractive due to high accuracy and easy deployment.
However, these technologies have not been extensively applied on real environment for two fatal limitations. First, it is hard
to localize multiple objects. When the number of target objects is unknown, constructing a radio map of multiple objects is
almost impossible. Second, environment changes will generate different multipath signals and severely disturb the RSS
measurement, making laborious retraining inevitable. Motivated by these, in this paper, we propose a novel approach, called
Line-of-sight radio map matching, which only reserves the LOS signal among nodes. It leverages frequency diversity to
eliminate the multipath behavior, making RSS more reliable than before. We implement our system MODLoc based on
TelosB sensor nodes and commercial 802.11 NICs with Channel State Information (CSI) as well. Through extensive
experiments, it shows that the accuracy does not decrease when localizing multiple targets in a dynamic environment. Our
work outperforms the traditional methods by about 60 percent. More importantly, no calibration is required in such
environment. Furthermore, our approach presents attractive flexibility, making it more appropriate for general RF-based
localization studies than just the radio map based localization.
地址: [Zhang, Dian; Wu, Kaishun] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Wu, Kaishun] Guangzhou HKUST Fok Ying Tung Res Inst, Guangzhou, Guangdong, Peoples R China.
[Guo, Xiaonan; Ni, Lionel M.] HKUST, Dept Comp Sci & Engn, Hong Kong, Hong Kong, Peoples R China.
[Guo, Xiaonan] Singapore Management Univ, Sch Informat Syst, Singapore, Singapore.
通讯作者地址: Zhang, D (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
电子邮件地址: xnguo@smu.edu.sg; kwinson@ust.hk
第 98 条，共 274 条
标题: Robust Object Tracking with Reacquisition Ability using Online Learned Detector
作者: Yang, TY (Yang, Tianyu); Li, BP (Li, Baopu); Meng, MQH (Meng, Max Q. -H.)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Long term tracking is a challenging task for many applications. In this paper, we propose a novel tracking approach
that can adapt various appearance changes such as illumination, motion, and occlusions, and owns the ability of robust
reacquisition after drifting. We utilize a condensation-based method with an online support vector machine as a reliable
observation model to realize adaptive tracking. To redetect the target when drifting, a cascade detector based on random
ferns is proposed. It can detect the target robustly in real time. After redetection, we also come up with a new refinement
strategy to improve the tracker's performance by removing the support vectors corresponding to possible wrong updates by
a matching template. Extensive comparison experiments on typical and challenging benchmark dataset illustrate a robust
and encouraging performance of the proposed approach.
地址: [Yang, Tianyu; Li, Baopu] Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China.
[Li, Baopu] Shenzhen Univ, Shenzhen, Peoples R China.
[Meng, Max Q. -H.] Chinese Univ Hong Kong, Dept Elect Engn, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Li, BP (通讯作者),Shenzhen Univ, Shenzhen, Peoples R China.
电子邮件地址: bpli@ee.cuhk.edu.hk
第 99 条，共 274 条
标题: Multi-granularity distance metric learning via neighborhood granule margin maximization
作者: Zhu, PF (Zhu, Pengfei); Hu, QH (Hu, Qinghua); Zuo, WM (Zuo, Wangmeng); Yang, M (Yang, Meng)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Learning a distance metric from training samples is often a crucial step in machine learning and pattern recognition.
Locality, compactness and consistency are considered as the key principles in distance metric learning. However, the
existing metric learning methods just consider one or two of them. In this paper, we develop a multi-granularity distance
learning technique. First, a new index, neighborhood granule margin, which simultaneously considers locality, compactness
and consistency of neighborhood, is introduced to evaluate a distance metric. By maximizing neighborhood granule margin,
we formulate the distance metric learning problem as a sample pair classification problem, which can be solved by standard
support vector machine solvers. Then a set of distance metrics are learned in different granular spaces. The weights of the
granular spaces are learned through optimizing the margin distribution. Finally, the decisions from different granular spaces
are combined with weighted voting. Experiments on UCI datasets, gender classification and object categorization tasks
show that the proposed method is superior to the state-of-the-art distance metric learning algorithms. (C) 2014 Elsevier Inc.
All rights reserved.
地址: [Zhu, Pengfei; Hu, Qinghua] Tianjin Univ, Sch Comp Sci & Technol, Tianjin 300073, Peoples R China.
[Zhu, Pengfei] Hong Kong Polytech Univ, Dept Comp, Hong Kong, Hong Kong, Peoples R China.
[Zuo, Wangmeng] Harbin Inst Technol, Sch Comp Sci & Technol, Harbin 150001, Peoples R China.
[Yang, Meng] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518000, Peoples R China.
通讯作者地址: Hu, QH (通讯作者),Tianjin Univ, Sch Comp Sci & Technol, Tianjin 300073, Peoples R China.
电子邮件地址: huqinghua@tju.edu.cn
第 100 条，共 274 条
标题: GA-SIFT: A new scale invariant feature transform for multispectral image using geometric algebra
作者: Li, YS (Li, Yanshan); Liu, WM (Liu, Weiming); Li, XT (Li, Xiaotang); Huang, QH (Huang, Qinghua); Li, XL (Li,
Xuelong)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 2
摘要: Feature analysis plays an important role in many multispectral image applications and scale invariant feature
transform (SIFT) has been successfully applied for extraction of image features. However, the existing SIFT algorithms
cannot extract features from multispectral images directly. This paper puts forward a novel algorithmic framework based on
the SIFT for multispectral images. Firstly, with the theory of the geometric algebra (GA), a new representation of
multispectral image including spatial and spectral information is put forward and discussed. Secondly, a new method for
obtaining the scale space of the multispectral image is proposed. Thirdly, following the procedures of the SIFT, the GA
based difference of Gaussian images are computed and the keypoints can be detected in the GA space. Fourthly, the feature
points are finally detected and described in the mathematical framework of the GA. Finally, the comparison results show
that the GA-SIFT outperforms some previously reported SIFT algorithms in the feature extraction from a multispectral
image, and it is comparable with its counterparts in the feature extraction of color images, indicating good performance in
various applications of image analysis. (C) 2013 Elsevier Inc. All rights reserved.
地址: [Li, Yanshan] Shenzhen Univ, Shenzhen 518060, Peoples R China.
[Liu, Weiming] S China Univ Technol, Sch Civil Engn & Transportat, Guangzhou 510640, Guangdong, Peoples R China.
[Li, Xiaotang] Harbin Univ Commerce, Harbin, Peoples R China.
[Huang, Qinghua] S China Univ Technol, Sch Elect & Informat Engn, Guangzhou 510640, Guangdong, Peoples R China.
[Li, Xuelong] Chinese Acad Sci, Xian Inst Opt & Precis Mech, State Key Lab Transient Opt & Photon, Ctr OPT IMagery
Anal & Learning OPTIMAL, Xian 710119, Shaanxi, Peoples R China.
通讯作者地址: Huang, QH (通讯作者),S China Univ Technol, Sch Elect & Informat Engn, Guangzhou 510640,
Guangdong, Peoples R China.
电子邮件地址: qhhuang@scut.edu.cn
第 101 条，共 274 条
标题: Period distribution of generalized discrete Arnold cat map
作者: Chen, F (Chen, Fei); Wong, KW (Wong, Kwok-wo); Liao, XF (Liao, Xiaofeng); Xiang, T (Xiang, Tao)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: The generalized discrete Arnold cat map is adopted in various cryptographic and steganographic applications where
chaos is employed. In this paper, we analyze the period distribution of this map. A systematic approach for addressing the
general period distribution problem for any integer value of the modulus N is outlined, followed by a complete analysis for
the case of prime N. The analysis is based on similar techniques studying linear feedback shift register (LFSR) sequences.
Together with our previous results when N is a power of a prime [1,2], the period distribution of the cat map is
characterized nearly completely for any integer N. Our results are also useful for evaluating the security of the
cryptographic and steganographic algorithms based on the cat map as well as computing all unstable periodic orbits of the
chaotic Arnold cat map. (C) 2014 Elsevier B.V. All rights reserved.
地址: [Chen, Fei] Shenzhen Univ, Dept Comp Sci & Technol, Shenzhen, Peoples R China.
[Chen, Fei] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Hong Kong, Hong Kong, Peoples R China.
[Wong, Kwok-wo] City Univ Hong Kong, Dept Elect Engn, Hong Kong, Hong Kong, Peoples R China.
[Liao, Xiaofeng] Southwest Univ, Sch Elect & Informat Engn, Chongqing, Peoples R China.
[Liao, Xiaofeng; Xiang, Tao] Chongqing Univ, Coll Comp Sci, Chongqing 400044, Peoples R China.
通讯作者地址: Chen, F (通讯作者),Shenzhen Univ, Dept Comp Sci & Technol, Shenzhen, Peoples R China.
电子邮件地址: feichenn@gmail.com; itkwwong@cityu.edu.hk; xfliao@cqu.edu.cn; txiang@cqu.edu.cn
第 102 条，共 274 条
标题: Content-based classification of breath sound with enhanced features
作者: Lei, BY (Lei, Baiying); Rahman, SA (Rahman, Shah Atiqur); Song, IS (Song, Insu)
Web of Science 核心合集中的 "被引频次": 6
被引频次合计: 6
摘要: Since breath sound (BS) contains important indicators of respiratory health and disease, analysis and detection of BS
has become an important topic, with diagnostic and assessment of treatment capabilities. In this paper, the identification and
classification of respiratory disorders based on the enhanced perceptual and cepstral feature set (PerCepD) is proposed. The
hybrid PerCepD feature can capture the time-frequency characteristics of BS very well. Thus, it is very effective for the
exploration and classification of normal and pathological BS related data. The classification models based on support vector
machine (SVM) and artificial neural network (ANN) have been adopted to achieve automatic detection from BS data. The
high detection accuracy results validate the performance of the proposed feature sets and classification model. The
experimental results also demonstrate that the high accuracy of the pathological BS data can provide reliable diagnostic
suggestions for breath disorders, such as flu, pneumonia and bronchitis. (C) 2014 Elsevier B.V. All rights reserved.
地址: [Lei, Baiying] Shenzhen Univ, Sch Med, Dept Biomed Engn,Guangdong Key Lab Biomed Measure, Natl Reg Key
Technol Engn Lab Med Ultrasound, Shenzhen 518060, Peoples R China.
[Lei, Baiying; Rahman, Shah Atiqur; Song, Insu] James Cook Univ Australia, Sch Business IT, Singapore, Singapore.
通讯作者地址: Lei, BY (通讯作者),Shenzhen Univ, Sch Med, Dept Biomed Engn,Guangdong Key Lab Biomed Measure,
Natl Reg Key Technol Engn Lab Med Ultrasound, Shenzhen 518060, Peoples R China.
电子邮件地址: leiby666@gmail.com; atiqur.rahman@jcu.edu.au; insu.song@jcu.edu.au
第 103 条，共 274 条
标题: Sparse Alignment for Robust Tensor Learning
作者: Lai, ZH (Lai, Zhihui); Wong, WK (Wong, Wai Keung); Xu, Y (Xu, Yong); Zhao, CR (Zhao, Cairong); Sun, MM
(Sun, Mingming)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Multilinear/tensor extensions of manifold learning based algorithms have been widely used in computer vision and
pattern recognition. This paper first provides a systematic analysis of the multilinear extensions for the most popular
methods by using alignment techniques, thereby obtaining a general tensor alignment framework. From this framework, it is
easy to show that the manifold learning based tensor learning methods are intrinsically different from the alignment
techniques. Based on the alignment framework, a robust tensor learning method called sparse tensor alignment (STA) is
then proposed for unsupervised tensor feature extraction. Different from the existing tensor learning methods, L-1- and
L-2-norms are introduced to enhance the robustness in the alignment step of the STA. The advantage of the proposed
technique is that the difficulty in selecting the size of the local neighborhood can be avoided in the manifold learning based
tensor feature extraction algorithms. Although STA is an unsupervised learning method, the sparsity encodes the
discriminative information in the alignment step and provides the robustness of STA. Extensive experiments on the
well-known image databases as well as action and hand gesture databases by encoding object images as tensors demonstrate
that the proposed STA algorithm gives the most competitive performance when compared with the tensor-based
unsupervised learning methods.
地址: [Lai, Zhihui; Xu, Yong] Harbin Inst Technol, Biocomp Res Ctr, Shenzhen Grad Sch, Shenzhen 518055, Peoples R
China.
[Lai, Zhihui] Shenzhen Univ, Shenzhen 518055, Peoples R China.
[Wong, Wai Keung] Hong Kong Polytech Univ, Inst Text & Clothing, Hong Kong, Hong Kong, Peoples R China.
[Wong, Wai Keung] Shenzhen Res Inst, Shenzhen 518055, Peoples R China.
[Zhao, Cairong] Tongji Univ, Dept Comp Sci & Technol, Shanghai 201804, Peoples R China.
[Sun, Mingming] Nanjing Univ Sci & Technol, Dept Comp Sci & Technol, Nanjing 210094, Jiangsu, Peoples R China.
通讯作者地址: Lai, ZH (通讯作者),Harbin Inst Technol, Biocomp Res Ctr, Shenzhen Grad Sch, Shenzhen 518055,
Peoples R China.
电子邮件地址: lai_zhi_hui@163.com; calvin.wong@polyu.edu.hk; yongxu@ymail.com; zhaocairong@126.com;
sunmingming@gmail.com
第 104 条，共 274 条
标题: Multilinear Sparse Principal Component Analysis
作者: Lai, ZH (Lai, Zhihui); Xu, Y (Xu, Yong); Chen, QC (Chen, Qingcai); Yang, J (Yang, Jian); Zhang, D (Zhang, David)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In this brief, multilinear sparse principal component analysis (MSPCA) is proposed for feature extraction from the
tensor data. MSPCA can be viewed as a further extension of the classical principal component analysis (PCA), sparse PCA
(SPCA) and the recently proposed multilinear PCA (MPCA). The key operation of MSPCA is to rewrite the MPCA into
multilinear regression forms and relax it for sparse regression. Differing from the recently proposed MPCA, MSPCA
inherits the sparsity from the SPCA and iteratively learns a series of sparse projections that capture most of the variation of
the tensor data. Each nonzero element in the sparse projections is selected from the most important variables/factors using
the elastic net. Extensive experiments on Yale, Face Recognition Technology face databases, and COIL-20 object database
encoded the object images as second-order tensors, and Weizmann action database as third-order tensors demonstrate that
the proposed MSPCA algorithm has the potential to outperform the existing PCA-based subspace learning algorithms.
地址: [Lai, Zhihui; Xu, Yong] Harbin Inst Technol, Shenzhen Grad Sch, Biocomp Res Ctr, Shenzhen 518055, Peoples R
China.
[Lai, Zhihui] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518055, Peoples R China.
[Xu, Yong; Chen, Qingcai] Harbin Inst Technol, Shenzhen Grad Sch, Key Lab Network Oriented Intelligent Comp,
Shenzhen 518055, Peoples R China.
[Yang, Jian] Nanjing Univ Sci & Technol, Nanjing 210094, Jiangsu, Peoples R China.
[Zhang, David] Hong Kong Polytech Univ, Dept Comp, Biometr Res Ctr, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Lai, ZH (通讯作者),Harbin Inst Technol, Shenzhen Grad Sch, Biocomp Res Ctr, Shenzhen 518055,
Peoples R China.
电子邮件地址: lai_zhi_hui@163.com; yongxu@ymail.com; qingcai.chen@hitsz.edu.cn; csjyang@njust.edu.cn;
csdzhang@comp.polyu.edu.hk
第 105 条，共 274 条
标题: Gradient-based subspace phase correlation for fast and effective image alignment
作者: Ren, JC (Ren, Jinchang); Vlachos, T (Vlachos, Theodore); Zhang, Y (Zhang, Yi); Zheng, JB (Zheng, Jiangbin);
Jiang, JM (Jiang, Jianmin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Phase correlation is a well-established frequency domain method to estimate rigid 2-D translational motion between
pairs of images. However, it suffers from interference terms such as noise and non-overlapped regions. In this paper, a
novel variant of the phase correlation approach is proposed, in which 2-D translation is estimated by projection-based
subspace phase correlation (SPC). Conventional wisdom has suggested that such an approach can only amount to a
compromise solution between accuracy and efficiency. In this work, however, we prove that the original SPC and the
further introduced gradient-based SPC can provide robust solution to zero-mean and non-zero-mean noise, and the latter is
also used to model the interference term of non-overlapped regions. Comprehensive results from synthetic data and MRI
images have fully validated our methodology. Due to its substantially lower computational complexity, the proposed
method offers additional advantages in terms of efficiency and can lend itself to very fast implementations for a wide range
of applications where speed is at a premium. (C) 2014 Elsevier Inc. All rights reserved.
地址: [Ren, Jinchang] Univ Strathclyde, Ctr Excellence Signal & Image Proc, Glasgow, Lanark, Scotland.
[Vlachos, Theodore] Ionian Univ, Dept Audiovisual Arts, Corfu, Greece.
[Zhang, Yi] Tianjin Univ, Sch Comp Software, Tianjin, Peoples R China.
[Zheng, Jiangbin] Northwestern Polytech Univ, Sch Comp Software & Microelect, Xian 710072, Peoples R China.
[Jiang, Jianmin] Shenzhen Univ, Sch Comp Sci & Software Engn, Shenzhen, Peoples R China.
通讯作者地址: Ren, JC (通讯作者),Univ Strathclyde, Ctr Excellence Signal & Image Proc, Glasgow, Lanark, Scotland.
电子邮件地址: Jinchang.Ren@strath.ac.uk; t.vlachos@ionio.gr; yizhang@tju.edu.cn; zhengjb@nwpu.edu.cn;
min.jiang@szu.edu.cn
第 106 条，共 274 条
标题: Consistent feature selection and its application to face recognition
作者: Pan, F (Pan, Feng); Song, GW (Song, Guangwei); Gan, XB (Gan, Xiaobing); Gu, QW (Gu, Qiwei)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In this paper we consider feature selection for face recognition using both labeled and unlabeled data. We introduce
the weighted feature space in which the global separability between different classes is maximized and the local similarity
of the neighboring data points is preserved. By integrating the global and local structures, a general optimization framework
is formulated. We propose a simple solution to this problem, avoiding the matrix eigen-decomposition procedure which is
often computationally expensive. Experimental results demonstrate the efficacy of our approach and confirm that utilizing
labeled and unlabeled data together does help feature selection with small number of labeled samples.
地址: [Pan, Feng; Song, Guangwei; Gan, Xiaobing; Gu, Qiwei] Shenzhen Univ, Coll Management, Shenzhen 518060,
Guangdong, Peoples R China.
通讯作者地址: Song, GW (通讯作者),Shenzhen Univ, Coll Management, Shenzhen 518060, Guangdong, Peoples R
China.
电子邮件地址: fpan@szu.edu.cn; felixp@foxmail.com
第 107 条，共 274 条
标题: Measuring the impact of MVC attack in large complex networks
作者: Li, RH (Li, Rong-Hua); Yu, JX (Yu, Jeffrey Xu); Huang, X (Huang, Xin); Cheng, H (Cheng, Hong); Shang, ZC
(Shang, Zechao)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: Measuring the impact of network attack is an important issue in network science. In this paper, we study the impact
of maximal vertex coverage (MVC) attack in large complex networks, where the attacker aims at deleting as many edges of
the network as possible by attacking a small fraction of nodes. First, we present two metrics to measure the impact of MVC
attack. To compute these metrics, we propose an efficient randomized greedy algorithm with near-optimal performance
guarantee. Second, we generalize the MVC attack into an uncertain setting, in which a node is deleted by the attacker with a
prior probability. We refer to the MVC attack under such uncertain environment as the probabilistic MVC attack Based on
the probabilistic MVC attack, we propose two adaptive metrics, and then present an adaptive greedy algorithm for
calculating such metrics accurately and efficiently. Finally, we conduct extensive experiments on 20 real datasets. The
results show that P2P and co-authorship networks are extremely robust under the MVC attack while both the online social
networks and the Email communication networks exhibit vulnerability under the MVC attack. In addition, the results
demonstrate the efficiency and effectiveness of the proposed algorithms for computing the proposed metrics. (C) 2014
Elsevier Inc. All rights reserved.
地址: [Li, Rong-Hua] Shenzhen Univ, Guangdong Prov Key Lab Popular High Performance C, Shenzhen, Peoples R
China.
[Li, Rong-Hua] E China Normal Univ, Shanghai, Peoples R China.
[Yu, Jeffrey Xu; Huang, Xin; Cheng, Hong; Shang, Zechao] Chinese Univ Hong Kong, Hong Kong, Hong Kong, Peoples R
China.
通讯作者地址: Li, RH (通讯作者),E China Normal Univ, Shanghai, Peoples R China.
电子邮件地址: lironghuascut@gmail.com
第 108 条，共 274 条
标题: Data Dissemination With Side Information and Feedback
作者: Dai, MJ (Dai, Mingjun); Shum, KW (Shum, Kenneth W.); Sung, CW (Sung, Chi Wan)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Index coding (IC), which can be regarded as a special class of network coding, deals with the problem of sending a
number of packets to a group of receivers, each of which requests one packet and may have some other packets in its cache.
This paper generalizes the IC problem in that both the packet requested by a receiver and the packets in its cache can be
linear combinations of the packets. To minimize the number of transmissions required, a heuristic algorithm based on the
idea of partitioning the users into coding groups is designed. To realize this idea, a polynomial time algorithm to determine
whether a set of users form a coding group over the binary field or a field with a size larger than the number of users is
constructed. For users that form a coding group, the corresponding encoding vector can be also found. A lower bound is
derived in order to evaluate the performance of the heuristic algorithm. Numerical results show that the number of
transmissions required by the heuristic algorithm and the lower bound both grow roughly linearly with the number of users,
and the heuristic algorithm outperforms some benchmark algorithms.
地址: [Dai, Mingjun] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
[Dai, Mingjun] Xidian Univ, State Key Lab Integrated Serv Networks, Xian, Peoples R China.
[Shum, Kenneth W.] Chinese Univ Hong Kong, Inst Network Coding, Shatin, Hong Kong, Peoples R China.
[Sung, Chi Wan] City Univ Hong Kong, Coll Sci & Engn, Dept Elect Engn, Kowloon, Hong Kong, Peoples R China.
通讯作者地址: Dai, MJ (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: mjdai@szu.edu.cn; wkshum@inc.cuhk.edu.hk; albert.sung@cityu.edu.hk
第 109 条，共 274 条
标题: Survey on cooperative strategies for wireless relay channels
作者: Dai, MJ (Dai, Mingjun); Wang, P (Wang, Peng); Zhang, SL (Zhang, Shengli); Chen, B (Chen, Bin); Wang, H (Wang,
Hui); Lin, XH (Lin, Xiaohui); Sun, C (Sun, Cong)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 3
摘要: Cooperative communication has the potential of providing better throughput and reliability to wireless systems when
compared with direct communication. To realise the potential gain, it is important to design cooperative strategies for some
representative scenarios. This survey deals with three basic wireless relay channels, namely, the parallel relay channel, the
multiple-access relay channel and the broadcast relay channel. For the first channel, which models a single unicast
connection, various forwarding strategies are studied. For the second and third channels, which model, respectively, the
uplink and downlink scenarios with multiple unicast connections; network codes that exploit the possibility of coding
among the connections are studied. The common aim pertaining to the studies of all these three channels is to use the
limited radio resource in the most efficient way. Beside the aforementioned conventional works, studies that have
state-of-the-art assumptions for relay networks, including outdated channel state information at the transmitter, full duplex
relay and practical rateless-coded cooperation, are also extensively reviewed. Copyright (c) 2014 John Wiley & Sons, Ltd.
地址: [Dai, Mingjun; Zhang, Shengli; Chen, Bin; Wang, Hui; Lin, Xiaohui] Shenzhen Univ, Coll Informat Engn, Shenzhen,
Guangdong, Peoples R China.
[Dai, Mingjun; Zhang, Shengli; Chen, Bin; Wang, Hui; Lin, Xiaohui] Shenzhen Univ, Shenzhen Key Lab Adv Commun &
Informat Proc, Shenzhen, Guangdong, Peoples R China.
[Wang, Peng] Univ Sydney, Sch Elect & Informat Engn, Sydney, NSW 2006, Australia.
[Sun, Cong] Heilongjiang Vocat Inst Ecol Engn, Harbin, Heilongjiang, Peoples R China.
通讯作者地址: Lin, XH (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen, Guangdong, Peoples R China.
电子邮件地址: xhlin@szu.edu.cn
第 110 条，共 274 条
标题: Unforgeability of an improved certificateless signature scheme in the standard model
作者: Guan, CW (Guan, Chaowen); Weng, J (Weng, Jian); Deng, RH (Deng, Robert H.); Chen, MR (Chen, Minrong);
Zhou, DH (Zhou, Dehua)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Certificateless signature is an interesting cryptographic primitive which does not suffer from the inherent key escrow
problem of identity-based cryptography and the costly certificate management problem of traditional public key
cryptography. Since security proofs in the random oracle model can only be viewed as heuristic arguments and cannot
ensure the security in the real implementation, certificateless signature schemes with security proofs in the standard model
(i.e. without random oracles) is more desirable. Some attempts have been devoted to propose certificateless signature
schemes in the standard model, whereas all of these schemes are later shown to be either insecure or flawed in the security
proofs. Recently, a new certificateless signature scheme in the standard model has been proposed. However, in this study
the authors show that this scheme cannot resist the key replacement attack, and hence it is not existentially unforgeable.
地址: [Guan, Chaowen; Weng, Jian; Deng, Robert H.] Singapore Management Univ, Sch Informat Syst, Singapore 178902,
Singapore.
[Weng, Jian; Zhou, Dehua] Jinan Univ, Dept Comp Sci, Guangzhou 510632, Guangdong, Peoples R China.
[Chen, Minrong] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
[Zhou, Dehua] Shanghai Jiao Tong Univ, Dept Comp Sci, Shanghai 200240, Peoples R China.
通讯作者地址: Weng, J (通讯作者),Singapore Management Univ, Sch Informat Syst, Singapore 178902, Singapore.
电子邮件地址: jianweng@smu.edu.sg
第 111 条，共 274 条
标题: Binary-coded extremal optimization for the design of PID controllers
作者: Zeng, GQ (Zeng, Guo-Qiang); Lu, KD (Lu, Kang-Di); Dai, YX (Dai, Yu-Xing); Zhang, ZJ (Zhang, Zheng-Jiang);
Chen, MR (Chen, Min-Rong); Zheng, CW (Zheng, Chong-Wei); Wu, D (Wu, Di); Peng, WW (Peng, Wen-Wen)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 2
摘要: Design of an effective and efficient PID controller to obtain high-quality performances such as high stability and
satisfied transient response is of great theoretical and practical significance. This paper presents a novel design method for
PID controllers based on the binary-coded extremal optimization algorithm (BCEO). The basic idea behind the proposed
method is encoding the ND parameters into a binary string, evaluating the control performance by a more reasonable index
than the integral of absolute error (IAE) and the integral of time weighted absolute error (ITAE), updating the solution by
the selection based on power-law probability distribution and binary mutation for the selected bad elements. The
experimental results on some benchmark instances have shown that the proposed BCEO-based PID design method is
simpler, more efficient and effective than the existing popular evolutionary algorithms, such as the adaptive genetic
algorithm (AGA), the self-organizing genetic algorithm (SOGA) and probability based binary particle swarm optimization
(PBPSO) for single-variable plants. Moreover, the superiority of the BCEO method to AGA and PBPSO is demonstrated by
the experimental results on the multivariable benchmark plant. (C) 2014 Elsevier B.V. All rights reserved.
地址: [Zeng, Guo-Qiang; Lu, Kang-Di; Dai, Yu-Xing; Zhang, Zheng-Jiang; Zheng, Chong-Wei; Wu, Di; Peng, Wen-Wen]
Wenzhou Univ, Dept Elect & Elect Engn, Wenzhou 325035, Peoples R China.
[Chen, Min-Rong] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Zeng, GQ (通讯作者),Wenzhou Univ, Dept Elect & Elect Engn, Wenzhou 325035, Peoples R China.
电子邮件地址: zeng.guoqiang5@gmail.com
第 112 条，共 274 条
标题: Trend analysis of categorical data streams with a concept change method
作者: Cao, FY (Cao, Fuyuan); Huang, JZ (Huang, Joshua Zhexue); Liang, JY (Liang, Jiye)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: This paper proposes a new method to trend analysis of categorical data streams. A data stream is partitioned into a
sequence of time windows and the records in each window are assumed to carry a number of concepts represented as
clusters. A data labeling algorithm is proposed to identify the concepts or clusters of a window from the concepts of the
preceding window. The expression of a concept is presented and the distance between two concepts in two consecutive
windows is defined to analyze the change of concepts in consecutive windows. Finally, a trend analysis algorithm is
proposed to compute the trend of concept change in a data stream over the sequence of consecutive time windows. The
methods for measuring the significance of an attribute that causes the concept change and the outlier degrees of objects are
presented to reveal the causes of concept change. Experiments on real data sets are presented to demonstrate the benefits of
the trend analysis method. (C) 2014 Elsevier Inc. All rights reserved.
地址: [Cao, Fuyuan; Huang, Joshua Zhexue] Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen Key Lab High
Performance Data Min, Shenzhen 518055, Peoples R China.
[Huang, Joshua Zhexue] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
[Cao, Fuyuan; Liang, Jiye] Shanxi Univ, Sch Comp & Informat Technol, Minist Educ, Key Lab Computat Intelligence &
Chinese Informat, Taiyuan 030006, Peoples R China.
通讯作者地址: Huang, JZ (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R
China.
电子邮件地址: cfy@sxu.edu.cn; zx.huang@szu.edu.cn; ljy@sxu.edu.cn
第 113 条，共 274 条
标题: Mutual Cascade method for pedestrian detection
作者: Kuang, HL (Kuang, Hulin); Chong, YW (Chong, Yanwen); Li, QQ (Li, Qingquan); Zheng, CH (Zheng, Chunhou)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: An effective and efficient feature selection method based on Gentle Adaboost (GAB) cascade and the Four Direction
Feature (FDF), namely, MutualCascade, which can be applied to the pedestrian detection problem in a single image, is
proposed in this paper. MutualCascade improves the classic method of cascade to remove irrelevant and redundant features.
The mutual correlation coefficient is utilized as a criterion to determine whether a feature should be chosen or not.
Experimental results show that the MutualCascade method is more efficient and effective than Voila and Jones' cascade and
some other Adaboost-based method, and is comparable with HOG-based methods. It also demonstrates a higher
performance compared with the state-of-the-art methods. (C) 2014 Elsevier B.V. All rights reserved.
地址: [Kuang, Hulin; Chong, Yanwen; Li, Qingquan] Wuhan Univ, State Key Lab Informat Engn Surveying Mapping & R,
Wuhan 430079, Peoples R China.
[Kuang, Hulin; Chong, Yanwen; Li, Qingquan] Minist Educ China, Engn Res Ctr Spatiotemporal Data Smart Acquisit &,
Wuhan 430079, Peoples R China.
[Kuang, Hulin] Wuhan Univ, Sch Elect Informat, Wuhan 430072, Peoples R China.
[Li, Qingquan] Shenzhen Univ, Shenzhen Key Lab Spatialtemporal Smart Sensing &, Shenzhen 518060, Guangdong,
Peoples R China.
[Zheng, Chunhou] Anhui Univ, Coll Elect Engn & Automat, Hefei 230039, Anhui, Peoples R China.
通讯作者地址: Chong, YW (通讯作者),Wuhan Univ, Lmars, Wuhan 430079, Peoples R China.
电子邮件地址: hlkuang@whu.edu.cn; ywchong@whu.edu.cn; qqli@whu.edu.cn; zhengch99@126.com
第 114 条，共 274 条
标题: Predicting dynamic deformation of retaining structure by LSSVR-based time series method
作者: Ji, ZW (Ji, Zhiwei); Wang, B (Wang, Bing); Deng, SP (Deng, SuPing); You, ZH (You, Zhuhong)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: In this paper, we propose a LSSVR-based time series method (LTSM) to predict dynamic lateral deformation of
retaining structure and ground surface settlement in deep foundation pit engineering. After reconstructing phase space,
time-varying lateral displacement of each observation point on retaining structure can be predicted using its historic unary
time series data. And then, the ground settlement nearby the deep foundation pit can be predicted using all the observed
values of lateral deformation which were collected at the same time from different depths on the retaining structure. The
experimental results show that LTSM achieved a high accuracy when predicting the lateral deformation and ground
settlement. (C) 2014 Elsevier B.V. All rights reserved.
地址: [Ji, Zhiwei; Deng, SuPing; You, Zhuhong] Tongji Univ, Sch Elect & Informat Engn, Shanghai 201804, Peoples R
China.
[Ji, Zhiwei] Zhejiang A&F Univ, Sch Informat Engn, Linan 311300, Peoples R China.
[Wang, Bing] Tongji Univ, Adv Res Inst Intelligent Sensing Network, Shanghai 201804, Peoples R China.
[Wang, Bing] Tongji Univ, Minist Educ, Key Lab Embedded Syst & Serv Comp, Shanghai 201804, Peoples R China.
[You, Zhuhong] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Guangdong, Peoples R China.
通讯作者地址: Wang, B (通讯作者),Tongji Univ, Adv Res Inst Intelligent Sensing Network, Shanghai 201804, Peoples R
China.
电子邮件地址: jzw18@hotmail.com; wangbing@ustc.edu
第 115 条，共 274 条
标题: Differential evolution based on fitness Euclidean-distance ratio for multimodal optimization
作者: Liang, JJ (Liang, J. J.); Qu, BY (Qu, B. Y.); Mao, XB (Mao, X. B.); Niu, B (Niu, B.); Wang, DY (Wang, D. Y.)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 2
摘要: The prime target of multi-modal optimization is to find multiple global and local optima of a problem in one single
run. Differential evolution is a recently proposed stochastic optimization technique. Though variants of differential
evolution (DE) are highly effective in locating single global optimum, few DE algorithms perform well when solving
multi-optima problems. In this paper, a modified Fitness Euclidean-distance Ratio (FER) technique is incorporated into DE
to enhance the DE's ability of locating and maintaining multiple peaks. The proposed algorithm is tested on a number of
benchmark test functions and the experimental results show that the proposed simple algorithm performs better comparing
with a number of state-of-the-art multimodal optimization approaches. (C) 2014 Elsevier B.V. All rights reserved.
地址: [Liang, J. J.; Mao, X. B.] Zhengzhou Univ, Sch Elect Engn, Zhengzhou 450052, Peoples R China.
[Qu, B. Y.; Wang, D. Y.] Zhongyuan Univ Technol, Sch Elect & Informat Engn, Zhengzhou, Peoples R China.
[Niu, B.] Shenzhen Univ, Coll Management, Shenzhen, Peoples R China.
[Niu, B.] Chinese Acad Sci, Hefei Inst Intelligent Machines, Hefei, Peoples R China.
通讯作者地址: Niu, B (通讯作者),Shenzhen Univ, Coll Management, Shenzhen, Peoples R China.
电子邮件地址: liangjing@zzu.edu.cn; e070088@e.ntu.edu.sg; mail-mxb@zzu.edu.cn; drniuben@gmail.com;
wdy1964@yahoo.com.cn
第 116 条，共 274 条
标题: Bacterial colony foraging optimization
作者: Chen, HN (Chen, Hanning); Niu, B (Niu, Ben); Ma, LB (Ma, Lianbo); Su, WX (Su, Weixing); Zhu, YL (Zhu,
Yunlong)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: This paper proposes a novel bacterial colony foraging (BCF) algorithm for complex optimization problems. The
proposed BCF extend original bacterial foraging algorithm to adaptive and cooperative mode by combining bacterial
chemotaxis, cell-to-cell communication, and a self-adaptive foraging strategy. The cell-to-cell communication enables the
historical search experience sharing among the bacterial colony that can significantly improve convergence. With the
self-adaptive strategy, each bacterium can be characterized by focused and deeper exploitation of the promising regions and
wider exploration of other regions of the search space. A rigorous performance analysis is given where the proposed
algorithm is benchmarked against four state-of-the-art reference algorithms using both a classical and a composition test
function suites. The individual and collective bacterial foraging behaviors of the proposed algorithmic model are also
studied. Statistical analysis of all these tests highlights the significant performance improvement due to the beneficial
combination and shows that the proposed algorithm outperforms the reference algorithms. (C) 2014 Elsevier B.V. All rights
reserved.
地址: [Chen, Hanning; Ma, Lianbo; Su, Weixing; Zhu, Yunlong] Chinese Acad Sci, Shenyang Inst Automat, Lab Informat
Serv & Intelligent Control, Shenyang 110016, Peoples R China.
[Niu, Ben] Shenzhen Univ, Coll Management, Shenzhen 518060, Peoples R China.
通讯作者地址: Chen, HN (通讯作者),Chinese Acad Sci, Shenyang Inst Automat, Fac Off 7, Nanta St 114, Shenyang
110016, Peoples R China.
电子邮件地址: chenhanning@sia.cn
第 117 条，共 274 条
标题: Full Diversity Physical-Layer Network Coding in Two-Way Relay Channels With Multiple Antennas
作者: Zhang, SL (Zhang, Shengli); Zhou, QF (Zhou, Qing F.); Kai, CH (Kai, Caihong); Zhang, W (Zhang, Wei)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: This paper studies a two-way relay channel where two single-antenna users exchange messages via a relay with K
antennas. A new physical-layer network coding (PNC) method is proposed, referred to as channel-quantized PNC
(CQ-PNC), that can achieve full diversity gain of K. The proposed method converts K received signals at the relay into two
signals by a QR decomposition. The first one is a weighted summation of the two users' messages and the second one is a
scaled version of one user's message. Then, the first signal is quantized at the relay by using the channel coefficient and the
quantization error is cancelled by using the side information of the second signal. Finally, a Gaussian-integer weighted
summation of the two users' messages is obtained, mapped to network codeword, and then broadcast to the two users. It is
proved that the proposed CQ-PNC can achieve the full diversity gain of K with receiver side channel information, low
computational complexity and symbol level synchronization. Simulation results demonstrate that the proposed method
obtains optimum performance results with negligible gap.
地址: [Zhang, Shengli] Shenzhen Univ, Coll Informat Engn, Shenzhen MCSP Key Lab, Shenzhen 518060, Peoples R
China.
[Zhou, Qing F.; Kai, Caihong] Hefei Univ Technol, Dept Commun Engn, Sch Comp & Informat, Hefei 230009, Peoples R
China.
[Zhang, Wei] Univ New S Wales, Sch Elect Engn & Telecommun, Sydney, NSW 2052, Australia.
通讯作者地址: Zhang, SL (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen MCSP Key Lab, Shenzhen 518060,
Peoples R China.
电子邮件地址: zsl@szu.edu.cn; enqfzhou@ieee.org; caihong.kai@gmail.com; wzhang@ee.unsw.edu.au
第 118 条，共 274 条
标题: Secret sharing scheme with dynamic size of shares for distributed storage system
作者: Wang, B (Wang, Bo); Chen, JY (Chen, Jianyong); Jia, SS (Jia, Songsong); Lv, CL (Lv, Chunli); Wang, XM (Wang,
Xiaomin); Zheng, HY (Zheng, Hongying)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: With fast development of cloud computing, more and more sensitive data are stored in distributed storage systems. It
is mainly suffered from the following two threats: (i) data at rest are stolen; and (ii) data in transmission are intercepted. The
threats may lead to serious problems. For example, personal private data eavesdropping may lead to legal problems and
credit crisis, while company information leaking may cause huge economic loss. To tackle such security threat in cloud
distributed storage system, we propose a novel scheme to produce dynamic size of shares with multiple iterations of secret
sharing scheme. A file is partitioned into multiple file shares, and one of them is taken as a new file to be further partitioned
into smaller size with low additional computational cost and data expansion. The small-size file share is stored at user
terminal as a necessary component to recover original file. It can be used in scenarios that user terminal, such as smart
phone, is one of nodes in distributed storage systems. In this case, attackers cannot recover information through
eavesdropping shares transmitted in network. Storage service providers cannot also obtain useful information through file
shares stored online without the participant of the small-size file share at user terminal. Therefore, sensitive data can be
protected confidentially. Copyright (c) 2013 John Wiley & Sons, Ltd.
地址: [Wang, Bo; Chen, Jianyong; Jia, Songsong; Wang, Xiaomin] Shenzhen Univ, Dept Comp Sci & Technol, Shenzhen
518060, Peoples R China.
[Lv, Chunli] China Agr Univ, Coll Informat & Elect Engn, Beijing 100083, Peoples R China.
[Zheng, Hongying] Shenzhen Inst Informat Technol, Coll Software Engn, Shenzhen 518172, Peoples R China.
通讯作者地址: Chen, JY (通讯作者),Shenzhen Univ, Dept Comp Sci & Technol, Shenzhen 518060, Peoples R China.
电子邮件地址: jychen@szu.edu.cn
第 119 条，共 274 条
标题: Ideal regularization for learning kernels from labels
作者: Pan, BB (Pan, Binbin); Lai, JH (Lai, Jianhuang); Shen, LX (Shen, Lixin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In this paper, we propose a new form of regularization that is able to utilize the label information of a data set for
learning kernels. The proposed regularization, referred to as ideal regularization, is a linear function of the kernel matrix to
be learned. The ideal regularization allows us to develop efficient algorithms to exploit labels. Three applications of the
ideal regularization are considered. Firstly, we use the ideal regularization to incorporate the labels into a standard kernel,
making the resulting kernel more appropriate for learning tasks. Next, we employ the ideal regularization to learn a
data-dependent kernel matrix from an initial kernel matrix (which contains prior similarity information, geometric
structures, and labels of the data). Finally, we incorporate the ideal regularization to some state-of-the-art kernel learning
problems. With this regularization, these learning problems can be formulated as simpler ones which permit more efficient
solvers. Empirical results show that the ideal regularization exploits the labels effectively and efficiently. (C) 2014 Elsevier
Ltd. All rights reserved.
地址: [Pan, Binbin] Shenzhen Univ, Coll Math & Computat Sci, Shenzhen, Peoples R China.
[Pan, Binbin] Sun Yat Sen Univ, Sch Math & Computat Sci, Guangzhou 510275, Guangdong, Peoples R China.
[Lai, Jianhuang] Sun Yat Sen Univ, Sch Informat Sci & Technol, Guangzhou 510275, Guangdong, Peoples R China.
[Shen, Lixin] Syracuse Univ, Dept Math, Syracuse, NY 13244 USA.
通讯作者地址: Lai, JH (通讯作者),Sun Yat Sen Univ, Sch Informat Sci & Technol, Guangzhou 510275, Guangdong,
Peoples R China.
电子邮件地址: pbb@szu.edu.cn; stsljh@mail.sysu.edu.cn; lshen03@syr.edu
第 120 条，共 274 条
标题: Content-based image retrieval using high-dimensional information geometry
作者: Cao, WM (Cao WenMing); Liu, N (Liu Ning); Kong, QC (Kong QiCong); Feng, H (Feng Hao)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 2
摘要: In this paper, a new content-based image retrieval approach is proposed based on high- dimensional information
theory. The proposed approach overcomes the disadvantages of the current content-based image retrieval algorithms that
suffer from the semantic gap. First, we present a new multidimensional information space's vector angle cosine algorithm of
high-dimensional geometry, then, we provide a detailed description of our images retrieval method including proposal of an
overlapping image block method and definition of a similarity degree between images on the non-dimensional information
subspaces. Finally, experimental results show the higher retrieval efficiency of the proposed algorithm.
地址: [Cao WenMing; Liu Ning; Kong QiCong] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
[Feng Hao] Hangzhou Dianzi Univ, Coll Automat, Hangzhou 310018, Zhejiang, Peoples R China.
通讯作者地址: Cao, WM (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: wmcao@szu.edu.cn
第 121 条，共 274 条
标题: Cryptanalysis of a signcryption scheme with fast online signing and short signcryptext
作者: Zhou, DH (Zhou DeHua); Weng, J (Weng Jian); Guan, CW (Guan ChaoWen); Deng, R (Deng, Robert); Chen, MR
(Chen MinRong); Chen, KF (Chen KeFei)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Signcryption is functional combination of encryption and signature, efficiency higher than the separate signing and
encrypting. Recently, Youn et al. presented a new signcryption scheme, which has fast online signing and short
signcryptext, and is efficient enough for mobile applications. This scheme is claimed to be both existentially unforgeable
and semantically secure. However, in this paper we shall show that it is not existentially unforgeable.
地址: [Zhou DeHua; Weng Jian] Jinan Univ, Dept Comp Sci, Guangzhou 510632, Guangdong, Peoples R China.
[Zhou DeHua; Chen KeFei] Shanghai Jiao Tong Univ, Dept Comp Sci, Shanghai 200240, Peoples R China.
[Weng Jian; Guan ChaoWen; Deng, Robert] Singapore Management Univ, Sch Informat Syst, Singapore 178902,
Singapore.
[Chen MinRong] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
[Chen MinRong] S China Normal Univ, Sch Comp, Guangzhou 510631, Guangdong, Peoples R China.
通讯作者地址: Weng, J (通讯作者),Jinan Univ, Dept Comp Sci, Guangzhou 510632, Guangdong, Peoples R China.
电子邮件地址: cryptjweng@gmail.com
第 122 条，共 274 条
标题: A study of user behavior in online VoD services
作者: Chen, L (Chen, Liang); Zhou, YP (Zhou, Yipeng); Chiu, DM (Chiu, Dah Ming)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: A big portion of Internet traffic nowadays is video. A good understanding of user behavior in online
Video-on-Demand (VoD) systems can help us design, configure and manage video content distribution. With the help of a
major VoD service provider, we conducted a detailed study of user behavior watching streamed videos over the Internet.
We engineered the video player at the client side to collect user behavior reports for over 540 million sessions. In order to
isolate the possible effect of session quality of experience (QoE) on user behavior, we use only the sessions with perfect
QoE, and leave out those sessions with QoE impairments (such as freezes). Our main finding is that users spend a lot of
time browsing: viewing part of one video after another, and only occasionally (around 20% of the time) watching a video to
its completion. We consider seek (jump to a new position of the video) as a special form of browsing repeating partial
viewing of the same video. Our analysis leads to a user behavior model in which a user transitions through a random
number of short views before a longer view, and repeats the process a random number of times. This model can be
considered an extension, and a more detailed alternative to the closed queueing network formulation introduced by Wu et al.
(2009) [1]. As an application of our user behavior model, we use it to measure video popularity. We study the similarity of
our approach to subjective evaluation and simple view count based metric, and conclude our approach gives results closer to
subjective evaluation. (C) 2014 Elsevier B.V. All rights reserved.
地址: [Chen, Liang; Zhou, Yipeng] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
[Chen, Liang; Chiu, Dah Ming] Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Zhou, YP (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, RM464,Adm Bldg,3688 Nanhai
Ave, Shenzhen 518060, Peoples R China.
电子邮件地址: cl009@ie.cuhk.edu.hk; ypzhou@szu.edu.cn; dmchiu@ie.cuhk.edu.hk
第 123 条，共 274 条
标题: Fast Near-Duplicate Image Detection Using Uniform Randomized Trees
作者: Lei, YQ (Lei, Yanqiang); Qiu, GP (Qiu, Guoping); Zheng, LG (Zheng, Ligang); Huang, JW (Huang, Jiwu)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Indexing structure plays an important role in the application of fast near-duplicate image detection, since it can
narrow down the search space. In this article, we develop a cluster of uniform randomized trees (URTs) as an efficient
indexing structure to perform fast near-duplicate image detection. The main contribution in this article is that we introduce
"uniformity" and "randomness" into the indexing construction. The uniformity requires classifying the object images into
the same scale subsets. Such a decision makes good use of the two facts in near-duplicate image detection, namely: (1) the
number of categories is huge; (2) a single category usually contains only a small number of images. Therefore, the uniform
distribution is very beneficial to narrow down the search space and does not significantly degrade the detection accuracy.
The randomness is embedded into the generation of feature subspace and projection direction, improveing the flexibility of
indexing construction. The experimental results show that the proposed method is more efficient than the popular
locality-sensitive hashing and more stable and flexible than the traditional KD-tree.
地址: [Lei, Yanqiang] Sun Yat Sen Univ, Sch Informat Sci Technol, Guangzhou 510006, Guangdong, Peoples R China.
[Qiu, Guoping] Univ Nottingham, Sch Comp Sci, Nottingham NG8 1BB, England.
[Zheng, Ligang] Guangzhou Univ, Sch Comp, Guangzhou 510006, Guangdong, Peoples R China.
[Huang, Jiwu] Shenzhen Univ, Coll Informat Engn, Shenzhen Key Lab Media Secur, Shenzhen 518060, Peoples R China.
通讯作者地址: Huang, JW (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen Key Lab Media Secur, Shenzhen
518060, Peoples R China.
电子邮件地址: jwhuang@szu.edu.cn
第 124 条，共 274 条
标题: CUTS: Improving Channel Utilization in Both Time and Spatial Domain in WLANs
作者: Li, HC (Li, Haochao); Wu, KS (Wu, Kaishun); Zhang, Q (Zhang, Qian); Ni, LM (Ni, Lionel M.)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Improving channel utilization is a well-known issue in wireless networks. In traditional point-to-point wireless
communication, significant efforts had been made by the existing studies on enhancing the utilization of the channel access
time. However, in the emerging wireless network using MU-MIMO, considering only the time domain in channel
utilization is not sufficient. As multiple transmitters are allowed to transmit packets simultaneously to the same AP,
allowing more antennas at AP would lead to higher channel utilization. Thus, the channel utilization in MU-MIMO should
consider both time and spatial domains, i.e., the channel access time and the antenna usage, which have not been considered
in the existing methods. In this paper, we point out that the fundamental problem is lacking of the antenna information of
contention nodes in channel contention. To address this issue, we propose a new MAC-PHY architecture design, CUTS, to
allow distributed nodes effectively contend for the channel and utilize the channel in both domains. Particularly, CUTS
adopts interference nulling to attach the antenna information in channel contention. Meanwhile, techniques such as channel
contention in frequency domain and ACK in frequency domain using self-jamming are adopted. Through the software
defined radio-based real experiments and extensive simulations, we demonstrate the feasibility of our design and illustrate
that CUTS provides better channel utilization with the gain over IEEE 802.11 reaching up to 470 percent.
地址: [Li, Haochao; Zhang, Qian; Ni, Lionel M.] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, HKUST Fok
Ying Tung Grad Sch, Hong Kong, Hong Kong, Peoples R China.
[Wu, Kaishun] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Wu, Kaishun] Guangzhou HKUST Fok Ying Tung Res Inst, Guangzhou, Guangdong, Peoples R China.
通讯作者地址: Li, HC (通讯作者),Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, HKUST Fok Ying Tung
Grad Sch, Hong Kong, Hong Kong, Peoples R China.
电子邮件地址: stevenli@cse.ust.hk; kwinson@ust.hk; qianzh@cse.ust.hk; ni@cse.ust.hk
第 125 条，共 274 条
标题: Fine-Grained Localization for Multiple Transceiver-Free Objects by using RF-Based Technologies
作者: Zhang, DA (Zhang, Dian); Lu, KZ (Lu, Kezhong); Mao, R (Mao, Rui); Feng, YH (Feng, Yuhong); Liu, YH (Liu,
Yunhuai); Ming, Z (Ming, Zhong); Ni, LM (Ni, Lionel M.)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 3
摘要: In traditional radio-based localization methods, the target object has to carry a transmitter (e. g., active RFID), a
receiver (e.g., 802.11 x detector), or a transceiver (e. g., sensor node). However, in some applications, such as safe guard
systems, it is not possible to meet this precondition. In this paper, we propose a model of signal dynamics to allow the
tracking of a transceiver-free object. Based on radio signal strength indicator (RSSI), which is readily available in wireless
communication, three centralized tracking algorithms, and one distributed tracking algorithm are proposed to eliminate
noise behaviors and improve accuracy. The midpoint and intersection algorithms can be applied to track a single object
without calibration, while the best-cover algorithm has higher tracking accuracy but requires calibration. The probabilistic
cover algorithm is based on distributed dynamic clustering. It can dramatically improve the localization accuracy when
multiple objects are present. Our experimental test-bed is a grid sensor array based on MICA2 sensor nodes. The
experimental results show that the localization accuracy for single object can reach about 0.8 m and for multiple objects is
about 1 m.
地址: [Zhang, Dian; Lu, Kezhong; Mao, Rui; Feng, Yuhong; Ming, Zhong] Shenzhen Univ, Coll Comp Sci & Software
Engn, Shenzhen 518060, Guangdong, Peoples R China.
[Liu, Yunhuai] Minist Publ Secur, Res Inst 3, Shanghai 2012014, Peoples R China.
[Ni, Lionel M.] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Hong Kong, Peoples R China.
通讯作者地址: Mao, R (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Guangdong,
Peoples R China.
电子邮件地址: serena.dian@gmail.com; kzlu@szu.edu.cn; mao@szu.edu.cn; yuhongf@szu.edu.cn;
yunhuai.liu@gmail.com; mingz@szu.edu.cn; ni@cse.ust.hk
第 126 条，共 274 条
标题: Multi-phase modified shuffled frog leaping algorithm with extremal optimization for the MDVRP and the
MDVRPTW
作者: Luo, JP (Luo, Jianping); Chen, MR (Chen, Min-Rong)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: In this work, a novel multi-phase modified shuffled frog leaping algorithm (MPMSFLA) framework is presented to
solve the multi-depot vehicle routing problem (MDVRP) more quickly. The presented algorithm adopts the K-means
algorithm to execute the clustering analyses for all customers, generates a frog population according to the result of the
clustering analyses, and then proceeds to the three-phase process. In the first phase, a cluster MSFLA local search is carried
out for each cluster. In the second phase, the algorithm selects good individuals through a binary tournament to construct a
new population and then performs a global optimization for all customers and depots using the global MSFLA. In the third
phase, a cluster adjustment is implemented for the population to generate new clusters. These procedures continue until the
convergence criterion is satisfied. The experimental results show that our algorithm can achieve a high quality solution
within a short runtime for the MDVRP, the MDVRP with time windows (MDVRPTW) and the capacitated vehicle routing
problem (CVRP). The proposed algorithm is suitable for solving large-scale problems. (C) 2014 Elsevier Ltd. All rights
reserved.
地址: [Luo, Jianping; Chen, Min-Rong] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Luo, JP (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: camelrock@126.com
第 127 条，共 274 条
标题: A Semi-fragile Image Watermarking Scheme Exploiting BTC Quantization Data
作者: Zhao, DN (Zhao, Dongning); Xie, WX (Xie, Weixin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: This paper proposes a novel blind image watermarking scheme exploiting Block Truncation Coding (BTC). Most of
existing BTC-based watermarking or data hiding methods embed information in BTC compressed images by modifying the
BTC encoding stage or BTC-compressed data, resulting in watermarked images with bad quality. Other than existing
BTC-based watermarking schemes, our scheme does not really perform the BTC compression on images during the
embedding process but uses the parity of BTC quantization data to guide the watermark embedding and extraction
processes. In our scheme, we use a binary image as the original watermark. During the embedding process, the original
cover image is first partitioned into non-overlapping 4x4 blocks. Then, BTC is performed on each block to obtain its BTC
quantized high mean and low mean. According to the parity of high mean and the parity of low mean, two watermark bits
are embedded in each block by modifying the pixel values in the block to make sure that the parity of high mean and the
parity of low mean in the modified block are equal to the two watermark bits. During the extraction process, BTC is first
performed on each block to obtain its high mean and low mean. By checking the parity of high mean and the parity of low
mean, we can extract the two watermark bits in each block. The experimental results show that the proposed watermarking
method is fragile to most image processing operations and various kinds of attacks while preserving the invisibility very
well, thus the proposed scheme can be used for image authentication.
地址: [Zhao, Dongning; Xie, Weixin] Shenzhen Univ, Coll Informat Engn, ATR Natl Def Technol Key Lab, Shenzhen
518060, Peoples R China.
通讯作者地址: Zhao, DN (通讯作者),Shenzhen Univ, Coll Informat Engn, ATR Natl Def Technol Key Lab, Shenzhen
518060, Peoples R China.
电子邮件地址: zhaodongning1979@gmail.com
第 128 条，共 274 条
标题: An Improved Video Identification Scheme Based on Video Tomography
作者: Ji, QG (Ji, Qing-Ge); Tan, ZF (Tan, Zhi-Feng); Lu, ZM (Lu, Zhe-Ming); Zhang, Y (Zhang, Yong)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In recent years, with the popularization of video collection devices and the development of the Internet, it is easy to
copy original digital videos and distribute illegal copies quickly through the Internet. It becomes a critical task to uphold
copyright laws, and this problem will require a technical solution. Therefore, as a challenging problem, copy detection or
video identification becomes increasingly important. The problem addressed here is to identify a given video clip in a given
set of video sequences. In this paper, an extension to the video identification approach based on video tomography is
presented. First, the feature extraction process is modified to enhance the reliability of the shot signature with its size
unchanged. Then, a new similarity measurement between two shot signatures is proposed to address the problem generated
by the original approach when facing the query shot with a short length. In addition, the query scope is extended from one
shot only to one clip (several consecutive shots) by giving a new definition of similarity between two clips and describing a
search algorithm which can save much of the computation cost. Experimental results show that the proposed approach is
more suitable for identifying shots with short lengths than the original approach. The clip query approach performs well in
the experiment and it also shows strong robustness to data loss.
地址: [Ji, Qing-Ge; Tan, Zhi-Feng] Sun Yat Sen Univ, Sch Informat Sci & Technol, Guangzhou 510006, Guangdong,
Peoples R China.
[Lu, Zhe-Ming] Zhejiang Univ, Sch Aeronaut & Astronaut, Hangzhou 310027, Zhejiang, Peoples R China.
[Zhang, Yong] Shenzhen Univ, Coll Informat Engn, ATR Natl Def Technol Key Lab, Shenzhen 518060, Peoples R China.
通讯作者地址: Lu, ZM (通讯作者),Zhejiang Univ, Sch Aeronaut & Astronaut, Hangzhou 310027, Zhejiang, Peoples R
China.
电子邮件地址: zheminglu@zju.edu.cn
第 129 条，共 274 条
标题: Identifying Compression History of Wave Audio and Its Applications
作者: Luo, D (Luo, Da); Luo, WQ (Luo, Weiqi); Yang, R (Yang, Rui); Huang, JW (Huang, Jiwu)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Audio signal is sometimes stored and/or processed inWAV (waveform) format without any knowledge of its previous
compression operations. To perform some subsequent processing, such as digital audio forensics, audio enhancement and
blind audio quality assessment, it is necessary to identify its compression history. In this article, we will investigate how to
identify a decompressed wave audio that went through one of three popular compression schemes, includingMP3, WMA
(windows media audio) and AAC (advanced audio coding). By analyzing the corresponding frequency coefficients,
including modified discrete cosine transform (MDCT) and Mel-frequency cepstral coefficients (MFCCs), of those original
audio clips and their decompressed versions with different compression schemes and bit rates, we propose several statistics
to identify the compression scheme as well as the corresponding bit rate previously used for a given WAV signal. The
experimental results evaluated on 8,800 audio clips with various contents have shown the effectiveness of the proposed
method. In addition, some potential applications of the proposed method are discussed.
地址: [Luo, Da; Yang, Rui] Sun Yat Sen Univ, Sch Informat Sci Technol, Guangzhou 510006, Guangdong, Peoples R
China.
[Luo, Weiqi] Sun Yat Sen Univ, Sch Software, Guangzhou 510006, Guangdong, Peoples R China.
[Huang, Jiwu] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Luo, WQ (通讯作者),Sun Yat Sen Univ, Sch Software, Guangzhou 510006, Guangdong, Peoples R China.
电子邮件地址: is04ld@mail2.sysu.edu.cn; luoweiqi@mail.sysu.edu.cn; yrui@mail2.sysu.edu.cn; jwhuang@szu.edu.cn
第 130 条，共 274 条
标题: Design of micro-optics array to realize two dimensional perfect shuffle transform
作者: Yang, JB (Yang, Junbo); Shao, ZZ (Shao, Zhengzheng); Zhou, K (Zhou, Kuo); Xu, J (Xu, Jia); Xu, P (Xu, Ping)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Two-dimensional (2D) perfect shuffle transform (PST) plays an important role in optical communication and optical
information processing due to very high space-bandwidth product (SBWP) and spatial degrees of freedom. The planar-array
of micro-blazed grating has been proposed to realize 2D PST based on its interesting properties such as high diffraction
efficiency, small size, high degree of integration, and easy to fabricate. 2D PST could be realized in free space through
controling the etching direction and the period of micro-blazed grating, which results in signal beams can reach the desired
spatial position. Unlike the conventional method depending on the operation of dividing, magnification, interlacing, and
superimposing, this approach, which mainly relies on the diffractive properties of signal beams and the distribution of light
intensity, presents a single diffractive element to perform 2D PST. Thus, this approach has the advantages of high energy
efficiency, high feasibility, compact in structure, and easy to integrate. The theoretical analyses and the experimental results
show that it should be helpful in optical interconnection network, especially, in PS omega network. (C) 2014 Elsevier B.V.
All rights reserved.
地址: [Yang, Junbo; Shao, Zhengzheng; Zhou, Kuo; Xu, Jia] Natl Univ Def Technol, Ctr Mat Sci, Changsha 410073,
Hunan, Peoples R China.
[Xu, Ping] Shenzhen Univ, Coll Elect Sci & Technol, Shenzhen 518060, Peoples R China.
通讯作者地址: Yang, JB (通讯作者),Natl Univ Def Technol, Ctr Mat Sci, Changsha 410073, Hunan, Peoples R China.
电子邮件地址: yangjunbo008@sohu.com
第 131 条，共 274 条
标题: Comparing the learning effectiveness of BP, ELM, I-ELM, and SVM for corporate credit ratings
作者: Zhong, HM (Zhong, Haoming); Miao, CY (Miao, Chunyan); Shen, ZQ (Shen, Zhiqi); Feng, YH (Feng, Yuhong)
Web of Science 核心合集中的 "被引频次": 4
被引频次合计: 5
摘要: Corporate credit ratings are one of the key problems of the credit risk management, which has attracted much
research attention since the credit crisis in 2007. Scorecards are the most widely used approaches for corporate credit ratings
nowadays. However, they have heavy dependency on the involvement of users. Al technologies, such as Artificial Neural
Networks (ANNs) and Support Vector Machines (SVMs) have demonstrated their remarkable performance on automatic
corporate credit ratings. Corporate credit ratings involve various rating models, and their outputs can scale to multiple levels
and be used for various applications. Such inherent complexity gives rise to the requirement of higher demands on the
effectiveness of learning algorithms regarding the accuracy, overfitness, error distribution, and output distribution. Most
research works show that SVMs have better performance than ANNs on accuracy. This paper carries out a comprehensive
experimental comparison study over the effectiveness of four learning algorithms, i.e., BP, ELM, I-ELM, and SVM over a
data set consisting of real financial data for corporate credit ratings. The results are presented and discussed in the paper. (C)
2013 Elsevier B.V. All rights reserved.
地址: [Zhong, Haoming; Miao, Chunyan; Shen, Zhiqi] Nanyang Technol Univ, Sch Comp Engn, Singapore 639798,
Singapore.
[Feng, Yuhong] Shenzhen Univ, Sch Comp Sci & Software Engn, Guangdong Prov Key Lab Popular High Performance C,
Shenzhen 518060, Guangdong, Peoples R China.
通讯作者地址: Feng, YH (通讯作者),Shenzhen Univ, Sch Comp Sci & Software Engn, Guangdong Prov Key Lab Popular
High Performance C, Shenzhen 518060, Guangdong, Peoples R China.
电子邮件地址: zhonghm@gmail.com; ascymiao@ntu.edu.sg; zqshen@ntu.edu.sg; yuhongf@szu.edu.cn
第 132 条，共 274 条
标题: Automatically refining partial specifications for heap-manipulating programs
作者: Qin, SC (Qin, Shengchao); He, GH (He, Guanhua); Luo, CG (Luo, Chenguang); Chin, WN (Chin, Wei-Ngan); Yang,
HL (Yang, Hongli)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: Automatically verifying heap-manipulating programs is a challenging task, especially when dealing with complex
data structures with strong invariants, such as sorted lists and AVL/red-black trees. The verification process can greatly
benefit from human assistance through specification annotations, but this process requires intellectual effort from users and
is error-prone. In this paper, we propose a new approach to program verification that allows users to provide only partial
specification to methods. Our approach will the refine the given annotation into a more complete specification by
discovering missing constraints. The discovered constraints may involve both numerical and multi-set properties that could
be later confirmed or revised by users. We further augment our approach by requiring partial specification to be given only
for primary methods. Specifications for loops and auxiliary methods can then be systematically discovered by our
augmented mechanism, with the help of information propagated from the primary methods. Our work is aimed at verifying
beyond shape properties, with the eventual goal of analysing full functional properties for pointer-based data structures.
Initial experiments have confirmed that we can automatically refine partial specifications with non-trivial constraints, thus
making it easier for users to handle specifications with richer properties. (C) 2013 Elsevier B.V. All rights reserved.
地址: [Qin, Shengchao; He, Guanhua; Luo, Chenguang] Univ Teesside, Sch Comp, Middlesbrough, Cleveland, England.
[Qin, Shengchao] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Qin, Shengchao; Yang, Hongli] Beijing Univ Technol, Coll Comp Sci, Beijing, Peoples R China.
[Chin, Wei-Ngan] Natl Univ Singapore, Sch Comp, Singapore 117548, Singapore.
通讯作者地址: Qin, SC (通讯作者),Univ Teesside, Sch Comp, Middlesbrough, Cleveland, England.
电子邮件地址: s.qin@tees.ac.uk; g.he@tees.ac.uk; chinwn@comp.nus.edu.sg; yhl.yang@gmail.com
第 133 条，共 274 条
标题: CSMA/SF: Carrier Sense Multiple Access with Shortest First
作者: Wang, GH (Wang, Guanhua); Wu, KS (Wu, Kaishun); Ni, LM (Ni, Lionel M.)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: Energy efficiency is the main concern in wireless sensor networks (WSNs) due to devices' limited battery power.
Because the heavy burden of nodes that near the sink, this "energy hole problem" makes nodes near the sink have faster
energy depletion than others. Because of this, the lifetime of WSNs, to some extent, is determined by the power
consumption of communication between sink and sensing nodes that near the sink. To address this issue, we propose
CSMA/SF (Shortest First) protocol to reduce power consumption of sink-node communication by minimizing energy cost
in carrier sense during nodes' channel contention. CSMA/SF modifies existed CSMA/CA MAC protocol. Instead of
complete contention-based, CSMA/SF ensures nodes remaining shorter message has higher priority in contention by
implementing a distributed scheduling algorithm and incorporating Length Detection scheme. Further, CSMA/SF employs
an Anti-Starvation mechanism to solve the starvation problem of shortest-first protocol. CSMA/SF also optimizes channel
utilization by reducing the probability of collisions. We have implemented CSMA/SF into USRP2 platform and also
conducted comprehensive simulations. The experimental results show that CSMA/SF can reduce overall energy
consumption by around 20%. CSMA/SF can improve channel utilization up to 40%.
地址: [Wu, Kaishun] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Wu, Kaishun] Guangzhou HKUST Fok Ying Tung Res Inst, Guangzhou, Peoples R China.
[Wang, Guanhua; Ni, Lionel M.] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Hong Kong, Peoples
R China.
通讯作者地址: Wang, GH (通讯作者),Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Hong Kong,
Peoples R China.
电子邮件地址: gwangab@cse.ust.hk; kwinson@ust.hk; ni@cse.ust.hk
第 134 条，共 274 条
标题: Identification of Electronic Disguised Voices
作者: Wu, HJ (Wu, Haojun); Wang, Y (Wang, Yong); Huang, JW (Huang, Jiwu)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Since voice disguise has been an increasing tendency in illegal applications, and it has a great negative impact on
establishing the authenticity of audio evidence for audio forensics, it is important to be able to identify whether a suspected
voice has been disguised or not. However, few studies on such identification have been reported. In this paper, we propose
an algorithm to identify electronic disguised voices. Since voice disguise, in essence, the modification of the frequency
spectrum of speech signals, and mel-frequency cepstrum coefficients (MFCCs) can be used to well describe frequency
spectral properties, MFCC-based features are supposed to be effective for the identification of disguised voices. In this
paper, MFCC statistical moments including mean values and correlation coefficients are extracted as acoustic features.
Then, an algorithm based on the extracted features and support vector machine classifiers is proposed to separate disguised
voices from original voices. Extensive experiments show that the detection rates higher than 90% of the voices from various
speech databases and disguised by various methods can be achieved, indicating that the identification performance of this
algorithm is remarkable.
地址: [Wu, Haojun; Wang, Yong] Sun Yat Sen Univ, Sch Informat Sci & Technol, Guangzhou 510006, Guangdong,
Peoples R China.
[Huang, Jiwu] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Wu, HJ (通讯作者),Sun Yat Sen Univ, Sch Informat Sci & Technol, Guangzhou 510006, Guangdong,
Peoples R China.
电子邮件地址: wuhaojun@mail2.sysu.edu.cn; isswy@mail.sysu.edu.cn; jwhuang@szu.edu.cn
第 135 条，共 274 条
标题: HAMMER: automated operation of mass frontier to construct in silico mass spectral fragmentation libraries
作者: Zhou, JR (Zhou, Jiarui); Weber, RJM (Weber, Ralf J. M.); Allwood, JW (Allwood, J. William); Mistrik, R (Mistrik,
Robert); Zhu, ZX (Zhu, Zexuan); Ji, Z (Ji, Zhen); Chen, SP (Chen, Siping); Dunn, WB (Dunn, Warwick B.); He, S (He,
Shan); Viant, MR (Viant, Mark R.)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 2
摘要: Experimental MSn mass spectral libraries currently do not adequately cover chemical space. This limits the robust
annotation of metabolites in metabolomics studies of complex biological samples. In silico fragmentation libraries would
improve the identification of compounds from experimental multistage fragmentation data when experimental reference
data are unavailable. Here, we present a freely available software package to automatically control Mass Frontier software
to construct in silico mass spectral libraries and to perform spectral matching. Based on two case studies, we have
demonstrated that high-throughput automation of Mass Frontier allows researchers to generate in silico mass spectral
libraries in an automated and high-throughput fashion with little or no human intervention required.
地址: [Zhou, Jiarui] Zhejiang Univ, Coll Biomed Engn & Instrument Sci, Hangzhou 310027, Zhejiang, Peoples R China.
[Weber, Ralf J. M.; Allwood, J. William; Dunn, Warwick B.; Viant, Mark R.] Univ Birmingham, Sch Biosci, Birmingham
B15 2TT, W Midlands, England.
[Mistrik, Robert] HighChem Ltd, Bratislava 81104, Slovakia.
[Zhu, Zexuan; Ji, Zhen] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen City Key Lab Embedded Syst Design,
Shenzhen 518060, Peoples R China.
[Chen, Siping] Shenzhen Univ, Sch Med, Shenzhen 518060, Peoples R China.
[He, Shan] Univ Birmingham, Sch Comp Sci, Birmingham B15 2TT, W Midlands, England.
通讯作者地址: Viant, MR (通讯作者),Univ Birmingham, Sch Biosci, Birmingham B15 2TT, W Midlands, England.
电子邮件地址: m.viant@bham.ac.uk
第 136 条，共 274 条
标题: A Refined Convergence Condition for Iterative Waterfilling Algorithm
作者: Dai, MJ (Dai, Mingjun); Zhang, SL (Zhang, Shengli); Chen, B (Chen, Bin); Lin, XH (Lin, Xiaohui); Wang, H
(Wang, Hui)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In a multi-user spectrum optimization problem, iterative waterfilling is normally used as a distributed power
allocation algorithm. In this letter, we derive a new sufficient condition for its convergence, which is more relaxed than
previous conditions. Our result strengthens the fact that the convergence of iterative waterfilling is dependent on
signal-to-noise ratio (SNR), and that convergence is much easier in the low SNR regime.
地址: [Dai, Mingjun; Zhang, Shengli; Chen, Bin; Lin, Xiaohui; Wang, Hui] Shenzhen Univ, Coll Informat Engn, Shenzhen,
Peoples R China.
[Dai, Mingjun; Zhang, Shengli; Chen, Bin; Lin, Xiaohui; Wang, Hui] Shenzhen Univ, Shenzhen Key Lab Adv Commun &
Informat Proc, Shenzhen, Peoples R China.
通讯作者地址: Wang, H (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen, Peoples R China.
电子邮件地址: mjdai@szu.edu.cn; wanghsz@szu.edu.cn
第 137 条，共 274 条
标题: Orthogonal locally discriminant spline embedding for plant leaf recognition
作者: Lei, YK (Lei, Ying-Ke); Zou, JW (Zou, Ji-Wei); Dong, TB (Dong, Tianbao); You, ZH (You, Zhu-Hong); Yuan, Y
(Yuan, Yuan); Hu, YH (Hu, Yihua)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 2
摘要: Based on local spline embedding (LSE) and maximum margin criterion (MMC), two orthogonal locally discriminant
spline embedding techniques (OLDSE-I and OLDSE-II) are proposed for plant leaf recognition in this paper. By OLDSE-I
or OLDSE-II, the plant leaf images are mapped into a leaf subspace for analysis, which can detect the essential leaf
manifold structure. Different from principal component analysis (PCA) and linear discriminant analysis (LDA) which can
only deal with flat Euclidean structures of plant leaf space, OLDSE-I and OLDSE-II not only inherit the advantages of local
spline embedding (LSE), but makes full use of class information to improve discriminant power by introducing translation
and rescaling models. The proposed OLDSE-I and OLDSE-II methods are applied to recognize the plant leaf and are
examined using the ICL-PlantLeaf and Swedish plant leaf image databases. The numerical results show compared with
MMC, LDA, SLPP, and LDSE, the proposed OLDSE-I and OLDSE-II methods can achieve higher recognition rate. (C)
2013 Elsevier Inc. All rights reserved.
地址: [Lei, Ying-Ke] State Key Lab Complex Electromagnet Environm Effe, Luoyang 471003, Peoples R China.
[Lei, Ying-Ke; Zou, Ji-Wei; Dong, Tianbao; Yuan, Yuan; Hu, Yihua] Inst Elect Engn, Hefei 230027, Anhui, Peoples R
China.
[You, Zhu-Hong] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Guangdong, Peoples R China.
通讯作者地址: Hu, YH (通讯作者),Inst Elect Engn, Hefei 230027, Anhui, Peoples R China.
电子邮件地址: eeibioinformatics@gmail.com
第 138 条，共 274 条
标题: A sequential GM-based PHD filter for a linear Gaussian system (vol 56, pg 1, 2013)
作者: Liu, ZX (Liu ZongXiang); Xie, WX (Xie WeiXin); Wang, P (Wang Pin); Yu, Y (Yu You)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
地址: [Liu ZongXiang; Xie WeiXin; Wang Pin; Yu You] Shenzhen Univ, ATR Key Lab, Shenzhen 518060, Peoples R
China.
通讯作者地址: Liu, ZX (通讯作者),Shenzhen Univ, ATR Key Lab, Shenzhen 518060, Peoples R China.
第 139 条，共 274 条
标题: Efficient hierarchical identity-based encryption for Mobile Ad hoc Networks
作者: He, K (He, Kai); Chen, MR (Chen, Min-Rong); Mao, YJ (Mao, Yijun); Zhang, X (Zhang, Xi); Zhang, YJ (Zhang,
Yiju)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: A Mobile Ad-hoc Network (MANET) is a collection of wireless nodes that can dynamically form a network to
exchange information without using any pre-existing fixed network infrastructure. Such networks are more vulnerable to
security attacks than conventional wired networks, and hence cryptographic schemes are usually used to ensure security for
them. It is worth noting that the nodes in MANETs are with low computational power and communicate over relatively
bandwidth constrained wireless links, and thus the deployed cryptographic schemes should usually be highly efficient in
term of both computational cost and communication overhead. To ensure the data confidentiality for MANETs, in this
paper, we present a new hierarchical identity-based encryption (HIBE) scheme, which enjoys the advantages of low
computational cost and light communication overhead. We further propose a new hierarchical identity-based key
encapsulation mechanism (HIBKEM) based on our HIBE scheme. The proposed HIBKEM scheme is fully secure against
adaptive chosen-ciphertext attack, and has a tight security reduction in the standard model.
地址: [He, Kai] Jinan Univ, Dept Comp Sci, Guangzhou 510632, Guangdong, Peoples R China.
[Chen, Min-Rong] Shenzhen Univ, Coll Informat Engn, Shenzhen, Guangdong, Peoples R China.
[Chen, Min-Rong] S China Normal Univ, Sch Comp, Guangzhou, Guangdong, Peoples R China.
[Mao, Yijun] Sun Yat Sen Univ, Sch Informat Sci & Technol, Guangzhou 510275, Guangdong, Peoples R China.
[Mao, Yijun] South China Agr Univ, Coll Informat, Guangzhou, Guangdong, Peoples R China.
[Zhang, Xi] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Guangdong, Peoples R China.
[Zhang, Yiju] Sun Yat Sen Univ, Sch Engn, Guangzhou 510275, Guangdong, Peoples R China.
通讯作者地址: He, K (通讯作者),Jinan Univ, Dept Comp Sci, Guangzhou 510632, Guangdong, Peoples R China.
电子邮件地址: hekai1214@gmail.com
第 140 条，共 274 条
标题: Harnessing Frequency Domain for Cooperative Sensing and Multi-channel Contention in CRAHNs
作者: Wang, L (Wang, Lu); Wu, KS (Wu, Kaishun); Xiao, J (Xiao, Jiang); Hamdi, M (Hamdi, Mounir)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: It is known that current fixed spectrum assignment policy has made the spectrum resource significantly underutilized.
As a promising solution, cognitive radio emerges and shows its advantages. It allows the unlicensed users to
opportunistically access the spectrum not used by the licensed users. To ensure that the unlicensed users can identify the
vacate spectrum fast and accurately without interfering the licensed users, cooperative sensing is explored to improve the
sensing performance by leveraging spatial diversity. However, cooperation gain can be compromised dramatically with
cooperation overhead. Furthermore, when sensing decisions are made, contention on spectrum access also contributes a lot
to the control overhead, especially in the distributed networks. Motivated by this, we propose a novel MAC design, termed
Frequency domain Cooperative sensing and Multi-channel contention (FCM) for Cognitive Radio Ad Hoc Networks
(CRAHNs). FCM is proposed for OFDM (Orthogonal Frequency Division Multiplexing) modulation based communication
systems, which moves cooperative sensing and multi-channel contention from time domain into frequency domain.
Therefore, control overhead caused by cooperation and contention can be significantly reduced. Meanwhile, the sensing and
access performance can be both guaranteed. Extensive simulation results show that FCM can effectively reduce the control
overhead, and improve the average throughput by 220% over Traditional Cooperative MAC for CRAHNs.
地址: [Wang, Lu; Wu, Kaishun] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Wang, Lu; Xiao, Jiang; Hamdi, Mounir] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Hong Kong, Hong
Kong, Peoples R China.
[Wu, Kaishun] Guangzhou HKUST Fok Ying Tung Res Inst, Guangzhou, Peoples R China.
通讯作者地址: Wang, L (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
电子邮件地址: wanglu@cse.ust.hk; kwinson@ust.hk; jxiao@cse.ust.hk; hamdi@cse.ust.hk
第 141 条，共 274 条
标题: Bearings-only maneuvering target tracking based on fuzzy clustering in a cluttered environment
作者: Li, LQ (Li Liang-qun); Xie, WX (Xie Wei-xin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: This paper proposes a novel bearings-only maneuvering target tracking algorithm based on maximum entropy fuzzy
clustering in a cluttered environment. In the proposed algorithm, the interacting multiple model (IMM) approach is used to
solve the maneuvering problem of target, and the false alarms generated by clutter are accommodated through a
probabilistic data association filter (PDAF). To reduce the computational load, the association probability is substituted by
fuzzy membership degree provided by a modified version of fuzzy clustering algorithm based on maximum entropy
principle, and the "maximum validation distance" is also defined based on the discrimination factor, which enables the
algorithm eliminate invalid measurements. Moreover, to avoid the unobservability problem of passive target tracking, a
nonlinear measurement model of multiple passive sensors is formulated. Finally, simulation results show that the proposed
algorithm has advantages over the conventional IMM-PDAF algorithm in terms of simplicity and efficiency. (C) 2013
Elsevier GmbH. All rights reserved.
地址: [Li Liang-qun; Xie Wei-xin] Shenzhen Univ, ATR Key Lab, Shenzhen 518060, Guangdong, Peoples R China.
通讯作者地址: Li, LQ (通讯作者),Shenzhen Univ, Sch Informat Engn, 2-603Box, Shenzhen 518060, Guangdong, Peoples
R China.
电子邮件地址: lqli@szu.edu.cn
第 142 条，共 274 条
标题: Efficient Linear Homomorphic Encryption from LWE Over Rings
作者: Wang, T (Wang, Ting); Yu, JP (Yu, Jianping); Zhang, P (Zhang, Peng); Xie, X (Xie, Xuan)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: As the basis for secure public-key encryption under various cases, the learning with errors (LWE) problem has
proved to be versatile for encryption schemes. Unfortunately, it tends not to be efficient enough for practical applications.
For improving the efficiency issues and quickening the practical applications of the lattice-based public-key cryptosystems,
an efficient homomorphic encryption scheme is presented in this paper, which is based on the learning with errors over
rings (R-LWE) assumption, and its security is reducible to the hardness of the shortest vector problem in the worst case on
ideal lattices. Furthermore, the scheme possesses homomorphism feature that encryption operations are consistent with
message operations. The security analysis shows that the proposed encryption scheme is secure against chosen-plaintext
attacks in the standard model. At the same time, the efficiency analysis and simulation results indicate that the scheme is
much more efficient than previous lattice-based cryptosystems.
地址: [Wang, Ting; Yu, Jianping; Zhang, Peng; Xie, Xuan] Shenzhen Univ, ATR Key Lab Natl Def Technol, Shenzhen
518060, Peoples R China.
通讯作者地址: Wang, T (通讯作者),Shenzhen Univ, ATR Key Lab Natl Def Technol, Shenzhen 518060, Peoples R
China.
电子邮件地址: wangt809@163.com; yujp@szu.edu.cn; zhangpeng_aza@126.com; xiexuan200308@126.com
第 143 条，共 274 条
标题: Generalized selection combining with double threshold and performance analysis
作者: Xie, N (Xie, Ning); Liu, ZR (Liu, Zhaorong); Wang, R (Wang, Rui); Wang, H (Wang, Hui); Lin, XH (Lin, Xiaohui)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In this paper, we propose a new diversity combining scheme to save power, which is called as the generalized
selection combining with double threshold (DT-GSC). It selects the branch whose SNR is above an input threshold to
combine, and this process will keep running until the combined output SNR is larger than an output threshold or until all
paths are examined. The values of both thresholds are required to be predetermined on the basis of the practical
communication conditions. For comparing the complexity of various combining schemes, we will show the mathematical
formulas of the average number of path estimation and the average number of combined branches. Moreover, we will also
compare the average bit-error-ratio performance of the proposed DT-GSC with absolute threshold GSC (AT-GSC) and
output threshold MRC (OT-MRC). Numerical examples and simulation results show that the proposed DT-GSC leads to a
lower complexity than the conventional AT-GSC and OT-MRC while it has a satisfactory performance.Copyright (c) 2012
John Wiley & Sons, Ltd.
地址: [Xie, Ning; Liu, Zhaorong; Wang, Rui; Wang, Hui; Lin, Xiaohui] Shenzhen Univ, Coll Informat Engn, Shenzhen
518060, Guangdong, Peoples R China.
[Xie, Ning] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples
R China.
[Liu, Zhaorong] Zhuhai First Vocat Sch, Zhuhai 519000, Guangdong, Peoples R China.
通讯作者地址: Wang, H (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Guangdong, Peoples R
China.
电子邮件地址: wanghsz@szu.edu.cn
第 144 条，共 274 条
标题: Association-Based Active Access Control models with balanced scalability and flexibility
作者: Zhai, ZN (Zhai Zhi-nian); Lu, YH (Lu Ya-hui); Zhang, PJ (Zhang Ping-Jian); Chen, ZH (Chen Zhi-hao)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In existing Active Access Control (MC) models, the scalability and flexibility of security policy specification should
be well balanced, especially: (1) authorizations to plenty of tasks should be simplified; (2) team workflows should be
enabled; (3) fine-grained constraints should be enforced. To address this issue, a family of Association-Based Active Access
Control (ABAAC) models is proposed. In the minimal model ABAAC(0), users are assigned to roles while permissions are
assigned to task-role associations. In a workflow case, to execute such an association some users assigned to its component
role will be allocated. The association's assigned permissions can be performed by them during the task is running in the
case. In ABAAC(1), a generalized association is employed to extract common authorizations from multiple associations. In
ABAAC(2), a fine-grained separation of duty (SoD) is enforced among associations. In the maximal model ABAAC(3), all
these features are integrated, and similar constraints can be specified more concisely. Using a software workflow, case
validation is performed. Comparison with a representative association based MC model and the most scalable MC model so
far indicates that: (1) enough scalability is achieved; (2) without decomposition of a task, different permissions can be
authorized to multiple roles in it; (3) separation of more fine-grained duties than roles and tasks can be enforced. (C) 2013
Elsevier B.V. All rights reserved.
地址: [Zhai Zhi-nian] Zhejiang Univ Sci & Technol, Sch Informat & Elect Engn, Hangzhou, Zhejiang, Peoples R China.
[Lu Ya-hui] Shenzhen Univ, Sch Comp & Software, Shenzhen, Peoples R China.
[Zhang Ping-Jian] S China Univ Technol, Sch Comp Sci & Engn, Guangzhou, Guangdong, Peoples R China.
[Chen Zhi-hao] Univ So Calif, Ctr Software Engn, Los Angeles, CA USA.
通讯作者地址: Zhai, ZN (通讯作者),Zhejiang Univ Sci & Technol, Sch Informat & Elect Engn, Hangzhou, Zhejiang,
Peoples R China.
电子邮件地址: zhaizhinian@gmail.com
第 145 条，共 274 条
标题: Increasing the reliability of protein-protein interaction networks via non-convex semantic embedding
作者: Zhu, L (Zhu, Lin); You, ZH (You, Zhu-Hong); Huang, DS (Huang, De-Shuang)
Web of Science 核心合集中的 "被引频次": 4
被引频次合计: 4
摘要: Over the last decade, the development of high-throughput techniques has resulted in a rapid accumulation of
protein-protein interaction (PPI) data. However, the high-throughput experimental interaction data is prone to exhibit high
level of noise. Despite the promising performance of current geometric approaches for increasing the reliability of PPI
networks, it is still of major concern to find a better method that requires less structural assumptions and is more robust
against the large fraction of noisy PPIs. In this paper, we propose a new approach called non-convex semantic embedding
(NCSE) for assessing the reliability of interactions. Unlike previous approaches which seek to preserve a predefined
distance matrix in the embedding space, NCSE tries to adaptively learn a Euclidean embedding under the simple geometric
assumption of PPI networks. We also propose using non-convex cost function in order to improve the robustness of NCSE.
The experimental results show that our approach substantially outperforms previous methods on PPI assessment problems.
NCSE could thus facilitate further graph-based studies of PPIs and may help infer their hidden underlying biological
knowledge. The Matlab source code of NCSE is freely available upon request. (C) 2013 Elsevier B.V. All rights reserved.
地址: [Zhu, Lin; Huang, De-Shuang] Tongji Univ, Sch Elect & Informat Engn, Shanghai 201804, Peoples R China.
[You, Zhu-Hong] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Guangdong, Peoples R China.
通讯作者地址: Huang, DS (通讯作者),Tongji Univ, Sch Elect & Informat Engn, 4800 Caoan Rd, Shanghai 201804,
Peoples R China.
电子邮件地址: zhomlynn@yahoo.com.cn; dshuang@tongji.edu.cn
第 146 条，共 274 条
标题: hJam: Attachment Transmission in WLANs
作者: Wu, KS (Wu, Kaishun); Li, HC (Li, Haochao); Wang, L (Wang, Lu); Yi, YW (Yi, Youwen); Liu, YH (Liu,
Yunhuai); Chen, DH (Chen, Dihu); Luo, XN (Luo, Xiaonan); Zhang, Q (Zhang, Qian); Ni, LM (Ni, Lionel M.)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 2
摘要: Effective coordination can dramatically reduce radio interference and avoid packet collisions for multistation wireless
local area networks (WLANs). Coordination itself needs consume communication resource and thus competes with data
transmission for the limited wireless radio resources. In traditional approaches, control frames and data packets are
transmitted in an alternate manner, which brings a great deal of coordination overhead. In this paper, we propose a new
communication model where the control frames can be "attached" to the data transmission. Thus, control messages and data
traffic can be transmitted simultaneously and consequently the channel utilization can be improved significantly. We
implement the idea in OFDM-based WLANs called hJam, which fully explores the physical layer features of the OFDM
modulation method and allows one data packet and a number of control messages to be transmitted together. hJam is
implemented on the GNU Radio testbed consisting of eight USRP2 nodes. We also conduct comprehensive simulations and
the experimental results show that hJam can improve the WLANs efficiency by up to 200 percent compared with the
existing 802.11 family protocols.
地址: [Wu, Kaishun] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Wu, Kaishun] Guangzhou Fok Ying Tung Res Inst, Guangzhou, Guangdong, Peoples R China.
[Li, Haochao; Wang, Lu; Yi, Youwen; Zhang, Qian; Ni, Lionel M.] Hong Kong Univ Sci & Technol, HKUST Fok Ying
Tung Grad Sch, Dept Comp Sci & Engn, Hong Kong, Hong Kong, Peoples R China.
[Chen, Dihu] Sun Yat Sen Univ, Sch Phys & Engn, Guangzhou 510006, Guangdong, Peoples R China.
[Luo, Xiaonan] Sun Yat Sen Univ, Sch Informat Sci & Technol, State Prov Joint Lab Digital Home Interact Applic, Natl
Engn Res Ctr Digital Life, Guangzhou 510006, Guangdong, Peoples R China.
通讯作者地址: Wu, KS (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
电子邮件地址: kwinson@ust.hk; stevenli@ust.hk; wanglu@ust.hk; euwen.17@gmail.com; yunhuai.liu@gmail.com;
stscdh@mail.sysu.edu.cn; lnslxn@mail.sysu.edu.cn; qianzh@cse.ust.hk; ni@cse.ust.hk
第 147 条，共 274 条
标题: Parallel structure-aware halftoning
作者: Wu, HS (Wu, Huisi); Wong, TT (Wong, Tien-Tsin); Heng, PA (Heng, Pheng-Ann)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: Structure-aware halftoning technique is one of the state-of-the-art algorithms for generating structure-preserving
bitonal images. However, the slow optimization process prohibits its real-time application. This is due to its high
computational cost of similarity measurement and iterative refinement. Unfortunately, the structure-aware halftoning cannot
be straightforwardly parallelized due to its data dependency nature. In this paper, we propose a parallel algorithm to boost
the optimization of the structure-aware halftoning. Our main idea is to exploit the spatial independence during the
evaluation of the objective function and temporal independence among the iterations. Specifically, we introduce a parallel
Poisson-disk algorithm during the selection of pixel swaps, which guarantees the independency between parallel processes.
Graphics processing unit (GPU) implementation of the technique leads to a significant speedup without sacrificing the
quality. Our experiments demonstrate the effectiveness of the proposed parallel algorithm in generating structure-preserving
bitonal images with much less time, especially for large images.
地址: [Wu, Huisi] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Wong, Tien-Tsin; Heng, Pheng-Ann] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Shatin, Hong Kong, Peoples R
China.
通讯作者地址: Wu, HS (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, 364 Adm Bldg, Shenzhen, Peoples
R China.
电子邮件地址: hswu@szu.edu.cn
第 148 条，共 274 条
标题: Clustering scheduling for hardware tasks in reconfigurable computing systems
作者: Chen, Z (Chen, Zhi); Qiu, MK (Qiu, Meikang); Ming, Z (Ming, Zhong); Yang, LT (Yang, Laurence T.); Zhu, YX
(Zhu, Yongxin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Reconfigurable computing systems have been used widely in various areas due to their attractive features in
low-power and high-precision. However, how to increase utilization and throughput while reducing configuration and
execution time overheads on large-scale data has become a great challenge for reconfigurable computing systems. In this
paper, we employ a directed acyclic graph (DAG) to represent the tasks in an application. With considerations of task
dependencies and resource constraints that are not sufficiently studied in literature, we propose two clustering scheduling
strategies to reduce the number of configurations and the execution time of applications, while enhancing the utilization of
field programmable gate array (FPGA) devices: One is a heuristic scheduling strategy and the other is a dynamic
programming scheduling strategy. Experimental results indicate that our dynamic programming scheduling strategy can
significantly reduce the number of configurations and improve the FPGA utilization, compared to the heuristic scheduling
strategy. (C) 2013 Elsevier B.V. All rights reserved.
地址: [Chen, Zhi; Qiu, Meikang] Univ Kentucky, Dept Elect & Comp Engn, Lexington, KY 40505 USA.
[Chen, Zhi; Ming, Zhong] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, GD, Peoples R China.
[Yang, Laurence T.] St Francis Xavier Univ, Dept Comp Sci, Antigonish, NS B2G 2W5, Canada.
[Zhu, Yongxin] Shanghai Jiao Tong Univ, Sch Microelect, Shanghai 200240, Peoples R China.
通讯作者地址: Ming, Z (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, GD, Peoples R
China.
电子邮件地址: zch229@uky.edu; mqiu@engr.uky.edu; mingz@szu.edu.cn; ltyang@gmail.com;
zhuyongxin@ic.sjtu.edu.cn
第 149 条，共 274 条
标题: Efficient block-wise independent component analysis with optimal learning rate
作者: Lin, YD (Lin, Yue-Der); Hsu, CY (Hsu, Chih-Yu); Chen, HY (Chen, Hung-Yun); Tseng, KK (Tseng, Kuo-Kun)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: Independent component analysis (ICA) is a potential solution for blind source separation (BSS) problems and has
proven to be effective in many practical applications. One major drawback for ICA algorithms is its heavy computation load
which is especially deteriorated in long-term signals. To solve this problem, the block-wise approach is proposed to
improve the computational efficiency in this study. As ambiguities of variances and order of the separated components exist
for ICA algorithms, signal reconstruction is an issue for block-wise approach. In this study, correlation coefficients (CC) of
the short-term Fourier transform (STFT) among those acquired from the neighboring blocks are adopted for order
permutation and phase correction of the separated signals. The weights of the separated signals are then normalized by the
maximum amplitude of the corresponding one in previous block to avoid the variance ambiguity. Two robust ICA
algorithms based on iterative matrix inversion approach, one with fixed nonlinear functions whereas another one with
flexibly selected nonlinear functions, are implemented in both batch and block-wise processing for performance evaluation.
Linearly mixed biopotential signals (ECG and EMG) and 60-Hz sinusoid are incorporated for the experiments. The results
reveal that the proposed block-wise approach can attain the desired requirements in a more efficient way without loss of the
separation performance. The proposed approach may be a potential tool for which the computational efficiency is an
important issue. (C) 2013 Elsevier B.V. All rights reserved.
地址: [Lin, Yue-Der; Chen, Hung-Yun] Feng Chia Univ, Dept Automat Control Engn, Taichung 40724, Taiwan.
[Lin, Yue-Der] Feng Chia Univ, Masters Program Biomed Informat & Biomed Engn, Taichung 40724, Taiwan.
[Hsu, Chih-Yu] ChaoYang Univ Technol, Dept Informat & Commun Engn, Taichung, Taiwan.
[Tseng, Kuo-Kun] ShenZhen Univ, Harbin Inst Technol, Shenzhen Grad Sch, Dept Comp Sci & Technol, Shenzhen,
Peoples R China.
通讯作者地址: Hsu, CY (通讯作者),ChaoYang Univ Technol, Dept Informat & Commun Engn, Taichung, Taiwan.
电子邮件地址: ydlin@fcu.edu.tw; tccnchsu@gmail.com; chy0720@gmail.com; kktseng@hitsz.edu.cn
第 150 条，共 274 条
标题: AN ALOHA-BASED IMPROVED ANTI-COLLISION ALGORITHM FOR RFID SYSTEMS
作者: He, YJ (He, Yejun); Wang, XY (Wang, Xiaoye)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 1
摘要: Tag collision arbitration is considered as one of the critical issues in RFID system design. In order to further improve
the identification efficiency of tag anti-collision algorithms in RFID systems, several types of dynamic framed slotted
ALOHA (DFSA) anti-collision algorithms are analyzed, and a new anti-collision algorithm is proposed. The proposed
algorithm has the ability of identifying the time slot distribution which is selected by the tags within a reader's interrogation
range in advance. Then the free time slots will be skipped when the reader queries each time slot. Also, the colliding tags
will be immediately processed with additional time slots. Simulation results show that the proposed algorithm takes fewer
total number of time slots and has a higher efficiency of tag identification compared to the other four DFSA anti-collision
algorithms.
地址: [He, Yejun; Wang, Xiaoye] Shenzhen Univ, Shenzhen, Peoples R China.
通讯作者地址: He, YJ (通讯作者),Shenzhen Univ, Shenzhen, Peoples R China.
电子邮件地址: heyejun@126.com; wangxiaoye2013@126.com
第 151 条，共 274 条
标题: A sequential GM-based PHD filter for a linear Gaussian system
作者: Liu, ZX (Liu ZongXiang); Xie, WX (Xie WeiXin); Wang, P (Wang Pin); Yu, Y (Yu You)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 5
摘要: The probability hypothesis. density (PHD) filter provides an efficiently parallel processing method for multi-target
tracking. However, measurements have to be gathered for a scan period before the PHD filter can perform a recursion,
therefore, significant delay may arise if the scan period is long. To reduce the delay in the PHD filter, we propose a
sequential PHD filter which updates the posterior intensity whenever a new measurement becomes available. An
implementation of the sequential PHD filter for a linear Gaussian system is also developed. The unique characteristic of the
proposed filter is that it can retain the useful information of missed targets in the posterior intensity and sequentially handle
the received measurements in time.
地址: [Liu ZongXiang; Xie WeiXin; Wang Pin; Yu You] Shenzhen Univ, ATR Key Lab, Shenzhen 518060, Peoples R
China.
通讯作者地址: Liu, ZX (通讯作者),Shenzhen Univ, ATR Key Lab, Shenzhen 518060, Peoples R China.
电子邮件地址: zongxiangliu@sohu.com
第 152 条，共 274 条
标题: Is local dominant orientation necessary for the classification of rotation invariant texture?
作者: Guo, ZH (Guo, Zhenhua); Li, Q (Li, Qin); Zhang, L (Zhang, Lin); You, J (You, Jane); Zhang, D (Zhang, David); Liu,
WH (Liu, Wenhuang)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 3
摘要: Extracting local rotation invariant features is a popular method for the classification of rotation invariant texture. To
address the issue of local rotation invariance, many algorithms based on anisotropic features were proposed. Usually a
dominant orientation is found out first, and then anisotropic feature is extracted by this orientation. To validate whether
local dominant orientation is necessary for the classification of rotation invariant texture, in this paper, two isotropic
statistical texton based methods are proposed. These two methods are the counterparts of two state-of-the-art anisotropic
texton based methods: maximum response 8 (MR8) and gray value image patch. Experimental results on three public
databases show that local dominant orientation plays an important role when the training set is less; when training samples
are enough, local dominant orientation may not be necessary. (C) 2012 Elsevier B.V. All rights reserved.
地址: [Guo, Zhenhua; Liu, Wenhuang] Tsinghua Univ, Grad Sch Shenzhen, Shenzhen Key Lab Broadband Network &
Multimedia, Shenzhen 518057, Peoples R China.
[Li, Qin] Shenzhen Univ, Coll Phys Sci & Technol, Shenzhen Key Lab Sensor Technol, Shenzhen, Peoples R China.
[Zhang, Lin] Tongji Univ, Sch Software Engn, Shanghai 200092, Peoples R China.
[You, Jane; Zhang, David] Hong Kong Polytech Univ, Dept Comp, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Li, Q (通讯作者),Shenzhen Univ, Coll Phys Sci & Technol, Shenzhen Key Lab Sensor Technol, Shenzhen,
Peoples R China.
电子邮件地址: zhenhua.guo@sz.tsinghua.edu.cn; Kenneth_lee_qin@gmail.com; csyjia@comp.polyu.edu.hk
第 153 条，共 274 条
标题: Multi-objective bacterial foraging optimization
作者: Niu, B (Niu, Ben); Wang, H (Wang, Hong); Wang, JW (Wang, Jingwen); Tan, LJ (Tan, Lijing)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 4
摘要: This paper describes a novel Bacterial Foraging Optimization (BFO) approach to multi-objective optimization, called
Multi-objective Bacterial Foraging Optimization (MBFO). The objectives in the Multi-objective Bacterial Foraging
Optimization are maintained by a fitness survive mechanism. Bacteria with the smaller health values have the better chance
to survive. Meanwhile, the main goal of multi-objective optimization problems is to obtain a superior non-dominated front
which is closed to the true Pareto front. With identification of such features, the idea of integration between health sorting
approach and pareto dominance mechanism are developed to search for Pareto-optimal set of problems. Moreover, strategy
keeping a certain unfeasible border solutions based on a given probability is considered to improve the diversity of
individuals. In addition, two different performance metrics: Diversity and Generational Distance are introduced as well to
evaluate multi-objective optimization problems. Compared to two other multi-objective optimization evolutionary
algorithms MOPSO and NSGA-II, simulation results show that in most cases, the proposed MBFO is able to find a much
better spread of solutions and convergence to the true Pareto-optimal front faster. It suggests that MBFO is very promising
in dealing with ordinary multi-objective optimization problems. (C) 2012 Elsevier B.V. All rights reserved.
地址: [Niu, Ben; Wang, Hong; Wang, Jingwen] Shenzhen Univ, Coll Management, Shenzhen 518060, Peoples R China.
[Niu, Ben] Chinese Acad Sci, Hefei Inst Intelligent Machines, Hefei 230031, Peoples R China.
[Niu, Ben] Univ Hong Kong, E Business Technol Inst, Hong Kong, Hong Kong, Peoples R China.
[Tan, Lijing] Jinan Univ, Coll Management, Guangzhou, Guangdong, Peoples R China.
通讯作者地址: Niu, B (通讯作者),Shenzhen Univ, Coll Management, Nanhai Ave 3688, Shenzhen 518060, Peoples R
China.
电子邮件地址: drniuben@gmail.com
第 154 条，共 274 条
标题: Elastic image registration using hierarchical spatially based mean shift
作者: Yang, X (Yang, Xuan); Pei, JH (Pei, Jihong); Sun, W (Sun, Wei)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 3
摘要: In this paper, a novel estimation technique for corresponding points using a hierarchical, spatially based mean shift
algorithm is proposed. We proposed a spatially based probability estimation using different spatial masks. For a given point
on reference image, its corresponding register point is found along the search trajectory generated by optimizing
Bhattacharyya coefficient between two windows centered at the points on the register and reference images. The outliers are
further eliminated by analyzing statistical information on the displacements of the candidate register points. Experiments on
various monomodal medical images show that the proposed method is feasible and fast. (C) 2013 Published by Elsevier Ltd.
地址: [Yang, Xuan] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
[Pei, Jihong] Shenzhen Univ, Coll Informat & Engn, Shenzhen 518060, Peoples R China.
[Sun, Wei] Erasmus MC, Dept Radiol, NL-3000 CA Rotterdam, Netherlands.
[Sun, Wei] Erasmus MC, Dept Med Informat, NL-3000 CA Rotterdam, Netherlands.
通讯作者地址: Yang, X (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R
China.
电子邮件地址: pdwxyang@263.net
第 155 条，共 274 条
标题: Blind Known Interference Cancellation
作者: Zhang, SL (Zhang, Shengli); Liew, SC (Liew, Soung-Chang); Wang, H (Wang, Hui)
Web of Science 核心合集中的 "被引频次": 6
被引频次合计: 6
摘要: This paper investigates interference-cancellation schemes at the receiver, in which the interference data, which is
valid data intended for another receiver, is known a priori. The interference channel, however, is unknown (the blind part).
Such a priori knowledge is common in wireless relay networks. For example, a relay could be relaying data that was
previously transmitted by a node A. If node A is now receiving a signal from another node B, the interference from the relay
is actually self-information known to node A. Besides the case of self-information, the node could also have overheard or
received the interference data in a prior transmission by another node. Directly removing the known interference requires
accurate estimate of the interference channel, which may be difficult in many situations. In this paper, we propose a novel
scheme, Blind Known-Interference Cancellation (BKIC), to cancel known interference without interference channel
information. BKIC consists of two steps. The first step combines adjacent symbols to cancel the interference, exploiting the
fact that the channel coefficients are almost the same between successive symbols. After such interference cancellation,
however, the signal of interest is distorted. The second step recovers the signal of interest amidst the distortion. We propose
two algorithms for the critical second steps. The first algorithm (BKIC-S) is based on the principle of smoothing. It is
simple and has near optimal performance in the slow fading scenario. The second algorithm (BKIC-RBP) is based on the
principle of real-valued belief propagation. Since there is no loop in the Tanner graph, BKIC-RBP can achieve
MAP-optimal performance with fast convergence, and has near interference-free performance even in the fast fading
scenario. Both BKIC schemes outperform the traditional self-interference cancellation schemes that have perfect initial
channel information by a large margin, while having lower complexities.
地址: [Zhang, Shengli; Wang, Hui] Shenzhen Univ, Shenzhen MCSP Key Lab, Dept Commun Engn, Shenzhen, Peoples R
China.
[Liew, Soung-Chang] Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Zhang, SL (通讯作者),Shenzhen Univ, Shenzhen MCSP Key Lab, Dept Commun Engn, Shenzhen,
Peoples R China.
电子邮件地址: slzhang.szu@gmail.com; wanghsz@gmail.com
第 156 条，共 274 条
标题: Security-aware optimization for ubiquitous computing systems with SEAT graph approach
作者: Qiu, MK (Qiu, Meikang); Zhang, L (Zhang, Lei); Ming, Z (Ming, Zhong); Chen, Z (Chen, Zhi); Qin, X (Qin, Xiao);
Yang, LT (Yang, Laurence T.)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 2
摘要: For ubiquitous computing systems, security has become a new metric that designers should consider throughout the
design process, along with other metrics such as performance and energy consumption. A combination of selected
cryptographic algorithms for required security services forms a security strategy for the application. In this paper, we
propose methods to generate security strategies to achieve the maximal overall security strength while meeting the real-time
constraint. In order to express security requirements of an application, we propose a novel graph model called
Security-Aware Task (SEAT) graph model to represent real-time constraints and precedence relationships among tasks.
Based on the SEAT graph approach, we propose an optimal algorithm, Integer Linear Programming Security Optimization
(ILP-SOP). For the special structures such as simple path graph and tree, we, propose two dynamic programming based
algorithms (DPSOP-path/tree) to generate the optimal security strategy. Experiment results demonstrate the correctness and
efficiency of our proposed method. The experimental results show that, by using our proposed techniques, the security
strength can be improved by 44.3% on average. (C) 2012 Elsevier Inc. All rights reserved.
地址: [Qiu, Meikang; Chen, Zhi] Univ Kentucky, Dept Elec & Comp Engr, Lexington, KY 40506 USA.
[Zhang, Lei] Univ Texas Dallas, Dept Comp Sci, Richardson, TX 75083 USA.
[Ming, Zhong] Shenzhen Univ, Coll Comp Sci & Software Engr, Shenzhen 518060, GD, Peoples R China.
[Qin, Xiao] Auburn Univ, Dept Comp Sci & Software Engr, Auburn, AL 36849 USA.
[Yang, Laurence T.] St Francis Xavier Univ, Dept Comp Sci, Antigonish, NS B2G 2W5, Canada.
通讯作者地址: Ming, Z (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engr, Shenzhen 518060, GD, Peoples R
China.
电子邮件地址: mqiu@engr.uky.edu; doczhanglei@hotmail.com; mingz@szu.edu.cn; zch229@uky.edu; xqin@auburn.edu;
ltyang@gmail.com
第 157 条，共 274 条
标题: Maximum Multiflow in Wireless Network Coding
作者: Zhou, JY (Zhou, Jinyi); Xia, ST (Xia, Shutao); Jiang, Y (Jiang, Yong); Zheng, HT (Zheng, Haitao); Cui, LZ (Cui,
Laizhong)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In a multihop wireless network, wireless interference is a crucial factor in the maximum multiflow (MMF) problem,
which studies the maximum throughput between multiple pairs of sources and sinks with a link schedule to support it. In
this paper, we observe that network coding could help to decrease the impact of wireless interference, and thus propose a
framework to study the MMF problem for multihop wireless networks with network coding. Firstly, a network model is
established to describe the new conflict relations and schedulability modified by network coding. Next, we formulate the
MMF problem to compute the maximum throughput of multiple unicast flows supported by the multihop wireless network
with network coding, and show that its capacity region could be enlarged by performing network coding. Finally, we show
that determining the capacity region of a multihop wireless network with network coding is an NP-hard problem, and thus
propose a greedy heuristic algorithm, called coding-first collecting (CFC), to determine a capacity subregion of the network.
We also show that finding an optimal hyperarc schedule to meet a given link demand function is NP-hard, and propose a
polynomial algorithm, called coding-first scheduling (CFS), to find an approximate fractional hyperarc schedule in the
multihop wireless network with network coding. A numerical analysis of a grid wireless network and a random wireless
network is presented to demonstrate the efficiencies of the CFC algorithm and the CFS algorithm based on the framework.
地址: [Zhou, Jinyi; Xia, Shutao; Jiang, Yong; Zheng, Haitao] Tsinghua Univ, Grad Sch Shenzhen, Shenzhen 518055,
Peoples R China.
[Cui, Laizhong] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Zhou, JY (通讯作者),Tsinghua Univ, Grad Sch Shenzhen, Shenzhen 518055, Peoples R China.
电子邮件地址: xiast@sz.tsinghua.edu.cn
第 158 条，共 274 条
标题: 1-0-1 Cascaded Sigma-Delta Modulator with Internal Feedback
作者: Xie, N (Xie, Ning); Zhang, Y (Zhang, Yu); Wang, H (Wang, Hui)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: The conventional sigma-delta modulators, such as L-0 MASH and inter-stage feedback topology, have some main
drawbacks, e.g. L-0 MASH can only be applied in single loop topology and dynamic range is its big problem, and
inter-stage feedback topology only cancels nonlinear errors introducing by multi-bit DAC in the final stage, but the rest
stages still contain DAC nonlinearity errors without any noise shaping which still degrade overall system performance. In
this letter, an improved version of cascaded multi-bit sigma-delta modulator is proposed to overcome these problems
mentioned above. Simulation results will verify the superiority of the proposed modulator.
地址: [Xie, Ning; Zhang, Yu; Wang, Hui] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Guangdong, Peoples R
China.
通讯作者地址: Xie, N (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Guangdong, Peoples R China.
电子邮件地址: kensouren@yahoo.com.cn
第 159 条，共 274 条
标题: Optimizing green production strategies: An integrated approach
作者: Zhou, M (Zhou, Ming); Pan, YC (Pan, Yanchun); Chen, ZM (Chen, Zhimin); Yang, W (Yang, Wei)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 3
摘要: Selection of green production strategy is a critical but difficult task due to the fact that it affects not only green
benefits, but also production economy. The problem is essentially multi-objective and involves dynamic and uncertain
conditions. This study focused on an integrated approach to improve the analysis and facilitate decision-making process.
Discrete-event simulation model was developed to capture production flow and decision logic under real world conditions.
A multi-objective genetic algorithm (MOGA), combined with improving heuristics, was developed to search the best
solutions (Pareto optimums). The two modules are integrated to work in evolutionary cycles to achieve the optimization.
Experiments were designed and carried out via a prototype system developed to verify and validate proposed concepts,
including sensitivity analysis of related model parameters. (C) 2013 Elsevier Ltd. All rights reserved.
地址: [Zhou, Ming; Pan, Yanchun; Chen, Zhimin; Yang, Wei] Shenzhen Univ, Shenzhen, Guangdong, Peoples R China.
[Zhou, Ming] Indiana State Univ, Ctr Syst Modeling & Simulat, Terre Haute, IN 47809 USA.
通讯作者地址: Pan, YC (通讯作者),Shenzhen Univ, Shenzhen, Guangdong, Peoples R China.
电子邮件地址: mzhou@szu.edu.cn; panyc@szu.edu.cn
第 160 条，共 274 条
标题: Study of Magnetic Field Coupling Technologies in Activating RFID-SIM Card Mobile Payments
作者: He, YJ (He, Yejun)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: In this paper, we propose a RFID (Radio-frequency Identification)-SIM card mobile payment scheme and study the
magnetic field coupling technologies in activating the payments for the second generation readers. Simulation results show
that the mobile payment scheme based on a low-frequency magnetic-coupling activation strategy is reasonable, secured,
robust, low-cost, and easy to promote. The performance of various mobile phones integrated with the RFID-SIM cards is
very similar under the proposed activation strategy. The activation distances between various mobiles and the readers are
very consistent. When high-frequency magnetic coupling is used, however, the performance of different mobile phones
shows great difference because of the small attenuation factor.
地址: Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: He, YJ (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: heyejun@126.com
第 161 条，共 274 条
标题: Visual Analysis of Set Relations in a Graph
作者: Xu, PP (Xu, Panpan); Du, F (Du, Fan); Cao, N (Cao, Nan); Shi, CL (Shi, Conglei); Zhou, H (Zhou, Hong); Qu, HM
(Qu, Huamin)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 2
摘要: Many applications can be modeled as a graph with additional attributes attached to the nodes. For example, a graph
can be used to model the relationship of people in a social media website or a bibliographical dataset. Meanwhile, additional
information is often available, such as the topics people are interested in and the music they listen to. Based on this
additional information, different set relationships may exist among people. Revealing the set relationships in a network can
help people gain social insight and better understand their roles within a community. In this paper, we present a
visualization system for exploring set relations in a graph. Our system is designed to reveal three different relationships
simultaneously: the social relationship of people, the set relationship among people's items of interest, and the similarity
relationship of the items. We propose two novel visualization designs: a) a glyph-based visualization to reveal people's set
relationships in the context of their social networks; b) an integration of visual links and a contour map to show people and
their items of interest which are clustered into different groups. The effectiveness of the designs has been demonstrated by
the case studies on two representative datasets including one from a social music service website and another from an
academic collaboration network.
Categories and Subject Descriptors (according to ACM CCS): H. 5.2 [Information Interfaces and Presentations]: User
Interfaces-Graphical user interfaces (GUI)
地址: [Xu, Panpan; Shi, Conglei; Qu, Huamin] Hong Kong Univ Sci & Technol, Hong Kong, Hong Kong, Peoples R
China.
[Du, Fan] Zhejiang Univ, Hangzhou, Zhejiang, Peoples R China.
[Cao, Nan] IBM Corp, TJ Watson Res Ctr, Armonk, NY 10504 USA.
[Zhou, Hong] Shenzhen Univ, Shenzhen, Peoples R China.
通讯作者地址: Xu, PP (通讯作者),Hong Kong Univ Sci & Technol, Hong Kong, Hong Kong, Peoples R China.
第 162 条，共 274 条
标题: Robust and secure watermarking scheme for breath sound
作者: Lei, BY (Lei, Baiying); Song, IS (Song, Insu); Rahman, SA (Rahman, Shah Atiqur)
Web of Science 核心合集中的 "被引频次": 7
被引频次合计: 8
摘要: Due to the development of the Internet, security and intellectual property protection have attracted significant interest
in the copyright protection field recently. A novel watermarking scheme for breath sounds, combining lifting wavelet
transform (LWT), discrete cosine transform (DCT), singular value decomposition (SVD) and dither modulation (DM)
quantization is proposed in this paper as a way to insert encrypted source and identity information in breath sounds while
maintaining significant biological signals. In the proposed scheme, LWT is first performed to decompose the signal, and
then DCT is applied on the approximate coefficients. SVD is carried out on the LWT-DCT coefficients to derive singular
values. DM is adopted to quantize the singular values of each of the LWT-DCT blocks; thus, the watermark extraction is
blind by using the DM algorithm. The novelty of our proposed method also includes the introduction of the particle swarm
optimization (PSO) technique to optimize the quantization steps for the DM approach. The experimental results demonstrate
that the proposed watermarking scheme obtains good robustness against common manipulation attacks and preserves
imperceptivity. The performance comparison results verify that our scheme outperforms existing approaches in terms of
robustness and imperceptibility. (C) 2013 Elsevier Inc. All rights reserved.
地址: [Lei, Baiying; Song, Insu; Rahman, Shah Atiqur] James Cook Univ Australia, Sch Business IT, Singapore,
Singapore.
[Lei, Baiying] Shenzhen Univ, Guangdong Key Lab Biomed Measurements & Ultrasoun, Dept Biomed Engn, Sch Med,
Shenzhen 518060, Peoples R China.
通讯作者地址: Lei, BY (通讯作者),James Cook Univ Australia, Sch Business IT, Singapore, Singapore.
电子邮件地址: leiby666@gmail.com; insu.song@jcu.edu.au; atiqur.rahman@jcu.edu.au
第 163 条，共 274 条
标题: A novel micro-population immune multiobjective optimization algorithm
作者: Lin, QZ (Lin, Qiuzhen); Chen, JY (Chen, Jianyong)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 4
摘要: In this paper, we present a novel immune multiobjective optimization algorithm based on micro-population, which
adopts a novel adaptive mutation operator for local search and an efficient fine-grained selection operator for archive
update. With the external archive for storing nondominated individuals, the population diversity can be well preserved using
an efficient fine-grained selection procedure performed on the micro-population. The adaptive mutation operator is
executed according to the fitness values, which promotes to use relatively large steps for boundary and less-crowded
individuals in high probability. Therefore, the exploratory capabilities are enhanced. When comparing the proposed
algorithm with a recently proposed immune multiobjective algorithm and a scatter search multiobjective algorithm in
various benchmark functions, simulations show that the proposed algorithm not only improves convergence ability but also
preserves population diversity adequately in most cases. (C) 2011 Elsevier Ltd. All rights reserved.
地址: [Lin, Qiuzhen] City Univ Hong Kong, Dept Elect Engn, Kowloon Tong, Hong Kong, Peoples R China.
[Chen, Jianyong] Shenzhen Univ, Dept Comp Sci & Technol, Shenzhen 518060, Peoples R China.
通讯作者地址: Chen, JY (通讯作者),Shenzhen Univ, Dept Comp Sci & Technol, Shenzhen 518060, Peoples R China.
电子邮件地址: qiuzhlin@student.cityu.edu.hk; jychen@szu.edu.cn
第 164 条，共 274 条
标题: Biomimicry of quorum sensing using bacterial lifecycle model
作者: Niu, B (Niu, Ben); Wang, H (Wang, Hong); Duan, QQ (Duan, Qiqi); Li, L (Li, Li)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Background: Recent microbiologic studies have shown that quorum sensing mechanisms, which serve as one of the
fundamental requirements for bacterial survival, exist widely in bacterial intra-and inter-species cell-cell communication.
Many simulation models, inspired by the social behavior of natural organisms, are presented to provide new approaches for
solving realistic optimization problems. Most of these simulation models follow population-based modelling approaches,
where all the individuals are updated according to the same rules. Therefore, it is difficult to maintain the diversity of the
population.
Results: In this paper, we present a computational model termed LCM-QS, which simulates the bacterial quorum-sensing
(QS) mechanism using an individual-based modelling approach under the framework of Agent-Environment-Rule (AER)
scheme, i.e. bacterial lifecycle model (LCM). LCM-QS model can be classified into three main sub-models: chemotaxis
with QS sub-model, reproduction and elimination sub-model and migration sub-model. The proposed model is used to not
only imitate the bacterial evolution process at the single-cell level, but also concentrate on the study of bacterial
macroscopic behaviour. Comparative experiments under four different scenarios have been conducted in an artificial 3-D
environment with nutrients and noxious distribution. Detailed study on bacterial chemotatic processes with quorum sensing
and without quorum sensing are compared. By using quorum sensing mechanisms, artificial bacteria working together can
find the nutrient concentration (or global optimum) quickly in the artificial environment.
Conclusions: Biomimicry of quorum sensing mechanisms using the lifecycle model allows the artificial bacteria endowed
with the communication abilities, which are essential to obtain more valuable information to guide their search
cooperatively towards the preferred nutrient concentrations. It can also provide an inspiration for designing new swarm
intelligence optimization algorithms, which can be used for solving the real-world problems.
地址: [Niu, Ben; Wang, Hong; Duan, Qiqi; Li, Li] Shenzhen Univ, Coll Management, Shenzhen 518060, Peoples R China.
[Niu, Ben] Hong Kong Polytech Univ, Dept Ind & Syst Engn, Hong Kong, Hong Kong, Peoples R China.
[Niu, Ben] Chinese Acad Sci, Hefei Inst Intelligent Machines, Hefei 230031, Peoples R China.
通讯作者地址: Niu, B (通讯作者),Shenzhen Univ, Coll Management, Shenzhen 518060, Peoples R China.
电子邮件地址: drniuben@gmail.com
第 165 条，共 274 条
标题: Prediction of protein-protein interactions from amino acid sequences with ensemble extreme learning machines and
principal component analysis
作者: You, ZH (You, Zhu-Hong); Lei, YK (Lei, Ying-Ke); Zhu, L (Zhu, Lin); Xia, JF (Xia, Junfeng); Wang, B (Wang,
Bing)
Web of Science 核心合集中的 "被引频次": 13
被引频次合计: 13
摘要: Background: Protein-protein interactions (PPIs) play crucial roles in the execution of various cellular processes and
form the basis of biological mechanisms. Although large amount of PPIs data for different species has been generated by
high-throughput experimental techniques, current PPI pairs obtained with experimental methods cover only a fraction of the
complete PPI networks, and further, the experimental methods for identifying PPIs are both time-consuming and expensive.
Hence, it is urgent and challenging to develop automated computational methods to efficiently and accurately predict PPIs.
Results: We present here a novel hierarchical PCA-EELM (principal component analysis-ensemble extreme learning
machine) model to predict protein-protein interactions only using the information of protein sequences. In the proposed
method, 11188 protein pairs retrieved from the DIP database were encoded into feature vectors by using four kinds of
protein sequences information. Focusing on dimension reduction, an effective feature extraction method PCA was then
employed to construct the most discriminative new feature set. Finally, multiple extreme learning machines were trained
and then aggregated into a consensus classifier by majority voting. The ensembling of extreme learning machine removes
the dependence of results on initial random weights and improves the prediction performance.
Conclusions: When performed on the PPI data of Saccharomyces cerevisiae, the proposed method achieved 87.00%
prediction accuracy with 86.15% sensitivity at the precision of 87.59%. Extensive experiments are performed to compare
our method with state-of-the-art techniques Support Vector Machine (SVM). Experimental results demonstrate that
proposed PCA-EELM outperforms the SVM method by 5-fold cross-validation. Besides, PCA-EELM performs faster than
PCA-SVM based method. Consequently, the proposed approach can be considered as a new promising and powerful tools
for predicting PPI with excellent performance and less time.
地址: [You, Zhu-Hong] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Guangdong, Peoples R
China.
[Lei, Ying-Ke] Inst Elect Engn, Dept Informat, Hefei 230601, Anhui, Peoples R China.
[Zhu, Lin] Univ Sci & Technol China, Dept Automat, Hefei 230601, Anhui, Peoples R China.
[Xia, Junfeng] Anhui Univ, Inst Hlth Sci, Hefei 230601, Anhui, Peoples R China.
[Wang, Bing] Tongji Univ, Adv Res Inst Intelligent Sensing Network, Shanghai 201804, Peoples R China.
通讯作者地址: You, ZH (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Guangdong,
Peoples R China.
电子邮件地址: zhuhongyou@gmail.com
第 166 条，共 274 条
标题: Three-dimensional finite element study of a single pile response to multidirectional lateral loadings incorporating the
simplified state-dependent dilatancy model
作者: Su, D (Su, D.); Li, JH (Li, J. H.)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 2
摘要: Waves and winds can induce lateral loads on piles, which are often multidirectional. The objective of this study is to
investigate the response of a single pile subjected to unidirectional and multidirectional lateral loadings using the finite
element analysis program ABAQUS. A simplified version of the state-dependent dilatancy model was implemented and
embedded into the program to simulate the behavior of the soil around the pile. The results of the analyses indicate that the
lateral resistance of the pile along one horizontal direction under multidirectional loading is lower than that under
unidirectional loading. The degree of reduction of the resistance increases with the aspect ratio of the displacement path at
the pile head. The directions of the force increment vector and the displacement increment vector are generally non-coaxial
under multidirectional loading. The soil-pile interaction and soil responses under multidirectional loading are also
significantly different than those under unidirectional loading. (c) 2013 Elsevier Ltd. All rights reserved.
地址: [Su, D.] Shenzhen Univ, Coll Civil Engn, Shenzhen 518060, Peoples R China.
[Li, J. H.] Shenzhen Grad Sch, Harbin Inst Technol, Shenzhen, Peoples R China.
通讯作者地址: Su, D (通讯作者),Shenzhen Univ, Coll Civil Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: sudong@szu.edu.cn
第 167 条，共 274 条
标题: A fast low-density parity-check code simulator based on compressed parity-check matrices
作者: Yau, SF (Yau, Shek F.); Wong, TL (Wong, Tan L.); Lau, FCM (Lau, Francis C. M.); He, YJ (He, Yejun)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Low-density parity-check (LDPC) codes are very powerful error-correction codes with capabilities approaching the
Shannon's limits. In evaluating the error performance of an LDPC code, the computer simulation time taken becomes a
primary concern when tens of millions of noise-corrupted codewords are to be decoded, particularly for codes with very
long lengths. In this paper, we propose modeling the parity-check matrix of an LDPC code with compressed parity-check
matrices in the check-node domain (CND) and in the bit-node domain (BND), respectively. Based on the compressed
parity-check matrices, we created two message matrices, one in the CND and another in the BND, and two domain
conversion matrices, one from CND to BND and another from BND to CND. With the proposed message matrices, the data
used in the iterative LDPC decoding algorithm can be closely packed and stored within a small memory size. Consequently,
such data can be mostly stored in the cache memory, reducing the need for the central processing unit to access the random
access memory and hence improving the simulation time significantly. Furthermore, the messages in one domain can be
easily converted to another domain with the use of the conversion matrices, facilitating the central processing unit to access
and update the messages. Copyright (c) 2011 John Wiley & Sons, Ltd.
地址: [Yau, Shek F.; Wong, Tan L.; Lau, Francis C. M.] Hong Kong Polytech Univ, Dept Elect & Informat Engn, Hong
Kong, Hong Kong, Peoples R China.
[He, Yejun] Shenzhen Univ, Coll Informat Engn, Dept Commun Engn, Shenzhen 518060, Guangdong, Peoples R China.
通讯作者地址: He, YJ (通讯作者),Shenzhen Univ, Coll Informat Engn, Dept Commun Engn, 3688 Nanhai Rd, Shenzhen
518060, Guangdong, Peoples R China.
电子邮件地址: heyejun@ieee.org
第 168 条，共 274 条
标题: An enhanced variable-length arithmetic coding and encryption scheme using chaotic maps
作者: Lin, QZ (Lin, Qiuzhen); Wong, KW (Wong, Kwok-Wo); Chen, JY (Chen, Jianyong)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: We enhance the simultaneous arithmetic coding and encryption scheme previously proposed by us. By encoding a
block of variable number of symbols to a codeword within the length of the computation register, the operating efficiency
has been substantially improved. Moreover, the compressed sequence is processed by an additional diffusion operation
which strengthens the security of the original scheme by having higher key and plaintext sensitivities. Simulation results
show that the enhanced scheme runs faster than the original scheme and the traditional compress-then-encrypt approach at a
comparable compression performance. (c) 2013 Elsevier Inc. All rights reserved.
地址: [Lin, Qiuzhen; Wong, Kwok-Wo] City Univ Hong Kong, Dept Elect Engn, Kowloon Tong, Hong Kong, Peoples R
China.
[Chen, Jianyong] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen City Key Lab Embedded Syst Design,
Shenzhen 518060, Peoples R China.
通讯作者地址: Lin, QZ (通讯作者),City Univ Hong Kong, Dept Elect Engn, 83 Tat Chee Ave, Kowloon Tong, Hong
Kong, Peoples R China.
电子邮件地址: qiuzhlin@student.cityu.edu.hk; itkwwong@cityu.edu.hk; jychen@szu.edu.cn
第 169 条，共 274 条
标题: An improved mix framework for opinion leader identification in online learning communities
作者: Li, YY (Li, Yanyan); Ma, SQ (Ma, Shaoqian); Zhang, YH (Zhang, Yonghe); Huang, RH (Huang, Ronghuai);
Kinshuk (Kinshuk)
Web of Science 核心合集中的 "被引频次": 10
被引频次合计: 10
摘要: With the widespread adoption of social media, online learning communities are perceived as a network of knowledge
comprised of interconnected individuals with varying roles. Opinion leaders are important in social networks because of
their ability to influence the attitudes and behaviours of others via their superior status, education, and social prestige. Many
theories have been put forward to explain the formation, characteristics, and durability of social networks, but few address
the issue of opinion leader identification. This paper proposes an improved mix framework for opinion leader identification
in online learning communities. The framework is validated by an experimental study. By analysing textual content, user
behaviour and time, this study ranked opinion leaders based on four distinguishing features: expertise, novelty, influence,
and activity. Furthermore, the performances of opinion leaders were further investigated in terms of longevity and
centrality. Experimental study on real datasets has shown that our framework effectively identifies opinion leaders in online
learning communities. (C) 2013 Elsevier B.V. All rights reserved.
地址: [Li, Yanyan; Ma, Shaoqian; Huang, Ronghuai] Beijing Normal Univ, Sch Educ Technol, Beijing 100875, Peoples R
China.
[Zhang, Yonghe] Shenzhen Univ, Dept Educ Informat Technol, Shenzhen 518052, Peoples R China.
[Kinshuk] Athabasca Univ, Sch Comp & Informat Syst, Edmonton, AB T5X 2T9, Canada.
通讯作者地址: Li, YY (通讯作者),Beijing Normal Univ, Sch Educ Technol, Beijing 100875, Peoples R China.
电子邮件地址: Liyy1114@gmail.com; litchimsq@gmail.com; yonghe617@gmail.com; huangrh@bnu.edu.cn;
kinshuk@athabascau.ca
第 170 条，共 274 条
标题: Adaptive Frequency-Domain Equalization with Narrowband Interference Suppression
作者: Xie, N (Xie, Ning); Wang, H (Wang, Hui); Lin, XH (Lin, Xiaohui)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Frequency-domain equalization (FDE) is an effective technique that exhibits the property of relatively low
complexity which grows with increasing the number of symbols of dispersion in multipath propagation environments for
broadband wireless communications compared with the conventional time-domain equalization. However, in practical
broadband wireless communications, there exists not only multipath but also narrowband interference (NBI). The
conventional FDE methods do not consider NBI and their performance degrades obviously in such case. In this paper, we
propose a new optimization criterion which can effectively suppress NBI to obtain the maximum decision signal-to-noise
ratio. The proposed scheme employs a conventional adaptive algorithm such as least-mean-square or recursive-least-square
and operates in the spatial-frequency domain, which is concerned with the use of FDE and space diversity within block
transmission schemes jointly. The simulation results show that the proposed schemes have better error-rate performance
with low complexity and can be used even in the presence of strong NBI, compared to other existing adaptive FDE
algorithms.
地址: [Xie, Ning; Wang, Hui; Lin, Xiaohui] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Guangdong, Peoples R
China.
[Xie, Ning] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples
R China.
通讯作者地址: Xie, N (通讯作者),Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol,
Beijing 100876, Peoples R China.
电子邮件地址: kensouren@yahoo.com.cn
第 171 条，共 274 条
标题: RASS: A Real-Time, Accurate, and Scalable System for Tracking Transceiver-Free Objects
作者: Zhang, D (Zhang, Dian); Liu, YH (Liu, Yunhuai); Guo, XN (Guo, Xiaonan); Ni, LM (Ni, Lionel M.)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 4
摘要: Transceiver-free object tracking is to trace a moving object that does not carry any communication device in an
environment with some monitoring nodes predeployed. Among all the tracking technologies, RF-based technology is an
emerging research field facing many challenges. Although we proposed the original idea, until now there is no method
achieving scalability without sacrificing latency and accuracy. In this paper, we put forward a real-time tracking system
RASS, which can achieve this goal and is promising in the applications like the safeguard system. Our basic idea is to
divide the tracking field into different areas, with adjacent areas using different communication channels. So, the
interference among different areas can be prevented. For each area, three communicating nodes are deployed on the ceiling
as a regular triangle to monitor this area. In each triangle area, we use a Support Vector Regression (SVR) model to locate
the object. This model simulates the relationship between the signal dynamics caused by the object and the object position.
It not only considers the ideal case of signal dynamics caused by the object, but also utilizes their irregular information. As
a result, it can reach the tracking accuracy to around 1 m by just using three nodes in a triangle area with 4 m in each side.
The experiments show that the tracking latency of the proposed RASS system is bounded by only about 0.26 m. Our system
scales well to a large deployment field without sacrificing the latency and accuracy.
地址: [Zhang, Dian] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Guangdong, Peoples R China.
[Liu, Yunhuai] Minist Publ Secur, Res Inst 3, Res Ctr Internet Things, Shanghai, Peoples R China.
[Guo, Xiaonan; Ni, Lionel M.] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Hong Kong, Peoples R
China.
[Ni, Lionel M.] Shanghai Jiao Tong Univ, Shanghai, Peoples R China.
通讯作者地址: Zhang, D (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Nanhai Ave 3688, Shenzhen
518060, Guangdong, Peoples R China.
电子邮件地址: serena.dian@gmail.com; yunhuai.liu@gmail.com; guoxn@ust.hk; ni@ust.hk
第 172 条，共 274 条
标题: Informer homed routing fault tolerance mechanism for wireless sensor networks
作者: Qiu, MK (Qiu, Meikang); Ming, Z (Ming, Zhong); Li, JY (Li, Jiayin); Liu, JN (Liu, Jianning); Quan, G (Quan,
Gang); Zhu, YX (Zhu, Yongxin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Sensors in a wireless sensor network (WSN) are prone to failure, due to the energy depletion, hardware failures, etc.
Fault tolerance is one of the critical issues in WSNs. The existing fault tolerance mechanisms either consume significant
extra energy to detect and recover from the failures or need to use additional hardware and software resource. In this paper,
we propose a novel energy-aware fault tolerance mechanism for WSN, called Informer Homed Routing (IHR). In our IHR,
non cluster head (NCH) nodes select a limited number of targets in the data transmission. Therefore it consumes less
energy. Our experimental results show that our proposed protocol can significantly reduce energy consumption, compared
to two existing protocols: Low-Energy Adaptive Clustering Hierarchy (LEACH) and Dual Homed Routing (DHR). (c) 2013
Elsevier B.V. All rights reserved.
地址: [Qiu, Meikang; Li, Jiayin; Liu, Jianning] Univ Kentucky, Dept Elect & Comp Engn, Lexington, KY 40506 USA.
[Ming, Zhong] Shenzhen Univ, Coll Comp Sci & Software, Shenzhen 518060, Guangdong, Peoples R China.
[Quan, Gang] Florida Int Univ, Dept Elect & Comp Engn, Miami, FL 33174 USA.
[Zhu, Yongxin] Shanghai Jiao Tong Univ, Sch Microelect, Shanghai 200240, Peoples R China.
通讯作者地址: Ming, Z (通讯作者),Shenzhen Univ, Coll Comp Sci & Software, Shenzhen 518060, Guangdong, Peoples
R China.
电子邮件地址: mqiu@engr.uky.edu; mingz@szu.edu.cn; jli6@engr.uky.edu; jianning.liu@uky.edu; gang.quan@fiu.edu;
zhuyongxin@sjtu.edu.cn
第 173 条，共 274 条
标题: Pareto Optimal Power Control via Bisection Searching in Wireless Networks
作者: Qian, LP (Qian, Li Ping); Wu, Y (Wu, Yuan); Zhang, SL (Zhang, Shengli); Chen, QZ (Chen, Qingzhang)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: In this letter, we first prove that the upper boundary of the feasible signal to interference-plus-noise ratio (SINR)
region achieved by power control is Pareto optimal under the constraints of minimum SINR requirements and limited
power. Thanks to the Pareto optimal nature, we further propose a bisection searching based low-complexity algorithm that
achieves arbitrary Pareto optimal power control over the entire feasible SINR region. More importantly, we can easily
approach the upper boundary of the feasible SINR region through the proposed algorithm.
地址: [Qian, Li Ping; Chen, Qingzhang] Zhejiang Univ Technol, Coll Comp Sci & Technol, Hangzhou 310023, Zhejiang,
Peoples R China.
[Wu, Yuan] Zhejiang Univ Technol, Coll Informat Engn, Hangzhou 310023, Zhejiang, Peoples R China.
[Zhang, Shengli] Shenzhen Univ, Coll Informat Engn, Shenzhen 518061, Peoples R China.
通讯作者地址: Wu, Y (通讯作者),Zhejiang Univ Technol, Coll Informat Engn, Hangzhou 310023, Zhejiang, Peoples R
China.
电子邮件地址: lpqian@zjut.edu.cn; iewuy@zjut.edu.cn; slzhang.szu@gmail.com; qzchen@zjut.edu.cn
第 174 条，共 274 条
标题: Edge-Preserving Texture Suppression Filter Based on Joint Filtering Schemes
作者: Su, Z (Su, Zhuo); Luo, XN (Luo, Xiaonan); Deng, ZJ (Deng, Zhengjie); Liang, Y (Liang, Yun); Ji, Z (Ji, Zhen)
Web of Science 核心合集中的 "被引频次": 6
被引频次合计: 9
摘要: Obtaining a texture-smoothing and edge-preserving filtered output is significant to image decomposition. Although
the edge and the texture have salient difference in human vision, automatically distinguishing them is a difficult task, for
they have similar intensity difference or gradient response. The state-of-the-art edge-preserving smoothing (EPS) based
decomposition approaches are hard to obtain a satisfactory result. We propose a novel edge-preserving texture suppression
filter, exploiting the joint bilateral filter as a bridge to achieve the purpose of both properties of texture-smoothing and
edge-preserving. We develop the iterative asymmetric sampling and the local linear model to produce the degenerative
image to suppress the texture, and apply the edge correction operator to achieve edge-preserving. An efficient accelerating
implementation is introduced to improve the performance of filtering response. The experiments demonstrate that our filter
produces satisfactory outputs with both properties of texture-smoothing and edge-preserving, while compared with the
results of other popular EPS approaches in signal, visual and time analysis. Finally, we extend our filter to a variety of
image processing applications.
地址: [Su, Zhuo; Luo, Xiaonan] Sun Yat Sen Univ, Sch Informat Sci & Technol, State Prov Joint Lab Digital Home
Interact Applic, Natl Engn Res Ctr Digital Life, Guangzhou 510275, Guangdong, Peoples R China.
[Deng, Zhengjie] Hainan Normal Univ, Sch Informat Sci & Technol, Haikou, Peoples R China.
[Liang, Yun] South China Agr Univ, Sch Informat, Guangzhou, Guangdong, Peoples R China.
[Ji, Zhen] Shenzhen Univ, Dept Comp Sci, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
通讯作者地址: Su, Z (通讯作者),Sun Yat Sen Univ, Sch Informat Sci & Technol, State Prov Joint Lab Digital Home
Interact Applic, Natl Engn Res Ctr Digital Life, Guangzhou 510275, Guangdong, Peoples R China.
电子邮件地址: suzhuoi@gmail.com; lnslxn@mail.sysu.edu.cn; hsdengzj@163.com; sdliangyun@163.com;
jizhen@szu.edu.cn
第 175 条，共 274 条
标题: Self-configuration single particle optimizer for DNA sequence compression
作者: Ji, Z (Ji, Zhen); Zhou, JR (Zhou, Jiarui); Zhu, ZX (Zhu, Zexuan); Chen, SP (Chen, Siping)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 2
摘要: This paper presents a novel self-configuration single particle optimizer (SCSPO) for DNA sequence compression.
Particularly, SCSPO searches an optimal compression codebook of all unique repeat patterns and then DNA sequences are
compressed by replacing the duplicate fragments with the indexes of the corresponding matched code vectors in the
codebook. Featured with a crucial self-configuration process, SCSPO optimizes the codebook with no predefined parameter
settings required. Experimental results on benchmark numerical functions and real-world DNA sequences demonstrate that
SCSPO is capable of attaining better fitness value than many other PSO variants and the proposed DNA sequence
compression algorithm based on SCSPO attains encouraging compression performance.
地址: [Ji, Zhen; Zhu, Zexuan] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
[Zhou, Jiarui; Chen, Siping] Zhejiang Univ, Coll Biomed Engn & Instrument Sci, Hangzhou 310027, Zhejiang, Peoples R
China.
[Chen, Siping] Shenzhen Univ, Sch Med, Shenzhen 518060, Peoples R China.
通讯作者地址: Ji, Z (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: jizhen@szu.edu.cn
第 176 条，共 274 条
标题: SCALE INVARIANT FEATURE MATCHING USING ROTATION-INVARIANT DISTANCE FOR REMOTE
SENSING IMAGE REGISTRATION
作者: Li, QL (Li, Qiaoliang); Zhang, HS (Zhang, Huisheng); Wang, TF (Wang, Tianfu)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: Scale invariant feature transform (SIFT) has been widely used in image matching. But when SIFT is introduced in the
registration of remote sensing images, the keypoint pairs which are expected to be matched are often assigned two different
value of main orientation owing to the significant difference in the image intensity between remote sensing image pairs, and
therefore a lot of incorrect matches of keypoints will appear. This paper presents a method using rotation-invariant distance
instead of Euclid distance to match the scale invariant feature vectors associated with the keypoints. In the proposed
method, the feature vectors are reorganized into feature matrices, and fast Fourier transform (FFT) is introduced to compute
the rotation-invariant distance between the matrices. Much more correct matches are obtained by the proposed method since
the rotation-invariant distance is independent of the main orientation of the keypoints. Experimental results indicate that the
proposed method improves the match performance compared to other state-of-art methods in terms of correct match rate
and aligning accuracy.
地址: [Li, Qiaoliang; Zhang, Huisheng; Wang, Tianfu] Shenzhen Univ, Sch Med, Dept Biomed Engn, Guangdong Key Lab
Biomed Measurements & Ultrasoun, Shenzhen 518060, Peoples R China.
通讯作者地址: Li, QL (通讯作者),Shenzhen Univ, Sch Med, Dept Biomed Engn, Guangdong Key Lab Biomed
Measurements & Ultrasoun, Shenzhen 518060, Peoples R China.
电子邮件地址: lql_lql_lql@yahoo.com.cn; isaac_zhs@126.com; tfwang@szu.edu.cn
第 177 条，共 274 条
标题: Achieving high diversity and multiplexing gains in the asynchronous parallel relay network
作者: Dai, MJ (Dai, Mingjun); Sung, CW (Sung, Chi Wan)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 3
摘要: A single source-destination pair communicating via a layer of parallel relay nodes under quasi-static slow fading
environment is investigated. The time delays from the source to the destination via different relays are assumed to be
different. For such an asynchronous environment, a new transmission scheme is constructed so as to achieve better
diversity-multiplexing tradeoff (DMT). More specifically, both the source and the destination adopts orthogonal frequency
division multiplexing technique to solve the asynchronous problem; the relays cooperatively apply the distributed
generalised complex orthogonal design, a form of orthogonal spacetime coding, for high-rate transmission. Each relay is
assumed to use the adaptive amplify-and-forward relaying strategy. To optimise its outage performance, a distributed on-off
power control rule applied to the relays is analytically derived and is proved to yield full spatial diversity order. Compared
with an existing protocol, our proposed scheme is shown to achieve the same DMT when there are four relay nodes and
better DMT when there are more. Besides, the DMT gap between our scheme and the existing one increases with the
number of relay nodes. Copyright (c) 2013 John Wiley & Sons, Ltd.
地址: [Dai, Mingjun] Shenzhen Univ, Coll Informat Engn, Shenzhen Key Lab Adv Commun & Informat Proc, Shenzhen,
Peoples R China.
[Sung, Chi Wan] City Univ Hong Kong, Dept Elect Engn, Hong Kong, Peoples R China.
通讯作者地址: Dai, MJ (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen Key Lab Adv Commun & Informat
Proc, Shenzhen, Peoples R China.
电子邮件地址: mingjundai@hotmail.com
第 178 条，共 274 条
标题: A decentralized approach for mining event correlations in distributed system monitoring
作者: Wu, G (Wu, Gang); Zhang, HX (Zhang, Huxing); Qiu, MK (Qiu, Meikang); Ming, Z (Ming, Zhong); Li, JY (Li,
Jiayin); Qin, X (Qin, Xiao)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 3
摘要: Nowadays, there is an increasing demand to monitor, analyze, and control large scale distributed systems. Events
detected during monitoring are temporally correlated, which is helpful to resource allocation, job scheduling, and failure
prediction. To discover the correlations among detected events, many existing approaches concentrate detected events into
an event database and perform data mining on it. We argue that these approaches are not scalable to large scale distributed
systems as monitored events grow so fast that event correlation discovering can hardly be done with the power of a single
computer. In this paper, we present a decentralized approach to efficiently detect events, filter irrelative events, and discover
their temporal correlations. We propose a MapReduce-based algorithm, MapReduce-Apriori, to data mining event
association rules, which utilizes the computational resource of multiple dedicated nodes of the system. Experimental results
show that our decentralized event correlation mining algorithm achieves nearly ideal speedup compared to centralized
mining approaches. (c) 2012 Elsevier Inc. All rights reserved.
地址: [Wu, Gang; Zhang, Huxing] Shanghai Jiao Tong Univ, Sch Software, Shanghai 200240, Peoples R China.
[Qiu, Meikang; Li, Jiayin] Univ Kentucky, Dept Elect & Comp Engn, Lexington, KY 40506 USA.
[Ming, Zhong] Shenzhen Univ, Coll Comp Sci & Software, Shenzhen 518060, Peoples R China.
[Qin, Xiao] Auburn Univ, Dept Comp Sci & Software Engn, Auburn, AL 36849 USA.
通讯作者地址: Ming, Z (通讯作者),Shenzhen Univ, Coll Comp Sci & Software, Shenzhen 518060, Peoples R China.
电子邮件地址: wugang@cs.sjtu.edu.cn; ralf0131@sjtu.edu.cn; qiumeikang@yahoo.com; mingz@szu.edu.cn;
jli6@engr.uky.edu; xqin@auburn.edu
第 179 条，共 274 条
标题: Combining Quantum-Behaved PSO and K2 Algorithm for Enhancing Gene Network Construction
作者: Du, ZH (Du, Zhihua); Zhu, YY (Zhu, Yingying); Liu, WX (Liu, Weixiang)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: Construction of the gene regulatory networks is a challenged problem in systems biology and bioinformatics. This
paper presents construction of gene network using combined quantum-behaved PSO and K2 algorithm. Recent studies have
shown that Bayesian Network is an effective way to learn the network structure. K2 algorithm is widely used because of its
heuristic searching techniques and fast convergence, but it suffers from local optima. And the performance of K2 algorithm
is greatly affected by a prior ordering of input nodes. Quantum-behaved PSO is a population-based stochastic search
process, which automatically searches for the optimal solution in the search space. So, we combined it with K2 algorithm
for construction gene network. The results of hybrid PSO, K2 (we refer to it as QPSO-K2 algorithm), stand-alone K2 and
quantum-behaved PSO algorithms are compared on several datasets. Among the three algorithms, the hybrid QPSO-K2
algorithm performs well for all of the datasets.
地址: [Du, Zhihua; Zhu, Yingying] ShenZhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Liu, Weixiang] ShenZhen Univ, Sch Med, Shenzhen, Peoples R China.
通讯作者地址: Zhu, YY (通讯作者),ShenZhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
电子邮件地址: duzh@szu.edu.cn
第 180 条，共 274 条
标题: Thermal-Aware Task Scheduling in 3D Chip Multiprocessor with Real-Time Constrained Workloads
作者: Li, JY (Li, Jiayin); Qiu, MK (Qiu, Meikang); Niu, JW (Niu, Jian-Wei); Yang, LT (Yang, Laurence T.); Zhu, YX
(Zhu, Yongxin); Ming, Z (Ming, Zhong)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Chip multiprocessor (CMP) techniques have been implemented in embedded systems due to tremendous computation
requirements. Three-dimension (3D) CMP architecture has been studied recently for integrating more functionalities and
providing higher performance. The high temperature on chip is a critical issue for the 3D architecture. In this article, we
propose an online thermal prediction model for 3D chips. Using this model, we propose novel task scheduling algorithms
based on rotation scheduling to reduce the peak temperature on chip. We consider data dependencies, especially
inter-iteration dependencies that are not well considered in most of the current thermal-aware task scheduling algorithms.
Our simulation results show that our algorithms can efficiently reduce the peak temperature up to 8.1 degrees C.
地址: [Li, Jiayin; Qiu, Meikang] Univ Kentucky, Dept Elect & Comp Engn, Lexington, KY 40506 USA.
[Niu, Jian-Wei] Beihang Univ, State Key Lab Software Dev Environm, Beijing 100191, Peoples R China.
[Yang, Laurence T.] St Francis Xavier Univ, Dept Comp Sci, Antigonish, NS B2G 2W5, Canada.
[Zhu, Yongxin] Shanghai Jiao Tong Univ, Sch Microeletron, Shanghai 200240, Peoples R China.
[Ming, Zhong] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, GD, Peoples R China.
通讯作者地址: Ming, Z (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, GD, Peoples R
China.
电子邮件地址: jli6@engr.uky.edu; mqiu@engr.uky.edu; niujianwei@buaa.edu.cn; ltyang@stfix.ca;
zhuyongxin@sjtu.edu.cn; mingz@szu.edu.cn
第 181 条，共 274 条
标题: Substructuring approach to the calculation of higher-order eigensensitivity
作者: Weng, S (Weng, Shun); Zhu, HP (Zhu, Hong-Ping); Xia, Y (Xia, Yong); Zhou, XQ (Zhou, Xiao-Qing); Mao, L
(Mao, Ling)
Web of Science 核心合集中的 "被引频次": 5
被引频次合计: 5
摘要: Calculation of eigensensitivity is usually time-consuming for a large-scale structure. This paper develops a
substructuring method for computing the first, second and high order eigensensitivity. The local area of a structure is treated
as an independent substructure to be analyzed. The eigensensitivity of global structure with respect to a design parameter is
calculated from the eigensensitivity of a particular substructure that contains the design parameter, thus allowing a
significant reduction in computational cost. The accuracy and efficiency of the substructuring method is proved by a frame
structure and a highway bridge. (C) 2012 Elsevier Ltd. All rights reserved.
地址: [Weng, Shun; Zhu, Hong-Ping; Mao, Ling] Huazhong Univ Sci & Technol, Sch Civil Engn & Mech, Wuhan 430074,
Hubei, Peoples R China.
[Xia, Yong] Hong Kong Polytech Univ, Dept Civil & Struct Engn, Kowloon, Hong Kong, Peoples R China.
[Zhou, Xiao-Qing] Shenzhen Univ, Coll Civil Engn, Shenzhen, Peoples R China.
通讯作者地址: Zhu, HP (通讯作者),Huazhong Univ Sci & Technol, Sch Civil Engn & Mech, Wuhan 430074, Hubei,
Peoples R China.
电子邮件地址: wengshun@mail.hust.edu.cn; hpzhu@mail.hust.edu.cn; ceyxia@polyu.edu.hk; xqzhou@szu.edu.cn;
maoling-1985@163.com
第 182 条，共 274 条
标题: Reversible Data Hiding for BTC-Compressed Images Based on Lossless Coding of Mean Tables
作者: Zhang, Y (Zhang, Yong); Guo, SZ (Guo, Shi-Ze); Lu, ZM (Lu, Zhe-Ming); Luo, H (Luo, Hao)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Reversible data hiding has been a hot research topic since both the host media and hidden data can be recovered
without distortion. In the past several years, more and more attention has been paid to reversible data hiding schemes for
images in compressed formats such as JPEG, JPEG2000, Vector Quantization (VQ) and Block Truncation Coding (BTC).
Traditional data hiding schemes in the BTC domain modify the BTC encoding stage or BTC-compressed data according to
the secret bits, and they have no ability to reduce the bit rate but may reduce the image quality. This paper presents a novel
reversible data hiding scheme for BTC-compressed images by further losslessly encoding the BTC-compressed data
according to the secret bits. First, the original BTC technique is performed on the original image to obtain the
BTC-compressed data which can be represented by a high mean table, a low mean table and a bitplane sequence. Then, the
proposed reversible data hiding scheme is performed on both the high mean table and low mean table. Our hiding scheme is
a lossless joint hiding and compression method based on 2 x 2 blocks in mean tables, thus it can not only hide data in mean
tables but also reduce the bit rate. Experiments show that our scheme outperforms three existing BTC-based data hiding
works, in terms of the bit rate, capacity and efficiency.
地址: [Zhang, Yong] Shenzhen Univ, Coll Informat Engn, ATR Natl Def Technol Key Lab, Shenzhen 518060, Peoples R
China.
[Guo, Shi-Ze; Luo, Hao] North Elect Syst Engn Corp, Beijing 100083, Peoples R China.
[Lu, Zhe-Ming] Zhejiang Univ, Sch Aeronaut & Astronaut, Hangzhou 310027, Peoples R China.
通讯作者地址: Lu, ZM (通讯作者),Zhejiang Univ, Sch Aeronaut & Astronaut, Hangzhou 310027, Peoples R China.
电子邮件地址: zheminglu@zju.edu.cn
第 183 条，共 274 条
标题: Synchronization Analysis for Wireless TWRC Operated with Physical-layer Network Coding
作者: Zhang, SL (Zhang, Shengli); Liew, SC (Liew, Soung-Chang); Wang, H (Wang, Hui)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Physical-layer network coding (PNC) makes use of the additive nature of the electromagnetic waves to apply network
coding arithmetic at the physical layer. With PNC, the destructive effect of interference in wireless networks is eliminated
and the capacity of networks can be boosted significantly. This paper addresses a key outstanding issue in PNC:
synchronization among transmitting nodes. We first investigate the impact of imperfect synchronization in a 3-node
network with a straightforward detection scheme. It is shown that with QPSK modulation, PNC on average still yields
significantly higher capacity than straightforward network coding when there are synchronization errors. Significantly, this
remains to be so even in the extreme case when synchronization is not performed at all. Moving beyond a 3-node network,
we propose and investigate a synchronization scheme for PNC in a general chain network. And we argue that if the
synchronization errors can be bounded in the 3-node case, they can also be bounded in the general N-node case. Lastly, we
present simulation results showing that PNC is robust to synchronization errors. In particular, for the mutual information
performance, there is about 2 dB loss without phase or symbol synchronization.
地址: [Zhang, Shengli; Wang, Hui] Shenzhen Univ, Dept Commun Engn, Shenzhen, Peoples R China.
[Liew, Soung-Chang] Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Zhang, SL (通讯作者),Shenzhen Univ, Dept Commun Engn, Shenzhen, Peoples R China.
电子邮件地址: zsl@szu.edu.cn; soung@ie.cuhk.edu.hk; wanghsz@szu.edu.cn
第 184 条，共 274 条
标题: Extending twin support vector machine classifier for multi-category classification problems
作者: Xie, JY (Xie, Juanying); Hone, K (Hone, Kate); Xie, WX (Xie, Weixin); Gao, XB (Gao, Xinbo); Shi, Y (Shi, Yong);
Liu, XH (Liu, Xiaohui)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: Twin support vector machine classifier (TWSVM) was proposed by Jayadeva et al., which was used for binary
classification problems. TWSVM not only overcomes the difficulties in handling the problem of exemplar unbalance in
binary classification problems, but also it is four times faster in training a classifier than classical support vector machines.
This paper proposes one-versus-all twin support vector machine classifiers (OVA-TWSVM) for multi-category
classification problems by utilizing the strengths of TWSVM. OVA-TWSVM extends TWSVM to solve k-category
classification problems by developing k TWSVM where in the ith TWSVM, we only solve the Quadratic Programming
Problems (QPPs) for the ith class, and get the ith nonparallel hyperplane corresponding to the ith class data. OVA-TWSVM
uses the well known one-versus-all (OVA) approach to construct a corresponding twin support vector machine classifier.
We analyze the efficiency of the OVA-TWSVM theoretically, and perform experiments to test its efficiency on both
synthetic data sets and several benchmark data sets from the UCI machine learning repository. Both the theoretical analysis
and experimental results demonstrate that OVA-TWSVM can outperform the traditional OVA-SVMs classifier. Further
experimental comparisons with other multiclass classifiers demonstrated that comparable performance could be achieved.
地址: [Xie, Juanying] Shaanxi Normal Univ, Sch Comp Sci, Xian 710062, Shaanxi, Peoples R China.
[Xie, Juanying; Gao, Xinbo] Xidian Univ, Sch Elect Engn, Xian, Shaanxi, Peoples R China.
[Hone, Kate; Liu, Xiaohui] Brunel Univ, Sch Informat Syst Comp & Math, London, England.
[Xie, Weixin] Shenzhen Univ, Coll Informat Engn, Shenzhen, Peoples R China.
[Shi, Yong] Chinese Acad Sci, CAS Res Ctr Fictitious Econ & Data Sci, Beijing, Peoples R China.
通讯作者地址: Xie, JY (通讯作者),Shaanxi Normal Univ, Sch Comp Sci, Xian 710062, Shaanxi, Peoples R China.
电子邮件地址: xiejuany@snnu.edu.cn
第 185 条，共 274 条
标题: Linear Network Coding Strategies for the Multiple Access Relay Channel with Packet Erasures
作者: Dai, MJ (Dai, Mingjun); Kwan, HY (Kwan, Ho Yuet); Sung, CW (Sung, Chi Wan)
Web of Science 核心合集中的 "被引频次": 6
被引频次合计: 6
摘要: The multiple access relay channel (MARC) where multiple users send independent information to a single destination
aided by a single relay under large-scale path loss and slow fading is investigated. At the beginning, the users take turns to
transmit their packets. The relay is not aware of the erasure status of each packet at the destination but has the knowledge of
the average signal-to-noise-ratio (SNR) of every communication link. With this knowledge, the relay applies network coded
retransmission on the overheard packets so as to maximize the expected total number of recovered packets or minimize the
average packet loss rate at the destination. Several network coding (NC) strategies at the relay are designed. In particular,
for the case where the relay is given only one time slot for retransmission, an optimal NC construction is derived. For the
multiple-slot case, three sub-optimal schemes are investigated, namely network coding with maximum distance separable
(MDS) code (NC-MDS), the worst-user-first (WUF) scheme and a hybrid of NC-MDS and WUF. We prove that NC-MDS
and WUF are asymptotically optimal in the high and low SNR regimes, respectively. A lower bound on the average packet
loss rate has been derived. Numerical studies show that, in a cellular system, the hybrid scheme offers significant
performance gain over a number of existing schemes in a wide range of SNR. We also observe that performance curves of
both WUF and the hybrid scheme touch the derived lower bound in the low SNR regime.
地址: [Dai, Mingjun] Shenzhen Univ, Coll Informat Engn, Shenzhen, Peoples R China.
[Kwan, Ho Yuet; Sung, Chi Wan] City Univ Hong Kong, Dept Elect Engn, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Dai, MJ (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen, Peoples R China.
电子邮件地址: mingjundai@hotmail.com; hykwan@gmail.com; al-bert.sung@cityu.edu.hk
第 186 条，共 274 条
标题: Circle Fitting Using a Virtual Source Localization Algorithm in Wireless Sensor Networks
作者: Liang, JL (Liang, Junli); Zhang, MH (Zhang, Miaohua); Zeng, XJ (Zeng, Xianju); Zhao, KX (Zhao, Kexin); Li, J (Li,
Jian)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: A novel circle fitting algorithmis proposed in this paper. The key points of this paper are given as follows: (i) it
formulates the circle fitting problem into the special source localization one in wireless sensor networks (WSN); (ii) the
multidimensional scaling (MDS) analysis is applied to the data points, and thus the propagator-like method is proposed to
represent the circle center parameters as the functions of the circle radius; (iii) the virtual source localization model can be
rerepresented as special nonlinear equations of a unique variable (the circle radius) rather than the original three ones (the
circle center and radius), and thus the classical fixed-point iteration algorithmis applied to determine the radius and the
circle center parameters. The effectiveness of the proposed circle fitting approach is demonstrated using the simulation and
experimental results.
地址: [Liang, Junli; Zhang, Miaohua] Xian Univ Technol, Xian 710048, Peoples R China.
[Liang, Junli; Zhao, Kexin; Li, Jian] Univ Florida, Gainesville, FL 32611 USA.
[Zeng, Xianju] Shenzhen Univ, Coll Management, Shenzhen 518060, Peoples R China.
通讯作者地址: Liang, JL (通讯作者),Xian Univ Technol, Xian 710048, Peoples R China.
电子邮件地址: heery_2004@hotmail.com
第 187 条，共 274 条
标题: Multi-aspect sentiment analysis for Chinese online social reviews based on topic modeling and HowNet lexicon
作者: Fu, XH (Fu Xianghua); Liu, G (Liu Guo); Guo, YY (Guo Yanyan); Wang, ZQ (Wang Zhiqiang)
Web of Science 核心合集中的 "被引频次": 5
被引频次合计: 7
摘要: User-generated reviews on the Web reflect users' sentiment about products, services and social events. Existing
researches mostly focus on the sentiment classification of the product and service reviews in document level. Reviews of
social events such as economic and political activities, which are called social reviews, have specific characteristics
different to the reviews of products and services. In this paper, we propose an unsupervised approach to automatically
discover the aspects discussed in Chinese social reviews and also the sentiments expressed in different aspects. The
approach is called Multi-aspect Sentiment Analysis for Chinese Online Social Reviews (MSA-COSRs). We first apply the
Latent Dirichlet Allocation (LDA) model to discover multi-aspect global topics of social reviews, and then extract the local
topic and associated sentiment based on a sliding window context over the review text. The aspect of the local topic is
identified by a trained LDA model, and the polarity of the associated sentiment is classified by HowNet lexicon. The
experiment results show that MSA-COSR cannot only obtain good topic partitioning results, but also help to improve
sentiment analysis accuracy. It helps to simultaneously discover multi-aspect fine-grained topics and associated sentiment.
(C) 2012 Elsevier B.V. All rights reserved.
地址: [Fu Xianghua; Liu Guo; Guo Yanyan; Wang Zhiqiang] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen
518060, Guangdong, Peoples R China.
通讯作者地址: Fu, XH (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Guangdong,
Peoples R China.
电子邮件地址: fuxh@szu.edu.cn
第 188 条，共 274 条
标题: Bacterial foraging based approaches to portfolio optimization with liquidity risk
作者: Niu, B (Niu, Ben); Fan, Y (Fan, Yan); Xiao, H (Xiao, Han); Xue, B (Xue, Bing)
Web of Science 核心合集中的 "被引频次": 8
被引频次合计: 8
摘要: This paper proposes a bacterial foraging based approach for portfolio optimization problem. We develop an improved
portfolio optimization model by introducing the endogenous and exogenous liquidity risk and the corresponding indexes are
designed to measure the endogenous/exogenous liquidity risk, respectively. Bacterial foraging optimization (BFO) is
employed to find the optimal set of portfolio weights in the improved Mean-Variance model. BFO-LDC which is a
modified BFO with linear deceasing chemotaxis step is proposed to further improve the performance of BFO. With four
benchmark functions, BFO-LDC is proved to have better performance than the original BFO. And then comparisons of the
results produced by BFO, BFO-LDC, particle swarm optimization (PSO), and genetic algorithms (GAs) for the proposed
portfolio optimization model are presented. Simulation results show that BFOs can obtain both near optimal and the
practically feasible solutions to the liquidity risk portfolio optimization problem. In addition, BFO-LDC outperforms BFO
in most cases. (c) 2012 Elsevier B.V. All rights reserved.
地址: [Niu, Ben; Fan, Yan; Xiao, Han] Shenzhen Univ, Coll Management, Shenzhen 518060, Peoples R China.
[Niu, Ben] Univ Hong Kong, e Business Technol Inst, Hong Kong, Hong Kong, Peoples R China.
[Niu, Ben] Chinese Acad Sci, Hefei Inst Intelligent Machines, Hefei 230031, Peoples R China.
[Xue, Bing] Victoria Univ Wellington, Evolutionary Computat Res Grp, Wellington, New Zealand.
通讯作者地址: Niu, B (通讯作者),Shenzhen Univ, Coll Management, Shenzhen 518060, Peoples R China.
电子邮件地址: drniuben@gmail.com
第 189 条，共 274 条
标题: Zero-Forcing Based MIMO Two-Way Relay with Relay Antenna Selection: Transmission Scheme and Diversity
Analysis
作者: Gao, H (Gao, Hui); Lv, T (Lv, Tiejun); Zhang, SL (Zhang, Shengli); Yuen, C (Yuen, Chau); Yang, SS (Yang,
Shaoshi)
Web of Science 核心合集中的 "被引频次": 10
被引频次合计: 10
摘要: Combining of physical-layer network coding (PNC) and multiple-input multiple-output (MIMO) can significantly
improve the performance of the wireless two-way relay network (TWRN). This paper proposes novel Max-Min
optimization based relay antenna selection (RAS) schemes for zero-forcing (ZF) based MIMO-PNC transmission. RAS
relaxes ZF's constraints on the number of antennas and extends the applications of ZF based MIMO-PNC to more practical
scenarios, where the dedicated relay has more antennas than the end node. Moreover, RAS also brings diversity advantages
to TWRN and the achievable diversity gains of the proposed schemes are theoretically analyzed. In particular, an
equivalence relation is carefully built for the diversity gains obtained by 1) RAS for ZF based MIMO-PNC and 2) transmit
antenna selection (TAS) for MIMO broadcasting (BC) with ZF receivers. This equivalence transforms the original problem
to a more tractable form which eventually allows explicit analytical results. It is interesting to see that Max-Min RAS keeps
the network diversity gain of ZF based MIMO-PNC to be the same as the diversity gain of the point-to-point link within the
TWRN. This insight extends the understanding on the behaviors of ZF transceivers with antenna selection (AS) to relatively
complicated MIMO-TWRN/BC scenarios.
地址: [Lv, Tiejun] Beijing Univ Posts & Telecommun, Sch Informat & Commun Engn, Beijing 100876, Peoples R China.
[Gao, Hui; Yuen, Chau] Singapore Univ Technol & Design, Singapore 138682, Singapore.
[Zhang, Shengli] Shenzhen Univ, Dept Commun Engn, Shenzhen 518060, Peoples R China.
[Yang, Shaoshi] Univ Southampton, Sch Elect & Comp Sci, Southampton SO17 1BJ, Hants, England.
通讯作者地址: Lv, T (通讯作者),Beijing Univ Posts & Telecommun, Sch Informat & Commun Engn, Beijing 100876,
Peoples R China.
电子邮件地址: hui_gao@sutd.edu.sg; lvtiejun@bupt.edu.cn; zsl@szu.edu.cn; yuenchau@sutd.edu.sg;
sy7g09@ecs.soton.ac.uk
第 190 条，共 274 条
标题: Selecting proper wireless network interfaces for user experience enhancement with guaranteed probability
作者: Niu, JW (Niu, Jianwei); Gao, YH (Gao, Yuhang); Qiu, MK (Qiu, Meikang); Ming, Z (Ming, Zhong)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 2
摘要: With the increasing capabilities of mobile phones, mobile users access data via wireless interfaces pervasively.
Although WiFi has limited coverage and resulted in a bigger delay of data access, it is not uncommon that mobile users are
willing to use WiFi to transmit data to decrease communication costs instead of 3G. Hence it is reasonable to use delay
tolerance strategies to balance execution time, energy consumption, and communication cost. In this paper, we model
mobile user experience as a combination of three random variables (energy consumption, execution time and
communication cost). We present a wireless interface scheduling algorithm to select proper wireless interfaces for a set of
data-dependent sporadic tasks to enhance user experience under the constraints of execution time, energy consumption, and
communication cost with a guaranteed confidence probability in a delay-tolerant environment. The experimental results
show that our approach can effectively enhance the user experience. (C) 2012 Elsevier Inc. All rights reserved.
地址: [Ming, Zhong] Shenzhen Univ, Coll Comp Sci & Software, Shenzhen 518060, Peoples R China.
[Niu, Jianwei; Gao, Yuhang] Beihang Univ, Sch Engn & Comp Sci, Beijing 100191, Peoples R China.
[Qiu, Meikang] Univ Kentucky, Dept Elect & Comp Engn, Lexington, KY 40506 USA.
通讯作者地址: Ming, Z (通讯作者),Shenzhen Univ, Coll Comp Sci & Software, Shenzhen 518060, Peoples R China.
电子邮件地址: niujianwei@buaa.edu.cn; rainman1919@gmail.com; mqiu@engr.uky.edu; mingz@szu.edu.cn
第 191 条，共 274 条
标题: SUPERVISED REGULARIZATION LOCALITY-PRESERVING PROJECTION METHOD FOR FACE
RECOGNITION
作者: Chen, WS (Chen, Wen-Sheng); Wang, W (Wang, Wei); Yang, JW (Yang, Jian-Wei); Tang, YY (Tang, Yuan Yan)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Locality-preserving projection (LPP) is a promising manifold-based dimensionality reduction and linear feature
extraction method for face recognition. However, there exist two main issues in traditional LPP algorithm. LPP does not
utilize the class label information at the training stage and its performance will be affected for classification tasks. In
addition, LPP often suffers from small sample size (3S) problem, which occurs when the dimension of input pattern space is
greater than the number of training samples. Under this situation, LPP fails to work. To overcome these two limitations, this
paper presents a novel supervised regularization LPP (SRLPP) approach based on a supervised graph and a new
regularization strategy. It theoretically proves that regularization matrix S-L(R) approaches to the original one as the
regularized parameter tends to zero. The proposed SRLPP method is subsequently applied to face recognition. The
experiments are conducted on two publicly available face databases, namely ORL database and FERET database.
Compared with some existing LDA-based and LPP-based linear feature extraction approaches, experimental results show
that our SRLPP approach gives superior performance.
地址: [Chen, Wen-Sheng; Wang, Wei] Shenzhen Univ, Coll Math & Computat Sci, Shenzhen 518060, Peoples R China.
[Yang, Jian-Wei] Nanjing Univ Informat Sci & Technol, Coll Math & Phys, Nanjing 210044, Peoples R China.
[Tang, Yuan Yan] Univ Macau, Dept Comp & Informat Sci, Macao, Peoples R China.
通讯作者地址: Chen, WS (通讯作者),Shenzhen Univ, Coll Math & Computat Sci, Shenzhen 518060, Peoples R China.
电子邮件地址: chenws@szu.edu.cn; maggicwangwei@163.com; yjianw2002@yahoo.com.cn; yytang@umac.mo
第 192 条，共 274 条
标题: Three-phase time-aware energy minimization with DVFS and unrolling for Chip Multiprocessors
作者: Qiu, MK (Qiu, Meikang); Ming, Z (Ming, Zhong); Li, JY (Li, Jiayin); Liu, SB (Liu, Shaobo); Wang, B (Wang, Bin);
Lu, ZH (Lu, Zhonghai)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: Energy consumption has been one of the most critical issues in the Chip Multiprocessor (CMP). Using the Dynamic
Voltage and Frequency Scaling (DVFS), a CMP system can achieve a balance between the performance and the
energy-efficiency. In this paper, we propose a three-phase discrete DVFS algorithm for a CMP system dedicated to
applications where the period of the applications' task graph is smaller than the deadline of tasks. In these applications,
multiple task graphs are unrolled and then concatenated together to form a new task graph. The proposed DVFS algorithm
is applied to the newly formed task graph to stretch tasks' execution time, lower operating frequencies of processors and
achieve the system power efficiency. Experimental results show that the proposed algorithm reduces the energy dissipation
by 25% on average, compared to previous DVFS approaches. (C) 2012 Elsevier B.V. All rights reserved.
地址: [Ming, Zhong] Shenzhen Univ, Coll Comp Sci & Software Engr, Shenzhen 518060, GD, Peoples R China.
[Qiu, Meikang; Li, Jiayin] Univ Kentucky, Dept Elec & Comp Engr, Lexington, KY 40506 USA.
[Liu, Shaobo] Marvell Semicond, Marlborough, MA 01752 USA.
[Wang, Bin] Wright State Univ, Dept Comp Sci & Engr, Dayton, OH 45435 USA.
[Lu, Zhonghai] KTH Royal Inst Technol, Sch ICT, Dept Elect Syst, Stockholm, Sweden.
通讯作者地址: Ming, Z (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engr, Shenzhen 518060, GD, Peoples R
China.
电子邮件地址: mqiu@engr.uky.edu; mingz@szu.edu.cn; jli6@engr.uky.edu; lewtiob@gmail.com; bin.wang@wright.edu;
zhonghai@kth.se
第 193 条，共 274 条
标题: An oblivious fragile watermarking scheme for images utilizing edge transitions in BTC bitmaps
作者: Zhang, Y (Zhang Yong); Lu, ZM (Lu ZheMing); Zhao, DN (Zhao DongNing)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: As one of the famous block-based image coding schemes, block truncation coding (BTC) has been also applied in
digital watermarking. Previous BTC-based watermarking or hiding schemes usually embed secret data by modifying the
BTC encoding stage or BTC-compressed data, obtaining the watermarked image with poorer quality than the
BTC-compressed version. This paper presents a new oblivious image watermarking scheme by exploiting BTC bitmaps.
Unlike the traditional schemes, our approach does not really perform the BTC compression on images during the
embedding process but utilizes the parity of the number of horizontal edge transitions in each BTC bitmap to guide the
watermark embedding and extraction processes. The embedding process starts by partitioning the original cover image into
non-overlapping 4x4 blocks and performing BTC on each block to obtain its BTC bitmap. One watermark bit is embedded
in each block by modifying at most three pixel values in the block to make sure that the parity of the number of horizontal
edge transitions in the bitmap of the modified block is equal to the embedded watermark bit. In the extraction stage, the
suspicious image is first partitioned into non-overlapping 4x4 blocks and BTC is performed on each block to obtain its
bitmap. Then, by checking the parity of the number of horizontal edge transitions in the bitmap, we can extract one
watermark bit in each block. Experimental results demonstrate that the proposed watermarking scheme is fragile to various
image processing operations while keeping the transparency very well.
地址: [Lu ZheMing] Zhejiang Univ, Sch Aeronaut & Astronaut, Hangzhou 310027, Peoples R China.
[Zhang Yong; Zhao DongNing] Shenzhen Univ, ATR Natl Def Technol Key Lab, Coll Informat Engn, Shenzhen 518060,
Peoples R China.
通讯作者地址: Lu, ZM (通讯作者),Zhejiang Univ, Sch Aeronaut & Astronaut, Hangzhou 310027, Peoples R China.
电子邮件地址: zheminglu@zju.edu.cn
第 194 条，共 274 条
标题: Design and simulation of a hierarchical priority fairness scheduler in an uplink Worldwide Interoperability for
Microwave Access system
作者: Nie, W (Nie, Wei); Wang, HJ (Wang, Houjun); Du, WF (Du, Wenfeng); Xiong, NX (Xiong, Naixue); Park, JH (Park,
Jong Hyuk)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: The IEEE 802.16 specification supports guarantees about quality of service (QoS) for transmitted packets, but does
not describe a scheduling algorithm that can achieve them. This paper presents a packet scheduling scheme that both
guarantees QoS as required, and ensures fairness among the subscriber stations. Our scheme uses a novel hierarchical
scheduling algorithm for the uplink of a Worldwide Interoperability for Microwave Access (WiMAX) system. We first
schedule the real-time service according to the QoS requirement. This meets maximum delay and packet loss requirements
of a subscriber station in WiMAX communication networks. In addition to satisfying the QoS requirements, we modify and
extend the Proportional Fairness scheduling algorithm to what we call the Subscriber Stations Based Proportional Fairness
algorithm, which allocates remaining bandwidth fairly amongst subscriber stations. The algorithm has been implemented
and evaluated in a WiMAX simulation platform developed in OPNET. From the simulation results, we can see not only the
QoS requirement is satisfied, but also it is fair to all subscriber stations in the WiMAX network.
地址: [Du, Wenfeng] Shenzhen Univ, Coll Comp Sci & Software Engn, Dept Comp Sci & Technol, Shenzhen, Peoples R
China.
[Nie, Wei; Wang, Houjun] Univ Elect Sci & Technol China, Sch Automat Engn, Chengdu 610054, Peoples R China.
[Xiong, Naixue] Georgia State Univ, Dept Comp Sci, Atlanta, GA 30303 USA.
[Park, Jong Hyuk] Seoul Natl Univ Sci & Technol, Dept Comp Sci & Engn, Seoul, South Korea.
通讯作者地址: Du, WF (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Dept Comp Sci & Technol,
Shenzhen, Peoples R China.
电子邮件地址: duwf@szu.edu.cn
第 195 条，共 274 条
标题: Thresholding Based on Maximum Weighted Object Correlation for Rail Defect Detection
作者: Li, QY (Li, Qingyong); Huang, YP (Huang, Yaping); Liang, ZP (Liang, Zhengping); Luo, SW (Luo, Siwei)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 1
摘要: Automatic thresholding is an important technique for rail defect detection, but traditional methods are not competent
enough to fit the characteristics of this application. This paper proposes the Maximum Weighted Object Correlation
(MWOC) thresholding method, fitting the features that rail images are unimodal and defect proportion is small. MWOC
selects a threshold by optimizing the product of object correlation and the weight term that expresses the proportion of
thresholded defects. Our experimental results demonstrate that MWOC achieves mis-classification error of 0.85%, and
outperforms the other well-established thresholding methods, including Otsu, maximum correlation thresholding, maximum
entropy thresholding and valley-emphasis method, for the application of rail defect detection.
地址: [Li, Qingyong; Huang, Yaping; Luo, Siwei] Beijing Jiaotong Univ, Sch Comp & Informat Technol, Beijing 100044,
Peoples R China.
[Liang, Zhengping] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Guangdong, Peoples R China.
通讯作者地址: Li, QY (通讯作者),Beijing Jiaotong Univ, Sch Comp & Informat Technol, Beijing 100044, Peoples R
China.
电子邮件地址: liqy@bjtu.edu.cn
第 196 条，共 274 条
标题: On-Demand Security Architecture for Cloud Computing
作者: Chen, JY (Chen, Jianyong); Wang, Y (Wang, Yang); Wang, XM (Wang, Xiaomin)
Web of Science 核心合集中的 "被引频次": 6
被引频次合计: 6
摘要: An architecture that differentiates security according to service-specific characteristics avoids an unnecessary drain
on IT resources by protecting a variety of cloud computing services at just the right level.
地址: [Chen, Jianyong; Wang, Xiaomin] Shenzhen Univ, Comp Sci & Technol Dept, Shenzhen, Peoples R China.
通讯作者地址: Chen, JY (通讯作者),Shenzhen Univ, Comp Sci & Technol Dept, Shenzhen, Peoples R China.
电子邮件地址: jychen@szu.edu.cn; wangyangwla@sina.com; wangxm@szu.edu.cn
第 197 条，共 274 条
标题: A novel STAP method for the detection of fast air moving targets from high speed platform
作者: Wu, RB (Wu RenBiao); Jia, QQ (Jia QiongQiong); Li, H (Li Hai)
Web of Science 核心合集中的 "被引频次": 4
被引频次合计: 4
摘要: Space-time adaptive processing (STAP) is an effective method for detecting moving target in airborne/spaceborne
radar. However, the detection of fast air moving targets from high speed platform is challenged by the range walk of both
the clutter and moving targets. It is well known that keystone formatting can be used to compensate for the range walk of
multiple moving targets simultaneously without using the knowledge of the motion parameters. However, in the presence of
serious Doppler ambiguity of fast air moving targets, distribution of the clutter will be affected by the keystone formatting
matched to the ambiguity number of targets, and as a result the STAP performance will degrade. In this paper, a novel
STAP method is proposed for the detection of fast air moving targets from high speed platform, which can deal with the
range walk of both clutter and targets. Effectiveness of the new method is verified via simulation examples.
地址: [Wu RenBiao; Jia QiongQiong; Li Hai] Civil Aviat Univ China, Tianjin Key Lab Adv Signal Proc, Tianjin 300300,
Peoples R China.
[Wu RenBiao] Shenzhen Univ, ATR Lab, Intelligent Informat Inst, Shenzhen 518060, Peoples R China.
通讯作者地址: Wu, RB (通讯作者),Civil Aviat Univ China, Tianjin Key Lab Adv Signal Proc, Tianjin 300300, Peoples R
China.
电子邮件地址: rbwu@cauc.edu.cn
第 198 条，共 274 条
标题: An improved shuffled frog-leaping algorithm with extremal optimisation for continuous optimisation
作者: Li, X (Li, Xia); Luo, JP (Luo, Jianping); Chen, MR (Chen, Min-Rong); Wang, N (Wang, Na)
Web of Science 核心合集中的 "被引频次": 20
被引频次合计: 24
摘要: Several types of evolutionary computing methods are documented in the literature and are well known for solving
unconstrained optimisation problems. This paper proposes a hybrid scheme that combines the merits of a global search
algorithm, the shuffled frog-leaping algorithm (SFLA) and local exploration, extremal optimisation (EO) and that exhibits
strong robustness and fast convergence for high-dimensional continuous function optimisation. A modified shuffled
frog-leaping algorithm (MSFLA) is investigated that improves the leaping rule by properly extending the leaping step size
and adding a leaping inertia component to account for social behaviour. To further improve the local search ability of
MSFLA and speed up convergence, we occasionally introduce EO, which has an excellent local exploration capability, in
the local exploration process of the MSFLA. It is characterised by alternating the coarse-grained Cauchy mutation and the
fine-grained Gaussian mutation. Compared with standard particle swarm optimisation (PSO), SFLA and MSFLA for six
widely used benchmark examples, the hybrid MSFIA-EO is shown to be a good and robust choice for solving
high-dimensional continuous function optimisation problems. It possesses excellent performance in terms of the mean
function values, the success rate and the fitness function evaluations (FFE), which is a rough measure of the complexity of
the algorithm. (C) 2010 Elsevier Inc. All rights reserved.
地址: [Li, Xia; Luo, Jianping; Chen, Min-Rong; Wang, Na] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060,
Peoples R China.
通讯作者地址: Li, X (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: lixia@szu.edu.cn
第 199 条，共 274 条
标题: Assessing and predicting protein interactions by combining manifold embedding with multiple information
integration
作者: Lei, YK (Lei, Ying-Ke); You, ZH (You, Zhu-Hong); Ji, Z (Ji, Zhen); Zhu, L (Zhu, Lin); Huang, DS (Huang,
De-Shuang)
Web of Science 核心合集中的 "被引频次": 5
被引频次合计: 5
摘要: Background: Protein-protein interactions (PPIs) play crucial roles in virtually every aspect of cellular function within
an organism. Over the last decade, the development of novel high-throughput techniques has resulted in enormous amounts
of data and provided valuable resources for studying protein interactions. However, these high-throughput protein
interaction data are often associated with high false positive and false negative rates. It is therefore highly desirable to
develop scalable methods to identify these errors from the computational perspective.
Results: We have developed a robust computational technique for assessing the reliability of interactions and predicting new
interactions by combining manifold embedding with multiple information integration. Validation of the proposed method
was performed with extensive experiments on densely-connected and sparse PPI networks of yeast respectively. Results
demonstrate that the interactions ranked top by our method have high functional homogeneity and localization coherence.
Conclusions: Our proposed method achieves better performances than the existing methods no matter assessing or
predicting protein interactions. Furthermore, our method is general enough to work over a variety of PPI networks
irrespectively of densely-connected or sparse PPI network. Therefore, the proposed algorithm is a much more promising
method to detect both false positive and false negative interactions in PPI networks.
地址: [Lei, Ying-Ke; You, Zhu-Hong; Huang, De-Shuang] Tongji Univ, Shanghai 200092, Peoples R China.
[Lei, Ying-Ke] Inst Elect Engn, Dept Informat, Hefei 230027, Anhui, Peoples R China.
[You, Zhu-Hong; Ji, Zhen] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Guangdong, Peoples R
China.
[Zhu, Lin] Univ Sci & Technol China, Dept Automat, Hefei 230027, Anhui, Peoples R China.
通讯作者地址: Huang, DS (通讯作者),Tongji Univ, 1239 Siping Rd, Shanghai 200092, Peoples R China.
电子邮件地址: huangdeshuang@yahoo.com
第 200 条，共 274 条
标题: Balance of Security Strength and Energy for a PMU Monitoring System in Smart Grid
作者: Qiu, MK (Qiu, Meikang); Su, H (Su, Hai); Chen, M (Chen, Min); Ming, Z (Ming, Zhong); Yang, LT (Yang,
Laurence T.)
Web of Science 核心合集中的 "被引频次": 8
被引频次合计: 8
摘要: An efficient dependable smart power grid relies on the secure real-time data collection and transmission service
provided by a monitoring system. In such a system, the measuring units, such as phasor measurement units (PMUs) and
smart meters (SMs), are critical. These measuring equipments function as sensors in the smart grid. Data exchanges
between these sensors and the central controller are protected by various security protocols. These protocols usually contain
computationally intensive cryptographic algorithms that cause heavy energy overhead to the sensor nodes. Since PMUs and
SMs are mostly energy-constrained, the problem of how to ensure the secure communication with minimum energy cost
becomes a critical issue for the functionality of the whole smart grid. In this article, we focus on the low power secure
communication of the PMUs and SMs. We take two wireless sensor platforms as examples to experimentally investigate the
approaches and principles of reconciling the two conflicting system requirements-communication security and low energy
consumptions. The proposed methods are general ones and applicable to other energy-constrained yet security sensitive
systems.
地址: [Qiu, Meikang; Chen, Min; Yang, Laurence T.] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan,
Peoples R China.
[Qiu, Meikang] Univ Kentucky, Lexington, KY 40506 USA.
[Chen, Min; Yang, Laurence T.] St Francis Xavier Univ, Antigonish, NS, Canada.
[Ming, Zhong] Shenzhen Univ, Shenzhen, Peoples R China.
通讯作者地址: Qiu, MK (通讯作者),Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan, Peoples R China.
电子邮件地址: mqiu@engr.uky.edu; hsu@engr.uky.edu; minchen@ieee.org; mingz@szu.edu.cn; ltyang@gmail.com
第 201 条，共 274 条
标题: Online optimization for scheduling preemptable tasks on IaaS cloud systems
作者: Li, JY (Li, Jiayin); Qiu, MK (Qiu, Meikang); Ming, Z (Ming, Zhong); Quan, G (Quan, Gang); Qin, X (Qin, Xiao);
Gu, ZH (Gu, Zonghua)
Web of Science 核心合集中的 "被引频次": 23
被引频次合计: 27
摘要: In Infrastructure-as-a-Service (IaaS) cloud computing, computational resources are provided to remote users in the
form of leases. For a cloud user, he/she can request multiple cloud services simultaneously. In this case, parallel processing
in the cloud system can improve the performance. When applying parallel processing in cloud computing, it is necessary to
implement a mechanism to allocate resource and schedule the execution order of tasks. Furthermore, a resource
optimization mechanism with preemptable task execution can increase the utilization of clouds. In this paper, we propose
two online dynamic resource allocation algorithms for the IaaS cloud system with preemptable tasks. Our algorithms adjust
the resource allocation dynamically based on the updated information of the actual task executions. And the experimental
results show that our algorithms can significantly improve the performance in the situation where resource contention is
fierce. (C) 2012 Elsevier Inc. All rights reserved.
地址: [Ming, Zhong] Shenzhen Univ, Coll Comp Sci & Software, Shenzhen 518060, Peoples R China.
[Li, Jiayin; Qiu, Meikang] Univ Kentucky, Dept Elec & Comp Engr, Lexington, KY 40506 USA.
[Quan, Gang] Florida Int Univ, Coll Engr & Comp, Miami, FL 33174 USA.
[Qin, Xiao] Auburn Univ, Dept Comp Sci & Software Engr, Auburn, AL 36849 USA.
[Gu, Zonghua] Zhejiang Univ, Coll Comp Sci, Hangzhou 310027, Zhejiang, Peoples R China.
通讯作者地址: Ming, Z (通讯作者),Shenzhen Univ, Coll Comp Sci & Software, Shenzhen 518060, Peoples R China.
电子邮件地址: jli6@engr.uky.edu; mqiu@engr.uky.edu; mingz@szu.edu.cn; Gang.Quan@fiu.edu; xqin@auburn.edu;
zgu@zju.edu.cn
第 202 条，共 274 条
标题: A novel text mining approach to financial time series forecasting
作者: Wang, BH (Wang, Baohua); Huang, HJ (Huang, Hejiao); Wang, XL (Wang, Xiaolong)
Web of Science 核心合集中的 "被引频次": 5
被引频次合计: 6
摘要: Financial time series forecasting has become a challenge because it is noisy, non-stationary and chaotic. Most of the
existing forecasting models for this problem do not take market sentiment into consideration. To overcome this limitation,
motivated by the fact that market sentiment contains some useful forecasting information, this paper uses textual
information to aid the financial time series forecasting and presents a novel text mining approach via combining ARIMA
and SVR (Support Vector Regression) to forecasting. The approach contains three steps: representing textual data as feature
vectors, using ARIMA to analyze the linear part and developing a SVR model based only on textual feature vector to model
the nonlinear part. To verify the effectiveness of the proposed approach, quarterly ROEs (Return of Equity) of six security
companies are chosen as the forecasting targets. Comparing with some existing state-of-the-art models, the proposed
approach gives superior results. It indicates that the proposed model that uses additional market sentiment provides a
promising alternative to financial time series prediction. (C) 2011 Elsevier B.V. All rights reserved.
地址: [Wang, Baohua; Huang, Hejiao; Wang, Xiaolong] Harbin Inst Technol, Shenzhen Grad Sch, Sch Comp Sci &
Technol, Shenzhen 518055, Peoples R China.
[Wang, Baohua] Shenzhen Univ, Coll Math & Computat Sci, Shenzhen 518060, Peoples R China.
通讯作者地址: Wang, BH (通讯作者),Harbin Inst Technol, Shenzhen Grad Sch, Sch Comp Sci & Technol, Shenzhen
518055, Peoples R China.
电子邮件地址: bhwang@szu.edu.cn
第 203 条，共 274 条
标题: Power minimization with derivative constraints for high dynamic GPS interference suppression
作者: Wu, RB (Wu RenBiao); Li, C (Li Chan); Lu, D (Lu Dan)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 5
摘要: In this paper, a novel adaptive interference suppression algorithm is proposed for high dynamic GPS (global
positioning system) receiver. The new method incorporates derivative constraints on the interference DOA (direction of
arrival) into power minimization approach, which could broaden the width of nulls in the interferences directions and adapt
to the rapid change of the interference directions. Compared with the traditional wide nulling algorithm based on the
derivative constraints, the new method does not have to know or estimate the DOAs of the desired signal and the
interference. The new method is firstly discussed in the context of spatial processing, and then extended to space-time
adaptive processing to mitigate wideband diffusive multipath interference. Effectiveness of the new method is verified via
simulation examples.
地址: [Wu RenBiao; Li Chan; Lu Dan] Civil Aviat Univ China, Tianjin Key Lab Adv Signal Proc, Tianjin 300300, Peoples
R China.
[Wu RenBiao] Shenzhen Univ, ATR Lab, Intelligent Informat Inst, Shenzhen 518060, Peoples R China.
通讯作者地址: Wu, RB (通讯作者),Civil Aviat Univ China, Tianjin Key Lab Adv Signal Proc, Tianjin 300300, Peoples R
China.
电子邮件地址: rbwu@cauc.edu.cn
第 204 条，共 274 条
标题: PSOPB: A Two-population Particle Swarm Optimizer Mimicking Facultative Bio-parasitic Behavior
作者: Qin, QD (Qin, Quande); Li, L (Li, Li); Li, RJ (Li, Rongjun); Niu, B (Niu, Ben)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Inspired by the phenomenon of bio-parasitic behavior in natural ecosystem, this paper presents a novel particle swarm
optimizer named PSOPB, in which particles are composed of the host and the parasite population. In the presented
algorithm, the two populations mimic facultative bio-parasitic behaviour and exchange particles according to particles'
fitness values sorted of each population in a certain number of iterations. The parasite mutation and the host immunity are
also considered to tie it closer to bio-parasitic behaviour as well as improve the algorithm performance. In order to embody
the law of "survival of the fittest" in biological evolution, the particles with poor fitness value in the host population are
removed and replaced by the same numbers of the re-initialization particles to maintain constant population size. The
experimental results of a set of 10 benchmark functions demonstrate the presented algorithm's efficacy.
地址: [Qin, Quande; Li, Li; Niu, Ben] Shenzhen Univ, Dept Management Sci, Shenzhen 518060, Guangdong, Peoples R
China.
[Li, Rongjun] S China Univ Technol, Guangzhou 510640, Guangdong, Peoples R China.
通讯作者地址: Qin, QD (通讯作者),Shenzhen Univ, Dept Management Sci, Shenzhen 518060, Guangdong, Peoples R
China.
电子邮件地址: qinquande@gmail.com; llii318@163.com; lirongjun1016@hotmail.com; drniuben@gmail.com
第 205 条，共 274 条
标题: Adaptive Rake receiver based on the nonlinear ACM technique
作者: Xie, N (Xie, Ning); Wang, H (Wang, Hui); Lin, XH (Lin, Xiaohui)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Ultra-wideband (UWB) system is one of the possible solutions to future short-range indoor data communications with
large frequency bandwidth. However, it must coexist with other narrowband wireless systems that may cause interference to
each other, and furthermore a large bandwidth will inevitably result in multi-path fading. The Rake receiver is applicable to
combat multi-path fading but its performance degrades greatly when the narrowband interference (NBI) is present.
Although some optimized Rake receivers were proposed to suppress the NBI, such as the minimum mean square error
(MMSE) one, their computational complexities are usually too high to be practically implemented. In this paper, we present
a new adaptive Rake receiver which can effectively suppress the NBI, based on the nonlinear Masreliez-type approximate
conditional mean (ACM) technique. Simulation results show that it outperforms the previous schemes and even it achieves
almost the same performance as that of a MMSE Rake receiver but with much lower complexity. Copyright (c) 2010 John
Wiley & Sons, Ltd.
地址: [Xie, Ning; Wang, Hui; Lin, Xiaohui] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Guangdong, Peoples R
China.
[Xie, Ning] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 210096, Jiangsu, Peoples R China.
[Xie, Ning] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples
R China.
通讯作者地址: Xie, N (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Guangdong, Peoples R China.
电子邮件地址: kensouren@yahoo.com.cn
第 206 条，共 274 条
标题: Multispectral image edge detection via Clifford gradient
作者: Xu, C (Xu Chen); Liu, H (Liu Hui); Cao, WM (Cao WenMing); Feng, JQ (Feng JiQiang)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 4
摘要: The edge detection of a multispectral image with a mass of image information is theoretically expected to give a more
accurate edge. Clifford algebra is more suitable for processing multidimensional data and expressing the data association
than general algebra. First, the basic properties of Clifford algebra are introduced. Second, the Clifford algebra description
of a multispectral image is introduced. Then, a novel multispectral image edge detection algorithm is proposed in terms of
the Clifford gradient. In the first two experiments, comparison of the detail achieved by the new algorithm with that from
the maximal entropy edge detection algorithm reveals that the edge detection based on Clifford gradient is better at retaining
and identifying edge information of the multispectral image than the maximal entropy edge detection algorithm. The
experiments using tuberculosis CT image show that the new algorithm has clinical value in reducing risk of misdiagnosis.
地址: [Liu Hui; Cao WenMing] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
[Xu Chen; Feng JiQiang] Shenzhen Univ, Inst Intelligent Comp Sci, Shenzhen 518060, Peoples R China.
通讯作者地址: Cao, WM (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: wmcao@szu.edu.cn
第 207 条，共 274 条
标题: Watch the Story Unfold with TextWheel: Visualization of Large-Scale News Streams
作者: Cui, WW (Cui, Weiwei); Qu, HM (Qu, Huamin); Zhou, H (Zhou, Hong); Zhang, WB (Zhang, Wenbin); Skiena, S
(Skiena, Steve)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Keyword-based searching and clustering of news articles have been widely used for news analysis. However, news
articles usually have other attributes such as source, author, date and time, length, and sentiment which should be taken into
account. In addition, news articles and keywords have complicated macro/micro relations, which include relations between
news articles (i.e., macro relation), relations between keywords (i.e., micro relation), and relations between news articles
and keywords (i.e., macro-micro relation). These macro/micro relations are time varying and pose special challenges for
news analysis.
In this article we present a visual analytics system for news streams which can bring multiple attributes of the news articles
and the macro/micro relations between news streams and keywords into one coherent analytical context, all the while
conveying the dynamic natures of news streams. We introduce a new visualization primitive called TextWheel which
consists of one or multiple keyword wheels, a document transportation belt, and a dynamic system which connects the
wheels and belt. By observing the TextWheel and its content changes, some interesting patterns can be detected. We use our
system to analyze several news corpora related to some major companies and the results demonstrate the high potential of
our method.
地址: [Cui, Weiwei; Qu, Huamin] Hong Kong Univ Sci & Technol, Dept Comp Sci & Technol, Hong Kong, Hong Kong,
Peoples R China.
[Zhou, Hong] Shenzhen Univ, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China.
[Zhang, Wenbin; Skiena, Steve] SUNY Stony Brook, Dept Comp Sci, Stony Brook, NY 11794 USA.
通讯作者地址: Cui, WW (通讯作者),Hong Kong Univ Sci & Technol, Dept Comp Sci & Technol, Hong Kong, Hong
Kong, Peoples R China.
电子邮件地址: weiwei@cse.ust.hk
第 208 条，共 274 条
标题: A Comparative Study of Palmprint Recognition Algorithms
作者: Zhang, D (Zhang, David); Zuo, WM (Zuo, Wangmeng); Yue, F (Yue, Feng)
Web of Science 核心合集中的 "被引频次": 6
被引频次合计: 7
摘要: Palmprint images contain rich unique features for reliable human identification, which makes it a very competitive
topic in biometric research. A great many different low resolution palmprint recognition algorithms have been developed,
which can be roughly grouped into three categories: holistic-based, feature-based, and hybrid methods. The purpose of this
article is to provide an updated survey of palmprint recognition methods, and present a comparative study to evaluate the
performance of the state-of-the-art palmprint recognition methods. Using the Hong Kong Polytechnic University (HKPU)
palmprint database (version 2), we compare the recognition performance of a number of holistic-based (Fisherpalms and
DCT+LDA) and local feature-based (competitive code, ordinal code, robust line orientation code, derivative of Gaussian
code, and wide line detector) methods, and then investigate the error correlation and score-level fusion performance of
different algorithms. After discussing the achievements and limitations of current palmprint recognition algorithms, we
conclude with providing several potential research directions for the future.
地址: [Zhang, David] Hong Kong Polytech Univ, Biometr Res Ctr, Dept Comp, Kowloon, Hong Kong, Peoples R China.
[Zhang, David] Shenzhen Univ, Harbin Inst Technol, Shenzhen, Peoples R China.
[Zuo, Wangmeng; Yue, Feng] Harbin Inst Technol, Sch Comp Sci & Technol, Harbin 150006, Peoples R China.
通讯作者地址: Zhang, D (通讯作者),Hong Kong Polytech Univ, Biometr Res Ctr, Dept Comp, Kowloon, Hong Kong,
Peoples R China.
电子邮件地址: csdzhang@comp.polyu.edu.hk; wmzuo@hit.edu.cn
第 209 条，共 274 条
标题: Localization Algorithm Based on Maximum a Posteriori in Wireless Sensor Networks
作者: Lu, KZ (Lu, Kezhong); Xiang, XH (Xiang, Xiaohua); Zhang, D (Zhang, Dian); Mao, R (Mao, Rui); Feng, YH (Feng,
Yuhong)
Web of Science 核心合集中的 "被引频次": 5
被引频次合计: 6
摘要: Many applications and protocols in wireless sensor networks need to know the locations of sensor nodes. A low-cost
method to localize sensor nodes is to use received signal strength indication (RSSI) ranging technique together with the
least-squares trilateration. However, the average localization error of this method is large due to the large ranging error of
RSSI ranging technique. To reduce the average localization error, we propose a localization algorithm based on maximum a
posteriori. This algorithm uses the Baye's formula to deduce the probability density of each sensor node's distribution in the
target region from RSSI values. Then, each sensor node takes the point with the maximum probability density as its
estimated location. Through simulation studies, we show that this algorithm outperforms the least-squares trilateration with
respect to the average localization error.
地址: [Lu, Kezhong; Xiang, Xiaohua; Zhang, Dian; Mao, Rui; Feng, Yuhong] Shenzhen Univ, Coll Comp Sci & Software
Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Lu, KZ (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: kzlu@szu.edu.cn
第 210 条，共 274 条
标题: Special Focus on Terahertz Science and Technology (0-132)
作者: Liu, SG (Liu ShengGang); Xie, WX (Xie WeiXin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
地址: [Liu ShengGang] Univ Elect Sci & Technol China, Chengdu 610054, Peoples R China.
[Xie WeiXin] Shenzhen Univ, Shenzhen, Peoples R China.
通讯作者地址: Liu, SG (通讯作者),Univ Elect Sci & Technol China, Chengdu 610054, Peoples R China.
第 211 条，共 274 条
标题: THz-TDS signal analysis and substance identification via the conformal split
作者: Xie, WX (Xie WeiXin); Li, J (Li Jing); Pei, JH (Pei JiHong)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 2
摘要: A terahertz time-domain spectroscopy (THz-TDS) imaging system can obtain high-dimensional signals with
substance fingerprint information. By introducing geometric algebra, a novel signal analysis approach to THz-TDS signals
is developed based on an optical physical mechanism. Using this approach, signals are represented with vectors in the
high-dimensional real vector space. Geometric distribution properties and algebraic relationships of THz-TDS signals are
deduced. It is proved that every complex refractive index of substances relates to a unique 2-blade, the vectors
corresponding to the samples of the same substance are collinear and belong to the intrinsic 2-blade of the substance. When
decomposed through the conformal split with respect to a 2-blade, THz-TDS signals of high dimensionality can be related
to vectors in a 2-dimensional subspace. Based on the conformal split properties we deduced, two criteria for substance
identification on the basis of THz-TDS signals are proposed. Accordingly, a novel substance identification method via the
conformal split is presented. In the method, the 2-blade related to each "known" substance is calculated with two vectors
corresponding to THz-TDS signals measured from samples of the substance but with different thicknesses. Using the
conformal split with respect to those 2-blades, an identified vector corresponding to a THz-TDS signal is linearly related to
the vector in a 2-dimensional subspace. The substance of a sample can be identified using criteria on the projected vectors
in the subspaces. This method can contribute to accurate classification and identification. Finally, two experiments are
presented that show the feasibility and accuracy of this method.
地址: [Xie WeiXin; Li Jing; Pei JiHong] Xidian Univ, Sch Elect Engn, Xian 710071, Peoples R China.
[Xie WeiXin; Li Jing; Pei JiHong] Shenzhen Univ, Intelligent Informat Inst, Shenzhen 518060, Peoples R China.
通讯作者地址: Li, J (通讯作者),Xidian Univ, Sch Elect Engn, Xian 710071, Peoples R China.
电子邮件地址: lijingzy@163.com
第 212 条，共 274 条
标题: Chaos-based joint compression and encryption algorithm for generating variable length ciphertext
作者: Lui, OY (Lui, Oi-Yan); Wong, KW (Wong, Kwok-Wo); Chen, JY (Chen, Jianyong); Zhou, JW (Zhou, Junwei)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 3
摘要: Here we modify a chaos-based joint compression and encryption algorithm previously proposed by us. Two
modifications are suggested for improving the compression performance and generating ciphertext with variable length,
respectively. The first goal is achieved by counting the number of distinct symbols visited by the chaotic search orbit, rather
than the total number of iterations of the chaotic map. The second objective is realized by introducing a user-chosen
parameter to determine the ratio between the search and the mask modes. The performance of the modified algorithm is
justified by simulation results using standard test files. (C) 2011 Elsevier B. V. All rights reserved.
地址: [Lui, Oi-Yan; Wong, Kwok-Wo; Zhou, Junwei] City Univ Hong Kong, Dept Elect Engn, Hong Kong, Hong Kong,
Peoples R China.
[Chen, Jianyong] Shenzhen Univ, Dept Comp Sci & Technol, Shenzhen 518060, Peoples R China.
通讯作者地址: Lui, OY (通讯作者),City Univ Hong Kong, Dept Elect Engn, Hong Kong, Hong Kong, Peoples R China.
电子邮件地址: oiyanlui2@student.cityu.edu.hk; itkwwong@cityu.edu.hk; jychen@szu.edu.cn; junweizhou@msn.com
第 213 条，共 274 条
标题: H (2)/H (a) control of networked control system with random time delays
作者: Qiu, L (Qiu Li); Xu, BG (Xu BuGong); Li, SB (Li ShanBin)
Web of Science 核心合集中的 "被引频次": 6
被引频次合计: 9
摘要: This paper investigates the H (2)/H (a) control problem for a class of discrete-time networked control systems with
random communication time delays. Both sensor-to-controller (S-C) and controller-to-actuator (C-A) random
network-induced delays are considered. Two independent Markov chains are used to model the S-C and C-A random
delays. The resulting closed-loop system is a jump linear time-delay system induced by two Markov chains. Sufficient
conditions for existence of H (2)/H (a) controller are established by free-weighting matrix and stochastic Lyapunov
functions. A simulation example illustrates the effectiveness of the proposed method.
地址: [Qiu Li; Xu BuGong; Li ShanBin] S China Univ Technol, Coll Automat Sci & Engn, Guangzhou 510640,
Guangdong, Peoples R China.
[Qiu Li] Shenzhen Univ, Coll Mechatron & Control Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Li, SB (通讯作者),S China Univ Technol, Coll Automat Sci & Engn, Guangzhou 510640, Guangdong,
Peoples R China.
电子邮件地址: lishb@scut.edu.cn
第 214 条，共 274 条
标题: An experimental comparison of gene selection by Lasso and Dantzig selector for cancer classification
作者: Zheng, SF (Zheng, Songfeng); Liu, WX (Liu, Weixiang)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 4
摘要: Selecting a subset of genes with strong discriminative power is a very important step in classification problems based
on gene expression data. Lasso and Dantzig selector are known to have automatic variable selection ability in linear
regression analysis. This paper applies Lasso and Dantzig selector to select the most informative genes for representing the
probability of an example being positive as a linear function of the gene expression data. The selected genes are further used
to fit different classifiers for cancer classification. Comparative experiments were conducted on six publicly available
cancer datasets, and the detailed comparison results show that in general, Lasso is more capable than Dantzig selector at
selecting informative genes for cancer classification. (C) 2011 Elsevier Ltd. All rights reserved.
地址: [Zheng, Songfeng] SW Missouri State Univ, Dept Math, Springfield, MO 65897 USA.
[Liu, Weixiang] Shenzhen Univ, Biomed Engn Lab, Sch Med, Shenzhen 518060, Guangdong, Peoples R China.
通讯作者地址: Zheng, SF (通讯作者),SW Missouri State Univ, Dept Math, 901 S Natl Ave, Springfield, MO 65897 USA.
电子邮件地址: SongfengZheng@MissouriState.edu; wxliu@szu.edu.cn
第 215 条，共 274 条
标题: Broadband Frequency Invariant Beamformer
作者: Xie, N (Xie, Ning); Wang, H (Wang, Hui); Liu, HW (Liu, Hongwei)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: In the broadband signal processing, the array has different relative aperture for the different frequency bins, which
results in waveform distortion. Moreover, the greater the bandwidth is, the more serious the distortion becomes. It is
valuable to study the Frequency-invariant beam patterns (FIBPs) for receiving broadband signals without distortion. Based
on the array dimensions, this paper will summarize some new methods to design a broadband beamformer with an FIBP.
There will be two categories: One-dimensional arrays and Multi-dimensional arrays. For one-dimensional array, there are
sampling rate method, minimax frequency invariant beamforming, etc. For multi-dimensional array, there are Bessel
function method, Bessel function and phase mode method, and so on. Finally, we will discuss the pros and cons of every
method.
地址: [Xie, Ning; Wang, Hui; Liu, Hongwei] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Guangdong, Peoples
R China.
[Xie, Ning] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 210096, Jiangsu, Peoples R China.
通讯作者地址: Xie, N (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Guangdong, Peoples R China.
电子邮件地址: kensouren@yahoo.com.cn
第 216 条，共 274 条
标题: Secure interoperation of identity managements among different circles of trust
作者: Chen, JY (Chen, Jianyong); Wu, GH (Wu, Guihua); Ji, Z (Ji, Zhen)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 3
摘要: Secure Interoperation between different identity management (IdM) systems has become a challenge. In this paper, a
framework is proposed to discover interoperation paths among identity providers (IdP) located in different circles of trust
(CoT). According to the proposed framework, interoperation path and path discovery algorithm are proposed to establish a
trust relationship between different CoTs. Security of the interoperation path is improved by the deployment of
authentication assurance level (AAL) conversion and role mapping. Moreover, security of the path discovery process is
guaranteed by path authentication which can resist security violation. (C) 2011 Elsevier B.V. All rights reserved.
地址: [Chen, Jianyong; Wu, Guihua; Ji, Zhen] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen City Key Lab
Embedded Syst Design, Shenzhen 518060, Peoples R China.
通讯作者地址: Ji, Z (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen City Key Lab Embedded
Syst Design, Shenzhen 518060, Peoples R China.
电子邮件地址: cjyok2000@hotmail.com
第 217 条，共 274 条
标题: Resource allocation robustness in multi-core embedded systems with inaccurate information
作者: Li, JY (Li, Jiayin); Ming, Z (Ming, Zhong); Qiu, MK (Qiu, Meikang); Quan, G (Quan, Gang); Qin, X (Qin, Xiao);
Chen, TZ (Chen, Tianzhou)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 2
摘要: Multi-core technologies are widely used in embedded systems and the resource allocation is vita to guarantee Quality
of Service (QoS) requirements for applications on multi-core platforms. For heterogeneous multi-core systems, the
statistical characteristics of execution times on different cores play a critical role in the resource allocation, and the
differences between the actual execution time and the estimated execution time may significantly affect the performance of
resource allocation and cause system to be less robust. In this paper, we present an evaluation method to study the impacts
of inaccurate execution time information to the performance of resource allocation. We propose a systematic way to
measure the robustness degradation of the system and evaluate how inaccurate probability parameters may affect the
performance of resource allocations. Furthermore, we compare the performance of three widely used greedy heuristics
when using the inaccurate information with simulations. (C) 2011 Elsevier B.V. All rights reserved.
地址: [Ming, Zhong] Shenzhen Univ, Coll Comp Sci & Software Engr, Shenzhen 518060, GD, Peoples R China.
[Li, Jiayin; Qiu, Meikang] Univ Kentucky, Dept Elec & Comp Engr, Lexington, KY 40506 USA.
[Quan, Gang] Florida Int Univ, Dept Elec & Comp Engr, Miami, FL 33174 USA.
[Qin, Xiao] Auburn Univ, Dept Comp Sci & Software Engr, Auburn, AL 36849 USA.
[Chen, Tianzhou] Zhejiang Univ, Coll Comp Sci, Hangzhou 310027, ZJ, Peoples R China.
通讯作者地址: Ming, Z (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engr, Shenzhen 518060, GD, Peoples R
China.
电子邮件地址: jli6@engr.uky.edu; mingz@szu.edu.cn; mqiu@engr.uky.edu; Gang.Quan@fiu.edu; xqin@auburn.edu;
tzchen@zju.edu.cn
第 218 条，共 274 条
标题: Kernel machine-based rank-lifting regularized discriminant analysis method for face recognition
作者: Chen, WS (Chen, Wen-Sheng); Yuen, PC (Yuen, Pong Chi); Xie, XH (Xie, Xuehui)
Web of Science 核心合集中的 "被引频次": 12
被引频次合计: 12
摘要: To address two problems, namely nonlinear problem and singularity problem, of linear discriminant analysis (LDA)
approach in face recognition, this paper proposes a novel kernel machine-based rank-lifting regularized discriminant
analysis (KRLRDA) method. A rank-lifting theorem is first proven using linear algebraic theory. Combining the rank-lifting
strategy with three-to-one regularization technique, the complete regularized methodology is developed on the within-class
scatter matrix. The proposed regularized scheme not only adjusts the projection directions but tunes their corresponding
weights as well. Moreover, it is shown that the final regularized within-class scatter matrix approaches to the original one as
the regularized parameter tends to zero. Two public available databases, namely FERET and CMU PIE face databases, are
selected for evaluations. Compared with some existing kernel-based LDA methods, the proposed KRLRDA approach gives
superior performance. (C) 2011 Elsevier B.V. All rights reserved.
地址: [Chen, Wen-Sheng; Xie, Xuehui] Shenzhen Univ, Coll Math & Computat Sci, Inst Intelligent Comp Sci, Shenzhen
518060, Peoples R China.
[Yuen, Pong Chi] Hong Kong Baptist Univ, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China.
通讯作者地址: Chen, WS (通讯作者),Shenzhen Univ, Coll Math & Computat Sci, Inst Intelligent Comp Sci, Shenzhen
518060, Peoples R China.
电子邮件地址: chenws@szu.edu.cn; pcyuen@comp.hkbu.edu.hk
第 219 条，共 274 条
标题: DNA Sequence Compression Using Adaptive Particle Swarm Optimization-Based Memetic Algorithm
作者: Zhu, ZX (Zhu, Zexuan); Zhou, JR (Zhou, Jiarui); Ji, Z (Ji, Zhen); Shi, YH (Shi, Yu-Hui)
Web of Science 核心合集中的 "被引频次": 22
被引频次合计: 30
摘要: With the rapid development of high-throughput DNA sequencing technologies, the amount of DNA sequence data is
accumulating exponentially. The huge influx of data creates new challenges for storage and transmission. This paper
proposes a novel adaptive particle swarm optimization-based memetic algorithm (POMA) for DNA sequence compression.
POMA is a synergy of comprehensive learning particle swarm optimization (CLPSO) and an adaptive intelligent single
particle optimizer (AdpISPO)-based local search. It takes advantage of both CLPSO and AdpISPO to optimize the design of
approximate repeat vector (ARV) codebook for DNA sequence compression. ARV is first introduced in this paper to
represent the repeated fragments across multiple sequences in direct, mirror, pairing, and inverted patterns. In POMA,
candidate ARV codebooks are encoded as particles and the optimal solution, which covers the most approximate repeated
fragments with the fewest base variations, is identified through the exploration and exploitation of POMA. In each iteration
of POMA, the leader particles in the swarm are selected based on weighted fitness values and each leader particle is
fine-tuned with an AdpISPO-based local search, so that the convergence of the search in local region is accelerated. A
detailed comparison study between POMA and the counterpart algorithms is performed on 29 (23 basic and 6 composite)
benchmark functions and 11 real DNA sequences. POMA is observed to obtain better or competitive performance with a
limited number of function evaluations. POMA also attains lower bits-per-base than other state-of-the-art DNA-specific
algorithms on DNA sequence data. The experimental results suggest that the cooperation of CLPSO and AdpISPO in the
framework of memetic algorithm is capable of searching the ARV codebook space efficiently.
地址: [Zhu, Zexuan; Ji, Zhen] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen City Key Lab Embedded Syst
Design, Shenzhen 518060, Peoples R China.
[Zhou, Jiarui] Zhejiang Univ, Coll Biomed Engn & Instrument Sci, Hangzhou 310027, Zhejiang, Peoples R China.
[Shi, Yu-Hui] Xian Jiaotong Liverpool Univ, Dept Elect & Elect Engn, Suzhou 215123, Peoples R China.
通讯作者地址: Zhu, ZX (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen City Key Lab Embedded
Syst Design, Shenzhen 518060, Peoples R China.
电子邮件地址: jizhen@szu.edu.cn
第 220 条，共 274 条
标题: Chaos-based multi-objective immune algorithm with a fine-grained selection mechanism
作者: Chen, JY (Chen, Jianyong); Lin, QZ (Lin, Qiuzhen); Ji, Z (Ji, Zhen)
Web of Science 核心合集中的 "被引频次": 7
被引频次合计: 7
摘要: In this paper, we propose a chaos-based multi-objective immune algorithm (CMIA) with a fine-grained selection
mechanism based on the clonal selection principle. Taking advantage of the ergodic and stochastic properties of chaotic
sequence, a novel mutation operator, named as chaos-based mutation (CM) operator, is proposed. Moreover, the
information of diversity estimation is also adopted in the CM operator for nondominated solutions to adjust mutation steps
adaptively, which encourages searching less-crowded regions with relative large step sizes. When comparing with
polynomial mutation operator that is used in many state-of-the-art multi-objective optimization evolutionary algorithms,
simulations show that it is effective to enhance the search performance. On the other hand, in order to increase the
population diversity, a fine-grained selection mechanism is proposed in this paper, which seems to be remarkably effective
in two-objective benchmark functions. When comparing with two state-of-the-art multi-objective evolutionary algorithms
(NSGA-II and SPEA-2) and a new multi-objective immune algorithm (NNIA), simulation results of CMIA indicate the
effectiveness of the fine-grained selection mechanism and the remarkable performance in finding the true Pareto-optimal
front, especially on some benchmark functions with many local Pareto-optimal fronts.
地址: [Chen, Jianyong; Lin, Qiuzhen; Ji, Zhen] Shenzhen Univ, Dept Comp Sci & Technol, Shenzhen 518060, Peoples R
China.
通讯作者地址: Chen, JY (通讯作者),Shenzhen Univ, Dept Comp Sci & Technol, Shenzhen 518060, Peoples R China.
电子邮件地址: jychen@szu.edu.cn; qiuzheng658@163.com
第 221 条，共 274 条
标题: AN IMMUNE-INSPIRED EVOLUTION STRATEGY FOR CONSTRAINED OPTIMIZATION PROBLEMS
作者: Chen, JY (Chen, Jianyong); Lin, QZ (Lin, Qiuzhen); Shen, LL (Shen, Linlin)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Based on clonal selection principle, this paper proposes an immune-inspired evolution strategy (IIES) for constrained
optimization problems with two improvements. Firstly, in order to enhance global search capability, more clones are
produced by individuals that have far-off nearest neighbors in the less-crowed regions. On the other hand, immune update
mechanism is proposed to replace the worst individuals in clone population with the best individuals stored in immune
memory in every generation. Therefore, search direction can always focus on the fittest individuals. These proposals are
able to avoid being trapped in local optimal regions and remarkably enhance global search capability. In order to examine
the optimization performance of IIES, 13 well-known benchmark test functions are used. When comparing with various
state-of-the-arts and recently proposed competent algorithms, simulation results show that IIES performs better or
comparably in most cases.
地址: [Chen, Jianyong; Lin, Qiuzhen; Shen, Linlin] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen City Key
Lab Embedded Syst Design, Shenzhen 518060, Peoples R China.
[Shen, Linlin] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing, Peoples R
China.
通讯作者地址: Chen, JY (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen City Key Lab
Embedded Syst Design, Shenzhen 518060, Peoples R China.
电子邮件地址: cjyok2000@hotmail.com; qiuzheng658@163.com; llshen@szu.edu.cn
第 222 条，共 274 条
标题: Comments on Shao-Cao's Unidirectional Proxy Re-Encryption Scheme from PKC 2009
作者: Chen, MR (Chen, Min-Rong); Zhang, X (Zhang, Xi); Li, X (Li, Xia)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Proxy re-encryption (PRE), introduced by Blaze, Bleumer and Strauss, allows a semirusted proxy to convert a
ciphertext originally intended for Alice into an encryption of the same message intended for Bob. In PKC'09, Shao and Can
proposed a unidirectional PRE scheme without pairings, and compared their scheme with Libert-Vergnaud's pairing-based
unidirectional PRE scheme from PKC'08. In this paper, we indicated that Shao-Cao's scheme is not secure against
chosen-plaintext attack in Libert-Vergnaud's security model.
地址: [Zhang, Xi] Shenzhen Univ, Coll Comp & Software, Shenzhen 518060, Peoples R China.
[Chen, Min-Rong; Li, Xia] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
[Chen, Min-Rong] Jinan Univ, Sch Management, Guangzhou 510632, Guangdong, Peoples R China.
通讯作者地址: Zhang, X (通讯作者),Shenzhen Univ, Coll Comp & Software, Shenzhen 518060, Peoples R China.
第 223 条，共 274 条
标题: FPCODE: AN EFFICIENT APPROACH FOR MULTI-MODAL BIOMETRICS
作者: Shen, LL (Shen, Linlin); Bai, L (Bai, Li); Ji, Z (Ji, Zhen)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 4
摘要: Although face recognition technology has progressed substantially, its performance is still not satisfactory due to the
challenges of great variations in illumination, expression and occlusion. This paper aims to improve the accuracy of
personal identification, when only few samples are registered as templates, by integrating multiple modal biometrics, i.e.
face and palmprint. We developed in this paper a feature code, namely FPCode, to represent the features of both face and
palmprint. Though feature code has been used for palmprint recognition in literature, it is first applied in this paper for face
recognition and multi-modal biometrics. As the same feature is used, fusion is much easier. Experimental results show that
both feature level and decision level fusion strategies achieve much better performance than single modal biometrics. The
proposed approach uses fixed length 1/0 bits coding scheme that is very efficient in matching, and at the same time achieves
higher accuracy than other fusion methods available in literature.
地址: [Shen, Linlin] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing, Peoples
R China.
[Ji, Zhen] Shenzhen Univ, Sch Comp Sci & Software Engn, Shenzhen Key Lab Embedded Syst Design, Shenzhen,
Guangdong, Peoples R China.
[Bai, Li] Univ Nottingham, Sch Comp Sci, Nottingham NG8 1BB, England.
通讯作者地址: Shen, LL (通讯作者),Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching
Technol, Beijing, Peoples R China.
第 224 条，共 274 条
标题: Optimization between security and delay of quality-of-service
作者: Chen, JY (Chen, Jianyong); Zeng, HW (Zeng, Huawang); Hu, CY (Hu, Cunying); Ji, Z (Ji, Zhen)
Web of Science 核心合集中的 "被引频次": 4
被引频次合计: 4
摘要: Quality of service (QoS) and security have been considered as two independent entities. However, they always
impact each other in various kinds of scenarios and it is necessary to study the optimization between them. This paper
proposes algorithms to evaluate security level with three main features, i.e., authentication, data integrity and
confidentiality. Based on that, a novel model is proposed to measure the interaction between delay of QoS and security in
different application scenarios, heterogeneous users and disparate services. Furthermore, immune algorithm is used to get
optimal parameters for both delay and the security level. Simulation results show that the proposed model can balance delay
and security level well under diverse traffic loads of network. The model is useful to get better performance for network
service, especially in rigorous network circumstance. (C) 2010 Elsevier Ltd. All rights reserved.
地址: [Chen, Jianyong; Zeng, Huawang; Hu, Cunying; Ji, Zhen] Shenzhen Univ, Coll Comp Sci & Software Engn,
Shenzhen City Key Lab Embedded Syst Design, Shenzhen 518060, Peoples R China.
通讯作者地址: Chen, JY (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen City Key Lab
Embedded Syst Design, Shenzhen 518060, Peoples R China.
电子邮件地址: cjyok2000@hotmail.com
第 225 条，共 274 条
标题: A method of workflow scheduling based on colored Petri nets
作者: Xiao, ZJ (Xiao, Zhijiao); Ming, Z (Ming, Zhong)
Web of Science 核心合集中的 "被引频次": 4
被引频次合计: 9
摘要: Effective methods of workflow scheduling can improve the performance of workflow systems. Based on the study of
existing scheduling methods, a method of workflow scheduling, called phased method, is proposed. This method is based
on colored Petri nets. Activities of workflows are divided into several groups to be scheduled in different phases using this
method. Details of the method are discussed. Experimental results show that the proposed method can deal with the
uncertainties and the dynamic circumstances very well and a satisfactory balance can be achieved between static global
optimization and dynamic local optimization. (C) 2010 Elsevier B.V. All rights reserved.
地址: [Xiao, Zhijiao; Ming, Zhong] Shenzhen Univ, Sch Comp & Software Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Ming, Z (通讯作者),Shenzhen Univ, Sch Comp & Software Engn, Nanhai Ave 3688, Shenzhen 518060,
Peoples R China.
电子邮件地址: cindyxzj@yahoo.com.cn; mingz@szu.edu.cn
第 226 条，共 274 条
标题: Local margin based semi-supervised discriminant embedding for visual recognition
作者: Pan, F (Pan, Feng); Wang, JD (Wang, Jiandong); Lin, XH (Lin, Xiaohui)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 3
摘要: Most manifold learning algorithms adopt the k nearest neighbors function to construct the adjacency graph. However,
severe bias may be introduced in this case if the samples are not uniformly distributed in the ambient space. In this paper a
semi-supervised dimensionality reduction method is proposed to alleviate this problem. Based on the notion of local margin,
we simultaneously maximize the separability between different classes and estimate the intrinsic geometric structure of the
data by both the labeled and unlabeled samples. For high-dimensional data, a discriminant subspace is derived via
maximizing the cumulative local margins. Experimental results on high-dimensional classification tasks demonstrate the
efficacy of our algorithm. (C) 2010 Elsevier B.V. All rights reserved.
地址: [Lin, Xiaohui] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100088,
Peoples R China.
[Pan, Feng; Wang, Jiandong] Nanjing Univ Aeronaut & Astronaut, Coll Informat Sci & Technol, Nanjing 210016, Peoples
R China.
[Pan, Feng] Shenzhen Univ, Coll Management, Shenzhen 518060, Guangdong, Peoples R China.
[Lin, Xiaohui] Shenzhen Univ, Coll Informat Engineer, Shenzhen 518060, Guangdong, Peoples R China.
通讯作者地址: Lin, XH (通讯作者),Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol,
Beijing 100088, Peoples R China.
电子邮件地址: xhlin@szu.edu.cn
第 227 条，共 274 条
标题: Cryptanalysis of a certificateless signcryption scheme in the standard model
作者: Weng, JA (Weng, Jian); Yao, GX (Yao, Guoxiang); Deng, RH (Deng, Robert H.); Chen, MR (Chen, Min-Rong); Li,
XX (Li, Xiangxue)
Web of Science 核心合集中的 "被引频次": 10
被引频次合计: 17
摘要: Certificateless signcryption is a useful primitive which simultaneously provides the functionalities of certificateless
encryption and certificateless signature. Recently, Liu et al. 1151 proposed a new certificateless signcryption scheme, and
claimed that their scheme is provably secure without random oracles in a strengthened security model, where the
malicious-but-passive KGC attack is considered. Unfortunately, by giving concrete attacks, we indicate that Liu et al.
certificateless signcryption scheme is not secure in this strengthened security model. (C) 2010 Elsevier Inc. All rights
reserved.
地址: [Weng, Jian; Yao, Guoxiang] Jinan Univ, Dept Comp Sci, Guangzhou 510632, Guangdong, Peoples R China.
[Weng, Jian] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876,
Peoples R China.
[Weng, Jian] Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China.
[Deng, Robert H.] Singapore Management Univ, Sch Informat Syst, Singapore 178902, Singapore.
[Chen, Min-Rong] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
[Li, Xiangxue] E China Normal Univ, Dept Comp Sci & Technol, Shanghai 200241, Peoples R China.
通讯作者地址: Yao, GX (通讯作者),Jinan Univ, Dept Comp Sci, Guangzhou 510632, Guangdong, Peoples R China.
电子邮件地址: cryptjweng@gmail.com
第 228 条，共 274 条
标题: OpinionSeer: Interactive Visualization of Hotel Customer Feedback
作者: Wu, YC (Wu, Yingcai); Wei, FR (Wei, Furu); Liu, SX (Liu, Shixia); Au, N (Au, Norman); Cui, WW (Cui, Weiwei);
Zhou, H (Zhou, Hong); Qu, HM (Qu, Huamin)
Web of Science 核心合集中的 "被引频次": 18
被引频次合计: 19
摘要: The rapid development of Web technology has resulted in an increasing number of hotel customers sharing their
opinions on the hotel services,. Effective visual analysis of online customer opinions is needed, as it has a significant impact
on building a successful business. In this paper, we present OpinionSeer, an interactive visualization system that could
visually analyze a large collection of online hotel customer reviews. The system is built on a new visualization-centric
opinion mining technique that considers uncertainty for faithfully modeling and analyzing customer opinions. A new visual
representation is developed to convey customer opinions by augmenting well-established scatterplots and radial
visualization. To provide multiple-level exploration, we introduce subjective logic to handle and organize subjective
opinions with degrees of uncertainty. Several case studies illustrate the effectiveness and usefulness of OpinionSeer on
analyzing relationships among multiple data dimensions and comparing opinions of different groups. Aside from data on
hotel customer feedback, OpinionSeer could also be applied to visually analyze customer opinions on other products or
services.
地址: [Wu, Yingcai; Cui, Weiwei; Qu, Huamin] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Hong
Kong, Peoples R China.
[Wei, Furu] IBM China Res Lab, Beijing, Peoples R China.
[Au, Norman] Hong Kong Polytech Univ, Sch Hotel & Tourism Managment, Kowloon, Hong Kong, Peoples R China.
[Zhou, Hong] Shenzhen Univ, Shenzhen, Peoples R China.
通讯作者地址: Wu, YC (通讯作者),Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Hong Kong,
Peoples R China.
电子邮件地址: wuyc@cse.ust.hk; weifuru@cn.ibm.com; shixia@gmail.com; hmnorman@polyu.edu.hk;
weiwei@cse.ust.hk; hzhou@szu.edu.cn; huamin@cse.ust.hk
第 229 条，共 274 条
标题: Approximation algorithm for minimizing relay node placement in wireless sensor networks
作者: Lu, KZ (Lu KeZhong); Chen, GL (Chen GuoLiang); Feng, YH (Feng YuHong); Liu, G (Liu Gang); Mao, R (Mao
Rui)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 3
摘要: To eliminate the routing load unbalance among sensor nodes, one approach is to deploy a small number of powerful
relay nodes acting as routing nodes in wireless sensor networks, the major optimization objective of which is to minimize
the number of relay nodes required. In this paper, we prove that the relay node placement problem in a bounded plane is a P
problem, but its computational complexity in general case is quite great. From the geometric cover feature of the relay node
placement problem, an O(n (2) log n) time greedy approximation algorithm is proposed, where n is the number of sensor
nodes. Particularly, at each stage of this algorithm's iterative process, we first select a critical node from uncovered sensor
nodes, and then determine the location of relay node based on the principle of preferring to cover the sensor node closer to
the critical node, so as to prevent the emergence of isolated node. Experiment results indicate that our proposed algorithm
can generate a near optimum feasible relay node deployment in a very short time, and it outperforms existing algorithms in
terms of both the size of relay node deployment and the execution time.
地址: [Lu KeZhong; Chen GuoLiang; Feng YuHong; Liu Gang; Mao Rui] Shenzhen Univ, Coll Comp Sci & Software
Engn, Shenzhen 518060, Peoples R China.
[Lu KeZhong; Chen GuoLiang; Feng YuHong; Liu Gang; Mao Rui] Natl High Performance Comp Ctr Shenzhen, Shenzhen
518060, Peoples R China.
通讯作者地址: Lu, KZ (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: kzlu@szu.edu.cn
第 230 条，共 274 条
标题: Unified modelling and analysis of collaboration business process based on Petri nets and Pi calculus
作者: Zhang, L (Zhang, L.); Lu, Y (Lu, Y.); Xu, F (Xu, F.)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 4
摘要: Collaboration business processes enable organisations to communicate, interact and cooperate with each other to
achieve their business goals. It becomes more and more important to model and analyse collaboration business processes to
guarantee their correctness and consistence. Among various formal methods, Petri nets have become one of the major
formal methods due to its strong mathematical foundation, rich analysis techniques and graphical representations. Pi
calculus, a branch of process algebra, has been proved to be more capable in modelling interactions and mobility. In this
paper, we introduce a mapping model between these two formal methods, which integrates the local flow model of Petri
nets and the interaction model of Pi calculus to describe collaboration business processes. The state graphs of Petri nets and
Pi calculus are combined together to analyse the structure soundness of the unified model. A collaborative reduction tool is
developed to support the unified modelling and analysis method.
地址: [Zhang, L.; Xu, F.] Tsinghua Univ, Sch Software, Beijing 100084, Peoples R China.
[Lu, Y.] Shenzhen Univ, Coll Software, Shenzhen 518060, Peoples R China.
通讯作者地址: Zhang, L (通讯作者),Tsinghua Univ, Sch Software, Beijing 100084, Peoples R China.
电子邮件地址: lizhang@tsinghua.edu.cn
第 231 条，共 274 条
标题: Reliable and efficient service composition based on smart objects' state information
作者: Feng, YH (Feng, Yuhong); Cao, JN (Cao, Jiannong); Sun, Y (Sun, Yan); Wu, WG (Wu, Weigang); Chen, CF (Chen,
Canfeng); Ma, J (Ma, Jian)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Service composition is a mechanism to combine two or more services to form a composite service for delivering the
users' desirable functionalities. Existing service composition system in pervasive computing does not capture state
information of the smart objects (SOs). Based on the study of relationships of SOs' states and services, we identify
unqualified composite services generated by existing service composition systems, which are either inefficiently executed
or fail to complete their execution. This handicaps the applications of pervasive computing because its applications like
health care normally need more reliable and timing services. In this paper, we first formally model SOs' states and their
transitions using finite state machines and propose extending existing service description technologies using the SOs' state
information. The obtained information is then used in designing an algorithm to compose SOs' services, which avoids
generating the identified unqualified composite services. The proof of the efficiency of the composite services obtained by
our proposed algorithms is elaborated. Finally, a performance study was conducted to evaluate our algorithm against the
one without considering SO state information. Our experimental results show that the composite services generated using
our algorithm can execute faster and more reliably.
地址: [Feng, Yuhong] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
[Feng, Yuhong] Natl High Performance Comp Ctr Shenzhen, Shenzhen 518060, Peoples R China.
[Cao, Jiannong; Sun, Yan] Hong Kong Polytech Univ, Dept Comp, Kowloon, Hong Kong, Peoples R China.
[Wu, Weigang] Sun Yat Sen Univ, Dept Comp Sci, Guangzhou 510275, Guangdong, Peoples R China.
[Chen, Canfeng; Ma, Jian] Nokia Res Ctr, Beijing, Peoples R China.
通讯作者地址: Feng, YH (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R
China.
电子邮件地址: yuhongf@szu.edu.cn; csjcao@comp.polyu.edu.hk
第 232 条，共 274 条
标题: Localized affine transform resistant watermarking in region-of-interest
作者: Zhang, L (Zhang, Li); Zhou, PP (Zhou, Ping-Ping)
Web of Science 核心合集中的 "被引频次": 7
被引频次合计: 7
摘要: Many proposed image watermarking techniques are sensitive to affine transforms, such as rotation, scaling and
translation. In this paper, a localized affine transform resistant watermarking is designed utilizing Krawtchouk transform
and dual channel detection. Watermark is inserted into the significant Krawtchouk invariant moment. Watermarking based
on Krawtchouk moments is local, which permits to the watermark to be embedded at the most significant information-wise
portion. Watermark embedding intensity is modified according to the results of performance analysis. The convergence of
closed loop embedding system is proved. An optimum watermark detector is designed with the introduction of dual channel
detection utilizing high order spectra detection and likelihood detection. The detector extracts watermark blindly utilizing
Independent Component Analysis. The computational aspects of the proposed watermarking are discussed. Experimental
results demonstrate that this watermarking is robust with respect to attacks produced by watermark benchmark-Stirmark.
地址: [Zhang, Li] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876,
Peoples R China.
[Zhang, Li; Zhou, Ping-Ping] Shenzhen Univ, Fac Informat Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Zhang, L (通讯作者),Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching
Technol, Beijing 100876, Peoples R China.
电子邮件地址: wzhangli@szu.edu.cn; pingp_zhou@163.com
第 233 条，共 274 条
标题: Towards a Memetic Feature Selection Paradigm
作者: Zhu, ZX (Zhu, Zexuan); Jia, S (Jia, Sen); Ji, Z (Ji, Zhen)
Web of Science 核心合集中的 "被引频次": 27
被引频次合计: 27
地址: [Zhu, Zexuan; Jia, Sen; Ji, Zhen] Shenzhen Univ, Shenzhen, Peoples R China.
通讯作者地址: Zhu, ZX (通讯作者),Shenzhen Univ, Shenzhen, Peoples R China.
第 234 条，共 274 条
标题: Identification of Full and Partial Class Relevant Genes
作者: Zhu, ZX (Zhu, Zexuan); Ong, YS (Ong, Yew-Soon); Zurada, JM (Zurada, Jacek M.)
Web of Science 核心合集中的 "被引频次": 12
被引频次合计: 12
摘要: Multiclass cancer classification on microarray data has provided the feasibility of cancer diagnosis across all of the
common malignancies in parallel. Using multiclass cancer feature selection approaches, it is now possible to identify genes
relevant to a set of cancer types. However, besides identifying the relevant genes for the set of all cancer types, it is deemed
to be more informative to biologists if the relevance of each gene to specific cancer or subset of cancer types could be
revealed or pinpointed. In this paper, we introduce two new definitions of multiclass relevancy features, i.e., full class
relevant (FCR) and partial class relevant (PCR) features. Particularly, FCR denotes genes that serve as candidate biomarkers
for discriminating all cancer types. PCR, on the other hand, are genes that distinguish subsets of cancer types. Subsequently,
a Markov blanket embedded memetic algorithm is proposed for the simultaneous identification of both FCR and PCR
genes. Results obtained on commonly used synthetic and real-world microarray data sets show that the proposed approach
converges to valid FCR and PCR genes that would assist biologists in their research work. The identification of both FCR
and PCR genes is found to generate improvement in classification accuracy on many microarray data sets. Further
comparison study to existing state-of-the-art feature selection algorithms also reveals the effectiveness and efficiency of the
proposed approach.
地址: [Zhu, Zexuan] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
[Ong, Yew-Soon] Nanyang Technol Univ, Sch Comp Engn, Singapore 639798, Singapore.
[Zurada, Jacek M.] Univ Louisville, Dept Elect & Comp Engn, Computat Intelligence Lab, Louisville, KY 40292 USA.
通讯作者地址: Zhu, ZX (通讯作者),Shenzhen Univ, Coll Comp Sci & Software Engn, 345 Adm Bldg, Shenzhen 518060,
Peoples R China.
电子邮件地址: zhuzx@szu.edu.cn; asysong@ntu.edu.sg; jacek.zurada@louisville.edu
第 235 条，共 274 条
标题: Correlation matching method for the weak stationarity test of LRD traffic
作者: Li, M (Li, Ming); Chen, WS (Chen, Wen-Sheng); Han, LX (Han, Lixin)
Web of Science 核心合集中的 "被引频次": 16
被引频次合计: 16
摘要: The stationarity test of long-range dependent (LRD) traffic remains a challenge problem in the field of traffic
engineering. Due to the importance of traffic theory in the Internet, to find a solution to that problem is greatly desired. This
paper presents a method of the weak stationarity test of a single history LRD traffic series of finite length. How to apply this
method to testing the stationarity of real traffic is demonstrated. The results in this paper suggest that there may be no
general conclusion that traffic is either stationary or non-stationary since the stationarity of traffic is observation-scale
dependent. Some of the investigated real-traffic traces that are stationary in an observation scale may be non-stationary in a
larger observation scale.
地址: [Li, Ming] E China Normal Univ, Sch Informat Sci & Technol, Shanghai 200241, Peoples R China.
[Chen, Wen-Sheng] Shenzhen Univ, Coll Math & Computat Sci, Shenzhen 518060, Peoples R China.
[Han, Lixin] Hohai Univ, Dept Comp Sci, Nanjing, Peoples R China.
通讯作者地址: Li, M (通讯作者),E China Normal Univ, Sch Informat Sci & Technol, 500 Dong Chuan Rd, Shanghai
200241, Peoples R China.
电子邮件地址: ming_lihk@yahoo.com; chenws@szu.edu.cn; lixinhan2002@yahoo.com.cn
第 236 条，共 274 条
标题: A novel particle swarm optimizer hybridized with extremal optimization
作者: Chen, MR (Chen, Min-Rong); Li, X (Li, Xia); Zhang, X (Zhang, Xi); Lu, YZ (Lu, Yong-Zai)
Web of Science 核心合集中的 "被引频次": 52
被引频次合计: 57
摘要: Particle swarm optimization (PSO) has received increasing interest from the optimization community due to its
simplicity in implementation and its inexpensive computational overhead. However, PSO has premature convergence,
especially in complex multimodal functions. Extremal optimization (EO) is a recently developed local-search heuristic
method and has been successfully applied to a wide variety of hard optimization problems. To overcome the limitation of
PSO, this paper proposes a novel hybrid algorithm, called hybrid PSO-EO algorithm, through introducing EO to PSO. The
hybrid approach elegantly combines the exploration ability of PSO with the exploitation ability of EO. We testify the
performance of the proposed approach on a suite of unimodal/multimodal benchmark functions and provide comparisons
with other meta-heuristics. The proposed approach is shown to have superior performance and great capability of
preventing premature convergence across it comparing favorably with the other algorithms. (C) 2009 Elsevier B.V. All
rights reserved.
地址: [Chen, Min-Rong; Li, Xia; Zhang, Xi] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
[Lu, Yong-Zai] Shanghai Jiao Tong Univ, Dept Automat, Shanghai 200240, Peoples R China.
通讯作者地址: Chen, MR (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: optmrchen@gmail.com
第 237 条，共 274 条
标题: APPLICATION OF NOVEL CLONAL ALGORITHM IN MULTIOBJECTIVE OPTIMIZATION
作者: Chen, JY (Chen, Jianyong); Lin, QZ (Lin, Qiuzhen); Hu, QB (Hu, Qingbin)
Web of Science 核心合集中的 "被引频次": 5
被引频次合计: 5
摘要: In this paper, a novel clonal algorithm applied in multiobjecitve optimization (NCMO) is presented, which is
designed from the improvement of search operators, i.e. dynamic mutation probability, dynamic simulated binary crossover
(D-SBX) operator and hybrid mutation operator combining with Gaussian and polynomial mutations (GP-HM) operator.
The main notion of these approaches is to perform more coarse-grained search at initial stage in order to speed up the
convergence toward the Pareto-optimal front. Once the solutions are getting close to the Pareto-optimal front, more
fine-grained search is performed in order to reduce the gaps between the solutions and the Pareto-optimal front. Based on
this purpose, a cooling schedule is adopted in these approaches, reducing the parameters gradually to a minimal threshold,
the aim of which is to keep a desirable balance between fine-grained search and coarse-grained search. By this means, the
exploratory capabilities of NCMO are enhanced. When compared with various state-of-the-art multiobjective optimization
algorithms developed recently, simulation results show that NCMO has remarkable performance.
地址: [Chen, Jianyong; Lin, Qiuzhen; Hu, Qingbin] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Guangdong,
Peoples R China.
通讯作者地址: Chen, JY (通讯作者),Shenzhen Univ, Coll Informat Engn, Nanhai Ave 3688, Shenzhen 518060,
Guangdong, Peoples R China.
电子邮件地址: cjyok2000@hotmail.com; qiuzheng658@163.com; huqb@szu.edu.cn
第 238 条，共 274 条
标题: CCA-secure unidirectional proxy re-encryption in the adaptive corruption model without random oracles
作者: Weng, J (Weng Jian); Chen, MR (Chen MinRong); Yang, YJ (Yang YanJiang); Deng, R (Deng, Robert); Chen, KF
(Chen Kefei); Bao, F (Bao Feng)
Web of Science 核心合集中的 "被引频次": 22
被引频次合计: 28
摘要: Up to now, it is still an open question of how to construct a chosen-ciphertext secure unidirectional proxy
re-encryption scheme in the adaptive corruption model. To address this problem, we propose a new unidirectional proxy
re-encryption scheme, and prove its chosen-ciphertext security in the adaptive corruption model without random oracles.
Compared with the best known unidirectional proxy re-encryption scheme proposed by Libert and Vergnaud in PKC'08, our
scheme enjoys the advantages of both higher efficiency and stronger security.
地址: [Chen MinRong] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
[Weng Jian] Jinan Univ, Dept Comp Sci, Guangzhou 510632, Guangdong, Peoples R China.
[Weng Jian; Deng, Robert] Singapore Management Univ, Sch Informat Syst, Singapore 178902, Singapore.
[Yang YanJiang; Bao Feng] Institute Infocomm Res I2R, Singapore 119613, Singapore.
[Chen Kefei] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai 200240, Peoples R China.
通讯作者地址: Chen, MR (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: optmrchen@gmail.com
第 239 条，共 274 条
标题: Applying Physical-Layer Network Coding in Wireless Networks
作者: Zhang, SL (Zhang, Shengli); Liew, SC (Liew, Soung Chang)
Web of Science 核心合集中的 "被引频次": 4
被引频次合计: 4
摘要: A main distinguishing feature of a wireless network compared with a wired network is its broadcast nature, in which
the signal transmitted by a node may reach several other nodes, and a node may receive signals from several other nodes,
simultaneously. Rather than a blessing, this feature is treated more as an interference-inducing nuisance in most wireless
networks today (e. g., IEEE 802.11). This paper shows that the concept of network coding can be applied at the physical
layer to turn the broadcast property into a capacity-boosting advantage in wireless ad hoc networks. Specifically, we
propose a physical-layer network coding (PNC) scheme to coordinate transmissions among nodes. In contrast to
"straightforward" network coding which performs coding arithmetic on digital bit streams after they have been received,
PNC makes use of the additive nature of simultaneously arriving electromagnetic (EM) waves for equivalent coding
operation. And in doing so, PNC can potentially achieve 100% and 50% throughput increases compared with traditional
transmission and straightforward network coding, respectively, in 1D regular linear networks with multiple random flows.
The throughput improvements are even larger in 2D regular networks: 200% and 100%, respectively. Copyright (C) 2010 S.
Zhang and S. C. Liew.
地址: [Zhang, Shengli] Shenzhen Univ, Dept Commun Engn, Shenzhen, Peoples R China.
[Zhang, Shengli; Liew, Soung Chang] Chinese Univ Hong Kong, Dept Informat Engn, Shatin, Hong Kong, Peoples R
China.
通讯作者地址: Zhang, SL (通讯作者),Shenzhen Univ, Dept Commun Engn, Shenzhen, Peoples R China.
电子邮件地址: slzhang@ie.cuhk.edu.hk
第 240 条，共 274 条
标题: Numerical performance of penalty method for American option pricing
作者: Zhang, K (Zhang, K.); Yang, XQ (Yang, X. Q.); Wang, S (Wang, S.); Teo, KL (Teo, K. L.)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 3
摘要: This paper is devoted to studying the numerical performance of a power penalty method for a linear parabolic
complementarity problem arising from American option valuation. The penalized problem is a nonlinear parabolic partial
differential equation (PDE). A fitted finite volume method and an implicit time-stepping scheme are used for, respectively,
the spatial and time discretizations of the PDE. The rate of convergence of the penalty methods with respect to the penalty
parameters is investigated both theoretically and numerically. The numerical robustness and computational effectiveness of
the penalty method with respect to the market parameters are also studied and compared with those from an existing popular
method, project successive over relaxation.
地址: [Zhang, K.] Shenzhen Univ, Sch Business, Dept Finance, Shenzhen 518060, Peoples R China.
[Yang, X. Q.] Hong Kong Polytech Univ, Dept Appl Math, Hong Kong, Hong Kong, Peoples R China.
[Wang, S.] Univ Western Australia, Sch Math & Stat, Perth, WA 6009, Australia.
[Teo, K. L.] Curtin Univ Technol, Dept Math & Stat, Perth, WA, Australia.
通讯作者地址: Zhang, K (通讯作者),Shenzhen Univ, Sch Business, Dept Finance, Shenzhen 518060, Peoples R China.
电子邮件地址: mazhangkai@gmail.com
第 241 条，共 274 条
标题: A Nested Multistage Adaptive Beamformer with a Low Complexity Under the Correlated Signal Environment
作者: Xie, N (Xie, Ning); Lin, XH (Lin, Xiaohui); Wang, H (Wang, Hui)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: A multistage adaptive beamformer for wireless communications is proposed. The beamformer adopts a novel nested
system architecture to reduce the system complexity and to achieve the system optimization which is carried out
independently at each stage. It is shown that this method attains an improved performance in comparison to another
competitive method.
地址: [Xie, Ning; Lin, Xiaohui; Wang, Hui] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Guangdong, Peoples R
China.
[Xie, Ning] Southeast Univ, Natl Mobile Commun Res Lab, Nanjing 210096, Jiangsu, Peoples R China.
通讯作者地址: Xie, N (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Guangdong, Peoples R China.
电子邮件地址: kensouren@yahoo.com.cn
第 242 条，共 274 条
标题: Band selection for hyperspectral imagery using affinity propagation
作者: Qian, Y (Qian, Y.); Yao, F (Yao, F.); Jia, S (Jia, S.)
Web of Science 核心合集中的 "被引频次": 27
被引频次合计: 31
摘要: Hyperspectral imagery generally contains enormous amounts of data because of hundreds of spectral bands. Band
selection is often adopted to reduce computational cost and accelerate knowledge discovery and other tasks such as
subsequent classification. An exemplar-based clustering algorithm termed affinity propagation for band selection is
proposed. Affinity propagation is derived from factor graph, and operates by initially considering all data points as potential
cluster centres (exemplars) and then exchanging messages between data points until a good set of exemplars and clusters
emerges. Affinity propagation has been applied to computer vision and bioinformatics, and shown to be much faster than
other clustering methods for large data. By combining the information about the discriminative capability of each individual
band and the correlation/similarity between bands, the exemplars generated by affine propagation have higher importance
and less correlation/similarity. The performance of band selection is evaluated through a pixel image classification task.
Experimental results demonstrate that, compared with some popular band selection methods, the bands selected by affinity
propagation best characterise the hyperspectral imagery from the pixel classification standpoint.
地址: [Qian, Y.; Yao, F.] Zhejiang Univ, Coll Comp Sci, Hangzhou 310027, Zhejiang, Peoples R China.
[Jia, S.] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Qian, Y (通讯作者),Zhejiang Univ, Coll Comp Sci, Hangzhou 310027, Zhejiang, Peoples R China.
电子邮件地址: ytqian@zju.edu.cn
第 243 条，共 274 条
标题: Steganalysis of YASS
作者: Li, B (Li, Bin); Huang, JW (Huang, Jiwu); Shi, YQ (Shi, Yun Qing)
Web of Science 核心合集中的 "被引频次": 15
被引频次合计: 19
摘要: A promising steganographic method-Yet Another Steganography Scheme (YASS)-was designed to resist blind
steganalysis via embedding data in randomized locations. In addition to a concrete realization which is named the YASS
algorithm in this paper, a few strategies were proposed to work with the YASS algorithm in order to enhance the data
embedding rate and security. In this work, the YASS algorithm and these strategies, together referred to as YASS, have
been analyzed from a warden's perspective. It is observed that the embedding locations chosen by YASS are not
randomized enough and the YASS embedding scheme causes detectable artifacts. We present a steganalytic method to
attack the YASS algorithm, which is facilitated by a specifically selected steganalytic observation domain (SO-domain), a
term to define the domain from which steganalytic features are extracted. The proposed SO-domain is not exactly, but
partially accesses, the domain where the YASS algorithm embeds data. Statistical features generated from the SO-domain
have demonstrated high effectiveness in detecting the YASS algorithm and identifying some embedding parameters. In
addition, we discuss how to defeat the above-mentioned strategies of YASS and demonstrate a countermeasure to a new
case in which the randomness of the embedding locations is enhanced. The success of detecting YASS by the proposed
method indicates a properly selected SO-domain is beneficial for steganalysis and confirms that the embedding locations are
of great importance in designing a secure steganographic scheme.
地址: [Li, Bin; Huang, Jiwu] Sun Yat Sen Univ, Sch Informat Sci & Technol, Guangzhou 510275, Guangdong, Peoples R
China.
[Shi, Yun Qing] New Jersey Inst Technol, Dept Elect & Comp Engn, Newark, NJ 07029 USA.
通讯作者地址: Li, B (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: lib3366@gmail.com; isshjw@mail.sysu.edu.cn; shi@njit.edu
第 244 条，共 274 条
标题: Task-activity based access control for process collaboration environments
作者: Lu, YH (Lu, Yahui); Zhang, L (Zhang, Li); Sun, JG (Sun, Jiaguang)
Web of Science 核心合集中的 "被引频次": 7
被引频次合计: 10
摘要: Collaborative systems enable organizations to communicate, interact and cooperate with each other to achieve their
business goals. Access control is an important security mechanism for organizations to protect their resources in
collaborative environments. Many access control models and mechanisms have been proposed for collaborative systems.
However, under the new collaborative paradigm based on Web services and workflow technologies, some specific access
control requirements should be addressed to support the various process collaboration patterns. In this paper, we present a
task-activity based access control (TABAC) model for process collaboration environments. In TABAC, business process is
composed by activities and dynamic permissions are related to tasks. Task permissions can be dynamically assigned to
processes during the interaction of activities. A SOAP based interaction protocol is also proposed to transmit task
permissions between processes. Finally, we describe the implementation of TABAC model in workflow management
system which conforms to the XACML and WS-BPEL specifications. (C) 2009 Elsevier B.V. All rights reserved.
地址: [Lu, Yahui] Shenzhen Univ, Coll Software, Shenzhen 518060, Peoples R China.
[Zhang, Li; Sun, Jiaguang] Tsinghua Univ, Key Lab Informat Syst Secur, Minist Educ China, Sch Software, Beijing
100084, Peoples R China.
通讯作者地址: Lu, YH (通讯作者),Shenzhen Univ, Coll Software, Shenzhen 518060, Peoples R China.
电子邮件地址: luyahui@szu.edu.cn; lizhang@tsinghua.edu.cn; sunjg@tsinghua.edu.cn
第 245 条，共 274 条
标题: Channel Coding and Decoding in a Relay System Operated with Physical-Layer Network Coding
作者: Zhang, SL (Zhang, Shengli); Liew, SC (Liew, Soung-Chang)
Web of Science 核心合集中的 "被引频次": 122
被引频次合计: 129
摘要: This paper investigates link-by-link channel-coded PNC (Physical layer Network Coding), in which a critical process
at the relay is to transform the superimposed channel-coded packets received from the two end nodes (plus noise), Y(3) =
X(1) + X(2)+W(3), to the network-coded combination of the source packets, S(1) circle plus S(2). This is in contrast to the
traditional multiple-access problem, in which the goal is to obtain both S(1) and S(2) explicitly at the relay node. Trying to
obtain S(1) and S(2) explicitly is an overkill if we are only interested in S(1) circle plus S(2). In this paper, we refer to the
transformation Y(3) -> S(1) circle plus S(2) as the Channel-decoding-Network-Coding process (CNC) in that it involves
both channel decoding and network coding operations. This paper shows that if we adopt the Repeat Accumulate (RA)
channel code at the two end nodes, then there is a compatible decoder at the relay that can perform the transformation Y(3)
-> S(1) circle plus S(2) efficiently. Specifically, we redesign the belief propagation decoding algorithm of the RA code for
traditional point-to-point channel to suit the need of the PNC multiple-access channel. Simulation results show that our new
scheme outperforms the previously proposed schemes significantly in terms of BER without added complexity.
地址: [Zhang, Shengli; Liew, Soung-Chang] Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Hong Kong,
Peoples R China.
[Zhang, Shengli] Shenzhen Univ, Dept Commun Engn, Shenzhen, Peoples R China.
通讯作者地址: Zhang, SL (通讯作者),Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Hong Kong, Peoples
R China.
电子邮件地址: slzhang@ie.cuhk.edu.hk; soung@ie.cuhk.edu.hk
第 246 条，共 274 条
标题: A two-parameter expression for failure surfaces
作者: Su, D (Su, Dong); Wang, ZL (Wang, Zhi-Liang); Xing, F (Xing, Feng)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 4
摘要: The Mohr-Coulomb, Tresca and Von Mises criteria are classical failure criteria, widely accepted and used for various
materials. To take into account the influence of intermediate principal stress on the strength of soil, Bishop, Lade-Duncan
and Matsuoka proposed criteria in terms of three principal stresses or three stress invariants. This note describes an
expression with two parameters for modeling the shape of the failure surface in the octahedral plane. By studying the roles
of these two parameters and comparing the new criterion with the aforementioned criteria, the advantage and flexibility of
the proposed function is explored. Application of the function is demonstrated by fitting the new surface to experimental
data for various soils. (C) 2008 Elsevier Ltd. All rights reserved.
地址: [Su, Dong; Xing, Feng] Shenzhen Univ, Coll Civil Engn, Shenzhen Key Lab Durabil Civil Engn, Shenzhen 518060,
Guangdong, Peoples R China.
[Wang, Zhi-Liang] AMEC Geomatrix, Oakland, CA 94612 USA.
通讯作者地址: Su, D (通讯作者),Shenzhen Univ, Coll Civil Engn, Shenzhen Key Lab Durabil Civil Engn, Shenzhen
518060, Guangdong, Peoples R China.
电子邮件地址: sudong@szu.edu.cn; zlwang@geomatrix.com; xingf@szu.edu.cn
第 247 条，共 274 条
标题: WAVELET-FACE BASED SUBSPACE LDA METHOD TO SOLVE SMALL SAMPLE SIZE PROBLEM IN
FACE RECOGNITION
作者: Chen, WS (Chen, Wen-Sheng); Huang, J (Huang, Jian); Zou, J (Zou, Jin); Fang, B (Fang, Bin)
Web of Science 核心合集中的 "被引频次": 7
被引频次合计: 7
摘要: Linear Discriminant Analysis (LDA) is a popular statistical method for both feature extraction and dimensionality
reduction in face recognition. The major drawback of LDA is the so-called small sample size (3S) problem. This problem
always occurs when the total number of training samples is smaller than the dimension of feature space. Under this
situation, the within-class scatter matrix S(w) becomes singular and LDA approach cannot be implemented directly. To
overcome the 3S problem, this paper proposes a novel wavelet-face based subspace LDA algorithm. Wavelet-face feature
extraction and dimensionality reduction are based on two-level D4-filter wavelet transform and discarding the null space of
total class scatter matrix S(t). It is shown that our obtained projection matrix satisfies the uncorrelated constraint conditions.
Hence in the sense of statistical uncorrelation, this projection matrix is optimal. The proposed method for face recognition
has been evaluated with two public available databases, namely ORL and FERET databases. Comparing with existing
LDA-based methods to solve the 3S problem, our method gives the best performance.
地址: [Chen, Wen-Sheng; Zou, Jin] Leshan Teachers Coll, Dept Math, Leshan 614004, Peoples R China.
[Chen, Wen-Sheng] Shenzhen Univ, Coll Math & Computat Sci, Shenzhen 518060, Peoples R China.
[Huang, Jian] Sun Yat Sen Univ, Dept Comp Sci, Guangzhou 510275, Guangdong, Peoples R China.
[Fang, Bin] Chongqing Univ, Coll Comp Sci, Chongqing 400044, Peoples R China.
通讯作者地址: Chen, WS (通讯作者),Leshan Teachers Coll, Dept Math, Leshan 614004, Peoples R China.
电子邮件地址: chenws@szu.edu.cn; hjian@mail.sysu.edu.cn; zoujin@lstc.edu.cn; fb@cqu.edu.cn
第 248 条，共 274 条
标题: A new lightpath establishing method for dynamic traffic grooming under the overlay model
作者: Chen, B (Chen, Bin); Bose, SK (Bose, Sanjay Kumar); Zhong, WD (Zhong, Wen-De); Wang, H (Wang, Hui)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 2
摘要: This paper proposes the use of the saturated cut (SC) method to improve the network performance through efficient
dynamic traffic grooming in IP/MPLS over WDM networks using an overlay model. With the SC information from the
IP/MPLS layer, the optical layer can calculate a lightpath between two node sets rather than the earlier suggested approach
of calculating such paths just between two nodes for better performance. We have used two criteria, bandwidth and path
length, to find SCs and have proposed two algorithms which incorporate this in the path inflation control (PIC) policy
proposed earlier. Two typical networks, NSF and COST239, were used for examining the network performance. The
simulation results show that though both methods can significantly improve the overall network performance the SC
method is more efficient for a sparse network like the NSF network rather than for a dense network like the COST239
network. Since calculating lightpaths for all node pairs for a SC is time consuming, we propose a considerably simpler
heuristic approach that can provide almost the same level of performance improvement as the SC method but with much
lower complexity.
地址: [Chen, Bin; Wang, Hui] Shenzhen Univ, Fac Informat Engn, Shenzhen 518060, Guangdong, Peoples R China.
[Bose, Sanjay Kumar; Zhong, Wen-De] Nanyang Technol Univ, Network Technol Res Ctr, Sch Elect & Elect Engn,
Singapore 639798, Singapore.
通讯作者地址: Chen, B (通讯作者),Shenzhen Univ, Fac Informat Engn, Shenzhen 518060, Guangdong, Peoples R China.
电子邮件地址: bchen@szu.edu.cn; eskbose@ntu.edu.sg; ewdzhong@ntu.edu.sg; wanghsz@szu.edu.cn
第 249 条，共 274 条
标题: An adaptive wideband antenna array receiver of low complexity
作者: Xie, N (Xie, Ning); Zhou, YP (Zhou, Yuanping)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: A low complexity wideband antenna array receiver is proposed for wideband wireless communication systems. With
the proposed algorithm, the array beampattern remains almost the same within a wide frequency range of interest. In
comparison to the conventional algorithm, the new algorithm offers a faster convergence rate with a lower computational
complexity. Simulation results are presented to demonstrate the proposed algorithm. Copyright (C) 2008 John Wiley &
Sons, Ltd.
地址: [Xie, Ning] Shenzhen Univ, Dept Commun Engn, Shenzhen 518060, Guangdong, Peoples R China.
[Zhou, Yuanping] Sichuan Univ, Sch Elect & Informat Engn, Chengdu 610064, Peoples R China.
通讯作者地址: Xie, N (通讯作者),Shenzhen Univ, Dept Commun Engn, Shenzhen 518060, Guangdong, Peoples R China.
电子邮件地址: xn_kensou@tom.com
第 250 条，共 274 条
标题: Nonlinear optimization for adaptive antenna array receivers with a small data-record size
作者: Xie, N (Xie, Ning); Zhou, YP (Zhou, Yuanping); Zhang, L (Zhang, Li); Qian, GB (Qian, Gongbin); Wang, H (Wang,
Hui); Li, X (Li, Xia)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Design of a nonlinear adaptive antenna array receiver is a challenging task in wireless communications due to the
limited number of antenna elements and the presence of correlated signals, which directly affect the performance of an
antenna array. More importantly, a conventional nonlinear array receiver is often associated with a high computational
complexity that undermines its applicability in practice. In this paper, we present a new approach to adaptive beamforming
receiver that provides superior performance in antenna array overloading and in the presence of correlated signals with a
low complexity. In particular, the proposed receiver requires a small data-record size to estimate the beamformer weights,
which is beneficial in applications with fast fading channels. Simulation examples illustrate the performance improvement
of the proposed array receiver when it is compared to the conventional beamformers. Copyright (C) 2008 John Wiley &
Sons, Ltd.
地址: [Xie, Ning; Zhang, Li; Qian, Gongbin; Wang, Hui; Li, Xia] Shenzhen Univ, Coll Informat Engn, Shenzhen 518060,
Guangdong, Peoples R China.
[Zhou, Yuanping] Sichuan Univ, Sch Elect & Informat Engn, Chengdu 610064, Peoples R China.
通讯作者地址: Xie, N (通讯作者),Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Guangdong, Peoples R China.
电子邮件地址: kensouren@yahoo.com.cn
第 251 条，共 274 条
标题: Cross-layer design for energy efficient communication in wireless sensor networks
作者: Lin, XH (Lin, Xiao-Hui); Kwok, YK (Kwok, Yu-Kwong); Wang, H (Wang, Hui)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 5
摘要: There is a plethora of recent research on high performance wireless communications using a cross-layer approach in
that adaptive modulation and coding (AMC) schemes at wireless physical layer are used for combating time varying
channel fading and enhance link throughput. However, in a wireless sensor network, transmitting packets over deep fading
channel can incur excessive energy consumption due to the usage of stronger forwarding error code (FEC) or more robust
modulation mode. To avoid such energy inefficient transmission, a straightforward approach is to temporarily buffer
packets when the channel is in deep fading, until the channel quality recovers. Unfortunately, packet buffering may lead to
communication latency and buffer overflow, which, in turn, can result in severe degradation in communication
performance. Specifically, to improve the buffering approach, we need to address two challenging issues: (1) how long
should we buffer the packets? and (2) how to choose the optimum channel transmission threshold above which to transmit
the buffered packets? In this paper, by using discrete-time queuing model, we analyze the effects of Rayleigh fading over
AMC-based communications in a wireless sensor network. We then analytically derive the packet delivery rate and average
delay. Guided by these numerical results, we can determine the most energy-efficient operation modes under different
transmission environments. Extensive simulation results have validated the analytical results, and indicates that under these
modes, we can achieve as much as 40% reduction in energy dissipation. Copyright (C) 2008 John Wiley & Sons, Ltd.
地址: [Kwok, Yu-Kwong] Colorado State Univ, Dept Elect & Comp Engn, Ft Collins, CO 80523 USA.
[Lin, Xiao-Hui; Wang, Hui] Shenzhen Univ, Fac Informat Engn, Shenzhen, Peoples R China.
通讯作者地址: Kwok, YK (通讯作者),Colorado State Univ, Dept Elect & Comp Engn, Ft Collins, CO 80523 USA.
电子邮件地址: ricky.kwok@colostate.edu
第 252 条，共 274 条
标题: Analysis of channel allocation scheme for wireless cellular networks
作者: Du, WF (Du, Wenfeng); Jia, WJ (Jia, Weijia); Wang, GJ (Wang, Guojun); Lu, WY (Lu, Wenyan)
Web of Science 核心合集中的 "被引频次": 4
被引频次合计: 4
摘要: Compared to wired networks, the communication bandwidth in the wireless networks is limited. In trying to achieve
QoS guaranteed wireless services, efficient utilisation of bandwidth resources becomes a fundamental issue. A number of
channel allocation schemes have been proposed to fully utilise the wireless bandwidth, but many of them just proposed the
channel allocation scheme without presenting a specific channel allocation model. In this paper, we propose and analyse
three different channel allocation schemes for wireless networks. We build three system models based on a two-dimensional
Markov chain to compute the performance of base station in terms of the new call blocking probability, the handover
dropping probability, and the channel utilisation.
地址: [Du, Wenfeng] Shenzhen Univ, Dept Comp Sci & Technol, Sch Comp & Software Engn, Shenzhen 518060, Peoples
R China.
[Jia, Weijia] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China.
[Wang, Guojun; Lu, Wenyan] Cent S Univ, Dept Comp Sci & Technol, Changsha 410083, Peoples R China.
通讯作者地址: Du, WF (通讯作者),Shenzhen Univ, Dept Comp Sci & Technol, Sch Comp & Software Engn, Shenzhen
518060, Peoples R China.
电子邮件地址: duwf@szu.edu.cn; wjia@cs.cityu.edu.hk; csgjwang@mail.csu.edu.cn; luwenyan@gmail.com
第 253 条，共 274 条
标题: COMBINING GENERALIZED NMF AND DISCRIMINATIVE MIXTURE MODELS FOR CLASSIFICATION
OF GENE EXPRESSION DATA
作者: Liu, WX (Liu, Weixiang); Yuan, KH (Yuan, Kehong); Wu, J (Wu, Jian); Ye, DT (Ye, Datian); Ji, Z (Ji, Zhen); Chen,
SP (Chen, Siping)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 2
摘要: Classification of gene expression samples is a core task in microarray data analysis. How to reduce thousands of
genes and to select a suitable classifier are two key issues for gene expression data classification. This paper introduces a
framework on combining both feature extraction and classifier simultaneously. Considering the non-negativity, high
dimensionality and small sample size, we apply a discriminative mixture model which is designed for non-negative gene
express data classification via non-negative matrix factorization (NMF) for dimension reduction. In order to enhance the
sparseness of training data for fast learning of the mixture model, a generalized NMF is also adopted. Experimental results
on several real gene expression datasets show that the classification accuracy, stability and decision quality can be
significantly improved by using the generalized method, and the proposed method can give better performance than some
previous reported results on the same datasets.
地址: [Liu, Weixiang; Yuan, Kehong; Wu, Jian; Ye, Datian] Tsinghua Univ, Grad Sch Shenzhen, Biomed Engn Res Ctr,
Div Life Sci, Shenzhen 518055, Peoples R China.
[Ji, Zhen; Chen, Siping] Shenzhen Univ, Sch Informat Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Liu, WX (通讯作者),Tsinghua Univ, Grad Sch Shenzhen, Biomed Engn Res Ctr, Div Life Sci, Shenzhen
518055, Peoples R China.
电子邮件地址: victorwxliu@yahoo.com.cn; yedt6386@sz.tsinghua.edu.cn
第 254 条，共 274 条
标题: Soft Network Coding in Wireless Two-Way Relay Channels
作者: Zhang, SL (Zhang, Shengli); Zhu, Y (Zhu, Yu); Liew, SC (Liew, Soung Chang)
Web of Science 核心合集中的 "被引频次": 9
被引频次合计: 9
摘要: Application of network coding in wireless two-way relay channels (TWRC) has received much attention recently
because its ability to improve throughput significantly. In traditional designs, network coding operates at upper layers above
(including) the link layer and it requires the input packets to be correctly decoded. However, this requirement may limit the
performance and application of network coding due to the unavoidable fading and noise in wireless networks. In this paper,
we propose a new wireless network coding scheme for TWRC, which is referred to as soft network coding (SoftNC). where
the relay nodes applies symbol-by-symbol soft decisions on the received signals from the two end nodes to come tip with
the network coded information to be forwarded. We do not assume further channel coding on top of SoftNC at the relay
node (channel coding is assumed at the end nodes). According to measures of the soft information adopted, two kinds of
SoftNC are proposed: amplify-and-forward SoftNC (AF-SoftNC) and soft-bit-forward SoftNC (SBF-SoftNC). We analyze
the both the ergodic capacity and the outage capacity of the two SoftNC schemes. Specifically, analytical form
approximations of the ergodic capacity and the outage capacity of the two schemes are given and validated. Numerical
simulation shows that our SoftNC schemes can outperform the traditional network coding based two-way relay protocol,
where channel decoding and re-encoding are used at the relay node. Notable is the fact that performance improvement is
achieved using only simple symbol-level operations at the relay node.
地址: [Zhang, Shengli; Liew, Soung Chang] Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Hong Kong,
Peoples R China.
[Zhang, Shengli] Shenzhen Univ, Dept Commun Engn, Shenzhen, Peoples R China.
[Zhu, Yu] Fudan Univ, Dept Commun Sci & Engn, Shanghai 200433, Peoples R China.
通讯作者地址: Zhang, SL (通讯作者),Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Hong Kong, Peoples
R China.
电子邮件地址: slzhang@ie.cuhk.edu.hk; zhuyu@fudan.edu.cn; soung@ie.cuhk.edu.hk
第 255 条，共 274 条
标题: A lifecycle model for simulating bacterial evolution
作者: Niu, B (Niu, B.); Zhu, YL (Zhu, Y. L.); He, XX (He, X. X.); Shen, H (Shen, H.); Wu, QH (Wu, Q. H.)
Web of Science 核心合集中的 "被引频次": 7
被引频次合计: 7
摘要: This paper presents a lifecycle model (LCM) to simulate bacterial evolution from a finite population of Escherichia
coli (E. coli) bacteria. The potential of this approach is in relating the microscopic behaviors of single bacterial cell to the
macroscopic effects of bacterial colonies. This can be accomplished via use of an individual-based modeling method under
the framework of agent-environment-rule (AER). Here, our study focuses on investigating the behaviors at different
developmental stages in E. coli lifecycle and developing a new biologically inspired methodology for static or dynamic
systems. The experimental results through a varying environment demonstrates that our model can be used to study under
which circumstances a certain bacterial behaviors emerges, and also give an inspiration to design a new biological
optimization algorithm being used for optimization problems. (c) 2008 Elsevier B.V. All rights reserved.
地址: [Niu, B.; Zhu, Y. L.; He, X. X.; Shen, H.] Shenzhen Univ, Sch Management, Shenzhen 518060, Guangdong, Peoples
R China.
[Niu, B.; He, X. X.; Shen, H.] Chinese Acad Sci, Grad Sch, Beijing 100049, Peoples R China.
[Wu, Q. H.] Univ Liverpool, Dept Elect Engn & Elect, Liverpool L69 3GJ, Merseyside, England.
通讯作者地址: Niu, B (通讯作者),Chinese Acad Sci, Shenyang Inst Automat, Beijing 100864, Peoples R China.
电子邮件地址: drniuben@hotmail.com
第 256 条，共 274 条
标题: Types for task-based access control in workflow systems
作者: Lu, Y (Lu, Y.); Zhang, L (Zhang, L.); Sun, J (Sun, J.)
Web of Science 核心合集中的 "被引频次": 3
被引频次合计: 4
摘要: Task-based access control (TBAC) is a flexible security mechanism, which has been widely implemented in
workflow management systems. In TBAC, permissions are assigned to tasks and users can only obtain the permissions
during the execution of tasks. The authors aim at developing a method for formalising and analysing security properties of
workflow systems under TBAC policy. To achieve this goal, the authors first present WFPI, workflow pi-calculus. By
adding task execution and submission primitives, and tagging each agent with its executing and distributing tasks, WFPI
can flexibly represent the concepts and elements in workflow systems. Then, based on WFPI, a type system is proposed to
ensure that the well-typed workflow systems can abide by the TBAC policy at run time, by avoiding run-time access
violations. To the best of one's knowledge, the present research is the first attempt to study workflow access control by
process calculus and types.
地址: [Lu, Y.] Shenzhen Univ, Coll Software, Shenzhen 518060, Peoples R China.
[Zhang, L.; Sun, J.] Tsinghua Univ, Sch Software, Key Lab Informat Secur, Minist Educ, Beijing 100084, Peoples R China.
通讯作者地址: Lu, Y (通讯作者),Shenzhen Univ, Coll Software, Shenzhen 518060, Peoples R China.
电子邮件地址: luyahui@szu.edu.cn
第 257 条，共 274 条
标题: PK-means: A new algorithm for gene clustering
作者: Du, ZH (Du, Zhihua); Wang, YW (Wang, Yiwei); Ji, Z (Ji, Zhen)
Web of Science 核心合集中的 "被引频次": 11
被引频次合计: 16
摘要: Microarray technology has been widely applied in study of measuring gene expression levels for thousands of genes
simultaneously. Gene cluster analysis is found useful for discovering the function of gene because co-expressed genes are
likely to share the same biological function. K-means is one of well-known clustering methods. However, it is sensitive to
the selection of an initial clustering and easily becoming trapped in a local minimum. Particle-pair optimizer (PPO) is a
variation on the traditional particle swarm optimization (PSO) algorithm, which is stochastic particle-pair based
optimization technique that can be applied to a wide range of problems. In this paper we bridges PPO and K-means within
the algorithm PK-means for the first time. Our results indicate that PK-means clustering is generally more accurate than
K-means and Fuzzy K-means (FKM). PK-means also has better robustness for it is less sensitive to the initial randomly
selected cluster centroids. Finally, our algorithm outperforms these methods with fast convergence rate and low
computation load. (C) 2008 Published by Elsevier Ltd.
地址: [Du, Zhihua; Wang, Yiwei; Ji, Zhen] Shenzhen Univ, Shenzhen 518060, Peoples R China.
通讯作者地址: Du, ZH (通讯作者),Shenzhen Univ, Nanhai Ave 3688, Shenzhen 518060, Peoples R China.
电子邮件地址: du_zhihua@yahoo.com.cn
第 258 条，共 274 条
标题: 3D Gabor wavelets for evaluating SPM normalization algorithm
作者: Shen, LL (Shen, Linlin); Bai, L (Bai, Li)
Web of Science 核心合集中的 "被引频次": 12
被引频次合计: 13
摘要: A Gabor wavelets based method is proposed in this paper for evaluating and tuning the parameters of image
registration algorithms. We propose a 3D local anatomical structure descriptor, namely the Maximum Responded Gabor
Wavelet (MRGW), for measuring registration quality based on anatomical variability of registered images. The
effectiveness of the descriptor is demonstrated through a practical application, using the variance of MRGW response to
tune parameters of a nonlinear spatial normalization algorithm, which is part of the popular software package for medical
image processing - the Statistical Parametric Mapping (SPM). (C) 2008 Elsevier B.V. All rights reserved.
地址: [Shen, Linlin] Shenzhen Univ, Fac Informat & Engn, Shenzhen 518060, Peoples R China.
[Bai, Li] Univ Nottingham, Sch Comp Sci, Nottingham NG8 1BB, England.
通讯作者地址: Shen, LL (通讯作者),Shenzhen Univ, Fac Informat & Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: llshen@szu.edu.cn; bai@cs.nott.ac.uk
第 259 条，共 274 条
标题: Providing differentiated services for multi-class traffic in IP/MPLS over WDM networks
作者: Chen, B (Chen, Bin); Zhong, WD (Zhong, Wen-De); Bose, SK (Bose, Sanjay K.)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 2
摘要: Providing differentiated services in IP/MPLS over WDM networks has attracted a lot of recent attention. This article
extends the Path Inflation Control (PIC) policy recently proposed by us to provide differentiated services in IP/MPLS over
WDM networks with traffic grooming. Three different algorithms are considered for provisioning differentiated services.
The simulation results show that, with two of the three algorithms, the network cannot only provide differentiated services
when the traffic load is high but also gives significantly lower blocking for the lower priority class traffic and for the overall
traffic at low traffic loads.
地址: [Chen, Bin; Zhong, Wen-De; Bose, Sanjay K.] Nanyang Technol Univ, Sch Elect & Elect Engn, Network Technol
Res Ctr, Singapore 639798, Singapore.
通讯作者地址: Chen, B (通讯作者),Shenzhen Univ, Sch Informat Engn, Shenzhen 518060, Guangdong, Peoples R China.
电子邮件地址: binchen@pmail.ntu.edu.sg; ewdzhong@ntu.edu.sg; eskbose@ntu.edu.sg
第 260 条，共 274 条
标题: Scheduling imprecise computation tasks on uniform processors
作者: Wan, GH (Wan, Guohua); Leung, JYT (Leung, Joseph Y-T.); Pinedo, ML (Pinedo, Michael L.)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: We consider the problem of preemptively scheduling n imprecise computation tasks on m >= 1 uniform processors,
with each task T-i having two weights w(i) and w(i)'. Three objectives are considered: (1) minimizing the maximum
w'-weighted error; (2) minimizing the total w-weighted error subject to the constraint that the maximum w'-weighted error
is minimized; (3) minimizing the maximum w'-weighted error subject to the constraint that the total w-weighted error is
minimized. For these objectives, we give polynomial time algorithms with time complexity O(mn(4)), O(mn(4)) and
O(kmn(4)), respectively, where k is the number of distinct w-weights. We also present alternative algorithms for the three
objectives, with time complexity O(cmn(3)), O(cmn(3) + mn(4)) and O(kcmn(3)), respectively, where c is a
parameter-dependent number. (c) 2007 Elsevier B.V. All rights reserved.
地址: New Jersey Inst Technol, Dept Comp Sci, Newark, NJ 07102 USA.
Shenzhen Univ, Coll Management, Shenzhen 518060, Peoples R China.
NYU, Stern Sch Business, New York, NY 10012 USA.
通讯作者地址: Leung, JYT (通讯作者),New Jersey Inst Technol, Dept Comp Sci, Newark, NJ 07102 USA.
电子邮件地址: leung@oak.njit.edu
第 261 条，共 274 条
标题: Local affine transform invariant image watermarking by Krawtchouk moment invariants
作者: Zhang, L (Zhang, L.); Xiao, WW (Xiao, W. W.); Ji, Z (Ji, Z.)
Web of Science 核心合集中的 "被引频次": 12
被引频次合计: 13
摘要: Image watermarking has become a popular technique for authentication and copyright protection. However, many
proposed image watermarking techniques are sensitive to afire transforms, such as rotation, scaling and translation. Here, a
local affine transform invariant watermarking is designed and tested against attacks performed by Stirmark using the
Krawtchouk moment invariants. Watermark is inserted into the perceptually significant Krawtchouk moment invariants of
the original image, and watermarking based on Krawtchouk moment invariants are local, that is, the embedded watermark
affects only a selected portion of the original image, the position of which can be decided by the user. This, in effect,
permits the watermark to be embedded at the portion of the image which is most significant information-wise. This also
means that the watermark is especially robust to cropping. Independent component analysis (ICA) is utilised by detector to
extract the perfect watermark blindly. The computational aspects of the proposed watermarking are also discussed in detail.
Experimental results have demonstrated that the proposed watermarking technique has a good robustness against other
attacks performed by Stirmark including affine transform, cropping, filtering, image compression and random geometric
distortions. It is indicated that the proposed watermarking has superior advantages over the existing ones in many aspects.
地址: [Zhang, L.; Xiao, W. W.; Ji, Z.] Shenzhen Univ, Fac Informat Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Zhang, L (通讯作者),Shenzhen Univ, Fac Informat Engn, Shenzhen 518060, Peoples R China.
电子邮件地址: wzhangli@szu.edu.cn
第 262 条，共 274 条
标题: On channel adaptive energy management with available bandwidth estimation in wireless sensor networks
作者: Lin, XH (Lin, Xiao-Hui); Kwok, YK (Kwok, Yu-Kwong); Wang, H (Wang, Hui)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: To enhance the lifetime of a sensor network which consists of hundreds or even thousands of resource-limited
devices, energy efficient communication is mandatory. Despite that a plethora of work has been done in designing energy
efficient protocols for sensor networks, the time-varying nature of wireless channel is largely unexplored. Indeed. we
believe that a cross-layer design on power aware communication is necessary to further optimize energy usage. In this
paper, we propose a new channel adaptive power aware protocol, called CAEM, which works by dynamically adjusting the
data throughput under different channel conditions with the help of an adaptive channel coding and modulation facility.
Each sensor device judiciously accesses the wireless medium in that communication activity is reduced for devices under
poor channel conditions. Simulation results indicate that the proposed CAEM protocol can lead to energy conservation by
as much as 30 percent. Furthermore, CAEM is also efficient in channel utilization as it generates a higher data throughput
even under heavy traffic load. Copyright (c) 2007 John Wiley & Sons, Ltd.
地址: Univ Hong Kong, Dept Elect & Elect Engn, Hong Kong, Hong Kong, Peoples R China.
Shenzhen Univ, Fac Informat Engn, Shenzhen, Guangdong, Peoples R China.
通讯作者地址: Kwok, YK (通讯作者),Univ Hong Kong, Dept Elect & Elect Engn, Hong Kong, Hong Kong, Peoples R
China.
电子邮件地址: ykwok@eee.hku.hk
第 263 条，共 274 条
标题: Automatic generation of colorful patterns with wallpaper symmetries from dynamics
作者: Lu, J (Lu, Jian); Ye, ZX (Ye, Zhongxing); Zou, YR (Zou, Yuru)
Web of Science 核心合集中的 "被引频次": 5
被引频次合计: 5
摘要: A new algorithm is presented in this paper for the generation of colorful images with wallpaper symmetries by means
of dynamical systems. Invariant functions are employed to construct density functions for the creation of colorful images.
地址: Shanghai Jiao Tong Univ, Dept Math, Shanghai 200240, Peoples R China.
Shenzhen Univ, Coll Math & Computat Sci, Shenzhen 518060, Peoples R China.
通讯作者地址: Lu, J (通讯作者),Shanghai Jiao Tong Univ, Dept Math, Shanghai 200240, Peoples R China.
电子邮件地址: jianlu@sjtu.edu.cn; zxye@sjtu.edu.cn; yrzou@163.com
第 264 条，共 274 条
标题: Matching algorithm using wavelet thinning features for offline signature verification
作者: Fang, B (Fang, Bin); You, XG (You, Xinge); Chen, WS (Chen, Wen-Sheng); Tang, YY (Tang, Yuan Yan)
Web of Science 核心合集中的 "被引频次": 5
被引频次合计: 5
摘要: Structure distortion evaluation allows us to directly measure the similarity between signature patterns without
classification using feature vectors, which usually suffers from limited training samples. In this paper, we incorporate the
merits of both global and local alignment algorithms to de. ne structure distortion using signature skeletons identified by a
robust wavelet thinning technique. A weak a. ne model is employed to globally register two signature skeletons and
structure distortion between two signature patterns, which are determined by applying an elastic local alignment algorithm.
Similarity measurement is evaluated in the form of Euclidean distance of all found corresponding feature points.
Experimental results showed that the proposed similarity measurement was able to provide sufficient discriminatory
information in terms of equal error rate being 18.6% with four training samples.
地址: Chongqing Technol & Business Univ, Coll Comp Sci & Informat Engn, Chongqing 400067, Peoples R China.
Chongqing Univ, Coll Comp Sci, Chongqing 400044, Peoples R China.
Shenzhen Univ, Coll Math & Comp Sci, Shenzhen 518060, Peoples R China.
电子邮件地址: fangb@comp.hkbu.edu.hk; xyou@hubu.edu.cn; chenws@szu.edu.cn
第 265 条，共 274 条
标题: CAEM: A channel adaptive approach to energy management for wireless sensor networks
作者: Lin, XH (Lin, Xiao-Hui); Kwok, YK (Kwok, Yu-Kwong)
Web of Science 核心合集中的 "被引频次": 1
被引频次合计: 1
摘要: Energy constraints in a wireless sensor network are crucial issues critically affecting the network lifetime and
connectivity. To realize true energy saving in a wireless environment, the time varying property of the wireless channel
should also be taken into account. Unfortunately, this factor has long been ignored in most existing state-of-the-art energy
saving protocols. Neglecting the effects of varying channel quality can lead to an unnecessary waste of precious battery
resources, and, in turn, can result in the rapid depletion of sensor energy and partitioning of the network. In this paper, we
propose a channel adaptive energy management protocol, called CAEM, that can exploit this time varying nature of the
wireless link. Specifically, CAEM leverages on the synergistically cross-layer interaction between physical and MAC
layers. Thus, each sensor node can intelligently access the wireless medium according to the current wireless link quality
and the predicted traffic load, to realize an efficient utilization of the energy. Extensive simulation results indicate that
CAEM can achieve as much as 40% reduction in energy dissipation compared with traditional protocols without channel
adaptation. (c) 2006 Elsevier B.V. All rights reserved.
地址: Univ Hong Kong, Dept Elect & Elect Engn, Hong Kong, Hong Kong, Peoples R China.
Shenzhen Univ, Fac Informat Engn, Shenzhen, Peoples R China.
通讯作者地址: Kwok, YK (通讯作者),Univ Hong Kong, Dept Elect & Elect Engn, Pokfulam Rd, Hong Kong, Hong
Kong, Peoples R China.
电子邮件地址: ykwok@hku.hk
第 266 条，共 274 条
标题: A new dependable exchange protocol
作者: Hao, W (Wang, Hao); Guo, HQ (Guo, Heqing); Lin, MS (Lin, Manshan); Yin, JF (Yin, Jianfei); He, Q (He, Qi);
Zhang, J (Zhang, Jun)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: As electronic transaction becomes common practice in real-world business, its dependability develops into a major
concern, especially in critical transactions, e.g., electronic payment and electronic contract signing. Many recent
fair-exchange protocols can recover the transaction from network failures; however, few can survive local system failures.
In this paper, we propose a new Dependable Exchange Protocol. With proper convertible signature scheme and message
logging method, the exchange protocol provides a recovery method for network and local system failures. To the best of our
knowledge, this protocol is the first fault-tolerant exchange protocol in the context of offline TTP and asynchronous
channels. (c) 2005 Elsevier B.V. All rights reserved.
地址: S China Univ Technol, Sch Comp Sci & Engn, Guangzhou 510640, Peoples R China.
Nanyang Technol Univ, Sch Comp Engn, Singapore, Singapore.
Shenzhen Univ, Coll Informat Engn, Shenzhen 518060, Peoples R China.
通讯作者地址: Hao, W (通讯作者),S China Univ Technol, Sch Comp Sci & Engn, Guangzhou 510640, Peoples R China.
电子邮件地址: iswanghao@acm.org; guozhou@scut.edu.cn; lmshill@hotmail.com; yjhhome@hotmail.com;
qihe0001@ntu.edu.sg; jzhang@ntu.edu.sg
第 267 条，共 274 条
标题: On the probability of the number of solutiong for the P4P problem
作者: Gao, XS (Gao, Xiao-Shan); Tang, J (Tang, Jianliang)
Web of Science 核心合集中的 "被引频次": 8
被引频次合计: 9
摘要: This paper studies the multi-solution phenomenon for the perspective four point (P4P) problem from geometric and
algebraic aspects. We give a pure geometric proof that the P4P problem could have up to five solutions. We also give a
clear picture on how these five solutions could be realized. We prove that with probability one, the P4P problem has a
unique solution which can be represented by a set of rational functions in the parameters. The simulant experiments show
that to solve the P4P problem with the rational functions is stable and accurate.
地址: Acad Sinica, Inst Syst Sci, Key Lab Math Mechanizat, Beijing 100080, Peoples R China.
Shenzhen Univ, Coll Sci, Shenzhen 518060, Peoples R China.
通讯作者地址: Gao, XS (通讯作者),Acad Sinica, Inst Syst Sci, Key Lab Math Mechanizat, Beijing 100080, Peoples R
China.
第 268 条，共 274 条
标题: pNJTree: A parallel program for reconstruction of neighbor-joining tree and its application in ClustalW
作者: Du, ZH (Du, Zhihua); Lin, F (Lin, Feng)
Web of Science 核心合集中的 "被引频次": 7
被引频次合计: 7
摘要: Neighbor-joining (NJ) is a distance-based method for tree construction. It is the most widely used method with
polynomial time complexity at present. However, a fundamental problem with the previous implementations of this method
is its limitation to handle large taxa sets within a reasonable time and memory resources. In this paper, we present a parallel
implementation, pNJTree, for fast construction of very large phylogenetic trees. In comparison, pNJTree gets near-linear
speedup for large taxa sets. It can be used to improve the speedup of the parallelized ClustalW methods. (c) 2006 Elsevier
B.V. All rights reserved.
地址: Shenzhen Univ, Sch Biochem, Coll Informat Engn, Shenzhen 518060, Guangdong, Peoples R China.
Nanyang Technol Univ, Bioinformat Res Ctr, Singapore 639798, Singapore.
通讯作者地址: Du, ZH (通讯作者),Shenzhen Univ, Sch Biochem, Coll Informat Engn, Shenzhen 518060, Guangdong,
Peoples R China.
电子邮件地址: duzhihua@pmail.ntu.edu.sg
第 269 条，共 274 条
标题: Two-step single parameter regularization Fisher discriminant method for face recognition
作者: Chen, WS (Chen, WS); Yuen, PC (Yuen, PC); Huang, J (Huang, J); Fang, B (Fang, B)
Web of Science 核心合集中的 "被引频次": 9
被引频次合计: 9
摘要: In face recognition tasks, Fisher discriminant analysis (FDA) is one of the promising methods for dimensionality
reduction and discriminant feature extraction. The objective of FDA is to find an optimal projection matrix, which
maximizes the between-class-distance and simultaneously minimizes within-class-distance. The main limitation of
traditional FDA is the so-called Small Sample Size (3S) problem. It induces that the within-class scatter matrix is singular
and then the traditional FDA fails to perform directly for pattern classification. To overcome 3S problem, this paper
proposes a novel two-step single parameter regularization Fisher discriminant (2SRFD) algorithm for face recognition. The
first semi-regularized step is based on a rank lifting theorem. This step adjusts both the projection directions and their
corresponding weights. Our previous three-to-one parameter regularized technique is exploited in the second stage, which
just changes the weights of projection directions. It is shown that the final regularized within-class scatter matrix approaches
the original within-class scatter matrix as the single parameter tends to zero. Also, our method has good computational
complexity. The proposed method has been tested and evaluated with three public available databases, namely ORL, CMU
PIE and FERET face databases. Comparing with existing state-of-the-art FDA-based methods in solving the S3 problem,
the proposed 2SRFD approach gives the best performance.
地址: Shenzhen Univ, Coll Sci, Shenzhen 518060, Peoples R China.
Chinese Acad Sci, Key Lab Math Mechanizat, Beijing 100080, Peoples R China.
Hong Kong Baptist Univ, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China.
Sun Yat Sen Univ, Sch Informat Sci & Technol, Guangzhou 510275, Peoples R China.
Chongqing Univ, Dept Comp Sci, Chongqing 400044, Peoples R China.
通讯作者地址: Chen, WS (通讯作者),Shenzhen Univ, Coll Sci, Shenzhen 518060, Peoples R China.
电子邮件地址: chenws@szu.edu.cn; pcyuen@comp.hkbu.edu.hk; jhuang@comp.hkbu.edu.hk; fb@cqu.edu.cn
第 270 条，共 274 条
标题: Wavelet natural boundary element method for the Neumann exterior problem of Stokes equations
作者: Chen, WS (Chen, WS); You, XG (You, XG); Fang, B (Fang, B); Tang, YY (Tang, YY); Huang, J (Huang, J)
Web of Science 核心合集中的 "被引频次": 6
被引频次合计: 6
摘要: Natural boundary element approach is a promising method to solve boundary value problems of partial differential
equations. This paper addresses the Neumann exterior problem of Stokes equations using the wavelet natural boundary
element method. The Stokes exterior problem is reduced into an equivalent Hadamard-singular Natural Integral Equation
(NIE). By virtue of the wavelet-Galerkin algorithm, the simple and accurate computational formulae of stiffness matrix are
obtained. The 2(J+3) x 2(J+3) stiffness matrix is sparse and determined only by its 2(J) + 3J + 1 entries. It greatly decreases
the computational complexity. Also, the condition number of stiffness matrix is O(N), where N is the discrete node number.
This indicates that the proposed algorithm is more stable than that of classical finite element method. The error estimates are
established for the wavelet-Galerkin approximate solution. Several numerical examples are given to evaluate the
performance of our method with encouraging results.
地址: Hubei Univ, Fac Math & Comp Sci, Wuhan 430062, Peoples R China.
Shenzhen Univ, Coll Sci, Shenzhen 518060, Peoples R China.
Chongqing Univ, Dept Comp Sci, Chongqing 400044, Peoples R China.
Sun Yat Sen Univ, Sch Informat Sci & Technol, Guangzhou 510275, Guangdong, Peoples R China.
通讯作者地址: You, XG (通讯作者),Hubei Univ, Fac Math & Comp Sci, Wuhan 430062, Peoples R China.
电子邮件地址: chenws@szu.edu.cn; xyou@hubu.edu.cn
第 271 条，共 274 条
标题: Cross-oriented choquet integrals and their applications on data classification
作者: Yang, R (Yang, Rong); Wang, ZY (Wang, Zhenyuan)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: Compared to the classification model based on single Choquet integrals, a novel generalized nonlinear classification
model based on cross-oriented Choquet integrals is presented. A couple of Choquet integrals are used to achieve the
classification boundaries which can classify data in situations such as one class surrounding another one in a high
dimensional space. The classification problems come down to properly specifying the fuzzy measure with respect to which
the Choquet integral(s) are defined and the classifying boundaries by which the different classes are separated. The values
of these unknown parameters are optimally determined by an evolutionary computation. The performance of the presented
model is compared and validated with some existed methods on a number of benchmark datasets.
地址: [Yang, Rong] Shen Zhen Univ, Coll Mech & Control Engn, Shenzhen, Peoples R China.
[Wang, Zhenyuan] Univ Nebraska, Dept Math, Omaha, NE 68182 USA.
通讯作者地址: Yang, R (通讯作者),Shen Zhen Univ, Coll Mech & Control Engn, Shenzhen, Peoples R China.
电子邮件地址: ryang@szu.edu.cn
第 272 条，共 274 条
标题: Classification based on Choquet integral
作者: Yang, R (Yang, Rong); Ouyang, R (Ouyang, Ren)
Web of Science 核心合集中的 "被引频次": 0
被引频次合计: 0
摘要: The Choquet integral is a powerful aggregation tool in information fusing and data mining. In this paper, a
generalized nonlinear classification model based on single Choquet integral is summarized, and a novel generalized
nonlinear classification model based on cross-oriented Choquet integrals is presented. Compared to the classification model
based on single Choquet integral, a couple of Choquet integral are used to achieve the classification boundaries which can
classify data in such situation as one class surrounding another one in a high dimensional space. The classification problems
come down to properly specifying the fuzzy measure on which the Choquet integral(s) are defined and the classifying
boundaries by which the different classes are separated. The values of these unknown parameters are optimally determined
by evolutionary computation. The performance of these models are compared and validated with existed methods on a
number of benchmark datasets.
地址: [Yang, Rong; Ouyang, Ren] Shen Zhen Univ, Coll Mechatron & Control Engn, Shen Zhen, Peoples R China.
通讯作者地址: Yang, R (通讯作者),Shen Zhen Univ, Coll Mechatron & Control Engn, Shen Zhen, Peoples R China.
电子邮件地址: ryang@szu.edu.cn
第 273 条，共 274 条
标题: Representing and matching simulation cases: A case-based reasoning approach
作者: Zhou, M (Zhou, Ming); Chen, ZM (Chen, Zhimin); He, WJ (He, Wenjing); Chen, X (Chen, Xu)
Web of Science 核心合集中的 "被引频次": 5
被引频次合计: 5
摘要: Simulation modelling is a complex decision-making process that involves the processing of various knowledge and
information within a context defined by specific application. Building a "good" simulation model has been heavily reliant
on the skill and experience of human expert, which has become one of the most expensive and limited resources in market
competition. Case-based reasoning (CBR) can be used to effectively solve problems in ill-defined domains where
operations specific knowledge and information are processed in a contextual manner such as simulation modeling. This
paper addresses some of the basic issues in applying CBR to improve simulation modeling, with emphasis on knowledge or
case representation, case indexing. and case matching. Numerical examples and experimental studies were conducted to
verify and validate the concepts and model/algorithms developed. The results showed the effectiveness and applicability of
proposed method. Published by Elsevier Ltd.
地址: [Zhou, Ming] Indiana State Univ, Ctr Syst Modeling & Simulat, Terre Haute, IN 47809 USA.
[Chen, Zhimin; He, Wenjing] Shen Zhen Univ, Coll Management, Shenzhen 518060, Guangdong, Peoples R China.
[Chen, Xu] Univ Elect Sci & Technol China, Sch Management, Chengdu 610054, Sichuan, Peoples R China.
通讯作者地址: Zhou, M (通讯作者),Indiana State Univ, Ctr Syst Modeling & Simulat, Terre Haute, IN 47809 USA.
电子邮件地址: zhou1956@yahoo.com
第 274 条，共 274 条
标题: Factored principal components analysis, with applications to face recognition
作者: Dryden, IL (Dryden, Ian L.); Bai, L (Bai, Li); Brignell, CJ (Brignell, Christopher J.); Shen, LL (Shen, Linlin)
Web of Science 核心合集中的 "被引频次": 4
被引频次合计: 4
摘要: A dimension reduction technique is proposed for matrix data, with applications to face recognition from images. In
particular, we propose a factored covariance model for the data under study, estimate the parameters using maximum
likelihood, and then carry out eigendecompositions of the estimated covariance matrix. We call the resulting method
factored principal components analysis. We also develop a method for classification using a likelihood ratio criterion, which
has previously been used for evaluating the strength of forensic evidence. The methodology is illustrated with applications
in face recognition.
地址: [Dryden, Ian L.; Brignell, Christopher J.] Univ Nottingham, Sch Math Sci, Nottingham NG7 2RD, England.
[Bai, Li] Univ Nottingham, Sch Comp Sci, Nottingham NG7 2RD, England.
[Shen, Linlin] Shen Zhen Univ, Sch Informat & Engn, Shenzhen, Peoples R China.
通讯作者地址: Dryden, IL (通讯作者),Univ Nottingham, Sch Math Sci, Nottingham NG7 2RD, England.
电子邮件地址: ian.dryden@nottingham.ac.uk
附录：
标题: Overcoming the Challenge of Variety: Big Data Abstraction, the Next Evolution of Data Management for AAL
Communication Systems
作者: Mao, R (Mao, Rui); Xu, HL (Xu, Honglong); Wu, WB (Wu, Wenbo); Li, JQ (Li, Jianqiang); Li, Y (Li, Yan); Lu,
MH (Lu, Minhua)
Web of Science 核心合集中的 "被引频次": 2
被引频次合计: 2
摘要: With the extensive use of information technology in AAL communication systems, a data management model has
recently embodied the 3-V characteristics of big data: volume, velocity, and variety. A lot of work has been done on volume
and velocity, but not as much has been reported on variety. To handle the variety of data, universal solutions with
acceptable performance are usually much more cost effective than customized solutions. To achieve universality, a basic
idea is to first define a universal abstraction that covers a wide range of data types, and then build a universal system for
universal abstraction. Traditional database management systems commonly use a multidimensional data type, or feature
vectors, as a universal abstraction. However, many new data types in AAL systems cannot be abstracted into
multidimensional space. To find a more universal data abstraction and build more universal systems, we propose the
concept of big data abstraction, with metric space as a universal abstraction for AAL data types. Furthermore, to
demonstrate how metric-space data abstraction works, we survey the state of the art in metric space indexing, a fundamental
task in data management. Finally, open research issues are discussed.
地址: [Mao, Rui] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China.
[Xu, Honglong; Li, Yan] Shenzhen Univ, Shenzhen, Peoples R China.
[Lu, Minhua] Shenzhen Univ, Dept Biomed Engn, Shenzhen, Peoples R China.
[Wu, Wenbo] Univ Georgia, Athens, GA 30602 USA.
[Li, Jianqiang] Beijing Inst Technol, Beijing, Peoples R China.
通讯作者地址: Lu, MH (通讯作者),Shenzhen Univ, Dept Biomed Engn, Shenzhen, Peoples R China.