Restoring high-quality images from severely degraded inputs is essential for video coding for machines (VCM), where background regions are compressed at extremely low bitrates. In this letter, we propose a novel text-guided diffusion-based restoration (TGDR) algorithm, which integrates semantic information from text captions to guide the restoration process. Specifically, we develop a refinement block that incorporates a transformer-based time-aware feature extractor to fuse visual features, time-step embeddings, and textual semantics adaptively to guide a pretrained diffusion model during the reverse denoising process. By incorporating both visual and textual information, TGDR effectively reconstructs complex structures and improves semantic consistency in highly compressed regions. Experimental results show that TGDR achieves superior performance compared to state-of-the-art algorithms.
We report six radio observations of four microquasars—SS 433, GRS 1915+105, Cyg X-3 and MAXI J1820+070—conducted between 2022 and 2025 with the Five-hundred-meter Aperture Spherical radio Telescope (FAST) using its pulsar backend, achieving a time resolution of 98.304 <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi mathvariant="sans-serif">μ</mi></semantics></math></inline-formula>s across an effective feed range of 1.04–1.45 GHz. A major focus of this work is the development of a standardized calibration pipeline for microquasar observations, including RFI mitigation, flux density, and polarization calibration, as well as multi-beam correlation inspections. Using On–Off mode and cross-beam verification, radio activity was detected in SS 433, GRS 1915+105 and Cyg X-3, while MAXI J1820+070 remained inactive. Both SS 433 and GRS 1915+105 show low linear polarization degrees of only a few percent. No credible quasi-periodic oscillations (QPOs) were detected in the 0.01–100 Hz range, suggesting that radio QPOs within this frequency range are relatively rare compared to those observed in the X-ray band. We therefore highlight the importance of future monitoring with high–time-resolution and high–sensitivity radio telescopes such as FAST, which will be crucial for revealing the correlation between jet and accretion processes and for uncovering the physical origin of QPOs.
Theodore Andronikos, Constantinos Bitsakos, Konstantinos Nikas
et al.
This paper introduces a novel quantum algorithm that is able to classify a hierarchy of classes of imbalanced Boolean functions. The fundamental characteristic of imbalanced Boolean functions is that the proportion of elements in their domain that take the value 0 is not equal to the proportion of elements that take the value 1. For every positive integer, <i>n</i>, the hierarchy contains a class of <i>n</i>-ary Boolean functions defined according to their behavioral pattern. The common trait of all the functions belonging to the same class is that they possess the same imbalance ratio. Our algorithm achieves classification in a straightforward manner as the final measurement reveals the unknown function with a probability of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>1.0</mn></mrow></semantics></math></inline-formula>. Let us also note that the proposed algorithm is an optimal oracular algorithm because it can classify the aforementioned functions with just a single query to the oracle. At the same time, we explain in detail the methodology we followed to design this algorithm in the hope that it will prove general and fruitful, given that it can be easily modified and extended to address other classes of imbalanced Boolean functions that exhibit different behavioral patterns.
Currently, in deep learning-based smart contract vulnerability detection solutions, the direct use of bytecode or source code for textual sequence feature representation lacks a comprehensive understanding of program semantics. The smart contract vulnerability detection technology based on Abstract Syntax Tree (AST) embedding fully considers the syntax and semantic features needed for contract vectorization and appropriate processing granularity, enabling more accurate capturing of smart contract vulnerability features. First, it employs Solidity syntax tree parsing to design a smart-contract vectorization method based on AST embedding. It partitions node types recursively at the statement level to generate sequences of statement trees. Subsequently, a recursive neural network is employed to encode each statement tree from the bottom up, transforming the intricate AST structure into statement-level feature vectors. Building on this foundation, a Bidirectional Gated Recurrent neural network model with an Attention mechanism (BiGRU-ATT) is constructed. This facilitates the learning of features from the sequences of statement trees and accomplishes the detection and categorization of five typical vulnerabilities: re-entrancy, unchecked return values, timestamp dependency, access control, and denial-of-service attacks. Experimental results demonstrate that the proposed method improves the micro-F1 and macro-F1 metrics by 13 and 10 percentage points, respectively, compared to the direct vectorization of source code as a text sequence. In tasks related to timestamp dependence, access control, and denial-of-service attack vulnerability classification, the BiGRU-ATT model with the attention mechanism achieves an F1 value of over 88%.
Md Helal Hossen, Daniel Gibney, Sharma V. Thankachan
We revisit the following version of the Gapped String Indexing problem, where the goal is to preprocess a text <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>T</mi><mo>[</mo><mn>1</mn><mrow><mo>.</mo><mspace width="0.166667em"></mspace><mo>.</mo></mrow><mi>n</mi><mo>]</mo></mrow></semantics></math></inline-formula> to enable efficient reporting of all <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>occ</mi></semantics></math></inline-formula> occurrences of a gapped pattern <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>P</mi><mo>=</mo><msub><mi>P</mi><mn>1</mn></msub><mrow><mo>[</mo><mi>α</mi><mrow><mo>.</mo><mspace width="0.166667em"></mspace><mo>.</mo></mrow><mi>β</mi><mo>]</mo></mrow><msub><mi>P</mi><mn>2</mn></msub></mrow></semantics></math></inline-formula> in <i>T</i>. An occurrence of <i>P</i> in <i>T</i> is defined as a pair <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>(</mo><mi>i</mi><mo>,</mo><mi>j</mi><mo>)</mo></mrow></semantics></math></inline-formula> where substrings <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>T</mi><mo>[</mo><mi>i</mi><mrow><mo>.</mo><mspace width="0.166667em"></mspace><mo>.</mo></mrow><mi>i</mi><mo>+</mo><mo>|</mo><msub><mi>P</mi><mn>1</mn></msub><mo>|</mo><mo>)</mo></mrow></semantics></math></inline-formula> and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>T</mi><mo>[</mo><mi>j</mi><mrow><mo>.</mo><mspace width="0.166667em"></mspace><mo>.</mo></mrow><mi>j</mi><mo>+</mo><mo>|</mo><msub><mi>P</mi><mn>2</mn></msub><mo>|</mo><mo>)</mo></mrow></semantics></math></inline-formula> match <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>P</mi><mn>1</mn></msub></semantics></math></inline-formula> and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>P</mi><mn>2</mn></msub></semantics></math></inline-formula>, respectively, with a gap <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>j</mi><mo>−</mo><mo>(</mo><mi>i</mi><mo>+</mo><mo>|</mo><msub><mi>P</mi><mn>1</mn></msub><mo>|</mo><mo>)</mo></mrow></semantics></math></inline-formula> lying within the interval <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>[</mo><mi>α</mi><mrow><mo>.</mo><mspace width="0.166667em"></mspace><mo>.</mo></mrow><mi>β</mi><mo>]</mo></mrow></semantics></math></inline-formula>. This problem has significant applications in computational biology and text mining. A hardness result on this problem suggests that any index with polylogarithmic query time must occupy near quadratic space. In a recent study [STACS 2024], Bille et al. presented a sub-quadratic space index using space <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mover accent="true"><mi mathvariant="script">O</mi><mo>˜</mo></mover><mrow><mo>(</mo><msup><mi>n</mi><mrow><mn>2</mn><mo>−</mo><mi>δ</mi><mo>/</mo><mn>3</mn></mrow></msup><mo>)</mo></mrow></mrow></semantics></math></inline-formula>, where <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>0</mn><mo>≤</mo><mi>δ</mi><mo>≤</mo><mn>1</mn></mrow></semantics></math></inline-formula> is a parameter fixed at the time of index construction. Its query time is <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mover accent="true"><mi mathvariant="script">O</mi><mo>˜</mo></mover><mrow><mo>(</mo><mo>|</mo></mrow><msub><mi>P</mi><mn>1</mn></msub><mrow><mo>|</mo><mo>+</mo><mo>|</mo></mrow><msub><mi>P</mi><mn>2</mn></msub><mrow><mo>|</mo><mo>+</mo><msup><mi>n</mi><mi>δ</mi></msup><mo>·</mo><mrow><mo>(</mo><mn>1</mn><mo>+</mo><mi>occ</mi><mo>)</mo></mrow><mo>)</mo></mrow></mrow></semantics></math></inline-formula>, which is sub-linear per occurrence when <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>δ</mi><mo><</mo><mn>1</mn></mrow></semantics></math></inline-formula>. We show how to achieve a gap-sensitive query time of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mover accent="true"><mi mathvariant="script">O</mi><mo>˜</mo></mover><mrow><mo>(</mo><mo>|</mo></mrow><msub><mi>P</mi><mn>1</mn></msub><mrow><mo>|</mo><mo>+</mo><mo>|</mo></mrow><msub><mi>P</mi><mn>2</mn></msub><mrow><mo>|</mo><mo>+</mo><msup><mi>n</mi><mi>δ</mi></msup><mo>·</mo><mrow><mo>(</mo><mn>1</mn><mo>+</mo><msup><mi>occ</mi><mrow><mn>1</mn><mo>−</mo><mi>δ</mi></mrow></msup><mo>)</mo></mrow><mo>+</mo><msub><mo>∑</mo><mrow><mi>g</mi><mo>∈</mo><mo>[</mo><mi>α</mi><mrow><mo>.</mo><mspace width="0.166667em"></mspace><mo>.</mo></mrow><mi>β</mi><mo>]</mo></mrow></msub><msub><mi>occ</mi><mi>g</mi></msub><mo>·</mo><msup><mi>g</mi><mi>δ</mi></msup><mo>)</mo></mrow></mrow></semantics></math></inline-formula> using the same space, where <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>occ</mi><mi>g</mi></msub></semantics></math></inline-formula> denotes the number of occurrences with gap <i>g</i>. This is faster when there are many occurrences with small gaps.
Adel Alahmadi, Altaf Alshuhail, Rowena Alma Betty
et al.
In this paper, we derive a mass formula for the self-orthogonal codes and self-dual codes over a non-commutative non-unitary ring, namely, <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>E</mi><mi>p</mi></msub><mo>=</mo><mfenced separators="" open="⟨" close="⟩"><mrow><mi>a</mi><mo>,</mo><mi>b</mi><mo>|</mo><mi>p</mi><mi>a</mi><mo>=</mo><mi>p</mi><mi>b</mi><mo>=</mo><mn>0</mn><mo>,</mo></mrow><msup><mi>a</mi><mn>2</mn></msup><mo>=</mo><mi>a</mi><mo>,</mo><msup><mi>b</mi><mn>2</mn></msup><mo>=</mo><mi>b</mi><mo>,</mo><mi>a</mi><mi>b</mi><mo>=</mo><mi>a</mi><mo>,</mo><mi>b</mi><mi>a</mi><mo>=</mo><mi>b</mi></mfenced><mo>,</mo></mrow></semantics></math></inline-formula> where <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>a</mi><mo>≠</mo><mi>b</mi></mrow></semantics></math></inline-formula> and <i>p</i> is any odd prime. We also give a classification of self-orthogonal codes and self-dual codes over <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>E</mi><mi>p</mi></msub></semantics></math></inline-formula>, where <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>p</mi><mo>=</mo><mn>3</mn><mo>,</mo><mn>5</mn><mo>,</mo></mrow></semantics></math></inline-formula> and 7, in short lengths.
(<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>R</mi><mo>,</mo><mi>S</mi></mrow></semantics></math></inline-formula>)-(skew) symmetric matrices have numerous applications in civil engineering, information theory, numerical analysis, etc. In this paper, we deal with the (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>R</mi><mo>,</mo><mi>S</mi></mrow></semantics></math></inline-formula>)-(skew) symmetric solutions to the quaternion matrix equation <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>A</mi><mi>X</mi><mi>B</mi><mo>=</mo><mi>C</mi></mrow></semantics></math></inline-formula>. We use a real representation <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mi>A</mi><mi>τ</mi></msup></semantics></math></inline-formula> to obtain the necessary and sufficient conditions for <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>A</mi><mi>X</mi><mi>B</mi><mo>=</mo><mi>C</mi></mrow></semantics></math></inline-formula> to have (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>R</mi><mo>,</mo><mi>S</mi></mrow></semantics></math></inline-formula>)-(skew) symmetric solutions and derive the solutions when it is consistent. We also derive the least-squares (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>R</mi><mo>,</mo><mi>S</mi></mrow></semantics></math></inline-formula>)-(skew) symmetric solution to the above matrix equation.
Nowadays, the demand for high-precision devices is becoming more intense, thanks to the growing complexity and sophistication of modern technology and applications, including microscopy, nanomeasurement and analysis instruments. However, challenges arise because environmental factors such as vibration negatively affect their performance. An active vibration isolation system (AVIS) is one of the most recent solutions for that, but the high degree-of-freedom (DoF) nature results in it strongly suffering from unwanted interactions. Hence, in this paper, a robust decoupling controller is designed to handle the mentioned disadvantages. The system model is first presented, followed by the proposed decoupling techniques, and then, a feedback controller is designed by applying the mixed-sensitivity <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>H</mi></mrow><mrow><mo>∞</mo></mrow></msub></mrow></semantics></math></inline-formula> control framework. Experimental studies are conducted to investigate the effectiveness of the proposed AVIS and compare it with other systems, namely, a passive vibration isolation system, a proportional–derivative (PD)-controlled AVIS, and a robust controlled AVIS. The robustness and decoupling performance of the proposed controller are guaranteed by suppressing external vibrations and isolating interactions, and, therefore, stabilizing the system.
Daniel T. Cassidy, Philippe Pagnod-Rossiaux, Merwan Mokhtari
Notes on fits of analytic estimations, 2D finite element method (FEM), and 3D FEM simulations to measurements of the cathodoluminescence (CL) and to the degree of polarization (DOP) of the CL from the top surface of a <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>(</mo><mn>100</mn><mo>)</mo></mrow></semantics></math></inline-formula> GaAs substrate with a 6.22 <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi mathvariant="sans-serif">μ</mi></semantics></math></inline-formula>m wide SiN stripe are presented. Three interesting features are found in the DOP of CL data. Presumably these features are noticeable owing to the spatial resolution of the CL measurement system. Comparisons of both strain and spatial resolutions obtained by CL and photoluminescence (PL) systems are presented. The width of the central feature in the measured DOP is less than the width of the SiN, as measured from the CL. This suggests horizontal cracks or de-laminations into each side of the SiN of about 0.7 <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi mathvariant="sans-serif">μ</mi></semantics></math></inline-formula>m. In addition, it appears that deformed regions of widths of ≈1.5 <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi mathvariant="sans-serif">μ</mi></semantics></math></inline-formula>m and adjacent to the SiN must exist to explain some of the features.
In this study, we defined a kind of Fourier expansion of set-valued square-integrable functions. In fact, we have seen that the classical Fourier basis also constitutes a basis for the Hilbert quasilinear space <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>L</mi><mn>2</mn></msub><mrow><mo>(</mo><mfenced separators="" open="[" close="]"><mo>−</mo><mi>π</mi><mo>,</mo><mi>π</mi></mfenced><mo>,</mo><mo>Ω</mo><mrow><mo>(</mo><mi mathvariant="double-struck">C</mi><mo>)</mo></mrow><mo>)</mo></mrow></mrow></semantics></math></inline-formula> of <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>Ω</mo><mo>(</mo><mi mathvariant="double-struck">C</mi><mo>)</mo></mrow></semantics></math></inline-formula>-valued square-integrable functions, where <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>Ω</mo><mo>(</mo><mi mathvariant="double-struck">C</mi><mo>)</mo></mrow></semantics></math></inline-formula> is the class of all compact subsets of complex numbers. Furthermore, we defined the quasi-Paley–Wiener space, <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>Q</mi><mi>P</mi><mi>W</mi></mrow></semantics></math></inline-formula>, using the Fourier transform defined for set-valued functions and thus we showed that the sequence <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mfenced separators="" open="{" close="}"><mi>s</mi><mi>i</mi><mi>n</mi><mi>c</mi><mfenced separators="" open="(" close=")"><mo>.</mo><mo>−</mo><mi>k</mi></mfenced></mfenced><mrow><mi>k</mi><mo>∈</mo><mi mathvariant="double-struck">Z</mi></mrow></msub></semantics></math></inline-formula> form also a basis for <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>Q</mi><mi>P</mi><mi>W</mi></mrow></semantics></math></inline-formula>. We call this result Shannon’s sampling theorem for set-valued functions. Finally, we gave an application based on this theorem.
In this paper, by introducing an isomorphism from the Mihailova subgroup of <inline-formula><math display="inline"><semantics><mrow><msub><mi>F</mi><mn>2</mn></msub><mo>×</mo><msub><mi>F</mi><mn>2</mn></msub></mrow></semantics></math></inline-formula> to the Mihailova subgroups of a braid group, we give an explicit presentation of Mihailova subgroups of a braid group. Hence, in a braid group, there are some Mihailova subgroups experiencing unsolvable subgroup membership problem. Based on this, we propose a post-quantum signature scheme of the Wang–Hu scheme, and we show that the signature scheme is free of quantum computational attack.
François Peyraut, Frédéric Holweck, Stéphane Guérin
We investigate the problem of population transfer in a two-states system driven by an external electromagnetic field featuring a few cycles, until the extreme limit of two or one cycle. Taking the physical constraint of zero-area total field into account, we determine strategies leading to ultrahigh-fidelity population transfer despite the failure of the rotating wave approximation. We specifically implement adiabatic passage based on adiabatic Floquet theory for a number of cycles as low as 2.5 cycles, finding and making the dynamics follow an adiabatic trajectory connecting the initial and targeted states. Nonadiabatic strategies with shaped or chirped pulses, extending the <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>π</mi></semantics></math></inline-formula>-pulse regime to two- or single-cycle pulses, are also derived.
Probabilistic databases (PDBs) model uncertainty in data in a quantitative
way. In the established formal framework, probabilistic (relational) databases
are finite probability spaces over relational database instances. This
finiteness can clash with intuitive query behavior (Ceylan et al., KR 2016),
and with application scenarios that are better modeled by continuous
probability distributions (Dalvi et al., CACM 2009).
We formally introduced infinite PDBs in (Grohe and Lindner, PODS 2019) with a
primary focus on countably infinite spaces. However, an extension beyond
countable probability spaces raises nontrivial foundational issues concerned
with the measurability of events and queries and ultimately with the question
whether queries have a well-defined semantics.
We argue that finite point processes are an appropriate model from
probability theory for dealing with general probabilistic databases. This
allows us to construct suitable (uncountable) probability spaces of database
instances in a systematic way. Our main technical results are measurability
statements for relational algebra queries as well as aggregate queries and
Datalog queries.
Object recognition, as one of the most fundamental and challenging problems in high-resolution remote sensing image interpretation, has received increasing attention in recent years. However, most conventional object recognition pipelines aim to recognize instances with bounding boxes in a supervised learning strategy, which require intensive and manual labor for instance annotation creation. In this paper, we propose a weakly supervised learning method to alleviate this problem. The core idea of our method is to recognize multiple objects in an image using only image-level semantic labels and indicate the recognized objects with location points instead of box extent. Specifically, a deep convolutional neural network is first trained to perform semantic scene classification, of which the result is employed for the categorical determination of objects in an image. Then, by back-propagating the categorical feature from the fully connected layer to the deep convolutional layer, the categorical and spatial information of an image are combined to obtain an object discriminative localization map, which can effectively indicate the salient regions of objects. Next, a dynamic updating method of local response extremum is proposed to further determine the locations of objects in an image. Finally, extensive experiments are conducted to localize aircraft and oiltanks in remote sensing images based on different convolutional neural networks. Experimental results show that the proposed method outperforms the-state-of-the-art methods, achieving the precision, recall, and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>F</mi><mn>1</mn></msub></semantics></math></inline-formula>-score at 94.50%, 88.79%, and 91.56% for aircraft localization and 89.12%, 83.04%, and 85.97% for oiltank localization, respectively. We hope that our work could serve as a basic reference for remote sensing object localization via a weakly supervised strategy and provide new opportunities for further research.
Donato Fontanarosa, Maria Grazia De Giorgi, Antonio Ficarella
The present work investigates the impact of steady micro-jet blowing on the performance of a planar micro-nozzle designed for both liquid micro-thrusters and nitrogen cold-gas micro-resistojets. Two micro-injectors have been placed into the divergent region along the sidewalls, injecting a secondary flow of propellant perpendicularly to the wall where they have been located. The micro-jet actuator configuration is characterized by the dimensionless momentum coefficient <i>c<sub>μ</sub></i>. The best performance improvement is retrieved at the maximum <i>c</i><i><sub>μ</sub></i> for both water vapor (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="sans-serif">Δ</mi><msub><mo>%</mo><mrow><mstyle mathvariant="bold" mathsize="normal"><mi>T</mi></mstyle><mo>,</mo><mstyle mathvariant="bold" mathsize="normal"><mi>j</mi><mi>e</mi><mi>t</mi></mstyle></mrow></msub></mrow></semantics></math></inline-formula> = +22.6% and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="sans-serif">Δ</mi><msub><mo>%</mo><mstyle mathvariant="bold-italic"><mrow><mi>I</mi><mi>s</mi><mi>p</mi><mo>,</mo><mi>T</mi><mi>j</mi><mi>e</mi><mi>t</mi></mrow></mstyle></msub></mrow></semantics></math></inline-formula> = +2.9% at <i>c</i><i><sub>μ</sub></i> = 0.168) and nitrogen gaseous flows (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="sans-serif">Δ</mi><msub><mo>%</mo><mrow><mstyle mathvariant="bold" mathsize="normal"><mi>T</mi></mstyle><mo>,</mo><mstyle mathvariant="bold" mathsize="normal"><mi>j</mi><mi>e</mi><mi>t</mi></mstyle></mrow></msub></mrow></semantics></math></inline-formula> = +36.1% and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="sans-serif">Δ</mi><msub><mo>%</mo><mstyle mathvariant="bold-italic"><mrow><mi>I</mi><mi>s</mi><mi>p</mi><mo>,</mo><mi>T</mi><mi>j</mi><mi>e</mi><mi>t</mi></mrow></mstyle></msub></mrow></semantics></math></inline-formula> = +9.1% at <i>c</i><i><sub>μ</sub></i> = 0.297). The fields of the Mach number and the Schlieren computations, in combination with the streamline visualization, reveal the formation of two vortical structures in the proximity of secondary jets, which energize the core flow and enhance the expansion process downstream secondary jets. The compressible momentum thickness along the width-wise direction <i>θ<sub>xy</sub></i> in presence of secondary injection reduces as a function of <i>c<sub>μ</sub></i>. In particular, it becomes smaller than the one computed for the baseline configuration at <i>c<sub>μ</sub></i> > 0.1, decreasing up to about and -57% for the water vapor flow at <i>c<sub>μ</sub></i> = 0.168, and -64% for the nitrogen gaseous flow at <i>c<sub>μ</sub></i> = 0.297.
BackgroundThe semantic interoperability of health care information has been a critical challenge in medical informatics and has influenced the integration, sharing, analysis, and use of medical big data. International standard organizations have developed standards, approaches, and models to improve and implement semantic interoperability. The openEHR approach—one of the standout semantic interoperability approaches—has been implemented worldwide to improve semantic interoperability based on reused archetypes.
ObjectiveThis study aimed to verify the feasibility of implementing semantic interoperability in different countries by comparing the openEHR-based information models of 2 acute coronary syndrome (ACS) registries from China and New Zealand.
MethodsA semantic archetype comparison method was proposed to determine the semantics reuse degree of reused archetypes in 2 ACS-related clinical registries from 2 countries. This method involved (1) determining the scope of reused archetypes; (2) identifying corresponding data items within corresponding archetypes; (3) comparing the semantics of corresponding data items; and (4) calculating the number of mappings in corresponding data items and analyzing results.
ResultsAmong the related archetypes in the two ACS-related, openEHR-based clinical registries from China and New Zealand, there were 8 pairs of reusable archetypes, which included 89 pairs of corresponding data items and 120 noncorresponding data items. Of the 89 corresponding data item pairs, 87 pairs (98%) were mappable and therefore supported semantic interoperability, and 71 pairs (80%) were labeled as “direct mapping” data items. Of the 120 noncorresponding data items, 114 (95%) data items were generated via archetype evolution, and 6 (5%) data items were generated via archetype localization.
ConclusionsThe results of the semantic comparison between the two ACS-related clinical registries prove the feasibility of establishing the semantic interoperability of health care data from different countries based on the openEHR approach. Archetype reuse provides data on the degree to which semantic interoperability exists when using the openEHR approach. Although the openEHR community has effectively promoted archetype reuse and semantic interoperability by providing archetype modeling methods, tools, model repositories, and archetype design patterns, the uncontrolled evolution of archetypes and inconsistent localization have resulted in major challenges for achieving higher levels of semantic interoperability.
Computer applications to medicine. Medical informatics
The article questions if human speech communication (SC) involves a transfer of information. The information functioning in speech communication is dwelled upon in the information and systemic activity approaches. The informational approach adequately explains only the direct method of information transfer, while the systemic activity approach is relevant for the sign-mediated speech communication typical for human interaction. The more heuristic thesis is that the perception of the chain of linguistic sign bodies produced in the intersubjective space only starts the construction of the perceived speech message content by the recipient. The completeness of the constructed speech message content depends entirely on the recipient, who has the optimal common consciousness with the speaker. The purpose of speech messages is not the actual construction of the content by the recipient, but the development of the message personal meaning. In human speech communication, the communicants do not transmit information, but use verbal signs bodies to actualize images of consciousness which are developed within a single ethnic culture and therefore are common for them. The incentive for the common consciousness development by the communicants is their participation in joint activities that ensure their earthly existence.
Language. Linguistic theory. Comparative grammar, Semantics
Hüseyin Işık, Vahid Parvaneh, Babak Mohammadi
et al.
In this paper, we introduce generalized Wardowski type quasi-contractions called <inline-formula> <math display="inline"> <semantics> <mi>α</mi> </semantics> </math> </inline-formula>-<inline-formula> <math display="inline"> <semantics> <mrow> <mo>(</mo> <mi>φ</mi> <mo>,</mo> <mi mathvariant="sans-serif">Ω</mi> <mo>)</mo> </mrow> </semantics> </math> </inline-formula>-contractions for a pair of multi-valued mappings and prove the existence of the common fixed point for such mappings. An illustrative example and an application are given to show the usability of our results.
This paper describes a non-invasive, automatic, and robust method for calibrating a scalable RGB-D sensor network based on retroreflective ArUco markers and the iterative closest point (ICP) scheme. We demonstrate the system by calibrating a sensor network comprised of six sensor nodes positioned in a relatively large industrial robot cell with an approximate size of <inline-formula> <math display="inline"> <semantics> <mrow> <mn>10</mn> <mo> </mo> <mi mathvariant="normal">m</mi> <mo>×</mo> <mn>10</mn> <mo> </mo> <mi mathvariant="normal">m</mi> <mo>×</mo> <mn>4</mn> </mrow> </semantics> </math> </inline-formula> <inline-formula> <math display="inline"> <semantics> <mi mathvariant="normal">m</mi> </semantics> </math> </inline-formula>. Here, the automatic calibration achieved an average Euclidean error of 3 <inline-formula> <math display="inline"> <semantics> <mi mathvariant="normal">c</mi> </semantics> </math> </inline-formula><inline-formula> <math display="inline"> <semantics> <mi mathvariant="normal">m</mi> </semantics> </math> </inline-formula> at distances up to <inline-formula> <math display="inline"> <semantics> <mrow> <mn>9.45</mn> </mrow> </semantics> </math> </inline-formula> <inline-formula> <math display="inline"> <semantics> <mi mathvariant="normal">m</mi> </semantics> </math> </inline-formula>. To achieve robustness, we apply several innovative techniques: Firstly, we mitigate the ambiguity problem that occurs when detecting a marker at long range or low resolution by comparing the camera projection with depth data. Secondly, we use retroreflective fiducial markers in the RGB-D calibration for improved accuracy and detectability. Finally, the repeating ICP refinement uses an exact region of interest such that we employ the precise depth measurements of the retroreflective surfaces only. The complete calibration software and a recorded dataset are publically available and open source.