Search

Background: The rate of energy production in the hot-CNO cycle and breakout to the rapid-proton capture process in Type I X-ray bursts is strongly related to the $^{14}$O($\alpha,p$)$^{17}$F reaction rate. The properties of states in $^{18}$Ne near $E_x=6.1-6.3$ MeV are important for understanding this reaction rate. Experiment: The RESOLUT radioactive-ion beam facility at Florida State University was used to study $^{18}$Ne resonances around this energy region using $^{17}$F(p,p)$^{17}$F elastic scattering on a polypropylene target under inverse kinematics. Scattered protons were detected in a silicon-strip detector array while recoiling $^{17}$F ions were detected in coincidence in a gas ionization detector. Analysis: An $R$-matrix analysis of measured cross sections was conducted along with a reanalysis of data from previous measurements. Results: All the data analyzed are well described by a consistent set of parameters with with a $1^-$ assignment for a state at 6.14(1) MeV. A second comparable solution is also found with a $3^-$ assignment for the 6.14(1) MeV state. The rate of the $^{14}$O($\alpha$,p)$^{17}$F reaction that is determined from the two solutions differs by up to an order of magnitude., Comment: Update name of one of the authors

The modern era always looks into advancements in technology. Design and topology of interconnection networks play a mutual role in development of technology. Analysing the topological properties and characteristics of an interconnection network is not an easy task. Graph theory helps in solving this task analytically and efficiently through the use of numerical parameters known as distance based topological descriptors. These descriptors have considerable applications in various fields of computer science, chemistry, biology, etc. This paper deals with the evaluation of topological descriptors for an n-dimensional multistage interconnection network, the benes network,BB(n). Also, a new variant of interconnection network is derived from the benes network, named as augmented benes network and denoted as BB^* (n). The topological descriptors for the benes derived network are also determined in this work. Further, the benes network and augmented benes network undergoes a comparative analysis based on few network parameters, which helps to understand the efficiency of newly derived benes network. A broadcasting algorithm for the augmented benes network is also provided.

For a graph $\mathbb{Q}=(\mathbb{V},\mathbb{E})$, the transformation graphs are defined as graphs with vertex set being $\mathbb{V(Q)} \cup \mathbb{E(Q)}$ and edge set is described following certain conditions. In comparison to the structure descriptor of the original graph $\mathbb{Q}$, the topological descriptor of its transformation graphs displays distinct characteristics related to structure. Thus, a compound's transformation graphs descriptors can be used to model a variety of structural features of the underlying chemical. In this work, the concept of transformation graphs are extended giving rise to novel class of graphs, the $(r,s)$- generalised transformation graphs, whose vertex set is union of $r$ copies of $\mathbb{V(Q)}$ and $s$ copies of $\mathbb{E(Q)}$, where, $r, s \in N$ and the edge set are defined under certain conditions. Further, these class of graphs are analysed with the help of first Zagreb index. Mainly, there are eight transformation graphs based on the criteria for edge set, but under the concept of $(r,s)$- generalised transformation graphs, infinite number of graphs can be described and analysed.

We investigate the low rank matrix completion problem in an online setting with ${M}$ users, ${N}$ items, ${T}$ rounds, and an unknown rank-$r$ reward matrix ${R}\in \mathbb{R}^{{M}\times {N}}$. This problem has been well-studied in the literature and has several applications in practice. In each round, we recommend ${S}$ carefully chosen distinct items to every user and observe noisy rewards. In the regime where ${M},{N} >> {T}$, we propose two distinct computationally efficient algorithms for recommending items to users and analyze them under the benign \emph{hott items} assumption.1) First, for ${S}=1$, under additional incoherence/smoothness assumptions on ${R}$, we propose the phased algorithm \textsc{PhasedClusterElim}. Our algorithm obtains a near-optimal per-user regret of $\tilde{O}({N}{M}^{-1}(\Delta^{-1}+\Delta_{{hott}}^{-2}))$ where $\Delta_{{hott}},\Delta$ are problem-dependent gap parameters with $\Delta_{{hott}} >> \Delta$ almost always. 2) Second, we consider a simplified setting with ${S}=r$ where we make significantly milder assumptions on ${R}$. Here, we introduce another phased algorithm, \textsc{DeterminantElim}, to derive a regret guarantee of $\widetilde{O}({N}{M}^{-1/r}\Delta_{det}^{-1}))$ where $\Delta_{{det}}$ is another problem-dependent gap. Both algorithms crucially use collaboration among users to jointly eliminate sub-optimal items for groups of users successively in phases, but with distinctive and novel approaches., Comment: Appeared at the Forty-first International Conference on Machine Learning, 2024

This work proposes a hierarchical clustering algorithm for high-dimensional datasets using the cyclic space of reversible finite cellular automata. In cellular automaton (CA) based clustering, if two objects belong to the same cycle, they are closely related and considered as part of the same cluster. However, if a high-dimensional dataset is clustered using the cycles of one CA, closely related objects may belong to different cycles. This paper identifies the relationship between objects in two different cycles based on the median of all elements in each cycle so that they can be grouped in the next stage. Further, to minimize the number of intermediate clusters which in turn reduces the computational cost, a rule selection strategy is taken to find the best rules based on information propagation and cycle structure. After encoding the dataset using frequency-based encoding such that the consecutive data elements maintain a minimum hamming distance in encoded form, our proposed clustering algorithm iterates over three stages to finally cluster the data elements into the desired number of clusters given by user. This algorithm can be applied to various fields, including healthcare, sports, chemical research, agriculture, etc. When verified over standard benchmark datasets with various performance metrics, our algorithm is at par with the existing algorithms with quadratic time complexity.

The segregation and integration of infant brain networks undergo tremendous changes due to the rapid development of brain function and organization. Traditional methods for estimating brain modularity usually rely on group-averaged functional connectivity (FC), often overlooking individual variability. To address this, we introduce a novel approach utilizing Bayesian modeling to analyze the dynamic development of functional modules in infants over time. This method retains inter-individual variability and, in comparison to conventional group averaging techniques, more effectively detects modules, taking into account the stationarity of module evolution. Furthermore, we explore gender differences in module development under awake and sleep conditions by assessing modular similarities. Our results show that female infants demonstrate more distinct modular structures between these two conditions, possibly implying relative quiet and restful sleep compared with male infants.

Single-step Coulomb excitation of $^{46,48,49,50}$Ti is presented. A complete set of $E2$ matrix elements for the quintuplet of states in $^{49}$Ti, centered on the $2^+$ core excitation, was measured for the first time. A total of nine $E2$ matrix elements are reported, four of which were previously unknown. $^{49}_{22}$Ti$_{27}$ shows a $20\%$ quenching in electric quadrupole transition strength as compared to its semi-magic $^{50}_{22}$Ti$_{28}$ neighbour. This $20\%$ quenching, while empirically unprecedented, can be explained with a remarkably simple two-state mixing model, which is also consistent with other ground-state properties such as the magnetic dipole moment and electric quadrupole moment. A connection to nucleon transfer data and the quenching of single-particle strength is also demonstrated. The simplicity of the $^{49}$Ti-$^{50}$Ti pair (i.e., approximate single-$j$ $0f_{7/2}$ valence space and isolation of yrast states from non-yrast states) provides a unique opportunity to disentangle otherwise competing effects in the ground-state properties of atomic nuclei, the emergence of collectivity, and the role of proton-neutron interactions., Comment: 8 pages, 5 figures, accepted in Physics Letters B

This paper addresses the prevalent issue of label shift in an online setting with missing labels, where data distributions change over time and obtaining timely labels is challenging. While existing methods primarily focus on adjusting or updating the final layer of a pre-trained classifier, we explore the untapped potential of enhancing feature representations using unlabeled data at test-time. Our novel method, Online Label Shift adaptation with Online Feature Updates (OLS-OFU), leverages self-supervised learning to refine the feature extraction process, thereby improving the prediction model. By carefully designing the algorithm, theoretically OLS-OFU maintains the similar online regret convergence to the results in the literature while taking the improved features into account. Empirically, it achieves substantial improvements over existing methods, which is as significant as the gains existing methods have over the baseline (i.e., without distribution shift adaptations).