检索结果-内蒙古大学图书馆

2013 IEEE 37th Annual Computer Software and Applications Conference, COMPSAC 2013

作者： Zhou, Jing Bochmann, Gregor V. Shi, Zhongzhi School of Computer Science Communication University of China Beijing China School of Electrical Engineering and Computer Science University of Ottawa ON Canada Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769549798

Sharing the Semantic Web data in proprietary datasets in which data is encoded in RDF triples in a decentralized environment calls for efficient support from distributed computing technologies. The highly dynamic ad-hoc settings that would be pervasive for Semantic Web data sharing among personal users in the future, however, pose even more demanding challenges for the enabling technologies. We extend previous work on a hybrid P2P architecture for an ad-hoc Semantic Web data sharing system which better models the data sharing scenario by allowing data to be maintained by its own providers and exhibits satisfactory scalability owing to the adoption of a two-level distributed index and hashing techniques. Additionally, we propose efficient distributed processing of SPARQL queries in such a context and explore optimization techniques that build upon distributed query processing for database systems and relational algebra optimization. We anticipate that our work will become an indispensable, complementary approach to making the Semantic Web a reality by delivering efficient data sharing and reusing in an ad-hoc environment. © 2013 IEEE.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Research of maneuvering target tracking based on particle filter

Research of maneuvering target tracking based on particle fi...

引用

Chinese Automation Congress (CAC)

作者： Xia Li Peng Li Yougui Guo Zhengbin Shen Ministry of Education Key Laboratory of Intelligent Computing & Information Processing Xiangtan city Hunan province China

The essence of maneuvering target tracking is mainly including maneuvering target modeling, maneuvering target detection or maneuvering target identification and filtering algorithm. In this paper, the maneuvering target model was described by the cooperative turn model, and tracked by the particle filter algorithm. The resample technique is introduced to overcome the problem of particle degradation in standard particle filter. Finally, we finished simulation experiments by Matlab, and compared the particle filter algorithm with the extended kalman filter algorithm, the results show that particle filter with the resample technique has a better performance in tracking precision, computational complexity, real-time performance and stability, it is a more effective method for maneuvering target tracking.

关键词： Target tracking Particle filters Mathematical model Filtering algorithms Noise Probability density function Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Discussion on Integrated Specialty Reform of Communication Engineering

Discussion on Integrated Specialty Reform of Communication E...

引用

2nd International Conference on Science and Social Research(ICSSR 2013)

作者： Jun Zhu Xiao-Hui Li Yu-Fa Sun Key Laboratory of Intelligent Computing & Singnal Processing Ministry of Education School of Electronic Information Engineering Anhui University

ISBN: (纸本)9781629939742

Communication engineering specialty is an engineering practical and very strong applied specialty. Practice teaching plays an important role of cultivating students' scientific thinking methods, scientific research ability and innovation ability. Through integrated specialty reform, we improve the practice teaching conditions further, optimize the practice teaching content, innovate the teaching mode, strengthen the teaching team and promote the combination of the cultivation of talents, production-practice and social practice, thus improving students' innovation consciousness and practice ability.

关键词： communication engineering specialty, talents training mode, integrated specialty reform, practice teaching link.

来源：评论

学校读者我要写书评

暂无评论

ROBUST MULTI-PATCH TRACKING

ROBUST MULTI-PATCH TRACKING

引用

IEEE International Conference on Image processing

作者： Shanxin Yuan Jun Miao Laiyun Qing Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9781479923427

In this paper, we propose a robust and fast multi-patch visual tracking algorithm within the Bayesian inference framework. The target template is initialized by selecting the object in the first frame manually and dividing it into small patches. For one certain frame, target candidates are sampled with the state transition model. Each candidate is divided into patches in the same way as the target template. By comparing the candidate's patches with the corresponding template patches, we can get the candidate's likelihood. The tracking result is the candidate which Maximum a Posteriori estimation. After that, tracking is continued using the Bayesian state inference and template update. Our approach can handle appearance variation, occlusion, illumination change, scale variation, rotation and cluttered background. The tracker is fast and performs favorably against several state-of-the-art trackers on challenging sequences.

关键词： Visual tracking Bayesian inference multi-patch fast robust Bayesian inference visual tracking Fasting jigs(templates) tracking Maximum a posteriori estimation Robustness Patches State Change candidate species

来源：评论

学校读者我要写书评

暂无评论

EMPLOYING PLSA MODEL AND MAX-BISECTION FOR REFINING IMAGE ANNOTATION

EMPLOYING PLSA MODEL AND MAX-BISECTION FOR REFINING IMAGE AN...

引用

IEEE International Conference on Image processing

作者： Dongping Tian Wenbo Zhang Xiaofei Zhao Zhongzhi Shi The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9781479923427

We present a new method for refining image annotation by fusing probabilistic latent semantic analysis (PLSA) with max-bisection (MB). We first construct a PLSA model with asymmetric modalities to estimate the posterior probabilities of each annotating keyword for an image, and then a label similarity graph is built by a weighted linear combination of label similarity and visual similarity. Followed by the rank-two relaxation heuristics over the constructed label graph is employed to further mine the correlation of the keywords so as to capture the refining annotation, which plays a critical role in semantic based image retrieval. The novelty of our method mainly lies in two aspects: exploiting PLSA to accomplish the initial semantic annotation task and implementing max-bisection based on the rank-two relaxation algorithm over the weighted label graph to refine the candidate annotations generated by the PLSA. We evaluate our method on the standard Corel dataset and the experimental results are competitive to several state-of-the-art approaches.

关键词： Refining image annotation PLSA EM max-bisection image retrieval image retrieval images ANNOTATIONS Refining labelled graph Line graph Linear Combination Purification KEYWORD

来源：评论

学校读者我要写书评

暂无评论

Multifractal analyses of daily rainfall time series in Pearl River basin of China

引用

Physica A: Statistical Mechanics and its Applications 2014年 405卷 193-202页

作者： Zu-Guo Yu Yee Leung Yongqin David Chen Qiang Zhang Vo Anh Yu Zhou Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Xiangtan Hunan 411105 China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan Hunan 411105 China School of Mathematical Sciences Queensland University of Technology GPO Box 2434 Brisbane Q4001 Australia Department of Geography and Resource Management The Chinese University of Hong Kong Hong Kong China Institute of Environment Energy and Sustainability The Chinese University of Hong Kong Hong Kong China Department of Water Resources and Environment Sun Yat-sen University Guangzhou 510275 China Key Laboratory of Water Cycle and Water Security in Southern China of Guangdong High Education Institute Sun Yat-sen University Guangzhou 510275 China

The multifractal properties of daily rainfall time series at the stations in Pearl River basin of China over periods of up to 45 years are examined using the universal multifractal approach based on the multiplicative cascade model and the multifractal detrended fluctuation analysis (MF-DFA). The results from these two kinds of multifractal analyses show that the daily rainfall time series in this basin have multifractal behavior in two different time scale ranges. It is found that the empirical multifractal moment function K ( q ) of the daily rainfall time series can be fitted very well by the universal multifractal model (UMM). The estimated values of the conservation parameter H from UMM for these daily rainfall data are close to zero indicating that they correspond to conserved fields. After removing the seasonal trend in the rainfall data, the estimated values of the exponent h ( 2 ) from MF-DFA indicate that the daily rainfall time series in Pearl River basin exhibit no long-term correlations. It is also found that K ( 2 ) and elevation series are negatively correlated. It shows a relationship between topography and rainfall variability.

关键词： Daily rainfall time series Multifractal property Universal multifractal model Multifractal detrended fluctuation analysis

来源：评论

学校读者我要写书评

暂无评论

Optimal pricing for improving efficiency of taxi systems

Optimal pricing for improving efficiency of taxi systems

引用

23rd International Joint Conference on Artificial Intelligence, IJCAI 2013

作者： Gan, Jiarui An, Bo Wang, Haizhong Sun, Xiaoming Shi, Zhongzhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China Oregon State University Corvallis OR 97331 United States

ISBN: (纸本)9781577356332

In Beijing, most taxi drivers intentionally avoid working during peak hours despite of the huge customer demand within these peak periods. This dilemma is mainly due to the fact that taxi drivers' congestion costs are not reflected in the current taxi fare structure. To resolve this problem, we propose a new pricing scheme to provide taxi drivers with extra incentives to work during peak hours. This differs from previous studies of taxi market by considering market variance over multiple periods, taxi drivers' profit-driven decisions, and their scheduling constraints regarding the interdependence among different periods. The major challenge of this research is the computational intensiveness to identify optimal strategy due to the exponentially large size of a taxi driver's strategy space and the scheduling constraints. We develop an atom schedule method to overcome these issues. It reduces the magnitude of the problem while satisfying the constraints to filter out infeasible pure strategies. Simulation results based on real data show the effectiveness of the proposed methods, which opens up a new door to improving the efficiency of taxi market in megacities (e.g., Beijing).

关键词： Traffic congestion

来源：评论

学校读者我要写书评

暂无评论

Enhancing ability of fault detection for component systems based on object interactions graph

Enhancing ability of fault detection for component systems b...

引用

2012 International Conference on Emerging Technologies for information Systems, computing, and Management, ICM 2012

作者： Sun, Fuzhen Liao, Lejian Du, Jianguang Li, Guoqiang Beijing Eng. Res. Ctr. of High Vol. Language Information Processing and Cloud Computing Applications Beijing Key Laboratory of Intelligent Information Technology School of Computer Science Beijing China School of Computer Science and Technology Shandong University of Technology Zibo China

ISBN: (纸本)9781461470090

Test case prioritization is a technique to schedule the test case in order to maximize some objective function. Early fault detection can provide a faster feedback generating a scope for debuggers to carry out their task at an early stage. In this paper, a method is proposed to prioritize the test cases for testing component dependency in a Component Based Software Development (CBSD) environment using Greedy Approach. The OIG (Object Interaction Graph) is traversed to calculate the total number of inter component object interactions and intra component object interactions. Depending upon the number of interactions, the objective function is calculated and the test cases are ordered accordingly. This technique is applied to the components developed in Java for a software system and found to be very effective in early fault detection as compared with non-prioritize approach. © 2013 Springer Science+Business Media New York.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Embedding with autoencoder regularization

Embedding with autoencoder regularization

引用

European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML PKDD 2013

作者： Yu, Wenchao Zeng, Guangxiang Luo, Ping Zhuang, Fuzhen He, Qing Shi, Zhongzhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China University of Science and Technology of China China HP Labs. China China

ISBN: (纸本)9783642409936

The problem of embedding arises in many machine learning applications with the assumption that there may exist a small number of variabilities which can guarantee the "semantics" of the original high-dimensional data. Most of the existing embedding algorithms perform to maintain the locality-preserving property. In this study, inspired by the remarkable success of representation learning and deep learning, we propose a framework of embedding with autoencoder regularization (EAER for short), which incorporates embedding and autoencoding techniques naturally. In this framework, the original data are embedded into the lower dimension, represented by the output of the hidden layer of the autoencoder, thus the resulting data can not only maintain the locality-preserving property but also easily revert to their original forms. This is guaranteed by the joint minimization of the embedding loss and the autoencoder reconstruction error. It is worth mentioning that instead of operating in a batch mode as most of the previous embedding algorithms conduct, the proposed framework actually generates an inductive embedding model and thus supports incremental embedding efficiently. To show the effectiveness of EAER, we adapt this joint learning framework to three canonical embedding algorithms, and apply them to both synthetic and real-world data sets. The experimental results show that the adaption of EAER outperforms its original counterpart. Besides, compared with the existing incremental embedding algorithms, the results demonstrate that EAER performs incremental embedding with more competitive efficiency and effectiveness. © 2013 Springer-Verlag.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Security games with surveillance cost and optimal timing of attack execution

Security games with surveillance cost and optimal timing of ...

引用

12th International Conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013

作者： An, Bo Brown, Matthew Vorobeychik, Yevgeniy Tambe, Milind Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China University of Southern California Los Angeles CA 90089 United States Sandia National Laboratories Livermore CA 94550 United States

ISBN: (纸本)9781627487665

Stackelberg games have been used in several deployed applications to allocate limited resources for critical infrastructure protection. These resource allocation strategies are randomized to prevent a strategic attacker from using surveillance to learn and exploit patterns in the allocation. Past work has typically assumed that the attacker has perfect knowledge of the defender's randomized strategy or can learn the defender's strategy after conducting a fixed period of surveillance. In consideration of surveillance cost, these assumptions are clearly simplistic since attackers may act with partial knowledge of the defender's strategies and may dynamically decide whether to attack or conduct more surveillance. In this paper, we propose a natural model of limited surveillance in which the attacker dynamically determine a place to stop surveillance in consideration of his updated belief based on observed actions and surveillance cost. We show an upper bound on the maximum number of observations the attacker can make and show that the attacker's optimal stopping problem can be formulated as a finite state space MDP. We give mathematical programs to compute optimal attacker and defender strategies. We compare our approaches with the best known previous solutions and experimental results show that the defender can achieve significant improvement in expected utility by taking the attacker's optimal stopping decision into account, validating the motivation of our work. Copyright © 2013, International Foundation for Autonomous Agents and Multiagent Systems (***). All rights reserved.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：