scholarly journals A Simple Visualization Method for Three-Dimensional (3D) Network

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Sangkwon Kim ◽  
Chaeyoung Lee ◽  
Jintae Park ◽  
Sungha Yoon ◽  
Yongho Choi ◽  
...  

The network is a concept that can be seen a lot in many areas of research. It is used to describe and interpret datasets in various fields such as social network, biological network, and metabolic regulation network. As a result, network diagrams appeared in various forms, and methods for visualizing the network information are being developed. In this article, we present a simple method with a weight of information data to visualize the network diagram for the three-dimensional (3D) network. The generic method of network visualization is a circular representation with many intersections. When dealing with a lot of data, the three-dimensional network graphics, which can be rotated, are easier to analyze than the two-dimensional (2D) network. The proposed algorithm focuses on visualizing three factors: the position and size of the nodes and the thickness of the edge between linked nodes. In the proposed method, an objective function is defined, which consists of two parts to locate the nodes: (i) a constraint for given distance, which is the weight of the relationship among all the data, and (ii) the mutual repulsive force among the given nodes. We apply the gradient descent method to minimize the objective function. The size of the nodes and the thickness of the edges are defined by using the weight of each node and the weight between other nodes associated with it, respectively. To demonstrate the performance of the proposed algorithm, the relationships of the characters in the two novels are visualized using 3D network diagram.

CISM journal ◽  
1990 ◽  
Vol 44 (1) ◽  
pp. 9-18 ◽  
Author(s):  
Michael G. Sideris

The geoid and its horizontal derivatives, the deflections of the vertical, play an important role in the adjustment of geodetic networks. In the one-dimensional (1D) case, represented typically by networks of orthometric heights, the geoid provides the reference surface for the measurements. In the two-dimensional (2D) adjustment of horizontal control networks, the geoidal undulations N and deflections of the vertical ξ, η are needed for the reduction of the measured quantities onto the reference ellipsoid. In the three-dimensional (3D) adjustment, N and ξ, η are basically required to relate geodetic and astronomic quantities. The paper presents the major gravimetric methods currently used for predicting ξ, η and N, and briefly intercompares them in terms of accuracy, efficiency, and data required. The effects of N, ξ, η on various quantities used in the ID, 2D, and 3D network adjustments are described explicitly for each case and formulas are given for the errors introduced by either neglecting or using erroneous N, ξ, η in the computational procedures.


2013 ◽  
Vol 22 (04) ◽  
pp. 1350016 ◽  
Author(s):  
MICHAEL O. AGYEMAN ◽  
ALI AHMADINIA ◽  
ALIREZA SHAHRABI

Three-dimensional Network-on-Chip (3D NoC) architectures have gained a lot of popularity to solve the on-chip communication delays of next generation System-on-Chip (SoC) systems. However, the vertical interconnects of 3D NoC are expensive and complex to manufacture. Also, 3D router architecture consumes more power and occupies more area per chip floorplan compared to a 2D router. Hence, more efficient architectures should be designed. In this paper, we propose area efficient and low power 3D heterogeneous NoC architectures, which combines both the power and performance benefits of 2D routers and 3D NoC-bus hybrid router architectures in 3D NoC architectures. Experimental results show a negligible penalty (less than 5%) in average packet latency of the proposed heterogeneous 3D NoC architectures compared to typical homogeneous 3D NoCs, while the heterogeneity provides power and area efficiency of up to 61% and 19.7%, respectively.


2017 ◽  
Vol 8 (3) ◽  
Author(s):  
S. N. Pelykh ◽  
E. A. Odrehovska ◽  
O. B. Maksymova

This article is regarded to the search for the best power control program at nuclear power plant (NPP) with VVER- 1000 by gradient descent method for the objective function, which includes the criteria of efficiency, safety and damage. Criteria normalization to the maximum value is carried out when looking for the minimum of the objective function because criteria have different physical nature. There were chosen such objective criteria as depth of fuel burn-up, index of the fuel cladding damage and axial offset - the ratio of the energy at the top and bottom of the reactor core.


Geophysics ◽  
2010 ◽  
Vol 75 (4) ◽  
pp. S131-S137 ◽  
Author(s):  
Yanfei Wang ◽  
Changchun Yang

New solution methods were considered for migration deconvolution in seismic imaging problems. It is well known that direct migration methods, using the adjoint operator [Formula: see text], yield a lower-resolution or blurred image, and that the linearized inversion of seismic data for the reflectivity model usually requires solving a (regularized) least-squares migration problem. We observed that the (regularized) least-squares method is computationally expensive, which becomes a severe obstacle for practical applications. Iterative gradient-descent methods were studied and an efficient method for migration deconvolution was developed. The problem was formulated by incorporating regularizing constraints, and then a nonmonotone gradient-descent method was applied to accelerate the convergence. To test the potential of the application of the developed method, synthetic two-dimensional and three-dimensional seismic-migration-deconvolution simulations were performed. Numerical performance indicates that this method is promising for practical seismic migration imaging.


2008 ◽  
Vol 55-57 ◽  
pp. 669-672 ◽  
Author(s):  
S. Krachodnok ◽  
K.J. Haller ◽  
I.D. Williams

An inorganic-organic hybrid vanadate complex, Zn2(en)V2O7 (en = ethylenediamine) has been hydrothermally synthesized and characterized by single-crystal X-ray crystallography, TG analysis, IR spectroscopy, and elemental analysis. The title compound crystallizes in the monoclinic space group P21 with a = 7.0885(7), b = 8.6040(9), c = 8.1869(8) Å, b = 112.224(2)° and V = 462.22(8) Å3, T = 298±2 K and R1[I>2s(I)] = 0.0291 for 2170 observed reflections. The structure consists of undulating sheets constructed from helical chains that share Zn coordination centers with repeating units propagated into a helix by the two-fold screw axes at 0, y, ½ and pillared with alternating VO4 tetrahedra to generate a 3D chiral network. Neighboring helices are interconnected by µ2-O bridges to form the three-dimensional network. The strength of the network is reinforced by hydrogen bonding. TG analysis shows thermal stability of the network up to 283 °C.


2014 ◽  
Vol 16 (23) ◽  
pp. 11150-11161 ◽  
Author(s):  
Alan Filer ◽  
Hyun-Jung Choi ◽  
Jeong-Min Seo ◽  
Jong-Beom Baek

2 and 3D network polymers have demonstrated properties and much potential for use in electrocatalytic systems.


2019 ◽  
Vol 28 (05) ◽  
pp. 1950075 ◽  
Author(s):  
Junyan Tan ◽  
Chunhua Cai

Network-on-Chip (NoC) supplies a scalable and fast interconnect for the communication between the different IP cores in the System-on-Chip (SoC). With the growing complexity in consumer embedded systems, the emerging SoC architectures integrate more and more components for the different signal processing tasks. Two dimensional Network-on-Chip (2D NoC) becomes a bottleneck for the development of the SoC architecture because of its limitation on the area of chip and the long latency. In this case, SoC research is forcing on the exploration of three dimensions (3D) technology for developing the next generation of large SoC which integrates three dimensional Network-on-Chip (3D NoC) for the communication architecture. 3D design technology resolves the vertical inter-layer connection issue by Through-Silicon Vias (TSVs). However, TSVs occupy significant silicon area which limits the inter-layer links of the 3D NoC. Therefore, the task partitioning on 3D NoC must be judicious in large SoC design. In this paper, we propose an efficient layer-aware partitioning algorithm based on hypergraph (named ELAP-NoC) for the task partitioning with TSV minimization for 3D NoC architecture floorplanning. ELAP-NoC contains divergence stage and convergence stage. ELAP-NoC supplies firstly a multi-way min-cut partitioning to gradually divide a given design layer by layer in the divergence stage in order to get an initial solution, then this solution is refined in convergence stage. The experiments show that ELAP-NoC performs a better capacity in the partitioning of the different numbers of cores which supplies the first step for the 3D NoC floorplanning.


2021 ◽  
Vol 263 (1) ◽  
pp. 5858-5868
Author(s):  
Victor Kopiev ◽  
NIkolay Ostrikov ◽  
Stanislav Denisov ◽  
MIkhail Yakovets ◽  
Maxim Ipatov

The results of experimental and computational studies of the three-dimensional mean flow velocity profile influence on the impedance eduction are presented. In order to measure the three-dimensional velocity profile, the TsAGIâ€(tm)s “Interferometer with flow†facility was upgraded so that additional holes were made in one cross section of the rectangular duct. As a result, it became possible to measure the longitudinal flow velocity in this cross section along 6 lines using a Pitot tube or a hot wire anemometer. The full three-dimensional velocity profile is determined by interpolating the values measured.Experimental results of the velocity profile for various experiment conditions are presented. Based on the numerical solution of the three-dimensional Pridmore-Brown equation by means of Finite Element Method and the gradient descent method, the problem of impedance eduction are investigated. The influence of the flow velocity profile and the form of functional on the obtained impedance values are discussed. The impedance values educted by means of this approach are compared with the impedance values obtained using two-dimensional impedance eduction methods, which didnâ€(tm)t taking into account the three-dimensional non homogeneity of the flow velocity field.


RSC Advances ◽  
2019 ◽  
Vol 9 (2) ◽  
pp. 766-780 ◽  
Author(s):  
Lin Guo ◽  
Sheng-Shuai Gao ◽  
Qing-Da An ◽  
Zuo-Yi Xiao ◽  
Shang-Ru Zhai ◽  
...  

Hollow dopamine-derived cavities/Fe3O4 nanoparticles-encapsulated carbonaceous composites with self-generating 3D network structure were fabricated for potential application as excellent microwave absorbers.


2021 ◽  
Vol 11 (13) ◽  
pp. 6146
Author(s):  
Xiaozhou Zhou ◽  
Yu Jin ◽  
Lesong Jia ◽  
Chengqi Xue

In virtual reality, users’ input and output interactions are carried out in a three-dimensional space, and bare-hand click interaction is one of the most common interaction methods. Apart from the limitations of the device, the movements of bare-hand click interaction in virtual reality involve head, eye, and hand movements. Consequently, clicking performance varies among locations in the binocular field of view. In this study, we explored the optimal interaction area of hand–eye coordination within the binocular field of view in a 3D virtual environment (VE), and implemented a bare-hand click experiment in a VE combining click performance data, namely, click accuracy and click duration, following a gradient descent method. The experimental results show that click performance is significantly influenced by the area where the target is located. The performance data and subjective preferences for clicks show a high degree of consistency. Combining reaction time and click accuracy, the optimal operating area for bare-hand clicking in virtual reality is from 20° to the left to 30° to the right horizontally and from 15° in the upward direction to 20° in the downward direction vertically. The results of this study have implications for guidelines and applications for bare-hand click interaction interface designs in the proximal space of virtual reality.


Sign in / Sign up

Export Citation Format

Share Document