Version Of Construction Research Articles

Non-semisimple extended topological quantum field theories

We develop the general theory for the construction of Extended Topological Quantum Field Theories (ETQFTs) associated with the Costantino-Geer-Patureau quantum invariants of closed 3-manifolds. In order to do so, we introduce relative modular categories, a class of ribbon categories which are modeled on representations of unrolled quantum groups, and which can be thought of as a non-semisimple analogue to modular categories. Our approach exploits a 2-categorical version of the universal construction introduced by Blanchet, Habegger, Masbaum, and Vogel. The 1+1+1-EQFTs thus obtained are realized by symmetric monoidal 2-functors which are defined over non-rigid 2-categories of admissible cobordisms decorated with colored ribbon graphs and cohomology classes, and which take values in 2-categories of complete graded linear categories. In particular, our construction extends the family of graded 2+1-TQFTs defined for the unrolled version of quantum s l 2 \mathfrak {sl}_2 by Blanchet, Costantino, Geer, and Patureau to a new family of graded ETQFTs. The non-semisimplicity of the theory is witnessed by the presence of non-semisimple graded linear categories associated with critical 1-manifolds.

Development and analysis of the new hashing algorithm based on block cipher

This paper proposes the new hash algorithm HBC-256 (Hash based on Block Cipher) based on the symmetric block cipher of the CF (Compression Function). The algorithm is based on the wipe-pipe construct, a modified version of the Merkle-Damgard construct. To transform the block cipher CF into a one-way compression function, the Davis-Meyer scheme is used, which, according to the results of research, is recognized as a strong and secure scheme for constructing hash functions based on block ciphers. The symmetric CF block cipher algorithm used consists of three transformations (Stage-1, Stage-2, and Stage-3), which include modulo two addition, circular shift, and substitution box (four-bit S-boxes). The four substitution boxes are selected from the “golden” set of S-boxes, which have ideal cryptographic properties. The HBC-256 scheme is designed to strike an effective balance between computational speed and protection against a preimage attack. The CF algorithm uses an AES-like primitive as an internal transformation. The hash image was tested for randomness using the NIST (National Institute of Standards and Technology) statistical test suite, the results were examined for the presence of an avalanche effect in the CF encryption algorithm and the HBC-256 hash algorithm itself. The resistance of HBC-256 to near collisions has been practically tested. Since the classical block cipher key expansion algorithms slow down the hash function, the proposed algorithm is adapted for hardware and software implementation by applying parallel computing. A hashing algorithm was developed that has a sufficiently large freedom to select the sizes of the input blocks and the output hash digest. This will make it possible to create an almost universal hashing algorithm and use it in any cryptographic protocols and electronic digital signature algorithms

The Mini Labyrinth Benchmark for Radiation Protection and Shielding Analysis

The Mini Labyrinth experiment is a neutron and gamma shielding experiment currently being developed at the Slovak University of Technology, Bratislava (STU). The STU Mini Labyrinth consists of NEUTRONSTOP shielding blocks, water tank, PuBe neutron source, and graphite prism. This article describes the second construction version of the Mini Labyrinth experiment and presents the newest results of the neutron and gamma fields’ simulation and measurement. The PuBe neutron source with the emission rate of 1.06E7 <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\text{n}\cdot \text{s}^{-1}$ </tex-math></inline-formula> was used in the experiment. The measurement of gamma ambient dose equivalent H*(10) and neutron count rates is performed by the Thermo Scientific RadEye portable survey meter and the SNM-11 BF3-filled corona detector. The simulation part was carried out using the state-of-the-art MCNP6 and SCALE6 MONACO stochastic calculation tools, considering the detailed geometry of the Mini Labyrinth and a combined neutron and gamma source of particles. The comparisons were performed between codes and the experiment. The propagation of cross-sectional uncertainties was investigated through the shielding analysis. Almost perfect agreements between simulation codes were achieved. The comparison with measurement suggests the further needs of room effect assessment.

Quantum Period Finding is Compression Robust

We study quantum period finding algorithms such as Simon and Shor (and its variant Ekerå-Håstad). For a periodic function f these algorithms produce – via some quantum embedding of f – a quantum superposition ∑x |x〉 |f(x)〉, which requires a certain amount of output qubits that represent |f(x)〉. We show that one can lower this amount to a single output qubit by hashing f down to a single bit in an oracle setting.Namely, we replace the embedding of f in quantum period finding circuits by oracle access to several embeddings of hashed versions of f. We show that on expectation this modification only doubles the required amount of quantum measurements, while significantly reducing the total number of qubits. For example, for Simon’s algorithm that finds periods in f : Fn2 → Fn2 our hashing technique reduces the required output qubits from n down to 1, and therefore the total amount of qubits from 2n to n + 1. We also show that Simon’s algorithm admits real world applications with only n + 1 qubits by giving a concrete realization of a hashed version of the cryptographic Even-Mansour construction. Moreover, for a variant of Simon’s algorithm on Even-Mansour that requires only classical queries to Even-Mansour we save a factor of (roughly) 4 in the qubits.Our oracle-based hashed version of the Ekerå-Håstad algorithm for factoring n-bit RSA reduces the required qubits from (3/2 + o(1))n down to (1/2+ o(1))n.

Towards a constructive simplicial model of Univalent Foundations

We provide a partial solution to the problem of defining a constructive version of Voevodsky's simplicial model of Univalent Foundations. For this, we prove constructive counterparts of the necessary results of simplicial homotopy theory, building on the constructive version of the Kan-Quillen model structure established by the second-named author. In particular, we show that dependent products along fibrations with cofibrant domains preserve fibrations, establish the weak equivalence extension property for weak equivalences between fibrations with cofibrant domain and define a univalent fibration that classifies small fibrations between bifibrant objects. These results allow us to define a comprehension category supporting identity types, Σ $\Sigma$ -types, Π $\Pi$ -types and a univalent universe, leaving only a coherence question to be addressed.

Когнитивно-прагматическая программа «Закон совести» в кинотексте «Пацаны»: целевой вектор

This article considers the author's version of a film construct's sociocognitive modeling based on the original theory of cognitive-pragmatic programs (CPPs). The relevance of this kind of modeling is due to both the social significance of the studied conceptual film text, and the complexity of its analysis as a synthetic text of culture. The source of the research is the film construct of the famous Soviet film Boys. To substantiate the author's methodology, the traditions of psychology and modern sociocognitive ideas are used. The goals of the leading CPPs' initial formula of the film construct (“The Law of Conscience”) envisage the implementation of three main processes: (a) transformation and adjustment of the basic cognitive-mental subsystems of consciousness of a “problem” teenager who has fallen into the zone of influence of destructive CPPs; (b) the formation in his mind of a constructive personal, social and civic identity; (c) “withdrawal” of a teenager from the zone of activity of destructive-manipulative programs with their subsequent blocking. These processes determine the general target vector for the implementation of the “Law of Conscience” CPP. In the aspect of goal-setting, the program works simultaneously in two modes: goalsetting for oneself and goal-setting for the object of socialization (adolescent). At first the goal-setting is active and meaningful only for the program itself; the adolescent is aware of the formal presence of a goal, but does not identify it as his own; therefore, the degree of activity of the consciousness of the subject-personifier remains extremely low. To solve this problem the CPP bearer must find out how the consciousness of the object of socialization has changed as a result of destructive influence through observation (over the adolescent or his parents, the source of his desocialization) and analysis of behavior. The “Law of Conscience” CPP, activating the second mode of goal-setting (for a teenager), seeks to personify the goal formed in its structure and create conditions under which the teenager begins to perceive it as his own. The “Law of Conscience” CPP is focused primarily not on the “result at any cost”, but on the activation and maintenance of the internal activity of the processes of harmonious cognitive-mental rehabilitation of the adolescent's consciousness, which is realized in the scene of the trial of V. Kireev as a result of a speech by the head of the camp, P.V. Antonov. The “Law of Conscience” program cannot make a choice for the teenager. He must start the movement, feeling support by himself. A simple rule works here: “the ‘other' believes in me - I must justify his belief in himself - I must accept his trust as my own - I must learn to believe in myself”.

ИСПОЛЬЗОВАНИЕ ЭКСПЕРТНЫХ СИСТЕМ ДЛЯ ПОВЫШЕНИЯ НАДЕЖНОСТИ СИСТЕМ РАДИОСВЯЗИ

Introduction. The article develops a dynamic expert system (ES) based on a model of a system for monitoring the technical condition of signal generators in telecommunication systems. In the proposed system, decision-making is based on a constant analysis of the parameters of the time-frequency parameters of signals generated by generators in infotelecommunication systems. The purpose of the work is to develop an expert system based on a model of a system for monitoring the technical condition of signal generators in infotelecommunication systems. Research results: In the course of the work, an analysis of expert systems was carried out, a dynamic expert system was selected from the real-time communication classification, the structure of the expert system was proposed, each of its elements was considered, an expert system was developed that allows predicting changes in the parameters of transmission channel generators in telecommunication systems, and the resulting expert system was tested based on two assumptions, which allows us to draw conclusions about the correctness of the development. For this purpose, the result of processing the input data is given based on two assumptions – the law of normal distribution and the uniform distribution law. On the basis of this, it can be concluded that the proposed developed version of the ES construction and the software product implementing it is working. The expert system makes it possible to analyze incoming data in the current time, as well as generate an output.

Towards a Constructive Framework for Control Theory

This work presents a framework for control theory based on constructive analysis to account for discrepancy between mathematical results and their implementation in a computer, also referred to as computational uncertainty. In control engineering, the latter is usually either neglected or considered submerged into some other type of uncertainty, such as system noise, and addressed within robust control. However, even robust control methods may be compromised when the mathematical objects involved in the respective algorithms fail to exist in exact form and subsequently fail to satisfy the required properties. For instance, in general stabilization using a control Lyapunov function, computational uncertainty may distort stability certificates or even destabilize the system despite robustness of the stabilization routine with regards to system, actuator and measurement noise. In fact, battling numerical problems in practical implementation of controllers is common among control engineers. Such observations indicate that computational uncertainty should indeed be addressed explicitly in controller synthesis and system analysis. The major contribution here is a fairly general framework for proof techniques in analysis and synthesis of control systems based on constructive analysis which explicitly states that every computation be doable only up to a finite precision thus accounting for computational uncertainty. A series of previous works is overviewed, including constructive system stability and stabilization, approximate optimal controls, eigenvalue problems, Caratheodory trajectories, measurable selectors. Additionally, a new constructive version of the Danskin's theorem, which is crucial in adversarial defense, is presented.

Разработка лабораторного стенда для изучения систем обнаружения вторжений

The research object of this article is network-based and host-based intrusion detection systems. The aim of the study is to obtain an overview of intrusion detection systems, as well as to build a constructive version of a virtual laboratory bench intended for teaching students (studying the test characteristics of intrusion detection systems). The article provides a brief reference on intrusion detection systems, taking into account the classification by the method of monitoring and the technology of detecting attacks. Today, intrusion detection system is a necessary element of a comprehensive network protection system for both small and large organizations. They improve network security by protecting against external and internal intruders. Therefore, the need to acquire skills in installing, configuring and administering intrusion detection systems is an important part of training information security specialists, which necessitates continuous updating and modernization of training tools. In this paper, we propose a virtual laboratory bench designed to study intrusion detection systems. Its architecture and functioning parameters are described. In order to select an intrusion detection system for a virtual laboratory bench, a comparative analysis of free and commercial intrusion detection systems on the market was carried out. Network-based and host-based intrusion detection systems were considered separately. For both types, their advantages and disadvantages are described. As a result, the functions and operation mechanism are described for the intrusion detection system selected based on the analysis results. In addition, examples of custom rules for handling security events are discussed.

Integrating vehicle scheduling and open routing decisions in a cross-docking center with multiple docks

Society is facing a series of challenges, as the growth in urban population, the expansion of e-commerce, the pandemic moment (COVID-19), and many others leading to changes in companies’ supply chain, like reducing product delivery time and attention to consumer welfare, the environmental impact, to mention a few. The efficient management of logistic solutions such as cross-docking can contribute to improving the supply chain performance. Here we focus on the integration of scheduling of trucks and routing decisions; the integration of these strategies can significantly reduce costs and help organize the distribution centers and the customers’ services. This article analyzes the integrated problem in which trucks’ scheduling in a cross-docking center with multiple docks is combined with the associated open vehicle routing problem, called Open Vehicle Routing Problem With Cross-Docking (OVRPCD). This approach aims to minimize penalties caused by delays in servicing customers. First, a mixed-integer linear programming model is proposed to solve small instances optimally. Next, two heuristics are proposed to contribute to the solution of the two problems in an integrated way. These heuristics are: the Vehicle Routing Cross-Docking Heuristic (VRCDH) and the Cross-Docking Vehicle Routing Heuristic (CDVRH), each focusing on one of the problems. We also propose a Prioritization Lagrangian Heuristic (PLH) based on a model decomposition to improve the solutions found. These three heuristics are compared, considering two search approaches (i) a constructive version (HC) using the swap heuristic; and (ii) a version using the Variable Neighborhood Search (VNS) metaheuristic framework. The VNS-enhanced versions of the heuristics outperform the previous ones. Still, the same relation holds regarding the three heuristics, i.e.: the PLH heuristic outperforms the VRCDH one, while the latter outperforms the CDVRH one. Finally, we propose a polynomial-time framework, called Robust Dynamic Prioritization Lagrangian Heuristic (RDPLH), which extends PLH, considering trucks’ release dates and travel times uncertainties, approximating our problem to a real cross-docking center. The framework’s simplicity and the quality of the results allow us to assert that this approach can be used in real cross-docking centers (CDCs).

On seakeeping capabilities evaluation of a large off-shore barge

Usual specially designed barges are involved in the off-shore operations that have to be evaluated by several criteria, inclusive of the seakeeping capabilities. The paper includes a comparative seakeeping study of two constructive versions for a large off-shore barge with a length of 189 m, having different breadths 40 m and 50 m. Both constructive versions are on the full cargo 23000 t condition. The seakeeping analyses are done with our own software DYN-OSC, developed by linear potential Lewis’s strip theory. The seakeeping studies are done in oblique irregular waves with a maximum height of 12 m and for the off-shore barge maximum operation speed of 7 knots. The results of this comparative study reveal the differences in the seakeeping operation capabilities for the two off-shore barge constructive versions.

Optimal Politics of Conflict over Physical-Industrial Development Using a Technique of Cooperative Game Theory in Iran

One of the most important parameters for economic growth is industrial development in many developing regions like Iran. The Markazi province in the center of Iran is one of the most important industrial areas in the country, where unplanned economic development in recent decades has led to many social and environmental problems. Accordingly, the main organizations involved in industrial development in this region are facing difficulties in the future development of industrial areas, which has become a complex problem. Therefore, the main purpose of this paper is to study the industrial development dispute in the Markazi province through a cooperative model of game theory in order to achieve conflict resolution through a comprehensive approach. In this research, the conflict has been analyzed through strategic analysis of stakeholders. For this purpose, a model of cooperative game theory and its bargaining analysis methods, including social choice rules (SCRs) and fallback bargaining (FB), and six available options were used. According to the six SCRs, the most likely option that can exist between the Department of the Environment (DOE) and the Industrial and Mining Organization (IMO) is compromise coordination (C). In addition, the results of the Fallback Bargaining (FB) rule in three different forms show that the most appropriate options for agreement between the IMO and DOE are the moderate version of construction through arbitration (TCa) and compromise coordination (C). In fact, the results indicate that if the actors involved in this conflict do not cooperate to resolve it, it can lead to more complex problems and the involvement of other groups who may not even have a proper perception of the conflict. In addition, the findings show that cooperation between the parties and understanding of their positions and views along with the policy coherence are necessary to strive for sustainable development and maintain economic growth and development.

Constructive sheaf models of type theory

AbstractWe provide a constructive version of the notion of sheaf models of univalent type theory. We start by relativizing existing constructive models of univalent type theory to presheaves over a base category. Any Grothendieck topology of the base category then gives rise to a family of left-exact modalities, and we recover a model of type theory by localizing the presheaf model with respect to this family of left-exact modalities. We provide then some examples.

Improving the Performance of Steel Machining Processes through Cutting by Vibration Control.

Machining processes through cutting are accompanied by dynamic phenomena that influence the quality of the processed surfaces. Thus, this research aimed to design, make, and use a tool with optimal functional geometry, which allowed a reduction of the dynamic phenomena that occur in the cutting process. In order to carry out the research, the process of cutting by front turning with transversal advance was taken into account. Additionally, semi-finished products with a diameter of Ø = 150 mm made of C45 steel were chosen for processing (1.0503). The manufacturing processes were performed with the help of two tools: a cutting tool, the classic construction version, and another that was the improved construction version. In the first stage of the research, an analysis was made of the vibrations that appear in the cutting process when using the two types of tools. Vibration analysis considered the following: use of the Fast Fourier Transform (FFT) method, application of the Short-Time Fourier-Transformation (STFT) method, and observation of the acceleration of vibrations recorded during processing. After the vibration analysis, the roughness of the surfaces was measured and the parameter Ra was taken into account, but a series of diagrams were also drawn regarding the curved profiles, filtered profiles, and Abbott–Firestone curve. The research showed that use of the tool that is the improved constructive variant allows accentuated reduction of vibrations correlated with an improvement of the quality of the processed surfaces.

Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem

The distributed shop scheduling has gained a great deal of attention due to its high-efficient collaboration and production. This paper studies a distributed no-wait flexible flow shop scheduling problem (DNWFFSP) with the makespan criterion, where each factory includes an identical flexible flow shop with no-wait constraint that requires each job to be processed without any waiting time between consecutive stages. A mixed-integer linear programming model for the DNWFFSP is presented. A machine selection method based on the first earliest available machine rule is presented. Three greedy factory assignment rules incorporating NEH (Nawaz-Enscore-Ham) heuristic are developed to allocate jobs into factories. Fourteen dispatch rules involving simple sorting and decomposition method are developed to construct a priority sequence of jobs. Thus, several constructive heuristics are obtained by combining dispatch rules and factory assignment rules. Furthermore, a constructive heuristic version of variable neighborhood descend is designed to address the DNWFFSP. One of constructive heuristics is selected to generate an initial solution, and five neighborhood search methods are used as the local search procedure. A comprehensive numerical comparison and statistical analysis are carried out to investigate the performance of the proposed approaches. The distributed NEH2 with smallest largest-medium rule obtains better results than other constructive heuristics for large-size instances.

Dark matter from a dark connection

In the first part of this note, we observe that a non-Riemannian piece in the affine connection (a “dark connection”) leads to an algebraically determined, conserved, symmetric 2-tensor in the Einstein field equations that is a natural dark matter candidate. The only other effect it has, is through its coupling to standard model fermions via covariant derivatives. If the local dark matter density is the result of a background classical dark connection, these Yukawa-like mass corrections are minuscule ([Formula: see text] for terrestrial fermions) and none of the tests of general relativity or the equivalence principle are affected. In the second part of the note, we give dynamics to the dark connection and show how it can be re-interpreted in terms of conventional dark matter particles. The simplest way to do this is to treat it as a composite field involving scalars or vectors. The (pseudo-)scalar model naturally has a perturbative shift-symmetry and leads to versions of the Fuzzy Dark Matter (FDM) scenario that has recently become popular (e.g. arXiv:1610.08297) as an alternative to WIMPs. A vector model with a [Formula: see text]-parity falls into the Planckian Interacting Dark Matter (PIDM) paradigm, introduced in arXiv:1511.03278. It is possible to construct versions of these theories that yield the correct relic density, fit with inflation and are falsifiable in the next round of CMB experiments. Our work is an explicit demonstration that the meaningful distinction is not between gravity modification and dark matter, but between theories with extra fields and those without.

Homotopies of Crossed Modules of R-Algebroids

In this work, given two crossed modules $$\mathcal {M=}\left( \mu :\mathrm {M} \rightarrow \mathrm {A}\right) $$ and $${\mathcal {N}}=\left( \eta :\mathrm {N} \rightarrow \mathrm {B}\right) $$ of R-algebroids and a crossed module morphism $$f:{\mathcal {M}}\rightarrow {\mathcal {N}}$$ , we introduce an f-derivation as an ordered pair $$H=\left( H_{1},H_{0}\right) $$ of maps $$H_{1}: \mathrm {Mor}\left( \mathrm {A}\right) \rightarrow \mathrm {Mor}\left( \mathrm {N }\right) $$ and $$H_{0}:\mathrm {A}_{0}\rightarrow \mathrm {Mor}\left( \mathrm {B} \right) $$ which are subject to satisfy certain axioms and show that f and H determine a crossed module morphism $$g:{\mathcal {M}}\rightarrow \mathcal { N}$$ . Then calling such a pair $$\left( H,f\right) $$ a homotopy from f to g we prove that there exists a groupoid structure of which objects are crossed module morphisms from $${\mathcal {M}}$$ to $${\mathcal {N}} $$ and morphisms are homotopies between crossed module morphisms. Moreover, given two crossed module morphisms $$f,g:{\mathcal {M}}\rightarrow {\mathcal {N}}$$ , we introduce an fg-map as a map $$\varLambda :\mathrm {A}_{0}\rightarrow \mathrm {Mor}\left( \mathrm {N}\right) $$ subject to some conditions and then show that $$\varLambda $$ determines for each homotopy $$\left( H,f\right) $$ from f to g a homotopy $$\left( H^{\prime },f\right) $$ from f to g. Furthermore, calling such a pair $$\left( \varLambda ,\left( H,f\right) \right) $$ a 2-fold homotopy from $$\left( H,f\right) $$ to $$\left( H^{\prime },f\right) $$ we prove that the groupoid structure constructed by crossed module morphisms from $${\mathcal {M}}$$ to $${\mathcal {N}}$$ and homotopies between them is upgraded by 2-fold homotopies to a 2-groupoid structure. Besides, in order to see reduced versions of all general constructions mentioned, we examine homotopies of crossed modules of associative R-algebras, as a pre-stage.

Relationship between Energy and Atmosphere (EA) Credits and Project Size in the LEED-NC Version 3 (v3) and 4 (v4) Projects

This study aims to explore the influence of project size on the Energy and Atmosphere (EA) credits in the Leadership in Energy and Environmental Design for New Construction and Major Renovations (LEED-NC) version 3 (v3) in California and version 4 (v4) in the United States (US) in office-type projects. If the relationship between the ordinal data of EA credits and project size changed monotonically, then Spearman’s correlation coefficient was used. If the relationship between the EA credits ordinal data and project size did not change monotonically, then the EA credit data were divided into below and above the median project size groups, and, as a consequence, the Cliff′s δ effect size and exact Wilcoxon–Mann–Whitney tests were used. If the EA credits were binary or dichotomous data, then the natural logarithm of the odds ratio and Fisher’s exact 2 × 2 test with Lancaster’s mid-p-value were used. The results showed that the performance of operational energy, enhanced the refrigerant management and that the renewable energy credits in LEED-NC v3/v4 Certified, Silver, and Gold projects depended on the project size. We concluded that the LEED project size is an important variable for developing LEED-NC strategies for office-type projects.

Virtual Ziggurats

The ziggurat is one of the most enduring symbols of the ancient Near East: From paintings to movies to books to video games, versions of the stepped constructions emerge in popular culture and imagination all the way from classical Greece until today. One could even argue that the ziggurat is a transhistorical symbol; it has existed as a symbol not only produced by and related to the ancient Near East, but has transcended its original historical context and has acquired new meanings and images over time. In this article, I explore this transhistoricity of the ziggurat by examining it within western, modern, popular imagination, and particularly within the context of video games. For this, I take an art-historical approach, examining ziggurats from various games to create a ziggurat typology as portrayed in video games. In doing that, I explore how modern conceptions of the ziggurat affect and shape our understanding of the Near East, and how this can be tied to Edward Said’s concept of orientalism (see also Mol and Politopoulos in this issue). I conclude with a brief discussion on how we can reframe the ziggurat within popular culture in order to increase knowledge and awareness about the history and cultures of the ancient Near East today.

Gluing Hilbert C⁎-modules over the primitive ideal space

We show that the gluing construction for Hilbert modules introduced by Raeburn in his computation of the Picard group of a continuous-trace C⁎-algebra (1981) [14] can be applied to arbitrary C⁎-algebras, via an algebraic argument with the Haagerup tensor product. We put this result into the context of descent theory by identifying categories of gluing data for Hilbert modules over C⁎-algebras with categories of comodules over C⁎-coalgebras, giving a Hilbert-module version of a standard construction from algebraic geometry. As a consequence we show that if two C⁎-algebras have the same primitive ideal space T, and are Morita equivalent up to a 2-cocycle on T, then their Picard groups relative to T are isomorphic.