Hasil untuk "Semantics"

Ruiqi Zheng, Jinli Cao, Jiao Yin et al.

Cloud-device collaborative recommendation partitions computation across the cloud and user devices: the cloud provides semantic user modeling, while the device leverages recent interactions and cloud semantic signals for privacy-preserving, responsive reranking. With large language models (LLMs) on the cloud, semantic user representations can improve sequential recommendation by capturing high-level intent. However, regenerating such representations via cloud LLM inference for every request is often infeasible at real-world scale. As a result, on-device reranking commonly reuses a cached cloud semantic user embedding across requests. We empirically identify a cloud semantic staleness effect: reused embeddings become less aligned with the user's latest interactions, leading to measurable ranking degradation. Most existing LLM-enabled cloud-device recommenders are typically designed around on-demand cloud semantics, either by assuming low-latency cloud LLM access or by regenerating semantic embeddings per request. When per-request regeneration is infeasible and cached semantics must be reused, two technical challenges arise: (1) deciding when cached cloud semantics remain useful for on-device reranking, and (2) maintaining ranking quality when the cloud LLM cannot be invoked and only cached semantics are available. To address this gap, we introduce the Semantic Calibration for LLM-enabled Cloud-Device Recommendation (SCaLRec). First, it estimates the reliability of cached semantics under the user's latest interactions. Second, an on-device semantic calibration module is proposed to adjusts the cached semantic embedding on-device using up-to-date interaction evidence, without per-request cloud LLM involvement. Experiments on real-world datasets show that SCaLRec consistently improves recommendation performance over strong baselines under cloud semantic staleness.

Orlova Anastasia

This article examines semantic shifts in psychological concepts across scientific and popular media discourse using methods of distributional semantics applied to Russian-language corpora. Two corpora were compiled: a scientific corpus of approximately 300 research articles from the journals Psychology. Journal of the Higher School of Economics and Vestnik of Saint Petersburg University. Psychology (767,543 tokens) and a popular science corpus consisting of texts from the online psychology platforms Yasno and Chistye kogntsii (1,199,150 tokens). After preprocessing (OCR recognition, lemmatization, removal of stop words and non-informative characters), the corpora were analyzed through frequency analysis, clustering, and the identification of semantic associations. The results reveal significant differences in vocabulary and conceptual framing between the two discourse types: scientific texts emphasize methodological and clinical terminology, while popular science materials foreground everyday experience and therapeutic practice. A comparison of semantic associations for key concepts such as burnout and depression shows that scientific discourse links these terms to psychological resources, symptomatology, and diagnostic constructs, whereas popular science discourse frames them through personal narratives, emotions, and everyday situations. These findings demonstrate a clear shift from precise professional terminology toward more generalized and experiential meanings in popular media discourse and confirm the effectiveness of distributional semantics methods for identifying semantic transformations of psychological concepts across different communicative contexts.

Seokhyeon Park, Soohyun Lee, Eugene Choi et al.

While generative AI enables high-fidelity UI generation from text prompts, users struggle to articulate design intent and evaluate or refine results-creating gulfs of execution and evaluation. To understand the information needed for UI generation, we conducted a thematic analysis of UI prompting guidelines, identifying key design semantics and discovering that they are hierarchical and interdependent. Leveraging these findings, we developed a system that enables users to specify semantics, visualize relationships, and extract how semantics are reflected in generated UIs. By making semantics serve as an intermediate representation between human intent and AI output, our system bridges both gulfs by making requirements explicit and outcomes interpretable. A comparative user study suggests that our approach enhances users' perceived control over intent expression and outcome interpretation, and facilitates more predictable iterative refinement. Our work demonstrates how explicit semantic representation enables systematic and explainable exploration of design possibilities in AI-driven UI design.

Jiahong Tu, Wei Zhao, Pengyu Zhu et al.

Polyester yarn bundle geogrids are widely used materials in flexible retaining structures due to their high toughness and high-strength mechanical properties. To investigate the mechanical characteristics and the interfacial mechanical properties of these geogrids, a series of pull-out tests were conducted under different pull-out rates and filling water contents. Based on the test results, a DEM-FDM coupled numerical model for pull-out behavior was established to analyze the pull-out deformation behavior of the geogrids. Combined with the theoretical analysis of the load-bearing characteristics of the geogrids, the reinforcement mechanism of polyester yarn bundle geogrids was revealed. The results show that there exists a critical pull-out rate of 1 mm/min that maximizes the pull-out resistance; the interface friction angle decreases with an increase in pull-out rate, while the interface cohesion shows an opposite trend. The filling water content presents a more significant weakening effect on the soil–geogrid interface strength under low stress, resulting in a strain-softening type of pull-out curve. Unlike fine-ribbed plastic geogrids, the sliding frictional resistance of polyester yarn bundle geogrids accounts for 80% of the total pull-out resistance during the pull-out process. The mechanical interlocking force, which arises from the bulges on the mid-section of transverse ribs and the downward bending of longitudinal rib edges, is subject to dynamic changes in the course of the pull-out process. The geogrid exhibits overall shear failure under low normal stress (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>σ</mi></mrow><mrow><mi>n</mi></mrow></msub><mo><</mo></mrow></semantics></math></inline-formula> 200 kPa) and penetration shear failure under high normal stress (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mrow><mi>σ</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>≥</mo></mrow></semantics></math></inline-formula> 200 kPa). In practical engineering installation, polyester yarn bundle geogrids should be placed as parallel as possible to maximize the frictional resistance with filled soil and should take care of the geogrid joints for enhanced durability of the geogrids.

Antonio Piccolomini d'Aragona

I deal with two approaches to proof-theoretic semantics: one based on argument structures and justifications, which I call reducibility semantics, and one based on consequence among (sets of) formulas over atomic bases, called base semantics. The latter splits in turn into a standard reading, and a variant of it put forward by Sandqvist. I prove some results which, when suitable conditions are met, permit one to shift from one approach to the other, and I draw some of the consequences of these results relative to the issue of completeness of (recursive) logical systems with respect to proof-theoretic notions of validity. This will lead me to focus on a notion of base-completeness, which I will discuss with reference to known completeness results for intuitionistic logic. The general interest of the proposed approach stems from the fact that reducibility semantics can be understood as a labelling of base semantics with proof-objects typed on (sets of) formulas for which a base semantics consequence relation holds, and which witness this very fact. Vice versa, base semantics can be understood as a type-abstraction of a reducibility semantics consequence relation obtained by removing the witness of the fact that this relation holds, and by just focusing on the input and output type of the relevant proof-object.

Joohyung Lee, Yi Wang

We define a stable model semantics for fuzzy propositional formulas, which generalizes both fuzzy propositional logic and the stable model semantics of classical propositional formulas. The syntax of the language is the same as the syntax of fuzzy propositional logic, but its semantics distinguishes stable models from non-stable models. The generality of the language allows for highly configurable nonmonotonic reasoning for dynamic domains involving graded truth degrees. We show that several properties of Boolean stable models are naturally extended to this many-valued setting, and discuss how it is related to other approaches to combining fuzzy logic and the stable model semantics.

Sergey Zharikov, Anatoly Miroshnichenko, Inna Reva et al.

We report the recent results of a long-term spectroscopic and photometric monitoring of IRAS 17449+2320, a member of the least studied group of objects with the B[e] phenomenon called FS CMa-type objects. The main hypothesis for explaining the strong emission-line spectra and infrared excesses of these objects assumes an ongoing or past mass transfer between the components in binary systems. The object is the only star with a gaseous and dusty envelope, where a strong and variable magnetic field (5.5–7.2 kG) was found through the splitting of some spectral lines. Additionally, we discovered the regular appearance of a red-shifted absorption component in spectral lines of neutral hydrogen, helium, and oxygen as well as one of ionized silicon with a period of 36.13 ± 0.20 days. We show that the magnetic field strength also followed this period. The process was accompanied by increasing emission component strengths for the hydrogen lines as well as the helium and metallic absorption lines. We refined the fundamental parameters of the optical counterpart of IRAS 17449+2320 (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi mathvariant="normal">T</mi><mi>eff</mi></msub><mo>=</mo><mn>9800</mn><mo>±</mo><mn>300</mn></mrow></semantics></math></inline-formula> K, log L/<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi mathvariant="normal">L</mi><mo>⊙</mo></msub><mo>=</mo><mn>1.86</mn><mo>±</mo><mn>0.06</mn></mrow></semantics></math></inline-formula>, <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>v</mi><mo form="prefix">sin</mo><mi>i</mi><mo>=</mo><mn>9</mn><mo>±</mo><mn>2</mn></mrow></semantics></math></inline-formula> km s⁻¹) and concluded that the star was slightly metal-deficient and viewed nearly pole-on. No signs of a secondary component were found. Possible interpretations of the observed phenomena are suggested, and some earlier findings about the object’s nature are revised.

Hongfu Chen, Shubin Yan, Yi Sun et al.

Based on the theory of optical sensing, we propose a high-precision plasmonic refractive index nanosensor, which consists of a symmetric rectangular waveguide and a circular ring containing a rectangular cavity. The designed novel tunable micro-resonant circular cavity filter based on surface plasmon excitations is able to confine light to sub-wavelength dimensions. The data show that different geometrical factors have different effects on sensing, with the geometry of the rectangular cavity and the radius of the circular ring being the key factors affecting the Fano resonance. Furthermore, the resonance bifurcation enables the structure to achieve a tunable dual Fano resonance system. The structure was tuned to obtain optimal sensitivity (S) and figure of merit values up to 3066 nm/RIU and 78. The designed structure has excellent sensing performance with sensitivities of 0.4767 nm·(mg/d<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msup><mrow><mi mathvariant="normal">L</mi></mrow><mrow><mo>−</mo><mn>1</mn></mrow></msup></mrow></semantics></math></inline-formula>) and 0.6 nm·(mg/d<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msup><mrow><mi mathvariant="normal">L</mi></mrow><mrow><mo>−</mo><mn>1</mn></mrow></msup></mrow></semantics></math></inline-formula>) in detecting Na⁺ and K⁺ concentrations in the electrolyte solution, respectively, and can be easily achieved by the spectrometer. The wavelength accuracy of 0.001 nm can be easily achieved by a spectrum analyzer, which has a broad application prospect in the field of optical integration.

Jesse Heyninck

Choice constructs are an important part of the language of logic programming, yet the study of their semantics has been a challenging task. So far, only two-valued semantics have been studied, and the different proposals for such semantics have not been compared in a principled way. In this paper, an operator-based framework allow for the definition and comparison of different semantics in a principled way is proposed.

Yuqi Sun

Let <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>X</mi><mo>,</mo><mi>Y</mi></mrow></semantics></math></inline-formula> be two Banach spaces and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>f</mi><mo>:</mo><mi>X</mi><mo>→</mo><mi>Y</mi></mrow></semantics></math></inline-formula> be a standard coarse isometry. In this paper, we first show a sufficient and necessary condition for the coarse left-inverse operator of general Banach spaces to admit a linearly isometric right inverse. Furthermore, by using the well-known simultaneous extension operator, we obtain an asymptotical stability result when <i>Y</i> is a space of continuous functions. In addition, we also prove that every coarse left-inverse operator does admit a linear isometric right inverse without other assumptions when <i>Y</i> is a <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>L</mi><mi>p</mi></msub><mrow><mo>(</mo><mn>1</mn><mo><</mo><mi>p</mi><mo><</mo><mo>∞</mo><mo>)</mo></mrow></mrow></semantics></math></inline-formula> space, or both <i>X</i> and <i>Y</i> are finite dimensional spaces of the same dimension. Making use of the results mentioned above, we generalize several results of isometric embeddings and give a stability result of coarse isometries between Banach spaces.

Guillaume Baudart, Louis Mandel, Christine Tasson

Synchronous languages are now a standard industry tool for critical embedded systems. Designers write high-level specifications by composing streams of values using block diagrams. These languages have been extended with Bayesian reasoning to program state-space models which compute a stream of distributions given a stream of observations. However, the semantics of probabilistic models is only defined for scheduled equations -- a significant limitation compared to dataflow synchronous languages and block diagrams which do not require any ordering. In this paper we propose two schedule agnostic semantics for a probabilistic synchronous language. The key idea is to interpret probabilistic expressions as a stream of un-normalized density functions which maps random variable values to a result and positive score. The co-iterative semantics interprets programs as state machines and equations are computed using a fixpoint operator. The relational semantics directly manipulates streams and is thus a better fit to reason about program equivalence. We use the relational semantics to prove the correctness of a program transformation required to run an optimized inference algorithm for state-space models with constant parameters.

Jonas Forster, Lutz Schröder, Paul Wild et al.

Coalgebra, as the abstract study of state-based systems, comes naturally equipped with a notion of behavioural equivalence that identifies states exhibiting the same behaviour. In many cases, however, this equivalence is finer than the intended semantics. Particularly in automata theory, behavioural equivalence of nondeterministic automata is essentially bisimilarity, and thus does not coincide with language equivalence. Language equivalence can be captured as behavioural equivalence on the determinization, which is obtained via the standard powerset construction. This construction can be lifted to coalgebraic generality, assuming a so-called Eilenberg-Moore distributive law between the functor termining the type of accepted structure (e.g.\ word languages) and a monad capturing the branching type (e.g.\ nondeterministic, weighted, probabilistic). Eilenberg-Moore-style coalgebraic semantics in this sense has been shown to be essentially subsumed by the more general framework of graded semantics, which is centrally based on graded monads. Graded semantics comes with a range of generic results, in particular regarding invariance and, under suitable conditions, expressiveness of dedicated modal logics for a given semantics; notably, these logics are evaluated on the original state space. We show that the instantiation of such graded logics to the case of Eilenberg-Moore-style semantics works extremely smoothly, and yields expressive modal logics in essentially all cases of interest. We additionally parametrize the framework over a quantale of truth values, thus in particular covering both the two-valued notions of equivalence and quantitative ones, i.e. behavioural distances.

Shichuan Xue, Yizhi Wang, Yong Liu et al.

Quantum process tomography is a fundamental and critical benchmarking and certification tool that is capable of fully characterizing an unknown quantum process. Standard quantum process tomography suffers from an exponentially scaling number of measurements and complicated data post-processing due to the curse of dimensionality. On the other hand, non-unitary operators are more realistic cases. In this work, we put forward a variational quantum process tomography method based on the supervised quantum machine learning framework. It approximates the unknown non-unitary quantum process utilizing a relatively shallow depth parametric quantum circuit and fewer input states. Numerically, we verified our method by reconstructing the non-unitary quantum mappings up to eight qubits in two cases: the weighted sum of the randomly generated quantum circuits and the imaginary time evolution of the Heisenberg <i>XXZ</i> spin chain Hamiltonian. Results show that those quantum processes could be reconstructed with high fidelities (>99%) and shallow depth parametric quantum circuits (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>d</mi><mo>≤</mo><mn>8</mn></mrow></semantics></math></inline-formula>), while the number of input states required is at least two orders of magnitude less than the demands of the standard quantum process tomography. Our work shows the potential of the variational quantum process tomography method in characterizing non-unitary operators.

Abdullah Alotaibi

In this paper, we construct the bivariate Szász–Jakimovski–Leviatan-type operators in Dunkl form using the unbounded sequences <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>α</mi><mi>n</mi></msub></semantics></math></inline-formula>, <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>β</mi><mi>m</mi></msub></semantics></math></inline-formula> and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>ξ</mi><mi>m</mi></msub></semantics></math></inline-formula> of positive numbers. Then, we obtain the rate of convergence in terms of the weighted modulus of continuity of two variables and weighted approximation theorems for our operators. Moreover, we provide the degree of convergence with the help of bivariate Lipschitz-maximal functions and obtain the direct theorem.

Nir Oren, Bruno Yun, Assaf Libman et al.

Gradual semantics within abstract argumentation associate a numeric score with every argument in a system, which represents the level of acceptability of this argument, and from which a preference ordering over arguments can be derived. While some semantics operate over standard argumentation frameworks, many utilise a weighted framework, where a numeric initial weight is associated with each argument. Recent work has examined the inverse problem within gradual semantics. Rather than determining a preference ordering given an argumentation framework and a semantics, the inverse problem takes an argumentation framework, a gradual semantics, and a preference ordering as inputs, and identifies what weights are needed to over arguments in the framework to obtain the desired preference ordering. Existing work has attacked the inverse problem numerically, using a root finding algorithm (the bisection method) to identify appropriate initial weights. In this paper we demonstrate that for a class of gradual semantics, an analytical approach can be used to solve the inverse problem. Unlike the current state-of-the-art, such an analytic approach can rapidly find a solution, and is guaranteed to do so. In obtaining this result, we are able to prove several important properties which previous work had posed as conjectures.

Feng Xu, Yi Lu, Qunhai Huo et al.

Microgrids have a strong ability to generate local power and consume renewable energy, which can solve the problems of power supply shortages and greenhouse gas emissions created in the process of social development. The honeycombed active distribution network (HADN) can flexibly, independently, and interconnectedly operate microgrids through power exchange stations, so appropriate HADN dispatch can produce increased low-carbon benefits than general microgrids. In this study, we first designed a model for optimizing HADN with the lowest carbon emission as the target, then we introduced the concept of carbon emission flow into the optimization process to determine the carbon emission level of each element. Finally, we illustrated and verified the proposed model by a HADN composed of three microgrids. The optimization results of the case study showed that by scheduling the DGs within the microgrids, the total carbon emissions of the system were reduced from 123,328.1 to 117,688 kg CO<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mrow></mrow><mn>2</mn></msub></semantics></math></inline-formula>; the system with a HADN structure was able to produce only 110,958 kg CO<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mrow></mrow><mn>2</mn></msub></semantics></math></inline-formula> and effectively reduce carbon emissions by 10%, which proved that HADN can be scheduled with high flexibility and provides increased low-carbon performance through the proposed optimization dispatch method.

Viktor D. Stasenko, Alexander A. Kirillov, Konstantin M. Belotsky

The PBH clusters can be sources of gravitational waves, and the merger rate depends on the spatial distribution of PBHs in the cluster which changes over time. It is well known that gravitational collisional systems experience the core collapse that leads to significant increase of the central density and shrinking of the core. After core collapse, the cluster expands almost self-similarly (i.e., density profile extends in size without changing its shape). These dynamic processes affect the merger rate of PBHs. In this paper, the dynamics of the PBH cluster is considered using the Fokker–Planck equation. We calculate the merger rate of PBHs on cosmic time scales and show that its time dependence has a unique signature. Namely, it grows by about an order of magnitude at the moment of core collapse which depends on the characteristics of the cluster, and then decreases according to the dependence <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi mathvariant="script">R</mi><mo>∝</mo><msup><mi>t</mi><mrow><mo>−</mo><mn>1.48</mn></mrow></msup></mrow></semantics></math></inline-formula>. It was obtained for monochromatic and power-law PBH mass distributions with some fixed parameters. Obtained results can be used to test the model of the PBH clusters via observation of gravitational waves at high redshift.

Anass Bayaga, P Nzuza

The current research aims at examining challenges associated with numerical cognition in early years in South Africa. Guided by cognitive learning theory, the current investigation was informed by continuous quest in South Africa. The aim was to respond to unresolved challenges associated with early numerical cognition in terms of numerical cognition through semantics and textual misunderstanding in early numerical problems and concepts. Using survey design, a sample of 80 learners was chosen and tested through descriptive statistics. Data was collected using semi-structured questionnaires. It was revealed that the challenges associated with numerical cognition in early numerical problems and concepts are counting, reading numbers that contain more than one digit, difficulties with copying numbers, mathematical signs confusion, and challenges associated with manipulatives. By implication, the study highlighted that there is a severe lack of numerical literacy and competency among learners. Implying too that teachers need to pay particular attention to both semantics and textual misunderstanding

Fabrizio Romano Genovese, Jelle Herold, Fosco Loregian et al.

We show how a particular variety of hierarchical nets, where the firing of a transition in the parent net must correspond to an execution in some child net, can be modelled utilizing a functorial semantics from a free category -- representing the parent net -- to the category of sets and spans between them. This semantics can be internalized via Grothendieck construction, resulting in the category of executions of a Petri net representing the semantics of the overall hierarchical net. We conclude the paper by giving an engineering-oriented overview of how our model of hierarchical nets can be implemented in a transaction-based smart contract environment.

Gianvincenzo Alfano, Sergio Greco, Francesco Parisi et al.

Recently there has been an increasing interest in frameworks extending Dung's abstract Argumentation Framework (AF). Popular extensions include bipolar AFs and AFs with recursive attacks and necessary supports. Although the relationships between AF semantics and Partial Stable Models (PSMs) of logic programs has been deeply investigated, this is not the case for more general frameworks extending AF. In this paper we explore the relationships between AF-based frameworks and PSMs. We show that every AF-based framework $Δ$ can be translated into a logic program $P_Δ$ so that the extensions prescribed by different semantics of $Δ$ coincide with subsets of the PSMs of $P_Δ$. We provide a logic programming approach that characterizes, in an elegant and uniform way, the semantics of several AF-based frameworks. This result allows also to define the semantics for new AF-based frameworks, such as AFs with recursive attacks and recursive deductive supports. Under consideration for publication in Theory and Practice of Logic Programming.