There is a widespread assumption that the universe in general, and the Earth's biosphere in particular, is becoming more complex over time. This paper formulates this assumption as a macroscopic law, the law of increasing complexity, for a system over a finite time span. It hypothesizes that this macroscopic law emerges in certain non-equilibrium systems with abundant free energy flows, such as the observable universe and the Earth's biosphere. We distinguish between two types of complexity: disorganized and organized. The complexity associated with this assumption is organized complexity. To formulate this law, we employ a quantitative definition of organized complexity as applied to probability distributions. We represent any object of complexity as the source of its observed value, which is expressed as a probability distribution; this enables a unified treatment of diverse objects. This formulation necessitates the use of observation systems to represent these objects. We introduce an order relation between these observation systems to demonstrate that the complexity of an object possesses a generic property, one that does not depend on any specific observation system. This paper develops a novel methodology for this macroscopic law, which formulates the arrow of time in terms of increasing organized complexity for certain non-equilibrium systems. This contrasts with the second law of thermodynamics, which formulates the arrow of time in terms of increasing disorganized complexity (entropy) for isolated systems. We apply this formulation to the fine-tuning problem: the puzzling observation that the fundamental physical constants appear to be fine-tuned for life on Earth. Our new explanation of the fine-tuning problem posits that these constants are fine-tuned for the emergence of the law of increasing complexity.

We study the arithmetic circuit complexity of threshold secret sharing schemes by characterizing the graph-theoretic properties of arithmetic circuits that compute the shares. Using information inequalities, we prove that any unrestricted arithmetic circuit (with arbitrary gates and unbounded fan-in) computing the shares must satisfy superconcentrator-like connectivity properties. Specifically, when the inputs consist of the secret and $t-1$ random elements, and the outputs are the $n$ shares of a $(t, n)$-threshold secret sharing scheme, the circuit graph must be a $(t, n)$-concentrator; moreover, after removing the secret input, the remaining graph is a $(t-1, n)$-concentrator. Conversely, we show that any graph satisfying these properties can be transformed into a linear arithmetic circuit computing the shares of a threshold secret sharing scheme, assuming a sufficiently large field. As a consequence, we derive upper and lower bounds on the arithmetic circuit complexity of computing the shares in threshold secret sharing schemes.

There is an increasing number of potential biomarkers that could allow for early assessment of treatment response or disease progression. However, measurements of quantitative biomarkers are subject to random variability. Hence, differences of a biomarker in longitudinal measurements do not necessarily represent real change but might be caused by this random measurement variability. Before utilizing a quantitative biomarker in longitudinal studies, it is therefore essential to assess the measurement repeatability. Measurement repeatability obtained from test-retest studies can be quantified by the repeatability coefficient (RC), which is then used in the subsequent longitudinal study to determine if a measured difference represents real change or is within the range of expected random measurement variability. The quality of the point estimate of RC therefore directly governs the assessment quality of the longitudinal study. RC estimation accuracy depends on the case number in the test-retest study, but despite its pivotal role, no comprehensive framework for sample size calculation of test-retest studies exists. To address this issue, we have established such a framework, which allows for flexible sample size calculation of test-retest studies, based upon newly introduced criteria concerning assessment quality in the longitudinal study. This also permits retrospective assessment of prior test-retest studies.

Undoubtedly, social media are brainstormed by a tremendous volume of stories, feedback, reviews, and reactions expressed in various languages and idioms, even though some are factually incorrect. These motifs make assessing such data challenging, time-consuming, and vulnerable to misinterpretation. This paper describes a classification model for movie reviews founded on deep learning approaches. Almost 500KB pairs of balanced data from the IMDb movie review databases are employed to train the model. People's perspectives regarding movies were classified using both the long short-term memory (LSTM) and convolutional neural network (CNN) strategies. According to the findings, the CNN algorithm's prediction accuracy rate would be almost 97.4%. Furthermore, the model trained by LSTM resulted in accuracies of around and applying 99.2% within the Keras library. The model is investigated more by modification of model parameters. According to the outcomes, LTSM outperforms CNN in assessing IMDb movie reviews and is computationally less costly than LSTM.

The main result is that if an Anosov flow in a closed hyperbolic three manifold is not R-covered, then the flow is a quasigeodesic flow. We also prove that if a hyperbolic three manifold supports an Anosov flow, then up to a double cover it supports a quasigeodesic flow. We prove the continuous extension property for the stable and unstable foliations of any Anosov flow in a closed hyperbolic three manifold, and the existence of group invariant Peano curves associated with any such flow.

We compute the homotopy groups of $\mathrm{THH}(\mathrm{ku})$ as a $\mathrm{ku}_\ast$-module using the descent spectral sequence for the map $\mathrm{THH}(\mathrm{ku})\to\mathrm{THH}(\mathrm{ku}/\mathrm{MU})$, which is the motivic spectral sequence for $\mathrm{THH}(\mathrm{ku})$ in the sense of Hahn-Raksit-Wilson. We reduce the computation of homotopy groups to the algebra of the universal formal group law, providing a systematic way to compute THH of quotients of MU. We compute the $E_2$-page of the motivic spectral sequence computing $\mathrm{THH}(\mathrm{ku})$, and we show that it degenerates at the $E_2$-page.

The labeling of point features on a map is a well-studied topic. In a static setting, the goal is to find a non-overlapping label placement for (a subset of) point features. In a dynamic setting, the set of point features and their corresponding labels change, and the labeling has to adapt to such changes. To aid the user in tracking these changes, we can use morphs, here called transitions, to indicate how a labeling changes. Such transitions have not gained much attention yet, and we investigate different types of transitions for labelings of points, most notably consecutive transitions and simultaneous transitions. We give (tight) upper bounds on the number of overlaps that can occur during these transitions. When each label has a non-negative weight associated to it, and each overlap imposes a penalty proportional to the weight of the overlapping labels, we show that it is NP-complete to decide whether the penalty during a simultaneous transition has weight at most $k$. Finally, we consider geotagged data on a map, by labeling points with rectangular or square labels. We developed a prototype implementation to evaluate different transition styles in practice, measuring both number of overlaps and transition duration.

The one-sample log-rank test is the method of choice for single-arm Phase II trials with time-to-event endpoint. It allows to compare the survival of the patients to a reference survival curve that typically represents the expected survival under standard of care. The classical one-sample log-rank test, however, assumes that the reference survival curve is deterministic. This ignores that the reference curve is commonly estimated from historic data and thus prone to statistical error. Ignoring sampling variability of the reference curve results in type I error rate inflation. For that reason, a new one-sample log-rank test is proposed that explicitly accounts for the statistical error made in the process of estimating the reference survival curve. The test statistic and its distributional properties are derived using martingale techniques in the large sample limit. In particular, a sample size formula is provided. Small sample properties regarding type I and type II error rate control are studied by simulation. A case study is conducted to study the influence of several design parameters of a single-armed trial on the inflation of the type I error rate when reference curve sampling variability is ignored.

Time-to-event endpoints show an increasing popularity in phase II cancer trials. The standard statistical tool for such one-armed survival trials is the one-sample log-rank test. Its distributional properties are commonly derived in the large sample limit. It is however known from the literature, that the asymptotical approximations suffer when sample size is small. There have already been several attempts to address this problem. While some approaches do not allow easy power and sample size calculations, others lack a clear theoretical motivation and require further considerations. The problem itself can partly be attributed to the dependence of the compensated counting process and its variance estimator. For this purpose, we suggest a variance estimator which is uncorrelated to the compensated counting process. Moreover, this and other present approaches to variance estimation are covered as special cases by our general framework. For practical application, we provide sample size and power calculations for any approach fitting into this framework. Finally, we use simulations and real world data to study the empirical type I error and power performance of our methodology as compared to standard approaches.

Introducing an interpolation method we derive lower bounds for the spectral gap for Brownian motion on general domains with sticky-reflecting boundary diffusion associated to the first nontrivial eigenvalue for the Laplace operator with corresponding Wentzell-type boundary condition. In the manifold case our proofs involve novel applications of the celebrated Reilly formula.

Heyting-Lewis Logic is the extension of intuitionistic propositional logic with a strict implication connective that satisfies the constructive counterparts of axioms for strict implication provable in classical modal logics. Variants of this logic are surprisingly widespread: they appear as Curry-Howard correspondents of (simple type theory extended with) Haskell-style arrows, in preservativity logic of Heyting arithmetic, in the proof theory of guarded (co)recursion, and in the generalization of intuitionistic epistemic logic. Heyting-Lewis Logic can be interpreted in intuitionistic Kripke frames extended with a binary relation to account for strict implication. We use this semantics to define descriptive frames (generalisations of Esakia spaces), and establish a categorical duality between the algebraic interpretation and the frame semantics. We then adapt a transformation by Wolter and Zakharyaschev to translate Heyting-Lewis Logic to classical modal logic with two unary operators. This allows us to classical results to obtain the finite model property and decidability for a large family of Heyting-Lewis logics.

In this paper, we deal with reversing and extended symmetries of shifts generated by bijective substitutions. We provide equivalent conditions for a permutation on the alphabet to generate a reversing/extended symmetry, and algorithms how to check them. Moreover, we show that, for any finite group $G$ and any subgroup $P$ of the $d$-dimensional hyperoctahedral group, there is a bijective substitution which generates an aperiodic hull with symmetry group $\mathbb{Z}^{d}\times G$ and extended symmetry group $(\mathbb{Z}^{d} \rtimes P)\times G$.

A new fixed (non-adaptive) recursive scheme for multigrid algorithms is introduced. Governed by a positive parameter $κ$ called the cycle counter, this scheme generates a family of multigrid cycles dubbed $κ$-cycles. The well-known $V$-cycle, $F$-cycle, and $W$-cycle are shown to be particular members of this rich $κ$-cycle family, which satisfies the property that the total number of recursive calls in a single cycle is a polynomial of degree $κ$ in the number of levels of the cycle. This broadening of the scope of fixed multigrid cycles is shown to be potentially significant for the solution of some large problems on platforms, such as graphics processing units, where the overhead induced by numerous sequential calls to the coarser levels may be relatively significant. In cases of problems for which the convergence of standard $V$-cycles or $F$-cycles (corresponding to $κ=1$ and $κ=2$, respectively) is particularly slow, and yet the cost of $W$-cycles is very high due to the large number of coarse-level calls (which is exponential in the number of levels), intermediate values of $κ$ may prove to yield significantly faster run-times. This is demonstrated in examples where $κ$-cycles are used for the solution of rotated anisotropic diffusion problems, both as a stand-alone solver and as a preconditioner. Moreover, a simple model is presented for predicting the approximate run-time of the $κ$-cycle, which is useful in pre-selecting an appropriate cycle counter for a given problem on a given platform. Implementing the $κ$-cycle requires making just a small change in the classical multigrid cycle.

Novel multiplexing triple-axis neutron scattering spectrometers yield significant improvements of the common triple-axis instruments. While the planar scattering geometry keeps ensuring compatibility with complex sample environments, a simultaneous detection of scattered neutrons at various angles and energies leads to tremendous improvements in the data acquisition rate. Here we report on the software package MJOLNIR that we have developed to handle the resulting enhancement in data complexity. Using data from the new CAMEA spectrometer of the Swiss Spallation Neutron Source at the Paul Scherrer Institut, we show how the software reduces, visualises and treats observables measured on multiplexing spectrometers. The software package has been generalised to a uniformed framework, allowing for collaborations across multiplexing instruments at different facilities, further facilitating new developments in data treatment, such as fitting routines and modelling of multi-dimensional data.

Let $ X $ be an $ m \times n $ matrix of distinct indeterminates over a field $ K $, where $ m \le n $. Set the polynomial ring $ K[X] := K[X_{ij} : 1 \le i \le m, 1 \le j \le n] $. Let $ 1 \le k < l \le n $ be such that $ l - k + 1 \ge m $. Consider the submatrix $ Y_{kl} $ of consecutive columns of $ X $ from $ k $th column to $ l $th column. Let $ J_{kl} $ be the ideal generated by `diagonal monomials' of all $ m \times m $ submatrices of $ Y_{kl} $, where the diagonal monomial of a square matrix means product of its main diagonal entries. We show that $ J_{k_1 l_1} J_{k_2 l_2} \cdots J_{k_s l_s} $ has a linear free resolution, where $ k_1 \le k_2 \le \cdots \le k_s $ and $ l_1 \le l_2 \le \cdots \le l_s $. This result is a variation of a theorem due to Bruns and Conca. Moreover, our proof is self-contained, elementary and combinatorial.

In this paper topological $K$-group calculations for fiber bundles with structure group $SO(3)$ over tori are carried out to explain why topological insulators have special conducting points on their surface but are bulk insulators. It is shown that these special points are gap-less and conducting for topological reasons and follow from the $K$-group calculations. The existence of gap-less surface points is established with the help of an additional topological property of the $K$-groups which relates them to the index theorem of an operator. The index theorem relates zeros of operators to topology. For the topological insulator the relevant operator is a Dirac operator, that emerges in the problem because the system has strong spin-orbit interactions and time-reversal invariance. Calculating $K$-groups over tori require some special topological tools that are are not widely known. These are explained. We then show that the actual calculation of $K$-groups over tori becomes straightforward once a few topological results are in place. Since condensed matter systems with periodic lattices, are always bundles over tori the procedures described is of general interest.

Recently, Hairer et. al (2012) showed that there exist SDEs with infinitely often differentiable and globally bounded coefficient functions whose solutions fail to be locally Lipschitz continuous in the strong L^p-sense with respect to the initial value for every p \in [1,\infty). In this article we provide sufficient conditions on the coefficient functions of the SDE and on p \in (0,\infty] which ensure local Lipschitz continuity in the strong L^p-sense with respect to the initial value and we establish explicit estimates for the local Lipschitz continuity constants. In particular, we prove local Lipschitz continuity in the initial value for several nonlinear SDEs from the literature such as the stochastic van der Pol oscillator, Brownian dynamics, the Cox-Ingersoll-Ross processes and the Cahn-Hilliard-Cook equation. As an application of our estimates, we obtain strong completeness for several nonlinear SDEs.

We give a recursion relation for the second-quantized fermionic (bosonic) Halperin state, which avoids exact diagonalization of its two-component first-quantized parent Hamiltonian. We validate this formula by proving that the second-quantized Halperin state, as recursively defined in this formula, is indeed a zero mode of the corresponding second-quantized parent Hamiltonian and that it has the correct filling factor.

With the increasing importance of distributed scientific workflows, there is a critical need to ensure Quality of Service (QoS) constraints, such as minimizing time or limiting execution to resource subsets. However, the unpredictable nature of workflow behavior, even with similar configurations, makes it difficult to provide QoS guarantees. For effective reasoning about QoS scheduling, we introduce QoSFlow, a performance modeling method that partitions a workflow's execution configuration space into regions with similar behavior. Each region groups configurations with comparable execution times according to a given statistical sensitivity, enabling efficient QoS-driven scheduling through analytical reasoning rather than exhaustive testing. Evaluation on three diverse workflows shows that QoSFlow's execution recommendations outperform the best-performing standard heuristic by 27.38%. Empirical validation confirms that QoSFlow's recommended configurations consistently match measured execution outcomes across different QoS constraints.

An irrational number $θ$ is called Diophantine if there exist $c>0$ and $τ< \infty$ such that $\left| θ- \frac{p}{q} \right| \ge \frac{c}{q^τ}$ holds for every $(p,q) \in \mathbb{Z} \times \mathbb{N}$. In this paper, we study Diophantine and transcendence properties of some real numbers. Using lower bounds for linear forms in logarithms, we show that if $β\in \mathbb{C}$ is an algebraic number with $|β|=1$ that is not a root of unity, then $\frac{\operatorname{Arg}(β)}{2π}$ is Diophantine. We also prove that if $β= e^{iα}$ is algebraic, then $\fracαπ$ is either rational or transcendental. As a consequence, we obtain that if $n \ge 2$ is an integer and $α\in \left(0,\fracπ{2}\right)$ satisfies $n \tan α= \tan(n α)$, then $\fracα{2π}$ is both Diophantine and transcendental, and $α$ is transcendental. This extends a result of [V. Cyr, A number theoretic question arising in the geometry of plane curves and in billiard dynamics, Proc. Amer. Math. Soc. 140 (2012), no. 9, 3035--3040], which establishes that $\fracα{2π}$ is irrational.

This paper develops a unifying theory of peer effects that treats the peer aggregator (the social norm mapping peers' actions into a scalar exposure) as the central behavioral primitive. We formulate peer influence as a norm game in which payoffs depend on own action and an exposure index, and we provide equilibrium existence and uniqueness for a broad class of aggregators. Using economically interpretable axioms, we organize commonly used exposure maps into a small taxonomy that nests linear-in-means, CES (peer-preference) norms, and smooth ``attention-to-salient-peers'' aggregators; rank-based quantile norms are treated as a complementary class. Building on this unification, we show that each aggregator induces an operator that governs how exogenous variation propagates through the network. Linear-in-means corresponds to constant transport (adjacency matrix), recovering the classic (friends-of-friends) instrument families. For nonlinear norms, operator becomes state- and preference-dependent and is characterized by the Jacobian of the exposure map evaluated at an exogenous predictor. This perspective yields geometry-induced instrument that exploit heterogeneity in marginal influence and nonredundant paths, and can remain informative when one-step moments or adjacency-power instruments become weak. Monte Carlo evidence and an application to NetHealth illustrate the practical implications across alternative aggregators and outcomes.

Three-phase AC-DC rectifiers are fundamental components in modern power electronics systems, yet achieving rapid voltage regulation and precise current tracking under load and grid disturbances remains challenging due to nonlinear dynamics and measurement uncertainties. This paper presents a finite-time control method for three-phase AC-DC rectifiers that achieves millisecond-scale regulation of DC-link voltage and grid currents under varying conditions. The proposed design employs a transformed augmented error-state dynamics model, extending the voltage dynamics to a two-state system to construct an adaptive sliding surface that guarantees fast finite-time convergence. A nonlinear sliding-mode voltage regulator with an online disturbance estimator ensures rapid and robust voltage tracking, while a fast current controller achieves finite-time dq-axis current tracking with minimal chattering. Theoretical results establish finite-time stability and provide explicit gain selection conditions. Simulation results demonstrate up to 99.40 per cent and 87.5 per cent reductions in voltage and current convergence times, respectively, compared to conventional robust controllers. Laboratory experiments further validate the approach, showing 33.33 per cent lower voltage ripple, 33.33 per cent faster rise time, and 32.43 per cent reduced steady-state error relative to a recent method. These results confirm improvements in transient performance, convergence, and overall system stability, highlighting the method's practical applicability for high-performance rectifier control.

For hyperbolic differential operators $P$ with non-effectively hyperbolic double characteristics, we study the relationship between the Gevrey well-posedness threshold for strong well-posedness and the associated Hamilton map and flow. In our previous work, we showed that if the Hamilton map has a Jordan block of size $4$ on the double characteristic manifold $Σ$ of codimension $3$, then the Cauchy problem for $P$ is well-posed in the Gevrey class $1<s<3$ for all lower-order terms, and that this result is optimal. Moreover, if there are no bicharacterisitcs tangent to $Σ$, then the Cauchy problem is well-posed in the Gevrey class $1<s<3$ for all lower-order terms, and this result is also optimal. In the present paper, we remove the restriction on the codimension of $Σ$, thereby completing the result.

Knowledge distillation transfers large teacher models to compact student models, enabling deployment on resource-limited platforms while suffering minimal performance degradation. However, this paradigm could lead to various security risks, especially model theft. Existing defenses against model theft, such as watermarking and secure enclaves, focus primarily on identity authentication and incur significant resource costs. Aiming to provide post-theft accountability and traceability, we propose a novel fingerprinting framework that superimposes device-specific Physical Unclonable Function (PUF) signatures onto teacher logits during distillation. Compared with watermarking or secure enclaves, our approach is lightweight, requires no architectural changes, and enables traceability of any leaked or cloned model. Since the signatures are based on PUFs, this framework is robust against reverse engineering and tampering attacks. In this framework, the signature recovery process consists of two stages: first a neural network-based decoder and then a Hamming distance decoder. Furthermore, we also propose a bit compression scheme to support a large number of devices. Experiment results demonstrate that our framework achieves high key recovery rate and negligible accuracy loss while allowing a tunable trade-off between these two key metrics. These results show that the proposed framework is a practical and robust solution for protecting distilled models.

Interstellar objects provide a unique view into the formation of other star systems. Here we present spectroscopic observations of the recently discovered interstellar object 3I/ATLAS between a heliocentric distance of $3.7$ to $1.8$~au on either side of its travels through perihelion. We obtained several observations with the Keck-I/LRIS, Keck-II/NIRES, Gemini/GMOS, and UH88/SNIFS spectrographs, covering a wavelength range of $0.3 - 2.5~\mathrm{μm}$. We report the continued emission of both Ni and CN, along with post-perihelion detections of Fe and a weak detection of $\mathrm{C_3}$. We determine the spectral slope across optical and NIR wavelengths and find a positive spectral slope in the optical, with values ranging from $\sim 21 - 27\%$ in the blue regions ($0.4 - 0.55~\mathrm{μm}$) to $\sim 6 - 10\%$ in the red ($0.65 - 0.9~\mathrm{μm}$) regions. In contrast, the NIR showed a negative spectral slope of $\sim -0.9 \%$ between $0.9 - 1.5~\mathrm{μm}$ and $\sim -2.3\%$ between $1.9 - 2.5~\mathrm{μm}$. 3I/ATLAS shows a clear turnover in its spectral shape at $\sim 1.1~\mathrm{μm}$, corresponding to scattered light from the dusty coma. Finally, in the NIR, we do not find an increase in the depth of the water features identified in an earlier NIR observation of 3I/ATLAS. Our observations of 3I/ATLAS in the NIR show a similar shape to the NIR spectrum of 2I/Borisov as it approached perihelion.

Cluster type varieties are compactifications of algebraic tori on which the volume form has no zeros. These form a natural class of varieties that generalizes both toric varieties and cluster varieties. The aim of this article is to introduce the reader to the concept of cluster type varieties and explain some recent results towards the understanding of these varieties. At the same time, we will pose some problems for further research.

In this work, we develop a random batch sum-of-Gaussians (RBSOG) method for molecular dynamics simulations of charged systems in the isothermal-isobaric (NPT) ensemble. We introduce an SOG splitting of the pressure-related $1/r^3$ kernel, yielding a smooth short-/long-range decomposition for instantaneous pressure evaluation. The long-range part is treated in Fourier space by random-batch importance sampling. Because the radial and non-radial pressure components favor different proposals, direct sampling either increases structure-factor evaluations and communication or leads to substantial variance inflation. To address this tradeoff, we introduce a measure-recalibration strategy that reuses Fourier modes drawn from the radial proposal and corrects them for the non-radial target, producing an unbiased pressure estimator with significantly reduced variance and negligible extra cost. The resulting method mitigates pressure artifacts caused by cutoff discontinuities in traditional Ewald-based treatments while preserving near-optimal $O(N)$ complexity. We provide theoretical evidence on pressure decomposition error, consistency of stochastic approximation, and convergence of RBSOG-based MD. Numerical experiments on bulk water, LiTFSI ionic liquids, and DPPC membranes show that RBSOG accurately reproduces key structural and dynamical observables with small batch sizes ($P\sim 100$). In large-scale benchmarks up to $10^7$ atoms on $2048$ CPU cores, RBSOG achieves about an order-of-magnitude speedup over particle-particle particle-mesh in electrostatic calculations for NPT simulations, together with a consistent $4\times$ variance reduction relative to random batch Ewald and excellent weak/strong scalability. Overall, RBSOG provides a practical and scalable route to reduce time-to-solution and communication cost in large-scale NPT simulations.

For every real number $c \geq 1$ and for all $\varepsilon > 0$, there is a fitness function $f : \{0,1\}^n \to \mathbb{R}$ for which the optimal mutation rate for the $(1+1)$ evolutionary algorithm on $f$, denoted $p_n$, satisfies $p_n \approx c/n$ in that $|np_n - c| < \varepsilon$. In other words, the set of all $c \geq 1$ for which the mutation rate $c/n$ is optimal for the $(1+1)$ EA is dense in the interval $[1, \infty)$. To show this, a fitness function is introduced which is called HillPathJump.

Although an increasing number of databases now embrace shared-storage architectures, current storage-disaggregated systems have yet to strike an optimal balance between cost and performance. In high-concurrency read/write scenarios, B+-tree-based shared storage struggles to efficiently absorb frequent in-place updates. Existing LSM-tree-backed disaggregated storage designs are hindered by the intricate implementation of cross-node shared-log mechanisms, where no satisfactory solution yet exists. This paper presents OceanBase Bacchus, an LSM-tree architecture tailored for object storage provided by cloud vendors. The system sustains high-performance reads and writes while rendering compute nodes stateless through shared service-oriented PALF (Paxos-backed Append-only Log File system) logging and asynchronous background services. We employ a Shared Block Cache Service to flexibly utilize cache resources. Our design places log synchronization into a shared service, providing a novel solution for log sharing in storage-compute-separated databases. The architecture decouples functionality across modules, enabling elastic scaling where compute, cache, and storage resources can be resized rapidly and independently. Through experimental evaluation using multiple benchmark tests, including SysBench and TPC-H, we confirm that OceanBase Bacchus achieves performance comparable to or superior to that of HBase in OLTP scenarios and significantly outperforms StarRocks in OLAP workloads. Leveraging Bacchus's support for multi-cloud deployment and consistent performance, we not only retain high availability and competitive performance but also achieve substantial reductions in storage costs by 59% in OLTP scenarios and 89% in OLAP scenarios.

In the realm of quantum computing, quantum circuits serve as essential depictions of quantum algorithms, which are then compiled into executable operations for quantum computations. Quantum compilers are responsible for converting these algorithmic quantum circuits into versions compatible with specific quantum hardware, thus connecting quantum software with hardware. Nevertheless, untrusted quantum compilers present notable threats. They have the potential to result in the theft of quantum circuit designs and jeopardize sensitive intellectual property (IP). In this work, we propose CLOAQ, a quantum circuit obfuscation (QCO) approach that hides the logic and the phase angles of selected gates within the obfuscated quantum circuit. To evaluate the effectiveness of CLOAQ, we sample the input state uniformly from the Hilbert space of all qubits, which is more accurate than prior work that use all-|0> inputs. Our results show that CLOAQ benefits from the synergy between logic and phase protections. Compared with prior QCO approaches using only one perspective, the combined method is more resilient to attacks and causes greater functional disruption when the unlocking key is incorrect.