Miracle-dz/UniFAR-FTUs huggingface dataset:
Comparisons of Different Fitting Methods for the Physical Parameters of a Star Cluster Sample of M33 with Spectroscopy and Photometry

Star clusters are good tracers for formation and evolution of galaxies. We compared different fitting methods by using spectra (or by combining photometry) to determine the physical parameters. We choose a sample of 17 star clusters in M33, which previously lacked spectroscopic observations. The low-resolution spectra were taken with the Xinglong 2.16 m reflector of NAOC. The photometry used in the fitting includes uSC and vSAGE bands from the SAGE survey, as well as the published UBVRI and ugriz photometry. We first derived ages and metallicities with the ULySS (Vazdekis et al. and pegase-hr) simple stellar population model and the Bruzual & Charlot stellar population synthesis models for the full-spectrum fitting. The fitting results of both the BC03 and ULySS models seem consistent with those of previous works as well. Then, we add the SAGE uSC and vSAGE photometry in the spectroscopic fitting with the BC03 models. It seems that the results become much better, especially for the Padova 2000+Chabrier initial mass function set. Finally, we add more photometry data, UBVRI and ugriz, in the fitting, and we found that the results do not improve significantly. Therefore, we conclude that the photometry is useful for improving the fitting results, especially for the blue bands (λ < 4000 Å), e.g., uSC and vSAGE band. At last, we discuss the “UV excess” for the star clusters, and we find that five star clusters have UV excess, based on the GALEX far-UV and near-UV photometry.
Teaching to Learn: Sequential Teaching of Agents with Inner States

In sequential machine teaching, a teacher's objective is to provide the optimal sequence of inputs to sequential learners in order to guide them towards the best model. In this paper we extend this setting from current static one-data-set analyses to learners which change their learning algorithm or latent state to improve during learning, and to generalize to new datasets. We introduce a multi-agent formulation in which learners' inner state may change with the teaching interaction, which affects the learning performance in future tasks. In order to teach such learners, we propose an optimal control approach that takes the future performance of the learner after teaching into account. This provides tools for modelling learners having inner states, and machine teaching of meta-learning algorithms. Furthermore, we distinguish manipulative teaching, which can be done by effectively hiding data and also used for indoctrination, from more general education which aims to help the learner become better at generalization and learning in new datasets in the absence of a teacher.
Spatial Differencing for Sample Selection Models with Unobserved Heterogeneity

This paper derives identification, estimation, and inference results using spatial differencing in sample selection models with unobserved heterogeneity. We show that under the assumption of smooth changes across space of the unobserved sub-location specific heterogeneities and inverse Mills ratio, key parameters of a sample selection model are identified. The smoothness of the sub-location specific heterogeneities implies a correlation in the outcomes. We assume that the correlation is restricted within a location or cluster and derive asymptotic results showing that as the number of independent clusters increases, the estimators are consistent and asymptotically normal. We also propose a formula for standard error estimation. A Monte-Carlo experiment illustrates the small sample properties of our estimator. The application of our procedure to estimate the determinants of the municipality tax rate in Finland shows the importance of accounting for unobserved heterogeneity.
Composing Answer from Multi-spans for Reading Comprehension

This paper presents a novel method to generate answers for non-extraction machine reading comprehension (MRC) tasks whose answers cannot be simply extracted as one span from the given passages. Using a pointer network-style extractive decoder for such type of MRC may result in unsatisfactory performance when the ground-truth answers are given by human annotators or highly re-paraphrased from parts of the passages. On the other hand, using generative decoder cannot well guarantee the resulted answers with well-formed syntax and semantics when encountering long sentences. Therefore, to alleviate the obvious drawbacks of both sides, we propose an answer making-up method from extracted multi-spans that are learned by our model as highly confident $n$-gram candidates in the given passage. That is, the returned answers are composed of discontinuous multi-spans but not just one consecutive span in the given passages anymore. The proposed method is simple but effective: empirical experiments on MS MARCO show that the proposed method has a better performance on accurately generating long answers, and substantially outperforms two competitive typical one-span and Seq2Seq baseline decoders.
Artery-C: An OMNeT++ Based Discrete Event Simulation Framework for Cellular V2X

Introduced with LTE Release 14, Cellular V2X enables device-to-device communication to support road safety and traffic efficiency applications. We present Artery-C, a simulation framework for the performance evaluation of Cellular V2X protocols and V2X applications. Our simulator relies on the simulation framework SimuLTE and substantially extends it by implementing control and user planes, a dedicated sidelink interface with specific focus on dynamic mode switching and some advanced features of 5G mobile networks, such as variable numerologies. Artery-C integrates seamlessly into the simulation framework Artery, which enables the simulation of standardized V2X messages at the facilities layer as well as the coupling to the mobility simulator SUMO. In order to demonstrate the capabilities of Artery-C, we evaluate V2X-based platooning as a representative use case and present results for mode 3, mode 4 and mode switching in a highway scenario.
Cutoff for the bidirectional East Process

This paper will examine the cutoff for a random process on the hypercube, $\{0, 1\}^L$, closely related to the East Process. In this process, every coordinate has two 1/2-Poisson clocks at each coordinate which add the coordinate to the previous or next one when they ring. We show that the cutoff is $L/v$ with a window of order $\sqrt{L}$, where $v$ is the speed of the front. We compare these results to the cutoff for the East Process and the cutoff for a non-local version of this same process studied by Ganguly, Lubetzky, and Martinelli as well as Ben-Hamou and Peres.
Machine Learning's Dropout Training is Distributionally Robust Optimal

This paper shows that dropout training in Generalized Linear Models is the minimax solution of a two-player, zero-sum game where an adversarial nature corrupts a statistician's covariates using a multiplicative nonparametric errors-in-variables model. In this game---known as a Distributionally Robust Optimization problem---nature's least favorable distribution is dropout noise, where nature independently deletes entries of the covariate vector with some fixed probability $\delta$. Our decision-theoretic analysis shows that dropout training---the statistician's minimax strategy in the game---indeed provides out-of-sample expected loss guarantees for distributions that arise from multiplicative perturbations of in-sample data. This paper also provides a novel, parallelizable, Unbiased Multi-Level Monte Carlo algorithm to speed-up the implementation of dropout training. Our algorithm has a much smaller computational cost compared to the naive implementation of dropout, provided the number of data points is much smaller than the dimension of the covariate vector.
Exploring Level Blending across Platformers via Paths and Affordances

Techniques for procedural content generation via machine learning (PCGML) have been shown to be useful for generating novel game content. While used primarily for producing new content in the style of the game domain used for training, recent works have increasingly started to explore methods for discovering and generating content in novel domains via techniques such as level blending and domain transfer. In this paper, we build on these works and introduce a new PCGML approach for producing novel game content spanning multiple domains. We use a new affordance and path vocabulary to encode data from six different platformer games and train variational autoencoders on this data, enabling us to capture the latent level space spanning all the domains and generate new content with varying proportions of the different domains.
GW Interferometer Euro-Asian Network: Detection Characteristics for Signals of Known Shape

In this paper, we estimate efficiency of a conceivable Euro-Asian network of gravitational wave (GW) interferometers that might be realized having in mind a plan of construction of third generation interferometer in Novosibirsk region. Subsequently, some network would be composed, including four GW detectors. Among them there are the already active interferometers VIRGO (Italy) and KAGRA (Japan), Indian interferometer under construction—LIGO India and the interferometer in Siberia mentioned above. The quality of network in question is considered on the base of typical numerical criteria of efficiency for detecting GW signals of known structure—radiation of relativistic binary coalescence.
Zone pAth Construction (ZAC) based Approaches for Effective Real-Time Ridesharing

Real-time ridesharing systems such as UberPool, Lyft Line and GrabShare have become hugely popular as they reduce the costs for customers, improve per trip revenue for drivers and reduce traffic on the roads by grouping customers with similar itineraries. The key challenge in these systems is to group the “right” requests to travel together in the “right” available vehicles in real-time, so that the objective (e.g., requests served, revenue or delay) is optimized. This challenge has been addressed in existing work by: (i) generating as many relevant feasible combinations of requests (with respect to the available delay for customers) as possible in real-time; and then (ii) optimizing assignment of the feasible request combinations to vehicles. Since the number of request combinations increases exponentially with the increase in vehicle capacity and number of requests, unfortunately, such approaches have to employ ad hoc heuristics to identify a subset of request combinations for assignment. Our key contribution is in developing approaches that employ zone (abstraction of individual locations) paths instead of request combinations. Zone paths allow for generation of significantly more “relevant” combinations (in comparison to ad hoc heuristics) in real-time than competing approaches due to two reasons: (i) Each zone path can typically represent multiple request combinations; (ii) Zone paths are generated using a combination of offline and online methods. Specifically, we contribute both myopic (ridesharing assignment focussed on current requests only) and non-myopic (ridesharing assignment considers impact on expected future requests) approaches that employ zone paths. In our experimental results, we demonstrate that our myopic approach outperforms the current best myopic approach for ridesharing on both real-world and synthetic datasets (with respect to both objective and runtime). We also show that our non-myopic approach obtains 14.7% improvement over existing myopic approach. Our non-myopic approach gets improvements of up to 12.48% over a recent non-myopic approach, NeurADP. Even when NeurADP is allowed to optimize learning over test settings, results largely remain comparable except in a couple of cases, where NeurADP performs better.
Stochastic Modeling Approaches for Analyzing Blockchain: A Survey

Blockchain technology has been attracting much attention from both academia and industry. It brings many benefits to various applications like Internet of Things. However, there are critical issues to be addressed before its widespread deployment, such as transaction efficiency, bandwidth bottleneck, and security. Techniques are being explored to tackle these issues. Stochastic modeling, as one of these techniques, has been applied to analyze a variety of blockchain characteristics, but there is a lack of a comprehensive survey on it. In this survey, we aim to fill the gap and review the stochastic models proposed to address common issues in blockchain. Firstly, this paper provides the basic knowledge of blockchain technology and stochastic models. Then, according to different objects, the stochastic models for blockchain analysis are divided into network-oriented and application-oriented (mainly refer to cryptocurrency). The network-oriented stochastic models are further classified into two categories, namely, performance and security. About the application-oriented stochastic models, the widest adoption mainly concentrates on the price prediction of cryptocurrency. Moreover, we provide analysis and comparison in detail on every taxonomy and discuss the strengths and weaknesses of the related works to serve guides for further researches. Finally, challenges and future research directions are given to apply stochastic modeling approaches to study blockchain. By analyzing and classifying the existing researches, we hope that our survey can provide suggestions for the researchers who are interested in blockchain and good at using stochastic models as a tool to address problems.
EdgeLoc: An Edge-IoT Framework for Robust Indoor Localization Using Capsule Networks

With the unprecedented demand for location-based services in indoor scenarios, wireless indoor localization has become essential for mobile users. While GPS is not available at indoor spaces, WiFi RSS fingerprinting has become popular with its ubiquitous accessibility. However, it is challenging to achieve robust and efficient indoor localization with two major challenges. First, the localization accuracy can be degraded by the random signal fluctuations, which would influence conventional localization algorithms that simply learn handcrafted features from raw fingerprint data. Second, mobile users are sensitive to the localization delay, but conventional indoor localization algorithms are computation-intensive and time-consuming. In this paper, we propose EdgeLoc, an edge-IoT framework for efficient and robust indoor localization using capsule networks. We develop a deep learning model with the CapsNet to efficiently extract hierarchical information from WiFi fingerprint data, thereby significantly improving the localization accuracy. Moreover, we implement an edge-computing prototype system to achieve a nearly real-time localization process, by enabling mobile users with the deep-learning model that has been well-trained by the edge server. We conduct a real-world field experimental study with over 33,600 data points and an extensive synthetic experiment with the open dataset, and the experimental results validate the effectiveness of EdgeLoc. The best trade-off of the EdgeLoc system achieves 98.5% localization accuracy within an average positioning time of only 2.31 ms in the field experiment.
Scene-Graph Augmented Data-Driven Risk Assessment of Autonomous Vehicle Decisions

There is considerable evidence that evaluating the subjective risk level of driving decisions can improve the safety of Autonomous Driving Systems (ADS) in both typical and complex driving scenarios. In this paper, we propose a novel data-driven approach that uses scene-graphs as intermediate representations for modeling the subjective risk of driving maneuvers. Our approach includes a Multi-Relation Graph Convolution Network, a Long-Short Term Memory Network, and attention layers. To train our model, we formulate subjective risk assessment as a supervised scene classification problem. We evaluate our model on both synthetic lane-changing datasets and real-driving datasets with various driving maneuvers. We show that our approach achieves a higher classification accuracy than the state-of-the-art approach on both large (96.4% vs. 91.2%) and small (91.8% vs. 71.2%) lane-changing synthesized datasets, illustrating that our approach can learn effectively even from small datasets. We also show that our model trained on a lane-changing synthesized dataset achieves an average accuracy of 87.8% when tested on a real-driving lane-changing dataset. In comparison, the state-of-the-art model trained on the same synthesized dataset only achieved 70.3% accuracy when tested on the real-driving dataset, showing that our approach can transfer knowledge more effectively. Moreover, we demonstrate that the addition of spatial and temporal attention layers improves our model’s performance and explainability. Finally, our results illustrate that our model can assess the risk of various driving maneuvers more accurately than the state-of-the-art model (86.5% vs. 58.4%, respectively).
Beamforming Optimization for MIMO Wireless Power Transfer With Nonlinear Energy Harvesting: RF Combining Versus DC Combining

In this article, we study the multiple-input and multiple-output (MIMO) wireless power transfer (WPT) system so as to enhance the output DC power of the rectennas. To that end, we revisit the rectenna nonlinearity considering multiple receive antennas. Two combining schemes for multiple rectennas at the receiver, DC and RF combinings, are modeled and analyzed. For DC combining, we optimize the transmit beamforming, adaptive to the channel state information (CSI), so as to maximize the total output DC power. For RF combining, we compute a closed-form solution of the optimal transmit and receive beamforming. In addition, we propose a practical RF combining circuit using RF phase shifter and RF power combiner and also optimize the analog receive beamforming adaptive to CSI. We also analytically derive the scaling laws of the output DC power as a function of the number of transmit and receive antennas. Those scaling laws confirm the benefits of using multiple antennas at the transmitter or receiver. They also highlight that RF combining significantly outperforms DC combining since it leverages the rectenna nonlinearity more efficiently. Two types of performance evaluations, based on the nonlinear rectenna model and based on realistic and accurate rectenna circuit simulations, are provided. The evaluations demonstrate that the output DC power can be linearly increased by using multiple rectennas at the receiver and that the relative gain of RF combining versus DC combining in terms of the output DC power level is very significant, of the order of 240% in a one-transmit antenna ten-receive antenna setup.
Clustering of non-Gaussian data by variational Bayes for normal inverse Gaussian mixture models

Finite mixture models, typically Gaussian mixtures, are well known and widely used as model-based clustering. In practical situations, there are many non-Gaussian data that are heavy-tailed and/or asymmetric. Normal inverse Gaussian (NIG) distributions are normal-variance mean which mixing densities are inverse Gaussian distributions and can be used for both haavy-tail and asymmetry. For NIG mixture models, both expectation-maximization method and variational Bayesian (VB) algorithms have been proposed. However, the existing VB algorithm for NIG mixture have a disadvantage that the shape of the mixing density is limited. In this paper, we propose another VB algorithm for NIG mixture that improves on the shortcomings. We also propose an extension of Dirichlet process mixture models to overcome the difficulty in determining the number of clusters in finite mixture models. We evaluated the performance with artificial data and found that it outperformed Gaussian mixtures and existing implementations for NIG mixtures, especially for highly non-normative data.
Span-based Semantic Parsing for Compositional Generalization

Despite the success of sequence-to-sequence (seq2seq) models in semantic parsing, recent work has shown that they fail in compositional generalization, i.e., the ability to generalize to new structures built of components observed during training. In this work, we posit that a span-based parser should lead to better compositional generalization. we propose SpanBasedSP, a parser that predicts a span tree over an input utterance, explicitly encoding how partial programs compose over spans in the input. SpanBasedSP extends Pasupat et al. (2019) to be comparable to seq2seq models by (i) training from programs, without access to gold trees, treating trees as latent variables, (ii) parsing a class of non-projective trees through an extension to standard CKY. On GeoQuery, SCAN and CLOSURE datasets, SpanBasedSP performs similarly to strong seq2seq baselines on random splits, but dramatically improves performance compared to baselines on splits that require compositional generalization: from 61.0 → 88.9 average accuracy.
A Multisensory Learning Architecture for Rotation-invariant Object Recognition

This study presents a multisensory machine learning architecture for object recognition by employing a novel dataset that was constructed with the iCub robot, which is equipped with three cameras and a depth sensor. The proposed architecture combines convolutional neural networks to form representations (i.e., features) for grayscaled color images and a multi-layer perceptron algorithm to process depth data. To this end, we aimed to learn joint representations of different modalities (e.g., color and depth) and employ them for recognizing objects. We evaluate the performance of the proposed architecture by benchmarking the results obtained with the models trained separately with the input of different sensors and a state-of-the-art data fusion technique, namely decision level fusion. The results show that our architecture improves the recognition accuracy compared with the models that use inputs from a single modality and decision level multimodal fusion method.
Fine-tuning Pre-trained Contextual Embeddings for Citation Content Analysis in Scholarly Publication

Citation function and citation sentiment are two essential aspects of citation content analysis (CCA), which are useful for influence analysis, the recommendation of scientific publications. However, existing studies are mostly traditional machine learning methods, although deep learning techniques have also been explored, the improvement of the performance seems not significant due to insufficient training data, which brings difficulties to applications. In this paper, we propose to fine-tune pre-trained contextual embeddings ULMFiT, BERT, and XLNet for the task. Experiments on three public datasets show that our strategy outperforms all the baselines in terms of the F1 score. For citation function identification, the XLNet model achieves 87.2%, 86.90%, and 81.6% on DFKI, UMICH, and TKDE2019 datasets respectively, while it achieves 91.72% and 91.56% on DFKI and UMICH in term of citation sentiment identification. Our method can be used to enhance the influence analysis of scholars and scholarly publications.