Search

The Super-Kamiokande and T2K collaborations present a joint measurement of neutrino oscillation parameters from their atmospheric and beam neutrino data. It uses a common interaction model for events overlapping in neutrino energy and correlated detector systematic uncertainties between the two datasets, which are found to be compatible. Using 3244.4 days of atmospheric data and a beam exposure of $19.7(16.3) \times 10^{20}$ protons on target in (anti)neutrino mode, the analysis finds a 1.9$\sigma$ exclusion of CP-conservation (defined as $J_{CP}=0$) and a preference for the normal mass ordering., Comment: 12 pages, 4 figures

Juvenile Idiopathic Arthritis (JIA) is a widespread and chronic condition that affects children and adolescents worldwide. The person suffering from JIA is characterized by chronic joint inflammation leading to pain, swelling, stiffness, and limited body movements. Individuals suffering from JIA require ongoing treatment for their lifetime. Beyond inflammation, JIA patients have expressed concerns about various factors and the lack of responsive services addressing their challenges. The implementation of smart garments offers a promising solution to assist individuals with Juvenile Idiopathic Arthritis in performing their daily activities. These garments are designed to seamlessly integrate technology and clothing, providing not only physical support but also addressing the psychological and emotional aspects of living with a chronic condition. By incorporating sensors, these smart garments can monitor joint movement, detect inflammation, and provide real-time feedback to both patients and healthcare providers. To tackle these comprehensive challenges, the research aims to offer a solution through the design of a smart garment, created with a holistic approach. This smart garment is intended to improve the overall well-being of JIA patients by enhancing their mobility, comfort, and overall quality of life. The integration of technology into clothing can potentially revolutionize the way JIA is managed, allowing patients to better manage their condition and minimize its impact on their daily lives. The synergy between healthcare and technology holds great potential in addressing the multifaceted challenges posed by Juvenile Idiopathic Arthritis patients. Through innovation and empathy, this research aims to pave the way for a brighter future for individuals living with Juvenile Idiopathic Arthritis., Comment: 08 pages

In this work, we propose a new pooling strategy for language identification by considering Indian languages. The idea is to obtain utterance level features for any variable length audio for robust language recognition. We use the GhostVLAD approach to generate an utterance level feature vector for any variable length input audio by aggregating the local frame level features across time. The generated feature vector is shown to have very good language discriminative features and helps in getting state of the art results for language identification task. We conduct our experiments on 635Hrs of audio data for 7 Indian languages. Our method outperforms the previous state of the art x-vector [11] method by an absolute improvement of 1.88% in F1-score and achieves 98.43% F1-score on the held-out test data. We compare our system with various pooling approaches and show that GhostVLAD is the best pooling approach for this task. We also provide visualization of the utterance level embeddings generated using Ghost-VLAD pooling and show that this method creates embeddings which has very good language discriminative features.

To improve a firms supply chain performance it is essential to have a vendor evaluation process to be able to showcase an organizations success in the present aggressive market. Hence, the process of evaluating the vendor is a crucial task of the purchasing executives in supply chain management. The objective of this research is to propose a methodology to evaluate the vendors for a steel pipe manufacturing firm in Gujarat, India. For the purpose of the study, the Analytical Hierarchy Process was used to evaluate the best raw material vendor for this company. Multiple qualitative and quantitative criteria are involved in the vendor evaluation process. To solve the complex problem of vendor evaluation, a tradeoff between this multicriteria is important. The outcomes indicated that the AHP technique makes it simpler to assign weights for the different criteria for evaluating the vendor. Research findings showed that quality is the most important criterion followed by delivery, cost and vendor relationship management., Comment: 20 pages, 3 figures, 25 Tables

The research explores and examines factors for supplier evaluation and its impact on process improvement particularly aiming on a steel pipe manufacturing firm in Gujarat, India. Data was collected using in-depth interview. The questionnaire primarily involves the perception of evaluation of supplier. Factors influencing supplier evaluation and its influence on process improvement is also examined in this study. The model testing and validation were done using partial least square method. Outcomes signified that the factors that influence the evaluation of the supplier are quality, cost, delivery and supplier relationship management. The study depicted that quality and cost factors for supplier evaluation are insignificant. The delivery and supplier relationship management have the significant influence on the evaluation of the supplier. The research also depicted that supplier evaluation has a significant influence on process improvement. Many researchers have considered quality, cost and delivery as the factors for evaluating the suppliers. But for a company, it is quintessential to have a good relationship with the supplier. Hence, the factor, supplier relationship management is considered for the study. Also, the case study company focused more on quality and cost factors for the supplier evaluation of the firm. However, delivery and supplier relationship management are also equally important for a firm in evaluating the supplier., Comment: 24 pages, 09 figures, 13 tables

We propose a novel actor-critic algorithm with guaranteed convergence to an optimal policy for a discounted reward Markov decision process. The actor incorporates a descent direction that is motivated by the solution of a certain non-linear optimization problem. We also discuss an extension to incorporate function approximation and demonstrate the practicality of our algorithms on a network routing application.

Zero-sum stochastic games are easy to solve as they can be cast as simple Markov decision processes. This is however not the case with general-sum stochastic games. A fairly general optimization problem formulation is available for general-sum stochastic games by Filar and Vrieze [2004]. However, the optimization problem there has a non-linear objective and non-linear constraints with special structure. Since gradients of both the objective as well as constraints of this optimization problem are well defined, gradient based schemes seem to be a natural choice. We discuss a gradient scheme tuned for two-player stochastic games. We show in simulations that this scheme indeed converges to a Nash equilibrium, for a simple terrain exploration problem modelled as a general-sum stochastic game. However, it turns out that only global minima of the optimization problem correspond to Nash equilibria of the underlying general-sum stochastic game, while gradient schemes only guarantee convergence to local minima. We then provide important necessary conditions for gradient schemes to converge to Nash equilibria in general-sum stochastic games.

We consider the problem of finding stationary Nash equilibria (NE) in a finite discounted general-sum stochastic game. We first generalize a non-linear optimization problem from Filar and Vrieze [2004] to a $N$-player setting and break down this problem into simpler sub-problems that ensure there is no Bellman error for a given state and an agent. We then provide a characterization of solution points of these sub-problems that correspond to Nash equilibria of the underlying game and for this purpose, we derive a set of necessary and sufficient SG-SP (Stochastic Game - Sub-Problem) conditions. Using these conditions, we develop two actor-critic algorithms: OFF-SGSP (model-based) and ON-SGSP (model-free). Both algorithms use a critic that estimates the value function for a fixed policy and an actor that performs descent in the policy space using a descent direction that avoids local minima. We establish that both algorithms converge, in self-play, to the equilibria of a certain ordinary differential equation (ODE), whose stable limit points coincide with stationary NE of the underlying general-sum stochastic game. On a single state non-generic game (see Hart and Mas-Colell [2005]) as well as on a synthetic two-player game setup with $810,000$ states, we establish that ON-SGSP consistently outperforms NashQ ([Hu and Wellman, 2003] and FFQ [Littman, 2001] algorithms.

Service systems are labor intensive due to the large variation in the tasks required to address service requests from multiple customers. Aligning the staffing levels to the forecasted workloads adaptively in such systems is nontrivial because of a large number of parameters and operational variations leading to a huge search space. A challenging problem here is to optimize the staffing while maintaining the system in steady-state and compliant to aggregate service level agreement (SLA) constraints. Further, because these parameters change on a weekly basis, the optimization should not take longer than a few hours. We formulate this problem as a constrained Markov cost process parameterized by the (discrete) staffing levels. We propose novel simultaneous perturbation stochastic approximation (SPSA) based SASOC (Staff Allocation using Stochastic Optimization with Constraints) algorithms for solving the above problem. The algorithms include both first order as well as second order methods and incorporate SPSA based gradient estimates in the primal, with dual ascent for the Lagrange multipliers. Both the algorithms that we propose are online, incremental and easy to implement. Further, they involve a certain generalized smooth projection operator, which is essential to project the continuous-valued worker parameter tuned by SASOC algorithms onto the discrete set. We validated our algorithms on five real-life service systems and compared them with a state-of-the-art optimization tool-kit OptQuest. Being 25 times faster than OptQuest, our algorithms are particularly suitable for adaptive labor staffing. Also, we observe that our algorithms guarantee convergence and find better solutions than OptQuest in many cases.