this article contains analysis and comparison of different standards that implement Single Sign-On technology in context of their applicability to constructing security infrastructure of a distributed information-comp...
详细信息
ISBN:
(纸本)9781509018413
this article contains analysis and comparison of different standards that implement Single Sign-On technology in context of their applicability to constructing security infrastructure of a distributed information-computing environment. Various non-proprietary protocols responsible for different aspects of secure information exchange were examined for creating a single authentication and authorization system in heterogeneous environment presented by a distributed network of portals.
We present the architecture of nreduce, a distributed virtual machine which uses parallel graph reduction to run programs across a set of computers. It executes code written in a simple functional language which suppo...
详细信息
ISBN:
(纸本)9780769530499
We present the architecture of nreduce, a distributed virtual machine which uses parallel graph reduction to run programs across a set of computers. It executes code written in a simple functional language which supports lazy evaluation and automatic parallelisation. the execution engine abstracts away details of parallelism and distribution, and uses JIT compilation to produce efficient code. this work is part of a broader project to provide a programming environment for developing distributedapplications which hides low-level details from the application developer the language we have designed plays the role of an intermediate form into which existing functional languages can be transformed. the runtime system demonstrates how distributed execution can be implemented directly within a virtual machine, instead of a separate piece of middleware that coordinates the execution of external programs.
the proceedings contain 202 papers. the topics discussed include: multi-relational graph convolutional networks for skeleton-based action recognition;identifying the right person in social networks with double metapho...
ISBN:
(纸本)9781665414852
the proceedings contain 202 papers. the topics discussed include: multi-relational graph convolutional networks for skeleton-based action recognition;identifying the right person in social networks with double metaphone codes;a novel strong cache consistency mechanism in ICN based on role division and lease model;demystifying the largest live game streaming platform via black-box measurement;framework-agnostic optimization of repeated skewed joins at massive scale;remote procedure call optimization of big data systems based on data awareness;MCSEC: secure coded matrix multiplication scheme for edge computing with minimum communication cost;low-rate DoS attack detection based on WPD-EE algorithm;user identity linkage across location-based social networks with spatio-temporal check-in patterns;optimizing 3-D placement of multiple UAVs based on Taguchi’s method;and feature envy detection based on Bi-LSTM with self-attention mechanism.
parallel programs based on the Divide & Conquer paradigm could be successfully defined in a simple way using powerlists. these parallel recursive data structures and their algebraic theories offer both a methodolo...
详细信息
In this paper, a parallel algorithm for RBF-based surface reconstruction from contours is presented. the reconstruction process is divided into local reconstruction and global reconstruction phases. In the local recon...
详细信息
ISBN:
(纸本)9781424415786
In this paper, a parallel algorithm for RBF-based surface reconstruction from contours is presented. the reconstruction process is divided into local reconstruction and global reconstruction phases. In the local reconstruction phase, surface patches are reconstructed from a set of adjacent slices of contours, these tasks are scheduled to be executed in parallel. In the global reconstruction phase, weighted function and local function values are evaluated in parallel. To balance the overload among CPUs or threads and get best parallelcomputing performance, the total sample points involved in task groups are distributed evenly. the experiment results show that the proposed schedule accelerate the reconstruction process greatly.
In the past five years, hosts on Internet have multiplied more than five times, and along withthe network's rapid expansion, more and more attention is paid to the challenging task of studying the topology charac...
详细信息
ISBN:
(纸本)0780378407
In the past five years, hosts on Internet have multiplied more than five times, and along withthe network's rapid expansion, more and more attention is paid to the challenging task of studying the topology characteristics of Internet infrastructure. Based on the features of Internet topology discovery and practical experience, we present a three-level distributed architecture for Internet router-level routing topology discovering system. We employ an integrated framework for the deployment of the system. We are examining, from a macroscopic point of view, what architecture is appropriate for this-like system, with an emphasis placed on the flexibility in practical work. the architecture enjoys the advantages of a clear train of thought and high modularization. Experiments show that this architecture has an instructive meaning for the development, deployment, and maintenance of Internet topology discovering system.
A multitenant Storm cluster runs multiple stream processing applications and uses the default Isolation Scheduler to schedule them. Isolation Scheduler assigns resources to topologies based on static resource configur...
详细信息
ISBN:
(纸本)9781450355490
A multitenant Storm cluster runs multiple stream processing applications and uses the default Isolation Scheduler to schedule them. Isolation Scheduler assigns resources to topologies based on static resource configuration and does not provide any means for prioritizing topologies based on their varying business requirements. thus, performance degradation, even complete starvation of topologies with high priority is possible when the cluster is resource constrained and comprises an inadequate number of resources. Two priority based resource scheduling techniques are proposed to overcome these problems. A performance analysis based on prototyping and measurements demonstrates the effectiveness of the proposed techniques.
the recent availability of low cost wearable augmented reality (WAR) technologies, is leveraging the design of applications in many different domains in order to support users in their daily activities. For most of th...
详细信息
ISBN:
(纸本)9781467394734
the recent availability of low cost wearable augmented reality (WAR) technologies, is leveraging the design of applications in many different domains in order to support users in their daily activities. For most of these domains, the large amount of information displayable on top of the reality, directly in the user's field of view, represents an important challenge for designers. In this paper we present a view management technique for placing touristic/cultural information, in the form of points of interest (POIs), in an AR system that works in the absence of a priori knowledge of the real environment. the user-driven view management technique, designed as a remote service, improves representation and displacement of the digital information each time the user manifests an interest in a particular area of the real space. the proposed approach includes a layout algorithm, which exploits the user's local position and her/his point of view direction, to correctly set the POI height in the user's view avoiding overlapping and cluttering, together with an adaptive rendering method, using information about the brightness of the area, that computes the visual appearance parameters of each virtual POI in order to improve its readability over the background.
Assume that each vertex of an arbitrary n-vertex tree T is assigned a nonnegative integer weight. this paper considers partitioning the vertices of tree T into p disjoint clusters such that the total weight of each cl...
详细信息
ISBN:
(纸本)9780769548791
Assume that each vertex of an arbitrary n-vertex tree T is assigned a nonnegative integer weight. this paper considers partitioning the vertices of tree T into p disjoint clusters such that the total weight of each cluster is at least l and at most u, where l and u are given integers with lthms for trees only allow that a cluster corresponds to a subtree, our algorithm also considers clusters containing several subtrees as long as these subtrees have the same parent node or their root vertices are adjacent siblings. We call this [l, u] sibling partitioning. We deal with two problems of [l, u] sibling partitioning for a given tree: the minimal partition problem is to find an [l, u] sibling partitioning withthe minimum number of clusters;the p-partition problem is to find an [l, u] sibling partitioning with a given number p of clusters. In this paper, we present the first polynomial-time algorithm to solve the two problems.
the proceedings contain 8 papers. the topics discussed include: accelerating domain propagation: an efficient GPU-parallel algorithm over sparse matrices;parallelizing irregular computations for molecular docking;redu...
ISBN:
(纸本)9780738110905
the proceedings contain 8 papers. the topics discussed include: accelerating domain propagation: an efficient GPU-parallel algorithm over sparse matrices;parallelizing irregular computations for molecular docking;reducing queuing impact in irregular data streaming applications;supporting irregularity in throughput-oriented computing by SIMT-SIMD integration;DistDGL: distributed graph neural network training for billion-scale graphs;labeled triangle indexing for efficiency gains in distributed interactive subgraph search;distributed memory graph coloring algorithms for multiple GPU;and performance evaluation of the vectorizable binary search algorithms on an FPGA platform.
暂无评论