k-ary
On Embedding of m Sequential k ary Trees into Hypercubes
... The most common type of tree is the binary tree. It is so named because each node can have at most two des- cendents. Binary trees are widely used in data structures because they are easily stored, easily manipulated and ...
5
Parallel Hermite Interpolation on Faulty K-ary n-cubes Network
... using K-ary n-cube, The algorithm consisting of O k ( n + kn ) steps, each with 4 multiplications and subtractions, for N= k n node ...
10
KT-ORAM: A Bandwidth-efficient ORAM Built on K-ary Tree of PIR Nodes
... a k-ary tree with each node acting as a fully-functional PIR storage, and adopts a novel delayed eviction technique to optimize the eviction ...parameter k = log N ...
22
Parallel Implementation of the Gauss Seidel Algorithm on k Ary n Cube Machine
... the k-ary n-cube machine in order to change the interconnection network topology of parallel/ computing, and develop a cluster-based Gauss-Seidel algorithm, which is suitable for the parallel ...
6
A general analytical model of adaptive wormhole routing in k-ary n-cubes
... A message is blocked at a given channel when all the adaptive virtual channels of the remaining dimensions to be visited and also the deterministic virtual channels of the lowest dimension still to be visited are busy. ...
8
Optimization of Hierarchical Regression Model with Application to Optimizing Multi-Response Regression K-ary Trees
... A fast, convenient and well-known way toward regression is to induce and prune a binary tree. However, there has been lit- tle attempt toward improving the performance of an induced regression tree. This paper presents a ...
10
On extensions of mollified Boltzmann and Smoluchowski equations to particle systems with a k ary interaction
... ties with respect to Lebesgue measure dv one can easily rewrite this equation in the strong form used e.g. in [Am] or [LW]. The results on the well-posedness and the propagation of chaos property that follow from Theorem ...
35
Efficient Interval Check in the Presence of Malicious Adversaries
... Our major contribution is a private interval check protocol in the malicious model, where interval is not confined to an integer interval but a union of integer intervals. The major challenge is to first “compress” ...
17
Tree-Based Management of Revoked Certificates in Vehicular Ad-hoc Networks
... Abstract—A dynamic authenticated data structure based on k-ary trees is here proposed to improve the performance of certificate revocation in vehicular ad-hoc networks. Such a structure allows taking ...
6
Noise Stability is Computable and Approximately Low-Dimensional
... Given the wide applicability of Borell’s isoperimetric result to combinatorics and theoretical computer science, we believe that Theorem 2.2 will also be widely applicable. We will now point out some applications of this ...
47
On Parity based Divide and Conquer Recursive Functions
... tree, k number of subtrees have their sizes of either ⌈ (n − 1)/k ⌉ or ⌊ (n − 1)/k ⌋ ...[3], k-ary leave-one-out divide and conquer are categorized as simply k-ary ...
6
Online Full Text
... plete K-ary linking pin structure of height H (H = 2, 3, · · · ) where every pair of siblings in a complete K- ary tree of height H is adjacent: (i) a model of adding an edge between two nodes ...
6
Application driven evaluation of network on chip architectures for parallel signal processing
... Abstract. Today’s signal processing applications exhibit steadily increasing throughput requirements which can be achieved by parallel architectures. However, efficient com- munication is mandatory to fully exploit their ...
6
A Model of Placing a Liaison between Two Levels in a Pyramid Organization Structure with Subordinates
... complete K-ary tree of height H : (i) a model of adding a node of liaison which gets adjacent to two nodes with the same depth [9] and (ii) a model of adding a node of liaison which gets adjacent to all ...
5
Geometry of flocks and \(n\)-ary groups
... In the case when a flock is defined by (7), as a simple consequence of the above lemmas we obtain the Kulazhenko’s result proved in [16]. Theorem 4.4. (Kulazhenko) For n > 2 an n-ary group (G, f) is semia- ...
15
Distributed generation (DG) placement for reducing power losses on radial distribution system using K means Clustering method
... of K cluster is defined ...Furthermore, K- means test each LSF and dV of each bus and classify it into one of the predetermined centroid based on the minimum distance between data object with each existing ...
8
Distribution and drug resistance of pathogenic bacteria in ventilator-associated pneumonia at a local hospital of North-eastern China
... Patients and methods: Lower respiratory tract secretions from 156 patients with mechanical ventilation were collected using a protective specimen brush (PSB), with quantitative bacterial culture carried out and ...
7
An Adaptive Steganographic Method Using Additive Noise
... Abstract: This paper proposed an adaptive multi-ary steganographic method based on additive noise to ensure the security of secret information. In order to minimizing the distortion caused by embedding operations, ...
9
Tolerance of Escherichia coli to Fluoroquinolone Antibiotics Depends on Specific Components of the SOS Response Pathway
... Akerlund, T., K. Bernander, 1995 Analysis of cell size and DNA content in exponentially growing and station- ary-phase batch cultures of Escherichia coli. Okumura et al. , 2006 Construct[r] ...
16
Semiabelian and self-returning of points of \(n\)-ary groups
... A b s t r a c t . In this article new criterian Semiabelian of n-ary Groups is expressed through Self-Returning free point comparatively element specially built to sequences, consisting of mediums of all sides ...
10