Hasil untuk "Semantics"

Rui Pimentel de Figueiredo, Stefan Nordborg Eriksen, Ignacio Rodriguez et al.

Corrosion, a naturally occurring process leading to the deterioration of metallic materials, demands diligent detection for quality control and the preservation of metal-based objects, especially within industrial contexts. Traditional techniques for corrosion identification, including ultrasonic testing, radiographic testing, and magnetic flux leakage, necessitate the deployment of expensive and bulky equipment on-site for effective data acquisition. An unexplored alternative involves employing lightweight, conventional camera systems and state-of-the-art computer vision methods for its identification. In this work, we propose a complete system for semi-automated corrosion identification and mapping in industrial environments. We leverage recent advances in three-dimensional (3D) point-cloud-based methods for localization and mapping, with vision-based semantic segmentation deep learning techniques, in order to build semantic–geometric maps of industrial environments. Unlike the previous corrosion identification systems available in the literature, which are either intrusive (e.g., electrochemical testing) or based on costly equipment (e.g., ultrasonic sensors), our designed multi-modal vision-based system is low cost, portable, and semi-autonomous and allows the collection of large datasets by untrained personnel. A set of experiments performed in relevant test environments demonstrated quantitatively the high accuracy of the employed 3D mapping and localization system, using a light detection and ranging (LiDAR) device, with less than <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>0.05</mn></mrow></semantics></math></inline-formula> m and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>0.02</mn></mrow></semantics></math></inline-formula> m average absolute and relative pose errors. Also, our data-driven semantic segmentation model was shown to achieve <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>70</mn><mo>%</mo></mrow></semantics></math></inline-formula> precision in corrosion detection when trained with our pixel-wise manually annotated dataset.

James Peck, Tom I-P. Shih, K. Mark Bryden et al.

Newton’s law of cooling requires a reference temperature (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>T</mi></mrow><mrow><mi>r</mi><mi>e</mi><mi>f</mi></mrow></msub></mrow></semantics></math></inline-formula>) to define the heat-transfer coefficient (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>h</mi></mrow></semantics></math></inline-formula>). For external flows with multiple temperatures in the freestream, obtaining <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>T</mi></mrow><mrow><mi>r</mi><mi>e</mi><mi>f</mi></mrow></msub></mrow></semantics></math></inline-formula> is a challenge. One widely used method, referred to as the adiabatic-wall (AW) method, obtains <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>T</mi></mrow><mrow><mi>r</mi><mi>e</mi><mi>f</mi></mrow></msub></mrow></semantics></math></inline-formula> by requiring the surface of the solid exposed to convective heat transfer to be adiabatic. Another widely used method, referred to as the linear-extrapolation (LE) method, obtains <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>T</mi></mrow><mrow><mi>r</mi><mi>e</mi><mi>f</mi></mrow></msub></mrow></semantics></math></inline-formula> by measuring/computing the heat flux (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msubsup><mrow><mi>q</mi></mrow><mrow><mi>s</mi></mrow><mrow><mo>′</mo><mo>′</mo></mrow></msubsup></mrow></semantics></math></inline-formula>) on the solid surface at two different surface temperatures (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>T</mi></mrow><mrow><mi>s</mi></mrow></msub></mrow></semantics></math></inline-formula>) and then linearly extrapolating to <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msubsup><mrow><mi>q</mi></mrow><mrow><mi>s</mi></mrow><mrow><mo>′</mo><mo>′</mo></mrow></msubsup><mo>=</mo><mn>0</mn></mrow></semantics></math></inline-formula>. A third recently developed method, referred to as the state-space (SS) method, obtains <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>T</mi></mrow><mrow><mi>r</mi><mi>e</mi><mi>f</mi></mrow></msub></mrow></semantics></math></inline-formula> by probing the temperature space between the highest and lowest in the flow to account for the effects of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>T</mi></mrow><mrow><mi>s</mi></mrow></msub></mrow></semantics></math></inline-formula> or <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msubsup><mrow><mi>q</mi></mrow><mrow><mi>s</mi></mrow><mrow><mo>′</mo><mo>′</mo></mrow></msubsup></mrow></semantics></math></inline-formula> on <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>T</mi></mrow><mrow><mi>r</mi><mi>e</mi><mi>f</mi></mrow></msub></mrow></semantics></math></inline-formula>. This study examines the foundation and accuracy of these methods via a test problem involving film cooling of a flat plate where <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msubsup><mrow><mi>q</mi></mrow><mrow><mi>s</mi></mrow><mrow><mo>′</mo><mo>′</mo></mrow></msubsup></mrow></semantics></math></inline-formula> switches signs on the plate’s surface. Results obtained show that only the SS method could guarantee a unique and physically meaningful <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>T</mi></mrow><mrow><mi>r</mi><mi>e</mi><mi>f</mi></mrow></msub></mrow></semantics></math></inline-formula> where <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>T</mi></mrow><mrow><mi>s</mi></mrow></msub><mo>=</mo><msub><mrow><mi>T</mi></mrow><mrow><mi>r</mi><mi>e</mi><mi>f</mi></mrow></msub></mrow></semantics></math></inline-formula> on a nonadiabatic surface <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msubsup><mrow><mi>q</mi></mrow><mrow><mi>s</mi></mrow><mrow><mo>′</mo><mo>′</mo></mrow></msubsup><mo>=</mo><mn>0</mn></mrow></semantics></math></inline-formula>. The AW and LE methods both assume <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>T</mi></mrow><mrow><mi>r</mi><mi>e</mi><mi>f</mi></mrow></msub></mrow></semantics></math></inline-formula> to be independent of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>T</mi></mrow><mrow><mi>s</mi></mrow></msub></mrow></semantics></math></inline-formula>, which the SS method shows to be incorrect. Though this study also showed the adiabatic-wall temperature, <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>T</mi></mrow><mrow><mi>A</mi><mi>W</mi></mrow></msub></mrow></semantics></math></inline-formula>, to be a good approximation of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>T</mi></mrow><mrow><mi>r</mi><mi>e</mi><mi>f</mi></mrow></msub></mrow></semantics></math></inline-formula> (<10% relative error), huge errors can occur in <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>h</mi></mrow></semantics></math></inline-formula> about the solid surface where <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>|</mo><msub><mrow><mi>T</mi></mrow><mrow><mi>s</mi></mrow></msub><mo>−</mo><msub><mrow><mi>T</mi></mrow><mrow><mi>A</mi><mi>W</mi></mrow></msub><mo>|</mo></mrow></semantics></math></inline-formula> is near zero because where <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>T</mi></mrow><mrow><mi>s</mi></mrow></msub><mo>=</mo><msub><mrow><mi>T</mi></mrow><mrow><mi>A</mi><mi>W</mi></mrow></msub></mrow></semantics></math></inline-formula>, <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msubsup><mrow><mi>q</mi></mrow><mrow><mi>s</mi></mrow><mrow><mo>′</mo><mo>′</mo></mrow></msubsup><mo>≠</mo><mn>0</mn></mrow></semantics></math></inline-formula>.

Hanyu Liang, Chengrui Liu, Wenjing Liu et al.

To address the difficulty of detecting on-orbit faults of spacecraft under complex operating conditions in time, rational monitoring and assessment of spacecraft health status are essential for ensuring its safe, stable, and reliable operation. Considering the complexity, coupling, and multidimensionality of telemetry data, this paper proposes a method for monitoring the health status of spacecraft based on multidimensional data fusion for a key electromechanical component of a spacecraft control system. The method first extracts the explicit and implicit features of the multidimensional coupled telemetry parameters via physical feature formulas and a stacked autoencoder. Then, the extracted features are fused and filtered to obtain the health factor—a performance degradation trend described the evolution law of key component health status over runtime. Moreover, the different degradation stages are identified via an unsupervised clustering algorithm. Finally, a Bidirectional Long Short-Term Memory (Bi-LSTM) is used to construct a health status prediction model in stages. By taking Control Moment Gyroscopes (CMGs) as experimental verification subjects, the proposed method demonstrates significantly superior performance compared to other methods across prediction accuracy metrics including MSE, RMSE, and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mi>R</mi><mn>2</mn></msup></semantics></math></inline-formula>. This study provides robust technical support for health status monitoring of key spacecraft electromechanical components under specific fault modes.

Demosthenes Ellinas, Giorgio Kaniadakis

A novel approach to the quantum version of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>κ</mi></semantics></math></inline-formula>-entropy that incorporates it into the conceptual, mathematical and operational framework of quantum computation is put forward. Various alternative expressions stemming from its definition emphasizing computational and algorithmic aspects are worked out: First, for the case of canonical Gibbs states, it is shown that <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>κ</mi></semantics></math></inline-formula>-entropy is cast in the form of an expectation value for an observable that is determined. Also, an operational method named “the two-temperatures protocol” is introduced that provides a way to obtain the <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>κ</mi></semantics></math></inline-formula>-entropy in terms of the partition functions of two auxiliary Gibbs states with temperatures <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>κ</mi></semantics></math></inline-formula>-shifted above, the hot-system, and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>κ</mi></semantics></math></inline-formula>-shifted below, the cold-system, with respect to the original system temperature. That protocol provides physical procedures for evaluating entropy for any <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>κ</mi></semantics></math></inline-formula>. Second, two novel additional ways of expressing the <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>κ</mi></semantics></math></inline-formula>-entropy are further introduced. One determined by a non-negativity definite quantum channel, with Kraus-like operator sum representation and its extension to a unitary dilation via a qubit ancilla. Another given as a simulation of the <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>κ</mi></semantics></math></inline-formula>-entropy via the quantum circuit of a generalized version of the Hadamard test. Third, a simple inter-relation of the von Neumann entropy and the quantum <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>κ</mi></semantics></math></inline-formula>-entropy is worked out and a bound of their difference is evaluated and interpreted. Also the effect on the <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>κ</mi></semantics></math></inline-formula>-entropy of quantum noise, implemented as a random unitary quantum channel acting in the system’s density matrix, is addressed and a bound on the entropy, depending on the spectral properties of the noisy channel and the system’s density matrix, is evaluated. The results obtained amount to a quantum computational tool-box for the <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>κ</mi></semantics></math></inline-formula>-entropy that enhances its applicability in practical problems.

Olabode A. Olanipekun, Carlos J. Montalvo, Sean G. Walker

Use of measures of effectiveness (MOE) analysis in exploring candidate systems or alternatives has been the subject of much debate in the systems engineering discipline, as some authors have noted. In this work, methods for MOE analysis are revisited as they pertain to an advanced air mobility platform, first by using the traditional approach, which involves the application of the Pugh matrix, and second by proposing an approach that involves a combination of two (2) methods, namely the Monte Carlo method (MCM) and the analytical hierarchy process (AHP), in order to evaluate and rank the preferred alternative from a selection of candidate systems. The latter method is termed the Monte Carlo–analytical hierarchical hybrid process (MC–AHHP). The results obtained from the application of both approaches demonstrate that the MC–AHHP is a less subjective, more objective, data-driven, and quantitative measure for MOE analysis compared to the erstwhile Pugh matrix method. While the Pugh matrix ranked the SAR AAM as first overall among seven (7) alternatives, the MC–AHHP ranked the same second among three (3) alternatives. The subsequent verification and validation process showed that the MC–AHHP approach resulted in a degree of consistency value of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>0.083</mn></mrow></semantics></math></inline-formula>, where <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>C</mi><mi>I</mi><mo>/</mo><mi>R</mi><mi>I</mi><mo><</mo><mn>0.10</mn></mrow></semantics></math></inline-formula> represents an acceptable level of consistency. Thus, the MC–AHHP approach is recommended as a viable decision-making tool for adoption by systems engineering practitioners.

Eduardo G. de Souza, Raj Khosla, Kenneth A. Sudduth et al.

Yield maps represent crop production output and are essential for evaluating within-field spatial variability. Managing this yield variability is critical for precision and digital agriculture to facilitate optimized crop yield and reduced environmental impact. This work evaluated the spatial and temporal variability in corn and soybean yield data from three conventionally managed agricultural fields, with nine, three, and four seasons’ data. The data variability was measured through standard deviation (<i>SD</i>) and coefficient of variation (<i>CV%</i>). After separately normalizing each year of the yield data set, the temporal variability (<i>TSD</i> and <i>TCV%</i>) was calculated by grid cell for each field across years. A new index is proposed in this paper, the yield performance index (<i>YPI</i>, the ratio of mean normalized yield (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mover accent="true"><mrow><mi>Y</mi></mrow><mo stretchy="false">¯</mo></mover></mrow><mrow><mi>N</mi></mrow></msub></mrow></semantics></math></inline-formula>) to the <i>TSD</i>), as an index with a lower value for lower yield and higher temporal variability. Two, three, and four zones were delineated using only <i>YPI</i>. These zones were valuable for identifying areas needing particular attention, with consistently (i) high yields and low variability or (ii) low yields and high variability.

Abdullah Alfahaid, Tim Morris, Tim Cootes et al.

<b>Background/Objectives:</b> Age-related macular degeneration (AMD) is the leading cause of visual impairment among the elderly. Optical coherence tomography angiography (OCTA) is a non-invasive imaging modality that enables detailed visualisation of retinal vascular layers. However, clinical assessment of OCTA images is often challenging due to high data volume, pattern variability, and subtle abnormalities. This study aimed to develop automated algorithms to detect and quantify AMD in OCTA images, thereby reducing ophthalmologists’ workload and enhancing diagnostic accuracy. <b>Methods:</b> Two texture-based algorithms were developed to classify OCTA images without relying on segmentation. The first algorithm used whole local texture features, while the second applied principal component analysis (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>P</mi><mi>C</mi><mi>A</mi></mrow></semantics></math></inline-formula>) to decorrelate and reduce texture features. Local texture descriptors, including rotation-invariant uniform local binary patterns (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>L</mi><mi>B</mi><msup><mi>P</mi><mrow><mn>2</mn><mi>r</mi><mi>i</mi><mi>u</mi></mrow></msup></mrow></semantics></math></inline-formula>), local binary patterns (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>L</mi><mi>B</mi><mi>P</mi></mrow></semantics></math></inline-formula>), and binary robust independent elementary features (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>B</mi><mi>R</mi><mi>I</mi><mi>E</mi><mi>F</mi></mrow></semantics></math></inline-formula>), were combined with machine learning classifiers such as support vector machine (SVM) and K-nearest neighbour (KNN). OCTA datasets from Manchester Royal Eye Hospital and Moorfields Eye Hospital, covering healthy, dry AMD, and wet AMD eyes, were used for evaluation. <b>Results:</b> The first algorithm achieved a mean area under the receiver operating characteristic curve (AUC) of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>1.00</mn><mo>±</mo><mn>0.00</mn></mrow></semantics></math></inline-formula> for distinguishing healthy eyes from wet AMD. The second algorithm showed superior performance in differentiating dry AMD from wet AMD (AUC <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>0.85</mn><mo>±</mo><mn>0.02</mn></mrow></semantics></math></inline-formula>). <b>Conclusions:</b> The proposed algorithms demonstrate strong potential for rapid and accurate AMD diagnosis in OCTA workflows. By reducing manual image evaluation and associated variability, they may support improved clinical decision-making and patient care.

Julien Saan Joachim, Marc de Visme, Stefan Haar

Classical Petri nets provide a canonical model of concurrency, with unfolding semantics linking nets, occurrence nets, and event structures. No comparable framework exists for quantum concurrency: existing ''quantum Petri nets'' lack rigorous concurrent and sound quantum semantics, analysis tools, and unfolding theory. We introduce Quantum Petri Nets (QPNs), Petri nets equipped with a quantum valuation compatible with the quantum event structure semantics of Clairambault, De Visme, and Winskel (2019). Our contributions are: (i) a local definition of Quantum Occurrence Nets (LQONs) compatible with quantum event structures, (ii) a construction of QPNs with a well-defined unfolding semantics, (iii) a compositional framework for QPNs. This establishes a semantically well grounded model of quantum concurrency, bridging Petri net theory and quantum programming.

Qing Wang, Zehan Li, Hang Lv et al.

Human communication involves more than explicit semantics, with implicit signals and contextual cues playing a critical role in shaping meaning. However, modern speech technologies, such as Automatic Speech Recognition (ASR) and Text-to-Speech (TTS) often fail to capture these beyond-semantic dimensions. To better characterize and benchmark the progression of speech intelligence, we introduce Spoken Interaction System Capability Levels (L1-L5), a hierarchical framework illustrated the evolution of spoken dialogue systems from basic command recognition to human-like social interaction. To support these advanced capabilities, we propose Beyond-Semantic Speech (BoSS), which refers to the set of information in speech communication that encompasses but transcends explicit semantics. It conveys emotions, contexts, and modifies or extends meanings through multidimensional features such as affective cues, contextual dynamics, and implicit semantics, thereby enhancing the understanding of communicative intentions and scenarios. We present a formalized framework for BoSS, leveraging cognitive relevance theories and machine learning models to analyze temporal and contextual speech dynamics. We evaluate BoSS-related attributes across five different dimensions, reveals that current spoken language models (SLMs) are hard to fully interpret beyond-semantic signals. These findings highlight the need for advancing BoSS research to enable richer, more context-aware human-machine communication.

TANG Mengmeng, GUO Yuanbo, ZHANG Han et al.

The cybersecurity field lacks sufficient annotated data for event recognition, and the scenarios and semantics are complex, making it difficult to construct accurate event recognition models. A few-shot cybersecurity event detection method by data augmentation with prompting question answering was proposed. Firstly, event representation knowledge was obtained using prompt information and combined with label words to map cybersecurity event types. New data was generated from unlabeled text to expand the training data. Then, the generated high-confidence pseudo-annotated instances and raw data were used to fine-tune the model to enhance its semantic understanding of cybersecurity events. Experimental verification was conducted on two datasets in cybersecurity. The result showes that the proposed method’s substantial superiority in low-resource network security event detection tasks compared to other baseline methods.

Lianyin Jia, Dongyang Li, Haihe Zhou et al.

List intersection plays a pivotal role in various domains such as search engines, database systems, and social networks. Efficient indexes and query strategies can significantly enhance the efficiency of list intersection. Existing inverted index-based algorithms fail to utilize the length information of documents and require excessive list intersections, resulting in lower efficiency. To address this issue, in this paper, we propose the LDRpV (Length-based Document Reordering plus Verification) algorithm. LDRpV filters out documents that are unlikely to satisfy the intersection results by reordering documents based on their length, thereby reducing the number of candidates. Additionally, to minimize the number of list intersection operations, an intersection and verification strategy is designed, where only the first <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>m</mi></semantics></math></inline-formula> lists are intersected, and the resulting candidate set is directly verified. This approach effectively improves the efficiency of list intersection. Experimental results on four real datasets demonstrate that LDRpV can achieve a maximum efficiency improvement of 46.69% compared to the most competitive counterparts.

Liudmyla Hryzhak

The present research focuses on the exploration of the meaning of the word ‘creature’ in the context of Elizabethan prose fiction. The inherent vagueness and ambiguity of the lexeme ‘creature’, comprising diverse meanings, yields its multiple readings and interpretations The aim of this study is to determine who or what this word denotes in narrative contexts, thereby elucidating its varied meanings and delineating the scope of its referents within the framework of denotational semantics Through a comprehensive analysis of the compiled corpus of Renaissance narratives, employing qualitative and quantitative methodologies, this investigation establishes a range of meanings of the word ‘creature’ and identifies its referents in the corpus texts The referential domain of this word encompasses humans, nonhuman beings, and unspecified entities. The findings reveal a distinct preference among Elizabethan authors to perceive “creature” as a human being, aligning with the biblical interpretation of this word This research highlights the impact of biblical motifs on Elizabethan fiction, contributing to our better understanding of this literary era within its historical, cultural, and religious background.

Ruiyao Li, Xucheng Wang, Yuantao Zhang

In recent years, the in situ resource utilization of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>CO</mi><mn>2</mn></msub></semantics></math></inline-formula> in the Martian atmosphere by low-temperature plasma technology has garnered significant attention. However, numerical simulation is extremely time-consuming for modeling the complex <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>CO</mi><mn>2</mn></msub></semantics></math></inline-formula> plasma, involving tens of species and hundreds of reactions, especially under Martian pressure. In this study, a deep neural network (DNN) with multiple hidden layers is introduced to investigate the <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>CO</mi><mn>2</mn></msub></semantics></math></inline-formula> conversion in radio-frequency (RF) discharges at a given power density under Martian pressure in almost real time. After training on the dataset obtained from the fluid model or experimental measurements, the DNN shows the ability to accurately and efficiently predict the various discharge characteristics and plasma chemistry of RF <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>CO</mi><mn>2</mn></msub></semantics></math></inline-formula> discharge even in seconds. Compared with conventional fluid models, the computational efficiency of the DNN is improved by nearly <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mn>10</mn><mn>6</mn></msup></semantics></math></inline-formula> times; thus, a real-time calculation of RF <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>CO</mi><mn>2</mn></msub></semantics></math></inline-formula> discharge can almost be achieved. The DNN can provide an enormous amount of data to enhance the simulation results due to the very high computational efficiency. The numerical data also suggest that the <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>CO</mi><mn>2</mn></msub></semantics></math></inline-formula> conversion increases with driving frequency at a fixed power density. This study shows the ability of the DNN-based approach to investigate <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>CO</mi><mn>2</mn></msub></semantics></math></inline-formula> conversion in RF discharges for various applications, providing a promising tool for the modeling of complex non-thermal plasmas.

Brian Homerding, Atmn Patel, Enrico Armenio Deiana et al.

A compiler's intermediate representation (IR) defines a program's execution plan by encoding its instructions and their relative order. Compiler optimizations aim to replace a given execution plan with a semantically-equivalent one that increases the program's performance for the target architecture. Alternative representations of an IR, like the Program Dependence Graph (PDG), aid this process by capturing the minimum set of constraints that semantically-equivalent execution plans must satisfy. Parallel programming like OpenMP extends a sequential execution plan by adding the possibility of running instructions in parallel, creating a parallel execution plan. Recently introduced parallel IRs, like TAPIR, explicitly encode a parallel execution plan. These new IRs finally make it possible for compilers to change the parallel execution plan expressed by programmers to better fit the target parallel architecture. Unfortunately, parallel IRs do not help compilers in identifying the set of parallel execution plans that preserve the original semantics. In other words, we are still lacking an alternative representation of parallel IRs to capture the minimum set of constraints that parallel execution plans must satisfy to be semantically-equivalent. Unfortunately, the PDG is not an ideal candidate for this task as it was designed for sequential code. We propose the Parallel Semantics Program Dependence Graph (PS-PDG) to precisely capture the salient program constraints that all semantically-equivalent parallel execution plans must satisfy. This paper defines the PS-PDG, justifies the necessity of each extension to the PDG, and demonstrates the increased optimization power of the PS-PDG over an existing PDG-based automatic-parallelizing compiler. Compilers can now rely on the PS-PDG to select different parallel execution plans while maintaining the same original semantics.

Yuhan Liu, Qianxin Huang, Siqi Hui et al.

Homography estimation is the task of determining the transformation from an image pair. Our approach focuses on employing detector-free feature matching methods to address this issue. Previous work has underscored the importance of incorporating semantic information, however there still lacks an efficient way to utilize semantic information. Previous methods suffer from treating the semantics as a pre-processing, causing the utilization of semantics overly coarse-grained and lack adaptability when dealing with different tasks. In our work, we seek another way to use the semantic information, that is semantic-aware feature representation learning framework.Based on this, we propose SRMatcher, a new detector-free feature matching method, which encourages the network to learn integrated semantic feature representation.Specifically, to capture precise and rich semantics, we leverage the capabilities of recently popularized vision foundation models (VFMs) trained on extensive datasets. Then, a cross-images Semantic-aware Fusion Block (SFB) is proposed to integrate its fine-grained semantic features into the feature representation space. In this way, by reducing errors stemming from semantic inconsistencies in matching pairs, our proposed SRMatcher is able to deliver more accurate and realistic outcomes. Extensive experiments show that SRMatcher surpasses solid baselines and attains SOTA results on multiple real-world datasets. Compared to the previous SOTA approach GeoFormer, SRMatcher increases the area under the cumulative curve (AUC) by about 11% on HPatches. Additionally, the SRMatcher could serve as a plug-and-play framework for other matching methods like LoFTR, yielding substantial precision improvement.

Moysova Olga, Boyko Anna, Marchenko Svetlana

Ecologist in today’s world should know the terminology in related to ecology areas. Thus, modern ecological education should be accompanied with the development of some nature interpretation skills within the language. In many languages, there is a special category of words – onomatopoeia (onomatopes), which conditionally reproduce various sounds that exist in nature: bam, bom, bang, bul, boom, cap, ding, chik, smack, upchi, etc. Onomatopoeia (onomatopoeia) occupies a prominent place among the "peripheral", marginal phenomena of language, and the interest of linguists in onomatopoeia is by no means accidental. Onomatopoeic words, due to their figurativeness, high stylistic expressiveness and phonetic instability, are of great interest to researchers. The present study is a comprehensive study of the structure, semantics, and stylistics of onomatopoeia in modern Russian and English. The result of the study is a comprehensive description of the structure of onomatopoeia, as well as a comprehensive examination of their semantic and stylistic aspects of the modern Russian language in comparison with English, as well as the definition of patterns in their translation.

Kochman-Haładyj Bożena, Kiełtyka Robert

The present paper, adopting some of the tools offered by Cognitive Linguistics, namely the mechanisms of conceptual metaphor and metonymy, is a qualitative study of a sociolinguistic nature. Its overall purpose is an attempt at exhibiting a paradigm shift in the representation of women in Anglo-American proverbs. Combining the potential of the cross-fertilisation between Cognitive Linguistics and paremiological studies, the study appertains to the sense-threads embedded in the figurative language of proverbs, with the main focus on a cognitive semantic analysis of selected Anglo-American paremias directed towards women and animals. The main goal of the research is the juxtaposition of the meaning coded in two proverbs of traditional status, as representatives of a larger group of paremiological units (i.e. A woman, a cat, and a chimney should never leave the house; A whistling girl and a crowing hen always come to no good end), reflecting the deep-rooted gender-biased ideology in patriarchal Anglo-American society, with the content of the selected anti-proverb (i.e. The early bird gets up to serve his wife breakfast in bed) and a contemporary proverb (i.e. A woman without a man is like a fish without a bicycle), serving as sample evidence of the heralds of a paradigm shift in the issue of gender stereotyping stored in paremiological wisdom. The paper shows that the motivation behind the use of the analysed proverbs is to be accounted for by reference to the mechanism of metaphor-metonymy interaction, while the rise of new gender-related proverbs can be regarded as a sign of socio-cultural changes. Specifically, through the medium of modern paremiology, asymmetrical representation of male and female gender, coupled with traditional masculine and feminine characteristics as well as social roles, appears if not endangered then, at least, to be taking a promising path.

Peter R. Wills

The origin of genetic coding is characterised as an event of cosmic significance in which quantum mechanical causation was transcended by constructive computation. Computational causation entered the physico-chemical processes of the pre-biotic world by the incidental satisfaction of a condition of reflexivity between polymer sequence information and system elements able to facilitate their own production through translation of that information. This event, which has previously been modelled in the dynamics of Gene–Replication–Translation systems, is properly described as a process of self-guided self-organisation. The spontaneous emergence of a primordial genetic code between two-letter alphabets of nucleotide triplets and amino acids is easily possible, starting with random peptide synthesis that is RNA-sequence-dependent. The evident self-organising mechanism is the simultaneous quasi-species bifurcation of the populations of information-carrying genes and enzymes with aminoacyl-tRNA synthetase-like activities. This mechanism allowed the code to evolve very rapidly to the ~20 amino acid limit apparent for the reflexive differentiation of amino acid properties using protein catalysts. The self-organisation of semantics in this domain of physical chemistry conferred on emergent molecular biology exquisite computational control over the nanoscopic events needed for its self-construction.

Xinghan Liu, Guoshun Nan, Qimei Cui et al.

Recently proliferated semantic communications (SC) aim at effectively transmitting the semantics conveyed by the source and accurately interpreting the meaning at the destination. While such a paradigm holds the promise of making wireless communications more intelligent, it also suffers from severe semantic security issues, such as eavesdropping, privacy leaking, and spoofing, due to the open nature of wireless channels and the fragility of neural modules. Previous works focus more on the robustness of SC via offline adversarial training of the whole system, while online semantic protection, a more practical setting in the real world, is still largely under-explored. To this end, we present SemProtector, a unified framework that aims to secure an online SC system with three hot-pluggable semantic protection modules. Specifically, these protection modules are able to encrypt semantics to be transmitted by an encryption method, mitigate privacy risks from wireless channels by a perturbation mechanism, and calibrate distorted semantics at the destination by a semantic signature generation method. Our framework enables an existing online SC system to dynamically assemble the above three pluggable modules to meet customized semantic protection requirements, facilitating the practical deployment in real-world SC systems. Experiments on two public datasets show the effectiveness of our proposed SemProtector, offering some insights of how we reach the goal of secrecy, privacy and integrity of an SC system. Finally, we discuss some future directions for the semantic protection.

Jesse Heyninck, Badran Raddaoui, Christian Straßer

In formal argumentation, a distinction can be made between extension-based semantics, where sets of arguments are either (jointly) accepted or not, and ranking-based semantics, where grades of acceptability are assigned to arguments. Another important distinction is that between abstract approaches, that abstract away from the content of arguments, and structured approaches, that specify a method of constructing argument graphs on the basis of a knowledge base. While ranking-based semantics have been extensively applied to abstract argumentation, few work has been done on ranking-based semantics for structured argumentation. In this paper, we make a systematic investigation into the behaviour of ranking-based semantics applied to existing formalisms for structured argumentation. We show that a wide class of ranking-based semantics gives rise to so-called culpability measures, and are relatively robust to specific choices in argument construction methods.