A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Filters
Reliability Evaluation of Generalized Exchanged X-Cubes Based on the Condition of g-Good-Neighbor
2020
Wireless Communications and Mobile Computing
Furthermore, we study the Rg-connectivity and g-GNCD of generalized exchanged X-cubes under the PMC and MM∗ models. ...
The g-good-neighbor conditional connectivity (Rg-connectivity) is the minimum number of nodes that make the graph disconnected, and each node has at least g neighbors in every remaining component. ...
We first establish the R g -connectivity of generalized exchanged X-cubes. Next, we evaluate the g-GNCD of generalized exchanged X-cubes. ...
doi:10.1155/2020/9793082
fatcat:f2bx4a65gvckha74t65uyjyjwi
A New Cost Effective and Reliable Interconnection Topology for Parallel Computing Systems
2019
International Journal of Engineering and Advanced Technology
Topology of the of interconnection network is one of the most important considerations in the design of parallel systems as it is the backbone network over which the different components of the computer ...
The different reliability measures of TC are computed and found to be better as compared with its counterpart topologies and the parent topologies. ...
It is the most general communication method in which, the transmitted packet will be received by every node on the network. ...
doi:10.35940/ijeat.f8363.088619
fatcat:jbf7a4fp4zha3akd6r7rhw7ja4
The Component Diagnosability of General Networks
[article]
2021
arXiv
pre-print
As applications, the component diagnosability is explored for some well-known networks, including complete cubic networks, hierarchical cubic networks, generalized exchanged hypercubes, dual-cube-like ...
The h-component diagnosability of G, denoted by ct_h(G), is the maximum number of nodes of the faulty set F that is correctly identified in a system, and the number of components in G-F is at least h. ...
[22] proposed the h-good-neighbor conditional diagnosability, which is the diagnosability under the assumption that every fault-free processor has at least h fault-free neighbors. Zhao et al. ...
arXiv:2105.11895v1
fatcat:cdnfo6swu5avdbt4q3unlo7m5u
Measurement Data Comparison of Fast SAR Measurement System by Probe Arrays with Robot Scanning SAR Measurement System
2014
Journal of the Korean Institute of Electromagnetic Engineering and Science
Dosimetry of radiating electromagnetic wave from mobile devices to human body has been evaluated by measuring Specific Absorption Rate (SAR). ...
Usual SAR measurement system scans the volume by robot arm to evaluate RF power absorption to human body from wireless devices. ...
. | | | | | | | | (3) The basic principles of 3D SAR estimation from 2D data are based on the exponential decay of the propagating field in the heavily loss medium. ...
doi:10.5515/jkiees.2014.14.4.336
fatcat:7tvl25iqqfamljfilx2ytwst4y
Learned Point Cloud Geometry Compression
[article]
2019
arXiv
pre-print
Hyperpriors are used to improve the conditional probability modeling of latent features. ...
Additional ablation studies analyze a variety of aspects (e.g., cube size, kernels, etc) to explore the application potentials of our learned-PCGC. ...
We sample the mesh model into point clouds by randomly generating points on the surfaces of the mesh. ...
arXiv:1909.12037v1
fatcat:6z3fuh3ngbb2biaagwvzxhpg3a
A MEDIAN-BASED DEPTHMAP FUSION STRATEGY FOR THE GENERATION OF ORIENTED POINTS
2016
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
Due to good scalability, systems for image-based dense surface reconstruction often employ stereo or multi-baseline stereo methods. ...
Generally the single depth observations across the maps possess variances in quality. ...
Conditions are based on the coordinates c ′x , c ′ y , c ′ z of box center c ′ defined w.r.t. the coordinate system Φ. Right: Median filtering along the main filter direction np. ...
doi:10.5194/isprs-annals-iii-3-115-2016
fatcat:sxc7qw3ekrg3tfgowrl4kh3bdi
A MEDIAN-BASED DEPTHMAP FUSION STRATEGY FOR THE GENERATION OF ORIENTED POINTS
2016
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
Due to good scalability, systems for image-based dense surface reconstruction often employ stereo or multi-baseline stereo methods. ...
Generally the single depth observations across the maps possess variances in quality. ...
Conditions are based on the coordinates c ′x , c ′ y , c ′ z of box center c ′ defined w.r.t. the coordinate system Φ. Right: Median filtering along the main filter direction np. ...
doi:10.5194/isprsannals-iii-3-115-2016
fatcat:lao7e7pzmragrim3tagubmqkn4
Yield and performance enhancement through redundancy in VLSI and WSI multiprocessor systems
1986
Proceedings of the IEEE
In the second part of the paper we discuss models that evaluate how yield enhancement and reliability improvement may be achieved by certain fault-tolerant techniques. I . ...
Concerns about fault tolerance in VLSI-based systems stem from the two key factors of reliability and yield enhancements. Low yield is a problem of increasing significance as circuit density grows. ...
However, this would require giving up the use of seven good nodes. Alternatively, one can partition the 4-cube into 4 subnetworks of 2-cubes. ...
doi:10.1109/proc.1986.13532
fatcat:bycl775bmfb27i45ppqy4wykgy
The G-Good-Neighbor Local Diagnosability of a Hypercube Network under the PMC Model
2020
IEEE Access
Further, we easily derive the diagnosability of hypercube Q n under the g-good-neighbor condition. ...
A significant indicator used in evaluating the reliability of a multiprocessor system is fault diagnosability. ...
The maximum value of t that makes G g-good-neighbor conditionally t-diagnosable is the g-good-neighbor conditional diagnosability t g (G) of G. ...
doi:10.1109/access.2020.2974482
fatcat:zqwl3gyywnfdtbkcjslenst2ym
Finite element calculations on the single-domain limit of a ferromagnetic cube—a solution to μMAG Standard Problem No. 3
2002
Journal of Magnetism and Magnetic Materials
A further magnetization state resulting in the calculation is a vortex state with a singularity of the directional field of the magnetization. ...
Zero field states of the magnetization in a uniaxial ferromagnetic sample of cubic shape are calculated by means of micromagnetic finite element modeling. ...
In Fig. 3 , the field of the magnetic induction calculated for a homogeneously magnetized cube is displayed on a cross-section through the middle of the cube (x ¼ 0). ...
doi:10.1016/s0304-8853(01)00876-9
fatcat:ptjs55y6xvblxh3nxzsbnpmuga
A survey of key management in ad hoc networks
2006
IEEE Communications Surveys and Tutorials
The solution thus far is cryptographically signed messages. The general assumption is that nodes in possession of a valid secret key can be trusted. ...
Keys are also required for protection of application data. However, the focus here is on network-layer management information. ...
We also thank Leif Nilsen of the Univeristy of Oslo's University Graduate Centre/Thales Group Norway for valuable discussions and comments on our work. A special thanks to Prof. ...
doi:10.1109/comst.2006.253271
fatcat:zaobvvfiqzc2jovl7rozpplhxa
Using geometrical routing for overlay networking in MMOGs
2009
Multimedia tools and applications
We present our concept and design of hierarchical geometrical routing based on locality sensitive hashing, demonstrate its performance, and discuss both the strengths and shortcomings of our approach. ...
Fundamentally speaking, update message exchange is mostly based on users' visibility range, which is mainly affected by proximity; i.e., avatars are interested in nodes within a specific distance around ...
This usually implies the exchange of a small number of packets between neighboring nodes (3) The location of the destination Based on the above information, the forwarding node can determine which one ...
doi:10.1007/s11042-009-0312-x
fatcat:2gcjuoxuajditpmliwpebegyfa
Exchanged Crossed Cube: A Novel Interconnection Network for Parallel Computation
2013
IEEE Transactions on Parallel and Distributed Systems
A new interconnection network called exchanged crossed cube (ECQ) is proposed and analyzed in this paper. ...
The topology of interconnection networks plays a key role in the performance of parallel computing systems. ...
Based on the method of Case 1, we can construct the IETðt; sÞ, where t < s. ...
doi:10.1109/tpds.2012.330
fatcat:px3osd573jde5eg7upgm5xduou
Nearest Neighbors for Matrix Estimation Interpreted as Blind Regression for Latent Variable Model
[article]
2019
arXiv
pre-print
As the main result of this work, we introduce a nearest-neighbor-based estimation algorithm, and establish its consistency when the underlying latent function f is Lipschitz, the underlying latent space ...
Given noisy observations of a small, random subset of the matrix entries, our goal is to estimate the unobserved entries of the matrix as well as to "de-noise" the observed entries. ...
exchangeable models that additionally impose an additive noise model and regularity conditions on the function f θ in exchange for a more general latent space and associated probability measure. ...
arXiv:1705.04867v2
fatcat:vgi4rghohfec5kwmpj36gatute
A grid refinement approach for a three-dimensional soil-root water transfer model
2009
Water Resources Research
One way of reducing the computational effort is the usage of grid refinement techniques. ...
The root spatial distribution can therefore be used for refinement of the soil grid, a priori. ...
Dynamic A Priori Refinement Based on Active Root Segments [18] A third comparison evaluates dynamic a priori refinement based on active root segments. ...
doi:10.1029/2009wr007873
fatcat:rh2hol5wsncutp5nswrta5oc6i
« Previous
Showing results 1 — 15 out of 4,536 results