An Adaptive Lossly Quantization Technique for Key Extraction Applied in Vehicular Communication

Security in Vehicular Ad Hoc Network (VANET) is one of the major challenging topics and the secure key interchange between two legitimate vehicles is an important issue. The multi-environment of VANET has been exploited to extract the secret key and employed security services in VANET. However, it offered more excellence randomness owed to fading, noise multi-path, and velocity difference. Some of the factors like Bit-rate, complication and memory requests are reduced by using a process known as quantization. This paper proposes a new quantization method to extract the secret key for vehicular communications that uses a lossy quantizer in combination with information reconciliation and privacy amplification. Our work focuses on the quantization phase for the secret generation procedure. The comprehensive simulations display the propose method increases the zone and number of the quantization levels to utilize the maximum number of measurements to reduce reasonably the wasted measurements.

Features of Software Implementation of Logical Tasks in Prolog

One of the promising areas for using Prolog-systems is to solve logical tasks. This study outlines a solution approach based on the state generation procedure and the verification procedure. A solution to a logical task is presented, which demonstrates in practice the proposed approach and method of specifying a procedure for generating states. In the proposed example, a bit chain is generated that defines the code of a particular letter in the solution of the applied problem. Building a solution by means of code generation with verification allows not storing in the knowledge base a binary tree of all possible codes. The process of generating new states can be associated with the training of the program, with the dynamic formation of the knowledge base. The approach is based on the capabilities of software environments for adding facts and rules to existing ones, which were obtained as the results of the program or its stages. In this case, the entire program is the generating rule. An analysis of the constructed and tested procedures for the dynamic generation of states and the generation of facts allows us to talk about the applicability of such a solution for certain applied problems.

Making Sense of the Relationship Between Adaptive Thinking and Heuristics in Evolutionary Psychology

In recent years, quite a few evolutionary psychologists have come to embrace a heuristic interpretation of the discipline. They claim that, no matter how methodologically incomplete, adaptive thinking works fine as a good heuristic that effectively reduces the hypothesis space by generating novel and promising hypotheses that can eventually be empirically tested. The purpose of this article is to elucidate the use of heuristics in evolutionary psychology, thereby clarifying the role adaptive thinking has to play. To that end, two typical heuristic interpretations—Machery’s "bootstrap strategy" and Goldfinch’s heuristically streamlined evolutionary psychology—are examined, focusing on the relationship between adaptive thinking and heuristics. The article draws two primary conclusions. The first is that the reliability of the heuristic hypothesis generation procedure (in the context of discovery) should count no less than the conclusiveness of the final testing procedure (in the context of justification) in establishing scientific facts; nature does not always get the last word. Philosophy also counts. The second is that adaptive thinking constitutes a core heuristic in evolutionary psychology that provides the discipline with its raison d'être, but this is only possible when adaptive thinking is substantiated with sufficient historical underpinnings.

High-throughput systematic topological generation of low-energy carbon allotropes

The search for new materials requires effective methods for scanning the space of atomic configurations, in which the number is infinite. Here we present an extensive application of a topological network model of solid-state transformations, which enables one to reduce this infinite number to a countable number of the regions corresponding to topologically different crystalline phases. We have used this model to successfully generate carbon allotropes starting from a very restricted set of initial structures; the generation procedure has required only three steps to scan the configuration space around the parents. As a result, we have obtained all known carbon structures within the specified set of restrictions and discovered 224 allotropes with lattice energy ranging in 0.16–1.76 eV atom−1 above diamond including a phase, which is denser and probably harder than diamond. We have shown that this phase has a quite different topological structure compared to the hard allotropes from the diamond polytypic series. We have applied the tiling approach to explore the topology of the generated phases in more detail and found that many phases possessing high hardness are built from the tiles confined by six-membered rings. We have computed the mechanical properties for the generated allotropes and found simple dependences between their density, bulk, and shear moduli.

New type of source extension for a two-dimensional special lattice equation and determinant solutions

We present a new type of two-dimensional special lattice equations with self-consistent sources using the source generation procedure. Then we obtain the Grammy-type and Casorati-type determinant solutions of the coupled system. Further, we present the one-soliton and two-soliton solutions.

GENERATION AND INITIAL VALIDATION OF A NEW CASMO5 ENDF/B-VIII.0 NUCLEAR DATA LIBRARY

A new nuclear data library for the CASMO5 advanced lattice physics code has been generated based on the recently-released ENDF/B-VIII.0 evaluation. The ENDF/B-VIII.0 evaluation represents the state-of-the-art in nuclear data and features new evaluations from the CIELO project for 1H, 16O, 56Fe, 235U, 238U and 239Pu. A description of the library generation procedure used to process these data into the CASMO5 586 energy group structure is provided. Initial validation of the new ENDF/B-VIII.0-based library, referred to as the E8R0 library, is also presented and involves the comparison of predicted k–eff and fission rate distributions to measurements from various critical experiments. The critical experiments used in the initial validation of the E8R0 library consist of the B&W 1810 series, B&W 1484 series, DIMPLE S06A/B, and TCA reflector experiment with iron plates. The results from the initial validation indicate that the new E8R0 library provides a satisfactory performance in terms of CASMO5 predicted k–eff and fission distributions.

Systematic Model for Decision Support System

Decision makers require a versatile framework that responds and adjusts to the always changing business conditions. The personal information handling arrangement of an organization can offer the least help since it identified with exchanges. For this situation, the decision support system (DSS) joins human abilities with the abilities of PCs to give productive administration of information, announcing, investigation, displaying, and arranging issues. DSS provides a refinement between organized, semi-organized, and unstructured data. Specifically, a DSS lessens the amount of data to a ridiculous organized sum; because of this, choices are made to help the assembling procedure. The objective of these frameworks is to prevent issues inside the generation procedure. This chapter gives an outline of the state-of-the-art craftsmanship writing on DSS and portrays current methods of DSS-related applications inside assembling situations.

A note on PM-compact $ K_4 $-free bricks

<abstract><p>A 3-connected graph is a <italic>brick</italic> if the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that they are building blocks of the matching covered graphs. Lovász (Combinatorica, 3 (1983), 105-117) showed that every brick is $ K_4 $-based or $ \overline{C}_6 $-based. A brick is <italic>$ K_4 $-free</italic> (respectively, <italic>$ \overline{C}_6 $-free</italic>) if it is not $ K_4 $-based (respectively, $ \overline{C}_6 $-based). Recently, Carvalho, Lucchesi and Murty (SIAM Journal on Discrete Mathematics, 34(3) (2020), 1769-1790) characterised the PM-compact $ \overline{C}_6 $-free bricks. In this note, we show that, by using the brick generation procedure established by Norine and Thomas (J Combin Theory Ser B, 97 (2007), 769-817), the only PM-compact $ K_4 $-free brick is $ \overline{C}_6 $, up to multiple edges.</p></abstract>

A method for transformation from dynamic fault tree to binary decision diagram

Dynamic fault tree (DFT) is a powerful modeling approach for reliability analysis of complex system with dynamic failure behaviors. In reality, the tree structure may be highly coupled either by shared basic events or by the high-level dynamic gates. Currently, the application of sequential binary decision diagram (SBDD)-based method for quantitative analysis of such highly coupled DFTs is mainly limited to DFTs whose dynamic gates locate in the bottom of the tree. Moreover, there is no efficient way dealing with the dependencies among different nodes of a SBDD 1-path. This paper makes an improvement to the SBDD-based approach. A generation procedure is proposed to directly construct the binary decision diagram (BDD) model for a DFT with arbitrary tree structure. During the construction, the sequential-dependent information of the tree is derived as several BDD nodes, each indicates a binary-sequential event representing the sequence of two occurred basic events. A topological sorting is applied on each 1-path of the resultant BDD to obtain its contained disjoint cut sequences. Based on this, both qualitative and quantitative analysis can be performed on the DFT with no limitations on tree structure, and its minimal cut sequence set (CSS) is obtained as disjoint. Examples are provided for verification and comparison, and the results illustrate the merits of the proposed approach.