scholarly journals A New Method of the Logical Functions Minimization in the Polynomial Set-Theoretical Format. «Handshaking» Procedure

2021 ◽  
pp. 03-14
Author(s):  
Bohdan Ye. Rytsar ◽  
◽  
Artem O. Belovolov ◽  
Keyword(s):  
Hamming Distance ◽  
Suggested Method ◽  
New Method ◽  
Minimization Method ◽  
Polynomial Extension ◽  
Logic Functions ◽  
Logical Functions

A new minimization method of logic functions of n variables in polynomial set-theoretical format has been considered. The method based on the so-called “handshaking” procedure. This procedure reflects the iterative polynomial extension of two conjuncterms of different ranks, the Hamming distance between which can be arbitrary. The advantages of the suggested method are illustrated by the examples.

scholarly journals A Novel Graphical Technique for Combinational Logic Representation and Optimization

Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-12
Author(s):  
Vedhas Pandit ◽  
Björn Schuller
Keyword(s):  
Boolean Functions ◽  
Discrete Systems ◽  
Boolean Logic ◽  
Decision Diagrams ◽  
New Paradigm ◽  
Binary Decision ◽  
Graphical Technique ◽  
A New Technique ◽  
Logic Functions ◽  
Logical Functions

We present a new technique for defining, analysing, and simplifying digital functions, through hand-calculations, easily demonstrable therefore in the classrooms. It can be extended to represent discrete systems beyond the Boolean logic. The method is graphical in nature and provides complete ‘‘implementation-free” description of the logical functions, similar to binary decision diagrams (BDDs) and Karnaugh-maps (K-maps). Transforming a function into the proposed representations (also the inverse) is a very intuitive process, easy enough that a person can hand-calculate these transformations. The algorithmic nature allows for its computing-based implementations. Because the proposed technique effectively transforms a function into a scatter plot, it is possible to represent multiple functions simultaneously. Usability of the method, therefore, is constrained neither by the number of inputs of the function nor by its outputs in theory. This, being a new paradigm, offers a lot of scope for further research. Here, we put forward a few of the strategies invented so far for using the proposed representation for simplifying the logic functions. Finally, we present extensions of the method: one that extends its applicability to multivalued discrete systems beyond Boolean functions and the other that represents the variants in terms of the coordinate system in use.

scholarly journals Hybrid Neural-global Minimization Method of Logical Rule Extraction

1999 ◽  
Vol 3 (5) ◽  
pp. 348-356 ◽  
Author(s):  
Wlodzislaw Duch ◽  
◽  
Rafal Adamczak ◽  
KrzysAof Grabczewski ◽  
Grzegorz Zal
Keyword(s):  
Neural Networks ◽  
Hybrid Approach ◽  
Real Life ◽  
Rule Extraction ◽  
Global Minimization ◽  
Minimization Method ◽  
Life Problems ◽  
Multilayered Perceptron ◽  
Logical Functions ◽  
Logical Rules

Methodology of extraction of optimal sets of logical rules using neural networks and global minimization procedures has been developed. Initial rules are extracted using density estimation neural networks with rectangular functions or multilayered perceptron (MLP) networks trained with constrained backpropagation algorithm, transforming MLPs into simpler networks performing logical functions. A constructive algorithm called CMLP2LN is proposed, in which rules of increasing specificity are generated consecutively by adding more nodes to the network. Neural rule extraction is followed by optimization of rules using global minimization techniques. Estimation of confidence of various sets of rules is discussed. The hybrid approach to rule extraction has been applied to a number of benchmark and real life problems with very good results.

scholarly journals Card-Based Cryptographic Logical Computations Using Private Operations

2020 ◽  
Author(s):  
Hibiki Ono ◽  
Yoshifumi Manabe
Keyword(s):  
Cryptographic Protocols ◽  
The Other ◽  
General Logic ◽  
Private Values ◽  
Minimum Number ◽  
Logic Functions ◽  
Logical Functions

Abstract This paper proposes new card-based cryptographic protocols to calculate logic functions with the minimum number of cards using private operations under the semi-honest model. Though various card-based cryptographic protocols were shown, the minimum number of cards used in the protocol has not been achieved yet for many problems. Operations executed by a player where the other players cannot see are called private operations. Private operations have been introduced in some protocols to solve a particular problem or to input private values. However, the effectiveness of introducing private operations to the calculation of general logic functions has not been considered. This paper introduces three new private operations: private random bisection cuts, private reverse cuts, and private reveals. With these three new operations, we show that all of AND, XOR, and copy protocols are achieved with the minimum number of cards by simple three-round protocols. This paper then shows a protocol to calculate any logical functions using these private operations. Next, we consider protocols with malicious players.

scholarly journals Ontology as mapping of material world

2018 ◽  
Vol 44 ◽  
pp. 00055
Author(s):  
Irina Leshcheva ◽  
Dmitry Leshchev
Keyword(s):  
Conflict Resolution ◽  
Knowledge Bases ◽  
Structured Data ◽  
Suggested Method ◽  
New Method ◽  
Network Resources ◽  
Material World ◽  
Advantages And Disadvantages ◽  
Different Types

This paper reviews currently available approaches and methods of automated population and enrichment of ontologies or ontology-based knowledge bases by structured data stored in various heterogeneous sources. Advantages and disadvantages of each approach are pointed out. The results of the analysis allow concluding that the existing methods are not effective enough to solve practical problems. A new method suggested does not have any of the specified disadvantages. The suggested method allows integrating data from different types of sources and considering the distributed nature of data and the necessity of authentication during accessing network resources. The method also suggests a solution to the problem of integrated data conflict resolution so that it will reduce the complexity of populating and enriching ontologies using the collected data arrays, irrespective of the format in which data are stored or represented.

scholarly journals Realistic Virtual Cables in a 2D Environment Representing a 3D Virtual Reality

2018 ◽  
Vol 14 (08) ◽  
pp. 169
Author(s):  
Boris Ivanov Evstatiev
Keyword(s):  
Virtual Reality ◽  
Electrical Engineering ◽  
Control Point ◽  
Common Point ◽  
Suggested Method ◽  
New Method ◽  
Engineering Equipment ◽  
Realistic Representation ◽  
Realistic Visualization ◽  
2D Space

A new method for the realistic visualization of virtual cables in a 2D environment, which is representing a 3D virtual reality, is presented in this paper. They are described with two consecutive cubic Bezier curves, whose common point is movable. Experiment was carried out and the optimal proportions for the parameters of the curves were obtained in order to achieve a realistic representation of cables. The suggested method has been developed for and implemented in the Engine for Virtual Electrical Engineering Equipment. The obtained results show that it is easy to manipulate the route of the virtual cables in 2D space and that they look realistic for any position of the control point.

scholarly journals Efficient Querying from Weighted Binary Codes

2020 ◽  
Vol 34 (07) ◽  
pp. 12346-12353
Author(s):  
Zhenyu Weng ◽  
Yuesheng Zhu
Keyword(s):  
Great Improvement ◽  
Large Scale ◽  
Hamming Distance ◽  
New Method ◽  
Binary Codes ◽  
Search Efficiency ◽  
Efficient Computation ◽  
Hash Tables ◽  
Multi Index ◽  
Open Issue

Binary codes are widely used to represent the data due to their small storage and efficient computation. However, there exists an ambiguity problem that lots of binary codes share the same Hamming distance to a query. To alleviate the ambiguity problem, weighted binary codes assign different weights to each bit of binary codes and compare the binary codes by the weighted Hamming distance. Till now, performing the querying from the weighted binary codes efficiently is still an open issue. In this paper, we propose a new method to rank the weighted binary codes and return the nearest weighted binary codes of the query efficiently. In our method, based on the multi-index hash tables, two algorithms, the table bucket finding algorithm and the table merging algorithm, are proposed to select the nearest weighted binary codes of the query in a non-exhaustive and accurate way. The proposed algorithms are justified by proving their theoretic properties. The experiments on three large-scale datasets validate both the search efficiency and the search accuracy of our method. Especially for the number of weighted binary codes up to one billion, our method shows a great improvement of more than 1000 times faster than the linear scan.

Securing AES Accelerator from Key-Leaking Trojans on FPGA

2020 ◽  
Vol 11 (3) ◽  
pp. 84-105
Author(s):  
Manjith B.C. ◽  
Ramasubramanian N.
Keyword(s):  
Embedded Systems ◽  
Reconfigurable Computing ◽  
High Performance ◽  
Hamming Distance ◽  
Reconfigurable Hardware ◽  
New Method ◽  
Secret Key ◽  
Building Systems ◽  
Cloud Servers ◽  
Working Device

Reconfigurable hardware presents a useful platform for building systems with high performance and a secured nature. A new method for protecting 128-bit AES accelerator on FPGA for embedded systems and cloud servers is proposed. One of the major issues faced by the AES accelerator is the security of the key stored inside the FPGA memory. The article proposes a masking scheme which makes the secret key unidentifiable. With the new method of masking scheme, there is no way for an attacker to leak and identify the secret key from the working device through undetected hardware unit. To work with the masked key, a modified key expansion that maintains the throughput through a properly designed multistage pipelining is proposed. The proposed method takes the advantage of reconfigurable computing for flexible and provides security against key-leaking Trojans. The efficiency of the masked AES implementation is found to be 28.5 Mbps, which is 17.87% higher than the existing best wok. The security of the proposed masked scheme is validated through correlation and hamming distance.

scholarly journals Privacy Protection for Personal Health Device Communication and Healthcare Building Applications

2014 ◽  
Vol 2014 ◽  
pp. 1-5 ◽  
Author(s):  
Soon Seok Kim ◽  
Yong Hee Lee ◽  
Jong Mo Kim ◽  
Deok Seok Seo ◽  
Gwang Hee Kim ◽  
...  
Keyword(s):  
Privacy Protection ◽  
Suggested Method ◽  
New Method ◽  
Basic Data ◽  
Personal Health ◽  
Patient Privacy ◽  
Valuable Resource ◽  
International Standard ◽  
Health Device ◽  
Ieee 11073

This paper proposes a new method for protecting patient privacy when communicating with a gateway which collects bioinformation through using personal health devices, a type of biosensor for telemedicine, at home and in other buildings. As the suggested method is designed to conform with ISO/IEEE 11073-20601, which is the international standard, interoperability with various health devices was considered. We believe it will be a highly valuable resource for dealing with basic data because it suggests an additional standard for security with the Continua Health Alliance or related international groups in the future.

scholarly journals Método Rápido de Preparação para Determinação de Argilominerais em Solos

1981 ◽  
Vol 5 ◽  
pp. 82-90
Author(s):  
Antonio Jácome de Castro
Keyword(s):  
Iron Oxides ◽  
Clay Mineral ◽  
Chemical Treatment ◽  
Suggested Method ◽  
New Method ◽  
X Ray

This paper presents a new method of sizing, that can be used within the range of sittand clay, and is carried through seivinq plus a chemical treatment in order to remove the iron oxides within the clay mineral. The obtained results are indeed very reasonable bearing. In mind that the comparison between the X-Ray difratograms of the analyses done by both (i) the suggested method and (ii) the classical dispersion (aquous) method, were equivalent.

Sign in / Sign up

Export Citation Format

Share Document