Fermi arc reconstruction in synthetic photonic lattice

The chiral surface states of Weyl semimetals have an open Fermi surface called Fermi arc. At the interface between two Weyl semimetals, these Fermi arcs are predicted to hybridize and alter their connectivity. In this letter, we numerically study a one-dimensional (1D) dielectric trilayer grating where the relative displacements between adjacent layers play the role of two synthetic momenta. The lattice emulates 3D crystals without time-reversal symmetry, including Weyl semimetal, nodal line semimetal, and Chern insulator. Besides showing the phase transition between Weyl semimetal and Chern insulator at telecom wavelength, this system allows us to observe the Fermi arc reconstruction between two Weyl semimetals, confirming the theoretical predictions.Comment: Main text: 4 pages, 4 figures. Supplemental materials: 19 pages, 18 figure

Enhancing Few-shot Image Classification with Cosine Transformer

This paper addresses the few-shot image classification problem, where the classification task is performed on unlabeled query samples given a small amount of labeled support samples only. One major challenge of the few-shot learning problem is the large variety of object visual appearances that prevents the support samples to represent that object comprehensively. This might result in a significant difference between support and query samples, therefore undermining the performance of few-shot algorithms. In this paper, we tackle the problem by proposing Few-shot Cosine Transformer (FS-CT), where the relational map between supports and queries is effectively obtained for the few-shot tasks. The FS-CT consists of two parts, a learnable prototypical embedding network to obtain categorical representations from support samples with hard cases, and a transformer encoder to effectively achieve the relational map from two different support and query samples. We introduce Cosine Attention, a more robust and stable attention module that enhances the transformer module significantly and therefore improves FS-CT performance from 5% to over 20% in accuracy compared to the default scaled dot-product mechanism. Our method performs competitive results in mini-ImageNet, CUB-200, and CIFAR-FS on 1-shot learning and 5-shot learning tasks across backbones and few-shot configurations. We also developed a custom few-shot dataset for Yoga pose recognition to demonstrate the potential of our algorithm for practical application. Our FS-CT with cosine attention is a lightweight, simple few-shot algorithm that can be applied for a wide range of applications, such as healthcare, medical, and security surveillance. The official implementation code of our Few-shot Cosine Transformer is available at https://github.com/vinuni-vishc/Few-Shot-Cosine-Transforme

Improving Heterogeneous Graph Learning with Weighted Mixed-Curvature Product Manifold

In graph representation learning, it is important that the complex geometric structure of the input graph, e.g. hidden relations among nodes, is well captured in embedding space. However, standard Euclidean embedding spaces have a limited capacity in representing graphs of varying structures. A promising candidate for the faithful embedding of data with varying structure is product manifolds of component spaces of different geometries (spherical, hyperbolic, or euclidean). In this paper, we take a closer look at the structure of product manifold embedding spaces and argue that each component space in a product contributes differently to expressing structures in the input graph, hence should be weighted accordingly. This is different from previous works which consider the roles of different components equally. We then propose WEIGHTED-PM, a data-driven method for learning embedding of heterogeneous graphs in weighted product manifolds. Our method utilizes the topological information of the input graph to automatically determine the weight of each component in product spaces. Extensive experiments on synthetic and real-world graph datasets demonstrate that WEIGHTED-PM is capable of learning better graph representations with lower geometric distortion from input data, and performs better on multiple downstream tasks, such as word similarity learning, top-$k$ recommendation, and knowledge graph embedding

Towards Safer Operations: An Expert-involved Dataset of High-Pressure Gas Incidents for Preventing Future Failures

This paper introduces a new IncidentAI dataset for safety prevention. Different from prior corpora that usually contain a single task, our dataset comprises three tasks: named entity recognition, cause-effect extraction, and information retrieval. The dataset is annotated by domain experts who have at least six years of practical experience as high-pressure gas conservation managers. We validate the contribution of the dataset in the scenario of safety prevention. Preliminary results on the three tasks show that NLP techniques are beneficial for analyzing incident reports to prevent future failures. The dataset facilitates future research in NLP and incident management communities. The access to the dataset is also provided (the IncidentAI dataset is available at: https://github.com/Cinnamon/incident-ai-dataset).Comment: Accepted by EMNLP 2023 (The Industry Track

Design an Intelligent System to automatically Tutor the Method for Solving Problems

Nowadays, intelligent systems have been applied in many real-word domains. The Intelligent chatbot is an intelligent system, it can interact with the human to tutor how to work some activities. In this work, we design an architecture to build an intelligent chatbot, which can tutor to solve problems, and construct scripts for automatically tutoring. The knowledge base of the intelligent tutoring chatbot is designed by using the requirements of an Intelligent Problem Solver. It is the combination between the knowledge model of relations and operators, and the structures of hint questions and sample problems, which are practical cases. Based on the knowledge base and tutoring scripts, a tutoring engine is designed. The tutoring chatbot plays as an instructor for solving real-world problems. It simulates the working of the instructor to tutor the user for solving problems. By utilizing the knowledge base and reasoning, the architecture of the intelligent chatbot are emerging to apply in the real-world. It is used to build an intelligent chatbot to support the learning of high-school mathematics and a consultant system in public administration. The experimental results show the effectiveness of the proposed method in comparison with the existing systems

Robust estimation, regression and ranking with applications in portfolio optimization

Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2009.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Cataloged from student-submitted PDF version of thesis.Includes bibliographical references (p. 108-112).Classical methods of maximum likelihood and least squares rely a great deal on the correctness of the model assumptions. Since these assumptions are only approximations of reality, many robust statistical methods have been developed to produce estimators that are robust against the deviation from the model assumptions. Unfortunately, these techniques have very high computational complexity that prevents their application to large scale problems. We present computationally efficient methods for robust mean-covariance estimation and robust linear regression using special mathematical programming models and semi-definite programming (SDP). In the robust covariance estimation problem, we design an optimization model with a loss function on the weighted Mahalanobis distances and show that the problem is equivalent to a system of equations and can be solved using the Newton-Raphson method. The problem can also be transformed into an SDP problem from which we can flexibly incorporate prior beliefs into the estimators without much increase in the computational complexity. The robust regression problem is often formulated as the least trimmed squares (LTS) regression problem where we want to nd the best subset of observations with the smallest sum of squared residuals. We show the LTS problem is equivalent to a concave minimization problem, which is very hard to solve. We resolve this difficulty by introducing the maximum trimmed squares" problem that finds the worst subset of observations. This problem can be transformed into an SDP problem that can be solved efficiently while still guaranteeing that we can identify outliers.(cont.) In addition, we model the robust ranking problem as a mixed integer minimax problem where the ranking is in a discrete uncertainty set. We use mixed integer programming methods, specifically column generation and network flows, to solve the robust ranking problem. To illustrate the power of these robust methods, we apply them to the mean-variance portfolio optimization problem in order to incorporate estimation errors into the model.by Tri-Dung Nguyen.Ph.D

Vectors and malaria transmission in deforested, rural communities in north-central Vietnam

Background: Malaria is still prevalent in rural communities of central Vietnam even though, due to deforestation, the primary vector Anopheles dirus is uncommon. In these situations little is known about the secondary vectors which are responsible for maintaining transmission. Basic information on the identification of the species in these rural communities is required so that transmission parameters, such as ecology, behaviour and vectorial status can be assigned to the appropriate species