scholarly journals SAT in P does not imply Chaos in the security system

2021 ◽  
Author(s):  
Juan Manuel Dato Ruiz
Keyword(s):  
Polynomial Time ◽  
Efficient Solution ◽  
Security System ◽  
Time Solution ◽  
Wide Range

Abstract There are a large number of papers that claim that there are problems that once solved lead to an efficient solution of a wide range of problems, classified as NP. In this paper we will not only question the existence of this class of NP-co problems, but we will also explain their limitations in engineering and give a polynomial-time solution to SAT, one of these emblematic problems. The resolution will be so trivial that it will even be possible to practice it on paper.

scholarly journals Indirect identification of horizontal gene transfer

2021 ◽  
Vol 83 (1) ◽  
Author(s):  
David Schaller ◽  
Manuel Lafond ◽  
Peter F. Stadler ◽  
Nicolas Wieseke ◽  
Marc Hellmuth
Keyword(s):  
Gene Transfer ◽  
Horizontal Gene Transfer ◽  
Polynomial Time ◽  
Divergence Time ◽  
Recognition Algorithm ◽  
Vertex Coloring ◽  
Implicit Methods ◽  
Colored Graphs ◽  
Wide Range ◽  
Complete Multipartite

AbstractSeveral implicit methods to infer horizontal gene transfer (HGT) focus on pairs of genes that have diverged only after the divergence of the two species in which the genes reside. This situation defines the edge set of a graph, the later-divergence-time (LDT) graph, whose vertices correspond to genes colored by their species. We investigate these graphs in the setting of relaxed scenarios, i.e., evolutionary scenarios that encompass all commonly used variants of duplication-transfer-loss scenarios in the literature. We characterize LDT graphs as a subclass of properly vertex-colored cographs, and provide a polynomial-time recognition algorithm as well as an algorithm to construct a relaxed scenario that explains a given LDT. An edge in an LDT graph implies that the two corresponding genes are separated by at least one HGT event. The converse is not true, however. We show that the complete xenology relation is described by an rs-Fitch graph, i.e., a complete multipartite graph satisfying constraints on the vertex coloring. This class of vertex-colored graphs is also recognizable in polynomial time. We finally address the question “how much information about all HGT events is contained in LDT graphs” with the help of simulations of evolutionary scenarios with a wide range of duplication, loss, and HGT events. In particular, we show that a simple greedy graph editing scheme can be used to efficiently detect HGT events that are implicitly contained in LDT graphs.

scholarly journals Dynamic Routing and Coordination of Cluster for Unmanned Aerial Vehicle (UAV) Swarms

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Ali Abbas ◽  
Bhawani Shankar Chowdhry ◽  
Muhammad Saqib ◽  
Vishal Dattana
Keyword(s):  
Unmanned Aerial Vehicles ◽  
Efficient Solution ◽  
High Mobility ◽  
Combinatorial Problem ◽  
Communication Graph ◽  
Frequent Change ◽  
Swarm Optimization ◽  
Wide Range ◽  
Aerial Vehicle ◽  
Simulation Results

The flying networks provide an efficient solution for a wide range of military and commercial purposes. The demand for portable and flexible communication is directed towards a quick growth in interaction among unmanned aerial vehicles (UAVs). Due to the frequent change in topology and high mobility of vehicles, routing and coordination becomes a challenging task. To maximize the throughput of the network, this study addresses the UAV swarm’s problems related to the coordination and routing and defines the proposed solution to solve these issues. For this, a network is assumed which contains an equal number of dynamic vehicles. It also presents the communication graph concept of UAVs and designs a fixed-wing UAV model to improve the efficiency of the network in terms of throughput. Furthermore, the proposed algorithm based on Cauchy particle swarm optimization (CPSO) aims towards the better performance of UAV swarms and aims to solve the combinatorial problem. The simulation results show and confirm the performance of the proposed algorithm.

scholarly journals TRUST BASED ROUTING ALGORITHM IN INTERNET OF THINGS (IoT)

2019 ◽  
Vol 01 (01) ◽  
pp. 42-61
Author(s):  
Jennifer S. Raj ◽  
Alphina Stephy S
Keyword(s):  
Internet Of Things ◽  
Trust Management ◽  
Efficient Solution ◽  
Routing Algorithm ◽  
Security System ◽  
Major Focus ◽  
Malicious Nodes ◽  
Security Service ◽  
Adhoc Network

The development in the area of networking is Internet of Things (IoT). This will interrelated the object and things together. The realization of IoT subsystems will be subjected to numerous constraints that include cost, power, energy, and lifetime. However, most challenging requirement will be trust. It is widely recognized that the attacks from malicious parties can activate from Internet to the physical word. Hence, trust of IoT is of essential importance. Therefore, trust management is considered as a efficient solution to IoT related issues. Trust management has useful technology for providing security service and it has been used in many applications such as P2P, Grid, adhoc network and so on. Thus the trust based routing algorithm in Internet of Things is proposed for providing a potential security system. With this, the major focus on the problem of trust on the malicious nodes in any environment.

scholarly journals FAST ALGORITHMIC NIELSEN–THURSTON CLASSIFICATION OF FOUR-STRAND BRAIDS

2012 ◽  
Vol 21 (05) ◽  
pp. 1250043 ◽  
Author(s):  
MATTHIEU CALVEZ ◽  
BERT WIEST
Keyword(s):  
Conjugacy Class ◽  
Polynomial Time ◽  
Word Length ◽  
Conjugacy Problem ◽  
Time Solution

We give an algorithm which decides the Nielsen–Thurston type of a given four-strand braid. The complexity of our algorithm is quadratic with respect to word length. The proof of its validity is based on a result which states that for a reducible 4-braid which is as short as possible within its conjugacy class (short in the sense of Garside), reducing curves surrounding three punctures must be round or almost round. As an application, we give a polynomial time solution to the conjugacy problem for non-pseudo-Anosov four-strand braids.

A polynomial time solution for labeling a rectilinear map

1998 ◽  
Vol 65 (4) ◽  
pp. 201-207 ◽  
Author(s):  
Chung Keung Poon ◽  
Zhu Binhai ◽  
Chin Francis
Keyword(s):  
Polynomial Time ◽  
Time Solution

scholarly journals ECONOMIC SECURITY MANAGEMENT OF FINANCIAL INSTITUTIONS AS OBJECTS OF THE STATE CRITICAL INFRASTRUCTURE

MEST Journal ◽  
2021 ◽  
Vol 9 (1) ◽  
pp. 216-223
Author(s):  
Nataliia Zachosova ◽  
Zinaida Zyvko ◽  
Oleksii Koval
Keyword(s):  
Financial Institutions ◽  
Negative Impact ◽  
Financial Institution ◽  
Security Management ◽  
Economic Security ◽  
Security System ◽  
Management Decisions ◽  
External Threats ◽  
Wide Range ◽  
The Impact

The need to form a system of economic security for the effective operation of financial institutions is determined. Peculiarities of ensuring economic security of different types of financial institutions are found out, characteristic features of functional systems of economic security of financial intermediaries are revealed. It is offered to understand the management of economic security of financial institutions as a direction of management activities aimed at achieving a high level of protection of the institution's resources from the negative impact of internal and external threats by implementing a wide range of management decisions to use available opportunities and resources while providing financial services. The basics of the mechanism of economic security management of financial institutions are formed. It is assumed that the organization of the economic security system of a financial institution is carried out in several stages, such as the formation of the economic security system, ensuring the economic security system, identification, assessment, ranking of threats, and development of countermeasures; assessing the level of readiness of institutions to implement a mechanism for managing economic security; assessment of the level of economic security, development of management decisions. It is determined that the purpose of economic security management is to achieve the maximum possible level of realization of the institution's interests and meet the interests and needs of clients with optimal resource costs to minimize the impact of threats that accompany the activities of institutions.

Sign in / Sign up

Export Citation Format

Share Document