Reviewerly/exHarmony huggingface dataset:
On Some Circular Distributions Induced by Inverse Stereographic Projection

In earlier studies of circular data, the corresponding probability distributions considered were mostly assumed to be symmetric. However, the assumption of symmetry may not be meaningful for some data. Thus there has been increased interest, more recently, in developing skewed circular distributions. In this article we introduce three skewed circular models based on inverse stereographic projection (ISP), originally introduced by Minh and Farnum (Comput. Stat.–Theory Methods, 32, 1–9, 2003), by considering three different versions of skewed-t distribution on real line considered in the literature, namely skewed-t by Azzalini (Scand. J. Stat., 12, 171–178, 1985), two-piece skewed-t, (seemingly first considered in Gibbons and Mylroie Appl. Phys. Lett., 22, 568–569, 1973 and later by Fernández and Steel J. Amer. Statist. Assoc., 93, 359–371 1998) and skewed-t by Jones and Faddy (J. R. Stat. Soc. Ser. B (Stat. Methodol.), 65, 159–174, 2003). Unimodality and skewness of the resulting distributions are addressed in this paper. Further, real data sets are used to illustrate the application of the new models. It is found that under certain condition on the original scaling parameter, the resulting distributions may be unimodal. Furthermore, the study in this paper concludes that ISP circular distributions obtained from skewed distributions on the real line may provide an attractive alternative to other asymmetric unimodal circular distributions, especially when combined with a mixture of uniform circular distribution.
Understanding the Search Behaviour of Greedy Best-First Search

A classical result in optimal search shows that A* with an admissible and consistent heuristic expands every state whose f-value is below the optimal solution cost and no state whose f-value is above the optimal solution cost. For satisficing search algorithms, a similarly clear understanding is currently lacking. We examine the search behaviour of greedy best-first search (gbfs) in order to make progress towards such an understanding. We introduce the concept of high-water mark benches, which separate the search space into areas that are searched by a gbfs algorithm in sequence. High-water mark benches allow us to exactly determine the set of states that are not expanded under any gbfs tie-breaking strategy. For the remaining states, we show that some are expanded by all gbfs searches, while others are expanded only if certain conditions are met.
Capturing the Essence: Towards the Automated Generation of Transparent Behavior Models

Hand-coded finite-state machines and behavior trees are the go-to techniques for artificial intelligence (AI) developers that want full control over their character's bearing. However, manually crafting behaviors for computer-controlled agents is a tedious and parameter-dependent task. From a high-level view, the process of designing agent AI by hand usually starts with the determination of a suitable set of action sequences. Once the AI developer has identified these sequences he merges them into a complete behavior by specifying appropriate transitions between them. Automated techniques, such as learning, tree search and planning, are on the other end of the AI toolset's spectrum. They do not require the manual definition of action sequences and adapt to parameter changes automatically. Yet AI developers are reluctant to incorporate them in games because of their performance footprint and lack of immediate designer control. We propose a method that, given the symbolic definition of a problem domain, can automatically extract a transparent behavior model from Goal-Oriented Action Planning (GOAP). The method first observes the behavior exhibited by GOAP in a Monte-Carlo simulation and then evolves a suitable behavior tree using a genetic algorithm. The generated behavior trees are comprehensible, refinable and as performant as hand-crafted ones.
The Effect of Latitude Differences, Sunshine Periods, Solar Radiation Quantities and Air Temperatures on Solar Electricity Generation.

Electricity supply has gained importance with the increase of electricity demand in the world. The energy that the sun can accept forever provides great convenience for electricity generation. In regions where the sun's rays are steep, it is easier to generate electricity from the solar energy, whereas in regions where the sun's rays are horizontal, the electricity production from the solar energy remains at a lower level. In this study, Istanbul and Adana are compared in the northern and southern regions of Turkey. These two cities were examined for daily sunshine periods, daily and monthly radiation amounts. The effects of air temperatures and sunshine durations on the average radiation amounts have been investigated. The province of Adana has an annual total of 1568.49 kWh, whereas the province of Istanbul has a total of 1327 kWh radiation. When the annual sunshine periods are examined, it is 97.13 hours in Adana and 78.99 hours in Istanbul. It is seen that less electricity production can be done year round in Istanbul province and the hourly production is more than that in Adana when compared to sunrise times. When the average annual temperatures are examined, Adana province is 19 °C and Istanbul province is 13.8 °C. Although the province of Istanbul has a lower average temperature, it has been found that it has a higher yield than the province of Adana.
An Analysis and Enhancement of the Gap Heuristic for the Pancake Puzzle

The pancake puzzle is a standard benchmark domain used to test search algorithms, and the gap heuristic is the state-of-the-art heuristic function most often used in such tests. In this work, we analyze the accuracy of this heuristic and identify ways to enhance it. We begin by showing that in the worst-case, the amount that the gap heuristic underestimates the optimal cost of a pancake puzzle state can be linear in the number of pancakes in the stack. However, empirical analysis suggests that it is extremely rare that the gap heuristic underestimates the optimal cost by more than two. We then identify several simple methods that can be used to generate large sets of problems on which the gap heuristic underestimates the optimal cost by a larger amount than it typically does on random permutations. In doing so, we provide new pancake puzzle test sets that can be used to evaluate how search algorithms behave when the heuristic is inaccurate. We also formally characterize states according to the size of the heuristic plateaus around them. This characterization allows us to efficiently compute a two-step look ahead of the gap heuristic on any state, which we can use alongside a state's dual to further improve heuristic accuracy. These enhancements substantially improve the performance of an IDA*-based pancake problem solver on both the existing benchmarks and the new ones proposed in this paper.
A Comprehensive Cloud Security Model with Enhanced Key Management, Access Control and Data Anonymization Features

A disgusting problem in public cloud is to securely share data based on fine grained access control policies and unauthorized key management. Existing approaches to encrypt policies and data with different keys based on public key cryptosystem are Attribute Based Encryption and proxy re-encryption. The weakness behind approaches is: It cannot efficiently handle policy changes and also problem in user revocation and attribute identification. Even though it is so popular, when employed in cloud it generate high computational and storage cost. More importantly, image encryption is some out complex in case of public key cryptosystem. On the publication of sensitive dataset, it does not preserve privacy of an individual. A direct application of a symmetric key cryptosystem, where users are served based on the policies they satisfy and unique keys are generated by Data Owner (DO). Based on this idea, we formalize a new key management scheme, called Symmetric Chaos Based key Management (SCBKM), and then give a secure construction of a SCBKM scheme called AS-Chaos. The idea is to give some secrets to Key Manager (KM) based on the identity attributes they have and later allow them to derive actual symmetric keys based on their secrets. Using our SCBKM construct, we propose an efficient approach for fine-grained encryption-based access control for data stored in untrusted cloud storage.
A/B-Test of Retention and Monetization Using the Cox Model

A/B testing is a popular tool for guiding mobile game development. The developer releases different versions of a game to different test cohorts, and observes which version has the best player retention or monetization. Correctly determining whether the differences are statistically significant is however challenging. Typically the analysis needs to be done on small and heterogeneous player cohorts, with differing follow-up times and unknown player churn. In this paper, we show for the first time how these issues can be properly addressed using the Cox model for recurrent events. The method enables a multivariate A/B-test, that allows determining which game version has the highest player retention or purchase rate, with confidence intervals provided. We demonstrate the benefits of the approach in multiple game development problems, on real-world free-to-play mobile game data.
Extracting Conceptual Relationships and Inducing Concept Lattices from Unstructured Text

Abstract Concept and relationship extraction from unstructured text data plays a key role in meaning aware computing paradigms, which make computers intelligent by helping them learn, interpret, and synthesis information. These concepts and relationships leverage knowledge in the form of ontological structures, which is the backbone of semantic web. This paper proposes a framework that extracts concepts and relationships from unstructured text data and then learns lattices that connect concepts and relationships. The proposed framework uses an off-the-shelf tool for identifying common concepts from a plain text corpus and then implements machine learning algorithms for classifying common relations that connect those concepts. Formal concept analysis is then used for generating concept lattices, which is a proven and principled method of creating formal ontologies that aid machines to learn things. A rigorous and structured experimental evaluation of the proposed method on real-world datasets has been conducted. The results show that the newly proposed framework outperforms state-of-the-art approaches in concept extraction and lattice generation.
Balancing Zero-Sum Games with One Variable per Strategy

A key challenge in game design is achieving balance between the strategies available to the players. Traditionally this has been done through playtesting, with its difficult requirements of time, labor, and interpretation of results. To make it quicker and easier to balance games, we propose a game-theoretic approach that automatically balances strategies based on a mathematical model of the game. Specifically, we model the balance problem as modifying a zero-sum game, using one variable per strategy, so that every strategy has an incentive to be employed. We begin with a special case where these variables affect player payoffs multiplicatively, and show that the simple Sinkhorn-Knopp algorithm can be used to balance the game. We then proceed to analyze the more general case where the variables have a monotonic effect on payoffs, and show that it is amenable to standard optimization methods. We give examples inspired by well-known game series including Pokemon and Warhammer 40,000.
Hard and easy instances of L-tromino tilings

We study tilings of regions in the square lattice with L-shaped trominoes. Deciding the existence of a tiling with L-trominoes for an arbitrary region in general is NP-complete, nonetheless, we identify restrictions to the problem where it either remains NP-complete or has a polynomial time algorithm. First, we characterize the possibility of when an Aztec rectangle and an Aztec diamond has an L-tromino tiling. Then, we study tilings of arbitrary regions where only 180∘ rotations of L-trominoes are available. For this particular case we show that deciding the existence of a tiling remains NP-complete; yet, if a region does not contain certain so-called “forbidden polyominoes” as sub-regions, then there exists a polynomial time algorithm for deciding a tiling.
Irreducible Polynomials Over a Finite Field with Restricted Coefficients

Abstract We prove a function field analogue of Maynard’s celebrated result about primes with restricted digits. That is, for certain ranges of parameters $n$ and $q$ , we prove an asymptotic formula for the number of irreducible polynomials of degree $n$ over a finite field $\mathbb{F}_{q}$ whose coefficients are restricted to lie in a given subset of $\mathbb{F}_{q}$ .
A Common Assessment Space for Different Sensor Structures

The study of the evolution process of our visual system indicates the existence of variational spatial arrangement; from densely hexagonal in the fovea to a sparse circular structure in the peripheral retina. Today’s sensor spatial arrangement is inspired by our visual system. However, we have not come further than rigid rectangular and, on a minor scale, hexagonal sensor arrangements. Even in this situation, there is a need for directly assessing differences between the rectangular and hexagonal sensor arrangements, i.e., without the conversion of one arrangement to another. In this paper, we propose a method to create a common space for addressing any spatial arrangements and assessing the differences among them, e.g., between the rectangular and hexagonal. Such a space is created by implementing a continuous extension of discrete Weyl Group orbit function transform which extends a discrete arrangement to a continuous one. The implementation of the space is demonstrated by comparing two types of generated hexagonal images from each rectangular image with two different methods of the half-pixel shifting method and virtual hexagonal method. In the experiment, a group of ten texture images were generated with variational curviness content using ten different Perlin noise patterns, adding to an initial 2D Gaussian distribution pattern image. Then, the common space was obtained from each of the discrete images to assess the differences between the original rectangular image and its corresponding hexagonal image. The results show that the space facilitates a usage friendly tool to address an arrangement and assess the changes between different spatial arrangements by which, in the experiment, the hexagonal images show richer intensity variation, nonlinear behavior, and larger dynamic range in comparison to the rectangular images.
From text to scheme

Abstract We show how to solve common problems in identifying arguments from expert opinion, illustrated by five examples selected from The Economist . Our method started by intuitively identifying many appeals to alleged experts in The Economist and comparing them to the argumentation scheme for argument from expert opinion. This approach led us to (i) extending the existing list of possible faults committed when arguments from expert opinion are performed and (ii) proposing the extension of the list of linguistic cues that would allow analysts to identify arguments from expert opinion. Our ultimate aim is to help argument identification by argument mining connect better with techniques of argument analysis and evaluation.
Multipartite Entanglement Certification, With or Without Tomography

Certifying multipartite entanglement is a fundamental task. Since n-qubit state is parameterized by 4 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> - 1 real numbers, it is interesting to design a measurement setup that detects multipartite entanglement with as little effort as possible, and at a minimum without fully revealing the whole information of the state, the so-called “tomography”. In this paper, we study the relationship between multipartite entanglement certification and tomography, with the constraint that only single-copy measurements are allowed. We show that by using nonadaptive single-copy measurements, universal entanglement detection, among all states, can not be accomplished without full state tomography. Moreover, we show that almost all multipartite correlations, including the genuine entanglement and the entanglement depth, require full state tomography to detect in this measurement setting. We also observe that universal entanglement detection, among pure states, can be accomplished using much fewer measurements than full state tomography even using only local measurements.
Multimodal Generic Framework for Multimedia Documents Adaptation

Today, people are increasingly capable of creating and sharing documents (which generally are multimedia oriented) via the internet.These multimedia documents can be accessed at anytime and anywhere (city, home, etc.) on a wide variety of devices, such as laptops, tablets and smartphones.The heterogeneity of devices and user preferences has raised a serious issue for multimedia contents adaptation.Our research focuses on multimedia documents adaptation with a strong focus on interaction with users and exploration of multimodality.We propose a multimodal framework for adapting multimedia documents based on a distributed implementation of W3C's Multimodal Architecture and Interfaces applied to ubiquitous computing.The core of our proposed architecture is the presence of a smart interaction manager that accepts context related information from sensors in the environment as well as from other sources, including information available on the web and multimodal user inputs.The interaction manager integrates and reasons over this information to predict the user's situation and service use.A key to realizing this framework is the use of an ontology that undergirds the communication and representation, and the use of the cloud to insure the service continuity on heterogeneous mobile devices.Smart city is assumed as the reference scenario.
Proactive Security for Safety and Sustainability of Mission Critical Systems

Ensuring cyber network security becomes a challenging step with the increase of cyber attacks. The latter are targeting any cyber system starting from personal computers to national critical infrastructures. Consequently, the development of a proactive cyber defense technique to detect and react to cyber attacks before the damage occurrence becomes a necessity. To this end, we develop in this work a formal model to proactively ensure safety and sustainability of mission critical systems. Our proposal consists of deploying a network of observer agents to supervise and generate observation data related to attacks under execution which will be analyzed by a central defense agent. The latter will hypothetically generate a graph of potential scenarios that could be executed in the network. A scenario context will be introduced to compute a set of probabilistic measures for the proactive assessment of attack damages. Another graph decomposing the cyber network global mission into sub operations, and presenting the cyber assets ensuring mission achievement, will be presented. Such a graph will be used to study the cyber attack impact on mission accomplishment and, thus, will ensure the system sustainability by proactively reacting to cyber attacks. A case study is provided to illustrate the proposal.
Superrational types

We present a formal analysis of Douglas Hofstadter's concept of \emph{superrationality}. We start by defining superrationally justifiable actions, and study them in symmetric games. We then model the beliefs of the players, in a way that leads them to different choices than the usual assumption of rationality by restricting the range of conceivable choices. These beliefs are captured in the formal notion of \emph{type} drawn from epistemic game theory. The theory of coalgebras is used to frame type spaces and to account for the existence of some of them. We find conditions that guarantee superrational outcomes.
Towards a simple and safe Objective Caml compiling framework for the synchronous language SIGNAL

This paper presents a simple and safe compiler, called MinSIGNAL, from a subset of the synchronous dataflow language SIGNAL to C, as well as its existing enhancements. The compiler follows a modular architecture, and can be seen as a sequence of source-to-source transformations applied to an intermediate representation which is named Synchronous Clocked Guarded Actions (S-CGA) and translation to sequential imperative code. Objective Caml (OCaml) is used for the implementation of MinSIGNAL. As a modern functional language, OCaml is adapted to symbolic computation and so, particularly suitable for compiler design and implementation of formal analysis tools. In particular, the safety of its type checking allows to skip some verification that would be mandatory with other languages. Additionally, this work is a basis for the formal verification of the compilation of SIGNAL with a theorem prover such as Coq.
Multiphoton supercoherent states

In this paper we are going to build the multiphoton supercoherent states for the supersymmetric harmonic oscillator as eigenstates of the m -th power of a special form (but still with a free parameter) of the Kornbluth-Zipman supersymmetric annihilation operator. They become expressed in terms of the multiphoton coherent states for the standard harmonic oscillator. The Heisenberg uncertainty relation and some statistical properties for these states will be studied. Since the multiphoton supercoherent states turn out to be periodic, then the associated geometric phases will be as well evaluated.
Enhanced string factoring from alphabet orderings

In this note we consider the concept of alphabet ordering in the context of string factoring. We propose a greedy algorithm that produces Lyndon factorizations with small numbers of factors which can be modified to produce large numbers of factors. For the technique we introduce the Exponent Parikh vector. Applications and research directions derived from circ-UMFFs are discussed.
A Combinatorial Approach to the Number of Solutions of Systems of Homogeneous Polynomial Equations over Finite Fields

We give a complete conjectural formula for the number $e_r(d,m)$ of maximum possible ${\mathbb{F}}q$-rational points on a projective algebraic variety defined by $r$ linearly independent homogeneous polynomial equations of degree $d$ in $m+1$ variables with coefficients in the finite field ${\mathbb{F}}q$ with $q$ elements, when $d<q$. It is shown that this formula holds in the affirmative for several values of $r$. In the general case, we give explicit lower and upper bounds for $e_r(d,m)$ and show that they are sometimes attained. Our approach uses a relatively recent result, called the projective footprint bound, together with results from extremal combinatorics such as the Clements-Lindstrom Theorem and its variants. Applications to the problem of determining the generalized Hamming weights of projective Reed-Muller codes are also included.
Impact of global and local interaction on quantum spatial search on chimera graph

In this paper, we investigated the influence of local and global interaction on the efficiency of continuous-time quantum spatial search. To do so, we analyzed numerically the chimera graph, which is defined as 2D grid with each node replaced by complete bipartite graph. Our investigation provides a numerical evidence that with a large number of local interactions the quantum spatial search is optimal, contrary to the case with limited number of such interactions. The result suggests that relatively large number of local interactions with the marked vertex is necessary for optimal search, which in turn would imply that poorly connected vertices are hard to be found.