scholarly journals A Proof “P≠NP” for P vs. NP Problem by Multiple-Tape Turing-Machine

2020 ◽  
Vol 12 (4) ◽  
pp. 1
Author(s):  
Yaozhi Jiang
Keyword(s):  
Parallel Processing ◽  
Turing Machine ◽  
Time Complexity ◽  
Research Direction ◽  
Space Complexity ◽  
Brute Force ◽  
Computation Complexity ◽  
Serial Processing ◽  
Np Problem ◽  
Important Research Direction

P vs. NP problem is very important research direction in computation complexity theory. In this paper author, by an engineer’s viewpoint, establishes universal multiple-tape Turing-machine and k-homogeneous multiple-tape Turing-machine, and by them we can obtain an unified mathematical model for algorithm-tree, from the unified model for algorithm-tree, we can conclude that computation complexity for serial processing NP problem if under parallel processing sometimes we can obtain P=NP  in time-complexity, but that will imply another NP, non-deterministic space-complexity NP, i.e., under serial processing P≠NP  in space-complexity, and the result is excluded the case of NP problem that there exists a faster algorithm to replace the brute-force algorithm, and hence we can proof that under parallel processing time-complexity is depended on space-complexity, and vice verse, within P vs. NP problem, this point is just the natural property of P vs. NP problem so that “P≠NP ”.

scholarly journals Efisiensi Algoritma dan Notasi O-Besar

2011 ◽  
Vol 2 (2) ◽  
pp. 849 ◽  
Author(s):  
Subandijo Subandijo
Keyword(s):  
Time Complexity ◽  
Space Complexity ◽  
Brute Force ◽  
Running Time ◽  
Complexity Function

Efficiency or the running time of an algorithm is usually calculated with time complexity or space complexity as a function of various inputs. It is common to estimate their complexity in the asymptotic sense, i.e., to estimate the complexity function for arbitrarily large input. Brute-force algorithm is the easiest way to calculate the performance of the algorithm. However, it is not recommended since it does not sufficiently explain the efficiency of the algorithm. Asymptotic estimaties are used because different implementations of the same algorithm may differ in efficiency. The big-O notation is used to generate the estimation. 

BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS

2005 ◽  
Vol 16 (03) ◽  
pp. 441-451 ◽  
Author(s):  
J.-M. CHAMPARNAUD ◽  
F. COULON ◽  
T. PARANTHOËN
Keyword(s):  
Time Complexity ◽  
Regular Expression ◽  
Blow Up ◽  
Finite Automata ◽  
A Priori ◽  
Search Algorithms ◽  
Space Complexity ◽  
Brute Force ◽  
Practical Applications ◽  
Space And Time

Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of determinization. There exist solutions to control the space and time complexity like the so called "on the fly" determinization. Another solution consists in performing brute force determinization, which is robust and technically fast, although a priori its space complexity constitutes a weakness. However, one can reduce this complexity by perfoming a partial brute force determinization. This paper provides optimizations that consist in detecting classes of unreachable states and transitions of the subset automaton, which leads in average to an exponential reduction of the complexity of brute force and partial brute force determinization.

scholarly journals 2D and 3D Palmprint and Palm Vein Recognition Based on Neural Architecture Search

2021 ◽  
Author(s):  
Wei Jia ◽  
Wei Xia ◽  
Yang Zhao ◽  
Hai Min ◽  
Yan-Xiang Chen
Keyword(s):  
Deep Learning ◽  
Recognition Performance ◽  
Research Direction ◽  
Palmprint Recognition ◽  
Neural Architecture ◽  
Development Direction ◽  
Vein Recognition ◽  
Palm Vein ◽  
2D And 3D ◽  
Important Research Direction

AbstractPalmprint recognition and palm vein recognition are two emerging biometrics technologies. In the past two decades, many traditional methods have been proposed for palmprint recognition and palm vein recognition and have achieved impressive results. In recent years, in the field of artificial intelligence, deep learning has gradually become the mainstream recognition technology because of its excellent recognition performance. Some researchers have tried to use convolutional neural networks (CNNs) for palmprint recognition and palm vein recognition. However, the architectures of these CNNs have mostly been developed manually by human experts, which is a time-consuming and error-prone process. In order to overcome some shortcomings of manually designed CNN, neural architecture search (NAS) technology has become an important research direction of deep learning. The significance of NAS is to solve the deep learning model’s parameter adjustment problem, which is a cross-study combining optimization and machine learning. NAS technology represents the future development direction of deep learning. However, up to now, NAS technology has not been well studied for palmprint recognition and palm vein recognition. In this paper, in order to investigate the problem of NAS-based 2D and 3D palmprint recognition and palm vein recognition in-depth, we conduct a performance evaluation of twenty representative NAS methods on five 2D palmprint databases, two palm vein databases, and one 3D palmprint database. Experimental results show that some NAS methods can achieve promising recognition results. Remarkably, among different evaluated NAS methods, ProxylessNAS achieves the best recognition performance.

Towards effective link prediction: A hybrid similarity model

2020 ◽  
pp. 1-14
Author(s):  
Longjie Li ◽  
Lu Wang ◽  
Hongsheng Luo ◽  
Xiaoyun Chen
Keyword(s):  
Link Prediction ◽  
Structural Similarity ◽  
Research Direction ◽  
Structural Features ◽  
Proposed Model ◽  
Similarity Model ◽  
Weight Calculation ◽  
Stable Performance ◽  
Grey Relation ◽  
Important Research Direction

Link prediction is an important research direction in complex network analysis and has drawn increasing attention from researchers in various fields. So far, a plethora of structural similarity-based methods have been proposed to solve the link prediction problem. To achieve stable performance on different networks, this paper proposes a hybrid similarity model to conduct link prediction. In the proposed model, the Grey Relation Analysis (GRA) approach is employed to integrate four carefully selected similarity indexes, which are designed according to different structural features. In addition, to adaptively estimate the weight for each index based on the observed network structures, a new weight calculation method is presented by considering the distribution of similarity scores. Due to taking separate similarity indexes into account, the proposed method is applicable to multiple different types of network. Experimental results show that the proposed method outperforms other prediction methods in terms of accuracy and stableness on 10 benchmark networks.

Preparation and Properties of Alginate Fibre

2011 ◽  
Vol 335-336 ◽  
pp. 419-422 ◽  
Author(s):  
Yuan Lian ◽  
Jian Yi Wu ◽  
Da Peng Zhou ◽  
Hong Mei Wang ◽  
Dian Wu Huang ◽  
...  
Keyword(s):  
Research Direction ◽  
Biological Properties ◽  
Wet Spinning ◽  
Structure And Properties ◽  
Important Research ◽  
Preparation Technology ◽  
Thermal Gravimetric Analyzer ◽  
Infrared Spectrometer ◽  
Medical Materials ◽  
Important Research Direction

Alginate fibre has attracted great attention in the area of biological medical materials due to its unique biological properties. But its low tenacity greatly hinders its application area. Therefore, the preparation technology of alginate fibre has been as an important research direction in this area in recent years. The purpose of this article is to prepare the calcium alginate fibre with good properties by wet spinning. The structure and properties of this fibre are analyzed by scanning electron microscope，infrared spectrometer，thermal gravimetric analyzer and DSC.

scholarly journals Efficient Nonrecursive Bit-Parallel Karatsuba Multiplier for a Special Class of Trinomials

VLSI Design ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-7 ◽  
Author(s):  
Yin Li ◽  
Yu Zhang ◽  
Xiaoli Guo
Keyword(s):  
Time Delay ◽  
Special Class ◽  
Time Complexity ◽  
Space Complexity ◽  
Polynomial Basis ◽  
Gate Delay ◽  
Complexity Bound ◽  
Parallel Multiplier ◽  
Highly Efficient ◽  
First Time

Recently, we present a novel Mastrovito form of nonrecursive Karatsuba multiplier for all trinomials. Specifically, we found that related Mastrovito matrix is very simple for equally spaced trinomial (EST) combined with classic Karatsuba algorithm (KA), which leads to a highly efficient Karatsuba multiplier. In this paper, we consider a new special class of irreducible trinomial, namely, xm+xm/3+1. Based on a three-term KA and shifted polynomial basis (SPB), a novel bit-parallel multiplier is derived with better space and time complexity. As a main contribution, the proposed multiplier costs about 2/3 circuit gates of the fastest multipliers, while its time delay matches our former result. To the best of our knowledge, this is the first time that the space complexity bound is reached without increasing the gate delay.

scholarly journals Cryptanalytic Performance Appraisal of Improved CCH2 Proxy Multisignature Scheme

2014 ◽  
Vol 2014 ◽  
pp. 1-13
Author(s):  
Raman Kumar ◽  
Nonika Singla
Keyword(s):  
Elliptic Curve ◽  
Performance Appraisal ◽  
Time Complexity ◽  
Space Complexity ◽  
Elliptic Curve Cryptosystem ◽  
Forgery Attack ◽  
Signature Schemes ◽  
Computational Overhead ◽  
Threshold Schemes

Many of the signature schemes are proposed in which thetout ofnthreshold schemes are deployed, but they still lack the property of security. In this paper, we have discussed implementation of improved CCH1 and improved CCH2 proxy multisignature scheme based on elliptic curve cryptosystem. We have represented time complexity, space complexity, and computational overhead of improved CCH1 and CCH2 proxy multisignature schemes. We have presented cryptanalysis of improved CCH2 proxy multisignature scheme and showed that improved CCH2 scheme suffered from various attacks, that is, forgery attack and framing attack.

Petersen-star networks modeled by optical transpose interconnection system

2021 ◽  
Vol 17 (11) ◽  
pp. 155014772110331
Author(s):  
Jung-hyun Seo ◽  
HyeongOk Lee
Keyword(s):  
Parallel Processing ◽  
Optical Communication ◽  
Time Complexity ◽  
High Performance ◽  
Electronic Communication ◽  
Interconnection Network ◽  
Processing System ◽  
Factor Graph ◽  
Star Network ◽  
Network Cost

One method to create a high-performance computer is to use parallel processing to connect multiple computers. The structure of the parallel processing system is represented as an interconnection network. Traditionally, the communication links that connect the nodes in the interconnection network use electricity. With the advent of optical communication, however, optical transpose interconnection system networks have emerged, which combine the advantages of electronic communication and optical communication. Optical transpose interconnection system networks use electronic communication for relatively short distances and optical communication for long distances. Regardless of whether the interconnection network uses electronic communication or optical communication, network cost is an important factor among the various measures used for the evaluation of networks. In this article, we first propose a novel optical transpose interconnection system–Petersen-star network with a small network cost and analyze its basic topological properties. Optical transpose interconnection system–Petersen-star network is an undirected graph where the factor graph is Petersen-star network. OTIS–PSN n has the number of nodes 102n, degree n+3, and diameter 6 n − 1. Second, we compare the network cost between optical transpose interconnection system–Petersen-star network and other optical transpose interconnection system networks. Finally, we propose a routing algorithm with a time complexity of 6 n − 1 and a one-to-all broadcasting algorithm with a time complexity of 2 n − 1.

An Efficient Algorithm for Automating Classification of Chemical Reactions into Classes in Ugi’s Reaction Scheme

2013 ◽  
pp. 285-296
Author(s):  
Sanjay Ram ◽  
Somnath Pal
Keyword(s):  
Chemical Reactions ◽  
Efficient Algorithm ◽  
Time Complexity ◽  
Symmetric Matrix ◽  
Reaction Scheme ◽  
Space Complexity ◽  
Average Case ◽  
Model Driven ◽  
Reaction Matrix

There are two approaches for classification of chemical reactions: Model-Driven and Data-Driven. In this paper, the authors develop an efficient algorithm based on a model-driven approach developed by Ugi and co-workers for classification of chemical reactions. The authors’ algorithm takes reaction matrix of a chemical reaction as input and generates its appropriate class as output. Reaction matrices being symmetric, matrix implementation of Ugi’s scheme using upper/lower tri-angular matrix is of O(n2) in terms of space complexity. Time complexity of similar matrix implementation is O(n4), both in worst case as well as in average case. The proposed algorithm uses two fixed size look-up tables in a novel way and requires constant space complexity. Time complexity both in worst and average cases of the algorithm is linear.

scholarly journals Height Estimation of Target Objects Based on Structured Light

2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
Wei Liu ◽  
Yongsheng Zhao
Keyword(s):  
Simple Structure ◽  
Structured Light ◽  
Three Dimensional ◽  
Research Direction ◽  
Target Object ◽  
Height Estimation ◽  
Word Structure ◽  
Dimensional Reconstruction ◽  
Important Research Direction ◽  
Structure Light

The height estimation of the target object is an important research direction in the field of computer vision. The three-dimensional reconstruction of structured light has the characteristics of high precision, noncontact, and simple structure and is widely used in military simulation and cultural heritage protection. In this paper, the height of the target object is estimated by using the word structure light. According to the height dictionary, the height under the offset is estimated by the movement of the structured light to the object. In addition, by effectively preprocessing the captured structured light images, such as expansion, seeking skeleton, and other operations, the flexibility of estimating the height of different objects by structured light is increased, and the height of the target object can be estimated more accurately.

Sign in / Sign up

Export Citation Format

Share Document