Hasil untuk "Romanic languages"

Simon Brezovnik, Janez Žerovnik

Roman domination and its higher-order extensions have attracted considerable attention due to their natural interpretation in terms of defensive resource allocation on networks. The recently introduced $[k]$-Roman domination framework unifies classical Roman, double, triple, and higher-strength protection schemes by allowing each fortified vertex to provide up to $k$ levels of support. In this paper, we investigate the $[k]$-Roman domination number $γ_{[k]R}(G)$ on cylindrical grids $C_m \Box P_n$. We relate $[k]$-Roman domination to efficient domination and show that for efficient graphs one has $γ_{[k]R}(G)=(k+1)γ(G)$; as a consequence, we obtain explicit values for broad families of toroidal grids and determine exactly when the cylindrical graphs $C_m\Box P_n$ admit an efficient dominating set. Building on these structural insights, we derive several upper bounds for $γ_{[k]R}(C_m \Box P_n)$ for small fixed values of $m$, accompanied by explicit labeling patterns that attain these bounds. All obtained bounds are systematically compared, revealing parameter ranges in which different constructions dominate depending on the value of $k$ and the length of the path. In addition, we present exact packing numbers for selected cylindrical graphs, which complement the domination results and enable further refinements via local weight reductions. Our results extend and unify known domination-type parameters on grid-like structures and highlight new regularities that emerge as the reinforcement strength increases.

Micaela B. Bagley, Steven L. Finkelstein, James Rhoads et al.

We present a trade study of possible ultra-deep surveys with the Nancy Grace Roman Space Telescope, optimizing the depth-area-filter parameter space for high-redshift galaxy science. Using a mock galaxy catalog derived from a 2 sq. degree lightcone created using the Santa Cruz semi-analytic model and populated with over 7.6 million galaxies at 0<z<10 with M_UV < -15, with realistic clustering and synthetic photometry, we evaluate sixteen 500-hour survey configurations spanning 0.28-2 sq. degrees and four filter combinations. We demonstrate that even a single Roman pointing dramatically reduces cosmic variance compared to HST-like observations, more faithfully recovering the true UV luminosity function. For each survey configuration, we explore photometric redshift recovery, sample contamination, and measurements of the rest-UV luminosity function and non-ionizing UV luminosity density across four redshift bins at z~6-9. We find that inclusion of the R062 filter is essential for studies at z~5-6, reducing sample contamination from nearly 100% to negligible levels and recovering the bright end of the luminosity function. The F184 filter improves galaxy recovery at z>9 and is critical for stellar contamination removal at all redshifts. Based on these results, we recommend that a Roman ultra-deep survey cover at least two Roman pointings (0.56 sq. degrees) with all six filters (R062, Z087, Y106, J129, H158, F184), reducing uncertainties on the rest-UV luminosity density by factors of 2-4 relative to the deepest existing JWST programs. Building off of the Deep Tier of the High Latitude Time Domain Survey to add depth and filter coverage to existing (or planned) observations is an excellent option.

Antoine Amarilli, Mikaël Monet, Paul Raphaël et al.

We study the membership problem to context-free languages L (CFLs) on probabilistic words, that specify for each position a probability distribution on the letters (assuming independence across positions). Our task is to compute, given a probabilistic word, what is the probability that a word drawn according to the distribution belongs to L. This problem generalizes the problem of counting how many words of length n belong to L, or of counting how many completions of a partial word belong to L. We show that this problem is in polynomial time for unambiguous context-free languages (uCFLs), but can be #P-hard already for unions of two linear uCFLs. More generally, we show that the problem is in polynomial time for so-called poly-slicewise-unambiguous languages, where given a length n we can tractably compute an uCFL for the words of length n in the language. This class includes some inherently ambiguous languages, and implies the tractability of bounded CFLs and of languages recognized by unambiguous polynomial-time counter automata; but we show that the problem can be #P-hard for nondeterministic counter automata, even for Parikh automata with a single counter. We then introduce classes of circuits from knowledge compilation which we use for tractable counting, and show that this covers the tractability of poly-slicewise-unambiguous languages and of some CFLs that are not poly-slicewise-unambiguous. Extending these circuits with negation further allows us to show tractability for the language of primitive words, and for the language of concatenations of two palindromes. We finally show the conditional undecidability of the meta-problem that asks, given a CFG, whether the probabilistic membership problem for that CFG is tractable or #P-hard.

Basile Pesin, Celia Picard, Cyril Allignol

User Interface Description Languages (UIDLs) are high-level languages that facilitate the development of Human-Machine Interfaces, such as Graphical User Interface (GUI) applications. They usually provide first-class primitives to specify how the program reacts to an external event (user input, network message), and how data flows through the program. Although these domain-specific languages are now widely used to implement safety-critical GUIs, little work has been invested in their formalization and verification. In this paper, we propose a denotational semantic model for a core reactive UIDL, Smalite, which we argue is expressive enough to encode constructs from more realistic languages. This preliminary work may be used as a stepping stone to produce a formally verified compiler for UIDLs.

Asunción Escribano Hernández

En este texto se analiza el uso intertextual de ciertos pasajes procedentes del Nuevo Testamento, usados polifónicamente, en los poemas del escritor Juan Antonico González Iglesias. Para ello, mediante el análisis de contenido hemos estudiado el uso intertextual de los textos neotestamentarios en sus seis libros principales, y hemos extraído de toda la poesía de González Iglesias aquellos versos o poemas en los que se cita o alude a dichos textos. Con ello, hemos concluido su presencia frecuente como modo de continuidad asumida con una tradición que tiene­ en la actualidad una presencia cultural intensa.

Katarzyna Kruszyńska, Rachel A. Street, Steven Gough-Kelly et al.

Nancy Grace Roman Space Telescope will revolutionize our understanding of the Galactic Bulge with its Galactic Bulge Time Domain survey. At the same time, Rubin Observatories's Legacy Survey of Space and Time (LSST) will monitor billions of stars in the Milky Way. The proposed Roman survey of the Galactic Plane, with its NIR passbands and exquisite spacial resolution, promises groundbreaking insights for a wide range of time-domain galactic astrophysics. In this white paper, we describe the scientific returns possible from the combination of the Roman Galactic Plane Survey with the data from LSST.

M. Cera, P. Garcia-Vazquez, J. C. Valenzuela-Tripodoro

This work is related to the extension of the well-known problem of Roman domination in graph theory to fuzzy graphs. A variety of approaches have been used to explore the concept of domination in fuzzy graphs. This study uses the concept of strong domination, considering the weights of the strong edges. We introduce the strong-neighbors Roman domination number of a fuzzy graph and establish some correlations with the Roman domination in graphs. The strong-neighbors Roman domination number is determined for specific fuzzy graphs, including complete and complete bipartite fuzzy graphs. Besides, several general bounds are given. In addition, we characterize the fuzzy graphs that reach the extreme values with particular attention to fuzzy strong cycles and paths.

Marvin Ködding, Bianca Truthe

In this paper, we continue the research on the power of contextual grammars with selection languages from subfamilies of the family of regular languages. We investigate various comet-like types of languages and compare such language families to some other subregular families of languages (finite, monoidal, nilpotent, combinational, (symmetric) definite, ordered, non-counting, power-separating, suffix-closed, commutative, circular, or union-free languages). Further, we compare the language families defined by these types for the selection with each other and with the families of the hierarchy obtained for external contextual grammars. In this way, we extend the existing hierarchy by new language families.

Alina Nowicka-Jeżowa

Libera cuique esset fides. Some Remarks on religious Background of Jan Kochanowski, Student of the University of Padua The article presents religious attitudes of Humanists acting in the environment of Padua University in the middle of 16th century. At this background it follows development of religious beliefs of Jan Kochanowski during his studies in Padua (1552‒1559), then his strategy of coexistence with various confession groups in Polish Res Publica.

Matteo Viale

The contribution presents and discusses a recent tool designed for those who work in the field of linguistic integration of migrants and refugees without a specific training in linguistics and language teaching, the Guide for the linguistic inclusion of migrants (Ediciones Universidad de Salamanca, 2022). This tool, available in five languages, was developed by European universities as part of the European project INCLUDEED (Social cohesion and INCLUsion: DEveloping the EDucational Possibilities of the European Multilingual Heritage through Applied Linguistics) and develops, looking particularly at the non-specialist reader, topics such as the profile of the migrant learner in the migratory context, the intercultural dimension linked to language teaching and literacy, language teacher training and the potentials and limitations of available teaching materials.

Mario Grobler, Sebastian Siebertz

Büchi's theorem states that $ω$-regular languages are characterized as languages of the form $\bigcup_i U_i V_i^ω$, where $U_i$ and $V_i$ are regular languages. Parikh automata are automata on finite words whose transitions are equipped with vectors of positive integers, whose sum can be tested for membership in a given semi-linear set. We give an intuitive automata theoretic characterization of languages of the form $U_i V_i^ω$, where $U_i$ and $V_i$ are Parikh-recognizable. Furthermore, we show that the class of such languages, where $U_i$ is Parikh-recognizable and $V_i$ is regular is exactly captured by a model proposed by Klaedtke and Ruess [Automata, Languages and Programming, 2003], which again is equivalent to (a small modification of) reachability Parikh automata introduced by Guha et al. [FSTTCS, 2022]. We finish this study by introducing a model that captures exactly such languages for regular $U_i$ and Parikh-recognizable $V_i$.

Thomas A. Henzinger, Pavol Kebis, Nicolas Mazzocchi et al.

The operator precedence languages (OPLs) represent the largest known subclass of the context-free languages which enjoys all desirable closure and decidability properties. This includes the decidability of language inclusion, which is the ultimate verification problem. Operator precedence grammars, automata, and logics have been investigated and used, for example, to verify programs with arithmetic expressions and exceptions (both of which are deterministic pushdown but lie outside the scope of the visibly pushdown languages). In this paper, we complete the picture and give, for the first time, an algebraic characterization of the class of OPLs in the form of a syntactic congruence that has finitely many equivalence classes exactly for the operator precedence languages. This is a generalization of the celebrated Myhill-Nerode theorem for the regular languages to OPLs. As one of the consequences, we show that universality and language inclusion for nondeterministic operator precedence automata can be solved by an antichain algorithm. Antichain algorithms avoid determinization and complementation through an explicit subset construction, by leveraging a quasi-order on words, which allows the pruning of the search space for counterexample words without sacrificing completeness. Antichain algorithms can be implemented symbolically, and these implementations are today the best-performing algorithms in practice for the inclusion of finite automata. We give a generic construction of the quasi-order needed for antichain algorithms from a finite syntactic congruence. This yields the first antichain algorithm for OPLs, an algorithm that solves the \textsc{ExpTime}-hard language inclusion problem for OPLs in exponential time.

Mengxiao Zhang, Yongqiang Tian, Zhenyang Xu et al.

Program reduction is a prevalent technique to facilitate compilers' debugging by automatically minimizing bug-triggering programs. Existing program reduction techniques are either generic across languages (e.g., Perses and Vulcan) or specifically customized for one certain language by employing language-specific features, like C-Reduce. However, striking the balance between generality across multiple programming languages and specificity to individual languages in program reduction is yet to be explored. This paper proposes LPR, the first technique utilizing LLMs to perform language-specific program reduction for multiple languages. The core insight is to utilize both the language-generic syntax level program reduction (e.g., Perses) and the language-specific semantic level program transformations learned by LLMs. Alternately, language-generic program reducers efficiently reduce programs into 1-tree-minimality, which is small enough to be manageable for LLMs; LLMs effectively transform programs via the learned semantics to expose new reduction opportunities for the language-generic program reducers to further reduce the programs. Our extensive evaluation on 50 benchmarks across three languages (C, Rust, and JavaScript) has highlighted LPR's practicality and superiority over Vulcan, the state-of-the-art language-generic program reducer. For effectiveness, LPR surpasses Vulcan by producing 24.93%, 4.47%, and 11.71% smaller programs on benchmarks in C, Rust and JavaScript. Moreover, LPR and Vulcan have demonstrated their potential to complement each other. By using Vulcan on LPR's output for C programs, we achieve program sizes comparable to those reduced by C-Reduce. For efficiency, LPR takes 10.77%, 34.88%, 36.96% less time than Vulcan to finish all benchmarks in C, Rust and JavaScript, separately.

Tansu Daylan, Simon Birrer

We recommend a deeper extension to the High-Latitute Wide Area Survey planned to be conducted by the Nancy Grace Roman Space Telescope (\emph{Roman}). While this deeper-tier survey extension can support a range of astrophysical investigations, it is particularly well suited to characterize the dark matter substructure in galactic halos and reveal the microphysics of dark matter through gravitational lensing. We quantify the expected yield of \emph{Roman} for finding galaxy-galaxy-type gravitational lenses and motivate observational choices to optimize the \emph{Roman} core community surveys for studying dark matter substructure. In the proposed survey, we expect to find, on average, one strong lens with a characterizable substructure per \emph{Roman} tile (0.28 squared degrees), yielding approximately 500 such high-quality lenses. With such a deeper legacy survey, \emph{Roman} will outperform any current and planned telescope within the next decade in its potential to characterize the concentration and abundance of dark matter subhalos in the mass range 10$^7$-10$^{11}$\,M$_{\odot}$.

Eva Núñez-Méndez

The natural tendency for language variation, intensified by Spanish’s territorial growth, has driven sibilant changes and mergers across the Spanish-speaking world. This article aims to present an overview of the most significant processes undergone by sibilant /s/ in various Spanish-speaking areas: devoicing, weakening, aspiration, elision, and voicing. Geographically based phonetic variations, sociolinguistic factors, and Spanish language contact situations are considered in this study. The sibilant merger and its chronological development in modern Spanish, along with geographic expansion, have resulted in multiple contemporary dialectal variations. This historical lack of stability in these sounds has marked modern regional variations. Tracing and framing the sibilants’ geo-linguistic features has received much attention from scholars, resulting in sibilants being one of the most studied variables in Spanish phonetics. In this article, we provide a concise approach that offers the reader an updated sociolinguistic view of the modern cross-dialectal realizations of /s/. It is essential to study sibilant development to describe Spanish dialects, the differences between Transatlantic and Castilian varieties, and the speech features found in Spanish speaking communities in the Americas. Examining sibilance from different approaches with a representative variety of Spanish dialects as examples advances the importance of sociolinguistic phenomena to index language changes.

William Bugden, Ayman Alahmar

Rust is a young programming language gaining increased attention from software developers since it was introduced to the world by Mozilla in 2010. In this study, we attempt to answer several research questions. Does Rust deserve such increased attention? What is there in Rust that is attracting programmers to this new language? Safety and performance were among the very first promises of Rust, as was claimed by its early developers. Is Rust a safe language with high performance? Have these claims been achieved? To answer these questions, we surveyed and analyzed recent research on Rust and research that benchmarks Rust with other available prominent programming languages. The results show that Rust deserves the increased interest by programmers, and recent experimental results in benchmarking research show Rust's overall superiority over other well-established languages in terms of performance, safety, and security. Even though this study was not comprehensive (and more work must be done in this area), it informs the programming and research communities on the promising features of Rust as the language of choice for the future.

D. Singleton, J. Leśniewska

This article focuses on the uncertainty surrounding the issue of the Critical Period Hypothesis. It puts forward the case that, with regard to naturalistic situations, the hypothesis has the status of both “not proven” and unfalsified. The article analyzes a number of reasons for this situation, including the effects of multi-competence, which remove any possibility that competence in more than one language can ever be identical to monolingual competence. With regard to the formal instructional setting, it points to many decades of research showing that, as critical period advocates acknowledge, in a normal schooling situation, adolescent beginners in the long run do as well as younger beginners. The article laments the profusion of definitions of what the critical period for language actually is and the generally piecemeal nature of research into this important area. In particular, it calls for a fuller integration of recent neurolinguistic perspectives into discussion of the age factor in second language acquisition research.

Nayeon Bak, Byeong-Mo Chang, Kwanghoon Choi

Abstract A visual block programming language allows users to make their own programs by dragging and dropping graphic blocks rather than by writing the program. This enables users who are not proficient in programming to create programs easily. Although existing studies have applied this idea to programming Internet of things (IoT) applications, existing visual language tools have certain limitations in terms of expressiveness, extensibility, and error prevention. In this paper, we propose a visual block language called Smart Block for SmartThings home automation, together with a visual programming environment that supports the three properties. We designed the visual block language based on the Internet of things automation (IoTa) calculus, a core calculus for IoT automation that generalizes event-condition-action (ECA) rules. Each ECA rule specifies that when an event occurs, and if a condition is met, a certain action is performed. Smart Block supports writing IoT applications in the ECA style and is implemented with Google Blockly, a client-side JavaScript library for creating visual block languages. Smart Block can help users develop reliable SmartApps by checking for redundancy, inconsistency, and circularity in the ECA rules before generating the code. We demonstrate that Smart Block can build 54 out of 56 (96.4%) of the SmartApps provided by the official SmartThings IDE. Furthermore, a user study with 33 participants shows that our approach, based on the foundation of the IoTa calculus, is understandable for users.

Luis Alejandro Novoa Romero

In this reflective essay, I want to show the situation that I experienced in the last semester of my career, which was the investigative pedagogical final practicum at the Universidad Pedagógica y Tecnológica de Colombia. I started developing this last stage in the “Escuela Normal Superior Santiago de Tunja”. Then, I had to change the institution, and I finished my practice in the “Institución Educativa Libertador Simón Bolívar”. In this process, the COVID 19 pandemic was expanding in almost every country, and the world stopped the normal development of activities, which included the academic institutions. For that reason, I decided to reflect about education around the world and some of the challenges that are always present. Also, I wanted to talk about the new difficulties related to the virus and the ways teaching could implement technological devices and internet connection. Finally, I write some of the implications that I consider important in these difficult times in which education will not stop.

T. Griffin