This book constitutes the proceedings of the 5th International Conference on Social informatics, SocInfo 2013, held in Kyoto, Japan, in November 2013. The 23 full papers, 15 short papers and three poster papers includ...
详细信息
ISBN:
(数字)9783319032603
ISBN:
(纸本)9783319032597
This book constitutes the proceedings of the 5th International Conference on Social informatics, SocInfo 2013, held in Kyoto, Japan, in November 2013. The 23 full papers, 15 short papers and three poster papers included in this volume were carefully reviewed and selected from 103 submissions. The papers present original research work on studying the interplay between socially-centric platforms and social phenomena.
This book constitutes the joint refereed proceedings of the 20th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, Calculemus 2013, 6th International Workshop on Digital Mathematics Librar...
详细信息
ISBN:
(数字)9783642393204
ISBN:
(纸本)9783642393198
This book constitutes the joint refereed proceedings of the 20th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, Calculemus 2013, 6th International Workshop on Digital Mathematics Libraries, DML 2013, Systems and Projects, held in Bath, UK as part of CICM 2013, the Conferences on Intelligent Computer Mathematics. The 7 revised full papers out of 18 submissions for MKM 2013, 5 revised full papers out of 12 submissions for Calculemus 2013, 6 revised full papers out of 8 submissions for DML 2013, and 12 revised full papers out of 16 submissions for Systems and Project track presented together with 3 invited talks were carefully reviewed and selected, resulting in 33 papers from a total of 73 submissions.
This Festschrift published in honor of Vladimir Lifschitz on the occasion of his 65th birthday presents 39 articles by colleagues from all over the world with whom Vladimir Lifschitz had cooperation in various respect...
详细信息
ISBN:
(数字)9783642307430
ISBN:
(纸本)9783642307423
This Festschrift published in honor of Vladimir Lifschitz on the occasion of his 65th birthday presents 39 articles by colleagues from all over the world with whom Vladimir Lifschitz had cooperation in various respects. The 39 contributions reflect the breadth and the depth of the work of Vladimir Lifschitz in logic programming, circumscription, default logic, action theory, causal reasoning and answer set programming.
This book constitutes the refereed proceedings of the 15th European Conference on Genetic Programming, EuroGP 2012, held in Málaga, Spain, in April 2012 co-located with the Evo* 2012 events.;The 18 revised full p...
详细信息
ISBN:
(数字)9783642291395
ISBN:
(纸本)9783642291388
This book constitutes the refereed proceedings of the 15th European Conference on Genetic Programming, EuroGP 2012, held in Málaga, Spain, in April 2012 co-located with the Evo* 2012 events.;The 18 revised full papers presented together with 5 poster papers were carefully reviewed and selected from 46 submissions. The wide range of topics in this volume reflects the current state of research in the field, including different genres of GP (tree-based, grammar-based, Cartesian), theory, novel operators, and applications.
The two-volume set LNAI 7301 and 7302 constitutes the refereed proceedings of the 16th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2012, held in Kuala Lumpur, Malaysia, in May 2012. The total...
详细信息
ISBN:
(数字)9783642302206
ISBN:
(纸本)9783642302190
The two-volume set LNAI 7301 and 7302 constitutes the refereed proceedings of the 16th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2012, held in Kuala Lumpur, Malaysia, in May 2012. The total of 20 revised full papers and 66 revised short papers were carefully reviewed and selected from 241 submissions. The papers present new ideas, original research results, and practical development experiences from all KDD-related areas. The papers are organized in topical sections on supervised learning: active, ensemble, rare-class and online; unsupervised learning: clustering, probabilistic modeling in the first volume and on pattern mining: networks, graphs, time-series and outlier detection, and data manipulation: pre-processing and dimension reduction in the second volume.
We give optimally fast O(logp) time (per processor) algorithms for computing round-optimal broadcast schedules for message-passing parallel computing systems. This affirmatively answers difficult questions posed in a ...
详细信息
We give optimally fast O(logp) time (per processor) algorithms for computing round-optimal broadcast schedules for message-passing parallel computing systems. This affirmatively answers difficult questions posed in a SPAA 2022 BA and a CLUSTER 2022 paper. We observe that the computed schedules and circulant communication graph can likewise be used for reduction, all-broadcast and all-reduction as well, leading to new, round-optimal algorithms for these problems. These observations affirmatively answer open questions posed in a CLUSTER 2023 *** problem is to broadcast n indivisible blocks of data from a given root processor to all other processors in a (subgraph of a) fully connected network of p processors with fully bidirectional, simultaneous send-receive, one-ported communication capabilities. In this model, n − 1 + ⌈log2p⌉ send-receive communication rounds are required. Our new algorithms work for any number of processors p, and compute for each processor in the network receive and send schedules each of size ⌈log2p⌉ that determine uniquely in O(1) time for each communication round the new block that the processor will receive, and the already received block it has to send. Schedule computations are done independently per processor without communication. The broadcast communication subgraph is an easily computable, directed, ⌈log2p⌉-regular circulant graph also used elsewhere. We show how the schedule computations can be done in optimal time and space of O(logp), improving significantly over previous results of O(plog2p) and O(log3p), respectively, for any number of processors. The schedule computation and broadcast algorithms are simple to implement, but correctness and complexity are not obvious. By dividing a given input of m Bytes into n indivisible blocks, the schedules are used for new, best possible pipelined implementations of the MPI (Message-Passing Interface) collectives MPI_Bcast, MPI_Reduce, MPI_Allgatherv, and MPI_Reduce_scatter. Indicative,
暂无评论