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

Overcoming Individual Limitations Through distributed computation: Rational Information Accumulation in Multigenerational Populations

引用

TOPICS IN COGNITIVE SCIENCE 2022年第3期14卷 550-573页

作者： Hardy, Mathew D. Krafft, Peaks M. Thompson, Bill Griffiths, Thomas L. Princeton Univ Dept Psychol Princeton NJ 08540 USA Univ Arts London Creat Comp Inst London England Princeton Univ Dept Comp Sci Princeton NJ 08540 USA

Many of the computational problems people face are difficult to solve under the limited time and cognitive resources available to them. Overcoming these limitations through social interaction is one of the most distinctive features of human intelligence. In this paper, we show that information accumulation in multigenerational social networks can be produced by a form of distributed Bayesian inference that allows individuals to benefit from the experience of previous generations while expending little cognitive effort. In doing so, we provide a criterion for assessing the rationality of a population that extends traditional analyses of the rationality of individuals. We tested the predictions of this analysis in two highly controlled behavioral experiments where the social transmission structure closely matched the assumptions of our model. Participants made decisions on simple categorization tasks that relied on and contributed to accumulated knowledge. Success required these microsocieties to accumulate information distributed across people and time. Our findings illustrate how in certain settings, distributed computation at the group level can pool information and resources, allowing limited individuals to perform effectively on complex tasks.

关键词： Bayesian inference Cultural evolution Collective intelligence distributed computation Group rationality Social learning

来源：评论

学校读者我要写书评

暂无评论

Data Summarization and distributed computation 18

Data Summarization and Distributed Computation

引用

37th ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing (PODC)

作者： Cormode, Graham Univ Warwick Comp Sci Data Management Privacy & Big Data Anal Warwick England

ISBN: (纸本)9781450357951

The notion of summarization is to provide a compact representation of data which approximately captures its essential characteristics. If such summaries can be created, they can lead to efficient distributed algorithms which exchange summaries in order to compute a desired function. In this talk, I'll describe recent efforts in this direction for problems inspired by machine learning: building graphical models over evolving, distributed training examples, and solving robust regression problems over large, distributed data sets.

关键词： data summarization distributed computation

来源：评论

学校读者我要写书评

暂无评论

On Power Splitting Games in distributed computation: The Case of Bitcoin Pooled Mining 28

On Power Splitting Games in Distributed Computation: The Cas...

引用

IEEE 28th Computer Security Foundations Symposium CSF

作者： Luu, Loi Saha, Ratul Parameshwaran, Inian Saxena, Prateek Hobor, Aquinas Natl Univ Singapore Sch Comp Singapore 117548 Singapore Natl Univ Singapore Yale NUS Coll Singapore 117548 Singapore

ISBN: (纸本)9781467375382

Several new services incentivize clients to compete in solving large computation tasks in exchange for financial rewards. This model of competitive distributed computation enables every user connected to the Internet to participate in a game in which he splits his computational power among a set of competing pools - the game is called a computational power splitting game. We formally model this game and show its utility in analyzing the security of pool protocols that dictate how financial rewards are shared among the members of a pool. As a case study, we analyze the Bitcoin cryptocurrency which attracts computing power roughly equivalent to billions of desktop machines, over 70% of which is organized into public pools. We show that existing pool reward sharing protocols are insecure in our game-theoretic analysis under an attack strategy called the "block withholding attack". This attack is a topic of debate, initially thought to be ill-incentivized in today's pool protocols: i.e., causing a net loss to the attacker, and later argued to be always profitable. Our analysis shows that the attack is always well-incentivized in the long-run, but may not be so for a short duration. This implies that existing pool protocols are insecure, and if the attack is conducted systematically, Bitcoin pools could lose millions of dollars worth in months. The equilibrium state is a mixed strategy-that is-in equilibrium all clients are incentivized to probabilistically attack to maximize their payoffs rather than participate honestly. As a result, the Bitcoin network is incentivized to waste a part of its resources simply to compete.

关键词： Bitcoin Cryptocurrency distributed computation POOLS computational power Game theory Game animals mining protocols Hunting power splitting Reward arithmetic customers equilibrium state Swimming Pools

来源：评论

学校读者我要写书评

暂无评论

Offload Destination Selection to Enable distributed computation on Battlefields 33

Offload Destination Selection to Enable Distributed Computat...

引用

33rd Annual IEEE Military Communications Conference on Affordable Mission Success - Meeting the Challenge (MILCOM)

作者： Sookoor, Tamim Doria, David Bruno, David Shires, Dale Swenson, Brian Pollock, Lori US Army Res Lab Div Comp Sci Aberdeen Proving Ground MD 21005 USA Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA Univ Delaware Dept Comp & Informat Sci Newark DE 19716 USA

ISBN: (纸本)9781479967704

The tactical edge (battlefields, disaster relief operations, etc.)is an ideal domain for utilizing mobile devices for computation. However, these situations require jobs to complete in a timely manner. Efficiently offloading computation can ensure timely job completion, but access to cloud computing infrastructure is typically limited, unreliable, or unavailable. As an alternative, we propose using vehicle-mounted high performance computers, called Tactical EIPCs (T-HPCs), as offload targets. A common scenario includes multiple offload targets with different computation capabilities, multiple clients wanting to offload computations, and wireless ad-hoc connectivity. While offloading strategies exist, currently none address the requirements of task scheduling in this setting. This paper presents an algorithm for offloading tasks from multiple sources while taking into account the computation capabilities and current utilization of available offload targets. In addition, distributed scheduling avoids a single point of failure which could be disastrous on the tactical edge. We report the results of simulations showing that our method reduces job completion time compared to alternative offloading schemes.

关键词： cloud computing military computing mobile computing battlefield cloud computing infrastructure distributed computation job completion time mobile devices offload destination selection offloading computation tactical HPC vehicle-mounted high performance computers wireless ad-hoc connectivity Clouds Processor scheduling Resource management Schedules Servers Smart phones

来源：评论

学校读者我要写书评

暂无评论

Multi-hop Coflow Routing for LEO distributed computation Satellite Networks 96

Multi-hop Coflow Routing for LEO Distributed Computation Sat...

引用

IEEE 96th Vehicular Technology Conference (VTC-Fall)

作者： Zhang, Zhikai Gu, Shushi Li, Shumao Yang, Yi Zhang, Qinyu Harbin Inst Technol Shenzhen Guangdong Key Lab Aerosp Commun & Networking Tech Shenzhen Peoples R China Harbin Inst Technol Shenzhen Educ Ctr Expt & Innovat Shenzhen Peoples R China Pengcheng Lab Shenzhen Peoples R China

ISBN: (纸本)9781665454681

The low earth satellite networks are envisioned to be an indispensable part of next-generation network due to the seamless Internet access. Deploying distributed computation into LEO satellite networks can decrease the latency of transmitting satellite-terrestrial computing jobs, which is crucial to expanding the service capability. distributed computation depends on the exchange of data flows between worker nodes, as a type of concurrent and interrelated flows called coflow. However, the mesh-shaped topologies of LEO satellite networks make coflows prone to bandwidth competition on multi-hop links, which impedes the efficiency of distributed computation. In this paper, we formulated the multi-hop coflow scheduling process in LEO satellite networks as a routing and bandwidth allocation problem. Then, we simplified the problem to a coflow routing problem, and proposed the coflow routing greedy scheduling (CRGS) algorithm on the basis of the characteristics of multi-hop networks. Finally, we simulated in an SDN environment, where CRGS was deployed in an SDN controller. Compared with several existing algorithms, the CRGS algorithm is proved to reduce the coflow completion time (CCT) more effectively.

关键词： LEO satellite network distributed computation coflow routing SDN controller bandwidth competition

来源：评论

学校读者我要写书评

暂无评论

A Kind of Load Balance Multicast Routing Algorithm Based on distributed computation and Centralized Control

A Kind of Load Balance Multicast Routing Algorithm Based on ...

引用

International Conference on Recent Trends in Materials and Mechanical Engineering (ICRTMME 2011)

作者： Chen Xiang Tang Jun-yong Zhang Yong Xian Technol Univ Sch Civil Engn Xian Peoples R China Xian Technol Univ Dept Comp Sci & Engn Xian Peoples R China Wuhan Univ Sci & Technol Wuhan Peoples R China

ISBN: (纸本)9783037850992

distributed routing can find multicast tree and adapt to dynamic changes of multicast members in case of acknowledge local network state. Majority of current distributed multicast routing algorithms based on the shortest delay, which can achieve load balance large additional overhead. The paper presented a kind of load balance multicast routing algorithm based on distributed computation and centralized control. It reside computation Agent in each node to compute forward probability and to maintain node routing table, node state table and forwarding probability table. In addition, it can detect delay of adjacent nodes and coordinate session establishment based on the copy, parameter transmission and notification of control Agent. On this basis, the algorithm achieved dynamically joins and leave session of multicast members. Algorithm analysis results show that the algorithm can improve the overall efficiency of network transmission.

关键词： multicast routing Agent distributed computation centralized control

来源：评论

学校读者我要写书评

暂无评论

A Framework of Networked Visual Servo Control System with distributed computation

A Framework of Networked Visual Servo Control System with Di...

引用

11th International Conference on Control, Automation, Robotics and Vision (ICARCV 2010)

作者： Wu, Haiyan Lou, Lei Chen, Chih-Chung Hirche, Sandra Kuehnlenz, Kolja Tech Univ Munich Inst Automat Control Engn LSR D-8000 Munich Germany

ISBN: (纸本)9781424478132

In this paper, a networked visual servo control system with distributed computation is proposed to overcome the low sampling rate problem in vision-based control systems. A real-time image data transmission protocol based on Real-time Transport Protocol (RTP) is developed. The captured images are sent to different processing nodes connected over a communication network and processed in parallel. Thus, a high sampling rate of the visual feedback is achieved under a cloud image processing architecture. The varying image processing delay caused by the varying number of extracted features and the random transmission delay are modeled as a random process with Bernoulli distribution. By using the input-delay approach, the resulted networked visual servo control system is reformulated into a stochastic continuous-time system with time-varying delay. Experiments on two 1-DoF linear motor modules are carried out to validate the proposed approach. A visual servo control system without parallel distributed computation is implemented for comparison. The experimental results demonstrate significant performance improvement by the proposed approach.

关键词： Bernoulli distribution cloud image processing architecture communication network computer networks computer vision continuous time systems delay systems distributed computation feature extraction feature extraction image processing delay input-delay appro

来源：评论

学校读者我要写书评

暂无评论

Enabling Robust and Efficient distributed computation in Dynamic Peer-to-Peer Networks 56

Enabling Robust and Efficient Distributed Computation in Dyn...

引用

56th IEEE Annual Symposium on Foundations of Computer Science (FOCS)

作者： Augustine, John Pandurangan, Gopal Robinson, Peter Roche, Scott Upfal, Eli Indian Inst Technol Dept Comp Sci & Engn Madras 600036 Tamil Nadu India Univ Houston Dept Comp Sci Houston TX 77204 USA Queens Univ Belfast Belfast BT7 1NN Antrim North Ireland Northeastern Univ Coll Comp & Informat Sci Boston MA 02115 USA Brown Univ Dept Comp Sci Providence RI 02912 USA

ISBN: (纸本)9781467381918

Motivated by the need for designing efficient and robust fully-distributed computation in highly dynamic networks such as Peer-to-Peer (P2P) networks, we study distributed protocols for constructing and maintaining dynamic network topologies with good expansion properties. Our goal is to maintain a sparse (bounded degree) expander topology despite heavy churn (i.e., nodes joining and leaving the network continuously over time). We assume that the churn is controlled by an adversary that has complete knowledge and control of what nodes join and leave and at what time and has unlimited computational power, but is oblivious to the random choices made by the algorithm. Our main contribution is a randomized distributed protocol that guarantees with high probability the maintenance of a constant degree graph with high expansion even under continuous high adversarial churn. Our protocol can tolerate a churn rate of up to O(n/polylog(n)) per round (where n is the stable network size). Our protocol is efficient, lightweight, and scalable, and it incurs only O(polylog(n)) overhead for topology maintenance: only polylogarithmic (in n) bits needs to be processed and sent by each node per round and any node's computation cost per round is also polylogarithmic. The given protocol is a fundamental ingredient that is needed for the design of efficient fully-distributed algorithms for solving fundamental distributed computing problems such as agreement, leader election, search, and storage in highly dynamic P2P networks and enables fast and scalable algorithms for these problems that can tolerate a large amount of churn.

关键词： dynamic network P2P computing distributed computation randomized protocol churn fault-tolerance expander graph

来源：评论

学校读者我要写书评

暂无评论

Optimized Transceiver Design for Over-the-Air distributed computation over Cell-Free Massive MIMO Network 34

Optimized Transceiver Design for Over-the-Air Distributed Co...

引用

IEEE 34th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Han, Fei Li, Qiang Gong, Yi HKUST Peng Cheng Lab Shenzhen Peoples R China Peng Cheng Lab Shenzhen Peoples R China SUSTech Peng Cheng Lab Shenzhen Peoples R China

ISBN: (纸本)9781665464833

Our paper presents a MapReduce-based wireless distributed computing framework designed to handle data-intensive computing on edge devices with limited storage. The framework involves three stages: Map, Shuffle, and Reduce. However, shuffling large data during the second stage can lead to performance degradation over wireless interference networks with limited spectrum bandwidth. To address these issues, we propose using over-the-air computation (AirComp) technology, which leverages interference in the multiple-access channel to compute multiple target functions reliably. This approach achieves higher computation efficiency than traditional orthogonal multi-access schemes and is more effective in combating interference. Furthermore, we employ cell-free massive MIMO technology to improve coverage and reduce the system power overhead. This technology is essential for the upcoming sixth-generation (6G) networks. We optimize the transmitting-receiving (Tx-Rx) policy to minimize the averaged computation mean squared error (MSE) while adhering to each device's power constraint. Our simulation results demonstrate that our proposed algorithm is effective and our computation framework has advantages over state-of-the-art baselines.

关键词： Cell Free Massive MIMO distributed computation Mobile Edge Computing Resource Allocation

来源：评论

学校读者我要写书评

暂无评论

distributed computation ON GRAPHS - SHORTEST-PATH ALGORITHMS

引用

COMMUNICATIONS OF THE ACM 1982年第11期25卷 833-837页

作者： CHANDY, KM MISRA, J Univ. of Texas Austin Univ. of Texas Austin

Presents the distributed algorithms used to solve graph problems using networks of communicating processes. Solution for the shortest paths in a directed graph; Applications of the algorithms on undirected graph; Reas... 详细信息

关键词： depth first search diffusing computation distributed computation negative cycle shortest path

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：