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

Euro-Par conference / 7th international Workshop on programming Models and Applications for Multicores and Manycores (PMAM) held in conjunction with the 21st SIGPLAN Symposium on Principles and Practice of Parallel programming (PPoPP)

作者： Dolz, Manuel F. Astorga, David Del Rio Fernandez, Javier Torquati, Massimo Garcia, Jose Daniel Garcia-Carballeira, Felix Danelutto, Marco Univ Carlos III Madrid Dept Comp Sci Madrid 28911 Spain Univ Pisa Dept Comp Sci I-56127 Pisa Italy

the rapid progress of multi/many-core architectures has caused data-intensive parallel applications not yet fully optimized to deliver the best performance. In the advent of concurrent programming, frameworks offering structured patterns have alleviated developers' burden adapting such applications to multithreaded architectures. While some of these patterns are implemented using synchronization primitives, others avoid them by means of lock-free data mechanisms. However, lock-free programming is not straightforward, ensuring an appropriate use of their interfaces can be challenging, since different memory models plus instruction reordering at compiler/processor levels can interfere in the occurrence of data races. the benefits of race detectors are formidable in this sense;however, they may emit false positives if are unaware of the underlying lock-free structure semantics. To mitigate this issue, this paper extends threadSanitizer, a race detection tool, with the semantics of 2 lock-free data structures: the single-producer/single-consumer and the multiple-producer/multiple-consumer queues. With it, we are able to drop false positives and detect potential semantic violations. the experimental evaluation, using different queue implementations on a set of benchmarks and real applications, demonstrates that it is possible to reduce, on average, 60% the number of data race warnings and detect wrong uses of these structures.

关键词： data race detectors parallel programming semantics wait- lock-free data structures

来源：评论

学校读者我要写书评

暂无评论

Advanced Remote Debugging of LoRa-enabled IoT Sensor Nodes 17

Advanced Remote Debugging of LoRa-enabled IoT Sensor Nodes

引用

7th international conference on the Internet of things

作者： Poetsch, Albert Haslhofer, Florian Springer, Andreas Linz Ctr Mechatron GmbH A-4040 Linz Austria Johannes Kepler Univ Linz Inst Commun Engn & RF Syst Linz Austria

ISBN: (纸本)9781450353182

this work demonstrates a complete setup of a distributed LoRaWAN-based data-acquisition system where individual LoRa end-devices can be supervised by a remote debugging environment. We present the whole chain of data processing from an embedded Indoor Air Quality (IAQ) monitoring sensor in the field up to the data-storage and visualization for human end-users connected over the cloud. In particular, we focus on the development-process of the low-power sensor node itself, which plays a key role in every IoT scenario. the sensor node's hardware is realized with a low-cost resource-constrained microcontroller unit (MCU) which executes the sensor-application as well as the embedded LoRaWAN stack. We demonstrate the possibility of remote incircuit-debugging of the embedded wireless node's firmware during operation in the field. Together with the possibility to analyze the power consumption and the radio-frequency spectrum of the wireless node as well as undesired RF interferer the ability to remotely update and debug the MCU's firmware allows to optimize the sensor node for the specific usage scenario and the place of its final operation.

关键词： Internet of things LoRa LoRaWAN Wireless Networks Embedded Microcontroller RF Power Measurement In-circuit Debugging Remote Firmware programming

来源：评论

学校读者我要写书评

暂无评论

Finding a Nash Equilibrium and an Optimal Sharing Policy for Multiagent Network Expansion Game

引用

NETWORKS 2017年第1期69卷 94-109页

作者： Chaabane, Nadia Briand, Cyril Huguet, Marie-Jose Agnetis, Alessandro Univ Toulouse CNRS INSA LAASUPS Siena Italy Univ Siena Dipartimento Ingn Informaz & Sci Matemat Siena Italy

In this work, a multiagent network flow problem is addressed, aiming at characterizing the properties of stable flows and allowing their computation. Two types of agents are considered: transportation-agents, that carry a flow of products on a given network and another agent, either a producer or a customer, who is willing to ship (receive, respectively), products. Every transportation-agent controls a set of arcs, each having a capacity that can be increased up to a certain point at a given cost. the other agent (i.e., the customer/producer) is interested in maximizing the flow transshipped through the network. To this aim, we assume it offers the transportation-agents a reward that is proportional to the realized flow value. this particular multiagent framework is referred to as a Multiagent network expansion game. We characterize and find particular stable strategies (i.e., Nash equilibria) that are of interest for this game. We particularly focus on the problem of finding a Nash Equilibrium and a sharing policy that maximize the value of the total flow. We prove that this problem is NP-hard in the strong sense and show how such a strategy can be characterized considering paths in specific auxiliary graphs. We also provide a mixed integer linear programming formulation to solve the problem. Computational experiments are provided to prove the effectiveness of our approach and derive some insights for practitioners. (C) 2016 Wiley Periodicals, Inc.

关键词： multiagent network flow Nash equilibria complexity network expansion game mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Quality-Aware Reactive programming for the Internet of things 1

引用

7th IPM international conference on Fundamentals of Software Engineering (FSEN)

作者： Proenca, Jose Baquero, Carlos INESC TEC HASLab Braga Portugal Univ Minho Braga Portugal

ISBN: (数字)9783319689722

ISBN: (纸本)9783319689722;9783319689715

the reactive paradigm recently became very popular in user-interface development: updates - such as the ones from the mouse, keyboard, or from the network - can trigger a chain of computations organised in a dependency graph, letting the underlying engine control the scheduling of these computations. In the context of the Internet of things (IoT), typical applications deploy components in distributed nodes and link their interfaces, employing a publish-subscribe architecture. the paradigm for Distributed Reactive programming marries these two concepts, treating each distributed component as a reactive computation. However, existing approaches either require expensive synchronisation mechanisms or they do not support pipelining, i.e., allowingmultiple "waves" of updates to be executed in parallel. We propose Quarp (Quality-Aware Reactive programming), a scalable and light-weight mechanism aimed at the IoT to orchestrate components triggered by updates of data-producing components or of aggregating components. this mechanism appends meta-information tomessages between components capturing the context of the data, used to dynamically monitor and guarantee useful properties of the dynamic applications. these include the so-called glitch freedom, time synchronisation, and geographical proximity. We formalise Quarp using a simple operational semantics, provide concrete examples of useful instances of contexts, and situate our approach in the realm of distributed reactive programming.

关键词： Reactive programming Component-based systems Pervasive systems Distributed systems Failure

来源：评论

学校读者我要写书评

暂无评论

A Penalized Best-Response Algorithm for Nonlinear Single-Path Routing Problems

A Penalized Best-Response Algorithm for Nonlinear Single-Pat...

引用

7th international Network Optimization conference (INOC)

作者： Brun, Olivier Prabhu, Balakrishna Vallet, Josselin Univ Toulouse CNRS LAAS Toulouse France Univ Toulouse LAAS F-31400 Toulouse France Viveris Technol 1 Ave Europe F-31400 Toulouse France

this article is devoted to nonlinear single-path routing problems, which are known to be NP-hard even in the simplest cases. For solving these problems, we propose an algorithm inspired from Game theory in which individual flows are allowed to independently select their path to minimize their own cost function. We design the cost function of the flows so that the resulting Nash equilibrium of the game provides an efficient approximation of the optimal solution. We establish the convergence of the algorithm and show that every optimal solution is a Nash equilibrium of the game. We also prove that if the objective function is a polynomial of degree d >= 1, then the approximation ratio of the algorithm is (2(1/d) - 1)(-d). Experimental results show that the algorithm provides single-path routings with modest relative errors with respect to optimal solutions, while being several orders of magnitude faster than existing techniques. (C) 2016 Wiley Periodicals, Inc.

关键词： best response single-path routing game theory nonlinear programming approximation algorithm Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

A Node-Based ILP Formulation for the Node-Weighted Dominating Steiner Problem

A Node-Based ILP Formulation for the Node-Weighted Dominatin...

引用

7th international Network Optimization conference (INOC)

作者： Bley, Andreas Maurer, Olaf Ljubic, Ivana Univ Kassel Dept Math Kassel Germany ESSEC Business Sch Paris Cergy Pontoise France

In this article, we consider the Node-Weighted Dominating Steiner Problem. Given a graph with node weights and a set of terminal nodes, the goal is to find a connected node-induced subgraph of minimum weight, such that each terminal node is contained in or adjacent to some node in the chosen subgraph. the problem arises in applications in the design of telecommunication networks. Integer programming formulations for Steiner problems usually employ a variable for each edge. We introduce a formulation that only uses node variables and that models connectivity through node-cut inequalities, which can be separated in polynomial time. We discuss necessary and sufficient conditions for the model inequalities to define facets and we introduce a class of lifted partition-based inequalities, which can be used to strengthen the linear relaxation. Finally, we show that the polyhedron defined by these inequalities is integral if the underlying graph is a cycle where no two terminals are adjacent. In the general cycle setting, we show that we can get a complete description of the feasible solutions by lifting and projecting into a polytope with no more than twice the dimension. We also show that the well-known indegree equalities are implied by the lifted partition inequalities. Finally, we evaluate the effectiveness of the presented partition inequalities in computational experiments. (C) 2016 Wiley Periodicals, Inc.

关键词： connected dominating set Steiner tree integer programming thin formulation polyhedron facets

来源：评论

学校读者我要写书评

暂无评论

A Novel Convex Relaxation for Non-binary Discrete Tomography 6th

A Novel Convex Relaxation for Non-binary Discrete Tomography

引用

6th international conference on Scale Space and Variational Methods in Computer Vision (SSVM)

作者： Kuske, Jan Swoboda, Paul Petra, Stefania Heidelberg Univ Inst Appl Math MIG Heidelberg Germany IST Austria Klosterneuburg Austria

ISBN: (纸本)9783319587714;9783319587707

We present a novel convex relaxation and a corresponding inference algorithm for the non-binary discrete tomography problem, that is, reconstructing discrete-valued images from few linear measurements. In contrast to state of the art approaches that split the problem into a continuous reconstruction problem for the linear measurement constraints and a discrete labeling problem to enforce discrete-valued reconstructions, we propose a joint formulation that addresses both problems simultaneously, resulting in a tighter convex relaxation. For this purpose a constrained graphical model is set up and evaluated using a novel relaxation optimized by dual decomposition. We evaluate our approach experimentally and show superior solutions both mathematically (tighter relaxation) and experimentally in comparison to previously proposed relaxations.

关键词： Linear programming Relaxation Convex Relaxation Bundle Method High Order Factor Restricted Isometry Property these keywords were added by machine and not by the authors. this process is experimental and the keywords may be updated as the learning algorithm improves.

来源：评论

学校读者我要写书评

暂无评论

Assessing the Role of Computer Simulation in Chemistry Learning 7th

引用

7th international conference in Methodologies and Intelligent Systems for Technology Enhanced Learning (MIS4TEL)

作者： Figueiredo, Margarida Rafael, Catarina Neves, Jose Vicente, Henrique Univ Evora Escola Ciencias & Tecnol Ctr Invest Educ & Psicol Dept Quim Evora Portugal Univ Evora Escola Ciencias & Tecnol Dept Quim Evora Portugal Univ Minho Ctr Algoritmi Braga Portugal

ISBN: (纸本)9783319608198;9783319608181

Simulation and Computation make a versatile teaching strategy, and may be an important way to motivate students and lecturers to achieve meaningful learning. Indeed, this work refers to a study whose main objective is to set the influence that a teaching approach based on the use of computer simulation would have on students' learning, compared to the one in use today. this work involved the participation of two classes of 11th grade at a Secondary School in Lisbon, Portugal, where the main goal is to teach a specific topic to an untried student's group. With regard to the simulation environment, it will be grounded on a Proof theoretical approach to Knowledge Representation and Reasoning, which caters for the handling of incomplete, unknown or even self-contradictory information or knowledge.

关键词： Computer simulation Chemistry learning Teaching strategies Secondary education Logic programming Knowledge representation and reasoning

来源：评论

学校读者我要写书评

暂无评论

Reinforcement learning approach for adapting complex Agent-Based model of evacuation to fast Linear Model 7

Reinforcement learning approach for adapting complex Agent-B...

引用

7th international conference on Information Science and Technology (ICIST)

作者： Le, Van-Minh Vinh, Ho Tuong Zucker, Jean-Daniel Vietnam Natl Univ Univ Danang Coll Informat Technol IFIIRDUMMISCOUMI 209 144 Xuan Thuy Hanoi Vietnam Vietnam Natl Univ UMMISCO IRD IFIUMI 209 144 Xuan Thuy Hanoi Vietnam Sorbonne Univ UMMISCO IRD France Nord IRDUMI 209 F-93143 Bondy France

ISBN: (纸本)9781509054015

Nowadays, most coastal regions face a potential risk of tsunami. the evacuation is one of the most effective mitigation procedures. Howerver, there are always the part of evacuees (e.g. the tourist) who lack information of the evacuation map, which motivates us to focus on the problem of optimizing of guidance sign placement for tsunami evacuation. Concretely, we must find out an optimal sign placement in order to have as many evacuees as possible to reach shelters before tsunami arrival. In fact, most studies focus on two approaches: Agent-Based modeling and Equation-Based modeling. Each approach has its own pros and cons. While the Agent-Based modeling introduces an accurate but very slow model, the Equation-Based one provides a very fast but inaccurate model. the idea of this study is that we learn the accurate Agent-Based model and adapt it into very fast Equation-Based model in order to solve the optimizing problem. In this paper, we present clearly two models representing the two approaches and pros and cons of each model. We then propose a reinforcement learning approach for adapting complex Agent-Based model into a very fast Linear Model (representing Equation-Based modeling approach). By experimentation, our proposed approach shows that we can replace a slow complex model by a very fast model with an acceptable level of accuracy in order to solve optimizing problem.

关键词： agent-based simulation linear programming genetic algorithm optimization reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Equity-oriented STEM-rich making among youth from historically marginalized communities 17

Equity-oriented STEM-rich making among youth from historical...

引用

7th Annual conference on Creativity and Making in Education, FabLearn 2017

作者： Barton, Angela Calabrese Tan, Edna Michigan State University 305 Erickson Hall East LansingMI48823 United States University of North Carolina at Greensboro 402 SOE Building NC27402 United States

ISBN: (纸本)9781450363495

We investigated the ways in which youth makers from two lowincome urban communities engaged in sustained STEM-rich, making towards making a difference in their communities. Drawing upon a mobilities of learning framework and four years of ethnographic data across two making spaces, we found that as youth engaged with community across their making efforts, they foregrounded their relationality to communities in their design work, both within activities and across timescales. We also found that engaging making with community opened up new and different opportunities to co-make, as the youth drew on, and expanded their social networks. We discuss how these findings impact understanding of how a more equitable making culture can evolve, and its implications for how youth imagine their social futures in and through making. © 2017 Association for Computing Machinery.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：