the proceedings contain 36 papers. the special focus in this conference is on Artificial General Intelligence. the topics include: Self-modification of policy and utility function in rational agents;avoiding wireheadi...
ISBN:
(纸本)9783319416489
the proceedings contain 36 papers. the special focus in this conference is on Artificial General Intelligence. the topics include: Self-modification of policy and utility function in rational agents;avoiding wireheading with value reinforcement learning;death and suicide in universal artificial intelligence;physical complexity and limits of inductive inference systems;imitation learning as cause-effect reasoning;some theorems on incremental compression;rethinking sigma’s graphical architecture;real-time GA-based probabilistic programming in application to robot control;different conceptions of learning;the emotional mechanisms in NARS;the openNARS implementation of the non-axiomatic reasoning system;integrating symbolic and sub-symbolic reasoning;integrating axiomatic and analogical reasoning;a step towards human-level reasoning;asymptotic logical uncertainty and the benford test;towards a computational framework for function-driven concept invention;system induction games and cognitive modeling as an AGI methodology;integrating model-based prediction and facial expressions in the perception of emotion;a few notes on multiple theories and conceptual jump size;generalized temporal induction with temporal concepts in a non-axiomatic reasoning system;confidence measures for general value functions;automatic sampler discovery via probabilistic programming and approximate Bayesian computation;analysis of algorithms and partial algorithms;estimating Cartesian compression via deep learning;toward human-level massively-parallel neural networks with Hodgkin-Huxley neurons;modeling neuromodulation as a framework to integrate uncertainty in general cognitive architectures;controlling combinatorial explosion in inference via synergy with nonlinear-dynamical attention allocation and probabilistic growth and mining of combinations.
this two-volume-set (LNCS 7203 and 7204) constitutes the refereed proceedings of the 9thinternationalconference on parallel Processing and Applied Mathematics, PPAM 2011, held in Torun, Poland, in September 2011.the...
详细信息
ISBN:
(数字)9783642315008
ISBN:
(纸本)9783642314995
this two-volume-set (LNCS 7203 and 7204) constitutes the refereed proceedings of the 9thinternationalconference on parallel Processing and Applied Mathematics, PPAM 2011, held in Torun, Poland, in September 2011.
the 130 revised full papers presented in both volumes were carefully reviewed and selected from numerous submissions. the papers address issues such as parallel/distributed architectures and mobile computing; numerical algorithms and parallel numerics; parallel non-numerical algorithms; tools and environments for parallel/distributed/grid computing; applications of parallel/distributed computing; applied mathematics, neural networks and evolutionary computing; history of computing.
A parallel system to solve complex computational problems involve multiple instruction, simultaneous flows, communication structures, synchronisation and competition conditions between processes, as well as mapping an...
详细信息
the discrete wavelet transform can be found at the heart of many image-processing algorithms. Until now, the transform on general-purpose processors (CPUs) was mostly computed using a separable lifting scheme. As the ...
详细信息
ISBN:
(数字)9781510617421
ISBN:
(纸本)9781510617421
the discrete wavelet transform can be found at the heart of many image-processing algorithms. Until now, the transform on general-purpose processors (CPUs) was mostly computed using a separable lifting scheme. As the lifting scheme consists of a small number of operations, it is preferred for processing using single-core CPUs. However, considering a parallel processing using multi-core processors, this scheme is inappropriate due to a large number of steps. On such architectures, the number of steps corresponds to the number of points that represent the exchange of data. Consequently, these points often form a performance bottleneck. Our approach appropriately rearranges calculations inside the transform, and thereby reduces the number of steps. In other words, we propose a new scheme that is friendly to parallel environments. When evaluating on multi-core CPUs, we consistently overcome the original lifting scheme. the evaluation was performed on 61-core Intel Xeon Phi and 8-core Intel Xeon processors.
the complexity of efficiently programming massively parallel machines is illustrated by presenting a number of algorithms. these algorithms deal with computational geometry, data histogramming, list manipulation, and ...
详细信息
the complexity of efficiently programming massively parallel machines is illustrated by presenting a number of algorithms. these algorithms deal with computational geometry, data histogramming, list manipulation, and other problems or operations that arise in computer vision tasks. All of the algorithms presented use a divide-and-conquer strategy, and they all use routines that solve a problem of size M using a machine size N, where M >
Multi-access edge computing (MEC) technology is a potential solution to the conflict between resource-constrained unmanned aerial vehicles (UAVs) and various emerging computationally intensive, delay-sensitive applica...
详细信息
the hardness of solving multivariate quadratic (MQ) systems is the underlying problem for multivariate-based schemes in the field of post-quantum cryptography. the concrete, practical hardness of this problem needs to...
详细信息
ISBN:
(纸本)9783319790633;9783319790626
the hardness of solving multivariate quadratic (MQ) systems is the underlying problem for multivariate-based schemes in the field of post-quantum cryptography. the concrete, practical hardness of this problem needs to be measured by state-of-the-art algorithms and high-performance implementations. We describe, implement, and evaluate an adaption of the Crossbred algorithm by Joux and Vitse from 2017 for solving MQ systems over F-2. Our adapted algorithm is highly parallelizable and is suitable for solving MQ systems on GPU architectures. Our implementation is able to solve an MQ system of 134 equations in 67 variables in 98.39 hours using one single commercial Nvidia GTX 980 graphics card, while the original Joux-Vitse algorithm requires 6200 CPU-hours for the same problem size. We used our implementation to solve all the Fukuoka Type-I MQ challenges for n is an element of{55,..., 74}. Based on our implementation, we estimate that the expected computation time for solving an MQ system of 80 equations in 84 variables is about one year using a cluster of 3600 GTX 980 graphics cards. these parameters have been proposed for 80-bit security by, e.g., Sakumoto, Shirai, and Hiwatari at Crypto 2011.
We study scalable parallel computational geometry algorithms for the coarse grained multicomputer model: p processors solving a problem on n data items, were each processor has O(n/p) much greater than O(1) local memo...
详细信息
We study scalable parallel computational geometry algorithms for the coarse grained multicomputer model: p processors solving a problem on n data items, were each processor has O(n/p) much greater than O(1) local memory and all processors are connected via some arbitrary interconnection network (e.g. mesh, hypercube, fat tree). We present O(T-sequential/p + T-s(n,p)) time scalable parallelalgorithms for several computational geometry problems. T-s(n,p) refers to the time of a global sort operation. Our results are independent of the multicomputer's interconnection network. their time complexities become optimal when T-sequential/p dominates T-s(n,p) or when T-s(n,p) is optimal. this is the case for several standard architectures, including meshes and hypercubes, and a wide range of ratios n/p that include many of the currently available machine configurations. Our methods also have some important practical advantages: For interprocessor communication, they use only a small fixed number of one global routing operation, global sort, and all other programming is in the sequential domain. Furthermore, our algorithms use only a small number of very large messages, which greatly reduces the overhead for the communication protocol between processors. (Note however, that our time complexities account for the lengths of messages.) Experiments show that our methods are easy to implement and give good timing results.
暂无评论