Hasil untuk "Oriental languages and literatures"

Krasimir Yordzhev

The work investigates the problem of whether a context-free language is a subset of a group language. A.~V. Anisimov has shown that the problem of determining the unambiguity of finite automata is a special case of this problem. Then the question of finding polynomial algorithm verifying the inclusion of context-free languages in group languages naturally arises. The article focuses on this open problem. For the purpose, the paper describes an unconventional method of description of context-free languages, namely a representation with the help of a finite digraph whose arcs are labelled with a specially defined monoid $\mathcal{U}$. Also, we define a semiring $\mathcal{S}_\mathcal{U}$ whose elements are the set $2^\mathcal{U}$ of all subsets of $\mathcal{U}$ and with operations - product and union of the elements of $2^\mathcal{U}$. The described algorithm executes no more than $O(n^3)$ operations in $\mathcal{S}_\mathcal{U}$.

Zaoui Lamouri

يهدف البّحث إلى مساءلة آليّة مصطلحيَّة واسعة الاعتماد من قبل المُصطلحيِّين في حقول المعرفة، وهي “آليّة التّعريب”، من خلال السّعي إلى كشف حدودها، وجدواها، فضلا عن أسباب إقرارها، واعتمادها مقابلا ترجميًّا للمصطلحات الغربيّة، مع مطارحة ومناقشة أسباب غلبة التَّعريب مقارنة بغيره من آليّات التّوضيع، والتّوليد المصطلحيّ، وتبيان مدى قدرة العربيّة على صياغة مصطلحات أصيلة تستوعب المفاهيم النّقديّة الوافدة إلى منظومتنا العربيّة، أمَّا عن موضوع البّحث: فيتناول الجدليّة القائمة في الأوساط الأكاديميّة بشأن حدود التّرجمة المصطلحيّة، كما يناقش البّحث مسألة التّداخل اللغوي والحضاري الذي أنتج ظاهرة الاقتراض، فضلا عن تقديم مداخل مفاهيميّة ومصطلحيّة تستبين مكوِّنات المصطلح في صلته بالمفهوم الذي يستوعبه، وهي (المصطلح، التّصوّر، الميدان، والتّعريف)، مستفيدا من تنظيرات باحثين عرب وغربيّين في علم المصطلح. وتوصل البحث إلى الآتي: يؤكّد البّحث أنَّ التَّعريب -رغم ضروراته في بعض الحقول المعرفيّة- يظلُّ آليّة اضطراريّة موقوتة، وليست خيارا أصيلا لخلق المصطلحات، ومع ذلك تكتسب المصطلحات المعرّبة حصانة، بحكم أنّ المصطلح يثبت ويرسخ بناء على سعة تواتره وتبنّيه من قبل المصطلحيّين والمشتغلين عليه، جريا على القول المأثور: (ربّ خطأ شاع، وربّ صواب ضاع).

Ivan Petrukha, Yana Kurliak, Nataliia Stulova

In recent years, large language models (LLMs) have showcased significant advancements in code generation. However, most evaluation benchmarks are primarily oriented towards Python, making it difficult to evaluate other programming languages, such as Swift, with high quality. By examining widely established multilingual benchmarks like HumanEval-XL and MultiPL-E, we identified critical issues specific to their Swift components, making them insufficient or even irrelevant for assessing LLM coding capabilities on Swift. Unlike these existing approaches, which prioritize rapid scaling and generalization by automatically translating Python-centric benchmarks with LLMs, we adopt a quality-over-quantity methodology. We present SwiftEval, the first Swift-oriented benchmark consisting of 28 carefully hand-crafted problems, and evaluate 44 popular Code LLMs on it. Our results show significant LLM scores drop for problems requiring language-specific features, most noticeable in the models of smaller sizes.

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

A quantitative word automaton (QWA) defines a function from infinite words to values. For example, every infinite run of a limit-average QWA A obtains a mean payoff, and every word w is assigned the maximal mean payoff obtained by nondeterministic runs of A over w. We introduce quantitative language automata (QLAs) that define functions from language generators (i.e., implementations) to values, where a language generator can be nonprobabilistic, defining a set of infinite words, or probabilistic, defining a probability measure over infinite words. A QLA consists of a QWA and a language aggregator. For example, given a QWA A, the infimum aggregator maps each language L to the greatest lower bound assigned by A to any word in L. For boolean value sets, QWAs capture trace properties, and QLAs capture hyperproperties. For more general value sets, QLAs serve as a specification language for a generalization of hyperproperties, called quantitative hyperproperties. A nonprobabilistic (resp. probabilistic) quantitative hyperproperty assigns a value to each set (resp. distribution) G of traces, e.g., the minimal (resp. expected) average response time exhibited by the traces in G (resp. by traces sampled according to G). We give several examples of quantitative hyperproperties and investigate three paradigmatic problems for QLAs: evaluation, nonemptiness, and universality. In the evaluation problem, given a QLA AA and an implementation G, we ask for the value that AA assigns to G. In the nonemptiness (resp. universality) problem, given a QLA AA, a threshold k, and a comparison in {>, >=} we ask whether AA assigns a value meeting the threshold to some (resp. every) language. We provide a comprehensive picture of decidability and complexity for these problems for QLAs with common aggregators as well as their restrictions to omega-regular languages and distributions generated by finite Markov chains.

Ildar R. Hamzin, Rustam T. Ganiev, Anton V. Kochnev

Introduction. In the late 19th and early 20th centuries, Imperial Russia tended to prioritize the creation of trade and transport communications with countries of the East, which was vividly manifested in a number of projects, such as the Trans-Siberian Railway, Chinese Eastern Railway, and South Manchuria Railway. In this regard, not that widely known remains the Kyakhta Railway project, which implied a construction of a railway line from the Trans-Siberian Railway to Kyakhta with subsequent access to the territory of Mongolia. Goals. The paper attempts an analysis of how the concept of the Kyakhta Railway was evolutionizing throughout the late 19th and early 20th centuries, and seeks to reveal some key features arising from the latter’s geoeconomic and geopolitical objectives. Materials and methods. The work involves understudied materials stored at the Russian State Historical Archive, and methodologically rests on a systemic historical approach that secures insights into the development of the project from the perspectives of Imperial Russia’s political and economic interests and opportunities across Asia at the turn of the 20th century. Results. The conducted analysis of documents shows how the Kyakhta Railway project was actually developing. So, the earliest initiatives to build a railway line from Kyakhta to China’s northern borders were announced at the beginning of the 20th century, after Chinese authorities decided to lay a Beijing–Kalgan railway line. The Government was showing interest in the project under study in the direct aftermath the Russo-Japanese War of 1904–1905. And the project’s complete concept was introduced in a special note prepared by Kyakhta-based merchants in 1910 — to be finally approved in 1913. However, the outbreak of WWI postponed its implementation indefinitely. The article examines each stage in the shaping of the Kyakhta Railway project with emphases be laid on its geoeconomic and geopolitical objectives. The paper shows the project was viewed as a means to solve the then problems of Russian-Chinese and Russian-Mongolian trade, stimulate Eastern Siberia’s economy, fulfill transit potentials of Russia, and strengthen our geopolitical influence in the territory of Mongolia. Conclusions. The work attests to the Kyakhta Railway project was systemic and multifactorial by nature, illustrates its essential place in the overall geoeconomic strategies of the Russian Empire.

فكري عبدالمنعم السيد النجار

يهدف هذا البحث إلى بيان كيفيّة إنتاج قصائد الشِّعر العربيّ باستخدام إمكانات الذّكاء الاصطناعيّ كما نطلب منه إنتاج النّصوص النّثريّة والكتابات الإبداعيّة، ومن ثم عرض هذا الإنتاج على الضّوابط العَروضيّة والنّحويّة العربيّة، من خلال الاعتماد على المنهج الأسلوبيّ، مع الاستعانة بوصف النّصوص المنتَجة بالذّكاء الاصطناعيّ وتحليلها. واقتضت طبيعة الدّراسة تقسيمها إلى مقدمة، وثلاثة مباحث، وخاتمة، وقد تناولت المقدمة أهمية موضوع البحث، ومشكلته، وأهدافه، والدراسات السابقة، وأشهر مصطلحاته، ومنهجيته، وجاء المبحث الأوّل تحت عنوان الحاسوب وإنتاج الشِّعر (الشِّعر الآليّ)، ودرس المبحث الثّاني مطابقة الشِّعر المنتَج بالذّكاء الاصطناعيّ لضوابط العَروض والنّحو العربيّين، وقارن المبحث الثالث بين شعر الشعراء والنصوص (الشعرية) المنتَجَة بالذكاء الاصطناعي. ولخّصت الخاتمة أهم النّتائج والتّوصيات. ومنها: ثبوت ضعف إمكانات الذّكاء الاصطناعيّ لإنتاج الشِّعر العربيّ الموزون المقفّى، وأنّه غير قادر على إنتاج نصّ شعريّ منضبط عروضيًّا باللّغة العربيّة. وشاع في إنتاج الذكاء الاصطناعي استعمال الجملة الفعليّة، في مقابل استعمال الجملة الاسميّة.

Kostikyan Kristine

Kalāntars were the high officials of Şafavid, Afshārid and Qājār administration of towns, who managed the affairs referring to handicraft production and trade there. During the predominance of the Iranian states of the period the towns of Transcaucasia had kalāntars, and more often Armenian kalāntars were at the head of the towns, where Armenians formed the majority of the urban population. Armenian kalāntars were usually the representatives of local elite families of eminent melik‘s and merchants. The research on the topic has helped reveal the names of a few Armenian kalāntars in Agulis, Zagam, Loři, Erevan, Barda and Tiflis, also trace some peculiarities in the functions of this official in the region. The kalāntars of the mentioned towns usually managed the affairs of not only the town, but also those of the surrounding villages, since handicrafts and trade were among the main occupations of the inhabitants of many Armenian villages. The next peculiarity of office in the regions is the frequent cases of transmission of the post from father to son.

Araks Pashayan

Since the establishment of the Syrian Arab Republic in 1946, successive regimes have systematically denied the Kurdish population its fundamental national rights. The outbreak of the Arab Spring in 2011 sparked a renewed Kurdish political awakening, as Kurdish-majority regions in northern Syria transitioned from initial caution to assertive political and military mobilization. Rejecting President Bashar al-Assad’s (2000–2024) limited reform proposals and centralist vision, Kurdish political actors, backed by the United States, established a de facto autonomous administration in 2013, structured around three self-governing cantons. This development significantly altered the trajectory of the Syrian conflict and expanded the scope of foreign intervention, particularly by Turkey. Despite facing considerable territorial, demographic, and infrastructural losses, Kurdish-led forces, in coordination with international allies, successfully resisted existential threats, most notably from ISIS. The ousting of President al-Assad in December 2024 and the subsequent peace agreement between Syrian Democratic Forces (SDF) Commander Mazloum Abdi and interim President Ahmad al-Sharaa in March 2025 further underscored the Syrian state's enduring opposition to Kurdish aspirations for de jure autonomy. This article examines how the Syrian civil war (2011–2024) reshaped the Kurdish national movement, analyzing the interplay between Kurdish political mobilization, state fragmentation, and regional constraints that limited the realization of Kurdish autonomy within Syria’s political landscape. Through historical and political analysis, the study argues that the Kurdish struggle under al-Assad’s regime laid a critical foundation for future claims to broaden national rights. The experience of de facto sovereignty, despite its limitations, provides a crucial framework for advancing Kurdish political agency within a reconfigured, post-conflict Syrian state.

Harutyunyan Anush

The article is devoted to the investigation of the ethnic structure of Soviet Azerbaijan based on the materials of the agricultural census, which conducted in summer of 1921. The data of the census published in the pages of “Izvestiya” of Az․ CSD from 1921 to 1924 and in publications dedicated to each uezd (administrative unit). The articles published in these magazine and books deal with different issues of Azerbaijan’s society: branches of agriculture, cargo transportation, trade, education and schools, but we are interested in that information, which introduce the ethnicity of the republic. The importance of these materials is essentially high. It shows how many ethnic and subethnic groups had been living in the current territory of Azerbaijan, what language they spoke, what kind of ethno consolidation processes had been fixed, thus, how they expressed their ethnic identification and what kind of theoretical and practical problems arose during the identification process.

Ronie Salgado

System programming languages are typically compiled in a linear pipeline process, which is a completely opaque and isolated to end-users. This limits the possibilities of performing meta-programming in the same language and environment, and the extensibility of the compiler itself by end-users. We propose a novel redefinition of the compilation process in terms of interpreting the program definition as a script. This evaluation is performed in an environment where the full compilation pipeline is implemented and exposed to the user via a meta-object protocol, which forms the basis for a meta-circular definition and implementation of the programming language itself. We demonstrate the feasibility of this approach by bootstrapping a self-compiling implementation of Sysmel, a static and dynamic typed Smalltalk and C++ inspired programming language.

Noah Bertram, Alex Levinson, Justin Hsu

The fair division literature in economics considers how to divide resources between multiple agents such that the allocation is envy-free: each agent receives their favorite piece. Researchers have developed a variety of fair division protocols for the most standard setting, where the agents want to split a single item, however, the protocols are highly intricate and the proofs of envy-freeness involve tedious case analysis. We propose Slice, a domain specific language for fair-division. Programs in our language can be converted to logical formulas encoding envy-freeness and other target properties. Then, the constraints can be dispatched to automated solvers. We prove that our constraint generation procedure is sound and complete. We also report on a prototype implementation of Slice, which we have used to automatically check envy-freeness for several protocols from the fair division literature.

Andrea Colledan, Ugo Dal Lago

In the realm of quantum computing, circuit description languages represent a valid alternative to traditional QRAM-style languages. They indeed allow for finer control over the output circuit, without sacrificing flexibility nor modularity. We introduce a generalization of the paradigmatic lambda-calculus Proto-Quipper-M, itself modeling the core features of the quantum circuit description language Quipper. The extension, called Proto-Quipper-K, is meant to capture a very general form of dynamic lifting. This is made possible by the introduction of a rich type and effect system in which not only computations, but also the very types are effectful. The main results we give for the introduced language are the classic type soundness results, namely subject reduction and progress.

Giovanni Sileno, Thomas van Binsbergen, Matteo Pascucci et al.

Several solutions for specifying normative artefacts (norms, contracts, policies) in a computational processable way have been presented in the literature. Legal core ontologies have been proposed to systematize concepts and relationships relevant to normative reasoning. However, no solution amongst those has achieved general acceptance, and no common ground (representational, computational) has been identified enabling us to easily compare them. Yet, all these efforts share the same motivation of representing normative directives, therefore it is plausible that there may be a representational model encompassing all of them. This presentation will introduce DPCL, a domain-specific language (DSL) for specifying higher-level policies (including norms, contracts, etc.), centred on Hohfeld's framework of fundamental legal concepts. DPCL has to be seen primarily as a "template", i.e. as an informational model for architectural reference, rather than a fully-fledged formal language; it aims to make explicit the general requirements that should be expected in a language for norm specification. In this respect, it goes rather in the direction of legal core ontologies, but differently from those, our proposal aims to keep the character of a DSL, rather than a set of axioms in a logical framework: it is meant to be cross-compiled to underlying languages/tools adequate to the type of target application. We provide here an overview of some of the language features.

Charlie Snell, Mengjiao Yang, Justin Fu et al.

Goal-oriented dialogue systems face a trade-off between fluent language generation and task-specific control. While supervised learning with large language models is capable of producing realistic text, how to steer such responses towards completing a specific task without sacrificing language quality remains an open question. In this work, we formulate goal-oriented dialogue as a partially observed Markov decision process, interpreting the language model as a representation of both the dynamics and the policy. This view allows us to extend techniques from learning-based control, such as task relabeling, to derive a simple and effective method to finetune language models in a goal-aware way, leading to significantly improved task performance. We additionally introduce a number of training strategies that serve to better focus the model on the task at hand. We evaluate our method, Context-Aware Language Models (CALM), on a practical flight-booking task using AirDialogue. Empirically, CALM outperforms the state-of-the-art method by 7% in terms of task success, matching human-level task performance.

Antoine Amarilli, Louis Jachiet, Charles Paperman

We study the dynamic membership problem for regular languages: fix a language L, read a word w, build in time O(|w|) a data structure indicating if w is in L, and maintain this structure efficiently under letter substitutions on w. We consider this problem on the unit cost RAM model with logarithmic word length, where the problem always has a solution in O(log |w| / log log |w|) per operation. We show that the problem is in O(log log |w|) for languages in an algebraically-defined, decidable class QSG, and that it is in O(1) for another such class QLZG. We show that languages not in QSG admit a reduction from the prefix problem for a cyclic group, so that they require Ω(log |w| / log log |w|) operations in the worst case; and that QSG languages not in QLZG admit a reduction from the prefix problem for the multiplicative monoid U 1 = {0, 1}, which we conjecture cannot be maintained in O(1). This yields a conditional trichotomy. We also investigate intermediate cases between O(1) and O(log log |w|). Our results are shown via the dynamic word problem for monoids and semigroups, for which we also give a classification. We thus solve open problems of the paper of Skovbjerg Frandsen, Miltersen, and Skyum [30] on the dynamic word problem, and additionally cover regular languages.

Birthe van den Berg, Tom Schrijvers, Casper Bach-Poulsen et al.

The development of programming languages can be quite complicated and costly. Hence, much effort has been devoted to the modular definition of language features that can be reused in various combinations to define new languages and experiment with their semantics. A notable outcome of these efforts is the algebra-based "datatypes a la carte" (DTC) approach. When combined with algebraic effects, DTC can model a wide range of common language features. Unfortunately, the current state of the art does not cover modular definitions of advanced control-flow mechanisms that defer execution to an appropriate point, such as call-by-name and call-by-need evaluation, as well as (multi-)staging. This paper defines latent effects, a generic class of such control-flow mechanisms. We demonstrate how function abstractions, lazy computations and a MetaML-like staging can all be expressed in a modular fashion using latent effects, and how they can be combined in various ways to obtain complex semantics. We provide a full Haskell implementation of our effects and handlers with a range of examples.

Martin Ruefenacht, Derek Schafer, Anthony Skjellum et al.

Over the past two decades, C++ has been adopted as a major HPC language (displacing C to a large extent, andFortran to some degree as well). Idiomatic C++ is clearly how C++ is being used nowadays. But, MPIs syntax and semantics defined and extended with C and Fortran interfaces that align with the capabilities and limitations of C89 and Fortran-77.Unfortunately, the language-independent specification also clearly reflects the intersection of what these languages could syntactically and semantically manage at the outset in 1993, rather than being truly language neutral.In this paper, we propose a modern C++ language interface to replace the C language binding for C++ programmers with an upward-compatible architecture that leverages all the benefits of C++11-20 for performance, productivity, and interoperability with other popular C++ libraries and interfaces for HPC. Demand is demonstrably strong for this second attempt at language support for C++ in MPI after the original interface, which was added in MPI-2, then was found to lack specific benefits over theC binding, and so was subsequently removed in MPI-3. Since C++ and its idiomatic usage have evolved since the original C++ language binding was removed from the standard, this new effort is both timely and important for MPI applications. Also, many C++ application programmers create their own, ad hoc shim libraries over MPI to provide some degree of abstraction unique to their particular project, which means many such abstraction libraries are being devised without any specific commonality other than the demand for such.

Maria A. Ochir-Goryaeva, Eileen Eckmeie, Viktor Weizenegger

Introduction. In the Republic of Kalmykia, agriculture is characterized by the prevalence of livestock breeding. Still, excessive grazing has resulted in land degradation. Materials. Analysis of buried soils from excavated kurgans reveals that the Late Bronze Age and Late Medieval Period witnessed extensive desertification processes across vast territories of Eastern European steppes. Those trends were determined by global climate aridization traced in other ecosystems too, i.e. were caused by natural changes. Results. Present-day desertification also takes place in the background of universal aridization but its enormous scale and destructiveness are aggravated by multiple anthropogenic impacts, i.e. human activity. For a qualitative assessment, the paper analyzes a timeseries of satellite images made by Landsat-TM Earth observing sensor from 1985 to 2011, and makes statistical estimates of related NDVI and TGSI indices. There is an increase in vegetation cover within the investigated area, and this despite the fact that yearly temperatures during the period kept increasing, too. So, the reduced desertification rates have resulted not from favorable climatic factors but rather from purposeful countervailing efforts.

Oleg S. Rinchinov

Introduction. The Tibetan-language written tradition is a most significant and distinctive cultural phenomenon of global significance, both in terms of amount and content, and in sophisticated approaches to classification and systematization. In recent decades, numerous projects have been initiated which aimed at digitizing the Tibetan heritage. Goals. The study seeks to identify and evaluate methodological and instrumental approaches to the presentation of Tibetan-language monuments in the global information space. Materials and Methods. The work includes a comparative analysis of the most successful international initiatives intended for preservation and actualization of the Tibetan written culture with the aid of modern information technologies. Firstly, these projects are interesting from the perspective of initial motivations of participants, characteristics of their target audience, and main methodologies implemented. Secondly, particular attention is paid to the consideration of the technical backend of the projects and certain specific features of the frontend information resources created within their framework, namely, online databases and web portals. Results. The analysis reveals the initiatives have been based on a variety of academic, religious and social motives that define both the target audience and organizational and methodological approaches. Thus, digital adaptation of the Tibetan written tradition appears in aspects of preservation of cultural heritage, actualization of its religious and social significance, historical reconstruction of cultural interaction in Central, Southern and Eastern Asia. The paper also clarifies that the proposed information resources form a continuous digital environment that gives a holistic representation of the content, history and current state of Tibetan written culture. Conclusions. The digital initiatives under consideration not only make an invaluable contribution to the development of academic Tibetan studies but also provide a form of social, informational and educational support to native communities spread across different countries and involved in Tibetan culture. With the use of the methodological and information technology developments described in the article, organizations that deal with the problems of preserving and studying historical and cultural heritage around the world could plan or correct their activities in the digital sphere.

Oscar H. Ibarra, Ian McQuillan

The store language of a machine of some arbitrary type is the set of all store configurations (state plus store contents but not the input) that can appear in an accepting computation. New algorithms and characterizations of store languages are obtained, such as the result that any nondeterministic pushdown automaton augmented with reversal-bounded counters, where the pushdown can "flip" its contents up to a bounded number of times, can be accepted by a machine with only reversal-bounded counters. Then, connections are made between store languages and several model checking and reachability problems, such as accepting the set of all predecessor and successor configurations from a given set of configurations, and determining whether there are at least one, or infinitely many, common configurations between accepting computations of two machines. These are explored for a variety of different machine models often containing multiple parallel data stores. Many of the machine models studied can accept the set of predecessor configurations (of a regular set of configurations), the set of successor configurations, and the set of common configurations between two machines, with a machine model that is simpler than itself, with a decidable emptiness, infiniteness, and disjointness property. Store languages are key to showing these properties.