搜索结果：tied

Given a tied link $L$, the invariant $\langle\langle\cdot\rangle\rangle$ generalizes the Kauffman bracket of classical links. However, the analogues of Kauffman states and their relationship to this invariant are not immediately clear. We address this question by defining the Aicardi-Juyumaya states, and show that the contribution of each AJ-state to $\langle\langle\cdot\rangle\rangle$ does not depend on the chosen resolution tree. We also present an algorithm to compute the double bracket of a tied link diagram, and use it to find pairs of examples of (oriented) tied links sharing the same Homflypt polynomial but different tied Jones polynomial.

Shewhart Control Charts (SCC)s are constructed under the assumption of normality and are widely recognized in statistical quality control by numerous researchers. Problems arise when the distribution of process data does not conform to a typical Normal Distribution (ND) or when there is insufficient evidence to confirm that the data has approximately ND. Additionally, in some processes, Tied Observations (TO)s are present. The resolution of the measurement device used to assess a quality characteristic can lead to rounding errors, as well as TOs. In many cases, SCCs prove inadequate. In this paper, we address the challenges of non-normal observations and rounding errors by developing a Shewhart Signed-Rank Control Chart (SS-RCC) based on the Wilcoxon statistic. We define a random variable for TOs and another for Untied Observations (UO)s. Subsequently, we approximate their distributions using a Scaled-Normal Distribution (SND) and apply a Deep Learning (DL) model to estimate the scale parameters of the SND for the Control Chart (CC). In practice, we calculate the Average Run Length ($ARL$) for specific cases using Johnson-type distribution benchmarks to illustrate the effects of ti

Artificial intelligence (AI) has significantly improved medical screening accuracy, particularly in cancer detection and risk assessment. However, traditional classification metrics often fail to account for imbalanced data, varying performance across cohorts, and patient-level inconsistencies, leading to biased evaluations. We propose the cohort-attention evaluation metrics for tied data (CAT). CAT introduces patient-level assessment, entropy-based distribution weighting, and cohort-weighted sensitivity and specificity. Key metrics like CAT Sensitivity, CAT Specificity, and CAT Mean ensure balanced and fair evaluation across diverse populations. This approach enhances predictive reliability, fairness, and interpretability, providing a robust evaluation method for AI-driven medical screening models.

Common prototype-based medical image few-shot segmentation (FSS) methods model foreground and background classes using class-specific prototypes. However, given the high variability of the background, a more promising direction is to focus solely on foreground modeling, treating the background as an anomaly -- an approach introduced by ADNet. Yet, ADNet faces three key limitations: dependence on a single prototype per class, a focus on binary classification, and fixed thresholds that fail to adapt to patient and organ variability. To address these shortcomings, we propose the Tied Prototype Model (TPM), a principled reformulation of ADNet with tied prototype locations for foreground and background distributions. Building on its probabilistic foundation, TPM naturally extends to multiple prototypes and multi-class segmentation while effectively separating non-typical background features. Notably, both extensions lead to improved segmentation accuracy. Finally, we leverage naturally occurring class priors to define an ideal target for adaptive thresholds, boosting segmentation performance. Taken together, TPM provides a fresh perspective on prototype-based FSS for medical image segme

We consider the problem of estimating `preference' or `strength' parameters in three-way comparison experiments, each composed of a series of paired comparisons, but where only the single `preferred' or `strongest' candidate is known in each trial. Such experiments arise in psychology and market research, but here we use chess competitions as the prototypical context, in particular a series of `pools' between three players that occurred in 1821. The possibilities of tied pools, redundant and therefore unplayed games, and drawn games must all be considered. This leads us to reconsider previous models for estimating strength parameters when drawn games are a possible result. In particular, Davidson's method for ties has been questioned, and we propose an alternative. We argue that the most correct use of this method is to estimate strength parameters first, and then fix these to estimate a draw-propensity parameter, rather than estimating all parameters simultaneously, as Davidson does. This results in a model that is consistent with, and provides more context for, a simple method for handling draws proposed by Glickman. Finally, in pools with incomplete information, the number of dr

In this paper we study the theory of {\it pseudo knots}, which are knots with some missing crossing information, and we introduce and study the theory of {\it pseudo tied links} and the theory of {\it pseudo knotoids}. In particular, we first present a braiding algorithm for pseudo knots and we then introduce the $L$-moves in that setting, with the use of which we formulate a sharpened version of the analogue of the Markov theorem for pseudo braids. Then we introduce and study the theory of {\it tied pseudo links}, that generalize the notion of tied links, and we exploit the relation between tied pseudo links and tied singular links. We first present an $L$-move braid equivalence for tied singular braids. Then, we introduce the tied pseudo braid monoid and we formulate and prove analogues of the Alexander and Markov theorems for tied pseudo links. Finally, we introduce and study the theory of {\it pseudo knotoids}, that generalize the notion of knotoids. We present an isotopy theorem for pseudo knotoids and we then pass to the level of braidoids. We further introduce and study the {\it pseudo braidoids} by introducing the {\it pseudo} $L${\it -moves} and by presenting the analogues

Tied links and the tied braid monoid were introduced recently by the authors and used to define new invariants for classical links. Here, we give a version purely algebraic-combinatoric of tied links. With this new version we prove that the tied braid monoid has a decomposition like a semi--direct group product. By using this decomposition we reprove the Alexander and Markov theorem for tied links; also, we introduce the tied singular knots, the tied singular braid monoid and certain families of Homflypt type invariants for tied singular links; these invariants are five-variables polynomials. Finally, we study the behavior of these invariants; in particular, we show that our invariants distinguish non isotopic singular links indistinguishable by the Paris-Rabenda invariant.

Tied links in $S^3$ were introduced by Aicardi and Juyumaya as standard links in $S^3$ equipped with some non-embedded arcs, called {\it ties}, joining some components of the link. Tied links in the Solid Torus were then naturally generalized by Flores. In this paper we study this new class of links in other topological settings. More precisely, we study tied links in the lens spaces $L(p,1)$, in handlebodies of genus $g$, and in the complement of the $g$-component unlink. We introduce the tied braid groups $TB_{g, n}$ by combining the algebraic mixed braid groups defined by Lambropoulou and the tied braid monoid, and we state and prove Alexander's and Markov's theorems for tied links in the 3-manifolds mentioned above. Finally, we emphasize on further steps needed in order to study tied links in knot complements and c.c.o. 3-manifolds, which is the subject of a sequel paper.

In this paper we introduce the tied links, i.e. ordinary links provided with some ties between strands. The motivation for introducing such objects originates from a diagrammatical interpretation of the defining generators of the so-called algebra of braids and ties; indeed, one half of such generators can be interpreted as the usual generators of the braid algebra, and the remaining generators can be interpreted as ties between consecutive strands; this interpretation leads the definition of tied braids. We define an invariant polynomial for the tied links via a skein relation. Furthermore, we introduce the monoid of tied braids and we prove the corresponding theorems of Alexander and Markov for tied links. Finally, we prove that the invariant of tied links that we have defined can be obtained also by using the Jones recipe.

We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids indicate that they should give origin to new knot algebras; indeed, our tied monoids include the tied braid monoid and the tied singular braid monoid, which were used, respectively, to construct new polynomial invariants for classical links and singular links. Consequently, we provide a mechanism to attach an algebra to each tied monoid. To build the tied monoids it is necessary to have presentations of set partition monoids of types A, B and D, among others. For type A we use a presentation due to FitzGerald and for the other type it was necessary to built them.

Multi-element interferometers such as MeerKAT, which observe with high time resolution and have a wide field-of-view, provide an ideal opportunity to perform real-time, untargeted transient and pulsar searches. However, because of data storage limitations, it is not always feasible to store the baseband data required to image the field of a discovered transient or pulsar. This limits the ability of surveys to effectively localise their discoveries and may restrict opportunities for follow-up science, especially of one-off events like some Fast Radio Bursts (FRBs). Here we present a novel maximum-likelihood estimation approach to localising transients and pulsars detected in multiple MeerKAT tied-array beams at once, which we call Tied Array Beam Localisation (TABLo), as well as a Python implementation of the method named SeeKAT. We provide real-world examples of SeeKAT's use as well as a Monte Carlo analysis to show that it is capable of localising single pulses detected in beamformed MeerKAT data to (sub-)arcsecond precision.

We introduce two new algebras that we call \emph{tied--boxed Hecke algebra} and \emph{tied--boxed Temperley--Lieb algebra}. The first one is a subalgebra of the algebra of braids and ties introduced by Aicardi and Juyumaya, and the second one is a tied--version of the well known Temperley--Lieb algebra. We study their representation theory and give cellular bases for them. Furthermore, we explore a strong connection between the tied--boxed Temperley--Lieb algebra and the so--called partition Temperley--Lieb algebra given by Juyumaya. Also, we show that both structures inherit diagrammatic interpretations from a new class of monoids that we call \emph{boxed ramified monoids}. Additionally, we give presentations for the singular part of the ramified symmetric monoid and for the boxed ramified monoid associated to the Brauer monoid.

Large radio astronomy multi-element interferometers are frequently used as single dishes in a tied-array mode when signals from separate antennas are added. Phase shifts arising during wave propagation through a turbulent atmosphere can significantly reduce the effective area of an equivalent single dish. I aim to give estimates of the impact of the ionosphere and troposphere on the effectiveness of a radio interferometer working in tied-array mode. Statistical estimates of the effective area are calculated and the power-law of turbulent atmosphere irregularities has been used. A simple method of tied-array calibration using optimization techniques is proposed. The impact of phase errors on the effectiveness of tied-arrays are given for low and high frequencies. Computer simulations demonstrate the efficacy of the proposed calibration algorithm.

We introduce a ramified monoid, attached to each Brauer--type monoid, that is, to the symmetric group, to the Jones and Brauer monoids among others. Ramified monoids correspond to a class of tied monoids which arise from knot theory and are interesting in itself. The ramified monoid attached to the symmetric group is the Coxeter-like version of the so--called tied braid monoid. We give a presentation of the ramified monoid attached to the Brauer monoid. Also, we introduce and studied two tied-like monoids that cannot be described as ramified monoids. However, these monoids can also be regarded as tied versions of the Jones and Brauer monoids.

This is a chapter for the upcoming book "Handbook of Combinatorial Algebraic Geometry". Comments are welcome! We cover symmetric function identities tied to delta operators, as well as representation-theoretic and geometric avatars of these identities.

We introduce the concept of tied links in the solid torus, which generalize naturally the concept of tied links in $S^3$ previously introduced by Aicardi and Juyumaya. We also define an invariant of these tied links by using skein relations, and subsequently we recover this invariant by using Jones' method over the bt-algebra of type $\mathtt{B}$ and the Markov trace defined on this.

We define two new invariants for tied links. One of them can be thought as an extension of the Kauffman polynomial and the other one as an extension of the Jones polynomial which is constructed via a bracket polynomial for tied links. These invariants are more powerful than both the Kauffman and the bracket polynomials when evaluated on classical links. Further, the extension of the Kauffman polynomial is more powerful of the Homflypt polynomial, as well as of certain new invariants introduced recently. Also we propose a new algebra which plays in the case of tied links the same role as the BMW algebra for the Kauffman polynomial in the classical case. Moreover, we prove that the Markov trace on this new algebra can be recovered from the extension of the Kauffman polynomial defined here.

We prove functional, distributional limit theorems for the occupation times of pointwise dual ergodic transformations at "tied-down" times immediately after "excursions". The limiting processes are tied down Mittag-Leffler processes and the transformations involved exhibit functional tied-down renewal mixing properties strengthening those of [AS19].

Acoustic models using probabilistic linear discriminant analysis (PLDA) capture the correlations within feature vectors using subspaces which do not vastly expand the model. This allows high dimensional and correlated feature spaces to be used, without requiring the estimation of multiple high dimension covariance matrices. In this letter we extend the recently presented PLDA mixture model for speech recognition through a tied PLDA approach, which is better able to control the model size to avoid overfitting. We carried out experiments using the Switchboard corpus, with both mel frequency cepstral coefficient features and bottleneck feature derived from a deep neural network. Reductions in word error rate were obtained by using tied PLDA, compared with the PLDA mixture model, subspace Gaussian mixture models, and deep neural networks.