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

international conference on Network Protocols

作者： Qianchen Yuan Fuliang Li Tian Pan Yuhua Lai Yetao Gu Xingwei Wang Northeastern University Shenyang China Beijing University of Posts and Telecommunications Beijing China

ISBN: (数字)9781665482349

ISBN: (纸本)9781665482356

In-band network telemetry (INT) enables hop-by-hop fine-grained network monitoring without interacting with the controller at every hop. Existing INT-based network-wide telemetry systems achieve low-overhead monitoring with the non-overlapped path planning algorithms. However, they do not bound the length of the generated probing paths, which may lead to packet loss when the collected telemetry data exceeds the MTU limit. In this paper, we propose an MTU-adaptive path segmentation algorithm to solve this problem. First, we provide two single-path planning algorithms: the INT-optimize algorithm produces a single path that covers the entire network with the lowest southbound communication overhead, and the INT-low-cost algorithm further improves the path planning efficiency of the INT-optimize. By taking the MTU limit into account, we further propose INT-Segment, a novel path segmentation algorithm to split the single long path produced from the previous step into multiple path segments. Extensive evaluations show that the proposed INT-Segment can realize sub-second network-wide telemetry for large-scale networks. It takes less than 2.9ms to calculate the probing paths for an 18-pod FatTree. Compared with the state-of-the-art INT-path, our solution makes the probing path well adapted to the network MTU limit and improves the telemetry efficiency by 10%-94%.

关键词： Data centers Protocols Packet loss Data collection Path planning Planning Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Strengthening potential heuristics with mutexes and disambiguations 30

Strengthening potential heuristics with mutexes and disambig...

引用

30th international conference on Automated Planning and Scheduling, ICAPS 2020

作者： Fišer, Daniel Horcík, Rostislav Komenda, Antonín Czech Technical University in Prague Faculty of Electrical Engineering Prague Czech Republic

Potential heuristics assign a numerical value (potential) to each fact and compute the heuristic value for a given state as the sum of these potentials. A mutex is an invariant stating that a certain combination of facts cannot be part of any reachable state. In this paper, we use mutexes to improve potential heuristics in two ways. First, we show that the mutex-based disambiguations of the goal and preconditions of operators leads to a less constrained linear program yielding stronger heuristics. Second, we utilize mutexes in a construction of new optimization functions based on counting of the number of states containing certain sets of facts. the experimental evaluation shows a significant increase in the number of solved tasks. Copyright © 2020, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

Is LoRaWAN Really Wide? Fine-grained LoRa Link-level Measurement in An Urban Environment

Is LoRaWAN Really Wide? Fine-grained LoRa Link-level Measure...

引用

international conference on Network Protocols

作者： Yidong Ren Li Liu Chenning Li Zhichao Cao Shigang Chen Michigan State University University of Florida

ISBN: (数字)9781665482349

ISBN: (纸本)9781665482356

Internet-of-things (IoT) aims to connect billions of low-date rate and energy-constrained end-devices in the near future. Although many IoT systems have been commercialized, most of them focus on home and body scale applications. To establish a low-cost IoT at the city scale, LoRa Wide Area Networks (LoRaWAN) have become attractive in recent years due to their desirable kilometer or even longer communication distance with low energy consumption. However, due to the expensive cost of densely deploying end-nodes, the understanding of LoRa link behavior is still coarse-grained, and hard to fully realize the link dynamics, networking coverage, and localization accuracy of LoRaWAN in an urban environment. this paper shows a fine-grained LoRa link-level measurement via mobile end-nodes. We deploy two gateways and six mobile end-nodes and collect data packets over four months at a $6\times 6\ km^{2}$ urban area. the evaluation mainly focuses on answering three questions: 1) Does a LoRa link stably perform in both spatial and temporal dimensions? 2) How large area can be covered for reliable communication by each gateway in the urban environment? 3) What accuracy can be achieved to localize an end-node through LoRa links? According to our measurement, our key findings are 1) the spatial and temporal behavior of LoRa links is quite dynamic due to the different types of land covers and the frequent micro-environment changes in the urban areas; 2) Each gateway can cover about 11.3 km 2 area and marginal SNR gains (e.g., 2 dB) of LoRa links are efficient enough to enlarge 32.6% coverage area of a gateway; and 3). the median localization error is about 400 m. Without densely deployed LoRa gateways, the SOTA LoRa localization can support road-level localization, even when an end node is close to one of the gateways.

关键词： Location awareness Wide area networks Protocols Urban areas logic gates Gain measurement Behavioral sciences

来源：评论

学校读者我要写书评

暂无评论

Comparison between PID and Sliding Mode Controllers for Rotary Inverted Pendulum Using PLC 4

Comparison between PID and Sliding Mode Controllers for Rota...

引用

4th international conference on Automation, Control and Robots (ICACR)

作者： Howimanporn, Suppachai Chookaew, Sasithorn Silawatchananai, Chaiyaporn King Mongkuts Univ Technol North Bangkok Fac Tech Educ Dept Teacher Training Mech Engn Bangkok Thailand

ISBN: (纸本)9781728192079

this research proposes the balancing control of the rotary inverted pendulum (RIP) by using PLC. the platform was designed and developed for PLC training kit, in order to enhance the learning a nonlinear control for stabilization problem. By using ST programming language, a modern PLC is capable to implement a robust control handling with complex task. In this work, OMRON PLC model CP1L-M30DTD which providing high-speed counter and high speed pulse output was used as main controller to provide real-time control. To compare the performance of stabilizing RIP, two controllers: PID and SMC control were designed and implemented in PLC. the optimal gain of PID controller was tuned by Ziegler Nichols first method, while SMC controller was designed based on system dynamic model. the conducted experiment result shows that the balancing performance was improved by SMC controller for 54.30%, even though PID controller provided lower oscillation result. the propose of SMC controller is to deal with an uncertainty in nonlinear system, while PID controller is to reduce the tracking error.

关键词： rotary inverted pendulum programmable logic controller PID sliding mode control

来源：评论

学校读者我要写书评

暂无评论

Editorial: 29th international conference on logic programming special issue (vol 13, pg 465, 2013)

引用

thEORY AND PRACTICE OF logic programming 2018年第1期18卷 121-121页

作者： Lamma, Evelina Swift, Terrance

the links to the online only Technical Communications in Lamma and Swift (2013) are unfortunately broken. All of the Technical Communications can be found here: https://***/core/journals/theory-and-practice-of-logic-programming/article/editorial-29th-international-conference-on-logic-programming-special-issue/82FDD81073DC30A563ED242516CADAAE#fndtn-supplementary-materials

关键词：

来源：评论

学校读者我要写书评

暂无评论

PDDLStream: Integrating symbolic planners and blackbox samplers via optimistic adaptive planning 30

PDDLStream: Integrating symbolic planners and blackbox sampl...

引用

30th international conference on Automated Planning and Scheduling, ICAPS 2020

作者： Garrett, Caelan Reed Lozano-Pérez, Tomás Kaelbling, Leslie Pack Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology United States

Many planning applications involve complex relationships defined on high-dimensional, continuous variables. For example, robotic manipulation requires planning with kinematic, collision, visibility, and motion constraints involving robot configurations, object poses, and robot trajectories. these constraints typically require specialized procedures to sample satisfying values. We extend PDDL to support a generic, declarative specification for these procedures that treats their implementation as black boxes. We provide domain-independent algorithms that reduce PDDLStream problems to a sequence of finite PDDL problems. We also introduce an algorithm that dynamically balances exploring new candidate plans and exploiting existing ones. this enables the algorithm to greedily search the space of parameter bindings to more quickly solve tightly-constrained problems as well as locally optimize to produce low-cost solutions. We evaluate our algorithms on three simulated robotic planning domains as well as several real-world robotic tasks. Copyright © 2020, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Robot programming

来源：评论

学校读者我要写书评

暂无评论

Efficient robot planning for achieving multiple independent partially observable tasks that evolve over time 30

Efficient robot planning for achieving multiple independent ...

引用

30th international conference on Automated Planning and Scheduling, ICAPS 2020

作者： Mohseni-Kabir, Anahita Veloso, Manuela Likhachev, Maxim School of Computer Science Carnegie Mellon University United States

We focus on domains where a robot is required to accomplish a set of tasks that are partially observable and evolve independently of each other according to their dynamics. An example domain is a restaurant setting where a robot waiter should take care of an ongoing stream of tasks, namely serving a number of tables, including delivering food to the tables and checking on customers. An action that the robot should take next at any point of time typically depends on the duration of possible actions, the state of each table, and how these tables evolve over time, e.g., the food becomes cold after a few time steps. As most of these domains are dynamic and tasks are frequently being added and removed, the robot typically needs to plan for a short h-step horizon to quickly decide on the next action and replans at each time step. A conventional approach to deal with this problem is to combine all the tasks' states and robot actions into one large model and to compute an h-step optimal policy for this combined model. For the problems that we are interested in, the number of tasks, e.g., the number of tables in the restaurant domain, can be large making this planning approach computationally impractical. the observation that we make however is that in many domains the number of tasks that the robot can accomplish within h-steps is very limited. We present an algorithm that exploits this observation and decomposes the problem into a series of much smaller planning problems, the solution to which gives us an optimal solution. We demonstrate the efficiency of our algorithm on the restaurant domain. Copyright © 2020, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Robot programming

来源：评论

学校读者我要写书评

暂无评论

Parallel Stateful logic in RRAM: theoretical Analysis and Arithmetic Design 30

Parallel Stateful Logic in RRAM: Theoretical Analysis and Ar...

引用

30th IEEE international conference on Application-Specific Systems, Architectures and Processors (ASAP)

作者： Wang, Feng Luo, Guojie Sun, Guangyu Zhang, Jiaxi Huang, Peng Kang, Jinfeng Peking Univ Ctr Energy Efficient Comp & Applicat Beijing Peoples R China Peking Univ Inst Microelect Beijing Peoples R China

ISBN: (纸本)9781728116013

Processing-in-memory (PIM) provides massive parallelism with high energy efficiency and becomes a promising solution to the "memory wall" problem. Recently, the emerging metal-oxide resistive random access memory (RRAM) has shown its potential to design a PIM architecture. Several stateful logic operations, e.g., NOR and NAND, can be executed in parallel in an RRAM crossbar. Although previous works have designed some algorithms using the stateful logic, it is still under exploration how to fully exploit its potential high parallelism and design an asymptotically fast algorithm for a given function. In this work, we theoretically analyze the parallelism in an RRAM crossbar and design several asymptotically optimal arithmetic algorithms. In detail, we first propose the Single Instruction Multiple Lines (SIML) model to unify the stateful logic families and prove three lower bounds on the time complexity of a parallel RRAM algorithm. then, we design three algorithms for integer addition functions with the stateful logic, guided by the lower bound analysis. All of them reach the time complexity lower bound. Finally, We make two extensions of the integer addition algorithms, supporting multiplication functions by decomposing them to additions and supporting the flex-point data type by proposing an exponent and mantissa update flow. Experimental evaluation shows that our integer algorithms achieves a speedup up to 13.79x over the previous RRAM algorithms. Our flex-point implementation achieves a 26.60x speedup and saves 73.68% energy compared to an ARM.

关键词： Time complexity Computer architecture Parallel processing Computational modeling Resistance Switches Random access memory

来源：评论

学校读者我要写书评

暂无评论

30th international conference on Computer Aided Verification, CAV 2018 Held as Part of the Federated logic conference, FloC 2018

30th International Conference on Computer Aided Verification...

引用

30th international conference on Computer Aided Verification, CAV 2018 Held as Part of the Federated logic conference, FloC 2018

ISBN: (纸本)9783319961446

the proceedings contain 70 papers. the special focus in this conference is on Computer Aided Verification. the topics include: Eager abstraction for symbolic model checking;fast numerical program analysis with reinforcement learning;A direct encoding for NNC polyhedra;what’s hard about boolean functional synthesis?;counterexample guided inductive synthesis modulo theories;synthesizing reactive systems from hyperproperties;reactive control improvisation;constraint-based synthesis of coupling proofs;controller Synthesis Made Real: Reach-Avoid Specifications and Linear Dynamics;from programs to interpretable deep models and back;synthesis of asynchronous reactive programs from temporal specifications;syntax-guided synthesis with quantitative syntactic objectives;learning abstractions for program synthesis;the learnability of symbolic automata;reachable set over-approximation for nonlinear systems using piecewise barrier tubes;space-time interpolants;monitoring weak consistency;Monitoring CTMCs by multi-clock timed automata;start pruning when time gets urgent: Partial order reduction for timed systems;A counting semantics for monitoring LTL specifications over finite traces;formal reasoning about the security of amazon web services;Rabinizer 4: From LTL to your favourite deterministic automaton;strix: Explicit reactive synthesis strikes back!;Btor2, btorMC and boolector 3.0;nagini: A static verifier for python;peregrine: A tool for the analysis of population protocols;ADAC: Automated design of approximate circuits;value iteration for simple stochastic games: stopping criterion and learning algorithm;sound value iteration;safety-aware apprenticeship learning;deciding probabilistic bisimilarity distance one for labelled markov chains;foundations and tools for the static analysis of ethereum smart contracts;layered concurrent programs;propositional dynamic logic for higher-order functional programs;syntax-guided termination analysis.

关键词：

来源：评论

学校读者我要写书评

暂无评论

30th international conference on Computer Aided Verification, CAV 2018 Held as Part of the Federated logic conference, FloC 2018

30th International Conference on Computer Aided Verification...

引用

30th international conference on Computer Aided Verification, CAV 2018 Held as Part of the Federated logic conference, FloC 2018

ISBN: (纸本)9783319961415

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：