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

IEEE Information Theory Workshop

作者： Ngai, Chi Kin Yang, Shenghao Chinese Univ Hong Kong Dept Informat Engn Shatin Hong Kong Peoples R China

ISBN: (纸本)9781424415632

In this paper, we propose a deterministic algorithm to construct secure error-correcting (SEC) network codes which can transmit information at rate m - 2d - k to all sink nodes, and prevent the information from eavesdropping and contamination during the transmission, where m is the minimum among the maxflows of all the sinks, d is the maximum network Hamming weight of the error vectors and k is the maximum cardinality of the subset of channels which can be eavesdropped. Such constructed network codes can also achieve the refined Singleton bound. Based on this algorithm we further present two transmission schemes which can achieve the transmission rate m - d, when the adversary satisfies an inaction assumption. We also show that in the presence of feedback, a rate beyond m - d could be possibly achieved without reconstructing the existing network code.

关键词： Network Code Error vector deterministic algorithms Wire tapping Secure information

来源：评论

学校读者我要写书评

暂无评论

Bayes approach to solving TEAM benchmark problems 22 and 25 and its comparison with other optimization techniques

引用

APPLIED MATHEMATICS AND COMPUTATION 2018年 319卷 681-692页

作者： Karban, Pavel Kropik, Petr Kotlan, Vaclav Dolezel, Ivo Univ West Bohemia Plzen Fac Elect Engn Univ 26 Plzen 30614 Czech Republic

The Bayes approach is used for solution of benchmark problems 22 and 25. The main purpose of the paper is to evaluate its applicability for solving complex technical problems (up to now, this technique was only very rarely used in the domain of such tasks). The parameters of this approach are compared with characteristics of several other heuristic and deterministic optimization techniques implemented in commercial code COMSOL Multi-physics and own open-source application Agros Suite. The results confirm that the Bayes approach is superior in a number of aspects and for the solution of real-life tasks it represents a powerful and prospective alternative to existing optimization methods (C) 2017 Elsevier Inc. All rights reserved.

关键词： Bayes optimization Numerical modeling Benchmark Finite element method Heuristic algorithms deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

Capacity of All Nine Models of Channel Output Feedback for the Two-User Interference Channel

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2013年第11期59卷 6957-6979页

作者： Sahai, Achaleshwar Aggarwal, Vaneet Yuksel, Melda Sabharwal, Ashutosh Rice Univ Dept Elect & Comp Engn Houston TX 77005 USA AT&T Labs Res Florham Pk NJ 07932 USA TOBB Univ Econ & Technol TR-06520 Ankara Turkey

In this paper, we study the impact of different channel output feedback architectures on the capacity of the two-user interference channel. For a two-user interference channel, a feedback link can exist between receivers and transmitters in nine canonical architectures (see Fig. 3), ranging from only one feedback link to four feedback links. We derive the exact capacity region for the symmetric deterministic interference channel and the constant-gap capacity region for the symmetric Gaussian interference channel for all of the nine architectures. We show that for a linear deterministic symmetric interference channel, in the weak interference regime, all models of feedback, except the one, which has only one of the receivers feeding back to its own transmitter, have the identical capacity region. When only one of the receivers feeds back to its own transmitter, the capacity region is a strict subset of the capacity region of the rest of the feedback models in the weak interference regime. However, the sum-capacity of all feedback models is identical in the weak interference regime. Moreover, in the strong interference regime, all models of feedback with at least one of the receivers feeding back to its own transmitter have the identical sum-capacity. For the Gaussian interference channel, the results of the linear deterministic model follow, where capacity is replaced with approximate capacity.

关键词： INTERFERENCE channels (Telecommunications) TRANSMITTERS (Communication) deterministic algorithms GAUSSIAN integers RECEIVING antennas CHANNEL coding

来源：评论

学校读者我要写书评

暂无评论

Pebble guided optimal treasure hunt in anonymous graphs

引用

THEORETICAL COMPUTER SCIENCE 2022年 922卷 61-80页

作者： Gorain, Barun Mondal, Kaushik Nayak, Himadri Pandit, Supantha Indian Inst Technol Bhilai Raipur Madhya Pradesh India Indian Inst Technol Ropar Rupnagar Punjab India Indian Inst Informat Technol Bhagalpur India Dhirubhai Ambani Inst Informat & Commun Technol Gandhinagar Gujarat India

We study the problem of treasure hunt in a graph by a mobile agent. The nodes in the graph are anonymous and the edges at any node v of degree deg(v) are labeled arbitrarily as 0, 1,..., deg( v) - 1. A mobile agent, starting from a node, must find a stationary object, called treasurethat is located on an unknown node at a distance Dfrom its initial position. The agent finds the treasure when it reaches the node where the treasure is present. The timeof treasure hunt is defined as the number of edges the agent visits before it finds the treasure. The agent does not have any prior knowledge about the graph or the position of the treasure. An Oracle, that knows the graph, the initial position of the agent, and the position of the treasure, places some pebbles on the nodes, at most one per node, of the graph to guide the agent towards the treasure. We target to answer the question: what is the fastest possible treasure hunt algorithm regardless of the number of pebbles are placed? We show an algorithm that uses O( D log Delta) pebbles to find the treasure in a graph Gin time O( D log Delta), where Delta is the maximum degree of a node in Gand Dis the distance from the initial position of the agent to the treasure. We show a matching lower bound of Omega(D log Delta) on time of the treasure hunt using any number of pebbles. (C) 2022 Elsevier B.V. All rights reserved.

关键词： Treasure hunt Mobile agent Anonymous graph Pebbles deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

Gene lethality detection and characterization via topological analysis of regulatory networks

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2006年第11期53卷 2438-2443页

作者： Alterovitz, Gil Muralidhar, Vinayak Ramoni, Marco F. MIT Hlth Sci & Technol Comp Sci & Artificial Intellig Dept Elect & Comp Engn Boston MA 02115 USA Childrens Hosp Informat Program Boston MA 02115 USA Harvard Univ Harvard Partners Ctr Genet & Genom Boston MA 02115 USA Harvard Univ MIT Div Hlth Sci & Technol Boston MA 02115 USA

Recent engineering approaches to the analysis of biomolecular systems have shown a connection between the topological centrality of a protein in an interaction network and importance of that protein's underlying gene in the survival of the system. The recognized reason for this connection is the scale-free nature of these networks, which induces the presence of highly connected nodes (hubs) in the network. This approach would also be expected to identify these critical genes-called lethal because their removal would kill the cell- in the E. coli transcriptional regulation network, a prototypical scale-free network. However, this method does little better than simple random selection. Here we introduce a new approach, based on random walks, that identifies the critical nodes in the network on the basis of global properties of the network rather than the local connectivity of each node;we show that it significantly outperforms the standard local approach. We also find that lethal genes are more likely to belong to certain functional categories. The success of the our approach suggests that computational lethal gene detection can be effective and that scale free networks-and their biological instances-may enjoy more global properties than the one identified so far.

关键词： algorithms deterministic algorithms genetics graph theory system analysis and design

来源：评论

学校读者我要写书评

暂无评论

DENOVOND: EFFICIENT HARDWARE FOR DISCIPLINED NONDETERMINISM

引用

IEEE MICRO 2014年第3期34卷 138-148页

作者： Sung, Hyojin Komuravelli, Rakesh Adve, Sarita V. Univ Illinois Dept Comp Sci Urbana IL USA

THE DENOVOND SYSTEM PROVIDES EFFICIENT HARDWARE SUPPORT FOR DISCIPLINED NONdeterministic CODES WITH LOCKS WHILE RETAINING THE SIMPLICITY, PERFORMANCE, AND ENERGY BENEFITS PREVIOUSLY ACHIEVED ONLY FOR deterministic CODES. THE AUTHORS DESIGNED AND IMPLEMENTED SIMPLE MEMORY CONSISTENCY SEMANTICS FOR SAFE NONDETERMINISM USING DISTRIBUTED QUEUE-BASED LOCKS AND ACCESS SIGNATURES. THE RESULTING PROTOCOL AVOIDS TRANSIENT STATES, INVALIDATION TRAFFIC, DIRECTORY SHARER-LISTS, AND FALSE SHARING.

关键词： deterministic algorithms Shared Memory Systems De Novo ND Disciplined Shared Memory Programming Model Multicore Memory Hierarchy De Novo Hardware System Lock Synchronization Disciplined Nondeterministic Codes Distributed Queue Based Locks Access Signatures Transient States Invalidation Traffic Directory Sharer Lists False Sharing Software Development Hardware Protocols Research And Development Synchronization Programming Semantics Software Development Hardware Protocols Research And Development Synchronization Programming Semantics Hardware Shared Memory Architecture Multicore Memory Hierarchy Cache Coherence Memory Models Energy Efficiency Disciplined Programming Models

来源：评论

学校读者我要写书评

暂无评论

A scheduling heuristic for maximizing wirebonder throughput

引用

IEEE TRANSACTIONS ON ELECTRONICS PACKAGING MANUFACTURING 2004年第2期27卷 145-150页

作者： Tovia, F Mason, SJ Ramasami, B Univ Arkansas Dept Ind Engn Fayetteville AR 72701 USA Hunt Transport Inc Lowell AR 72745 USA

Process planning and scheduling is an important part of managing the complex dynamic back end (i.e., test, assembly, and packaging) of the semiconductor manufacturing process. One of the most critical toolsets in the back end in terms of manufacturing capacity and product flow is the wirebonders that electrically connect bare silicon die to lead frames via thin metal wires. In this paper, we develop two approaches for maximizing throughput on a group of wirebonders containing three different wirebonder types. Although our mathematical programming approach is capable of producing a near-optimal wirebonder schedule for any production day of interest, the computational requirements of this approach are unacceptable for implementation in a real-world back-end facility. Therefore, we develop a rule-based heuristic approach for wirebonder scheduling capable of producing high-quality schedules in a much shorter period of time.

关键词： deterministic algorithms manufacturing scheduling optimization methods

来源：评论

学校读者我要写书评

暂无评论

High-Quality Fault Resiliency in Fat Trees

引用

IEEE MICRO 2020年第1期40卷 44-49页

作者： Gliksberg, John Capra, Antoine Louvet, Alexandre Javier Garcia, Pedro Sohier, Devan Versailles St Quentin En Yvelines Univ Versailles France Atos Paris France Castilla La Mancha Univ Ciudad Real Spain Atos BXI Projects 2 Paris France Atos Multiple BXI Projects Paris France Castilla La Mancha Univ Comp Architecture & Technol Ciudad Real Spain

Coupling regular topologies with optimized routing algorithms is key in pushing the performance of interconnection networks of supercomputers. In this article, wepresent Dmodc, a fast deterministic routing algorithmfor parallel generalized fat trees (PGFTs), whichminimizes congestion risk even undermassive network degradation caused by equipment failure. Dmodc computes forwarding tables witha closed-formarithmetic formula by relying on a fast preprocessing phase. This allowscomplete rerouting of networks with tens of thousands of nodes in less than a second. In turn, this greatly helps centralized fabric management react to faults with high-quality routing tables and has no impact on running applications in current and future very large scale high-performance computing clusters.

关键词： deterministic algorithms Fault Tolerant Computing Mainframes Minimisation Multiprocessor Interconnection Networks Network Routing Parallel algorithms Parallel Machines Topology Trees Mathematics High Quality Fault Resiliency Coupling Regular Topologies Optimized Routing algorithms Fast deterministic Routing Algorithm Parallel Generalized Fat Trees Massive Network Degradation Equipment Failure Closed Form Arithmetic Formula Fast Preprocessing Phase High Quality Routing Tables Very Large Scale High Performance Computing Clusters Dmodc Algorithm PGFT Interconnection Networks Supercomputers Congestion Risk Minimization Centralized Fabric Management Network Rerouting Routing Protocols Network Topology Degradation Optical Switches Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Subquadratic non-adaptive threshold group testing

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2020年 111卷 42-56页

作者： De Marco, Gianluca Jurdzinski, Tomasz Kowalski, Dariusz R. Rozanski, Michal Stachowiak, Grzegorz Univ Salerno Dipartimento Informat Fisciano Italy Univ Wroclaw Inst Comp Sci Wroclaw Poland Augusta Univ Sch Comp & Cyber Sci Augusta GA USA SWPS Univ Social Sci & Humanities Warsaw Poland

We consider threshold group testing - a generalization of group testing, which asks to identify a set of positive individuals in a population, by performing tests on pools of elements. Each test is represented by a subset Q of individuals and its output is yes if Q contains at least one positive element and no otherwise. Threshold group testing is the natural generalization, introduced by P. Damaschke in 2005, arising when we are given a threshold t>0 and the answer to a test Q is yes if Q contains at least t positives and no otherwise. We give upper and lower bounds for this general problem, showing a complexity separation with the classical group testing. Next, we introduce a further generalization in which the goal is minimizing not only the number of tests, but also the number of thresholds which is related to the accuracy of the tests. (C) 2020 Elsevier Inc. All rights reserved.

关键词： Group testing Threshold group testing Non-adaptive strategies Probabilistic method deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

Tradeoffs between cost and information for rendezvous and treasure hunt

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2015年 83卷 159-167页

作者： Miller, Avery Pelc, Andrzej Univ Quebec Outaouais Outaouais PQ Canada

In rendezvous, two agents traverse network edges in synchronous rounds and have to meet at some node. In treasure hunt, a single agent has to find a stationary target situated at an unknown node of the network. We study tradeoffs between the amount of information (advice) available a priori to the agents and the cost (number of edge traversals) of rendezvous and treasure hunt. Our goal is to find the smallest size of advice which enables the agents to solve these tasks at some cost C in a network with e edges. This size turns out to depend on the initial distance D and on the ratio e/C, which is the relative cost gain due to advice. For arbitrary graphs, we give upper and lower bounds of O(D log(D.e/C) +log log e) and Omega (D log e/C), respectively, on the optimal size of advice. For the class of trees, we give nearly tight upper and lower bounds of O(D log e/C + log log e) and Omega (D log e/C), respectively. (C) 2015 Elsevier Inc. All rights reserved.

关键词： Rendezvous Treasure hunt Advice deterministic algorithms Mobile agents Cost

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：