Search results for "General Computer Science"

On the exhaustive generation of k-convex polyominoes

2017

The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of P can be joined by a monotone path inside P with at most k changes of direction. In this paper we present a simple algorithm for computing the degree of convexity of a convex polyomino and we show how it can be used to design an algorithm that generates, given an integer k, all k-convex polyominoes of area n in constant amortized time, using space O(n). Furthermore, by applying few changes, we are able to generate all convex polyominoes whose degree of convexity is exactly k.

Exploring social media network landscape of post-Soviet space

2019

The “post-Soviet space” consists of countries with a substantial fraction of the world’s population; however, unlike many other regions, its social media network landscape is still somewhat under-explored. This paper aims at filling this gap. To this purpose, we use anonymized data on user friendships at VK.com (also known as VKontakte and, informally, as “Russian Facebook”), which is the largest and most popular social media portal in the post-Soviet space with hundreds of millions of user accounts. Using the VK network snapshots from October 2015 to December 2016, we conduct a “multiscale” empirical study of this network by considering conn…

Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes

2006

A multicoloring of a weighted graph G is an assignment of sets of colors to the vertices of G so that two adjacent vertices receive two disjoint sets of colors. A multicoloring problem on G is to find a multicoloring of G. In particular, we are interested in a minimum multicoloring that uses the least total number of colors. The main focus of this work is to obtain upper bounds on the weighted chromatic number of some classes of graphs in terms of the weighted clique number. We first propose an 11/6-approximation algorithm for multicoloring any weighted planar graph. We then study the multicoloring problem on powers of square and triangular meshes. Among other results, we show that the infi…

Extending formal language hierarchies to higher dimensions

1999

The intentional stance as structure learning: a computational perspective on mindreading

2015

Recent theories of mindreading explain the recognition of action, intention, and belief of other agents in terms of generative architectures that model the causal relations between observables (e.g., observed movements) and their hidden causes (e.g., action goals and beliefs). Two kinds of probabilistic generative schemes have been proposed in cognitive science and robotics that link to a "theory theory" and "simulation theory" of mindreading, respectively. The former compares perceived actions to optimal plans derived from rationality principles and conceptual theories of others' minds. The latter reuses one's own internal (inverse and forward) models for action execution to perform a look…

Field Reconstruction for Modeling Multiple Faults in Permanent Magnet Synchronous Motors in Transient States

2021

Conventional field reconstruction model (FRM) for electrical machines has proved its main strength in efficient computations of magnetic fields and forces in healthy permanent magnet synchronous machines (PMSM) or faulty machines in steady states. This study aims to develop a magnet library of different magnet defects and include inter-turn short-circuit (ITSC) in the FRM for PMSM. The developed FRM can model a combination fault between ITSC, and magnet defect in a PMSM in transient states. Within the framework, an 8-turn ITSC was modelled in both finite element analysis (FEA) and FRM, and then identified by the extended Park’s vector approach. The air-gap magnetic field reproduced b…

Inflow/outflow pressure boundary conditions for smoothed particle hydrodynamics simulations of incompressible flows

2017

Abstract Open Boundary treatment is a well-known issue in the Smoothed Particle Hydrodynamics (SPH) method, mainly when the truly Incompressible (ISPH) approach is employed. In the paper a novel method is proposed to set pressure boundary conditions in the computational domain inlets and outlets, without requiring the velocity profile assignment. The new technique allows to treat in the same way inflow and outflow sections, effectively dealing with the release of new particles at inlets and the deactivation of the ones leaving the domain through the outlets. Several 3D numerical tests, both in the laminar and turbulent regimes, are carried out to validate the proposed numerical scheme consi…

A combinatorial view on string attractors

2021

Abstract The notion of string attractor has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based compressors. A string attractor for a word w = w 1 w 2 ⋯ w n is a subset Γ of the positions { 1 , … , n } , such that all distinct factors of w have an occurrence crossing at least one of the elements of Γ. In this paper we explore the notion of string attractor by focusing on its combinatorial properties. In particular, we show how the size of the smallest string attractor of a word varies when combinatorial operations are applied and we deduce that such a measure is not monotone. Moreover, we introduce a c…

Sliding Mode Control of Quadratic Boost Converters Based on Min-Type Control Strategy

2023

The paper deals with the control of a quadratic boost converter supplied by low-voltage energy sources, such as photovoltaic panels, fuel cells, or batteries. The control scheme consists of two control loops. A min-type controller governs the inner loop to force the current state of the nominal model to converge in a neighborhood of the equilibrium state. The external loop processes the output tracking error using an integrator, and it allows reconfiguring the converter's working point by changing the equilibrium state given in the input to the internal loop. This configuration assures both zero tracking error of the output voltage and robustness against load and input voltage variations an…

First-Order Languaging Dynamics and Second-Order Language: The Distributed Language View

2011

This article articulates some aspects of an emerging perspective shift on language: the distributed view. According to this view, languaging behavior and its organization is irreducible to the formal abstracta that have characterized the focus on a de Saussure-type system of formal regularities in mainstream linguistics over the past century. Language, in the distributed view, is a radically heterogeneous phenomenon that is spread across diverse spatiotemporal scales ranging from the neural to the cultural. It is not localizable on any one of them, but it involves complex interactions between phenomena on many different scales. A crucial distinction is thus presented and explained, viz. fir…