scholarly journals Security of search and verification protocol in multidimensional blockchain

2021 ◽  
Vol 20 (4) ◽  
pp. 793-819
Author(s):  
Ilya Shilov ◽  
Danil Zakoldaev
Keyword(s):  
Connected Graph ◽  
Data Exchange ◽  
Security Evaluation ◽  
Network Graph ◽  
Connected Network ◽  
Subset Principle ◽  
Speed Up ◽  
Evaluation Of Data ◽  
Fully Connected ◽  
Verification Techniques

The issue of secure data exchange and performing external transactions between robust distributed ledgers has recently been among the most significant in the sphere of designing and implementing decentralized technologies. Several approaches have been proposed to speed up the process of verifying transactions on adjacent blockchains. The problem of search has not been under research yet. The paper contains security evaluation of data exchange between independent robust distributed ledgers inside multidimensional blockchain. Main principles, basic steps of the protocol and major requirements for it are observed: centralized approach, subset principle and robust SVP. An equivalence of centralized approach and ideal search and verification functionality is proven. The probability of successful verification in case of using fully connected network graph or equivalent approach with fully connected graph between parent and child blockchain is shown. The insecurity of approach with one-to-one links between child and parent ledgers or with a subset principle is proven. A robust search and verification protocol for blocks and transactions based on the features of robust distributed ledgers is presented. The probability of attack on this protocol is mostly defined by the probability of attack on verification and not on search. An approach to protection against an attacker with 50% of nodes in the network is given. It is based on combination of various search and verification techniques.

A GA-Based Pruning Fully Connected Network for Tuned Connections in Deep Networks

2019 ◽  
Author(s):  
Amin Khatami ◽  
Parham M. Kebria ◽  
Seyed Mohammad Jafar Jalali ◽  
Abbas Khosravi ◽  
Asef Nazari ◽  
...  
Keyword(s):  
Connected Network ◽  
Deep Networks ◽  
Fully Connected

scholarly journals Fully connected network of superconducting qubits in a cavity

2008 ◽  
Vol 10 (11) ◽  
pp. 113020 ◽  
Author(s):  
Dimitris I Tsomokos ◽  
Sahel Ashhab ◽  
Franco Nori
Keyword(s):  
Superconducting Qubits ◽  
Connected Network ◽  
Fully Connected

scholarly journals THE HEIDER BALANCE: A CONTINUOUS APPROACH

2005 ◽  
Vol 16 (05) ◽  
pp. 707-716 ◽  
Author(s):  
KRZYSZTOF KUŁAKOWSKI ◽  
PRZEMYSŁAW GAWROŃSKI ◽  
PIOTR GRONEK
Keyword(s):  
Connected Graph ◽  
Social Group ◽  
Statistical Data ◽  
Structure Theorem ◽  
System Size ◽  
Random Numbers ◽  
Continuous Approach ◽  
Internal Relations ◽  
Group Members ◽  
Fully Connected

The Heider balance (HB) is investigated in a fully connected graph of N nodes. The links are described by a real symmetric array r (i, j), i, j =1, …, N. In a social group, nodes represent group members and links represent relations between them, positive (friendly) or negative (hostile). At the balanced state, r (i, j) r (j, k) r (k, i) > 0 for all the triads (i, j, k). As follows from the structure theorem of Cartwright and Harary, at this state the group is divided into two subgroups, with friendly internal relations and hostile relations between the subgroups. Here the system dynamics is proposed to be determined by a set of differential equations, [Formula: see text]. The form of equations guarantees that once HB is reached, it persists. Also, for N =3 the dynamics reproduces properly the tendency of the system to the balanced state. The equations are solved numerically. Initially, r (i, j) are random numbers distributed around zero with a symmetric uniform distribution of unit width. Calculations up to N =500 show that HB is always reached. Time τ(N) to get the balanced state varies with the system size N as N-1/2. The spectrum of relations, initially narrow, gets very wide near HB. This means that the relations are strongly polarized. In our calculations, the relations are limited to a given range around zero. With this limitation, our results can be helpful in an interpretation of some statistical data.

SUPER SPANNING CONNECTIVITY OF THE FULLY CONNECTED CUBIC NETWORKS

2010 ◽  
Vol 11 (01n02) ◽  
pp. 61-70 ◽  
Author(s):  
CHERNG CHIN ◽  
HUAI-CHIH CHEN ◽  
LIH-HSING HSU ◽  
SHANG-CHIA CHIOU ◽  
KUO-TUNG LAI
Keyword(s):  
Connected Graph ◽  
Disjoint Paths ◽  
Fully Connected

A k-containerC(u, v) of G between u and v is a set of k internally disjoint paths between u and v. A k-container C(u,v) of G is a k*-container if it contains all vertices of G. A graph G is k*-connected if there exists a k*-container between any two distinct vertices. The spanning connectivity of G, κ*(G), is defined to be the largest integer k such that G is w*-connected for all 1 ≤ w ≤ k if G is a 1*-connected graph and undefined otherwise. A graph G is super spanning connected if κ* (G) = κ(G). In this paper, we prove that the n-dimensional fully connected cubic network FCCNn is super spanning connected.

scholarly journals It may be time to improve the neuron of artificial neural network

2020 ◽  
Author(s):  
Gang Liu
Keyword(s):  
Single Neuron ◽  
Receptive Fields ◽  
Generalization Capability ◽  
Artificial Neuron ◽  
In Series ◽  
Linear Module ◽  
Speed Up ◽  
Basic Functions ◽  
Artificial Neural ◽  
Fully Connected

<p>Artificial neural networks (ANNs) have won numerous contests in pattern recognition, machine learning, or artificial intelligence in recent years. The neuron of ANNs was designed by the stereotypical knowledge of biological neurons 70 years ago. Artificial Neuron is expressed as f(wx+b) or f(WX). This design does not consider dendrites' information processing capacity. However, some recent studies show that biological dendrites participate in the pre-calculation of input data. Concretely, biological dendrites play a role in extracting the interaction information among inputs (features). Therefore, it may be time to improve the neuron of ANNs. According to our previous studies (DD), this paper adds the dendrites' function to artificial Neuron. The dendrite function can be expressed as W<sup>i,i-1</sup>A<sup>i-1</sup> ○ A<sup>0|1|2|...|i-1</sup> . The generalized new neuron can be expressed as f(W(W<sup>i,i-1</sup>A<sup>i-1</sup> ○ A<sup>0|1|2|...|i-1</sup>)).The simplified new neuron be expressed as f(∑(WA ○ X)). After improving the neuron, there are so many networks to try. This paper shows some basic architecture for reference in the future. </p> <p>Interesting things: (1) The computational complexity of dendrite modules (W<sup>i,i-1</sup>A<sup>i-1</sup> ○ A<sup>i-1</sup>) connected in series is far lower than Horner's method. Will this speed up the calculation of basic functions in computers? (2) The range of sight of animals has a gradient, but the convolution layer does not have this characteristic. This paper proposes receptive fields with a gradient. (3) The networks using Gang neurons can delete traditional networks' Fully-connected Layer. In other words, the Fully-connected Layers' parameters are assigned to a single neuron, which reduces the parameters of a network for the same mapping capacity. </p><p>One important thing: ResDD can replace the current all ANNs' Neurons (ResDD modules+One Linear module)! ResDD has controllable precision for better generalization capability! </p><p>Gang neuron code is available at https://github.com/liugang1234567/Gang-neuron.</p>

scholarly journals Investigasi Pengaruh Skema Stride dan Step Training untuk Deteksi Jari Pada Region-based Fully Convolutional Network (R-FCN) dalam Teknologi Augmented Reality

2021 ◽  
Vol 12 (2) ◽  
pp. 138
Author(s):  
Hashfi Fadhillah ◽  
Suryo Adhi Wibowo ◽  
Rita Purnamasari
Keyword(s):  
Deep Learning ◽  
Augmented Reality ◽  
Virtual World ◽  
Training Data ◽  
Convolutional Network ◽  
Fully Convolutional Network ◽  
Connected Network ◽  
Learning Region ◽  
Centroid Point ◽  
Fully Connected

Abstract  Combining the real world with the virtual world and then modeling it in 3D is an effort carried on Augmented Reality (AR) technology. Using fingers for computer operations on multi-devices makes the system more interactive. Marker-based AR is one type of AR that uses markers in its detection. This study designed the AR system by detecting fingertips as markers. This system is designed using the Region-based Deep Fully Convolutional Network (R-FCN) deep learning method. This method develops detection results obtained from the Fully Connected Network (FCN). Detection results will be integrated with a computer pointer for basic operations. This study uses a predetermined step scheme to get the best IoU parameters, precision and accuracy. The scheme in this study uses a step scheme, namely: 25K, 50K and 75K step. High precision creates centroid point changes that are not too far away. High accuracy can improve AR performance under conditions of rapid movement and improper finger conditions. The system design uses a dataset in the form of an index finger image with a configuration of 10,800 training data and 3,600 test data. The model will be tested on each scheme using video at different distances, locations and times. This study produced the best results on the 25K step scheme with IoU of 69%, precision of 5.56 and accuracy of 96%.Keyword: Augmented Reality, Region-based Convolutional Network, Fully Convolutional Network, Pointer, Step training Abstrak Menggabungkan dunia nyata dengan dunia virtual lalu memodelkannya bentuk 3D merupakan upaya yang diusung pada teknologi Augmented Reality (AR). Menggunakan jari untuk operasi komputer pada multi-device membuat sistem yang lebih interaktif. Marker-based AR merupakan salah satu jenis AR yang menggunakan marker dalam deteksinya. Penelitian ini merancang sistem AR dengan mendeteksi ujung jari sebagai marker. Sistem ini dirancang menggunakan metode deep learning Region-based Fully Convolutional Network (R-FCN). Metode ini mengembangkan hasil deteksi yang didapat dari Fully Connected Network (FCN). Hasil deteksi akan diintegrasikan dengan pointer komputer untuk operasi dasar. Penelitian ini menggunakan skema step training yang telah ditentukan untuk mendapatkan parameter IoU, presisi dan akurasi yang terbaik. Skema pada penelitian ini menggunakan skema step yaitu: 25K, 50K dan 75K step. Presisi tinggi menciptakan perubahan titik centroid yang tidak terlalu jauh. Akurasi  yang tinggi dapat meningkatkan kinerja AR dalam kondisi pergerakan yang cepat dan kondisi jari yang tidak tepat. Perancangan sistem menggunakan dataset berupa citra jari telunjuk dengan konfigurasi 10.800 data latih dan 3.600 data uji. Model akan diuji pada tiap skema dilakukan menggunakan video pada jarak, lokasi dan waktu yang berbeda. Penelitian ini menghasilkan hasil terbaik pada skema step 25K dengan IoU sebesar 69%, presisi sebesar 5,56 dan akurasi sebesar 96%.Kata kunci: Augmented Reality, Region-based Convolutional Network, Fully Convolutional Network, Pointer, Step training 

scholarly journals An Approach to the Extremal Inverse Degree Index for Families of Graphs with Transformation Effect

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Muhammad Asif ◽  
Muhammad Hussain ◽  
Hamad Almohamedh ◽  
Khalid M. Alhamed ◽  
Sultan Almotairi
Keyword(s):  
Computer Program ◽  
Regular Graph ◽  
Connected Graph ◽  
Topological Index ◽  
Unicyclic Graph ◽  
Fixed Length ◽  
Inverse Degree ◽  
Fully Connected

The inverse degree index is a topological index first appeared as a conjuncture made by computer program Graffiti in 1988. In this work, we use transformations over graphs and characterize the inverse degree index for these transformed families of graphs. We established bonds for different families of n -vertex connected graph with pendent paths of fixed length attached with fully connected vertices under the effect of transformations applied on these paths. Moreover, we computed exact values of the inverse degree index for regular graph specifically unicyclic graph.

scholarly journals Application of MVP Architecture in Developing Android-Based Seminar Ticket Booking Applications

2020 ◽  
Vol 4 (3) ◽  
pp. 513-520
Author(s):  
I Made Sukarsa ◽  
I Nyoman Piarsa ◽  
I Gede Bagus Premana Putra
Keyword(s):  
Communication Technology ◽  
Data Exchange ◽  
Architecture Model ◽  
Web Service Security ◽  
Loss And Damage ◽  
Information And Communication ◽  
Speed Up ◽  
Android Applications ◽  
E Mail ◽  
Model View

The success of an event, especially a seminar cannot be separated from the success of the organizer to get participants. The scattered challenges faced by the seminar organizers are closely related to the ease and convenience of the procedures applied to order seminar tickets to prospective participants. So that the application of information and communication technology is needed by the organizer as a tool to provide convenience and comfort to prospective participants. Ticket reservations are generally done manually and still use tickets in printed. An application is needed to speed up and simplify the ticket booking process for prospective participants. To solve this problem, prospective seminar participants will use the seminar ticket booking application via a smartphone device. This application uses the RESTful API on the Laravel framework, as one of the implementations of web service. Security of data exchange between android devices and web services using Laravel Passport, as a token generator API. The architecture that is applied in the development of android applications is the MVP architecture (Model, View, Presenter). Using QR-codes on tickets and sending tickets via e-mail participants can also avoid the possibility of loss and damage to tickets obtained by participants.

Sign in / Sign up

Export Citation Format

Share Document