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

Designing Skid-Trail networks to Reduce Skidding Cost and Soil Disturbance for Ground-Based Timber Harvesting Operations

引用

FOREST SCIENCE 2016年第1期62卷 48-58页

作者： Contreras, Marco A. Parrott, David L. Chung, Woodam Univ Kentucky Dept Forestry Lexington KY 40546 USA Univ Kentucky Lexington KY 40506 USA Oregon State Univ Corvallis OR 97331 USA

Skid-trail locations directly influence the economics and environmental impacts of harvesting operations. Typically, field managers design skid-trail networks manually based on field observations of vegetation and terrain conditions. We designed a model to automatically design skid-trail networks to reduce skidding costs and soil disturbances. The model simulates tree-bunch locations, creates a feasible skid-trail network across the harvest unit, estimates skidding cost and soil recovery cost for each feasible skid-trail segment, and finds the network design that connects each tree bunch to landings while reducing skidding and soil recovery costs. The model was applied to a 24-ha hypothetical harvest unit to test its ability to design optimal networks under different scenarios representing conditions commonly found in timber harvesting operations (e.g., skidding pattern, uneven volume distribution, skidding obstacles, and different weights given to skidding and soil recovery costs). It was also applied to an actual 124-ha harvest unit to evaluate its ability to design skid-trail networks considering more realistic conditions with multiple design factors. The model successfully created optimized skid-trail networks for all scenarios considered, and results suggest that it provides a useful tool to help forest engineers and field managers design economically efficient and environmentally sound ground-based timber harvesting operations.

关键词： forest operations planning shortest path algorithm forest optimization network programming

来源：评论

学校读者我要写书评

暂无评论

A feasibility evaluation approach for time-evolving multi-item production-distribution networks

引用

OPTIMIZATION METHODS & SOFTWARE 2016年第3期31卷 562-576页

作者： Hosseini, S. Ahmad Wadbro, Eddie Umea Univ Dept Math & Math Stat SE-90187 Umea Sweden Umea Univ Dept Comp Sci SE-90187 Umea Sweden

Time-dependent multi-item problems arise frequently in management applications, communication systems, and production-distribution systems. Our problem belongs to the last category, where we wish to address the feasibility of such systems when all network parameters change over time and product. The objective is to determine whether it is possible to have a dynamic production-shipment circuit within a finite planning horizon. And, if there is no such a flow, the goal is to determine where and when the infeasibility occurs and the approximate magnitude of the infeasibility. This information may help the decision maker in their efforts to resolve the infeasibility of the system. The problem in the discrete-time settings is investigated and a hybrid of scaling approach and penalty function method together with network optimality condition is utilized to develop a network-based algorithm. This algorithm is analysed from theoretical and practical perspectives by means of instances corresponding to some electricity transmission-distribution networks and many random instances. Computational results illustrate the performance of the algorithm.

关键词： mathematical programming nonlinear optimization network programming approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

Cyber-Physical Systems: Foundations, Principles and Applications

引用

丛书名： Intelligent Data-Centric Systems: Sensor Collected Intelligence

2016年

作者： Houbing Song, Danda B. Rawat, Sabina Jeschke and Christian Brecher

ISBN: (数字)9780128038741

ISBN: (纸本)9780128038017

Cyber-Physical Systems: Foundations, Principles and Applications explores the core system science perspective needed to design and build complex cyber-physical systems. Using Systems Science underlying theories, such as probability theory, decision theory, game theory, organizational sociology, behavioral economics, and cognitive psychology, the book addresses foundational issues central across CPS applications, including System Design -- How to design CPS to be safe, secure, and resilient in rapidly evolving environments, System Verification -- How to develop effective metrics and methods to verify and certify large and complex CPS, Real-time Control and Adaptation -- How to achieve real-time dynamic control and behavior adaptation in a diverse environments, such as clouds and in network-challenged spaces, Manufacturing -- How to harness communication, computation, and control for developing new products, reducing product concepts to realizable designs, and producing integrated software-hardware systems at a pace far exceeding today's timeline. The book is part of the Intelligent Data-Centric Systems: Sensor-Collected Intelligence series edited by Fatos Xhafa, Technical University of Catalonia. Indexing: The books of this series are submitted to EI-Compendex and SCOPUSIncludes in-depth coverage of the latest models and theories that unify perspectives, expressing the interacting dynamics of the computational and physical components of a system in a dynamic environmentFocuses on new design, analysis, and verification tools that embody the scientific principles of CPS and incorporate measurement, dynamics, and controlCovers applications in numerous sectors, including agriculture, energy, transportation, building design and automation, healthcare, and manufacturing

关键词： network programming

来源：评论

学校读者我要写书评

暂无评论

Sgi :: Iris4D :: 007-0810-010 network Communications Guide V1.0 Nov 1990

引用

2016年

Sgi :: Iris4D :: 007-0810-010 network Communications Guide V1.0 Nov 1990 by published by

关键词： communications communications guide data guide guide irix host iris4d irix network network communications network programming port number remote remote procedure routine returns rpc rpc programming server struct version xdr xdr programming xdr stream

来源：评论

学校读者我要写书评

暂无评论

Mobile sensor network programming system

引用

WIRELESS networkS 2010年第4期16卷 1175-1187页

作者： Zheng, Xiao Sarikaya, Behcet MP Lighting Vancouver BC Canada Univ Montreal Dept IRO Montreal PQ H3C 3J7 Canada

Sensors carried by moving objects in the cities can be used in various applications such as environmental monitoring, traffic control and recreational purposes. A mobile sensor network can be formed by sensors carried by people or buses. In this paper, we will present a mobile sensor network programming system (MSNPS) that can program or reprogram such mobile sensor networks. The programming process is usually initiated by a user from the Internet. MSNPS uses a gateway protocol to bridge the Internet and sensor network, so that control and data messages can be exchanged between these two networks. MSNPS sends the program data to the targeted sensor platforms using a tree structure formed by control messages. We developed a prototype implementation, and analyzed MSNPS system performance. We also simulated the system in a mobile sensor network.

关键词： Mobile sensor network Gateway protocol network programming

来源：评论

学校读者我要写书评

暂无评论

Confluences in programming languages research (keynote) 16

Confluences in programming languages research (keynote)

引用

Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of programming Languages

作者： David Walker Princeton University USA

ISBN: (纸本)9781450335492

A confluence occurs when two rivers flow together; downstream the combined forces gather strength and propel their waters forward with increased vigor. In academic research, according to Varghese, a confluence occurs after some trigger, perhaps a discovery or a change in technology, and brings two previously separate branches of research together. In this talk, I will discuss confluences in programming languages research. Here, confluences often occur when basic research finds application in some important new domain. Two prime examples from my own career involve the confluence of research in type theory and systems security, triggered by new theoretical tools for reasoning about programming language safety, and the confluence of formal methods and networking, triggered by the rise of data centers. These experiences may shed light on what to teach our students and what is next for programming languages research.

关键词： formal methods network programming basic research interdisciplinary research programming languages

来源：评论

学校读者我要写书评

暂无评论

Feedback and Time are Essential for the Optimal Control of Computing Systems

引用

IFAC-PapersOnLine 2015年第23期48卷 380-387页

作者： Kerrigan, Eric C. Imperial College London United Kingdom

The performance, reliability, cost, size and energy usage of computing systems can be improved by one or more orders of magnitude by the systematic use of modern control and optimization methods. Computing systems rely on the use of feedback algorithms to schedule tasks, data and resources, but the models that are used to design these algorithms are validated using open-loop metrics. By using closed-loop metrics instead, such as the gap metric developed in the control community, it should be possible to develop improved scheduling algorithms and computing systems that have not been over-engineered. Furthermore, scheduling problems are most naturally formulated as constraint satisfaction or mathematical optimization problems, but these are seldom implemented using state of the art numerical methods, nor do they explicitly take into account the fact that the scheduling problem itself takes time to solve. This paper makes the case that recent results in real-time model predictive control, where optimization problems are solved in order to control a process that evolves in time, are likely to form the basis of scheduling algorithms of the future. We therefore outline some of the research problems and opportunities that could arise by explicitly considering feedback and time when designing optimal scheduling algorithms for computing systems. © 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Distributed computer systems Closed loop control systems Constraint satisfaction problems Feedback Interactive computer systems Model predictive control Numerical methods Optimization Real time systems Scheduling Scheduling algorithms Sensor networks Telecommunication networks Computing system Constraint Satisfaction Feedback algorithms Mathematical optimization problems network programming Optimal controls Optimal scheduling algorithm Optimization problems

来源：评论

学校读者我要写书评

暂无评论

Feedback and Time are Essential for the Optimal Control of Computing Systems

Feedback and Time are Essential for the Optimal Control of C...

引用

5th IFAC Conference on Nonlinear-Model-Predictive-Control (NMPC)

作者： Kerrigan, Eric C. Univ London Imperial Coll Sci Technol & Med London SW7 2AZ England

The performance, reliability, cost, size and energy usage of computing systems can be improved by one or more orders of magnitude by the systematic use of modern control and optimization methods. Computing systems rely on the use of feedback algorithms to schedule tasks, data and resources, but the models that are used to design these algorithms are validated using open-loop metrics. By using closed-Loop metrics instead, such as the gap metric developed in the control community, it should be possible to develop unproved scheduling algorithms and computing systems that have not been over-engineered. Furthermore, scheduling problems are most naturally formulated as constraint satisfaction or mathematical optimization problems, but these are seldom implemented using state of the art numerical methods, nor do they explicitly take into account the fact that the scheduling problem itself takes time to solve. This paper makes the case that recent results in real-time model predictive control, where optimization problems are solved in Order to control a process that evolves in time, are likely to form the basis of scheduling algorithms of the future. We therefore outline some of the research problems and opportunities that could arise by explicitly considering feedback and time when designing optimal scheduling algorithms for computing systems. (C) 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Optimal control scheduling real-time systems computing systems sensor networks network programming communication networks distributed computing

来源：评论

学校读者我要写书评

暂无评论

Client-Server Based Photomontage 23

Client-Server Based Photomontage

引用

23nd Signal Processing and Communications Applications Conference (SIU)

作者： Damkhi, Mouslem Mohamed, Nawal Abdullahi Dizdaroglu, Bekir Karadeniz Tech Univ Bilgisayar Muhendisligi Bolumu Trabzon Turkey

ISBN: (纸本)9781467373869

This study presents a client-server architecture adopted for solution of the Poisson equation, which is a linear equation, used in photomontage. Firstly, a general idea is given about main principle of working of the proposed approach. Secondly, an approach taking into account iterative methods in order to solve the Poisson equation based on Dirichlet boundary conditions is presented. After that it is given a general idea about remote method invocation (RMI) which is used to achieve a client-server architecture in Java programming language and how the RMI approach is put into practice for photomontage. Lastly, tests and generated results are discussed.

关键词： Poisson equation photomontage distributed systems network programming remote method invocation

来源：评论

学校读者我要写书评

暂无评论

SPD: Automatically Test Unmodified network Programs with Symbolic Packet Dynamics

SPD: Automatically Test Unmodified Network Programs with Sym...

引用

IEEE Global Communications Conference

作者： Wei Sun Lisong Xu Sebastian Elbaum Department of Computer Science and Engineering University of Nebraska-Lincoln

ISBN: (纸本)9781479959532

network programs are difficult to test, especially under the large space of network program behavior defined by packet dynamics such as packet delay and packet loss. It is unlikely for common approaches using testbeds with random packet dynamics to cover the prohibitively large number of packet dynamics possibilities in a limited time. In this paper, we leverage symbolic execution to find the equivalence classes of packet dynamics which lead to exactly the same network program behavior, in order to efficiently check the large space of network program behavior. Specifically, we propose and develop a network program test platform, called Symbolic Packet Dynamics (SPD), to automatically and transparently test unmodified network programs for low-probability bugs and extreme-case performance under packet dynamics. SPD uses symbolic representation of packet dynamics, instead of random packet dynamics. Our experiments show that SPD can achieve significantly much higher packet dynamics coverage than random packet dynamics within the same amount of time, and thus it is much easier and takes much shorter time for SPD to detect low-probability bugs and extreme-case performance.

关键词： network programming Packet dynamics Equivalence classes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：