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

21st ACM International Conference on information and Knowledge Management, CIKM 2012

作者： Yan, Rui Wan, Xiaojun Lapata, Mirella Zhao, Wayne Xin Cheng, Pu-Jen Li, Xiaoming Dept. of Computer Science and Information Engineering National Taiwan University Taipei 10617 Taiwan Institute of Computer Science and Technology Peking University Beijing 100871 China Institute for Language Cognition and Computation University of Edinburgh Edinburgh EH8 9AB United Kingdom Dept. of Computer Science and Technology Peking University Beijing 10087 China State Key Lab. of Virtual Reality Tech. and Systems Beihang University Beijing 100083 China

ISBN: (纸本)9781450311564

We present a novel graph-based framework for timeline summarization, the task of creating different summaries for different timestamps but for the same topic. Our work extends timeline summarization to a multimodal setting and creates timelines that are both textual and visual. Our approach exploits the fact that news documents are often accompanied by pictures and the two share some common content. Our model optimizes local summary creation and global timeline generation jointly following an iterative approach based on mutual reinforcement and co-ranking. In our algorithm, individual summaries are generated by taking into account the mutual dependencies between sentences and images, and are iteratively refined by considering how they contribute to the global timeline and its coherence. Experiments on real-world datasets show that the timelines produced by our model outperform several competitive baselines both in terms of ROUGE and when assessed by human evaluators. © 2012 ACM.

关键词： Reinforcement

来源：评论

学校读者我要写书评

暂无评论

Bringing IoT and Cloud Computing towards Pervasive Healthcare

Bringing IoT and Cloud Computing towards Pervasive Healthcar...

引用

International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS)

作者： Charalampos Doukas Ilias Maglogiannis Dept. of Information & Communication Systems Engineering University of the Aegean Samos Greece Dept. of Computer Science & Biomedical Informatics University of Central Greece Lamia Greece

ISBN: (纸本)9781467313285

Pervasive healthcare applications utilizing body sensor networks generate a vast amount of data that need to be managed and stored for processing and future usage. Cloud computing among with the Internet of Things (IoT) concept is a new trend for efficient managing and processing of sensor data online. This paper presents a platform based on Cloud Computing for management of mobile and wearable healthcare sensors, demonstrating this way the IoT paradigm applied on pervasive healthcare.

关键词： Cloud computing Medical services Clouds Biomedical monitoring Mobile communication Real time systems

来源：评论

学校读者我要写书评

暂无评论

Stabilization of Interactive Differential Evolution for Generating Natural Facial Images

Stabilization of Interactive Differential Evolution for Gene...

引用

International Conference on Awareness science and Technology

作者： Dylan Kessler Qiangfu Zhao Dept. of Computer Science and Software Engineering Rose-Hulman Institute of Technology Terre Haute Indiana United States Dept. of Computer and Information Systems The University of Aizu Aizuwakamatsu Fukushima Japan

ISBN: (纸本)9781467321112

In today's society, information security and hiding is a key mechanism to protecting one's identity. Image morphing can hide a secret image in a morphed image using a second, reference image. One of the primary methods to make the morphing based information hiding technology practically useful is interactive evolutionary algorithm (IEA). When using IEA, however, the user who is rating the images for their naturalness must rate a large amount of images. During this period of time, it is possible for the user to subconsciously shift the rating criteria, thus skewing the results of the algorithm. To help solve this problem, we propose a k-nearest neighbor (k-NN) reminder, which analyzes the user's previous inputs and creates an estimated fitness rating for images to aid the user in grounding his or her ratings. We ran experiments testing the differences in using the IEA with and without the k-NN reminder, looking to see what impact the algorithm had on the speed of the analysis and the ease of the user's rating ability. Results show that in many instances, the k-NN makes it easier for the user to maintain a standard criterion for the rating of images, with no noticeable impact on the speed of the process.

关键词： information hiding steganography image morphing interactive differential evolution k-nearest neighbor algorithm image morphing K-nearest neighbor algorithm Steganography Rating images International Energy Agency Consumers impact velocity Mug shots speed

来源：评论

学校读者我要写书评

暂无评论

ON THE COHERENT AND NON COHERENT COMPONENTS OF BARE AND VEGETATED TERRAIN BISTATIC SCATTERING: MODELLING THE GNSS-R SIGNAL OVER LAND

ON THE COHERENT AND NON COHERENT COMPONENTS OF BARE AND VEGE...

引用

IEEE International Geoscience and Remote Sensing Symposium

作者： Nazzareno Pierdicca Leila Guerriero Marco Brogioni Alejandro Egido Dept. Information Engineering Electronics and Telecommunications Sapienza Univ. of Rome Dept. Computer Science Systems and Production Tor Vergata Univ. of Rome STARLAB

ISBN: (纸本)9781467311601

The work presented in this paper has been carried out with the aim of interpreting the data of a GNSS Reflectometer (GNSS-R) over land. The problem involves the analysis of bistatic scattering of the incoming signal collected around the specular direction. This requires to model the coherent component associated to the mean surface but at the same time the diffuse incoherent component due to roughness at wavelength scale. In presence of vegetation, both components will be affected, the former mainly because of the canopy attenuation and the latter for the combined effect of attenuation and volume scattering. The paper reviews the problem and presents the approach followed to develop a simulator of GNSS-R data over land, aiming to support potential applications of GNSS-R for soil moisture and biomass retrieval.

关键词： Bistatic scattering GNSS-R Land applications

来源：评论

学校读者我要写书评

暂无评论

A generalized net with an ACO-algorithm optimization component 1

引用

8th International Conference on Large-Scale Scientific Computations,LSSC 2011

作者： Atanassova, Vassia Fidanova, Stefka Chountas, Panagiotis Atanassov, Krassimir Institute of Information and Communication Technologies Bulgarian Academy of Sciences Acad. G. Bonchev Str. bl. 2 Sofia 1113 Bulgaria University of Westminster Dept. of Business Information Systems School of Electronics and Computer Science 115 New Cavendish Street London W1W 6UW United Kingdom Bioinformatics and Mathematical Modelling Dept. Institute of Biophysics and Biomedical Engineering Bulgarian Academy of Sciences Acad. G. Bonchev Str. bl. 105 Sofia 1113 Bulgaria

ISBN: (数字)9783642298431

ISBN: (纸本)9783642298424

In the paper we describe a generalized net GACOA realizing an arbitrary algorithms for ant colony optimization. In this sense, this net is universal for all standard algorithms for ant colony optimization, since it describes the way of functioning and results of their work. Then, we discuss the way of constructing a GN that includes the GACOA as a subnet. In this way, we ensure the generalized net tokens' optimal transfer with regard to the results of GACOA. Thus, we construct a generalized net, featuring an optimization component and thus optimally functioning. © 2012 Springer-Verlag.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Application of k-nearest Neighbour predictor for classifying trust of B2C customers

引用

Journal of Theoretical and Applied information Technology 2012年第1期36卷 18-25页

作者： Nilashi, Mehrbakhsh Bagherifard, Karamollah Ibrahim, Othman Janahmadi, Nasim Panjalizadeh, Bahman Barisami, Mousa Dept. of Computer Engineering Islamic Azad University Roudsar and Amlash Branch Roudsar Iran Dept. of Computer Engineering Islamic Azad University Yasooj branch Yasooj Iran Faculty of Computer Science and Information Systems UTM Skudai-81310 Malaysia Dept. of Computer Engineering Islamic Azad University Roudsar and Amlash Branch Roudsar Iran Islamic Azad University Roudsar and Amlash Branch Roudsar Iran Dept. of Computer Engineering Islamic Azad University Roudsar and Amlash Branch Roudsar Iran

K-nearest neighbor (k-NN) classification is one of the most fundamental classification methods and should be one of the first choices for a classification study when there is little or no prior knowledge about the distribution of the data. In addition, nearest neighbor analysis is a method for classifying cases based on their similarity to other cases. In this paper using k-NN method some factors that affect on customer trust in online transactions, were classified. Raw data gathered from customers when they were buying as customer in B2C websites. One questionnaire was developed and data was gathered from online customers. After organizing data, k-NN method was applied and desired results were obtained. Results showed that in which positions customer can trust to B2C websites and which factors are more significant. Accordingly, in this paper k-NN enable us to predict role of factors on trust level in five levels. © 2005 - 2012 JATIT & LLS.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Differential evolution-binary particle swarm optimization algorithm for the analysis of aryl β-diketo acids for HIV-1 integrase inhibition

Differential evolution-binary particle swarm optimization al...

引用

2012 IEEE Congress on Evolutionary Computation, CEC 2012

作者： Ko, Gene M. Srinivas Reddy, A. Kumar, Sunil Garg, Rajni Bailey, Barbara A. Hadaegh, Ahmad R. Computational Science Research Center San Diego State University San Diego CA 92182-1245 United States La Jolla Bioengineering Institute San Diego CA 92121 United States Dept. of Electrical and Computer Engineering San Diego State University San Diego CA 92182-1309 United States Dept. of Mathematics and Statistics San Diego State University San Diego CA 92182-7720 United States Dept. of Computer Science and Information Systems California State University San Marcos San Marcos CA 92096-0001 United States

ISBN: (纸本)9781467315098

A hybrid differential evolution-binary particle swarm optimization (DE-BPSO) algorithm is proposed as a feature selection algorithm in the development of quantitative structure-activity relationship (QSAR) models. DE is used to evolve the velocities of the particle swarm from which a series of rules are used to determine the discrete values of the position vectors which form chemical descriptor subsets. These descriptor subsets are then used to develop models for QSAR analysis. DE-BPSO was found to outperform the standalone BPSO algorithm. The DE-BPSO algorithm was then used to develop multiple linear regression models for the analysis of aryl β-diketo acid compounds for the inhibition of HIV-1 integrase. This model highlights the significance of hydrophobicity and partial positive charges of the hydrogen atoms on the molecular surface in influencing the biological activities of these compounds for the inhibition of HIV-1 integrase. © 2012 IEEE.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Lattice based attack on common private exponent RSA

引用

International Journal of computer science Issues 2012年第2期9卷 311-314页

作者： Santosh Kumar, R. Narasimham, C. Pallam Setty, S. Department of Information Technology MVGR College of Engg. Vizianagaram India Department of Information Technology VR Siddhartha Engineering College Vijayawada-7 India Dept. of Computer Science and Systems Engineering Andhra University Vishakhapatnam India

Lattice reduction is a powerful concept for solving diverse problems involving point lattices. Lattice reduction has been successfully utilizing in Number Theory, Linear algebra and Cryptology. Not only the existence of lattice based cryptosystems.of hard in nature, but also has vulnerabilities by lattice reduction techniques. In this paper, we show that Wiener's small private exponent attack, when viewed as a heuristic lattice based attack, is extended to attack many instances of RSA when they have the same small private exponent. © 2012 International Journal of computer science Issues.

关键词： Number theory

来源：评论

学校读者我要写书评

暂无评论

Heuristics for Speeding Up Betweenness Centrality Computation

Heuristics for Speeding Up Betweenness Centrality Computatio...

引用

IEEE International Conference on and IEEE International Confernece on Social Computing (SocialCom) Privacy, Security, Risk and Trust (PASSAT)

作者： Rami Puzis Polina Zilberman Yuval Elovici Shlomi Dolev Ulrik Brandes Universitv of Maryland Institute for Advanced Computer Studies (UMIACS) College Park MD USA Telekom Innovation Laboratories at Ben-Gurion University of the Negev Israel Information Systems Engineering Dept. Ben-Gurion University of the Negev Israel Dept. of Computer Science Ben-Gurion University of the Negev Israel Department of Computer & Information Science University of Konstanz Germany

We propose and evaluate two complementary heuristics to speed up exact computation of the shortest-path between ness centrality. Both heuristics are relatively simple adaptations of the standard algorithm for between ness centrality. Consequently, they generalize the computation of edge between ness and most other variants, and can be used to further speed up between ness estimation algorithms, as well. In the first heuristic, structurally equivalent vertices are contracted based on the observation that they have the same centrality and also contribute equally to the centrality of others. In the second heuristic, we first apply a linear-time between ness algorithm on the block-cut point tree and then compute the remaining contributions separately in each biconnected component. Experiments on a variety of large graphs illustrate the efficiency and complementarity of our heuristics.

关键词： Equations Partitioning algorithms Educational institutions Electronic mail Artificial neural networks Bismuth Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Power management of the third generation intel core micro architecture formerly codenamed ivy bridge

Power management of the third generation intel core micro ar...

引用

IEEE Hot Chips Symposium (HCS)

作者： Sanjeev Jahagirdar Varghese George Inder Sodhi Ryan Wells School of Electrical Science IIT Bhubaneswar Dept. of Computer Engineering Guangxi University of Technology Liuzhou China King's College London Dept. of Electronic Information and Control Engineering Guangxi University of Technology Liuzhou China INSA Rouen Cisco Systems and CTU Prague

ISBN: (纸本)9781467388801

This article consists of a collection of slides from the author's conference presentation on Ivy Bridge, power management applications of the third generation core Intel micro architecture. Some of the specific topics discussed include: an overview of the Ivy Bridge architecture and supported applications; power scaling and management facilities; core product features; power efficiency; voltage control and optimization technqiues; power sharing capabilities; and system architecture.

关键词： Power system management Network architecture Microarchitecture Program processors Manufacturing processes Next generation networking Fabrication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：