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

Conference on MOEMS and Miniaturized Systems XIX

作者： Hedayet, Karim S. Sabry, Yasser M. Khalil, Diaa Ain Shams Univ Fac Engn 1 Elsarayat St Cairo Egypt Si Ware Syst 3 Khalid Ibn Al Waleed St Cairo Egypt

ISBN: (纸本)9781510633506

Handheld spectrometers are gaining attention due to their growing market. The customers seek to analyze their own samples with good accuracy and reasonable cost. Therefore, the spectrometer manufacturers miniaturize their products and reduce their cost. However, this leads to decreased spectral resolution and optical throughput rendering the task of the identifying closely spaced spectral lines challenging. In this work, we report the application of the compressive sensing (CS) techniques on a MEMS Fourier Transform Infrared spectrometer, for the sake of resolution enhancement based on the spectrum sparsity. The spectrometer wavelength range is 1300-2500 nm while its core engine is a micro-machined scanning Michelson interferometer. The interferometer scanning mirror is driven by a MEMS electrostatic actuator with programmable travel range corresponding to two different resolutions of about 16 nm and 8 nm around 1550 nm. The CS algorithm is applied on filtered white light around a wavelength of 2000 nm fed to the spectrometer using multimode optical fiber and is found to enhance the resolving power down to 3 nm starting from the 22 nm resolution. Then the algorithm is applied on larger number of lines by superposing the spectral lines of a tuneable laser source around 1550 nm. The spacing between the spectral lines is varied and the reconstructed spectra by direct FFT and using the CS technique are compared. The CS technique shows overall better spectral resolution the efficiency of the technique is found to deteriorate as the number of spectral lines increases.

关键词： Compressive Sensing MEMS FTIR Spectrometers super resolution greedy algorithm relaxation algorithm

来源：评论

学校读者我要写书评

暂无评论

A scalable exact algorithm for the vertex p-center problem

引用

COMPUTERS & OPERATIONS RESEARCH 2019年 103卷 211-220页

作者： Contardo, Claudio Iori, Manuel Kramer, Raphael Univ Quebec Montreal ESG Dept Management & Technol Montreal PQ Canada UNIMORE Dipartimento Sci & Metodi Ingn Modena Italy

The vertex p-center problem consists in selecting p centers among a finite set of candidates and assigning a set of clients to them, with the aim of minimizing the maximum dissimilarity between a client and its associated center. State-of-the-art algorithms for the problem are based on the solution of a series of covering subproblems, and are particularly efficient when additional reduction rules are used to limit the size of the subproblems. In fact, these algorithms do not scale well when the cardinality of the dissimilarity matrix grows above a few million entries, as the time and space required to compute and store the matrix start dominating those required for solving the subproblems. We introduce a scalable relaxation based iterative algorithm that does not rely on the computation of the entire matrix, but rather relies on the computation of a typically much smaller sub-matrix that is only enlarged if deemed necessary. This method can solve to proven optimality p-center problems derived from the TSP library and containing up to one million clients for small but realistic values of p. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： p-center problem Clustering Facility location relaxation algorithm

来源：评论

学校读者我要写书评

暂无评论

relaxation methods for solving the tensor equation arising from the higher-order Markov chains

引用

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS 2019年第5期26卷 e2260-e2260页

作者： Liu, Dongdong Li, Wen Vong, Seak-Weng Univ Macau Fac Sci & Technol Dept Math Macau Peoples R China Guangdong Univ Technol Sch Appl Math Guangzhou Guangdong Peoples R China South China Normal Univ Sch Math Sci Guangzhou 510631 Guangdong Peoples R China

In this paper, we propose several relaxation algorithms for solving the tensor equation arising from the higher-order Markov chain and the multilinear PageRank. The semi-symmetrization technique on the original equation is also employed to modify the proposed algorithms. The convergence analysis is given for the proposed algorithms. It is shown that the new algorithms are more efficient than the existing ones by some numerical experiments when relaxation parameters are chosen suitably.

关键词： higher-order Markov chain multilinear PageRank relaxation algorithm tensor equation

来源：评论

学校读者我要写书评

暂无评论

A relaxation algorithm FOR DECENTRALIZED RESOURCE ALLOCATION IN FEMTOCELL NETWORKS

A RELAXATION ALGORITHM FOR DECENTRALIZED RESOURCE ALLOCATION...

引用

2nd IEEE International Conference on Cloud Computing and Intelligent Systems (CCIS)

作者： Wang, Xiaoyu Liu, Yuan'an Xie, Gang Deng, Panliang Beijing Univ Posts & Telecommun Sch Elect Engn Beijing 100876 Peoples R China Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Beijing 100876 Peoples R China Beijing Univ Posts & Telecommun Key Lab Univ Wireless Commun Minist Educ Beijing 100876 Peoples R China

ISBN: (纸本)9781467318556;9781467318570

Dynamic spectrum sharing can improve the spectrum efficiency under some constraints on the interference to the authorized users. However, in femtocell networks the sensing reliability of femtocell access point (FAP) is limited by the channel fading and device preference. In this paper, we consider the influence of miss detection and false alarm to the macrocell user (MU) and model this problem as a joint optimization of spectrum detection and power allocation. A relaxation algorithm for decentralized resource allocation has been proposed to maximize the throughput of the femtocell networks. The simulation results demonstrate that the proposed algorithm can improve the throughput of femtocell networks than uniform threshold algorithm.

关键词： Resource allocation relaxation algorithm Femtocell network Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

A SELF-ADAPTIVE ARMIJO-LIKE STEP SIZE METHOD FOR SOLVING MONOTONE VARIATIONAL INEQUALITY PROBLEMS IN HILBERT SPACES

JOURNAL OF NONLINEAR FUNCTIONAL ANALYSIS

引用

JOURNAL OF NONLINEAR FUNCTIONAL ANALYSIS 2019年 2019卷

作者： Tian, Ming Tong, Mengying Civil Aviat Univ China Tianjin Key Lab Adv Signal Proc Tianjin 300300 Peoples R China

In this paper, we study the weak and the strong convergence of a self-adaptive Armijo-like step size method for solving variational inequality problems with monotone and Lipschitz continuous mappings in a real Hilbert space. We combine Tseng's extragradient method with relaxation algorithm and Yamada's algorithm, respectively. It is worth emphasizing that our algorithm do not need to know the Lipschitz constant of the Lipschitz continuous mapping. We also give numerical examples to illustrate our main results.

关键词： Extragradient method Tseng's extragradient method Yamada algorithm relaxation algorithm Self-adaptive Armijo-like step size method

来源：评论

学校读者我要写书评

暂无评论

Joint road toll pricing and capacity development in discrete transport network design problem

引用

TRANSPORTATION 2017年第4期44卷 731-752页

作者： Xu, Meng Wang, Guangmin Grant-Muller, Susan Gao, Ziyou Beijing Jiaotong Univ State Key Lab Rail Traff Control & Safety 3 Shangyuan Residence Beijing 100044 Peoples R China China Univ Geosci Sch Econ & Management Wuhan 430074 Peoples R China Univ Leeds Inst Transport Studies 34-40 Univ Rd Leeds LS2 9JT W Yorkshire England Beijing Jiaotong Univ Sch Traff & Transportat 3 Shangyuan Residence Beijing 100044 Peoples R China

The paper demonstrates a method to determine road network improvements that also involve the use of a road toll charge, taking the perspective of the government or authority. A general discrete network design problem with a road toll pricing scheme, to minimize the total travel time under a budget constraint, is proposed. This approach is taken in order to determine the appropriate level of road toll pricing whilst simultaneously addressing the need for capacity. The proposed approach is formulated as a bi-level programming problem. The optimal road capacity improvement and toll level scheme is investigated with respect to the available budget levels and toll revenues.

关键词： Toll pricing Road development Discrete network design problem (DNDP) Bilevel programming relaxation algorithm

来源：评论

学校读者我要写书评

暂无评论

A relaxation algorithm FOR DECENTRALIZED RESOURCE ALLOCATION IN FEMTOCELL NETWORKS

A RELAXATION ALGORITHM FOR DECENTRALIZED RESOURCE ALLOCATION...

引用

2012 IEEE 2nd International Conference on Cloud Computing and Intelligence Systems

作者： Xiaoyu Wang Yuan'an Liu Gang Xie Panliang Deng School of Electronic Engineering Beijing University of Posts and Telecommunications Key Laboratory of Universal Wireless Communication Ministry of EducationBeijing University of Posts and Telecommunications School of Information and Communication Engineering Beijing University of Posts and Telecommunications

关键词： Resource allocation relaxation algorithm Femtocell network Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

The relaxation normal form of braids is regular

引用

INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION 2017年第1期27卷 61-105页

作者： Juge, Vincent PSL Res Univ Mines ParisTech F-75272 Paris 06 France Univ Paris Diderot Sorbonne Paris Cite CNRS IRIFUMR 8243 F-75205 Paris France Univ Paris Saclay CNRS LSV Paris France Univ Paris Saclay ENS Cachan Paris France

Braids can be represented geometrically as laminations of punctured disks. The geometric complexity of a braid is the minimal complexity of a lamination that represents it, and tight laminations are representatives of minimal complexity. These laminations give rise to a normal form of braids, via a relaxation algorithm. We study here this relaxation algorithm and the associated normal form. We prove that this normal form is regular and prefix-closed. We provide an effective construction of a deterministic automaton that recognizes this normal form.

关键词： Braid group lamination relaxation algorithm regular normal form

来源：评论

学校读者我要写书评

暂无评论

Non-cooperative game theory based energy management systems for energy district in the retail market considering DER uncertainties

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2016年第12期10卷 2999-3009页

作者： Marzband, Mousa Javadi, Masoumeh Luis Dominguez-Garcia, Jose Moghaddam, Maziar Mirhosseini Univ Manchester Sch Elect & Elect Engn Ferranti Bldg Manchester M13 9PL Lancs England Islamic Azad Univ Lahijan Branch Dept Elect Engn Lahijan Iran Islamic Azad Univ Guilan Sci & Res Branch Dept Elect Power Engn Rasht Iran Islamic Azad Univ Rasht Branch Dept Elect Power Engn Rasht Iran Catalonia Inst Energy Res IREC Jardins Dones de Negre 1 Barcelona 08930 Spain

In this study, a general framework for implementing a retail energy market based on the Nikaido-Isoda/relaxation algorithm is proposed as an electricity market structure with large distributed energy resources (DERs) penetration and demand side management of consumers. Moreover, the consumers are able to participate in the market as prosumers (i.e. producer and consumer at the same time). By considering the related uncertainties, the DERs can maximise their expected payoff or profit by undertaking strategies through the price bidding strategy, based on the proposed structure, considering Nash equilibrium. The results show the effectiveness and accuracy of the proposed framework in determining the optimal power set-points of players participating in the market to achieve the objectives.

关键词： energy management systems power markets game theory demand side management profitability pricing share prices noncooperative game theory based energy management systems energy district DER uncertainties distributed energy resources uncertainties retail energy market Nikaido-Isoda algorithm relaxation algorithm electricity market structure distributed energy resources penetration customer demand side management expected payoff maximisation expected profit maximisation price bidding strategy Nash equilibrium optimal power set-point determination

来源：评论

学校读者我要写书评

暂无评论

New relaxation algorithm for Three-dimensional Assignment Problem

New Relaxation Algorithm for Three-dimensional Assignment Pr...

引用

2011 13th IEEE Joint International Computer Science and Information Technology Conference(JICSIT 2011)

作者： Qian Gao School of Information Science and Engineering Ludong University Yantai, China Hailin Zou School of Information Science and Engineering Ludong University Yantai, China Xinming Zhang School of Foreign Languages Ludong University Yantai, China Li Zhou School of Information Science and Engineering Ludong University Yantai, China

The valid solution algorithm for multi-dimensional assignment problem is a difficult point in optimization field. This paper proposes a new relaxation algorithm to solve three- dimensional assignment problem by fusing a certain number of good solutions of 2-dimensional (2-D) assignment problems which are relaxed from 3-D assignment problem. The new algorithm constructs the optimal solution by assigning the solution components with high frequency appearing in the good solutions of 2-D assignment problems according to an order from high to low under feasible constraints. So the calculation complexity is decreased, and the data association accuracy of targets is improved to some extent. Simulation results show that the new algorithm is feasible and effective.

关键词： solution component relaxation algorithm three- dimensional assignment problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：