Recognizable Picture Research Articles

‘I drew it in as simply as my breath’: absence, presence, and ideal beauty in Dante Gabriel Rossetti’s Sibylla Palmifera (1866–70) ‘double work of art’

Abstract Dante Gabriel Rossetti’s Sibylla Palmifera or Soul's Beauty (1866–1870) ‘double work of art’ is one of his most recognizable pictures and anthologized poems. His visual-verbal ‘double works’ – typically painting-sonnet composites that share a title, comment on each other, and elaborate on a joint subject – remain, however, understudied. Their cross-medium composition presents a challenge to segregated art-historical and literary scholarship. Almost all studies on these picture-word composites take a monodisciplinary approach and predominantly address a single component: the picture or the poem. Engagement with the other component is either cursory or non-existent. In (re)constructing the Sibylla ‘double works’, this essay argues for a renewed understanding of the viewer-reader and viewing-reading. The formation of the visual-verbal exchange at the heart of the ‘double work’ also results in problematic gaps, dissonances, and ruptures in visual-verbal representation. In a manner yet to be addressed in scholarship, this essay demonstrates how Rossetti exploits both alignment and divergence in the Sibylla ‘double work’ to inform and structure the viewer-reader’s encounter with the absence and presence generated by ideal beauty. By reassessing the wider relationship between (and experience of) picture and word, this essay situates the ‘double work’ form at the centre of image-text studies – and exposes the challenge that they present to disparate scholarship and methodologies.

DESIGN IN BOOKS FOR NEWBORNS

In the 21st century, the market for children’s illustrated books is rich in genres, design, and inclusion of interactive content. Depending on the contextual and illustrative content, products are labelled taking into account the division into age categories, the features of which are spelled out in the Federal Law No. 436-FZ of December 29, 2010 “On protecting children from information harmful to their health and development”. Belonging to a particular group is determined by the special needs that exist at each age and which are directly reflected in illustrations, textual material and plot. For example, books for preschool children up to and including 6 years of age are labelled 0+. To understand the design features of this category, it is necessary to study the needs and abilities of the group, as books must be adapted to the needs of their audience. Age can be understood as an absolute and quantitative concept, as well as stages in the processes of physiological and psychological development. In the history of child psychology, there are several variations of age periodization: according to an external criterion (R. Zazzo), an internal criterion (P. Blonsky) and complex age criteria (L. Vygotsky, D. Elkonin, V. Slobodchikov and others). A book is a symbiosis of textual and illustrative material, and interaction with it, especially in the early stages of development, involves (“switches on”) all sensory systems and affects mental development. Therefore, the periodization of Vygotsky formed the basis for the study of design in children’s interactive books. In Vygotsky’s works, it is worth noting that the category 0+ includes several age periods: the neonatal crisis (0–2 months), the stable period of infancy (2 months — 1 year), the crisis of the first year of life, stable early childhood (1–3 years), crisis of three years, stable preschool age (3 years — 6 years). After birth, a child begins a consistent, literally weekly, development of physiological and psychological functions, in parallel with this, his or her needs and interests are lined up. For this reason, it was decided to study the characteristics of each of the groups and the consistency of the design in classic books and books with the inclusion of interactive content for children under 6 years old. The article considers the period of infancy up to 1 year. At a very early age, babies are not yet able to understand the plot or recognize objects in the illustrations, name them. However, it is at this time that the base of the passive vocabulary is formed, the first acquaintance with the outside world and the work of mirror neurons begins, and all of the above is based on emotional experience, which the child receives from the environment. The design of children’s books for newborns is based on physiological features: the beginning of the development of fine motor skills, skills in handling objects; black and white perception of reality; later — addition of red, green, blue and yellow colours; realism of images to build a recognizable picture of the world, the minimum amount of a text message adapted to the understanding and development of basic speech (abbreviations in the form of onomatopoeia for the names of objects); safe materials for self-interaction. Thus, a book for newborns is aimed at a child’s first acquaintance with the world around, the development of the sensory system, fine motor skills, and primary socialisation with close adults.

Reducing the local alphabet size in tiling systems by means of 2D comma-free codes

The tiling systems define the family of recognizable picture languages as the projection of local picture languages, i.e., strictly-locally-testable (SLT) languages of order 2. A basic measure of the descriptive complexity of a picture language is given by the so-called alphabetic ratio, i.e., the size of the local alphabet divided by the size of the picture alphabet. The family of recognizable picture languages does not change when defined by the projection of SLT languages of order k>2, which use k by k tiles. In such a case, the natural question is how the alphabetic ratio changes We obtain the following main result: any recognizable picture language over an alphabet of size n is the projection of an SLT language over an alphabet of size 2n. Moreover, two is the minimal alphabetic ratio possible in general. The proof relies on a new family of comma-free picture, i.e., 2D, codes, for which a lower bound on numerosity is established; and on the relation between languages of encoded pictures and SLT languages. Our result reproduces in two dimensions a similar property (known as Extended Medvedev's theorem) of the regular word languages, concerning the minimal alphabetic ratio needed to define a language by means of a projection of an SLT word language.

СИНДРОМ РУБИНШТЕЙНА-ТЕЙБИ

Rubinstein-Teibi syndrome (RTS) is a multisystem pathology characterized by mental retardation and delayed physical development combined with characteristic external manifestations that make up a recognizable picture of the disease. The literature review highlights the clinical manifestations of RTS, considers the issues of geno-phenotypic correlations and differential diagnostics, describes the possibilities and prospects of diagnostics and treatment, taking into account the results of modern research.

Recognizable Hexagonal Picture Languages and xyz domino tiles

In the paper Hexagonal Pattern Languages K S Dersanambika et.al. define xyz- domino systems and characterized hexagonal pictures using this. Here we define xyz local hexagonal picture languages where the usual notion of hexagonal tiles of size (2, 2, 2) are replaced by a xyz dominos separately. As a result, the regular hexagonal pictures are replaced and studies are done on non-regular hexagonal pictures. Recognizability of these pictures are studied and every recognizable picture language can be obtained as a projection of xyz local languages.

WITHDRAWN: Application of CNN and gated recurrent network for visual improvement of dehazing

Abstract Various restoration model depending on the prior knowledge had consider an arduous vision task. We present in this paper an effective algorithm for restoring a recognizable picture from a hazy image. Instead of using conventional methods i.e.; image priors as the restoration process, in form of color attenuation, dark channels, or color line contrast, we use a point-to-point gated background aggregation structure to reestablish the final image free from haze. A hybrid dehazing algorithm of CNN framework with features learning recurrent modeling is applied. The transmission map or its depth of scene, structural attributes is obtained in form of ranking layer is applied with the CNN network model so that hazy images can be captured at same instant. Post processing is carried out by Fast guided filter. Hence this hybrid model basically gives a inter connection idea between coarse layer and fine layer by extensive results obtained on experimental, simulated and real-world images prove that the proposed algorithm operates against state-of-the-art algorithms in a beneficial way.

Communication complexity tools on recognizable picture languages

The paper deals with the class REC of recognizable picture languages, UREC its unambiguous variant and co-REC the complement class of REC. The aim of this paper is two-fold:First, the paper focuses on some necessary conditions for a language to be recognizable. Such conditions have already been identified in several works [1–5]. Here, we revisit them in the light of communication complexity arguments.Second, we use communication complexity measures in order to construct a language which is a recognizable and co-recognizable language but not an unambiguous one. This answers a question raised in [6].

English

English

A REFINED ACCOUNT OF THE "EPISTEMIC GAME": EPISTEMIC NORMS, TEMPTATIONS, AND EPISTEMIC COOPERATION

Abstract In "Epistemic Norms and the ’Epistemic Game’ They Regulate" (2017, 367—382), we advance a general case for the idea that epistemic norms regulating the production of beliefs might usefully be understood as social norms. There, we drew on the influential account of social norms developed by Cristina Bicchieri, and we managed to give a crude recognizable picture of important elements of what are recognizable as central epistemic norms. Here, we consider much needed elaboration, suggesting (again, highly idealized) models that help one think about epistemic communities and, ultimately, the temptations confronted in one’s epistemic life. We suggest that once "the epistemic game" is embedded into a wider set of gains and losses, one can understand the epistemic choice situation as a form of mixed-motive game. This allows one to understand epistemic games more straightforwardly using Bicchieri’s framework for thinking about social norms. That is, once the choice situation denominated only in terms of classical epistemic gains and losses is embedded in a wider accounting of goods that may compete with the production of true beliefs, one can see how an agent’s individual and community epistemic project can be furthered by social norms regulating epistemic practices. We recommend thinking of epistemic norms as analogous to social norms for hygiene.

A logical approach to locality in pictures languages

This paper deals with descriptive complexity of picture languages of any dimension by fragments of existential second-order logic:1) We generalize to any dimension the characterization by Giammarresi et al. (1996) of the class of recognizable picture languages in existential monadic second-order logic.2) We state natural logical characterizations of the class of picture languages of any dimension d≥1 recognized in linear time on nondeterministic cellular automata, a robust complexity class that contains, for d=1, all the natural NP-complete problems.Our characterizations are essentially deduced from normalization results for first-order and existential second-order logics over pictures.

Two-dimensional Sgraffito automata

We present a new model of a two-dimensional computing device called Sgraffito automaton . In general, the model is quite simple, which allows a clear design of computations. When restricted to one-dimensional inputs, that is, strings, the Sgraffito automaton does not exceed the power of finite-state automata. On the other hand, for two-dimensional inputs, it yields a family of picture languages with good closure properties that strictly includes the class REC of recognizable picture languages. The deterministic Sgraffito automata define a class of picture languages that includes the class of deterministic recognizable picture languages DREC, the class of picture languages that are accepted by four-way alternating automata, those that are accepted by deterministic one-marker automata, and the sudoku-deterministically recognizable picture languages, but the membership problem for the accepted languages is still decidable in polynomial time. In addition, the deterministic Sgraffito automata accept some unary picture languages that are outside of the class REC.

HYPERGRAPH AUTOMATA: A THEORETICAL MODEL FOR PATTERNED SELF-ASSEMBLY

Patterned self-assembly is a process whereby coloured tiles self-assemble to build a rectangular coloured pattern. We propose self-assembly (SA) hypergraph automata as an automata-theoretic model for patterned self-assembly. We investigate the computational power of SA-hypergraph automata and show that for every recognizable picture language, there exists an SA-hypergraph automaton that accepts this language. Conversely, we prove that for any restricted SA-hypergraph automaton, there exists a Wang Tile System, a model for recognizable picture languages, that accepts the same language. The advantage of SA-hypergraph automata over Wang automata, acceptors for the class of recognizable picture languages, is that they do not rely on an a priori defined scanning strategy.

Strategies to scan pictures with automata based on Wang tiles

Wang automata are devices for picture language recognition recently introduced by us, which characterize the class REC of recognizable picture languages. Thus, Wang automata are equivalent to tiling systems or online tessellation acceptors, and are based like Wang systems on labeled Wang tiles. The present work focus on scanning strategies, to prove that the ones Wang automata are based on are those following four kinds of movements: boustrophedonic, L-like, U-like, and spirals.

Morphogenesis versus structuration: on combining structure and action1

The fundamental problem of linking human agency and social structure stalks through the history of sociological theory. Basically it concerns how to develop an adequate theoretical account which deals simultaneously with men constituting society and the social formation of human agents. For any theorist, except the holist, social structure is ultimately a human product, but for any theorist, except advocates of psychologism, this product in turn shapes individuals and influences their interaction. However successive theoretical developments have tilted either towards structure or towards action, a slippage which has gathered in momentum over time. Initially this meant that one element became dominant and the other subordinate: human agency had become pale and ghostly in mid-century functionalism, whilst structure betook an evanescent fragility in the re-flowering of phenomenology. Eventually certain schools of thought repressed the second element almost completely. On the one hand structuralist Marxism and normative functionalism virtually snuffed-out agency-the acting subject became increasingly lifeless whilst the structural or cultural components enjoyed a life of their own, self-propelling or self-maintaining. On the other hand interpretative sociology busily banished the structural to the realm of objectification and facticity-human agency became sovereign whilst social structure was reduced to supine plasticity because of its constructed nature. Although proponents of these divergent views were extremely vociferous, they were also extensively criticized and precisely on the grounds that both structure and action were indispensable in sociological explanation.2 Moreover serious efforts to re-address the problem and to re-unite structure and action had already begun from inside 'the two Sociologies',3 when they were characterized in this manichean way. These attempts emerged after the early sixties from 'general' functionalists,4 'humanistic' marxists5 and from interactionists confronting the existence of strongly patterned conduct.6 Furthermore they were joined in the same decade by a bold attempt

TRANSDUCER GENERATED ARRAYS OF ROBOTIC NANO-ARMS.

We consider sets of two-dimensional arrays, called here transducer generated languages, obtained by iterative applications of transducers (finite state automata with output). Each transducer generates a set of blocks of symbols such that the bottom row of a block is an input string accepted by the transducer and, by iterative application of the transducer, each row of the block is an output of the transducer on the preceding row. We show how these arrays can be implemented through molecular assembly of triple crossover DNA molecules. Such assembly could serve as a scaffold for arranging molecular robotic arms capable for simultaneous movements. We observe that transducer generated languages define a class of languages which is a proper subclass of recognizable picture languages, but it containing the class of all factorial local two-dimensional languages. By taking the average growth rate of the number of blocks in the language as a measure of its complexity, we further observe that arrays with high complexity patterns can be generated in this way.

The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases

In this paper we consider the classes REC1 and UREC1 of unary picture languages that are tiling recognizable and unambiguously tiling recognizable, respectively. By representing unary pictures by quasi-unary strings we characterize REC1 (resp. UREC1) as the class of quasi-unary languages recognized by nondeterministic (resp. unambiguous) linearly space-bounded one-tape Turing machines with constraint on the number of head reversals. We apply such a characterization in two directions. First we prove that the binary string languages encoding tiling recognizable unary square languages lies between NTIME(2n) and NTIME(4n); by separation results, this implies there exists a non-tiling recognizable unary square language whose binary representation is a language in NTIME(4n log n). In the other direction, by means of results on picture languages, we are able to compare the power of deterministic, unambiguous and nondeterministic one-tape Turing machines that are linearly space-bounded and have constraint on the number of head reversals.

Perfectly quilted rectangular snake tilings

We introduce a particular form of snake tilings to define picture languages, and relate the obtained family to the recognizable picture languages (as defined by Wang tiles). The correspondence for substitution tilings is even closer, and hence is applicable to the Hilbert curve.

Characterizations of recognizable picture series

The theory of two-dimensional languages as a generalization of formal string languages was motivated by problems arising from image processing and pattern recognition, and also concerns models of parallel computing. Here we investigate power series on pictures. These are functions that map pictures to elements of a semiring and provide an extension of two-dimensional languages to a quantitative setting. We assign weights to different devices, ranging from picture automata to tiling systems. We will prove that, for commutative semirings, the behaviours of weighted picture automata are precisely alphabetic projections of series defined in terms of rational operations, and also coincide with the families of series characterized by weighted tiling or weighted domino systems.

LOCAL AND RECOGNIZABLE HEXAGONAL PICTURE LANGUAGES

In this paper we consider hexagonal arrays on triangular grids and introduce hexagonal local picture languages and hexagonal tiling systems defining hexagonal recognizable picture languages, motivated by an analogous study of rectangular arrays by Giammarresi and Restivo. We also introduce hexagonal Wang tiles to define hexagonal Wang systems (HWS) as a formalism to describe hexagonal picture languages. It is noticed that the family of hexagonal picture languages defined by hexagonal Wang systems and the family recognized by hexagonal tiling systems coincide. Analogous to hv-domino systems describing rectangular arrays, we define xyz-domino systems and prove that recognizable hexagonal picture languages are characterized as projections of xyz-local picture languages.

New operations and regular expressions for two-dimensional languages over one-letter alphabet

We consider the problem of defining regular expressions to characterize the class of recognizable picture languages in the case of a one-letter alphabet. We define a diagonal concatenation and its star and consider two different families, L ( D ) and L ( CRD ) , of languages denoted by regular expressions involving such operations plus classical operations. L ( D ) is characterized both in terms of rational relations and in terms of two-dimensional automata moving only right and down. L ( CRD ) is included in REC and contains languages defined by three-way automata while languages in L ( CRD ) necessarily satisfy some regularity conditions. Finally, we introduce new definitions of advanced stars expressing the necessity of conceptually different definitions for iteration.