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

International Conference on Application and Innovation in Mobile Computing (AIMoC)

作者： Roy, Sarbani Mukherjee, Nandini Jadavpur Univ Dept Comp Sci & Engn Kolkata India

ISBN: (纸本)9781479938803

In wireless sensor networks (WSNs) localization systems are required to provide position information of sensor nodes. Location information of sensor nodes with unknown physical coordinates is acquired with the help of beacons or anchors. Beacon placement is one of the prominent factors that shape the localization performance in sensor networks. Placing more beacons in a network is generally not a cost-effective idea. However, a carefully designed technique can increase the accuracy by placing a limited number of beacons. This paper presents an integer linear programming(ILP) formulation of optimal beacon placement (OBP) and also prove that the OBP problem is NP-hard. Requirement based beacon placement algorithm is proposed to optimize number of beacons to cover the entire WSN. Simulation result shows that the proposed beacon placement scheme is effective in a sensor network with high node density.

关键词： integer programming linear programming sensor placement wireless sensor networks WSN integer linear programming formulation localization performance localization systems location information optimal beacon placement problem position information sensor nodes unknown physical coordinates wireless sensor networks Bismuth Optimization Shape Tin Topology Wireless communication Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Computational complexity of three-dimensional discrete tomography with missing data

引用

JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS 2021年第3期38卷 823-858页

作者： Kimura, Kei Kamehashi, Takuya Saitama Univ Grad Sch Sci & Engn Saitama 3388570 Japan Virtualex Consulting Inc Tokyo 1050001 Japan

Discrete tomography deals with problems of determining shape of a discrete object from a set of projections. In this paper, we deal with a fundamental problem in discreet tomography: reconstructing a discrete object in R-3 from its orthogonal projections, which we call three-dimensional discrete tomography. This problem has been mostly studied under the assumption that complete data of the projections are available. However, in practice, there might be missing data in the projections, which come from, e.g., the lack of precision in the measurements. In this paper, we consider the three-dimensional discrete tomography with missing data. Specifically, we consider the following three fundamental problems in discrete tomography: the consistency, counting, and uniqueness problems, and classify the computational complexities of these problems in terms of the length of one dimension. We also generalize these results to higher-dimensional discrete tomography, which has applications in operations research and statistics.

关键词： Discrete tomography Computational complexity Contingency tables integer linear programming formulation

来源：评论

学校读者我要写书评

暂无评论

Efficient formulations for the traveling car renter problem and its quota variant

引用

OPTIMIZATION LETTERS 2021年第6期15卷 1905-1930页

作者： Lacroix, Mathieu Rios-Solis, Yasmin A. Calvo, Roberto Wolfler Univ Sorbonne Paris Nord CNRS UMR 7030 LIPN F-93430 Villetaneuse France Tecnol Monterrey Escuela Ingn & Ciencias Monterrey Mexico Univ Cagliari Dept Math & Comp Sci Cagliari Italy

In this paper, we study the recently introduced Traveling Car Renter Problem. This latter is a generalization of the well-known traveling salesman problem, where a solution is a set of paths of different colors as well as an orientation of each path in such a way that the union forms a directed Hamiltonian circuit. Considering costs associated with all edges and all ordered pairs of nodes for each color, the cost of a solution is the sum of the costs of its colored oriented paths, the cost of these later being the sum of the edge costs plus the costs of the arcs from their destination to their origin. We also consider the Quota version of this problem where a weight is associated with every node and the circuit formed by a solution may not be Hamiltonian but must cover a subset of nodes whose sum of weights should be greater than or equal to a fixed value. We propose integer linear programming formulations for these problems. We also propose some valid inequalities for strengthening the models and we devise branch-and-cut algorithms for solving these formulations. The computational results show the efficiency of our formulations as we solve to optimality almost all the instances of the literature, and outperform by an order of magnitude all published approaches.

关键词： Vehicle routing Traveling salesman problem integer linear programming formulation Branch-and-cut

来源：评论

学校读者我要写书评

暂无评论

Design optimisation of cyber-physical distributed systems using IEEE time-sensitive networksInspec keywordsOther keywords

引用

IET CYBER-PHYSICAL SYSTEMS: THEORY & APPLICATIONS 2016年第1期1卷 86-94页

作者： Pop, Paul Raagaard, Michael Lander Craciunas, Silviu S. Steiner, Wilfried Tech Univ Denmark Lyngby Denmark TTTech Comp Tech AG Vienna Austria

In this study the authors are interested in safety-critical real-time applications implemented on distributed architectures supporting the time-sensitive networking (TSN) standard. The on-going standardisation of TSN is an IEEE effort to bring deterministic real-time capabilities into the IEEE 802.1 Ethernet standard supporting safety-critical systems and guaranteed quality-of-service. TSN will support time-triggered (TT) communication based on schedule tables, audio-video-bridging (AVB) flows with bounded end-to-end latency as well as best-effort messages. The authors first present a survey of research related to the optimisation of distributed cyber-physical systems using real-time Ethernet for communication. Then, the authors formulate two novel optimisation problems related to the scheduling and routing of TT and AVB traffic in TSN. Thus, the authors consider that they know the topology of the network as well as the set of TT and AVB flows. The authors are interested to determine the routing of both TT and AVB flows as well as the scheduling of the TT flows such that all frames are schedulable and the AVB worst-case end-to-end delay is minimised. The authors have proposed an integer linear programming formulation for the scheduling problem and a greedy randomised adaptive search procedure-based heuristic for the routing problem. The proposed approaches have been evaluated using several test cases.

关键词： wireless LAN telecommunication traffic telecommunication network routing telecommunication scheduling safety systems standardisation quality of service cyber-physical systems telecommunication network topology integer programming linear programming search problems greedy algorithms IEEE time-sensitive networks design optimisation safety-critical real-time applications distributed architectures time-sensitive networking standard TSN standard IEEE 802 1 Ethernet standard quality-of-service time-triggered communication schedule tables audio-video-bridging bounded end-to-end latency distributed cyber-physical systems optimisation problems TT routing problem AVB traffic AVB worst-case end-to-end delay integer linear programming formulation greedy randomised adaptive search procedure-based heuristic network topology

来源：评论

学校读者我要写书评

暂无评论

CIDANE: comprehensive isoform discovery and abundance estimation

引用

GENOME BIOLOGY 2016年第1期17卷 16-16页

作者： Canzar, Stefan Andreotti, Sandro Weese, David Reinert, Knut Klau, Gunnar W. Johns Hopkins Univ Sch Med McKusick Nathans Inst Genet Med Ctr Computat Biol Baltimore MD 21205 USA Free Univ Berlin Inst Comp Sci Dept Math & Comp Sci Arnimallee 14 D-14195 Berlin Germany CWI Life Sci Sci Pk 123 NL-1098 XG Amsterdam Netherlands Toyota Technol Inst Chicago 6045 S Kennwood Ave Chicago IL 60637 USA

We present CIDANE, a novel framework for genome-based transcript reconstruction and quantification from RNA-seq reads. CIDANE assembles transcripts efficiently with significantly higher sensitivity and precision than existing tools. Its algorithmic core not only reconstructs transcripts ab initio, but also allows the use of the growing annotation of known splice sites, transcription start and end sites, or full-length transcripts, which are available for most model organisms. CIDANE supports the integrated analysis of RNA-seq and additional gene-boundary data and recovers splice junctions that are invisible to other methods. CIDANE is available at http://***/software/cidane/.

关键词： Splice Junction Read Alignment integer linear programming formulation Annotate Transcript Partial Annotation

来源：评论

学校读者我要写书评

暂无评论

Using Guided Local Search for Adaptive Resource Reservation in Large-scale Embedded Systems

Using Guided Local Search for Adaptive Resource Reservation ...

引用

Design, Automation and Test in Europe Conference and Exhibition (DATE)

作者： ter Braak, Timon D. Univ Twente Dept Elect Engn Math & Comp Sci NL-7500 AE Enschede Netherlands

ISBN: (纸本)9783981537024

To maintain a predictable execution environment, an embedded system must ensure that applications are, in advance, provided with sufficient resources to process tasks, exchange information and to control peripherals. The problem of assigning tasks to processing elements with limited resources, and routing communication channels through a capacitated interconnect is combined into an integer linear programming formulation. We describe a guided local search algorithm to solve this problem at run-time. This algorithm allows for a hybrid strategy where configurations computed at design-time may be used as references to lower the computational overhead at runtime. Computational experiments on a dataset with 100 tasks and 20 processing elements show the effectiveness of this algorithm compared to state-of-the-art solvers CPLEX and Gurobi. The guided local search algorithm finds an initial solution within 100 milliseconds, is competitive for small platforms, scales better with the size of the platform, and has lower memory usage (2-19%).

关键词： electronic engineering computing embedded systems integer programming linear programming network routing CPLEX Gurobi adaptive resource reservation capacitated interconnect computational overhead guided local search hybrid strategy integer linear programming formulation large-scale embedded systems routing communication channels Algorithm design and analysis Communication channels Cost function Embedded systems Routing Search problems Vectors

来源：评论

学校读者我要写书评

暂无评论

Energy-efficiency of all-optical transport through time-driven switching

引用

IET OPTOELECTRONICS 2012年第4期6卷 173-182页

作者： Musumeci, F. Tornatore, M. Fontana, G. Riunno, M. Bregni, S. Pattavina, A. Politecn Milan Dept Elect & Informat I-20133 Milan Italy Univ Trento Fac Sci I-38050 Povo TN Italy Fastweb SpA I-20155 Milan Italy

Decreasing the Internet power consumption is a challenging issue. Optical transport networks employing the wavelength division multiplexing (WDM) technique have been identified as energy efficient solutions to face this issue, considering the expected high increase of Internet traffic. The authors study the energy efficiency of a recently-proposed switching technique for transport networks, the time-driven-switching (TDS), in which time-coordination of network elements is exploited to achieve 'sub-lambda' granularity in optical signal switching directly in the optical domain. In order to achieve the fast switching time required by TDS, semi-conductor optical amplifier-based optical switches are exploited. The authors discuss the properties, in terms of the energy efficiency, of a TDS transport network, focusing on the energy requirements of the TDS optical switches. The authors provide a qualitative description of the main contributors to energy consumption in a TDS network. The authors then develop an integer linear programming formulation, in which the physical impairments impact over optical signals is also considered. Power consumption over realistic case study networks for the TDS case is compared to the power consumption for the classical IP over WDM architecture, and in some cases TDS is demonstrated to save more than 55% of power consumption with respect to competing architectures.

关键词： Communication switching IP over WDM architecture optical signal switching time-driven switching energy consumption Optimisation techniques semiconductor optical amplifier-based optical switches linear programming telecommunication switching sub-lambda granularity semiconductor optical amplifiers qualitative description integer linear programming formulation TDS optical switches energy conservation energy efficiency Semiconductor lasers physical impairments optical fibre networks switching technique Internet power consumption wavelength division multiplexing power consumption optical domain optical signals optical switches energy-efficiency energy efficient solutions competing architectures Internet integer programming wavelength division multiplexing technique TDS network WDM technique realistic case study networks Multiplexing and switching in optical communication network elements time-coordination TDS transport network energy requirements switching time Internet traffic Optical fibre networks time-driven-switching telecommunication traffic optical transport networks all-optical transport

来源：评论

学校读者我要写书评

暂无评论

An ILP solution for the gene duplication problem

引用

BMC BIOINFORMATICS 2011年第1期12卷 1-8页

作者： Chang, Wen-Chieh Burleigh, Gordon J. Fernandez-Baca, David F. Eulenstein, Oliver Iowa State Univ Dept Comp Sci Ames IA 50011 USA Univ Florida Dept Biol Gainesville FL 32611 USA

Background: The gene duplication (GD) problem seeks a species tree that implies the fewest gene duplication events across a given collection of gene trees. Solving this problem makes it possible to use large gene families with complex histories of duplication and loss to infer phylogenetic trees. However, the GD problem is NP-hard, and therefore, most analyses use heuristics that lack any performance guarantee. Results: We describe the first integer linear programming (ILP) formulation to solve instances of the gene duplication problem exactly. With simulations, we demonstrate that the ILP solution can solve problem instances with up to 14 taxa. Furthermore, we apply the new ILP solution to solve the gene duplication problem for the seed plant phylogeny using a 12-taxon, 6, 084-gene data set. The unique, optimal solution, which places Gnetales sister to the conifers, represents a new, large-scale genomic perspective on one of the most puzzling questions in plant systematics. Conclusions: Although the GD problem is NP-hard, our novel ILP solution for it can solve instances with data sets consisting of as many as 14 taxa and 1, 000 genes in a few hours. These are the largest instances that have been solved to optimally to date. Thus, this work can provide large-scale genomic perspectives on phylogenetic questions that previously could only be addressed by heuristic estimates.

关键词： Species Tree Gene Tree integer linear programming integer linear programming formulation Deep Coalescence

来源：评论

学校读者我要写书评

暂无评论

Layout Decomposition for Triple Patterning Lithography

Layout Decomposition for Triple Patterning Lithography

引用

IEEE/ACM International Conference on Computer-Aided Design (ICCAD)

作者： Yu, Bei Yuan, Kun Zhang, Boyang Ding, Duo Pan, David Z. Univ Texas Austin ECE Dept Austin TX 78712 USA Facebook Inc Menlo Pk CA 94025 USA Oracle Corp Austin TX 78727 USA

ISBN: (纸本)9781457713989

As minimum feature size and pitch spacing further decrease, triple patterning lithography (TPL) is a possible 193nm extension along the paradigm of double patterning lithography (DPL). However, there is very little study on TPL layout decomposition. In this paper, we show that TPL layout decomposition is a more difficult problem than that for DPL. We then propose a general integer linear programming formulation for TPL layout decomposition which can simultaneously minimize conflict and stitch numbers. Since ILP has very poor scalability, we propose three acceleration techniques without sacrificing solution quality: independent component computation, layout graph simplification, and bridge computation. For very dense layouts, even with these speedup techniques, ILP formulation may still be too slow. Therefore, we propose a novel vector programming formulation for TPL decomposition, and solve it through effective semidefinite programming (SDP) approximation. Experimental results show that the ILP with acceleration techniques can reduce 82% runtime compared to the baseline ILP. Using SDP based algorithm, the runtime can be further reduced by 42% with some tradeoff in the stitch number (reduced by 7%) and the conflict (9% more). However, for very dense layouts, SDP based algorithm can achieve 140x speed-up even compared with accelerated ILP.

关键词： Acceleration Bridges Color DPL ILP formulation Layout programming Shape TPL Vectors approximation theory bridge computation double patterning lithography integer linear programming formulation integer programming layout decomposition layout graph simplifi

来源：评论

学校读者我要写书评

暂无评论

Indoor Wireless Planning using Smart Antennas

Indoor Wireless Planning using Smart Antennas

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Abbasi, Ali Ghaderi, Majid Univ Calgary Dept Comp Sci Calgary AB T2N 1N4 Canada

ISBN: (纸本)9781424492688

This paper considers the problem of indoor wireless planning using smart antennas. Smart antennas have gained much attention in wireless networking because of their capability in providing more spatial reuse and increased network capacity. Recent research has demonstrated their effectiveness in indoor environments where omni-directional antennas have been traditionally the dominant technology. Much of the work, however, assumes that a network is already deployed and focuses on scheduling antenna patterns. In this work, we investigate finding a wireless plan for an indoor environment where the wireless plan specifies minimum number of antennas required to provide complete coverage of the environment as well as the location, transmission power and beam pattern for each antenna. This problem is more challenging than radio planning using omnidirectional antennas because of the special shape of antenna beams. Both single-beam and multi-beam antenna patterns are considered and integer linear programming formulations are provided for computing the minimum cost wireless plan. Moreover, to solve large-scale instances of the problem an efficient polynomial-time heuristic is proposed.

关键词： Directive antennas Interference Planning Signal to noise ratio Transmitting antennas Wireless communication antenna pattern scheduling indoor wireless planning integer linear programming formulation integer programming linear programming multibeam antenna pattern network capacity omnidirectional antenna omnidirectional antennas polynomial-time heuristic polynomials radio networks radio planning scheduling singlebeam antenna pattern smart antenna telecommunication network planning transmission power wireless networking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：