bluuebunny/crossref_metadata_2025 huggingface dataset:
Design and Analysis of an Optimal Control Algorithm for the Output of a Stochastic Automaton
Authors: Doberkat Ernst E.
Published: May 2021

Given the input-output behavior of a stochastic automaton and a map which compares output words, optimal controls are introduced, and an explicit formula for such a control is derived by means of linear programming techniques. The second part of the paper deals with the situation in which an input and an output word are given and the probability with which the optimal control puts out the word is requested. An algorithm for computing this probability is presented and analysed with respect to its behavior in the worst and in the average case. The latter analysis develops some new techniques, which are necessary since an uncountable variety of possible inputs has to be considered. These techniques come mainly from real analysis, in particular from measure theory.
A Characterization of Congruences on Algebraic and Iteration Theories with Applications
Authors: Troeger Douglas R.
Published: May 2021

This paper presents a characterization of congruences on algebraic and iteration theories. The characterization is used to obtain (1) a subdirect decomposition of the free iteration theory, (2) an infinite class of subdirectly irreducible iteration theories, (3) a simple iteration theory not embeddable in the iteration theory [X, 0] of ‘partial functions’, and (4) a condition ensuring that a congruence on the algebraic theory of finite trees is the restriction of a congruence on the algebraic theory of all trees.
On Some Extension of the Query Language for Incomplete Information Systems
Authors: Imieliński Tomasz
Published: May 2021

In the paper properties of en extension of a query language for incomplete information systems by a new descriptor “known(i)” are examined. Introducing a new descriptor “known(i)” allows to distinguish the objects about which our knowledge is complete, and increases the descriptive power of the language. It is shown that every query (term) is equivalent to a term in a simpler canonical form. Completeness results are presented.
A Note on Minimization of the Set of Attributes
Authors: Imieliński Tomasz
Published: May 2021

The problem of the minimization of the set of attributes (key-finding) in a given i.s.r. system is proved to be equivalent to prime implicant finding for a certain term. The equivalence between the minimalization of the set of attributes and minimal test finding is exhibited. As a consequence, minimal test finding algorithms are also applicable to the present problem.
Generalizations of the Consecutive Ones Property and Related NP-Complete Problems1
Authors: Lipski Witold
Published: May 2021

A(O,1)-matrix A is said to have the consecutive ones property if its rows can be permuted so that the 1’s appear consecutively in each column. We present four NP-complete problems connected with some generalizations of this notion. These problems concern decomposing the columns of a matrix into two subsets having the consecutive ones property, decomposing the rows into three subsets having the consecutive ones property, finding a subset of rows of maximal size having the consecutive ones property, and finding a permutation of the rows such that the 1’s in any column are contained in a set of k consecutive rows, for a fixed “buffer size” k.
Remarks on Sequents Defined by Means of Information Systems
Authors: Novotný Miroslav
Published: May 2021

Information (storage and retrieval) systems lead to define sequents of formulas of the propositional calculus. We give necessary and sufficient conditions for a formula β to be a sequent of a formula α with respect to a given information system and/or with respect to a given information system and its given valuation.
Programmable Real Numbers and Functions
Authors: Skandalis Kostas
Published: May 2021

In this paper we study the notion of programmability of functions and relations in the sense of algorithmic logic. We introduce a notion of acceptable structure. In acceptable structures a programmable function is a function which is defined by an infinite recursive sequence of cases which happens to be the so called Friedman’s schema. The last notion has been introduced as a generalization of a notion of a recursive function for structures which admitt pairing system. We apply the technique of Friedman’s schemata to study programmability in fields which as we shall prove do not admitt pairing systems. We also study some notions of effectiveness of real numbers.
A Formal Description of LISP 1.5 Data Structures by Means of Algorithmic Logic
Authors: Kubica Grażyna
Published: May 2021

A formal description of LISP 1.5 data structures is proposed. Algorithmic theory of states, which included all the LISP 1.5 data structures, is defined. By means of operations of this theory we can define each operation of programming language LISP 1.5.
Remarks on the Shuffle Operation
Authors: Leonarski Dariusz
Published: May 2021

Shuffle of formal languages and its properties are considered. An application of some results of the shuffle theory to decidability of deadlock and fairness problem in parallel systems is shown.
Logic for Structured States
Authors: Orłowska Ewa
Published: May 2021

In the paper we suggest an approach to proving global properties of structured states by using languages with special modal operators reflecting an internal structure of these states.
On Iteration in Robot Planning
Authors: Štěpánková Olga , Havel Ivan M.
Published: May 2021

The paper discusses the role of iteration in robot plans constructed in the framework of predicate logic. It is shown that, unless some special axioms are added, the class of solvable tasks is not enlarged by admitting iteration in plans.
A Problem of Domain Restriction in Data Bases a Logical Approach
Authors: Jankowski Andrzej W. , Rauszer Cecylia
Published: May 2021

The paper deals with the mathematical description of information systems with a limited access to a data base. Similarly as in [1] an area to which the user has access is called his priority. The information systems introduced in the paper are mathematical models for an intermediate logic with logical constants that corresponds to the priorities. The principles for operating this language are described, as well as a complete semantics is formulated.
One-Dimensional Learning
Authors: Marek Wiktor , Pawlak Zdzisław
Published: May 2021

We study a simple model of learning process over an information system.
The Weakest Prespecification, Part I
Authors: Hoare C.A.R. , Jifeng He
Published: May 2021

For, aside from the fact that the concepts occurring in this calculus possess an objective importance a nd are in these times almost indispensable in any scientific discussion, the calculus of relations has an intrinsic charm and beauty which makes it a source of intellectual delight to all who become acquainted with it. ALFRED TARSKI [10]
An Assessment of Programming Styles: Assignment-Oriented Languages Versus Functional and Applicative Languages1
Authors: Broy Manfred
Published: May 2021

Three small programming languages are introduced: a procedural one, an applicative one and a functional one (here functional is always meant in the sense of “functional in the style of Backus”). For each of them mathematical (denotational) and operational semantics are defined. Then the similarities and differences between these three languages with respect to mathematical semantics, operational semantics, syntactic and notational properties are discussed in detail. Specific attention is paid to the notion of program variable
On a Family of Linearly Grammatizable Languages
Authors: Păun Gheorghe , Novotný Miroslav
Published: May 2021

We prove that every nontrivial even linear language is linearly grammatizable by means of derivatives.
Process Algebra Semantics for Queues
Authors: Bergstra Jan , Tiuryn Jerzy
Published: May 2021

An unbounded queue over a finite set of data values is a process Q in A∞ defined by an infinite system of guarded equations. The aim of this paper is to show that no finite system of guarded equations is capable of defining Q.
An Algebraic Characterization of Concurrent Systems1
Authors: Korczyński Waldemar
Published: May 2021

In the paper a characterization of concurrent systems as algebras of a special kind is given. The algebras are defined by semi-equations in the first order language.
Logic Programming on a Topological Bilattice1
Authors: Fitting Melvin
Published: May 2021

We investigate the semantics of logic programming using a generalized space of truth values. These truth values may be thought of as evidences for and against – possibly incomplete or contradictory. The truth value spaces we use essentially have the structure of M. Ginsberg’s bilattices, and arise from topological spaces. The simplest example is a four-valued logic, previously investigated by N. Belnap. The theory of this special case properly contains that developed in earlier research by the author, on logic programming using Kleene’s three-valued logic.
Query Optimization in the Databases Distributed by Means of Product Equivalence Relations
Authors: Marek W. , Rauszer C.
Published: May 2021

In this paper, we address the problem of query optimization in distributed databases. We show that horizontal partitions of databases, generated by products of equivalence relations, induce optimization techniques for the basic database operations (i.e., the selection, projection, and join operators). In the case of selection, our method allows for restriction of the number of blocks to be searched in the selection process and subsequent simplification of the selection formula at each block. For the natural join operation, we propose an algorithm that reduces the computation of fragments. Proofs of the correctness of our algorithms are also included.
Solving the Linguistic Problems in Learning
Authors: Banerji Ranan B.
Published: May 2021

In some previous papers I have made efforts at drawing attention to some crucial representational problems standing in the way of learning and at clarifying the technical underpinnings of these. These problems occur both in learning from examples and in learning from explanations. In the introduction to this paper these problems are reiterated in summary. It is also pointed out that they have direct implications in the way one attaches statistical significance to concepts learned from examples. Later sections to this paper describes an effort being made at present to develop a learning algorithm which uses a flexible language of representation. The algorithm has a limited amount of ability to modify the representation language. The limitations of the method are also discussed.
Bialgebras: Some Foundations for Distributed and Concurrent Computation1
Authors: Benson David B.
Published: May 2021

A categorical bimonoid consists of a monoid and a comonoid which act homomorphically on one another. In applications bimonoids are typically called bialgebras or Hopf algebras. The definitions are given at a level suitable to computer science applications and examples are included. The elements of the theory of graded bialgebras are developed and we provide a universal recursion theorem for morphisms between algebras and between coalgebras. With this theory we explicate refinements of concurrent programs and give a treatment of traces. The concluding section characterizes all coalgebras which interact with the match algebra to form a bialgebra and characterizes all algebras which interact with the fork (diagonal) coalgebra to form a bialgebra.
A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata
Authors: Fülop Z. , Vágvölgyi S.
Published: May 2021

The concept of top-down tree automata with prefix look-ahead is introduced. It is shown that a tree language is the set of irreducible trees of a left-linear term rewriting system if and only if it can be recognized by a one-state deterministic top-down tree automaton with pre fix look-ahead.
Vector Controlled Concurrent Systems Part I: Basic Classes
Authors: Keesmaat N.W. , Kleijn H.C.M. , Rozenberg G.
Published: May 2021

A model of concurrent systems, called Vector Controlled Concurrent Systems, is introduced. It generalizes the vector synchronization mechanism used in path expressions (COSY). In this first part of the paper, which consists of two parts, the basic model is introduced and motivated, and then a distinction is made between static and dynamic submodels.
Towards Average Complexity of Propositional Binary Prolog Programs
Authors: Kleine Büning Hans , Löwen Ulrich
Published: May 2021

We investigate the average complexity of various classes of binary propositional Prolog programs. We consider classes of tree-like programs introducing a concept of unary and binary edges in a tree to manage situations where a consequence A ← B of a Prolog program can be derived in several ways. We establish exponential lower bounds for the average complexity of tree-like Prolog programs having no facts and we have polynomial upper bounds for various classes of tree-like Prolog programs with facts. These results should be considered as a first step towards the average complexity of propositional Prolog programs.
A Note on Pf(k) – Parsable Languages
Authors: Balanescu Tudor , Gheorghe Marian
Published: May 2021

This paper investigates the class of regular languages which are pf(k) – parsable. It is shown that k induces an infinite hierarchy in the family of regular languages and that every regular language is a homomorphic image of a pf(O) -parsable language. A pumping lemma for pf – parsable languages is also provided.
Closed Sets of Boolean Terms in Relational Databases
Authors: Jankowski Andrzej , Michalewicz Zbigniew
Published: May 2021

A number of approaches have been taken to represent compound, structured values in relational databases. We review a few such approaches and discuss a new approach, in which every set is represented as a Boolean term. We show that this approach generalizes the other approaches, leading to more flexible representation. Boolean term representation seems to be appropriate in handling incomplete information: this approach generalizes some other approaches (e.g. null value mark, null variables, etc). We consider definitions of algebraic operations on such sets, like join, union, selection, etc. Moreover, we introduce a measure of computational complexity of these operations.
Three-Valued Predicates for Software Specification and Validation
Authors: Blikle Andrzej
Published: May 2021

Partial functions, hence also partial predicates, cannot be avoided in algorithms. However, in spite of the fact that partial functions have been formally introduced into the theory of software very early, partial predicates are still not quite commonly recognized. In many programming- and software-specification languages partial Boolean expressions are treated in a rather simplistic way: the evaluation of a Boolean sub-expression to an error leads to the evaluation of the hosting Boolean expression to an error and, in the consequence, to the abortion of the whole program. This technique is known as an eager evaluation of expressions. A more practical approach to the evaluation of expressions – gaining more interest today among both theoreticians and programming-language designers – is lazy evaluation. Lazily evaluated Boolean expressions correspond to (non-strict) three-valued predicates where the third value represents both an error and an undefinedness. On the semantic ground this leads to a three-valued propositional calculus, three-valued quantifiers and an appropriate logic. This paper is a survey-essay devoted to the discussion and the comparison of a few three-valued propositional and predicate calculi and to the discussion of the author’s claim that a two-valued logic, rather than a three-valued logic, is suitable for the treatment of programs with three-valued Boolean expressions. The paper is written in a formal but not in a formalized style. All discussion is carried on a semantic ground. We talk about predicates (functions) and a semantic consequence relation rather than about expressions and inference rules. However, the paper is followed by more formalized works which carry our discussion further on a formalized ground, and where corresponding formal logics are constructed and discussed.
Interpolation in Conditional Equational Logic1
Authors: Rodenburg P.H.
Published: May 2021

In a natural formulation, Craig’s interpolation theorem is shown to hold for conditional equational logic.
Dynamic Congruence vs. Progressing Bisimulation for CCS1
Authors: Montanari Ugo , Sassone Vladimiro
Published: May 2021

Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still woc, e.g. α.τ.β.nil and α.β.nil are woc but τ.β.nil and β.nil are not. This fact prevent us from characterizing CCS semantics (when τ is considered invisible) as a final algebra, since the semantic function would induce an equivalence over the agents that is both a congruence and a bisimulation. In the paper we introduce a new behavioural equivalence for CCS agents, which is the coarsest among those bisimulations which are also congruences. We call it Dynamic Observational Congruence because it expresses a natural notion of equivalence for concurrent systems required to simulate each other in the presence of dynamic, i.e. run time, (re)configurations. We provide an algebraic characterization of Dynamic Congruence in terms of a universal property of finality. Furthermore we introduce Progressing Bisimulation, which forces processes to simulate each other performing explicit steps. We provide an algebraic characterization of it in terms of finality, two logical characterizations via modal logic in the style of HML and a complete axiomatization for finite agents (consisting of the axioms for Strong Observational Congruence and of two of the three Milner’s τ-laws). Finally, we prove that Dynamic Congruence and Progressing Bisimulation coincide for CCS agents.
Inductive Modal Logics1
Authors: Vakarelov Dimiter
Published: May 2021

The main aim of this paper is to study inductive modal logics – bi-modal logics, containing the Segerberg’s induction axiom Seg, known from PDL. An adequate semantical characterization of Seg is given, and completeness theorems for a number of inductive modal logics are proved by a generalization of Segerberg’s filtration from PDL.
Many-Vawed Modal Logics II
Authors: Fitting Melvin
Published: May 2021

Suppose there are several experts, with some dominating others (expert A dominates expert B if B says something is true whenever A says it is). Suppose, further, that each of the experts has his or her own view of what is possible – in other words each of the experts has their own Kripke model in mind (subject, of course, to the dominance relation that may hold between experts). How will they assign truth values to sentences in a common modal language, and on what sentences will they agree? This problem can be reformulated as one about many-valued Kripke models, allowing many-valued accessibility relations. This is a natural generalization of conventional Kripke models that has only recently been looked at. The equivalence between the many-valued version and the multiple expert one will be formally established. Finally we will axiomatize many-valued modal logics, and sketch a proof of completeness.
On the Decidability and Complexity of Autoepistemic Reasoning1
Authors: Niemelä Ilkka N.F.
Published: May 2021

The decidability and computational complexity of autoepistemic reasoning is investigated in a general setting where the autoepistemic logic CLae built on top of a given classical logic CL is studied. Correct autoepistemic conclusions from a set of premises are defined in terms of expansions of the premises. Three classes of expansions are studied: Moore style stable expansions, enumeration based expansions, and L-hierarchic expansions. A simple finitary characterization for each type of expansions in CLae is developed. Using the characterizations conditions ensuring that a set of premises has at least one or exactly one stable expansion can be stated and an upper bound for the number of stable expansions of a set of premises can be given. With the aid of the finitary characterizations results on decidability and complexity of autoepistemic reasoning are obtained. E.g., it is shown that autoepistemic reasoning based on each of the three types of expansions is decidable if the monotonic consequence relation given by the underlying classical logic is decidable. In the propositional case decision problems related to the three classes of expansions are shown to be complete problems with respect to the second level of the polynomial time hierarchy. This implies that propositional autoepistemic reasoning is strictly harder than classical propositional reasoning unless the polynomial time hierarchy collapses.
Generalized Derivatives
Authors: Kari Lila
Published: May 2021

The customary language-theoretic derivative of a word u with respect to a word v means the deletion of v from the beginning or end of u. We investigate the natural generalization, where v can be deleted from an arbitrary position in u. Apart from general closure and decidability properties, we pay special attention to regular languages, obtaining an exhaustive characterization.
An Abstract Strategy for Transforming Logic Programs 1
Authors: Proietti Maurizio , Pettorossi Alberto
Published: May 2021

We study the problem of automating some development techniques for logic programs. These techniques are based on the application of semantics preserving transformation rules which are driven by strategies. We propose an abstract strategy which is parametrized by three mathematical functions called definition-folding, selection, and replacement. Once these three functions are supplied, our abstract strategy becomes a concrete one which can be used during program development for driving the application of the Definition, Folding, Unfolding, and Goal Replacement Rules. We show that the definition-folding function can be determined in an automatic way from the description of the syntactic properties of the program we wish to derive. We also show through some examples that many program derivation strategies described in the literature, such as the methodology for eliminating unnecessary variables, the tupling strategy, the partial deduction techniques, and the promotion strategy, can be viewed as particular instances of our abstract strategy.
A Fully Precise Null Extended Nested Relational Algebra
Authors: Levene Mark , Loizou George
Published: May 2021

The nested relational model extends the fiat relational model by relaxing the first normal form assumption in order to allow the modelling of complex objects. Recently many extended algebras have been suggested for the nested relational model, but only few have incorporated null values into the attribute domains. Furthermore, some of the previously defined extended algebras are defined only over a subclass of nested relations, and all of them are difficult to use, since the user must know the detailed structure of the nested relations being queried. Herein, we define an extended algebra for nested relations, which may contain null values, called the null extended algebra. The null extended algebra is defined over the general class of nested relations with null values and, in addition, allows queries to be formulated without the user having to know the detailed structure of the nested relations being queried. In this sense, our null extended join operator of the null extended algebra is unique in the literature, since it joins two nested relations by taking into account all their common attributes at all levels of their structure, whilst operating directly on the two nested relations. All the operators of the null extended algebra are proved to be faithful and precise. The null extended algebra is a complete extended algebra in the context of nested relations, and, in addition, it includes the null extended powerset operator, which provides recursion and iteration facilities.
On Dependence in Wille’s Contexts
Authors: Novotný Jiři , Novotný Miroslav
Published: May 2021

A concept in Wille’s context can be generated starting with a set of features. The problem of finding a minimal subset of the given set of features that generates the same concept as the given one is solved using a suitable dependence space and constructing reducts of one of its subsets. This result can be applied to information systems where it enables to cancel superfluous values of attributes.
Self-Verifying Pushdown and Queue Automata
Authors: Fernau Henning , Kutrib Martin , Wendlandt Matthias
Published: May 2021

We study the computational and descriptional complexity of self-verifying pushdown automata (SVPDA) and self-verifying realtime queue automata (SVRQA). A self-verifying automaton is a nondeterministic device whose nondeterminism is symmetric in the following sense. Each computation path can give one of the answers yes, no, or do not know. For every input word, at least one computation path must give either the answer yes or no, and the answers given must not be contradictory. We show that SVPDA and SVRQA are automata characterizations of so-called complementation kernels, that is, context-free or realtime nondeterministic queue automaton languages whose complement is also context free or accepted by a realtime nondeterministic queue automaton. So, the families of languages accepted by SVPDA and SVRQA are strictly between the families of deterministic and nondeterministic languages. Closure properties and various decidability problems are considered. For example, it is shown that it is not semidecidable whether a given SVPDA or SVRQA can be made self-verifying. Moreover, we study descriptional complexity aspects of these machines. It turns out that the size trade-offs between nondeterministic and self-verifying as well as between self-verifying and deterministic automata are non-recursive. That is, one can choose an arbitrarily large recursive function f, but the gain in economy of description eventually exceeds f when changing from the former system to the latter.
Decidability Questions for Insertion Systems and Related Models
Authors: Malcher Andreas
Published: May 2021

Insertion systems or insertion grammars are a generative formalism in which words can only be generated by starting with some axioms and by iteratively inserting strings subject to certain contexts of a fixed maximal length. It is known that languages generated by such systems are always context sensitive and that the corresponding language classes are incomparable with the regular languages. On the other hand, it is possible to generate non-semilinear languages with systems having contexts of length two. Here, we study decidability questions for insertion systems. On the one hand, it can be seen that emptiness and universality are decidable. Moreover, the fixed membership problem is solvable in deterministic polynomial time. On the other hand, the usually studied decidability questions such as, for example, finiteness, inclusion, equivalence, regularity, inclusion in a regular language, and inclusion of a regular language turn out to be undecidable. Interestingly, the latter undecidability results can be carried over to other models which are basically able to handle the mechanism of inserting strings depending on contexts. In particular, new undecidability results are obtained for pure grammars, restarting automata, clearing restarting automata, and forgetting automata.
Languages Accepted by Weighted Restarting Automata*
Authors: Wang Qichao
Published: May 2021

Weighted restarting automata have been introduced to study quantitative aspects of computations of restarting automata. In earlier works we studied the classes of functions and relations that are computed by weighted restarting automata. Here we use them to define classes of formal languages by restricting the weight associated to a given input word through an additional requirement. In this way, weighted restarting automata can be used as language acceptors. First, we show that by using the notion of acceptance relative to the tropical semiring, we can avoid the use of auxiliary symbols. Furthermore, a certain type of word-weighted restarting automata turns out to be equivalent to non-forgetting restarting automata, and another class of languages accepted by word-weighted restarting automata is shown to be closed under the operation of intersection. This is the first result that shows that a class of languages defined in terms of a quite general class of restarting automata is closed under intersection. Finally, we prove that the restarting automata that are allowed to use auxiliary symbols in a rewrite step, and to keep on reading after performing a rewrite step can be simulated by regular-weighted restarting automata that cannot do this.
Identification of Mild Cognitive Impairment Among Chinese Based on Multiple Spoken Tasks
Authors: Wang Tianqi , Hong Yin , Wang Quanyi , Su Rongfeng , Ng Manwa Lawrence , Xu Jun , Wang Lan , Yan Nan
Published: May 2021

Background: Previous studies explored the use of noninvasive biomarkers of speech and language for the detection of mild cognitive impairment (MCI). Yet, most of them employed single task which might not have adequately captured all aspects of their cognitive functions. Objective: The present study aimed to achieve the state-of-the-art accuracy in detecting individuals with MCI using multiple spoken tasks and uncover task-specific contributions with a tentative interpretation of features. Methods: Fifty patients clinically diagnosed with MCI and 60 healthy controls completed three spoken tasks (picture description, semantic fluency, and sentence repetition), from which multidimensional features were extracted to train machine learning classifiers. With a late-fusion configuration, predictions from multiple tasks were combined and correlated with the participants’ cognitive ability assessed using the Montreal Cognitive Assessment (MoCA). Statistical analyses on pre-defined features were carried out to explore their association with the diagnosis. Results: The late-fusion configuration could effectively boost the final classification result (SVM: F1 = 0.95; RF: F1 = 0.96; LR: F1 = 0.93), outperforming each individual task classifier. Besides, the probability estimates of MCI were strongly correlated with the MoCA scores (SVM: –0.74; RF: –0.71; LR: –0.72). Conclusion: Each single task tapped more dominantly to distinct cognitive processes and have specific contributions to the prediction of MCI. Specifically, picture description task characterized communications at the discourse level, while semantic fluency task was more specific to the controlled lexical retrieval processes. With greater demands on working memory load, sentence repetition task uncovered memory deficits through modified speech patterns in the reproduced sentences.
Subway passenger flow analysis and management optimization model based on AFC data
Authors: Sun Jie , Yao Jiajun , Wang Manxi
Published: May 2021

With the development of the city, the passenger flow pressure of subway is increasing. At the same time, the daily travel of subway passengers produce a large amount of data such as inbound and outbound. How to use the big data to analyze the passenger flow is the key to solve the problems of crowded carriages and insufficient capacity in peak hours, high empty load rate in low hours and long waiting time for passengers. Based on the AFC data of Beijing subway system, this paper analyzes the temporal and spatial distribution characteristics of the passenger flow in the subway network. At the same time, taking subway line 5 as an example, it quantitatively calculates the imbalance coefficient of passenger flow in time, section and direction. Combined with the calculation results, it also proposes management optimization model and gives some adviceto the subway operation department from the aspects ofpassenger organization and transport management.
Trusted computing in power distribution IoT: A fuzzy set theory based analysis
Authors: Zhang Fan , Huang Yusu
Published: May 2021

As emerging technologies in information security protection, trusted computing and blockchain can guarantee a safe and reliable operating environment and management mechanism in the Power Distribution IoT. Relying on the comprehensive evaluation algorithm of fuzzy mathematics set theory in this paper, a blockchain-based distributed decision-making and collaborative autonomy model for the power distribution IoT is built, and the “manageable and controllable, precise protection, visible and credible, and smart defense” security protection model is established to carry out trusted computing and privacy protection of computer blockchain IoT nodes, and the information security defense level of the distribution network is improved comprehensively.
An archetype for mitigating the security threats in multi-cloud environment by implementing tree-based next-generation firewalls
Authors: Hussain Muhammad Iftikhar , He Jingsha , Zhu Nafei , Ali Zardari Zulfiqar , Razque Fahad , Hussain Saqib , Pathan Muhammad Salman
Published: May 2021

Cloud computing on-demand dynamicity in nature of end-user that leads towards a hybrid cloud model deployment is called a multi-cloud. Multi-cloud is a multi-tenant and multi-vendor heterogeneous cloud platform in terms of services and security under a defined SLA (service level agreement). The diverse deployment of the multi-cloud model leads to rise in security risks. In this paper, we define a multi-cloud model with hybridization of vendor and security to increase the end-user experience. The proposed model has a heterogeneous cloud paradigm with a combination of firewall tracts to overcome rising security issues. The proposed work consists of three steps, firstly, all incoming traffic from the consumer end into five major groups called ambient. Secondly, design a next-generation firewall (NGFW) topology with a mixture of tree-based and demilitarized zone (DMZ) implications. Test implementation of designed topology performed by using a simple DMZ technique in case of vendor-specific model and NGFW on hybrid vendor based multi-cloud model. Furthermore, it also defines some advantages of NGFW to overcome these concerns. The proposed work is helpful for the new consumer to define their dynamic secure cloud services under a single SLA before adopting a multi-cloud platform. Finally, results are compared in terms of throughput and CPU utilization in both cases.
A fuzzy multiple linear regression model based on meteorological factors for air quality index forecast
Authors: Gu Yujie , Zhao Yuxiu , Zhou Jian , Li Hui , Wang Yujie
Published: May 2021

Air quality index (AQI) is an indicator usually issued on a daily basis to inform the public how good or bad air quality recently is or how it will become over the next few days, which is of utmost importance in our life. To provide a more practicable way for AQI prediction, so that residents can clear about air conditions and make further plans, five imperative meteorological indicators are elaborately selected. Accordingly, taking these indicators as independent variables, a fuzzy multiple linear regression model with Gaussian fuzzy coefficients is proposed and reformulated, based on the linearity of Gaussian fuzzy numbers and Tanaka’s minimum fuzziness criterion. Subsequently, historical data in Shanghai from March 2016 to February 2018 are extracted from the government database and divided into two parts, where the first half is statistically analyzed and used for formulating four seasonal fuzzy linear regression models in views of the special climate environment of Shanghai, and the second half is used for prediction to validate the performance of the proposed model. Furthermore, considering that there is beyond dispute that triangular fuzzy number is more prevalent and crucial in the field of fuzzy studies for years, plenty of comparisons between the models based on the two types of fuzzy numbers are carried out by means of the three measures including the membership degree, the fuzziness and the credibility. The results demonstrate the powerful effectiveness and efficiency of the fuzzy linear regression models for AQI prediction, and the superiority of Gaussian fuzzy numbers over triangular fuzzy numbers in presenting the relationships between the meteorological factors and AQI.
Infrared and visible image fusion via rolling guidance filter and convolutional sparse representation
Authors: Liu Feiqiang , Chen Lihui , Lu Lu , Jeon Gwanggil , Yang Xiaomin
Published: May 2021

Infrared (IR) and visible (VIS) image fusion technology combines the complementary information of the same scene from IR and VIS imaging sensors to generate a composite image, which is beneficial to post image-processing tasks. In order to achieve good fusion performance, a method by combining rolling guidance filter (RGF) and convolutional sparse representation (CSR) is proposed. In the proposed method, RGF is performed on every pre-registered IR and VIS source images to obtain their detail layers and base layer. Then, the detail layers are fused with a serious of weighted coefficients produced by joint bilateral filer (JBF). The base layer is decomposed into a sub-detail-layer and a sub-base-layer. CSR is applied to fuse the sub-detail-layer and averaging strategy is used to fuse the sub-base-layer. Finally, the fused image is reconstructed by adding the fused detail layer and base layer. Experimental results demonstrate the superiority of our proposed method both in subjective and objective assessment.
Some methods to construct t-norms and t-conorms on bounded lattices
Authors: Aşıcı Emel
Published: May 2021

In this paper, we give construction methods for triangular norms (t-norms) and triangular conorms (t-conorms) on appropriate bounded lattices. Then, we compare our methods and well-known methods proposed in [2, 8, 19]. Finally, we give different construction methods for t-norms and t-conorms on an appropriate bounded lattice by using recursion. Also, we provide some examples to discuss introduced methods.
Human cognitive functions and psycho-physiological responses under low thermal conditions in a simulated office environment
Authors: Sepehri Shiva , Aliabadi Mohsen , Golmohammadi Rostam , Babamiri Mohammad
Published: May 2021

BACKGROUND: In office environments, thermal comfort is one of the most significant factor affecting employees’ performance. OBJECTIVE: This study aimed to determine the effects of exposure to low air temperatures on human cognitive performance, physiological responses, and thermal perceptions during mental work. METHODS: Twenty-four volunteers with an age range of 18–30 years participated in this study. The subjects were exposed to four different air temperatures (10, 14, 18, and 22°C) in a climate chamber based on a within-subject design. The n-back, CPT, and PVT tests were employed to evaluate some basic aspects of cognitive performance. Body physiological responses and the subjective thermal comfort were also measured. RESULTS: When the thermal condition deviated from relatively neutral temperature, the subjects’ cognitive responses significantly disturbed (P < 0.05), such that the response accuracy was more affected by reduction of air temperature. The blood pressures and heart rate, galvanic skin response, and respiration rate increased as the air temperature decreased (P < 0.05), such that the galvanic skin response as a stress indicator was more affected. In the test configurations, as a result of decrease in air temperature of 1°C, the finger and body skin temperatures reduced to 0.74°C and 0.25°C, respectively. CONCLUSIONS: The findings confirmed that low thermal condition can considerably affect cognitive performance and physiological responses during some office work tasks. The subjects’ thermal comfort votes proposed that air temperature lower than 14 °C can be intolerable for employees during routine mental work. It is suggested that personalized conditioning systems should be used to provide individual thermal comfort in moderate cold air conditions.
Adaptación al español de la Escala de Autocontrol y de la Escala de Autocontrol-Abreviada y evidencias de validez en población universitaria
Authors: Del Valle Macarena Verónica , Galli Juan Ignacio , Urquijo Sebastián , Canet Juric Lorena
Published: May 2021

The aim of the study was to adapt and validate the Self-Control Scale (SCS) and the Brief Self-Control Scale (BSCS) for the Spanish-speaking population. We worked with a sample of 430 students from the National University of Mar del Plata (279 women and 151 men) with an average age of 23.38 (SD = 5.69). The Exploratory Factor Analysis revealed in the SCS a three-factor structure. The factors were named as Non-reflective control of impulses, Self-discipline and Reflective control of impulses. In the BSCS, a two-factor structure was found. Factors were named Self-Discipline and Control of the impulses. Both the SCS and the BSCS presented good model fit index and adequate values of internal consistency. Evidence of concurrent and convergent validity is also presented through associations with measures of impulsivity and responsibility, respectively. It is concluded that both scales are valid for the population under study.
State regulation of the agro-industrial complex in the context of the implementation of Russia's strategic development objectives in terms of export potential
Authors: Zagurskiy A.
Published: May 2021

Abstract. Purpose. The study is aimed at studying and justifying the need for the use of special tools of state regulation of the agro-industrial complex, through the use of implemented measures of national projects, in terms of their export component. Methods. In the course of the study, methods of observation, abstraction, analysis and synthesis were used. The methodological and conceptual foundations of state regulation of the agro – industrial complex through the use of special regulatory tools-strategic development measures (national projects) are presented. Results and practical significance. In the study presented by the author, on the example of the Sverdlovsk region, a scientific assessment of the implementation of national projects in terms of the development of the export component of the agro-industrial complex is given, the main risks of fulfilling strategic tasks are investigated, the author's idea of the qualitative characteristics of national projects in terms of the development of the export potential of the national agro-industrial complex is given. The prospects for the development of the export potential of the national agro-industrial complex, and the quality of implementation of strategic development objectives in the conditions of continuing restrictions caused by the coronavirus pandemic are evaluated. Scientific novelty of the research. The article presents the results of a study of the development of the system of state regulation of the agro-industrial complex in relation to special regulatory instruments in the context of the need to implement strategic development measures, including increasing the export potential of the national agro-industrial complex. The risks of implementing the relevant measures are analyzed on the example of the Sverdlovsk region. The author's idea of the qualitative characteristics of the implementation of national projects, in relation to the export component of the agro-industrial complex, as a special regulatory tool is presented.
La tenencia de la tierra en Cuba
Authors: Dorta-Duque, S. I. Francisco
Published: May 2021

.
Lección de una vida: Severio Aznar
Authors: Del Valle E.
Published: May 2021

.
Fenomenología humana
Authors: Archanco Royo Anselmo
Published: May 2021

.
Rendimiento académico en universitarios españoles: el papel de la personalidad y la procrastinación académica
Authors: Hidalgo-Fuentes Sergio , Martínez-Álvarez Isabel , Sospedra-Baeza María Josefa
Published: May 2021

La procrastinación académica es un comportamiento común en la educación superior con una variedad de consecuencias negativas. El objetivo del presente estudio es investigar las relaciones entre los factores de personalidad del modelo de los Cinco Grandes (extraversión, neuroticismo, afabilidad, responsabilidad y apertura a la experiencia), la procrastinación académica y el rendimiento académico. Los participantes fueron 195 estudiantes universitarios españoles (77.4% mujeres y 22.6% hombres), con edades comprendidas entre los 18 y 51 años (M = 21.39; DT = 4.58). El Ten-Item Personality Inventory se utilizó para evaluar los factores de personalidad del modelo de los Cinco Grandes y la Academic Procrastination Scale-Short Form se usó para medir la procrastinación académica. Los análisis de correlación mostraron que el rendimiento académico estaba positivamente relacionado con la responsabilidad y negativamente relacionado con la procrastinación académica. Realizando análisis de regresión jerárquica, controlando la edad y el sexo, se encontró que tanto los Cinco Grandes como la procrastinación académica predijeron parte de la varianza del rendimiento académico. Este estudio contribuye a la literatura que ha examinado la relación entre factores de personalidad, procrastinación académica y rendimiento académico.
Effect of the chemical vapor deposition condition on the electrochemically catalytic efficiency for hydrogen evolution reaction in MoS2 nanoparticles
Authors: Do Quyen Le , Nguyen Duc Anh
Published: May 2021

Introduction: Using the metal organic chemical vapor deposition (MOCVD) method, we have synthesized the MoS2 nanoparticles on graphite foil substrates employed as the electrochemical working electrodes with highly efficient electrocatalysis for hydrogen evolution reaction (HER).

Methods: The morphological and structural properties of the as-grown MoS2 materials were demonstrated by field emission scanning electron microscope (FESEM) and Raman spectroscopies, while their elemental components were investigated by X-ray photoelectron spectroscopy (XPS).

Results: The optimum growth time was acquired to be 11 hours. Thereby such obtained electrode exhibited the maximum HER activity with onset over the potential of 220 mV versus reversible hydrogen electrode (RHE), and the Tafel slope of 66 mV per decade (mV/dec).

Conclusion: Our results suggest a good technique for the research of high-efficient HER electrocatalyst based on atomic-thickness layered materials.
The Balance of Power System of the Middle East
Authors: Selján Péter
Published: May 2021

Since the onset of the Arab Spring, there has been a growing interest in the changing balance of power of the Middle East. The balance of power theory in global context has been extensively studied. However, little research has been dedicated to the theory’s  applicability solely at the regional level, especially with the contemporary Middle East in focus, while the region is suffering from armed conflicts involving virtually all the regional states as well as the great powers and many different non-state actors. This paper is an  attempt to shed light on the applicability of the balance of power concept and the theory of omnibalancing in relation to the Middle  East through reviewing the relevant literature.
Artificial Intelligence as a Dual-use Technology
Authors: Ambrus Éva
Published: May 2021

The aim of this article is to give an overview of the state of artificial intelligence regarding malware attacks, its uses in the military and views regarding if it should be classified as a dual-use technology. As an emerging technology, with a wide variety of use and capabilities, more could be done to overview its uses, and some form of control over it. While the classical exports control might be counterproductive, a more closed approach towards critical information dissemination might be advisable until the full range of capabilities of artificial intelligence will be known.