Search

In this paper, we set out to construct a set of reference mock galaxy redshift surveys (MGRSs) for the future Chinese Space-station Survey Telescope (CSST) observation, where subsequent survey selection effects can be added and evaluated. This set of MGRSs is generated using the dark matter subhalos extracted from a high-resolution Jiutian $N$-body simulation of the standard $\Lambda$CDM cosmogony with $\Omega_m=0.3111$, $\Omega_{\Lambda}=0.6889$, and $\sigma_8=0.8102$. The simulation has a boxsize of $1~h^{-1} {\rm Gpc}$, and consists of $6144^3$ particles with mass resolution $3.723 \times 10^{8} h^{-1} M_\odot $. In order to take into account the effect of redshift evolution, we first use all 128 snapshots in the Jiutian simulation to generate a light-cone halo/subhalo catalog. Next, galaxy luminosities are assigned to the main and subhalo populations using the subhalo abundance matching (SHAM) method with the DESI $z$-band luminosity functions at different redshifts. Multi-band photometries, as well as images, are then assigned to each mock galaxy using a 3-dimensional parameter space nearest neighbor sampling of the DESI LS observational galaxies and groups. Finally, the CSST and DESI LS survey geometry and magnitude limit cuts are applied to generate the required MGRSs. As we have checked, this set of MGRSs can generally reproduce the observed galaxy luminosity/mass functions within 0.1 dex for galaxies with $L > 10^8 L_\odot$ (or $M_* > 10^{8.5} M_\odot$) and within 1-$\sigma$ level for galaxies with $L < 10^8L_\odot$ (or $M_* < 10^{8.5} M_\odot$). Together with the CSST slitless spectra and redshifts for our DESI LS seed galaxies that are under construction, we will set out to test various slitless observational selection effects in subsequent probes., Comment: 13 pages, 9 figures, accepted for publication in MNRAS

Linear programming (LP) problems are pervasive in real-life applications. However, despite their apparent simplicity, an untrained user may find it difficult to determine the linear model of their specific problem. We envisage the creation of a goal-oriented conversational agent that will engage in conversation with the user to elicit all information required so that a subsequent agent can generate the linear model. In this paper, we present an approach for the generation of sample dialogues that can be used to develop and train such a conversational agent. Using prompt engineering, we develop two agents that "talk" to each other, one acting as the conversational agent, and the other acting as the user. Using a set of text descriptions of linear problems from NL4Opt available to the user only, the agent and the user engage in conversation until the agent has retrieved all key information from the original problem description. We also propose an extrinsic evaluation of the dialogues by assessing how well the summaries generated by the dialogues match the original problem descriptions. We conduct human and automatic evaluations, including an evaluation approach that uses GPT-4 to mimic the human evaluation metrics. The evaluation results show an overall good quality of the dialogues, though research is still needed to improve the quality of the GPT-4 evaluation metrics. The resulting dialogues, including the human annotations of a subset, are available to the research community. The conversational agent used for the generation of the dialogues can be used as a baseline., Comment: GEM Workshop @ EMNLP 2023

It is an interesting question Can and How Large Language Models (LLMs) understand non-language network data, and help us detect unknown malicious flows. This paper takes Carpet Bombing as a case study and shows how to exploit LLMs' powerful capability in the networking area. Carpet Bombing is a new DDoS attack that has dramatically increased in recent years, significantly threatening network infrastructures. It targets multiple victim IPs within subnets, causing congestion on access links and disrupting network services for a vast number of users. Characterized by low-rates, multi-vectors, these attacks challenge traditional DDoS defenses. We propose DoLLM, a DDoS detection model utilizes open-source LLMs as backbone. By reorganizing non-contextual network flows into Flow-Sequences and projecting them into LLMs semantic space as token embeddings, DoLLM leverages LLMs' contextual understanding to extract flow representations in overall network context. The representations are used to improve the DDoS detection performance. We evaluate DoLLM with public datasets CIC-DDoS2019 and real NetFlow trace from Top-3 countrywide ISP. The tests have proven that DoLLM possesses strong detection capabilities. Its F1 score increased by up to 33.3% in zero-shot scenarios and by at least 20.6% in real ISP traces.

We use the eROSITA Final Equatorial-Depth Survey (eFEDS) to measure the rest-frame 0.1-2.4 keV band X-ray luminosities of $\sim$ 600,000 DESI groups using two different algorithms in the overlap region of the two observations. These groups span a large redshift range of $0.0 \le z_g \le 1.0$ and group mass range of $10^{10.76}h^{-1}M_{\odot} \le M_h \le 10^{15.0}h^{-1}M_{\odot}$. (1) Using the blind detection pipeline of eFEDS, we find that 10932 X-ray emission peaks can be cross matched with our groups, $\sim 38 \%$ of which have signal-to-noise ratio $\rm{S}/\rm{N} \geq 3$ in X-ray detection. Comparing to the numbers reported in previous studies, this matched sample size is a factor of $\sim 6$ larger. (2) By stacking X-ray maps around groups with similar masses and redshifts, we measure the average X-ray luminosity of groups as a function of halo mass in five redshift bins. We find, in a wide halo mass range, the X-ray luminosity, $L_{\rm X}$, is roughly linearly proportional to $M_{h}$, and is quite independent to the redshift of the groups. (3) We use a Poisson distribution to model the X-ray luminosities obtained using two different algorithms and obtain best-fit $L_{\rm X}=10^{28.46\pm0.03}M_{h}^{1.024\pm0.002}$ and $L_{\rm X}=10^{26.73 \pm 0.04}M_{h}^{1.140 \pm 0.003}$ scaling relations, respectively. The best-fit slopes are flatter than the results previously obtained, but closer to a self-similar prediction., Comment: 15 pages, 13 figures, Monthly Notices of the Royal Astronomical Society, Volume 523, Issue 4, pp.4909-4922

Herein, we present a deep-learning technique for reconstructing the dark-matter density field from the redshift-space distribution of dark-matter halos. We built a UNet-architecture neural network and trained it using the COmoving Lagrangian Acceleration fast simulation, which is an approximation of the N-body simulation with $512^3$ particles in a box size of 500 Mpc $h^{-1}$. Further, we tested the resulting UNet model not only with training-like test samples but also with standard N-body simulations, such as the Jiutian simulation with $6144^3$ particles in a box size of 1000 Mpc $h^{-1}$ and the ELUCID simulation, which has a different cosmology. The real-space dark-matter density fields in the three simulations can be reconstructed reliably with only a small reduction of the cross-correlation power spectrum at 1% and 10% levels at $k=0.1$ and $0.3~h\mathrm{Mpc^{-1}}$, respectively. The reconstruction clearly helps to correct for redshift-space distortions and is unaffected by the different cosmologies between the training (Planck2018) and test samples (WMAP5). Furthermore, we tested the application of the UNet-reconstructed density field to obtain the velocity \& tidal field and found that this approach provides better results compared to the traditional approach based on the linear bias model, showing a 12.2% improvement in the correlation slope and a 21.1% reduction in the scatter between the predicted and true velocities. Thus, our method is highly efficient and has excellent extrapolation reliability beyond the training set. This provides an ideal solution for determining the three-dimensional underlying density field from the plentiful galaxy survey data., Comment: 14 pages, 16 figures

The distribution of baryons provides a significant way to understand the formation of galaxy clusters by revealing the details of its internal structure and changes over time. In this paper, we present theoretical studies on the scaled profiles of physical properties associated with the baryonic components, including gas density, temperature, metallicity, pressure and entropy as well as stellar mass, metallicity and satellite galaxy number density in galaxy clusters from $z=4$ to $z=0$ by tracking their progenitors. These mass-complete simulated galaxy clusters are coming from THE THREE HUNDRED with two runs: GIZMO-SIMBA and Gadget-X. Through comparisons between the two simulations, and with observed profiles which are generally available at low redshift, we find that (1) the agreements between the two runs and observations are mostly at outer radii $r \gtrsim 0.3r_{500}$, in line with the self-similarity assumption. While Gadget-X shows better agreements with the observed gas profiles in the central regions compared to GIZMO-SIMBA; (2) the evolution trends are generally consistent between the two simulations with slightly better consistency at outer radii. In detail, the gas density profile shows less discrepancy than the temperature and entropy profiles at high redshift. The differences in the cluster centre and gas properties imply different behaviours of the AGN models between Gadget-X and GIZMO-SIMBA, with the latter, maybe too strong for this cluster simulation. The high-redshift difference may be caused by the star formation and feedback models or hydrodynamics treatment, which requires observation constraints and understanding., Comment: 20 pages, 20 figures, accepted in MNRAS

The Sunyaev Zel'dovich (SZ) effect is sensitive to the pressure of ionized gas inside galaxy clusters, which is in turn controlled largely by the gravitational potential of the cluster. Changing the concentration parameter describing the cluster mass distribution impacts the gravitational potential and thus the cluster SZ signal, with implications for cosmological and other analyses of SZ-selected clusters. We investigate the concentration-SZ relation in theory and simulations. We find that the impact of concentration on the inner SZ profile ($R \lesssim 0.75 R_{200c}$) can be captured with standard polytropic gas models. However, we find that such models do a poor job of reproducing the outer SZ profiles ($R \gtrsim 0.75 R_{200c}$) and the relation between the integrated SZ signal, $Y$, and concentration. This disagreement results from a sharp truncation of the gas pressure profile near the splashback radius, likely caused by virial shocks. We develop a simple description of the truncation that leads to a good match with the simulated SZ profiles out to several $R_{200c}$ for clusters of varying mass and concentration, and that also accurately predicts the concentration-$Y$ relationship. Finally, we determine how inference of the linear bias parameter and splashback radius for SZ-selected clusters can be biased by ignoring the concentration dependence of the SZ signal, finding that bias to the former is essentially negligible, while bias to the latter can be as much as 2\%., Comment: 16 pages, 11 figures; replaced to match version accepted by MNRAS. Revised version uses an updated model for nonthermal pressure support, but conclusions are not impacted

The star formation and quenching of central galaxies are regulated by the assembly histories of their host halos. In this work, we use the central stellar mass to halo mass ratio as a proxy of halo formation time, and we devise three different models, from the physical hydrodynamical simulation to the empirical statistical model, to demonstrate its robustness. With this proxy, we inferred the dependence of the central galaxy properties on the formation time of their host halos using the SDSS main galaxy sample, where central galaxies are identified with the halo-based group finder. We found that central galaxies living in late-formed halos have higher quiescent fractions and lower spiral fractions than their early-formed counterparts by $\lesssim$ 8%. Finally, we demonstrate that the group finding algorithm has a negligible impact on our results., Comment: 14 pages, 7 + 5 figures, MNRAS 522, 3188

Long-term user engagement (LTE) optimization in sequential recommender systems (SRS) is shown to be suited by reinforcement learning (RL) which finds a policy to maximize long-term rewards. Meanwhile, RL has its shortcomings, particularly requiring a large number of online samples for exploration, which is risky in real-world applications. One of the appealing ways to avoid the risk is to build a simulator and learn the optimal recommendation policy in the simulator. In LTE optimization, the simulator is to simulate multiple users' daily feedback for given recommendations. However, building a user simulator with no reality-gap, i.e., can predict user's feedback exactly, is unrealistic because the users' reaction patterns are complex and historical logs for each user are limited, which might mislead the simulator-based recommendation policy. In this paper, we present a practical simulator-based recommender policy training approach, Simulation-to-Recommendation (Sim2Rec) to handle the reality-gap problem for LTE optimization. Specifically, Sim2Rec introduces a simulator set to generate various possibilities of user behavior patterns, then trains an environment-parameter extractor to recognize users' behavior patterns in the simulators. Finally, a context-aware policy is trained to make the optimal decisions on all of the variants of the users based on the inferred environment-parameters. The policy is transferable to unseen environments (e.g., the real world) directly as it has learned to recognize all various user behavior patterns and to make the correct decisions based on the inferred environment-parameters. Experiments are conducted in synthetic environments and a real-world large-scale ride-hailing platform, DidiChuxing. The results show that Sim2Rec achieves significant performance improvement, and produces robust recommendations in unseen environments.

In this investigation, we leverage the combination of Dark Energy Spectroscopic Instrument Legacy imaging Surveys Data Release 9 (DESI LS DR9), Survey Validation 3 (SV3), and Year 1 (Y1) data sets to estimate the conditional luminosity and stellar mass functions (CLFs & CSMFs) of galaxies across various halo mass bins and redshift ranges. To support our analysis, we utilize a realistic DESI Mock Galaxy Redshift Survey (MGRS) generated from a high-resolution Jiutian simulation. An extended halo-based group finder is applied to both MGRS catalogs and DESI observation. By comparing the r and z-band luminosity functions (LFs) and stellar mass functions (SMFs) derived using both photometric and spectroscopic data, we quantified the impact of photometric redshift (photo-z) errors on the galaxy LFs and SMFs, especially in the low redshift bin at low luminosity/mass end. By conducting prior evaluations of the group finder using MGRS, we successfully obtain a set of CLF and CSMF measurements from observational data. We find that at low redshift the faint end slopes of CLFs and CSMFs below $10^{9}h^{-2}L_{sun}$ (or $h^{-2}M_{sun}$) evince a compelling concordance with the subhalo mass functions. After correcting the cosmic variance effect of our local Universe following arXiv:1809.00523, the faint end slopes of the LFs/SMFs turn out to be also in good agreement with the slope of the halo mass function., Comment: 24 pages, 12 figures, Submitted to ApJ

The Conditional Colour-Magnitude Distribution (CCMD) is a comprehensive formalism of the colour-magnitude-halo mass relation of galaxies. With joint modelling of a large sample of SDSS galaxies in fine bins of galaxy colour and luminosity, Xu et al. (2018) inferred parameters of a CCMD model that well reproduces colour- and luminosity-dependent abundance and clustering of present-day galaxies. In this work, we provide a test and investigation of the CCMD model by studying the colour and luminosity distribution of galaxies in galaxy groups. An apples-to-apples comparison of group galaxies is achieved by applying the same galaxy group finder to identify groups from the CCMD galaxy mocks and from the SDSS data, avoiding any systematic effect of group finding and mass assignment on the comparison. We find an overall nice agreement in the conditional luminosity function (CLF), the conditional colour function (CCF), and the CCMD of galaxies in galaxy groups inferred from CCMD mock and SDSS data. We also discuss the subtle differences revealed by the comparison. In addition, using two external catalogues constructed to only include central galaxies with halo mass measured through weak lensing, we find that their colour-magnitude distribution shows two distinct and orthogonal components, in line with the prediction of the CCMD model. Our results suggest that the CCMD model provides a good description of halo mass dependent galaxy colour and luminosity distribution. The halo and CCMD mock catalogues are made publicly available to facilitate other investigations., Comment: 11+6 pages, 6 + 7 figures, submitted to MNRAS, Comments welcome! The halo catalogues and CCMD mocks are publicly available at https://www.astro.utah.edu/~zhengzheng/data.html

Although chain-of-thought (CoT) prompting combined with language models has achieved encouraging results on complex reasoning tasks, the naive greedy decoding used in CoT prompting usually causes the repetitiveness and local optimality. To address this shortcoming, ensemble-optimization tries to obtain multiple reasoning paths to get the final answer assembly. However, current ensemble-optimization methods either simply employ rule-based post-processing such as \textit{self-consistency}, or train an additional model based on several task-related human annotations to select the best one among multiple reasoning paths, yet fail to generalize to realistic settings where the type of input questions is unknown or the answer format of reasoning paths is unknown. To avoid their limitations, we propose \textbf{Self-Agreement}, a generalizable ensemble-optimization method applying in almost all scenarios where the type of input questions and the answer format of reasoning paths may be known or unknown. Self-agreement firstly samples from language model's decoder to generate a \textit{diverse} set of reasoning paths, and subsequently prompts the language model \textit{one more time} to determine the optimal answer by selecting the most \textit{agreed} answer among the sampled reasoning paths. Self-agreement simultaneously achieves remarkable performance on six public reasoning benchmarks and superior generalization capabilities., Comment: Accepted by Findings of ACL 2024

As global attention on renewable and clean energy grows, the research and implementation of microgrids become paramount. This paper delves into the methodology of exploring the relationship between the operational and environmental costs of microgrids through multi-objective optimization models. By integrating various optimization algorithms like Genetic Algorithm, Simulated Annealing, Ant Colony Optimization, and Particle Swarm Optimization, we propose an integrated approach for microgrid optimization. Simulation results depict that these algorithms provide different dispatch results under economic and environmental dispatch, revealing distinct roles of diesel generators and micro gas turbines in microgrids. Overall, this study offers in-depth insights and practical guidance for microgrid design and operation., Comment: 11 pages, 6 fiures

In this paper, the limitations of YOLOv5s model on small target detection task are deeply studied and improved. The performance of the model is successfully enhanced by introducing GhostNet-based convolutional module, RepGFPN-based Neck module optimization, CA and Transformer's attention mechanism, and loss function improvement using NWD. The experimental results validate the positive impact of these improvement strategies on model precision, recall and mAP. In particular, the improved model shows significant superiority in dealing with complex backgrounds and tiny targets in real-world application tests. This study provides an effective optimization strategy for the YOLOv5s model on small target detection, and lays a solid foundation for future related research and applications., Comment: 8 pages 10 figures

We investigate the importances of various dynamical features in predicting the dynamical state (DS) of galaxy clusters, based on the Random Forest (RF) machine learning approach. We use a large sample of galaxy clusters from the Three Hundred Project of hydrodynamical zoomed-in simulations, and construct dynamical features from the raw data as well as from the corresponding mock maps in the optical, X-ray, and Sunyaev-Zel'dovich (SZ) channels. Instead of relying on the impurity based feature importance of the RF algorithm, we directly use the out-of-bag (OOB) scores to evaluate the importances of individual features and different feature combinations. Among all the features studied, we find the virial ratio, $\eta$, to be the most important single feature. The features calculated directly from the simulations and in 3-dimensions carry more information on the DS than those constructed from the mock maps. Compared with the features based on X-ray or SZ maps, features related to the centroid positions are more important. Despite the large number of investigated features, a combination of up to three features of different types can already saturate the score of the prediction. Lastly, we show that the most sensitive feature $\eta$ is strongly correlated with the well-known half-mass bias in dynamical modelling. Without a selection in DS, cluster halos have an asymmetric distribution in $\eta$, corresponding to an overall positive half-mass bias. Our work provides a quantitative reference for selecting the best features to discriminate the DS of galaxy clusters in both simulations and observations., Comment: 14 pages, 9 figures, submitted to MNRAS

We introduce \textsc{Gizmo-Simba}, a new suite of galaxy cluster simulations within \textsc{The Three Hundred} project. \textsc{The Three Hundred} consists of zoom re-simulations of 324 clusters with $M_{200}\gtrsim 10^{14.8}M_\odot$ drawn from the MultiDark-Planck $N$-body simulation, run using several hydrodynamic and semi-analytic codes. The \textsc{Gizmo-Simba} suite adds a state-of-the-art galaxy formation model based on the highly successful {\sc Simba} simulation, mildly re-calibrated to match $z=0$ cluster stellar properties. Comparing to \textsc{The Three Hundred} zooms run with \textsc{Gadget-X}, we find intrinsic differences in the evolution of the stellar and gas mass fractions, BCG ages, and galaxy colour-magnitude diagrams, with \textsc{Gizmo-Simba} generally providing a good match to available data at $z \approx 0$. \textsc{Gizmo-Simba}'s unique black hole growth and feedback model yields agreement with the observed BH scaling relations at the intermediate-mass range and predicts a slightly different slope at high masses where few observations currently lie. \textsc{Gizmo-Simba} provides a new and novel platform to elucidate the co-evolution of galaxies, gas, and black holes within the densest cosmic environments., Comment: 19 pages, 11 figures, MNRAS submitted, comments are welcome

Current mainstream object detection methods for large aerial images usually divide large images into patches and then exhaustively detect the objects of interest on all patches, no matter whether there exist objects or not. This paradigm, although effective, is inefficient because the detectors have to go through all patches, severely hindering the inference speed. This paper presents an Objectness Activation Network (OAN) to help detectors focus on fewer patches but achieve more efficient inference and more accurate results, enabling a simple and effective solution to object detection in large images. In brief, OAN is a light fully-convolutional network for judging whether each patch contains objects or not, which can be easily integrated into many object detectors and jointly trained with them end-to-end. We extensively evaluate our OAN with five advanced detectors. Using OAN, all five detectors acquire more than 30.0% speed-up on three large-scale aerial image datasets, meanwhile with consistent accuracy improvements. On extremely large Gaofen-2 images (29200$\times$27620 pixels), our OAN improves the detection speed by 70.5%. Moreover, we extend our OAN to driving-scene object detection and 4K video object detection, boosting the detection speed by 112.1% and 75.0%, respectively, without sacrificing the accuracy. Code is available at https://github.com/Ranchosky/OAN., Comment: This manuscript is the accepted version for SCIENCE CHINA Information Sciences

A fundamental question in any peer-to-peer ride-sharing system is how to, both effectively and efficiently, meet the request of passengers to balance the supply and demand in real time. On the passenger side, traditional approaches focus on pricing strategies by increasing the probability of users' call to adjust the distribution of demand. However, previous methods do not take into account the impact of changes in strategy on future supply and demand changes, which means drivers are repositioned to different destinations due to passengers' calls, which will affect the driver's income for a period of time in the future. Motivated by this observation, we make an attempt to optimize the distribution of demand to handle this problem by learning the long-term spatio-temporal values as a guideline for pricing strategy. In this study, we propose an offline deep reinforcement learning based method focusing on the demand side to improve the utilization of transportation resources and customer satisfaction. We adopt a spatio-temporal learning method to learn the value of different time and location, then incentivize the ride requests of passengers to adjust the distribution of demand to balance the supply and demand in the system. In particular, we model the problem as a Markov Decision Process (MDP).

OBJECTIVES: We engineered a CRISPR interference (CRISPRi) system targeting the AcrAB-TolC efflux pump to prevent MDR development in Escherichia coli. METHODS: Nine specific single-guide RNAs (sgRNAs) were designed to target the components of the AcrAB-TolC efflux pump, namely AcrA, AcrB and TolC. A total of thirteen CRISPRi recombinant plasmids were constructed with single or clustered sgRNAs. The transcriptional levels of the target genes, MICs of multiple antibiotics and biofilm formation in each CRISPRi strain were tested. RESULTS: The CRISPRi system expressing sgRNA clusters targeting acrB and tolC simultaneously exhibited the highest inhibitory effect on AcrAB-TolC efflux pump activity in E. coli HB101, with 78.3%, 90.0% and 65.4% inhibition rates on the transcriptional levels of acrA, acrB and tolC, respectively. The CRISPRi system resulted in ∼2-, ∼8- and 16-fold increased susceptibility to rifampicin, erythromycin and tetracycline, respectively. In addition, the constructed CRISPRi system reduced biofilm formation with inhibition rates in the range of 11.2% to 58.2%. CONCLUSIONS: To the best of our knowledge, this is the first report on the construction of an inducible CRISPRi system targeting the AcrAB-TolC efflux pump to prevent MDR development in E. coli. This study provides insights for future regulation and manipulation of AcrAB-TolC activity and bacterial MDR by a CRISPRi system.

Based on a large group/cluster catalog recently constructed from the DESI Legacy Imaging Surveys DR9 using an extended halo-based group finder, we measure and model the group-galaxy weak lensing signals for groups/clusters in a few redshift bins within redshift range $0.1 \leqslant z<0.6$. Here, the background shear signals are obtained based on the DECaLS survey shape catalog derived with the \textsc{Fourier\_Quad} method. We divide the lens samples into 5 equispaced redshift bins and 7 mass bins, which allow us to probe the redshift and mass dependence of the lensing signals and hence the resulting halo properties. In addition to these sample selections, we have also checked the signals around different group centers, e.g., brightest central galaxy (BCG), luminosity weighted center and number weighted center. We use a lensing model that includes off-centering to describe the lensing signals we measure for all mass and redshift bins. The results demonstrate that our model predictions for the halo masses, bias and concentrations are stable and self-consistent among different samples for different group centers. Taking advantage of the very large and complete sample of groups/clusters, as well as the reliable estimation of their halo masses, we provide measurements of the cumulative halo mass functions up to redshift $z=0.6$, with a mass precision at $0.03\sim0.09$ dex., Comment: revised version submitted to ApJ

Using the extended halo-based group finder developed by Yang et al. (2021), which is able to deal with galaxies via spectroscopic and photometric redshifts simultaneously, we construct galaxy group and candidate protocluster catalogs in a wide redshift range ($0 < z < 6$) from the joint CFHT Large Area $U$-band Deep Survey (CLAUDS) and Hyper Suprime-Cam Subaru Strategic Program (HSC-SSP) deep data set. Based on a selection of 5,607,052 galaxies with $i$-band magnitude $m_{i} < 26$ and a sky coverage of $34.41\ {\rm deg}^2$, we identify a total of 2,232,134 groups, within which 402,947 groups have at least three member galaxies. We have visually checked and discussed the general properties of those richest groups at redshift $z>2.0$. By checking the galaxy number distributions within a $5-7\ h^{-1}\mathrm{Mpc}$ projected separation and a redshift difference $\Delta z \le 0.1$ around those richest groups at redshift $z>2$, we identified a list of 761, 343 and 43 protocluster candidates in the redshift bins $2\leq z<3$, $3\leq z<4$ and $z \geq 4$, respectively. In general, these catalogs of galaxy groups and protocluster candidates will provide useful environmental information in probing galaxy evolution along the cosmic time., Comment: 25 pages, 16 figures, 2 tables, accepted for publication in ApJ

We investigate the importances of various dynamical features in predicting the dynamical state (DS) of galaxy clusters, based on the Random Forest (RF) machine learning approach. We use a large sample of galaxy clusters from the Three Hundred Project of hydrodynamical zoomed-in simulations, and construct dynamical features from the raw data as well as from the corresponding mock maps in the optical, X-ray, and Sunyaev-Zel'dovich (SZ) channels. Instead of relying on the impurity based feature importance of the RF algorithm, we directly use the out-of-bag (OOB) scores to evaluate the importances of individual features and different feature combinations. Among all the features studied, we find the virial ratio, $\eta$, to be the most important single feature. The features calculated directly from the simulations and in 3-dimensions carry more information on the DS than those constructed from the mock maps. Compared with the features based on X-ray or SZ maps, features related to the centroid positions are more important. Despite the large number of investigated features, a combination of up to three features of different types can already saturate the score of the prediction. Lastly, we show that the most sensitive feature $\eta$ is strongly correlated with the well-known half-mass bias in dynamical modelling. Without a selection in DS, cluster halos have an asymmetric distribution in $\eta$, corresponding to an overall positive half-mass bias. Our work provides a quantitative reference for selecting the best features to discriminate the DS of galaxy clusters in both simulations and observations., Comment: 15 pages, 9 figures, Accepted for publication in MNRAS

We introduce \textsc{Gizmo-Simba}, a new suite of galaxy cluster simulations within \textsc{The Three Hundred} project. \textsc{The Three Hundred} consists of zoom re-simulations of 324 clusters with $M_{200}\gtrsim 10^{14.8}M_\odot$ drawn from the MultiDark-Planck $N$-body simulation, run using several hydrodynamic and semi-analytic codes. The \textsc{Gizmo-Simba} suite adds a state-of-the-art galaxy formation model based on the highly successful {\sc Simba} simulation, mildly re-calibrated to match $z=0$ cluster stellar properties. Comparing to \textsc{The Three Hundred} zooms run with \textsc{Gadget-X}, we find intrinsic differences in the evolution of the stellar and gas mass fractions, BCG ages, and galaxy colour-magnitude diagrams, with \textsc{Gizmo-Simba} generally providing a good match to available data at $z \approx 0$. \textsc{Gizmo-Simba}'s unique black hole growth and feedback model yields agreement with the observed BH scaling relations at the intermediate-mass range and predicts a slightly different slope at high masses where few observations currently lie. \textsc{Gizmo-Simba} provides a new and novel platform to elucidate the co-evolution of galaxies, gas, and black holes within the densest cosmic environments., Comment: 20 pages, 12 figures, matched to published version in MNRAS

In recent years, there are a small but increasing number of personal informatics studies conducted in family settings. Most of these studies were conducted between adult parents and minor children. However, it is unclear how introducing fitness tracking into an intergenerational family influences individual exercise behaviors and family interactions. I address this gap through a mixed-method study based on the usage of WeRun, a fitness data sharing plugin embedded in the pervasive social networking app WeChat, with eight intergenerational families. This study finds that family tracking motivated participants to engage in physical exercise and family interaction. Nevertheless, family members were concern about potential privacy and independence issues. They also worried about the potential health issues resulting from becoming motivated to exercise beyond an appropriate level. This study demonstrates the unique challenges when designing to support fitness tracking for intergenerational families. This study advances the understanding of the influence of family tracking on different generations.

In recent years, there are a small but increasing number of personal informatics studies conducted in family settings. Most of these studies were conducted between adult parents and minor children. However, it is unclear how introducing fitness tracking into an intergenerational family influences individual exercise behaviors and family interactions. I address this gap through a mixed-method study based on the usage of WeRun, a fitness data sharing plugin embedded in the pervasive social networking app WeChat, with eight intergenerational families. This study finds that family tracking motivated participants to engage in physical exercise and family interaction. Nevertheless, family members were concern about potential privacy and independence issues. They also worried about the potential health issues resulting from becoming motivated to exercise beyond an appropriate level. This study demonstrates the unique challenges when designing to support fitness tracking for intergenerational families. This study advances the understanding of the influence of family tracking on different generations.

Using hydrodynamical simulations, we study how well the underlying gravitational potential of a galaxy cluster can be modelled dynamically with different types of tracers. In order to segregate different systematics and the effects of varying estimator performances, we first focus on applying a generic minimal assumption method (oPDF) to model the simulated haloes using the full 6-D phasespace information. We show that the halo mass and concentration can be recovered in an ensemble unbiased way, with a stochastic bias that varies from halo to halo, mostly reflecting deviations from steady state in the tracer distribution. The typical systematic uncertainty is $\sim 0.17$ dex in the virial mass and $\sim 0.17$ dex in the concentration as well when dark matter particles are used as tracers. The dynamical state of satellite galaxies are close to that of dark matter particles, while intracluster stars are less in a steady state, resulting in a $\sim$ 0.26 dex systematic uncertainty in mass. Compared with galactic haloes hosting Milky-Way-like galaxies, cluster haloes show a larger stochastic bias in the recovered mass profiles. We also test the accuracy of using intracluster gas as a dynamical tracer modelled through a generalised hydrostatic equilibrium equation, and find a comparable systematic uncertainty in the estimated mass to that using dark matter. Lastly, we demonstrate that our conclusions are largely applicable to other steady-state dynamical models including the spherical Jeans equation, by quantitatively segregating their statistical efficiencies and robustness to systematics. We also estimate the limiting number of tracers that leads to the systematics-dominated regime in each case., Comment: 16 pages, 13 figures, accepted for publication in MNRAS

We propose a random forest (RF) machine learning approach to determine the accreted stellar mass fractions ($f_\mathrm{acc}$) of central galaxies, based on various dark matter halo and galaxy features. The RF is trained and tested using 2,710 galaxies with stellar mass $\log_{10}M_\ast/M_\odot>10.16$ from the TNG100 simulation. Galaxy size is the most important individual feature when calculated in 3-dimensions, which becomes less important after accounting for observational effects. For smaller galaxies, the rankings for features related to merger histories increase. When an entire set of halo and galaxy features are used, the prediction is almost unbiased, with root-mean-square error (RMSE) of $\sim$0.068. A combination of up to three features with different types (galaxy size, merger history and morphology) already saturates the power of prediction. If using observable features, the RMSE increases to $\sim$0.104, and a combined usage of stellar mass, galaxy size plus galaxy concentration achieves similar predictions. Lastly, when using galaxy density, velocity and velocity dispersion profiles as features, which approximately represent the maximum amount of information extracted from galaxy images and velocity maps, the prediction is not improved much. Hence the limiting precision of predicting $f_\mathrm{acc}$ is $\sim$0.1 with observables, and the multi-component decomposition of galaxy images should have similar or larger uncertainties. If the central black hole mass and the spin parameter of galaxies can be accurately measured in future observations, the RMSE is promising to be further decreased by $\sim$20%., Comment: accepted by MNRAS

Using hydrodynamical simulations, we study how well the underlying gravitational potential of a galaxy cluster can be modelled dynamically with different types of tracers. In order to segregate different systematics and the effects of varying estimator performances, we first focus on applying a generic minimal assumption method (oPDF) to model the simulated haloes using the full 6-D phasespace information. We show that the halo mass and concentration can be recovered in an ensemble unbiased way, with a stochastic bias that varies from halo to halo, mostly reflecting deviations from steady state in the tracer distribution. The typical systematic uncertainty is $\sim 0.17$ dex in the virial mass and $\sim 0.17$ dex in the concentration as well when dark matter particles are used as tracers. The dynamical state of satellite galaxies are close to that of dark matter particles, while intracluster stars are less in a steady state, resulting in a $\sim$ 0.26 dex systematic uncertainty in mass. Compared with galactic haloes hosting Milky-Way-like galaxies, cluster haloes show a larger stochastic bias in the recovered mass profiles. We also test the accuracy of using intracluster gas as a dynamical tracer modelled through a generalised hydrostatic equilibrium equation, and find a comparable systematic uncertainty in the estimated mass to that using dark matter. Lastly, we demonstrate that our conclusions are largely applicable to other steady-state dynamical models including the spherical Jeans equation, by quantitatively segregating their statistical efficiencies and robustness to systematics. We also estimate the limiting number of tracers that leads to the systematics-dominated regime in each case., Comment: 16 pages, 13 figures, accepted for publication in MNRAS

Identity recognition plays an important role in ensuring security in our daily life. Biometric-based (especially activity-based) approaches are favored due to their fidelity, universality, and resilience. However, most existing machine learning-based approaches rely on a traditional workflow where models are usually trained once for all, with limited involvement from end-users in the process and neglecting the dynamic nature of the learning process. This makes the models static and can not be updated in time, which usually leads to high false positive or false negative. Thus, in practice, an expert is desired to assist with providing high-quality observations and interpretation of model outputs. It is expedient to combine both advantages of human experts and the computational capability of computers to create a tight-coupling incremental learning process for better performance. In this study, we develop RLTIR, an interactive identity recognition approach based on reinforcement learning, to adjust the identification model by human guidance. We first build a base tree-structured identity recognition model. And an expert is introduced in the model for giving feedback upon model outputs. Then, the model is updated according to strategies that are automatically learned under a designated reinforcement learning framework. To the best of our knowledge, it is the very first attempt to combine human expert knowledge with model learning in the area of identity recognition. The experimental results show that the reinforced interactive identity recognition framework outperforms baseline methods with regard to recognition accuracy and robustness.

The research community on the study and design of systems for personal informatics has grown over the past decade. To take stock of what the topics the field has studied and methods the field has used, we map and label 523 publications from ACM's library, IEEE Xplore, and PubMed. We surface that the literature has focused on studying and designing for health and wellness domains, an emphasis on understanding and overcoming barriers to data collection and reflection, and progressively fewer contributions involving artifacts being made. Our mapping review suggests directions future research could explore, such as identifying and resolving barriers to tracking stages beyond collection and reflection, engaging more with domain experts, and further discussing the privacy and ethical concerns around tracked data.

Using the catalogues of galaxy clusters from The Three Hundred project, modelled with both hydrodynamic simulations, (Gadget-X and Gadget-MUSIC), and semi-analytic models (SAMs), we study the scatter and self-similarity of the profiles and distributions of the baryonic components of the clusters: the stellar and gas mass, metallicity, the stellar age, gas temperature, and the (specific) star formation rate. Through comparisons with observational results, we find that the shape and the scatter of the gas density profiles matches well the observed trends including the reduced scatter at large radii which is a signature of self-similarity suggested in previous studies. One of our simulated sets, Gadget-X, reproduces well the shape of the observed temperature profile, while Gadget-MUSIC has a higher and flatter profile in the cluster centre and a lower and steeper profile at large radii. The gas metallicity profiles from both simulation sets, despite following the observed trend, have a relatively lower normalisation. The cumulative stellar density profiles from SAMs are in better agreement with the observed result than both hydrodynamic simulations which show relatively higher profiles. The scatter in these physical profiles, especially in the cluster centre region, shows a dependence on the cluster dynamical state and on the cool-core/non-cool-core dichotomy. The stellar age, metallicity and (s)SFR show very large scatter, which are then presented in 2D maps. We also do not find any clear radial dependence of these properties. However, the brightest central galaxies have distinguishable features compared to the properties of the satellite galaxies., Comment: 20 pages, 18 figures

We extend the halo-based group finder developed by \citet[][]{Yang2005a} to use data {\it simultaneously} with either photometric or spectroscopic redshifts. A mock galaxy redshift survey constructed from a high-resolution N-body simulation is used to evaluate the performance of this extended group finder. For galaxies with magnitude ${\rm z\le 21}$ and redshift $0

Using the catalogues of galaxy clusters from The Three Hundred project, modelled with both hydrodynamic simulations, (Gadget-X and Gadget-MUSIC), and semi-analytic models (SAMs), we study the scatter and self-similarity of the profiles and distributions of the baryonic components of the clusters: the stellar and gas mass, metallicity, the stellar age, gas temperature, and the (specific) star formation rate. Through comparisons with observational results, we find that the shape and the scatter of the gas density profiles matches well the observed trends including the reduced scatter at large radii which is a signature of self-similarity suggested in previous studies. One of our simulated sets, Gadget-X, reproduces well the shape of the observed temperature profile, while Gadget-MUSIC has a higher and flatter profile in the cluster centre and a lower and steeper profile at large radii. The gas metallicity profiles from both simulation sets, despite following the observed trend, have a relatively lower normalisation. The cumulative stellar density profiles from SAMs are in better agreement with the observed result than both hydrodynamic simulations which show relatively higher profiles. The scatter in these physical profiles, especially in the cluster centre region, shows a dependence on the cluster dynamical state and on the cool-core/non-cool-core dichotomy. The stellar age, metallicity and (s)SFR show very large scatter, which are then presented in 2D maps. We also do not find any clear radial dependence of these properties. However, the brightest central galaxies have distinguishable features compared to the properties of the satellite galaxies., Comment: 20 pages, 18 figures

Contextual multi-armed bandit (MAB) achieves cutting-edge performance on a variety of problems. When it comes to real-world scenarios such as recommendation system and online advertising, however, it is essential to consider the resource consumption of exploration. In practice, there is typically non-zero cost associated with executing a recommendation (arm) in the environment, and hence, the policy should be learned with a fixed exploration cost constraint. It is challenging to learn a global optimal policy directly, since it is a NP-hard problem and significantly complicates the exploration and exploitation trade-off of bandit algorithms. Existing approaches focus on solving the problems by adopting the greedy policy which estimates the expected rewards and costs and uses a greedy selection based on each arm's expected reward/cost ratio using historical observation until the exploration resource is exhausted. However, existing methods are hard to extend to infinite time horizon, since the learning process will be terminated when there is no more resource. In this paper, we propose a hierarchical adaptive contextual bandit method (HATCH) to conduct the policy learning of contextual bandits with a budget constraint. HATCH adopts an adaptive method to allocate the exploration resource based on the remaining resource/time and the estimation of reward distribution among different user contexts. In addition, we utilize full of contextual feature information to find the best personalized recommendation. Finally, in order to prove the theoretical guarantee, we present a regret bound analysis and prove that HATCH achieves a regret bound as low as $O(\sqrt{T})$. The experimental results demonstrate the effectiveness and efficiency of the proposed method on both synthetic data sets and the real-world applications., Comment: Accepted for publication at WWW (The Web Conference) 2020

In this paper, we report on a work in progress project that aims to understand affordances and inhibiters of enjoyment in virtual reality (VR) video games. We apply the GameFlow model to review and analyse VR and non-VR versions of the same games to identify differences in enjoyment. Our approach includes conducting expert reviews using the GameFlow model, as well as conducting qualitative analysis on video game reviews, using GameFlow as a conceptual foundation. In this paper, we report our initial findings for the game Superhot. Our ongoing work evaluates a selection of games to map opportunities and pitfalls when designing games for VR.

The ocean front has an important impact in many areas, it is meaningful to obtain accurate ocean front positioning, therefore, ocean front detection is a very important task. However, the traditional edge detection algorithm does not detect the weak edge information of the ocean front very well. In response to this problem, we collected relevant ocean front gradient images and found relevant experts to calibrate the ocean front data to obtain groundtruth, and proposed a weak edge identification nets(WEIN) for ocean front detection. Whether it is qualitative or quantitative, our methods perform best. The method uses a welltrained deep learning model to accurately extract the ocean front from the ocean front gradient image. The detection network is divided into multiple stages, and the final output is a multi-stage output image fusion. The method uses the stochastic gradient descent and the correlation loss function to obtain a good ocean front image output.

Reinforcement learning aims at searching the best policy model for decision making, and has been shown powerful for sequential recommendations. The training of the policy by reinforcement learning, however, is placed in an environment. In many real-world applications, however, the policy training in the real environment can cause an unbearable cost, due to the exploration in the environment. Environment reconstruction from the past data is thus an appealing way to release the power of reinforcement learning in these applications. The reconstruction of the environment is, basically, to extract the casual effect model from the data. However, real-world applications are often too complex to offer fully observable environment information. Therefore, quite possibly there are unobserved confounding variables lying behind the data. The hidden confounder can obstruct an effective reconstruction of the environment. In this paper, by treating the hidden confounder as a hidden policy, we propose a deconfounded multi-agent environment reconstruction (DEMER) approach in order to learn the environment together with the hidden confounder. DEMER adopts a multi-agent generative adversarial imitation learning framework. It proposes to introduce the confounder embedded policy, and use the compatible discriminator for training the policies. We then apply DEMER in an application of driver program recommendation. We firstly use an artificial driver program recommendation environment, abstracted from the real application, to verify and analyze the effectiveness of DEMER. We then test DEMER in the real application of Didi Chuxing. Experiment results show that DEMER can effectively reconstruct the hidden confounder, and thus can build the environment better. DEMER also derives a recommendation policy with a significantly improved performance in the test phase of the real application., Comment: Appears in KDD 2019

Small-scale liquid flows on solid surfaces provide convincing details in liquid animation, but they are difficult to be simulated with efficiency and fidelity, mostly due to the complex nature of the surface tension at the contact front where liquid, air, and solid meet. In this paper, we propose to simulate the dynamics of new liquid drops from captured real-world liquid flow data, using deep neural networks. To achieve this goal, we develop a data capture system that acquires liquid flow patterns from hundreds of real-world water drops. We then convert raw data into compact data for training neural networks, in which liquid drops are represented by their contact fronts in a Lagrangian form. Using the LSTM units based on recurrent neural networks, our neural networks serve three purposes in our simulator: predicting the contour of a contact front, predicting the color field gradient of a contact front, and finally predicting whether a contact front is going to break or not. Using these predictions, our simulator recovers the overall shape of a liquid drop at every time step, and handles merging and splitting events by simple operations. The experiment shows that our trained neural networks are able to perform predictions well. The whole simulator is robust, convenient to use, and capable of generating realistic small-scale liquid effects in animation.

Attention is an important cognition process of humans, which helps humans concentrate on critical information during their perception and learning. However, although many machine learning models can remember information of data, they have no the attention mechanism. For example, the long short-term memory (LSTM) network is able to remember sequential information, but it cannot pay special attention to part of the sequences. In this paper, we present a novel model called long short-term attention (LSTA), which seamlessly integrates the attention mechanism into the inner cell of LSTM. More than processing long short term dependencies, LSTA can focus on important information of the sequences with the attention mechanism. Extensive experiments demonstrate that LSTA outperforms LSTM and related models on the sequence learning tasks.

Algorithmic image-based diagnosis and prognosis of neurodegenerative diseases on longitudinal data has drawn great interest from computer vision researchers. The current state-of-the-art models for many image classification tasks are based on the Convolutional Neural Networks (CNN). However, a key challenge in applying CNN to biological problems is that the available labeled training samples are very limited. Another issue for CNN to be applied in computer aided diagnosis applications is that to achieve better diagnosis and prognosis accuracy, one usually has to deal with the longitudinal dataset, i.e., the dataset of images scanned at different time points. Here we argue that an enhanced CNN model with transfer learning for the joint analysis of tasks from multiple time points or regions of interests may have a potential to improve the accuracy of computer aided diagnosis. To reach this goal, we innovate a CNN based deep learning multi-task dictionary learning framework to address the above challenges. Firstly, we pre-train CNN on the ImageNet dataset and transfer the knowledge from the pre-trained model to the medical imaging progression representation, generating the features for different tasks. Then, we propose a novel unsupervised learning method, termed Multi-task Stochastic Coordinate Coding (MSCC), for learning different tasks by using shared and individual dictionaries and generating the sparse features required to predict the future cognitive clinical scores. We apply our new model in a publicly available neuroimaging cohort to predict clinical measures with two different feature sets and compare them with seven other state-of-the-art methods. The experimental results show our proposed method achieved superior results.

Genome-wide association studies (GWAS) have achieved great success in the genetic study of Alzheimer's disease (AD). Collaborative imaging genetics studies across different research institutions show the effectiveness of detecting genetic risk factors. However, the high dimensionality of GWAS data poses significant challenges in detecting risk SNPs for AD. Selecting relevant features is crucial in predicting the response variable. In this study, we propose a novel Distributed Feature Selection Framework (DFSF) to conduct the large-scale imaging genetics studies across multiple institutions. To speed up the learning process, we propose a family of distributed group Lasso screening rules to identify irrelevant features and remove them from the optimization. Then we select the relevant group features by performing the group Lasso feature selection process in a sequence of parameters. Finally, we employ the stability selection to rank the top risk SNPs that might help detect the early stage of AD. To the best of our knowledge, this is the first distributed feature selection model integrated with group Lasso feature selection as well as detecting the risk genetic factors across multiple research institutions system. Empirical studies are conducted on 809 subjects with 5.9 million SNPs which are distributed across several individual institutions, demonstrating the efficiency and effectiveness of the proposed method.

Genome-wide association studies (GWAS) offer new opportunities to identify genetic risk factors for Alzheimer's disease (AD). Recently, collaborative efforts across different institutions emerged that enhance the power of many existing techniques on individual institution data. However, a major barrier to collaborative studies of GWAS is that many institutions need to preserve individual data privacy. To address this challenge, we propose a novel distributed framework, termed Local Query Model (LQM) to detect risk SNPs for AD across multiple research institutions. To accelerate the learning process, we propose a Distributed Enhanced Dual Polytope Projection (D-EDPP) screening rule to identify irrelevant features and remove them from the optimization. To the best of our knowledge, this is the first successful run of the computationally intensive model selection procedure to learn a consistent model across different institutions without compromising their privacy while ranking the SNPs that may collectively affect AD. Empirical studies are conducted on 809 subjects with 5.9 million SNP features which are distributed across three individual institutions. D-EDPP achieved a 66-fold speed-up by effectively identifying irrelevant features., Comment: Published on the 19th International Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI). 2016

\textit{Drosophila melanogaster} has been established as a model organism for investigating the fundamental principles of developmental gene interactions. The gene expression patterns of \textit{Drosophila melanogaster} can be documented as digital images, which are annotated with anatomical ontology terms to facilitate pattern discovery and comparison. The automated annotation of gene expression pattern images has received increasing attention due to the recent expansion of the image database. The effectiveness of gene expression pattern annotation relies on the quality of feature representation. Previous studies have demonstrated that sparse coding is effective for extracting features from gene expression images. However, solving sparse coding remains a computationally challenging problem, especially when dealing with large-scale data sets and learning large size dictionaries. In this paper, we propose a novel algorithm to solve the sparse coding problem, called Stochastic Coordinate Coding (SCC). The proposed algorithm alternatively updates the sparse codes via just a few steps of coordinate descent and updates the dictionary via second order stochastic gradient descent. The computational cost is further reduced by focusing on the non-zero components of the sparse codes and the corresponding columns of the dictionary only in the updating procedure. Thus, the proposed algorithm significantly improves the efficiency and the scalability, making sparse coding applicable for large-scale data sets and large dictionary sizes. Our experiments on Drosophila gene expression data sets demonstrate the efficiency and the effectiveness of the proposed algorithm.