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

第28届中国控制与决策会议

作者： Ning Li Hongbin Ma Chenguang Yang School of Automation Beijing Institute of Technology State Key Laboratory of Complex System Intelligent Control and Decision Beijing Institute of Technology Zienkiewicz Centre for Computational Engineering Swansea University

ISBN: (纸本)9781467397155

Radio Frequency Identification(RFID) technology has shown its potential in the field of indoor positioning in recent years,and has been widely used in large establishments such as the airport lobby,supermarkets,libraries,underground parking and so ***,the complexity of the indoor environments make positioning a challenging problem in terms of accuracy,stability,reliability,and interference *** this paper,we develop an algorithm of passive RFID indoor positioning based on interval Kalman filter,according to the geometric constraints of responding tags,combined with the target motion *** interval Kalman filter is adopted to integrate target position of one preceding time point and reference tags position to estimate the current *** of this algorithm is to use passive tags to reduce hardware costs,and on the other hand the introduction of filtering algorithm improves the positioning accuracy.

关键词： RFID Indoor positioning Interval Kalman Filter Interval arithmetic

来源：评论

学校读者我要写书评

暂无评论

Exploring Optimal Frequency Caps in Real Time Bidding Advertising

Exploring Optimal Frequency Caps in Real Time Bidding Advert...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Rui Qin Yong Yuan Fei-Yue Wang Beijing Engineering Research Center of Intelligent Systems and Technology Beijing China The State Key Laboratory of Management and Control for Complex Systems Chinese Academy of Sciences Beijing China Research Center of Military Computational Experiments and Parallel System National University of Defense Technology Changsha China

ISBN: (纸本)9781509039371

Benefited from the high-speed development of Internet and the popularization of big data technology, Real Time Bidding (RTB) emerged and developed quickly, and has become one of the most important and popular model for online computational advertising. In the pay-per-impression based RTB advertising, frequency capping is undoubtedly one of the most crucial issues faced by advertisers and Demand Side Platforms (DSPs), since there are generally vast amount of ad requests in RTB markets, among which many may be triggered by the same target audience. As such, choosing the optimal frequency cap considering all the advertisers becomes a critical issue faced by DSPs. Considering that displaying one advertisement multiple number of times to the same user will diminish the advertising effect, we introduce the concept of discount factor and establish an optimization model of frequency capping to seek for the optimal frequency cap for each advertiser. We also design some experiments to validate our proposed model by utilizing the computational experiment approach, and the experimental results show that the optimal frequency cap can be influenced by the values of the discount factors, and higher value of the discount factor can deduce the advertising effect of larger frequency cap. Moreover, when the discount factors of the advertisers take different values, there also exists an optimal frequency cap, at which the advertisers can get the expected maximum revenue in the long run.

关键词： Advertising Digital signal processing computational modeling Big data Time-frequency analysis Radio spectrum management Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Optimizing Market Segmentation Granularity in RTB Advertising: A computational Experimental Study

Optimizing Market Segmentation Granularity in RTB Advertisin...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

ISBN: (纸本)9781509039371

Real Time Bidding (RTB) is a novel business model of online computational advertising with the integration of Internet economy and big data analysis. It can help advertisers achieve the precision marketing through the market segmentation strategies of Demand Side Platforms (DSPs). Based on a mathematical programming approach, this paper studied DSPs' strategies for market segmentation, and established a selection model of the granularity for segmenting RTB advertising markets. We proposed to validate our model using the computational experiment approach, and the experimental results show that: 1) with the increasing refinement of the market segmentation granularity, the total revenue has a tendency of a rise first followed by a decline, 2) the optimal granularity of market segmentation will be significantly influenced by the number of advertisers on the DSP, but less influenced by the number of ad requests. Our findings show the crucial role of market segmentation on the RTB advertising effect, and indicate that the DSPs should adjust their market segmentation strategies according to their total number of advertisers. Our findings also highlight the importance of advertisers as well as the characteristics of the target audiences in DSPs' market segmentation decisions.

关键词： Digital signal processing computational modeling Advertising Numerical models Big data complex systems Automation

来源：评论

学校读者我要写书评

暂无评论

A co-evolutionary particle swarm optimization with dynamic topology for solving multi-objective optimization problems

Advances in Modelling and Analysis A

引用

Advances in Modelling and Analysis A 2016年第1期53卷 145-159页

作者： Wu, Daqing Tang, Lixiang Li, Haiyan Ouyang, LiJun Computer Science and Technology Institute University of South China HangyangHunan China Antai College of Economics and Management Shanghai Jiao Tong University Shanghai200240 China Zigong643000 China Key Laboratory of Guangxi High Schools for Complex System and Computational Intelligence Guangxi University for Nationalities Nanning530006 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University HefeiAnhui Province230039 China Department of Business Administration Hunan University of Finance and Economics Hunan410205 China

This paper proposes a multi-objective with dynamic topology particle swarm optimization (PSO) algorithm for solving multi-objective problems, named DTPSO. One of the main drawbacks of classical multi-objective particle swarm optimization algorithm is low diversity. To overcome this disadvantage, DTPSO uses two dynamic local best particles to lead the search particles with multiple populations to deal with multiple objectives, and maintains diversity of new found non-dominated solutions via partitioned the searching space into fixed number of cells. The proposed DTPSO is validated through comparisons with other two multi-objective algorithms using established benchmarks and metrics. Simulation results demonstrated that DTPSO shows competitive, if not better, performance as compared to the other algorithms. © 2016, AMSE Press. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Gene expression imputation across multiple brain regions provides insights into schizophrenia risk (vol 51, pg 659, 2019)

引用

NATURE GENETICS 2019年第6期51卷 1068-1068页

作者： Huckins, Laura M. Dobbyn, Amanda Ruderfer, Douglas M. Hoffman, Gabriel Wang, Weiqing Pardinas, Antonio F. Rajagopal, Veera M. Als, Thomas D. Nguyen, Hoang T. Girdhar, Kiran Boocock, James Roussos, Panos Fromer, Menachem Kramer, Robin Domenici, Enrico Gamazon, Eric R. Purcell, Shaun Demontis, Ditte Borglum, Anders D. Walters, James T. R. O'Donovan, Michael C. Sullivan, Patrick Owen, Michael J. Devlin, Bernie Sieberts, Solveig K. Cox, Nancy J. Im, Hae Kyung Sklar, Pamela Stahl, Eli A. Pamela Sklar Division of Psychiatric Genomics Icahn School of Medicine at Mount Sinai New York NY USA Department of Genetics and Genomics Icahn School of Medicine at Mount Sinai New York NY USA Department of Psychiatry Icahn School of Medicine at Mount Sinai New York NY USA Icahn Institute for Genomics and Multiscale Biology Icahn School of Medicine at Mount Sinai New York NY USA Vanderbilt University Medical Center Nashville TN USA MRC Centre for Neuropsychiatric Genetics and Genomics Cardiff University Cardiff UK Department of Biomedicine Aarhus University Aarhus Denmark The Lundbeck Foundation Initiative for Integrative Psychiatric Research iPSYCH Denmark Center for Integrative Sequencing Aarhus University Aarhus Denmark Department of Human Genetics David Geffen School of Medicine University of California Los Angeles Los Angeles CA USA Human Brain Collection Core National Institute of Mental Health Bethesda MD USA Laboratory of Neurogenomic Biomarkers Centre for Integrative Biology (CIBIO) University of Trento Trento Italy Clare Hall University of Cambridge Cambridge UK University of North Carolina at Chapel Hill Chapel Hill NC USA Karolinska Institutet Stockholm Sweden Department of Psychiatry University of Pittsburgh Pittsburgh PA USA Systems Biology Sage Bionetworks Seattle WA USA Section of Genetic Medicine Department of Medicine University of Chicago Chicago IL USA Integrated Technology Research Laboratories Pharmaceutical Research Division Takeda Pharmaceutical Company Limited Fujisawa Japan Neuropsychiatry Section Department of Psychiatry Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Neuropsychiatric Signaling Program Department of Psychiatry Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Psychiatry JJ Peters Virginia Medical Center Bronx NY USA Department of Neuroscience Icahn School of Medicine at Mount Sinai New York New York NY USA Friedman Brain Institute

Transcriptomic imputation approaches combine eQTL reference panels with large-scale genotype data in order to test associations between disease and gene expression. These genic associations could elucidate signals in complex genome-wide association study (GWAS) loci and may disentangle the role of different tissues in disease development. We used the largest eQTL reference panel for the dorso-lateral prefrontal cortex (DLPFC) to create a set of gene expression predictors and demonstrate their utility. We applied DLPFC and 12 GTEx-brain predictors to 40,299 schizophrenia cases and 65,264 matched controls for a large transcriptomic imputation study of schizophrenia. We identified 413 genic associations across 13 brain regions. Stepwise conditioning identified 67 non-MHC genes, of which 14 did not fall within previous GWAS loci. We identified 36 significantly enriched pathways, including hexosaminidase-A deficiency, and multiple porphyric disorder pathways. We investigated developmental expression patterns among the 67 non-MHC genes and identified specific groups of pre- and postnatal expression.

关键词： Gene expression Genome-wide association studies Schizophrenia Transcriptomics

来源：评论

学校读者我要写书评

暂无评论

Improved low energy adaptive clustering hierarchy protocol based on local centroid bat algorithm

引用

Sensor Letters 2014年第9期12卷 1372-1377页

作者： Cao, Yang Cui, Zhihua Li, Feixiang Dai, Chaohua Chen, Weirong Complex System and Computational Intelligence Laboratory Taiyuan University of Science and Technology Shanxi China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Electric Engineering Southwest Jiaotong University Sichuan China

Bat algorithm (BA) is a novel intelligent optimization algorithm. In order to improve the poor local search capability of the algorithm, we present a new variant of bat optimization algorithm based on local centroid strategy (LCBA). Meanwhile, LEACH is a low energy adaptive clustering hierarchy algorithm for wireless sensor networks (WSN). And it has many disadvantages such as random selection of cluster head, taking no account of the remaining energy and position of nodes. To solve these problems, this paper proposes an improved LEACH protocol based on local centroid bat algorithm. The improved protocol divides the cluster head selection process into optimization of temporary cluster head and formal cluster head selection. First, we generate temporary cluster heads by traditional LEACH protocol, then optimize these cluster heads based on LCBA and select formal cluster heads according to the remaining energy of nodes. The result of experiment shows that, comparing with LEACH, LEACH-LCBA can balance the network load efficiently, improve the energy utilization, prolong the network lifetime.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Using artificial plant optimization algorithm with dynamic population and cluster methods to optimize the performance of DV-Hop

引用

Sensor Letters 2014年第8期12卷 1313-1317页

作者： Wu, Xuexue Cui, Zhihua Dai, Chaohua Chen, Weirong Complex System and Computational Intelligence Laboratory Taiyuan University of Science and Technology Shanxi China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Electric Engineering Southwest Jiaotong University Sichuan China

Artificial plant optimization algorithm is a novel stochastic population-based evolutionary algorithm by simulating the plant growing process. In this paper, a new variant, which is called APOA-DC is proposed by incorporating with dynamic population size and cluster methods, furthermore, to investigate the performance, APOA-DC is applied to optimize the DV-Hop localization algorithm, simulation results show it achieves better performance than the DV-Hop algorithm.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Editorial

引用

International Journal on Artificial Intelligence Tools 2012年第3期21卷

作者： Cui, Zhihua Shi, Zhongzhi Alex, Rajan Complex System and Computational Intelligence Laboratory School of Computer Science and Technology Taiyuan University of Science and Technology Shanxi 030024 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences No. 6 Kexueyuan South Road Zhongguancun Haidian District Beijing 100190 China Department of Engineering and Computer Science West Texas AandM University Canyon TX 79015 United States

Swarm intelligence is an umbrella for amount optimization algorithms. This discipline deals with natural and artificial systems composed of many individuals that coordinate their activities using decentralized control and self-organization. In general, multi-agent systems that use some swarm intelligence are said to be swarm intelligent systems. They are mostly used as search engines and optimization tools. The goal of this special issue has been to offer a wide spectrum of sample works throughout the world about innovative methodologies of swarm intelligence. The issue should be useful both for beginners and experienced researchers in the field of computational intelligence. © 2012 World Scientific Publishing Company.

关键词： Swarm intelligence

来源：评论

学校读者我要写书评

暂无评论

Boid particle swarm optimisation

引用

International Journal of Innovative Computing and Applications 2009年第2期2卷 78-85页

作者： Cui, Zhihua Shi, Zhongzhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences No. 6 Kexueyuan South Rd. Zhongguancun Haidian District Beijing 100190 China Complex System and Computational Intelligence Laboratory Taiyuan University of Science and Technology No. 66 Waliu Rd. Wanbailin District Taiyuan Shanxi 030024 China

Particle swarm optimisation (PSO) is a novel population-based stochastic optimisation algorithm inspired by the Reynolds' boid model. The original biological background of boid obeys three basic simple steering rules: separation, alignment and cohesion. However, to promote a simple update equation, none of these rules of boid model is employed by PSO methodology. Due to the weakness of biological background of PSO, in this paper, a new variant of PSO, boid particle swarm optimisation (BPSO), is designed in which cohesion rule and alignment rule are both employed to improve the performance. In BPSO, each particle has two motions: divergent motion and convergent motion. For divergent motion, each particle adjusts its moving direction according to the alignment direction and the cohesion direction, as well as in convergent motion, the original update equation of the standard version of PSO is used. To make a motion transition, a threshold is introduced to make the divergent motion is employed in the first period, whereas the convergent motion is used in the final stage. To testify the efficiency, several unconstrained benchmarks are used to compare. Simulation results show the proposed variant is more effective and efficient than other two variants of PSO when solving multi-modal high-dimensional numerical problems. Copyright © 2009 Inderscience Enterprises Ltd.

关键词： Alignment

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：