bluuebunny/crossref_metadata_2025 huggingface dataset:
Algorithms Determining Matrix Morsifications, Weyl orbits, Coxeter Polynomials and Mesh Geometries of Roots for Dynkin Diagrams
Authors: Simson Daniel
Published: December 2019

By computer algebra technique and computer computations, we solve the mesh morsification problems 1.10 and present a classification of irreducible mesh roots systems, for some of the simply-laced Dynkin diagrams $\rmDelta \in \{\mathbb{A}_n,\mathbb{D}_n, \mathbb{E}_6, \mathbb{E}_7, \mathbb{E}_8\}$. The methods we use show an importance of computer algebra tools in solving difficult modern algebra problems of enough high complexity that had no solution by means of standard theoretical tools only. Inspired by results of Sato [Linear Algebra Appl. 406(2005), 99-108] and a mesh quiver description of indecomposable representations of finite-dimensional algebras and their derived categories explained in [London Math. Soc. Lecture Notes Series, Vol. 119, 1988] and [Fund. Inform. 109(2011), 425-462] (see also 5.11), given a Dynkin diagram Δ, with n vertices and the Euler quadratic form q$_\rmDelta : \mathbb{Z}^n \rightarrow \mathbb{Z}$, we study the set Mor$_\rmDelta \subseteq \mathbb{M}_{n} (\mathbb{Z})$ of all morsifications of q$_\rmDelta$ [37], i.e., the non-singular matrices A $in \mathbb{M}_{n}(\mathbb{Z})$ such that its Coxeter matrix Cox$_A$ := -A · A$^{-tr}$ lies in Gl(n, \mathbb{Z}) and q$_{\rmDelta}$ (v) = v · A · v$^{tr}$, for all v $\in \mathbb{Z}n$. The matrix Weyl group \mathbb{W}$_\rmDelta$ (2.13) acts on Mor$_\rmDelta$ and the determinant detA $\in$ \mathbb{Z}, the order cA $\ge2$ of CoxA (i.e. the Coxeter number), and the Coxeter polynomial cox$_A$ (t) := det(t ·E-Cox$_A$) $\in$ \mathbb{Z}[t] are $\mathbb{W}_\rmDelta$-invariant. Moreover, the finite set $R_{q\rmDelta} = \{v \in \mthbb{Z}^n; q_\rmDelta (v) = 1\}$ of roots of q$_\rmDelta$ is Cox$_A$- invariant. The following problems are studied in the paper: (a) determine the $\mathbb{W}_\rmDelta$-orbits \cal{Orb}(A) of Mor$_\rmDelta$ and the set $\cal{CPol}_\rmDelta = \{cox_{A}(t); A \in Mor_\rmDelta\}$, (b) construct a finite minimal Cox$_A$-mesh quiver in $\mathbb{Z}^n$ containing all Cox$_A$-orbits of the finite set $R_{q\rmDelta}$ of roots of q$_\rmDelta$;. We prove that \cal{CPol}$_\rmDelta$ is a finite set and we construct algorithms allowing us to solve the problems for the morsifications $A = [a_{ij}] \in Mor_\rmDelta$, with $|a_{ij}| \le 2$. In this case, by computer algebra technique and computer computations, we prove that, for $n \le 8$, the number of the $\mathbb{W}_\rmDelta$-orbits \cal{Orb}(A) is at most 6, $s_\rmDelta := |\cal{CPol}_\rmDelta| \le 9$ and, given A,A' $\in$ Mor$_\rmDelta$ and $n \le 7$, the following three conditions are equivalent: (i) A' = $B^{tr}$ · A · B, for some B $\in$ Gl(n, \mathbb{Z}), (ii) cox$_{A}$(t) = cox$_{A'}$ (t), and (iii) cA · det A = c$_{A'}$ · det A'. We also show that s$_{\rmDelta}$ equals 6, 5, and 9, if $\rmDelta$ is the diagram $\mathbb{E}_6$, $\mathbb{E}_7$, and $\mathbb{E}_8$, respectively.
Learning Behaviors of Functions with Teams
Authors: Kalyanasundaram Bala , Velauthapillai Mahe
Published: December 2019

We consider the inductive inference model of Gold [15]. Suppose we are given a set of functions that are learnable with certain number of mind changes and errors. What can we consistently predict about those functions if we are allowed fewer mind changes or errors? In [20] we relaxed the notion of exact learning by considering some higher level properties of the input-output behavior of a given function. in this context, a learner produces a program that describes the property of a given function. Can we predict generic properties such as threshold or modality if we allow fewer number of mind changes or errors? These questions were completely answered in [20] when the learner is restricted to a single IIM. In this paper we allow a team of IIMs to collaborate in the learning process. The learning is considered to be successful if any one of the team member succeeds. A motivation for this extension is to understand and characterize properties that are learnable for a given set of functions in a team environment.
A Framework for Coxeter Spectral Analysis of Edge-bipartite Graphs, their Rational Morsifications and Mesh Geometries of Root Orbits
Authors: Simson Daniel
Published: December 2019

Following the spectral Coxeter analysis of matrix morsifications for Dynkin diagrams, the spectral graph theory, a graph coloring technique, and algebraic methods in graph theory, we continue our study of the category 𝒰ℬigrn of loop-free edge-bipartite (signed) graphs Δ, with n ≥ 2 vertices, by means of the Coxeter number cΔ, the Coxeter spectrum speccΔ of Δ, that is, the spectrum of the Coxeter polynomial coxΔ(t) ∈ $\mathbb{Z}$[t] and the $\mathbb{Z}$-bilinear Gram form bΔ : $\mathbb{Z}$n × $\mathbb{Z}$n → $\mathbb{Z}$ of Δ [SIAM J. Discrete Math. 27(2013)]. Our main inspiration for the study comes from the representation theory of posets, groups and algebras, Lie theory, and Diophantine geometry problems. We show that the Coxeter spectral classification of connected edge-bipartite graphs Δ in 𝒰ℬigrn reduces to the Coxeter spectral classification of rational matrix morsifications A ∈ $\widehat{M}$orDΔ for a simply-laced Dynkin diagram DΔ associated with Δ. Given Δ in 𝒰ℬigrn, we study the isotropy subgroup Gl(n,$\mathbb{Z}$)Δ of Gl(n, $\mathbb{Z}$) that contains the Weyl group $\mathbb{W}$Δ and acts on the set $\widehat{M}$orΔ of rational matrix morsifications A of Δ in such a way that the map A $\mapsto$ (speccA, det A, cΔ) is Gl(n, $\mathbb{Z}$)Δ-invariant. It is shown that, for n ≤ 6, speccΔ is the spectrum of one of the Coxeter polynomials listed in Tables 3.11-3.11(a) (we determine them by computer search using symbolic and numeric computation). The question, if two connected positive edge-bipartite graphs Δ,Δ′ in 𝒰ℬigrn, with speccΔ = speccΔ′, are $\mathbb{Z}$-bilinear equivalent, is studied in the paper. The problem if any $\mathbb{Z}$-invertible matrix A ∈ Mn($\mathbb{Z}$) is $\mathbb{Z}$-congruent with its transpose Atr is also discussed.
A Complete Generalization of Atkin's Square Root Algorithm
Authors: Rotaru Armand Stefan , Iftene Sorin
Published: December 2019

Atkin's algorithm [2] for computing square roots in $Z^*_p$ , where p is a prime such that p ≡ 5 mod 8, has been extended by Müller [15] for the case p ≡ 9 mod 16. In this paper we extend Atkin's algorithm to the general case p ≡ 2s + 1 mod 2s + 1, for any s ≥ 2, thus providing a complete solution for the case p ≡ 1 mod 4. Complexity analysis and comparisons with other methods are also provided.
Chameleon Hash Functions and One-Time Signature Schemes from Inner Automorphism Groups
Authors: Pan Ping , Wang Licheng , Yang Yixian , Gan Yuanju , Wang Lihua , Xu Chengqian
Published: December 2019

In this paper, we build a family of chameleon hash functions and strongly unforgeable one-time signature schemes based on the intractability assumption of the discrete logarithm problem (DLP) over inner automorphism groups. Since the DLP assumption over inner automorphism groups does not admit sub-exponential attacks, thus the sizes of the working parameters used in our constructions are shorten significantly. This leads to remarkable gains for our proposals both in running time and in storage space. In addition, as far as we know, this is the first time to build CHF and OTS based on noncommutative groups.
State Elimination Heuristics for Short Regular Expressions
Authors: Han Yo-Sub
Published: December 2019

State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). It is very hard to compute the shortest regular expression for a given FA in general and we cannot avoid the exponential blow-up. This implies that state elimination cannot avoid the exponential blow-up either. Nevertheless, since the size of a regular expression by state elimination depends on the state removal sequence, we can have a shorter regular expression if we choose a better removal sequence for state elimination. This observation motivates us to examine state elimination heuristics based on the structural properties of the input FA and implement state elimination using the heuristics that run in polynomial time. We demonstrate the effectiveness of our algorithm by experiment results.
Arithmetical Analysis of Biomolecular Finite Automaton
Authors: Krasiński Tadeusz , Sakowski Sebastian , Waldmajer Jacek , Popławski Tomasz
Published: December 2019

In the paper we present a theoretical analysis of extension of the finite automaton built on DNA (introduced by the Shapiro team) to an arbitrary number of states and symbols. In the implementation we use a new idea of several restriction enzymes instead of one. We give arithmetical conditions for the existence of such extensions in terms of ingredients used in the implementation.
The Undecidability of the Logic of Subintervals
Authors: Marcinkowski Jerzy , Michaliszyn Jakub
Published: December 2019

The Halpern–Shoham logic is a modal logic of time intervals. Some effort has been put in last ten years to classify fragments of this beautiful logic with respect to decidability of its satisfiability problem. We complete this classification by showing — what we believe is quite an unexpected result—that the logic of subintervals, the fragment of the Halpern–Shoham logic where only the operator “during”, or D, is allowed, is undecidable over discrete structures. This is surprising as this, apparently very simple, logic is decidable over dense orders and its reflexive variant is known to be decidable over discrete structures. Our result subsumes a lot of previous undecidability results of fragments that include D.
Towards a Formal Representation of Interactive Systems
Authors: Banu-Demergian Iulia Teodora , Stefanescu Gheorghe
Published: December 2019

Powerful algebraic techniques have been developed for classical sequential computation. Many of them are based on regular expressions and the associated regular algebra. For parallel and interactive computation, extensions to handle 2-dimensional patterns are often required. Finite interactive systems, a 2-dimensional version of finite automata, may be used to recognize 2-dimensional languages. In this paper we present a blueprint for getting a formal representation of parallel, interactive programs and of their semantics. It is based on a recently introduced approach for getting regular expressions for 2-dimensional patterns, particularly using words of arbitrary shapes and powerful control mechanisms on composition. We extend the previously defined class of expressions n2RE with new control features, progressively increasing the expressive power of the formalism up to a level where a procedure for generating the words accepted by finite interactive systems may be obtained. Targeted applications come from the area of modelling, specification, analysis and verification of structured interactive programs via the associated scenario semantics.
Accepting Networks of Evolutionary Picture Processors
Authors: Bottoni Paolo , Labella Anna , Mitrana Victor
Published: December 2019

We extend the study of networks of evolutionary processors accepting words to a similar model, processing rectangular pictures. To this aim, we introduce accepting networks of evolutionary picture processors and investigate their computational power. We show that these networks can accept the complement of any local picture language as well as picture languages that are not recognizable. Some open problems regarding decidability issues and closure properties are finally discussed.
Continuation Semantics for Asynchronous Concurrency
Authors: Ciobanu Gabriel , Todoran Eneia Nicolae
Published: December 2019

The paper presents a method of reasoning about the behaviour of asynchronous programs in denotational models designed with metric spaces and continuation semantics for concurrency.
A Nonarchimedian Discretization for Timed Languages
Authors: Dima Cătălin
Published: December 2019

We give a discretization of behaviors of timed automata, in which timed languages are represented as sets of words containing action symbols, a clock tick symbol 1, and two delay symbols δ− (negative delay) and δ+ (positive delay). Unlike the region construction, our discretization commutes with intersection. We show that discretizations of timed automata are, in general, context-sensitive languages over Σ ∪ {1, δ+, δ−}, and give a class of counter automata that accepts exactly the class of languages that are discretizations of timed automata, and show that its emptiness problem is decidable.
Syllabic Languages and Go-through Automata
Authors: Dinu Liviu P. , Gramatovici Radu , Manea Florin
Published: December 2019

In this paper we define a new class of contextual grammars and study how the languages generated by such grammars can be accepted by go-through automata. The newly introduced class of grammars is a generalization of the formalism previously used to describe the linguistic process of syllabification. Go-through automata which are used here to recognize, and also parse, the languages generated by this new class of grammars are generalizations of push-down automata in the area of context-sensitivity; they have been proved to be an efficient tool for the recognition of languages generated by contextual grammars. The main results of the paper show how the newly introduced generative model is related with other classes of Marcus contextual languages, and how syllabic languages are recognized and parsed using go-through automata.
Natural Language Understanding and Prediction: from Formal Grammars to Large Scale Machine Learning
Authors: Duta Nicolae
Published: December 2019

Scientists have long dreamed of creating machines humans could interact with by voice. Although one no longer believes Turing's prophecy that machines will be able to converse like humans in the near future, real progress has been made in the voice and text-based human-machine interaction. This paper is a light introduction and survey of some deployed natural language systems and technologies and their historical evolution. We review two fundamental problems involving natural language: the language prediction problem and the language understanding problem. While describing in detail all these technologies is beyond our scope, we do comment on some aspects less discussed in the literature such as language prediction using huge models and semantic labeling using Marcus contextual grammars.
Regularising Ill-posed Discrete Optimisation: Quests with P Systems
Authors: Nicolescu Radu , Gimel’farb Georgy , Morris John , Delmas Patrice , Gong Rui
Published: December 2019

We propose a novel approach to justify and guide regularisation of an ill-posed one-dimensional global optimisation with multiple solutions using a massively parallel (P system) model of the solution space. Classical optimisation assumes a well-posed problem with a stable unique solution. Most of important practical problems are ill posed due to an unstable or non-unique global optimum and are regularised to get a unique best-suited solution. Whilst regularisation theory exists largely for unstable unique solutions, its recommendations are often routinely applied to inverse optical problems with essentially non-unique solutions, e.g. computer stereo vision or image segmentation, typically formulated in terms of global energy minimisation. In these cases the recommended regularisation becomes purely heuristic and does not guarantee a unique solution. As a result, classical optimisation algorithms: dynamic programming (DP) and belief propagation (BP) – meet with difficulties. Our recent concurrent propagation (CP), leaning upon the P systems paradigm, extends DP and BP to always detect whether the problem is ill posed or not and store in the ill-posed case an entire space of solutions that yield the same global optimum. This suggests a radically new path to proper regularisation: select the best-suited unique solution by exploring statistical and structural features of this space. We propose a P systems based implementation of CP and set out as a case study an application of CP to the image matching problem in stereo vision.
Counting Dependent and Independent Strings
Authors: Zimand Marius
Published: December 2019

We derive quantitative results regarding sets of n-bit strings that have different dependency or independency properties. Let C(x) be the Kolmogorov complexity of the string x. A string y has α dependency with a string x if C(y) − C(y | x) ≥ α. A set of strings {x1, . . . , xt} is pairwise α-independent if for all i ≠ j, C(xi) − C(xi | xj) < α. A tuple of strings (x1, . . . , xt) is mutually α-independent if C(xπ(1) . . . xπ(t)) > C(x1)+. . .+C(xt) − α, for every permutation π of [t]. We show that: • For every n-bit string x with complexity C(x) ≥ α + 7 log n, the set of n-bit strings that have α dependency with x has size at least (1/poly(n))2n−α. In case α is computable from n and C(x) ≥ α + 12 log n, the size of the same set is at least (1/C)2n−α − poly(n)2α, for some positive constant C. • There exists a set of n-bit strings A of size poly(n)2α such that any n-bit string has α-dependency with some string in A. • If the set of n-bit strings {x1, . . . , xt} is pairwise α-independent, then t ≤ poly(n)2α. This bound is tight within a poly(n) factor, because, for every n, there exists a set of n-bit strings {x1, . . . , xt} that is pairwise α-dependent with t = (1/poly(n)) · 2α (for all α ≥ 5 log n). • If the tuple of n-bit strings (x1, . . . , xt) is mutually α-independent, then t ≤ poly(n)2α (for all α ≥ 7 log n + 6).
Segmental Mapping and Distance for Rooted Labeled Ordered Trees
Authors: Kan Tomohiro , Higuchi Shoichi , Hirata Kouichi
Published: December 2019

In this paper, as variations of a Tai mapping between rooted labeled ordered trees (trees, for short), we introduce a segmental mapping to preserve the parent-children relationship as possible, and also top-down segmengal and bottom-up segmental mappings as the segmental mappings that contain the pair of the roots and the pair of the leaves, respectively. Then, we show that these mappings provide a new hierarchy for the variations of the Tai mapping in addition to a well-known one, in particular, the top-down segmental mapping coincides with a top-down mapping. Also we show that both segmental and bottom-up segmental distances as the minimum costs of segmental and bottom-up segmental mappings are metrics. Next, we design algorithms to compute the segmental and the bottom-up segmental distances in quadratic time and space. Finally, we give experimental results for the segmental distance.
On the Accuracy of Rough Approximations of Regular Languages
Authors: Torres Gabriela Martín
Published: December 2019

In this paper we attempt to measure the accuracy of approximations of regular languages by languages in +−varieties (as defined by Eilenberg). These approximations are upper approximations in the sense of Pawlak’s rough set theory with respect to congruences belonging to the variety of congruences corresponding to the given +−variety. In our approach, the accuracy of an approximation is measured by the relative density of the object language in the approximation language and the asymptotic behavior of this quotient. In particular, we apply our measures of accuracy to k-definite, reverse k-definite, i, j-definite and k-testable approximations.
Graded Consequence with Fuzzy Set of Premises
Authors: Dutta Soma , Chakraborty Mihir Kr.
Published: December 2019

Fuzzy Logic a la Pavelka has been reintroduced here in terms of consequence relation instead of consequence operator. Metalogical notions like, consistency and inconsistency are proposed as graded notions. The relationship between consequence relation and inconsistency, both fuzzy here, is studied. Another metalogical notion viz., equivalence of two sets of formulae that originates from Tarski is defined and investigated in this context when the premise is a fuzzy set.
An Efficient Decoding of Goppa Codes for the McEliece Cryptosystem
Authors: Lim Seongan , Lee Hyang-Sook , Choi Mijin
Published: December 2019

The McEliece cryptosystem is defined using a Goppa code, and decoding the Goppa code is a crucial step of its decryption. Patterson's decoding algorithm is the best known algorithm for decoding Goppa codes. Currently, the most efficient implementation of Patterson's algorithm uses a precomputation. In this paper, we modify Patterson's decoding algorithm so that one can remove the precomputation part while sustaining the best efficiency. Precomputations yield additional storage requirement to store the precomputed value which increases as the security level increases in McEliece cryptosystem. In the original decoding algorithm of Patterson, computing square root in a quotient field of polynomial ring over a finite field is necessary. In our modification, the computations are involved only in the arithmetics of polynomial ring over a finite field, not in the quotient field. This achieves better efficiency because one can remove polynomial reductions in the computations of quotient field.
A Unified Definition of Consistent Functions
Authors: Zhu Ping , Xie Huiyang , Wen Qiaoyan
Published: December 2019

In recent years, homomorphisms have been exploited to compare the structures and properties of two generalized information systems. Some of these homomorphisms are based on consistent functions, which are a class of special mappings between universal sets. The purpose of this paper is to unify and extend the consistent functions in the literature into the framework of neighborhood systems. After introducing the notion of consistent functions with respect to neighborhood systems, we explore some important properties of the extended consistent functions such as preserving the inverse images and the intersections of neighborhoods. Our results provide a sound basis for further investigating neighborhood systems via homomorphisms.
Grasp and Path-Relinking for Coalition Structure Generation
Authors: Di Mauro Nicola , Basile Teresa M.A. , Ferilli Stefano , Esposito Floriana
Published: December 2019

In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition (maximizing a social welfare) of a set of entities involved in a system. The solution of the CSG problem finds applications in many fields such as Machine Learning (set covering machines, clustering), Data Mining (decision tree, discretization), Graph Theory, Natural Language Processing (aggregation), Semantic Web (service composition), and Bioinformatics. The problem of finding the optimal coalition structure is NP-complete. In this paper we present a greedy adaptive search procedure (GRASP) with path-relinking to efficiently search the space of coalition structures. Experiments and comparisons to other algorithms prove the validity of the proposed method in solving this hard combinatorial problem.
Centrality Measures, Upper Bound, and Influence Maximization in Large Scale Directed Social Networks
Authors: Pal Sankar K. , Kundu Suman , Murthy C.A.
Published: December 2019

The paper addresses the problem of finding top k influential nodes in large scale directed social networks. We propose two new centrality measures, Diffusion Degree for independent cascade model of information diffusion and Maximum Influence Degree. Unlike other existing centrality measures, diffusion degree considers neighbors' contributions in addition to the degree of a node. The measure also works flawlessly with non uniform propagation probability distributions. On the other hand, Maximum Influence Degree provides the maximum theoretically possible influence (Upper Bound) for a node. Extensive experiments are performed with five different real life large scale directed social networks. With independent cascade model, we perform experiments for both uniform and non uniform propagation probabilities. We use Diffusion Degree Heuristic (DiDH) and Maximum Influence Degree Heuristic (MIDH), to find the top k influential individuals. k seeds obtained through these for both the setups show superior influence compared to the seeds obtained by high degree heuristics, degree discount heuristics, different variants of set covering greedy algorithms and Prefix excluding Maximum Influence Arborescence (PMIA) algorithm. The superiority of the proposed method is also found to be statistically significant as per T-test.
On-the-fly Trace Generation Approach to the Security Analysis of Cryptographic Protocols: Coloured Petri Nets-based Method
Authors: Permpoontanalarp Yongyuth , Sornkhom Panupong
Published: December 2019

Most Petri nets-based methods that have been developed to analyze cryptographic protocols provide the analysis of one attack trace only. Only a few of them offer the analysis of multiple attack traces, but they are rather inefficient. Analogously, the limitation of the analysis of one attack trace occurs in most model checking methods for cryptographic protocols. In this paper, we propose a very simple but practical Coloured Petri nets-based model checking method for the analysis of cryptographic protocols, which overcomes these limitations. Our method offers an efficient analysis of multiple attack traces. We apply our method to two case studies which are TMN authenticated key exchanged protocol and Micali's contract signing protocol. Surprisingly, our simple method is very efficient when the numbers of attack traces and states are large. Also, we find many new attacks in those protocols.
An Algorithmic Construction of Finite Elliptic Curves of Order Divisible by a Large Prime
Authors: Grześkowiak Maciej
Published: December 2019

Given a square-free integer Δ < 0, we present an algorithm constructing a pair of primes p and q such that q|p + 1 − t and 4p − t2 = Δf2, where |t| ≤ 2√p for some integers f, t. Together with a CM method presented in the paper, such primes p and q are used for a construction of an elliptic curve E over a finite field $\mathbb{F}_p$ such that the order of E is divisible by a large prime. It is shown that our algorithm works in polynomial time.
Simultaneous Feature Selection and Extraction Using Feature Significance
Authors: Maji Pradipta , Garai Partha
Published: December 2019

Dimensionality reduction of a data set by selecting or extracting relevant and nonredundant features is an essential preprocessing step used for pattern recognition, data mining, machine learning, and multimedia indexing. Among the large amount of features present in real life data sets, only a small fraction of them is effective to represent the data set accurately. Prior to analysis of the data set, preprocessing the data to obtain a smaller set of representative features and retaining the optimal salient characteristics of the data not only decrease the processing time but also lead to more compactness of the models learned and better generalization. In this regard, a novel dimensionality reduction method is presented here that simultaneously selects and extracts features using the concept of feature significance. The method is based on maximizing both relevance and significance of the reduced feature set, whereby redundancy therein is removed. The method is generic in nature in the sense that both supervised and unsupervised feature evaluation indices can be used for simultaneously feature selection and extraction. The effectiveness of the proposed method, along with a comparison with existing feature selection and extraction methods, is demonstrated on a set of real life data sets.
Communication Complexity of Consensus in Anonymous Message Passing Systems
Authors: Fusco Emanuele G. , Pelc Andrzej
Published: December 2019

We consider the message complexity of achieving consensus in synchronous anonymous message passing systems. Unlabeled processors (nodes) communicate through links of a network. An adversary wakes up some subset of processors at possibly different times and assigns them arbitrary numerical input values. All other processors are dormant and do not have input values. Any message wakes up a dormant processor. The goal of consensus is to have all processors agree on one of the input values. We seek deterministic consensus algorithms using as few messages as possible. As opposed to most of the literature on consensus, the difficulty of our scenario are not faults (we assume that the network is fault-free) but the arbitrary network topology combined with the anonymity of nodes. For n-node networks of unknown topology we show a consensus algorithm using O(n2) messages; this complexity is optimal for this class. We show that if the network topology is known, then the complexity of consensus decreases significantly. Our main contribution is an algorithm that uses O(n3/2 log2 n) messages on any n-node network and we show that some networks require Ω(n log n) messages to achieve consensus.
Random-Grid Based Region Incrementing Visual Secret Sharing
Authors: Kumar Sachin , Sharma Rajendra Kumar
Published: December 2019

The concept of region incrementing in visual cryptography was introduced to encrypt an image into multiple secrecy levels. But, it suffers from the pixel expansion increasing exponentially as the number of participants grows. In this paper, we propose a region incrementing visual secret sharing (RIVSS) scheme based on random grids. The proposed scheme is a general (k, n)-RIVSS scheme, in which any t (k ≤ t ≤ n) shares can be used to reconstruct the secret regions up to t − k + 1 levels. However, no information about the input image can be revealed by any k − 1 or fewer shares. With a nice property of region incrementing, the proposed scheme benefits by sharing an image without any pixel expansion and codebook requirement. We give formal proofs and experimental results to confirm both correctness and feasibility of our scheme.
Complete Characterization of Zero-expressible Functions
Authors: Dąbrowski Robert , Plandowski Wojciech
Published: December 2019

We describe an intersection of the family of expressible relations and another natural family of relations. This is the first result of this kind existing in the literature. To obtain it we extend a tool for proving nonexpressibility of languages to a tool for proving nonexpressibility of relations.
Homomorphisms Between Covering Approximation Spaces
Authors: Lang Guangming , Li Qingguo , Guo Lankun
Published: December 2019

The introduction of information system homomorphisms has made a substantial contribution to attribute reduction. However, the efforts made on homomorphisms are far from sufficient. This paper further investigates homomorphisms between covering approximation spaces. First, we introduce the concepts of upper and lower homomorphisms as well as homomorphisms in order to study the relationship between covering approximation spaces. Then we present the notions of covering approximation subspaces and product spaces. We also compress covering approximation spaces and covering information systems with the aim of attribute reduction. Afterwards, by utilizing the compressions of the original spaces and systems we compress the dynamic covering approximation spaces and dynamic covering information systems. Several illustrative examples are employed to demonstrate that the homomorphisms provide an effective approach for compressing covering approximation spaces and covering information systems.
Efficiently Mining Sequential Generator Patterns Using Prefix Trees
Authors: Pham Thi-Thiet
Published: December 2019

Mining long frequent sequences that contain a combinatorial number of frequent subsequences or using very low support thresholds to mine sequential patterns is usually both time- and memory-consuming. The mining of closed sequential patterns, sequential generator patterns, and maximum sequences has been proposed to overcome this problem. Sequential generator patterns, when used together with closed sequential patterns, can provide additional information that closed sequential patterns alone cannot provide. Mining sequential generator patterns is thus an important task in data mining as well. This paper proposes an algorithm called MSGP-PreTree for mining all sequential generator patterns based on the prefix-tree structure. The algorithm uses the characteristics of sequential generator patterns and sequence extensions to efficiently perform a depth-first search on a prefix tree. It also uses a vertical approach to list and count the supports of sequences based on the prime block encoding approach for representing candidate sequences and determining the frequencies of candidates. Besides, the search space of the MSGP-PreTree algorithm is much smaller than those of other algorithms because two pruning strategies are applied. Experimental results conducted on synthetic and real databases show that the proposed algorithm is effective than a previous one.
Effective strategic action: Exploring synergy sources of European and Asian management systems
Authors: Blahová Michaela , Zelený Milan
Published: December 2019

The article deals with an effective strategic action within a company in the 21st century – the ability to cope with changing demands without losing focus and anticipating changes before they arise. It aims to create a dynamic performance framework based on the utilization of synergy effects of selected European and Asian management systems (Bata Management System, Japanese Management System and Amoeba Management System). The framework integrates basic elements that enable every aspect of the company (people, processes and systems, innovations, finance, social responsibility and ecology) to be monitored. Special emphasis is put on customers and innovations as a fundamental basis of competitiveness for firms while continually improving the quality of processes and products. Mutual synergy effects of these elements shall ensure fast communication, build lasting value not only for the company, but also for customers and employees and improve corporate performance and efficiency. All perspectives are fully integrated with each other and create a framework that is periodical, dynamic and competitive and that is able to withstand irrelevant disturbances and that is at the same time responsive to relevant changes.
Common values? Fifty-two cases of value semantics copying on corporate websites
Authors: Roth Steffen
Published: December 2019

The present article claims that value communication literally goes without saying. Research in organizational value communication as in corporate image documents is therefore assumed to have nothing to do with the analysis of explicit value semantics. This system-theoretical claim is supported by an analysis of corporate value semantics, which is particularly focused on the copying of value semantics from one corporate website to another. As a result, we present a list of 52 companies that have copied value statements from corporate websites of RobecoSAM sector leaders listed in the DJSI. In referring to these examples, we demonstrate that the copying of value semantics makes the best case for exercising caution when it comes to the idea that value semantics promote organizational goals. Finally, we suggest that the value copying affects corporate value communication in a same vein as spam impairs the use of email and argue for an analytical turn from research in communication on values to research in value communication, which opens up new spaces for a management through allusion and, in doing so, could complement the more popular approaches to a management by value metaphors.
Knowledge management system selection by multi-choice goal programming
Authors: Liao Chin-Nung , Chih I-Liang
Published: December 2019

Goal programming (GP) is an important technique for solving many practice applications. This paper adopts multi-choice goal programming model (MCGP) approach to solve a multi-objectives decision-making problem. The decision model is developed as a multi-choice aspiration levels goal programming model base on a case study. The overall objective is to select an effective resource distribution in a knowledge management system (KMS) projects selection process. The main contribution of this work is development a mathematical model for KMS project evaluate and selection. The advantage of this method is that it allows decision makers to set multi-objective aspiration levels for KMS selection problems. The MCGP model facilitates decision-making process in business resources planning.
The changing urban patterns of a global society
Authors: Larson C. Theodore
Published: December 2019

Opening sections of this paper report impressions gained from an architectural study tour of cities and towns in Italy – notably Venice, Milan, Florence and Rome. All are centers of great art inherited from the past and attracting an increasing number of tourists from all over the world. Current building activities in these places are described and contrasted with what is happening in Paris and elsewhere. Architects and urban planners in every country appear frustrated and uncertain as to their future roles in community efforts to improve the built environment, esthetically as well as socially. All communities are rapidly being linked together worldwide by the still evolving networks of transportation and electronic telecommunication. Following sections of the paper therefore explore some implications of the “universal city” idea, long ignored but now receiving renewed attention as a result of the international development of motor roads. Creation of a global network of information centers for the pooling, interchange and interactive processing of knowledge about environmental conditions and potentials in every locality worldwide is seen as a basic need in establishing desirable guidelines for an integrated development of the built environment that will be beneficial to everyone living on this planet.
Defining the external business environment
Authors: Kefalas A.G.
Published: December 2019

Most managers become concerned with environmental issues only after they have become societal problems whose solutions are the subject of legislation. As a result of this time-lag between the emergence of the societal issue and its legislation, and the ensuing managerial response, most management is kept busy fighting past wars rather than planning strategies for the future. This paper provides a framework which allows the manager considerable leeway in the environmental issue emergence process, thereby enabling the organization to pro act and redesign its structure and behavior in anticipation of certain future events.
The quaternary sector
Authors: Friedman Yona
Published: December 2019

Activities of modern industrial societies are composed of socially useful and socially less useful sectors. Concept of ‘mutual subsidy’ is then elaborated on the basis of this classification. The proportions of mutual subsidy are unequal and changing in different countries of the world. The concept of quaternary sector, a socially useful work which does not figure in the gross national product (GNP), is necessary for understanding their dynamics. The Third World quaternary activities have their industrial counterpart in a ‘modernized quaternary sector’ which is already experiencing a progressively accelerating growth. It is argued that this quaternary development is desirable and increasingly beneficial for humanity.
Appropriate technology: a systems view
Authors: Bowonder B.
Published: December 2019

The concept of appropriate technology is considered using the systems approach. The concept of ‘small is beautiful’ is not always true. Smaller systems tend to grow and larger systems tend to break down into simpler ones. In a world with many boundaries and subsystems, appropriate technology may be an utopian ideal.
The economics of the satisfaction of needs
Authors: Kamenetzky Mario
Published: December 2019

This paper is a proposal for the development of an economics that would be based on satisfaction of the unvarying and universal human needs and not of desires or wants, which are easily manipulable and change, not only from one society to another, but also from one individual to another and even for the same individual at different moments of his or her life. This economics would deal with the production, distribution, and use or consumption of all those entities – goods, services, relations, self-expressions – that satisfy human needs. It is suggested that in order to achieve stability in social and economic growth, all needs should be simultaneously satisfied, not only the so-called basic needs – food, shelter, clothing, health care, and education. It is claimed that technological development is making this proposal possible, particularly because the satisfaction of most of the psychological and sociocultural needs relies mainly on gratuitous relations and self-expressions that only make use of the body and freely available elements of nature. The satisfaction of needs such as those for psychological support and protection; emotional, intellectual, and physical communication; participation; and autonomy does not require goods and services from the market. These needs have nevertheless been those most often repressed in the course of human history because primitive technological patterns required that the energy consumed by relationships and self-expression be saved for productive purposes. Examples are given from the author's experience on ways in which an approach that would simultaneously take into account psychological and sociocultural needs and the biological requirements for survival could be used for the analysis of problems in village development, population growth, technological design, and project implementation.
Is a periodic table of the elements for organization behavior possible?
Authors: Mitroff Ian I.
Published: December 2019

This paper tries to show that if there can be anything analogous to a basic set of ‘elements’ for organization behavior, then those elements must be founded, if only in part, on a psychological base that is adequate to the task. The paper does not contend that all of the complexities of organization behavior can be reduced to psychology, but rather, that an integration of Jungian Personality Psychology and Transactional Analysis provides a necessary basis for a deeper introspection into the nature of complex organization behavior.
A cultural perspective on organizations: the need for and consequences of viewing organizations as culture-bearing milieux
Authors: Louis Meryl Reis
Published: December 2019

The prevalence and influence of cultural phenomena in organizations coupled with limitations inherent in traditional approaches to organizational inquiry suggest the need to add a cultural perspective to our repertoire of perspectives on organizations. A cultural perspective is proposed to guide inquiry on intersubjective, emergent, context-embedded and/or interpretive phenomena in organizational settings. The cultural perspective represents a social defmition paradigm and contrasts with the social fact paradigm of traditional perspectives. Methodological consequences of a cultural perspective are discussed. Topics of study germane to a cultural perspective are illustrated. Methods of organizational inquiry reflective of a cultural perspective are discussed.
Human information processing research: Its MIS-design consequences
Authors: Ghani Jawaid , Lusk Edward J.
Published: December 2019

The authors present ten MIS design considerations which have been useful in their experience. MIS design considerations are offered for (1) the availability and usefulness of information, (2) the context of the information processing task, (3) the amount of information to be processed, (4) the way the information is presented, (5) changes in the mode of presentation, and (6) the effect of individual differences on information processing.
Manpower waste
Authors: Mackenzie Kenneth D.
Published: December 2019

Manpower waste is an important part of manpower supply and demand. Less manpower waste can yield more output with the same size organization and affect turnover. Many of the causes of manpower waste lie in how the organization is managed to achieve its goals and strategies. A new approach called the Organizational Audit and Analysis is described to design organizations to be more productive and adaptive. This approach can be used to identify manpower waste, to eliminate it, and to maintain the organization to prevent it.
Epistemological foundations of a publication policy: its application to HSM
Authors: van Gigch John P.
Published: December 2019

The criteria which editors should follow to evaluate the material they accept for publication are examined. Given that what is written must satisfy two audiences, one of scientists/academicians and another of managers/practitioners, two types of knowledge are defined and described. Criteria for both sets are presented and advanced. Publications intended for scientists/academicians should be appraised by (a) the extent to which they promote the progress of knowledge, as measured by criteria drawn from epistemology, and (b) the quality of the article, as determined by the level in the hierarchy of publications as defined herein. Publications intended for managers/practitioners must satisfy criteria which relate to standards of timeliness, applicability, effectiveness, explanatory power-all factors designed to improve the managers' job performance. Finally, all publications, regardless for whom intended, must satisfy standards of readability, composition, and style. These principles are applied to evaluate the first two volumes of HSM and to enunciate recommendations for future publication policies.
Are some cognitive types better decision makers than others? An empirical investigation
Authors: Davis Donald L.
Published: December 2019

Although previous studies of decision making have been published, those involving a cognitive style variable and individual differences have not been performance related in the sense of comparing the decision-making performance of one type of manager to that of another. Rather, the studies examined attitudes toward some elements of decision making, e.g. attitude toward risk. In this exploratory study a production environment was simulated via a computer game to examine the relative decision-making performance of different cognitive types of decision makers. Results showed that the performance of decision makers did vary by cognitive type and some cognitive types outperformed others at the operational level of decision making with a moderately-well-structured decision task.
Originality level and the innovating process in organizations
Authors: Pelz Donald C. , Munson Fred C.
Published: December 2019

Drawing upon the literature on adaptation vs. fidelity in organizational innovations, this article explores a dimension labeled originality, ranging from ‘origination’ when the organization develops a first-time solution without following a prior example, to ‘adaptation’ when it modifies prior solutions to fit its own situation, to ‘borrowing’ when it finds many well-developed solutions and copies one with little change. Previous studies suggest that to originate a complex innovation will be more costly and risky than to borrow one, and that the innovating process will appear more disorderly. Some empirical data on adoption of urban innovations were examined by a method of ‘quantitative case histories’, in which 2000 brief episodes were coded on type of innovative function (or stage) and on time of occurrence. For innovations of low or medium originality the functions followed an orderly sequence of search, design, appraisal, commitment, and implementation, but for innovations of high originality the functions more nearly coincided, were more prolonged, and had the most overlap, except for one anomaly. A final section speculates on how factors associated with successful innovating – such as prominence of various actors, features of innovating stages, and tactics or strategies – may vary at different originality levels.