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

10th IFAC Symposium on Robot Control, SYROCO 2012

作者： Puljiz, David Varga, Maja Bogdan, Stjepan Department of Control and Computer Engineering Faculty of Electrical Engineering and Computing University of Zagreb Zagreb Croatia Laboratory of Intelligent Systems Ecole Polytechnique Federale de Lausanne 1015 Lausanne Switzerland

ISBN: (纸本)9783902823113

Animals use stochastic search strategies to find a potential nest or to localize the food source. Animals do not rely much on the environmental cues or their sensory inputs. Since their cognitive capabilities are rather limited, search strategies are usually simplistic and stochastic. And yet such simple search strategies result in high efficiency in finding potential targets in limited time intervals. Similar problems with perception of the environment and limited computational power and sensory inputs are observed on the mobile robots used in search scenarios. In spite of their limitations, such robotic systems usually perform deterministic search strategies which heavily depend on environmental cues and sensory input. The research question we are addressing in this paper is which stochastic search strategy has the best performance in terms of area coverage and can stochastic search strategies outperform deterministic search strategies. © 2012 IFAC.

关键词： Sensory perception

来源：评论

学校读者我要写书评

暂无评论

CloudRank-D： benchmarking and ranking cloud computing systems for data processing applications

引用

Frontiers of computer Science 2012年第4期6卷 347-362页

作者： Chunjie LUO Jianfeng ZHAN Zhen JIA Lei WANG Gang LU Lixin ZHANG Cheng-Zhong XU Ninghui SUN State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesBeijing 100019China Department of Electrical and Computer Engineering Wayne State UniversityDetroitM148202USA Shenzhenlnstitute of Advanced Technology Chinese Academy of SciencesShenzhen 518055China

With the explosive growth of information, more and more organizations are deploying private cloud systems or renting public cloud systems to process big data. However, there is no existing benchmark suite for evaluating cloud performance on the whole system level. To the best of our knowledge, this paper proposes the first benchmark suite CloudRank-D to benchmark and rank cloud computing sys- tems that are shared for running big data applications. We an- alyze the limitations of previous metrics, e.g., floating point operations, for evaluating a cloud computing system, and propose two simple metrics： data processed per second and data processed per Joule as two complementary metrics for evaluating cloud computing systems. We detail the design of CloudRank-D that considers representative applications, di- versity of data characteristics, and dynamic behaviors of both applications and system software platforms. Through experi- ments, we demonstrate the advantages of our proposed met- tics. In several case studies, we evaluate two small-scale de- ployments of cloud computing systems using CloudRank-D.

关键词： data center systems clouds big data applica- tions benchmarks evaluation metrics

来源：评论

学校读者我要写书评

暂无评论

Evaluation of the impact of IPPS on the Greek wholesale and retail electricity markets

Evaluation of the impact of IPPS on the Greek wholesale and ...

引用

11th IASTED European Conference on Power and Energy systems, EuroPES 2012

作者： Biskas, Pandelis N. Simoglou, Christos K. Zoumas, Christoforos E. Bakirtzis, Anastasios G. Power Systems Laboratory Department of Electrical and Computer Engineering Aristotle University of Thessaloniki 54124 Thessaloniki Greece

ISBN: (纸本)9780889869240

This paper investigates the impact of the installation and participation of conventional generating units owned by Independent Power Producers (IPPs) on the operation of the Greek competitive wholesale and retail electricity markets. A mid-term scheduling model formulated and solved as a mixed-integer linear program (MILP) is presented. This model is based on the day-ahead market clearing algorithm of the Greek wholesale electricity market. The effect of the participation of IPPs is examined in terms of various market indicators through simulations of the Greek wholesale electricity market during the year 2012 with and without the existence of IPPs.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

BT-02FUNCTIONALLY-DEFINED THERAPEUTIC TARGETS IN DIFFUSE INTRINSIC PONTINE GLIOMA

引用

Neuro-Oncology 2015年第SUPPL_3期17卷 iii3-iii3页

作者： Grasso, Catherine S. Tang, Yujie Truffaux, Nathalene Berlow, Noah E. Liu, Lining Debily, Marie-Anne Quist, Michael J. Davis, Lara Huang, Elaine C. Woo, Pamelyn J. Ponnuswami, Anitha Chen, Spenser Johung, Tessa Sun, Wenchao Kogiso, Mari Du, Yuchen Lin, Qi Huang, Yulun Hutt-Cabezas, Marianne Warren, Katherine E. Le Dret, Ludivine Meltzer, Paul S. Mao, Hua Quezado, Martha van Vuurden, Dannis G. Abraham, Jinu Fouladi, Maryam Svalina, Matthew N. Wang, Nicholas Hawkins, Cynthia Raabe, Eric Hulleman, Esther Spellman, Paul T. Li, Xiao-Nan Keller, Charles Pal, Ranadip Grill, Jacques Monje, Michelle Center for Spatial Systems Biomedicine Department of Molecular and Medical Genetics Oregon Health & Science University Portland OR USA These authors contributed equally to this work Depts. of Neurology Neurosurgery and Pediatrics Stanford University Stanford CA USA Unité Mixte de Recherche du Centre National de la Recherche Scientifique 8203 Institut Gustave Roussy et Université Paris-Sud Villejuif France Electrical and Computer Engineering Texas Tech University Lubbock TX USA Université d'Evry-Val d'Essone Evry France Pediatric Cancer Biology Program Papé Family Pediatric Research Institute Dept. of Pediatrics Oregon Health & Science University Portland OR USA Children's Cancer Therapy Development Institute Fort Collins CO USA Laboratory of Molecular Neurooncology Texas Children's Cancer Center Baylor College of Medicine Houston TX USA Department of Neurosurgery The First Affiliated Hospital of Soochow Suzhou China Departments of Oncology and Pathology Johns Hopkins University Baltimore MD USA National Cancer Institute Bethesda MD USA Department of Pediatric Oncology Hematology and Neuro-Oncology Research Group Cancer Center Amsterdam VU University Medical Center Amsterdam The Netherlands Cancer and Blood Diseases Institute Cincinnati Children's Hospital Medical Center Cincinnati OH USA Dept. of Paediatric Laboratory Medicine University of Toronto Scientist Labatt Brain Tumour Research Centre Hospital for Sick Children University of Toronto Toronto ON Canada Departement de Cancerologie de l'Enfant et de l'Adolescent Institut Gustave Roussy Université Paris-Sud Villejuif France

来源：评论

学校读者我要写书评

暂无评论

Isotropic hashing

Isotropic hashing

引用

26th Annual Conference on Neural Information Processing systems 2012, NIPS 2012

作者： Kong, Weihao Li, Wu-Jun Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University China

ISBN: (纸本)9781627480031

Most existing hashing methods adopt some projection functions to project the original data into several dimensions of real values, and then each of these projected dimensions is quantized into one bit (zero or one) by thresholding. Typically, the variances of different projected dimensions are different for existing projection functions such as principal component analysis (PCA). Using the same number of bits for different projected dimensions is unreasonable because larger-variance dimensions will carry more information. Although this viewpoint has been widely accepted by many researchers, it is still not verified by either theory or experiment because no methods have been proposed to find a projection with equal variances for different dimensions. In this paper, we propose a novel method, called isotropic hashing (IsoHash), to learn projection functions which can produce projected dimensions with isotropic variances (equal variances). Experimental results on real data sets show that IsoHash can outperform its counterpart with different variances for different dimensions, which verifies the viewpoint that projections with isotropic variances will be better than those with anisotropic variances.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Emoticon smoothed language models for twitter sentiment analysis 26

Emoticon smoothed language models for twitter sentiment anal...

引用

26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12

作者： Liu, Kun-Lin Li, Wu-Jun Guo, Minyi Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University China

ISBN: (纸本)9781577355687

Twitter sentiment analysis (TSA) has become a hot research topic in recent years. The goal of this task is to discover the attitude or opinion of the tweets, which is typically formulated as a machine learning based text classification problem. Some methods use manually labeled data to train fully supervised models, while others use some noisy labels, such as emoticons and hashtags, for model training. In general, we can only get a limited number of training data for the fully supervised models because it is very labor-intensive and time-consuming to manually label the tweets. As for the models with noisy labels, it is hard for them to achieve satisfactory performance due to the noise in the labels although it is easy to get a large amount of data for training. Hence, the best strategy is to utilize both manually labeled data and noisy labeled data for training. However, how to seamlessly integrate these two different kinds of data into the same learning framework is still a challenge. In this paper, we present a novel model, called emoticon smoothed language model (ESLAM), to handle this challenge. The basic idea is to train a language model based on the manually labeled data, and then use the noisy emoticon data for smoothing. Experiments on real data sets demonstrate that ESLAM can effectively integrate both kinds of data to outperform those methods using only one of them. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Double-bit quantization for hashing 26

Double-bit quantization for hashing

引用

26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12

作者： Kong, Weihao Li, Wu-Jun Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University China

ISBN: (纸本)9781577355687

Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to its fast query speed and low storage cost. Because it is NP hard to directly compute the best binary codes for a given data set, mainstream hashing methods typically adopt a two-stage strategy. In the first stage, several projected dimensions of real values are generated. Then in the second stage, the real values will be quantized into binary codes by thresholding. Currently, most existing methods use one single bit to quantize each projected dimension. One problem with this single-bit quantization (SBQ) is that the threshold typically lies in the region of the highest point density and consequently a lot of neighboring points close to the threshold will be hashed to totally different bits, which is unexpected according to the principle of hashing. In this paper, we propose a novel quantization strategy, called double-bit quantization (DBQ), to solve the problem of SBQ. The basic idea of DBQ is to quantize each projected dimension into double bits with adaptively learned thresholds. Extensive experiments on two real data sets show that our DBQ strategy can significantly outperform traditional SBQ strategy for hashing. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Binary codes

来源：评论

学校读者我要写书评

暂无评论

The devil is in the (implementation) details: An empirical analysis of OAuth SSO systems 12

The devil is in the (implementation) details: An empirical a...

引用

2012 ACM Conference on computer and Communications Security, CCS 2012

作者： Sun, San-Tsai Beznosov, Konstantin Laboratory for Education and Research in Secure Systems Engineering Department of Electrical and Computer Engineering University of British Columbia Vancouver Canada

ISBN: (纸本)9781450316507

Millions of web users today employ their Facebook accounts to sign into more than one million relying party (RP) web-sites. This web-based single sign-on (SSO) scheme is enabled by OAuth 2.0, a web resource authorization protocol that has been adopted by major service providers. The OAuth 2.0 protocol has proven secure by several formal methods, but whether it is indeed secure in practice remains an open question. We examine the implementations of three major OAuth identity providers (IdP) (Facebook, Microsoft, and Google) and 96 popular RP websites that support the use of Facebook accounts for login. Our results uncover several critical vulnerabilities that allow an attacker to gain unauthorized access to the victim user's profile and social graph, and impersonate the victim on the RP website. Closer examination reveals that these vulnerabilities are caused by a set of design decisions that trade security for implementation simplicity. To improve the security of OAuth 2.0 SSO systems in real-world settings, we suggest simple and practical improvements to the design and implementation of IdPs and RPs that can be adopted gradually by individual sites. Copyright © 2012 ACM.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Gallager's Error Exponent Analysis of STBC systems over η-μ Fading Channels

Gallager's Error Exponent Analysis of STBC Systems over η-...

引用

IEEE International Conference on Communications

作者： Jiayi Zhang Michail Matthaiou George K. Karagiannidis Zhenhui Tan Haibo Wang State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing China Department of Signals and Systems Chalmers University of Technology Gothenburg Sweden Department of Electrical and Computer Engineering Aristotle University of Thessaloniki Thessaloniki Greece Institute of Broadband Wireless Mobile Communications Beijing Jiaotong University Beijing China

The Gallager's random coding error exponent for space-time block codes (STBC) over multiple-input multiple-output (MIMO) block-fading channels, with Gaussian input distribution, is investigated. Gallager's error exponent can be used to determine the required codeword length to achieve a prescribed error probability at a given rate below the channel capacity. We first provide new, analytical expressions for Gallager's exponent of STBC systems over η-μ fading channels. The Shannon capacity and cutoff rate, which can be directly derived from Gallager's exponent, are further examined. In order to get additional insights, a high signal-to-noise ratio analysis is pursued to investigate the effects of coherence time and codeword length on the error probability. For the sake of completeness, we provide the link to previous known results on Rayleigh and Nakagami-m fading channels.

关键词： MIMO Channel coding Signal to noise ratio Error probability Rayleigh channels

来源：评论

学校读者我要写书评

暂无评论

Performance of CA-CFAR receivers in alpha-stable clutter

Performance of CA-CFAR receivers in alpha-stable clutter

引用

IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)

作者： Valentine A. Aalo Kostas P. Peppas George Efthymoglou Mohammed Alwakeel Sami Alwakeel Department of Computer & Electrical Engineering and Computer Science Florida Atlantic University Boca Raton FL USA Laboratory of Mobile Communications National Centre for Scientific Research “Demokritos” Patriarhou Grigoriou & Neapoleos Athens Greece University of Pireaus Piraeus GR Sensor Networks and Cellular Systems (SNCS) Research Center University of Tabuk Tabuk Saudi Arabia

We analyze the performance of a cell averaging constant false alarm rate (CA-CFAR) receiver that operates in a heavy-tailed clutter environment that is modeled by an alpha-stable distribution. Stable distributions are usually characterized with known characteristic function but their probability distribution are not known in closed form except for some special cases of the characteristic exponent α. Therefore, previous performance studies of CFAR in alpha-stable clutter have been limited to only some very special cases of α that correspond to the Gaussian, Cauchy and Pearson distributions, for which the statistical distribution of the clutter is available in closed-form. In this paper, we derive the distribution of the receiver output for arbitrary values of α in terms of the Fox's H-function. The derived statistical distribution is useful in evaluating the false alarm and detection probabilities of the system.

关键词： Clutter

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：