Search

BackgroundAimsMethodsResultsConclusionA greater amount of education is known to positively impact language skills in neurotypical populations, but its influence on language outcomes and recovery after stroke remains unclear.This study of 749 stroke survivors, with and without aphasia, investigated (A) which aphasia assessment tasks benefitted most from more pre-stroke education; and whether the effect of education (B) differs for aphasic and non-aphasic participants or other stroke and non-stroke-related variables, and/or (C) facilitates recovery from post-stroke aphasia.Participants ranged from one month to 42 years post-stroke. They were assessed using (i) the Comprehensive Aphasia Test (CAT), and (ii) self-report questionnaires that measured speech production, comprehension, reading, and writing at one week and one year post-stroke. Multiple regression analyses investigated the effect of education amount, and its interaction with other variables, on language outcomes and recovery. Bayesian statistics assessed the strength of the evidence for any observed effects. Many variables including lesion size, age at stroke, and initial severity were controlled for.(A) More years of formal education were associated with better overall language skills, with significant, albeit small effects found for semantic and letter fluency (β = 0.123 and 0.166) and spoken picture description, specifically, the number of words produced (β = 0.085) and grammatical well-formedness (β = 0.087). (B) The benefit of more pre-stroke education was mostly additive with the effects of other variables including initial aphasia severity and left hemisphere lesion size, but was reduced in older participants who had large lesions with severe initial symptoms. Finally, (C) no significant effect of education on language recovery was observed.More pre-stroke formal education is associated with higher post-stroke language scores on a wide range of tasks for both aphasic and non-aphasic participants, but, in participants with large lesions that cause severe aphasia, this advantage diminishes with age. These results suggest a generic benefit of education on language test performance rather than a specific role of pre-stroke education in aiding language outcomes and recovery. An individual’s educational background should therefore be considered when interpreting assessment scores. [ABSTRACT FROM AUTHOR]

'Co-design' problems try to simultaneously design the physical and control components to improve the overall system performance. However, existing co-design paradigms cannot deal with complex frequency temporal domain specifications. In this paper, we investigate the co-design problem for a class of linear parameter-varying (LPV) systems with frequency temporal domain specifications. Firstly, the frequency temporal domain specifications are written in a formal language called spectral temporal logic (STL). Secondly, the satisfaction conditions of the spectral temporal logic specifications have been transformed into non-linear matrices inequality forms with necessary and sufficient conditions. Thirdly, the co-design problem is transformed into a non-convex optimisation problem with mixed-integer linear matrix inequalities (MILMIs) constraints, and then an iterative algorithm is proposed to solve the co-design problem with semidefinite programming (SDP). Finally, the performance of the algorithm and the expressiveness of spectral temporal logic are illustrated with the applications to micro-electromechanical systems (MEMS). [ABSTRACT FROM AUTHOR]

From the late 1950s, the Czech designer Libuše Niklová created many iconic toys. Her series were initially based on local traditions but increasingly moved away from their predecessors and contemporaries. What started as naturalist figurines would become inventive designs that incorporated articulation and abstraction. Her designs also broadened the scope of toys as educational tools, encouraging more experimentation and imagination. Produced in the 1960s, her inflatable toys series had many things in common with Pop Art. With their bright colours and simple formal language, these objects can be situated in the context of Western contemporary art. In their function, they also allowed for the possibility of modelling and movement in space – sculptural qualities that art historical research rarely attributes to toy design. In this way Niklová's toys reconfigure the hierarchy between art and design, and draw attention to the exchange of ideas between East and West. This article explores these entanglements and situates Niklová within this overlapping history. In so doing, it draws attention to the contribution of female designers to narratives of design. [ABSTRACT FROM AUTHOR]

This study explores how sociolinguistic competence can enhance the performance of Saudi translators, particularly in helping them handle cultural nuances, dialect differences, and levels of formality in their translation work. The researcher used a quantitative approach, with a structured questionnaire of 30 items to gather responses from 24 Saudi translators. These responses were then analyzed to see how sociolinguistic competence affects translation accuracy and cultural relevance. The results show that sociolinguistic competence greatly improves translation quality, especially when cultural sensitivity is crucial. Participants reported that understanding regional dialects, cultural values, and levels of formality is essential for creating culturally appropriate translations. However, the study also pointed out some challenges, like the difficulty of managing both informal and formal language and handling dialectal differences. Despite these challenges, the findings suggest that translators with strong sociolinguistic skills are better equipped to adapt their translations to fit various social and cultural contexts, ultimately boosting their overall performance. [ABSTRACT FROM AUTHOR]

This paper presents a comprehensive approach for planning for teams of heterogeneous robots with different capabilities and the transportation of resources. We use Capability Temporal Logic (CaTL), a formal language that helps express tasks involving robots with multiple capabilities with spatial, temporal, and logical constraints. We extend CaTL to also capture resource constraints, where resources can be divisible and indivisible, for instance, sand and bricks, respectively. Robots transport resources using various storage types, such as uniform (shared storage among resources) and compartmental (individual storage per resource). Robots' resource transportation capacity is defined based on resource type and robot class. Robot and resource dynamics and the CaTL mission are jointly encoded in a Mixed Integer Linear Programming (MILP), which maximizes disjoint robot and resource robustness while minimizing spurious movement of both. We propose a multi-robustness approach for Multi-Class Signal Temporal Logic (mcSTL), allowing for generalized quantitative semantics across multiple predicate classes. Thus, we compute availability robustness scores for robots and resources separately. Finally, we conduct multiple experiments demonstrating functionality and time performance by varying resources and storage types. [ABSTRACT FROM AUTHOR]

A multi-agent organizational model represents a coordination mechanism that allows tasks to be shared among agents to perform complex tasks. While the Agent-Group-Role organizational model (AGR) provides a concise methodological framework for designing multi-agent systems, it is expressed in informal language and lacks formal semantics. Consequently, designers of multi-agent systems have been unable to exploit this model for analysing and checking the behaviour of their systems. Some works propose investigating the issue of model transformation; unfortunately, no effort has been made to transform AGR models using a formal language defined on the semantics of true concurrency. The DD-LOTOS Language is one of the promising alternatives to this problem, as it is based on true concurrency semantics and supports the distributed aspect of the system. This paper proposes a formal approach that generates DD-LOTOS specifications from AGR models. This formalization permits the analysis, verification, and validation of the important properties of an organization. Model-to-text (M2T) transformation uses the Xpand tools to implement the approach. The e-commerce case study is used to illustrate our approach. [ABSTRACT FROM AUTHOR]

Among modern language teaching methods, the theory of second language acquisition is one of the leading methods. Stephen Krasche's theory of second language acquisition represents an important shift in the way linguists and educators approach language learning. Funded in the 1970s and 1980s, Krashen's model focuses on the idea that language acquisition is a natural and subconscious process that differs from formal language learning. His development comes from the fact that real fluency comes from getting to know the language and mastering it, rather than memorizing grammar rules. At the same time, the educator emphasizes the special diseases of language learners' attention to emotion. The five main assumptions included in Krashen's theory became teaching in language teaching, shaping methods such as immersion and communicative language teaching, which prioritize natural detail and understanding over rote learning. Krashen's theory emphasizes naturalistic, input-based approaches, and suggests that language learning environments should minimize formal grammar and material in order for my acquisition to work more effectively. Stephen Krashen's second language acquisition process suggests that the second language acquisition process closely mimics the natural language acquisition process found in first language learners. His work challenges several key assumptions about language learning. [ABSTRACT FROM AUTHOR]

This study proposes a deep learning-based text style transfer and synonym recommendation model to help international students overcome language barriers in formal writing. The system utilizes the KoBART model to convert informal and translated text into formal styles and employs the RoBERTa model for synonym recommendations. Fine-tuning of the KoBART model was performed using the 'Korean SmileStyle' dataset to maximize its effectiveness in formal style conversion. The synonym recommendation model identifies key words in a sentence, masks them, and suggests suitable alternatives using the Daum dictionary API and RoBERTa. This research demonstrates that the proposed system effectively assists international students in adopting appropriate formal styles and selecting proper vocabulary. Future developments include expanding the system to automatically generate formal emails based on the input of the subject and recipient, enhancing communication efficiency in formal contexts. Overall, this system shows great promise as a supportive tool for formal writing across various scenarios. [ABSTRACT FROM AUTHOR]

Temporal Logics are a rich variety of logical systems designed for specifying properties over time, and about events and changes in the world over time. Traditional temporal logic, however, is limited to binary outcomes true or false and lacks the capacity to specify performance properties of a system such as the maximum, minimum, or average costs between states. Current languages do not accommodate the quantification of such performance properties, especially in scenarios involving infinite execution paths where performance property like cumulative sums may fail to converge. To this end, this paper introduces a novel formal language aimed at assessing system performance, which encapsulates not only temporal dynamics but also various performance-related properties. In this study, this paper utilizes reinforcement learning techniques to compute the values of performance property formulas. Finally, in the experimental part, a formal language representation of system performance properties was implemented, and the values of the performance property formulas were computed using reinforcement learning. The effectiveness and feasibility of the proposed method were validated. [ABSTRACT FROM AUTHOR]

This paper investigates the complexity of real functions through proof techniques inspired by formal language theory. Productiveness, which is a stronger form of non-recursive enumerability, is employed to analyze the complexity of various problems related to real functions. Our work provides a deep reexamination of Hilbert's tenth problem and the equivalence to the identically 0 function problem, extending the undecidability results of these problems into the realm of productiveness. Additionally, we study the complexity of the equivalence to the identically 0 function problem over different domains. We then construct highly efficient many-one reductions to establish Rice-style theorems for the study of real functions. Specifically, we show that many predicates, including those related to continuity, differentiability, uniform continuity, right and left differentiability, semi-differentiability, and continuous differentiability, are as hard as the equivalence to the identically 0 function problem. Due to their high efficiency, these reductions preserve nearly any level of complexity, allowing us to address both complexity and productiveness results simultaneously. By demonstrating these results, which highlight a more nuanced and potentially more intriguing aspect of real function theory, we provide new insights into how various properties of real functions can be analyzed. [ABSTRACT FROM AUTHOR]

This paper suggests that psychoanalysis is a crucial tool for understanding the impact of Artificial Intelligence (AI) on us as speaking beings. It explores the nature of undecidability, which is both paradoxical and incomputable. The paper argues that the discovery of this undecidability, whether in language or formal systems, challenges the supremacy of reason's teleological finality and suggests that computation inherently contains incomputable data. This is not merely a system error but an integral part of computation. Drawing on Lacan's teaching, the paper further discusses how the signifying order is also inherently incomplete, with this incompleteness built into the system itself. The paper concludes by identifying the undecidable as an inherent aspect of any computable system, thus challenging attempts to ground rationality solely on computation. [ABSTRACT FROM AUTHOR]

The foundations of AI design discourse are worth analyzing. Here, attention is paid to the nature of theory languages used in designing new AI technologies because the limits of these languages can clarify some fundamental questions in the development of AI. We discuss three types of theory language used in designing AI products: formal, computational, and natural. Formal languages, such as mathematics, logic, and programming languages, have fixed meanings and no actual-world semantics. They are context- and practically content-free. Computational languages use terms referring to the actual world, i.e., to entities, events, and thoughts. Thus, computational languages have actual-world references and semantics. They are thus no longer context- or content-free. However, computational languages always have fixed meanings and, for this reason, limited domains of reference. Finally, unlike formal and computational languages, natural languages are creative, dynamic, and productive. Consequently, they can refer to an unlimited number of objects and their attributes in an unlimited number of domains. The differences between the three theory languages enable us to reflect on the traditional problems of strong and weak AI. [ABSTRACT FROM AUTHOR]

The combinatorial properties of Fibonacci words and arrays are now a popularly studied concept in formal language theory. One such property is the palindromic property of words and arrays. In this paper, we construct algorithms to generate the involutive Fibonacci words and involutive Fibonacci arrays and to check, if a given word is involutive Fibonacci or not. We verify the algorithms using python programming. And we investigate the number of palindromes present in the sequences of involutive Fibonacci words and involutive Fibonacci arrays which has various applications. [ABSTRACT FROM AUTHOR]

The article presents an approach to the design of complex software systems based on special linguistic constructions in the form of Backus-Nour forms and syntactic diagrams. The goal is to create special mathematical and software that would formally describe the components of the designed software system for the study of a complex object, as well as visually form the structure and algorithmic component of the system. As a result, a formal language for describing discrete-continuous objects has been developed, which ensures the unification of the display of static and dynamic objects by introducing a generalized "element" construction; special mathematical software has been created for the formal description of complex systems, allowing to obtain syntactic constructions of minimal complexity due to the orthogonality of linguistic means; algorithms for processing language constructions have been created that take into account the parallelism of the processes of the studied objects and ensure the automated creation of a class system of special software. [ABSTRACT FROM AUTHOR]

Introduction. The widespread mass dissemination of digital technologies in all spheres of human activity places high demands on the quality of university students’ training in the field of IT. However, the quality of such training, and especially its fundamental nature, in many universities lags behind the requirements of the time. Additionally, a significant gap has emerged in higher education regarding the development of basic education curriculum for IT training. Aim. The present study aims to explore the potential of establishing the methodological foundation for the fundamental nature of education by incorporating mathematical principles into various specialised disciplines. This involves integrating discrete and continuous modelling principles and algorithmisation to create synergy. Results and scientific novelty. The synergy between discretion and continuity in mathematics, physics, and information processes is analysed. This analysis characterises the role of discrete mathematics in achieving a synergetic effect in teaching mathematics and computer science. It reveals the fundamental importance of mathematics in teaching formal modelling and algorithmisation languages. The significance of abstract algebra in the introductory teaching of formal languages at both school and university levels is justified. The significance of structures and algorithms, which are prevalent in discrete mathematics for training highly skilled programmers, is emphasised. Practical significance. The research findings will be of interest to both educational theorists and teachers, who provide IT training for students in various fields.

Cybercriminals have become an imperative threat because they target the most valuable resource on earth, data. Organizations prepare against cyber attacks by creating Cyber Security Incident Response Teams (CSIRTs) that use various technologies to monitor and detect threats and to help perform forensics on machines and networks. Testing the limits of defense technologies and the skill of a CSIRT can be performed through adversary emulation performed by so-called "red teams". The red team's work is primarily manual and requires high skill. We propose SpecRep, a system to ease the testing of the detection capabilities of defenses in complex, heterogeneous infrastructures. SpecRep uses previously known attack specifications to construct attack scenarios based on attacker objectives instead of the traditional attack graphs or a list of actions. We create a metalanguage to describe objectives to be achieved in an attack together with a compiler that can build multiple attack scenarios that achieve the objectives. We use text processing tools aided by large language models to extract information from freely available white papers and convert them to plausible attack specifications that can then be emulated by SpecRep. We show how our system can emulate attacks against a smart home, a large enterprise, and an industrial control system. [ABSTRACT FROM AUTHOR]

This article explores the challenges of understanding statistical language, particularly for students. The author shares their own struggles with mastering statistical language and highlights the issue of lexical ambiguity, where statistical terms have different meanings than their everyday counterparts. The lack of standardization in statistical language and the confusion caused by different terms for the same concepts are also discussed. The article emphasizes the importance of understanding statistical language for full participation in the discipline and suggests the need for careful language choice and awareness of lexical ambiguity. Different approaches to terminology and definitions are explored, with an emphasis on finding a balance between mathematical and linguistic requirements. The article acknowledges the difficulty of achieving a perfect solution to these challenges. [Extracted from the article]

The gap between software design and implementation often results in a lack of clarity and precision. Formal languages, based on mathematical rules, logic, and symbols, are invaluable for specifying and verifying system designs. Various semi-formal and formal languages, such as JSON, XML, predicate logic, and regular expressions, along with formal models like Turing machines, serve specific domains. This paper introduces a new specification formal language, ObTFL (Object Transaction Formal Language), developed for general-purpose distributed systems, such as specifying the interactions between servers and IoT devices and their security protocols. The paper details the syntax and semantics of ObTFL and presents three real case studies—federated learning, blockchain for crypto and bitcoin networks, and the industrial PCB board with machine synchronization—to demonstrate its versatility and effectiveness in formally specifying the interactions and behaviors of distributed systems. [ABSTRACT FROM AUTHOR]

Critical systems, in which failure and malfunction may result in severe human, environmental, and financial damages, are essential components in various sectors and particularly in energy domains. Although undesirable, integration error problems in the supervision of critical systems do occur, incurring significant expenses due to an operator's subjective analysis and hardware topology failures. In this work, a malleable model design approach is proposed to formulate and solve the integration error problem in critical systems' supervision in terms of reliability. A real hybrid power plant (HPP) case is considered for a case study with simulated data. A method framework with an informal approach (C4 diagram) and formal approach (hierarchical colored Petri nets) in a radial spectrum is applied to the HPP supervision design. In using formal methods, a formulation and solution to this problem through structured, scalable, and compact mathematical representations are possible. This malleable model is intended to guarantee the functional correctness and also reliability of the plant supervision system based on system software architecture. The outcomes suggest that the malleable model is appropriate for the energy domain and can be used for other types of critical systems, bringing all the benefits of this methodology to the context in which it will be applied. [ABSTRACT FROM AUTHOR]

The paper gives a partial answer to the question as to what groups can be represented as isometry groups of formal languages for generalized Levenshtein distances. Namely, it is proved that, for any language, the absolute value of the difference between the length of any of its words and the length of the image of this word under an isometry with respect to an arbitrary generalized Levenshtein distance is bounded above by a constant that depends only on the language, provided that the distance satisfies the condition that the weight of the substitution operation is less than the doubled weight of the deletion operation. It follows, in particular, that the isometry groups of formal languages for such distances can always be embedded in the group . A number of examples showing that this estimate is sharp in a certain sense are also constructed. [ABSTRACT FROM AUTHOR]

This article considers the formal and critical consequences of organizing an aesthetic corpus around the philosophical concept of the fragment via a reading of Aryan Kaganof's "Ten Monologues from the Lives of the Serial Killers" (1994). This experimental video sets spoken accounts from the perspective of the likes of Ted Bundy and Charles Manson alongside grainy, ambiguous imagery. Instead of thematic meditations on violence, the monologues circle around quasi-nostalgic reflections on the past and the nature of identity. The film frustrates any language of formal analysis that would rely on accounting for what is present in the film, instead proposing a sympathy with poststructuralism's efforts at displacing the metaphysics of appearance. Violence is not what resides ready-made within the work, nor is it reducible to the realm of the visible or the audible, but is an unstable process bound up with the act of reading itself. The fragment as a formal problem holds out the abstract, general notion of a break in ways that compel a rethinking of violence as something impersonal, rhythmic, and grammatical. [ABSTRACT FROM AUTHOR]

In Entities and Indices, M. J. Cresswell argued that a first-order modal language can reach the expressive power of natural-language modal discourse only if we give to the formal language a semantics with indices containing infinite possible worlds and we add to it an infinite collection of operators actually n and R e f n which store and retrieve worlds. In the fourth chapter of the book, Cresswell gave a proof that the resulting intensional language, which he called L ∗ , is as expressive as an extensional variant of it, called L , which has full quantification over worlds. In both linguistics and philosophy, Cresswell's book has been viewed as offering a compelling argument for preferring extensional systems in the study of natural language. In this paper, after providing a model-theoretic definition of the relation being as expressive as that can be applied to Cresswell's languages L and L ∗ , we show that the intensional language L ∗ is not as expressive as the extensional language L . This result, we claim, undermines Cresswell's argument to the effect that English modal discourse has the power of explicit quantification over worlds. Additionally, we show that L ∗ does become as expressive as L when we add Cresswell's operator of universal modality □ to L ∗ , which provides an extra amount of expressive power. Recently, I. Yanovich has advocated a view that is similar to ours in important respects. At the end of the paper we offer a short discussion of his formalism. [ABSTRACT FROM AUTHOR]

Planarized formal language has important artistic value and cultural significance in modern Chinese oil painting. This paper discusses the development of planarized language in China, from the early European influence to the modern localization practice, analyzes its artistic characteristics in composition, color, and modeling, and demonstrates the specific application of planarized language in Chinese oil painting. On this basis, four directions for the future development of planarized language are proposed, including strengthening the integration of local culture, exploring diversified expressive techniques, focusing on emotional and spiritual expression, and promoting international exchange and cooperation. The study shows that the planarized language has enriched the expression of Chinese oil painting, and continued research in this field will bring more innovation and development opportunities to the modern art world. [ABSTRACT FROM AUTHOR]

In Sweden, treatment for children with (developmental) language disorder ((D)LD) is traditionally carried out at a speech-language pathology (SLP) clinic, and based on formal language tests, which may not entirely represent the child’s everyday language and communication skills. SLP services that include video recordings have shown positive outcomes in terms of providing information about children’s linguistic and communicative abilities in everyday life, but little is known about the use of video in clinical practice. The aim of this study is therefore to investigate how Swedish SLPs link their clinical practices (assessment, treatment, and evaluation of treatment outcome) to the everyday language and communication abilities of children with (D)LD. A further aim is to explore SLPs’ utilisation of video recordings as a part of their clinical practices with the target group. A web-based questionnaire was distributed to SLPs in Sweden, who work with children with (D)LD. Results demonstrate that Swedish SLPs perceive that their intervention is in alignment with children’s everyday language and communication needs to a fairly high degree. However, an exception is assessment, which is considered to have a weaker alignment with children’s everyday communication abilities. The use of video recordings for clinical purposes is very limited. It is suggested here that incorporating video recordings from children’s everyday life would be an easy and time-efficient way to strengthen the ecological validity of SLP practices for children with (D)LD. [ABSTRACT FROM AUTHOR]

The objective of the paper is to present a methodology that can be used to translate a model from one formalism to another allowing model reuse and cross‐verification. With the use of formal languages, the model specifications can be expressed in a rigorous and univocal way, and the model can be validated against the specifications or conceptual model. Expressing the same model in different formal languages opens the conceptual model validation to a varied number of specialists. Also, in the context of modeling a new system, where there is no data to perform validation against a real system, having pairs of models can be used to perform cross‐model verification to ensure that the model specifications or conceptual models are correctly implemented by comparing the results produced by both models. Specifically, a method is presented to translate a model conceptualized on specification and description language (SDL) to discrete event system specification (DEVS). The transformation mechanism between SDL and DEVS formalisms is described. The methodology is exemplified with a disease spread model for COVID‐19, and it is shown how the results obtained by the two models can be used for cross‐verification. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Babylon Center for Humanities Studies is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In this paper, we put forward models that generate two-dimensional palindromic languages with array-rewriting rules. The rewriting rules are of either regular or context-free type with terminals being arrays. The derivation lengths are managed by the array concatenation conditions. These grammars give rise to an extensive variety of palindromic pictures. Different hierarchies that exist between the classes defined are demonstrated. The closure properties have also been evaluated. Applications of these models have been explored by generating a few patterns of kolams. [ABSTRACT FROM AUTHOR]

Grammar error correction systems are pivotal in the field of natural language processing (NLP), with a primary focus on identifying and correcting the grammatical integrity of written text. This is crucial for both language learning and formal communication. Recently, neural machine translation (NMT) has emerged as a promising approach in high demand. However, this approach faces significant challenges, particularly the scarcity of training data and the complexity of grammar error correction (GEC), especially for low-resource languages such as Indonesian. To address these challenges, we propose InSpelPoS, a confusion method that combines two synthetic data generation methods: the Inverted Spellchecker and Patterns+POS. Furthermore, we introduce an adapted seq2seq framework equipped with a dynamic decoding method and state-of-the-art Transformer-based neural language models to enhance the accuracy and efficiency of GEC. The dynamic decoding method is capable of navigating the complexities of GEC and correcting a wide range of errors, including contextual and grammatical errors. The proposed model leverages the contextual information of words and sentences to generate a corrected output. To assess the effectiveness of our proposed framework, we conducted experiments using synthetic data and compared its performance with existing GEC systems. The results demonstrate a significant improvement in the accuracy of Indonesian GEC compared to existing methods. [ABSTRACT FROM AUTHOR]

Consumer complaints play a crucial role for companies in understanding customer needs and spotting possible areas of improvement. In the digital era, online platforms have become popular venues for users to voice their concerns. According to Communication Accommodation Theory (CAT) and recipient design, consumers may have different recipients in mind when writing a complaint and tailor their language accordingly. This study aims to examine language variations in consumer complaints on an independent platform and a corporate platform, exploring how consumers adjust their language based on the intended recipients of their complaints. Comments under complaint posts from Reddit's dedicated subreddit, r/Spotify, and from the Spotify Community were extracted and analyzed using the Linguistic Inquiry and Word Count (LIWC), a text analysis tool. This comparative analysis identified and compared various linguistic categories within the consumer complaints from the perspectives of formality, emotion, and assertion. The results showed that complaints on the corporate platform (1) used more formal language, (2) contained more negative emotional tones and emotion words, and (3) exhibited more assertiveness compared to those on the independent platform. Understanding the distinct linguistic features in consumer complaints on different platforms can help companies tailor their responses and address customer concerns effectively. This research contributes to the growing field of online consumer complaining behavior by uncovering how language is employed within different online communities depending on the message recipient. Furthermore, it demonstrates the potential of LIWC as a valuable tool for analyzing unstructured consumer‐generated content across diverse digital platforms, offering insights into user sentiment and experiences. [ABSTRACT FROM AUTHOR]

This paper deals with an important aspect of the integration of loan nouns into the grammatical systems of languages attesting to grammatical gender, namely gender assignment. Traditionally, it is assumed that gender assignment takes place according to the internal assignment rules of the replica language. In many cases, however, the original grammatical gender is borrowed along with the source word. This is the case of gender copy which often takes place under special (sociolinguistic) conditions and is used as assignment strategy in languages to a different extent. A special focus of my study is on gender assignment and particularly gender copy in the contact of languages of different assignment types (formal vs. semantic). The empirical data comes from five European languages in different sociolinguistic situations, attesting to different assignment systems and of different language branches of two language families – Indo-European (Romanian, Slavic, and Indo-Arian) and Nakh-Daghestanian (Lezgic and Tsezic). The analysis shows that gender copy is possible mostly in the contact of languages of the same assignment type. In the contact of languages of the formal assignment type, gender copy often goes along with the formal adjustment of the loan word. Sociolinguistic circumstances play an important role as to the possibility and frequency of the occurrence of gender copy. [ABSTRACT FROM AUTHOR]

Copyright of Bulletin of Ablai Khan KazUIRandWL: Series 'Philological sciences' is the property of Kazakh Ablai Khan University of International Relations & World Languages and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of GRID - Architecture, Planning & Design Journal is the property of GRID - Architecture, Planning & Design Journal and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The visual modeling language UML embodies object-oriented design principles. It provides a standard way to visualize the design of a system. It exploits a rich set of well-defined graphical notations for creating abstract models. However, the power of UML is lessened through partially specified formal semantics. Indeed, UML notations are semi-formal and do not lead to fully formalized and executable semantics. Fortunately, UML diagrams are prone to early formalization. Formal methods are a valuable tool that can help overcome the UML constructs' shortage of firm semantics. It is a powerful way to ascribe precise semantics to the graphical notations used in UML diagrams and models. Our work aims to support the semantics of the UML Interaction Overview Diagram. It introduces an approach to leveraging the strengths of the Maude Rewriting Logic language as a formal specification language. The proposal relies on a model-driven engineering approach. It aims to automate the UML Interaction Overview Diagram's mapping to a Maude language specification. The Maude language and its linked tools, including the Maude Model Checker, are used to analyze and verify the resulting Maude specification. Finally, an application example shows the feasibility and benefits of the proposed approach. [ABSTRACT FROM AUTHOR]

The article responds to a commentary on the absence of evidence for language syntax in songbird vocalizations. The authors critique the concept of core-Merge used by SM24, arguing that it is incoherent and arbitrary. They also discuss the evolutionary implications of core-Merge and its role in the evolution of language. The authors conclude that bird call combinations do not provide evidence for language evolution. [Extracted from the article]

In this paper, we put forward models that generate two-dimensional palindromic languages with array-rewriting rules. The rewriting rules are of either regular or context-free type with terminals being arrays. The derivation lengths are managed by the array concatenation conditions. These grammars give rise to an extensive variety of palindromic pictures. Different hierarchies that exist between the classes defined are demonstrated. The closure properties have also been evaluated. Applications of these models have been explored by generating a few patterns of kolams.

We introduce the infix inclusion problem of two languages S and T that decides whether or not S is a subset of the set of all infixes of T. This problem is motivated by the need for identifying malicious computation patterns according to their semantics, which are often disguised with additional sub-patterns surrounding information. In other words, malicious patterns are embedded as an infix of the whole pattern. We examine the infix inclusion problem for the case where a source S and a target T are finite, regular or context-free languages. We prove that the problem is 1) co-NP-complete when one of the languages is finite, 2) PSPACE-complete when both S and T are regular, 3) EXPTIME-complete when S is context-free and T is regular, 4) undecidable when S is either regular or context-free and T is context-free and 5) undecidable when one of S and T is in a language class where the emptiness of its languages is undecidable, even if the other is finite. We, furthermore, explore the infix inclusion problem for visibly pushdown languages, a subclass of context-free languages. [ABSTRACT FROM AUTHOR]

Word equations are equations α ≐ β where α and β are words consisting of letters from some alphabet Σ and variables from a set X. Recently, there has been substantial interest in the context of string solving in logics combining word equations with other kinds of constraints on words such as (regular) language membership (regular constraints) and arithmetic over string lengths (length constraints). We consider the expressive power of such logics by looking at the set of all values a single variable might take as part of a satisfying assignment for a given formula. Hence, each formula-variable pair defines a formal language, and each logic defines a class of formal languages. We consider logics arising from combining word equations with either length constraints, regular constraints, or both. We also consider word equations with visibly pushdown language membership constraints as a generalisation of the combination of regular and length constraints. We show that word equations with visibly pushdown membership constraints are sufficient to express all recursively enumerable languages and hence satisfiability is undecidable in this case. We then establish a strict hierarchy involving the other combinations. We also provide a complete characterisation of when a thin regular language is expressible by word equations (alone) and some further partial results for regular languages in the general case. [ABSTRACT FROM AUTHOR]

This paper reports on the development and validation of a formal model for an automotive adaptive exterior lights system (ELS) with multiple variants in Alloy 6, which is the most recent version of the Alloy lightweight formal specification language that supports mutable relations and temporal logic. We explore different strategies to address variability, one in pure Alloy and another through an annotative language extension. We then show how Alloy and its Analyzer can be used to validate systems of this nature, namely by checking that the reference scenarios are admissible, and to automatically verify whether the established requirements hold. A prototype was developed to translate the provided validation sequences into Alloy and back to further automate the validation process. The resulting ELS model was validated against the provided validation sequences and verified for most of requirements for all variants. [ABSTRACT FROM AUTHOR]

In this article, we present an approach to the ABZ 2020 case study that differs from those usually presented at ABZ: Rather than using a (correct-by-construction) approach following a formal method, we use C for a low-level implementation instead. We strictly adhere to test-driven development for validation, and only afterwards apply model checking using CBMC for verification. While the approach has several benefits compared to the more rigorous approaches, it also provides less mathematical clarity and overall less thorough verification. In consequence, our realization of the ABZ case study serves as a baseline reference for comparison, allowing to assess the benefit provided by the various formal modeling languages, methods and tools. [ABSTRACT FROM AUTHOR]

Lewis (The Journal of Philosophy, 65(5), 113–126, 1968) attempts to provide an account of modal talk in terms of the resources of counterpart theory, a first-order theory that eschews transworld identity. First, a regimentation of natural language modal claims into sentences of a formal first-order modal language L is assumed. Second, a translation scheme from L-sentences to sentences of the language of the theory is provided. According to Hazen (The Journal of Philosophy, 76(6), 319–338, 1979) and Fara & Williamson (Mind, 114(453), 1–30, 2005), the account cannot handle certain natural language modal claims involving a notion of actuality. The challenge has two parts. First, in order to handle such claims, the initial formal modal language that natural language modal claims are regimented into must extend L with something like an actuality operator. Second, certain ways that Lewis' translation scheme for L might be extended to accommodate an actuality operator are unacceptable. Meyer (Mind, 122(485), 27–42, 2013) attempts to defend Lewis' approach. First, Meyer holds that in order to handle such claims, the formal modal language L ∗ that we initially regiment our natural language claims into need not contain an actuality operator. Instead, we can make do with other resources. Next, Meyer provides an alternative translation scheme from L ∗ -sentences to sentences of an enriched language of counterpart theory. Unfortunately, Meyer's approach fails to provide an appropriate counterpart theoretic account of natural language modal claims. In this paper, I demonstrate that failure. [ABSTRACT FROM AUTHOR]

Reaction systems are a model of computing aiming to formalize biochemistry by capturing the qualitative relations between the species, and explicitly discarding any accounts of multiplicity. From the point of view of the formal language theory, this situates them in the realm of set rewriting. In this work, we propose a series of extensions of reaction systems to use strings. These extensions form a spectrum in the sense that all of them honor the hallmark features of the original model: the threshold principle and the non-permanency principle. We thoroughly discuss the details of the structure and the behavior of these variants, and commence studying their expressive power by comparing them to some classic models of computing. [ABSTRACT FROM AUTHOR]

This work introduces the new class of pure reaction automata, as well as a new update manner, called maximal reactive manner, that can also be applied to standard reaction automata. Pure reaction automata differ from the standard model in that they don't have permanence: the entities that are not consumed by the reactions happening at a certain state are not conserved in the result states. We prove that the set of languages accepted by the new class under the maximal reactive manner contains the set of languages accepted by standard reaction automata under the same manner or under the maximal parallel manner. We also prove that a strict subclass of pure reaction automata can compute any partial recursive function. [ABSTRACT FROM AUTHOR]