Source author record

Jun Shen

Jun Shen appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

11works
11topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

11 published item(s)

preprint2026arXiv

FedHPro: Federated Hyper-Prototype Learning via Gradient Matching

Federated Learning (FL) enables collaborative training of distributed clients while protecting privacy. To enhance generalization capability in FL, prototype-based FL is in the spotlight, since shared global prototypes offer semantic anchors for aligning client-specific local prototypes. However, existing methods update global prototypes at the prototype-level via averaging local prototypes or refining global anchors, which often leads to semantic drift across clients and subsequently yields a misaligned global signal. To alleviate this issue, we introduce hyper-prototypes, defined by a set of learnable global class-wise prototypes to preserve underlying semantic knowledge across clients. The hyper-prototypes are optimized via gradient matching to align with class-relevant characteristics distilled directly from clients' real samples, rather than prototype-level descriptors. We further propose FedHPro, a Federated Hyper-Prototype Learning framework, to leverage hyper-prototypes to promote inter-class separability via mutual-contrastive learning with client-specific margin, while encouraging intra-class uniformity through a consistency penalty. Comprehensive experiments under diverse heterogeneous scenarios confirm that 1) hyper-prototypes produce a more semantically consistent global signal, and 2) FedHPro achieves state-of-the-art performance on several benchmark datasets. Code is available at \href{https://github.com/mala-lab/FedHPro}{https://github.com/mala-lab/FedHPro}.

preprint2023arXiv

Dipolar Spin Liquid Ending with Quantum Critical Point in a Gd-based Triangular Magnet

By performing experiment and model studies on a triangular-lattice dipolar magnet KBaGd(BO$_3$)$_2$ (KBGB), we find the highly frustrated magnet with a planar anisotropy hosts a strongly fluctuating dipolar spin liquid (DSL), which originates from the intriguing interplay between dipolar and Heisenberg interactions. The DSL constitutes an extended regime in the field-temperature phase diagram, which gets lowered in temperature as field increases and eventually ends with an unconventional quantum critical point (QCP) at $B_c\simeq 0.75$~T. Based on dipolar Heisenberg model calculations, we identify the DSL as a Berezinskii-Kosterlitz-Thouless (BKT) phase with emergent U(1) symmetry. Due to the tremendous entropy accumulation that can be related to the strong BKT and quantum fluctuations, unprecedented magnetic cooling effects are observed in the DSL regime and particularly near the QCP, making KBGB a superior dipolar coolant to commercial Gd-based refrigerants. We establish the phase diagram for triangular-lattice dipolar quantum magnets where emergent symmetry plays an essential role, and provide a basis and opens an avenue for their applications in sub-Kelvin refrigeration.

preprint2022arXiv

Crop and weed classification based on AutoML

CNN models already play an important role in classification of crop and weed with high accuracy, more than 95% as reported in literature. However, to manually choose and fine-tune the deep learning models becomes laborious and indispensable in most traditional practices and research. Moreover, the classic objective functions are not thoroughly compatible with agricultural farming tasks as the corresponding models suffer from misclassifying crop to weed, often more likely than in other deep learning application domains. In this paper, we applied autonomous machine learning with a new objective function for crop and weed classification, achieving higher accuracy and lower crop killing rate (rate of identifying a crop as a weed). The experimental results show that our method outperforms state-of-the-art applications, for example, ResNet and VGG19.

preprint2022arXiv

Expression might be enough: representing pressure and demand for reinforcement learning based traffic signal control

Many studies confirmed that a proper traffic state representation is more important than complex algorithms for the classical traffic signal control (TSC) problem. In this paper, we (1) present a novel, flexible and efficient method, namely advanced max pressure (Advanced-MP), taking both running and queuing vehicles into consideration to decide whether to change current signal phase; (2) inventively design the traffic movement representation with the efficient pressure and effective running vehicles from Advanced-MP, namely advanced traffic state (ATS); and (3) develop a reinforcement learning (RL) based algorithm template, called Advanced-XLight, by combining ATS with the latest RL approaches, and generate two RL algorithms, namely "Advanced-MPLight" and "Advanced-CoLight" from Advanced-XLight. Comprehensive experiments on multiple real-world datasets show that: (1) the Advanced-MP outperforms baseline methods, and it is also efficient and reliable for deployment; and (2) Advanced-MPLight and Advanced-CoLight can achieve the state-of-the-art.

preprint2022arXiv

Knowledge Management for Cloud Computing Field

Migration legacy systems to cloud platforms is a knowledge intensive process. There is an ever increasing body of knowledge reporting empirical scenarios of successful and problematic cloud migration. Reusing this body of knowledge, dispersed and fragmented over the academic/multi-vocal literature, has practical values to mitigate costly risks and pitfalls in further projects of legacy to-cloud and cloud-to-cloud migration. In line with this, knowledge management systems/platforms pertinent to cloud migration are a prime prerequisite and a strategic imperative for an organization. We have conducted a qualitative exploratory study to understand the benefits and challenges of developing Knowledge Management Systems (KMS) for cloud migration in real trials. Whilst our prototype system demonstration supported the importance and bene-fits of developing Cloud Migration KMS (CM-KMS), our semi-structured industry interview study with 11 participants highlighted challenging impediments against developing this class of KMS. As a result, this study proposes nine significant challenges that cause the abandon of the design and maintenance of CM-KMS, including continuous changes and updates, integration of knowledge, knowledge granularity, preservation of context, automation, deconstruction of traditional knowledge, dependency on experts, hybrid knowledge of both vendor-specific and vendor-neutral cloud platforms, and parsimony. Our results inform cloud architects to pay attention to adopt CM-KMS for the legacy-to-cloud migration in their organizations.

preprint2020arXiv

A Machine Learning Framework for Data Ingestion in Document Images

Paper documents are widely used as an irreplaceable channel of information in many fields, especially in financial industry, fostering a great amount of demand for systems which can convert document images into structured data representations. In this paper, we present a machine learning framework for data ingestion in document images, which processes the images uploaded by users and return fine-grained data in JSON format. Details of model architectures, design strategies, distinctions with existing solutions and lessons learned during development are elaborated. We conduct abundant experiments on both synthetic and real-world data in State Street. The experimental results indicate the effectiveness and efficiency of our methods.

preprint2020arXiv

Evidence for gravitational-wave dominated emission in the central engine of short GRB 200219A

GRB 200219A is a short gamma-ray burst (GRB) with an extended emission (EE) lasting $\sim 90$s. By analyzing data observed with the {\em Swift}/BAT and {\em Fermi}/GBM, we find that a cutoff power-law model can adequately fit the spectra of the initial short pulse with $\rm E_{p}=1387^{+232}_{-134}$ keV. More interestingly, together with the EE component and early X-ray data, it exhibits plateau emission smoothly connected with a $\sim t^{-1}$ segment and followed by an extremely steep decay. The short GRB composed of those three segments is unique in the {\em Swift} era and is very difficult to explain with the standard internal/external shock model of a black hole central engine, but could be consistent with the prediction of a magnetar central engine from the merger of an NS binary. We suggest that the plateau emission followed by a $\sim t^{-1}$ decay phase is powered by the spin-down of a millisecond magnetar, which loses its rotation energy via GW quadrupole radiation. Then, the abrupt drop decay is caused by the magnetar collapsing into a black hole before switching to EM-dominated emission. This is the first short GRB for which the X-ray emission has such an intriguing feature powered by a magnetar via GW-dominated radiation. If this is the case, one can estimate the physical parameters of a magnetar, the GW signal powered by a magnetar and the merger-nova emission are also discussed.

preprint2020arXiv

The properties of prompt emission in short GRBs with extended emission observed by {\em Fermi}/GBM

Short GRBs with extended emission (EE) that are composed initially of a short-hard spike and followed by a long-lasting EE, are thought to be classified as a subsection of short GRBs. The narrow energy band available during the {\em Swift} era combined with a lack of spectral information prevented discovery of the intrinsic properties of those events. In this paper, we performed a systematic search of short GRBs with EE by using all available {\em Fermi}/GBM data. The search identified 26 GBM-detected short GRBs with EE that are similar to GRB 060614 observed by {\em Swift}/BAT. We focus on investigating the spectral and temporal properties for both the hard spike and the EE components of all 26 GRBs, and explore differences and possible correlations between them. We find that while the peak energy ($E_{\rm p}$) of the hard spikes is a little bit harder than that of the EE, but their fluences are comparable. The harder $E_{\rm p}$ seems to correspond to a larger fluence and peak flux with a large scatter for both the hard spike and EE components. Moreover, the $E_{\rm p}$ of both the hard spikes and EE are compared to other short GRBs. Finally, we also compare the properties of GRB 170817A with those short GRBs with EE and find no significant statistical differences between them. We find that GRB 170817A has the lowest $E_{\rm p}$, likely because it was off-axis.

preprint2016arXiv

A Multi Perspective Approach for Understanding the Determinants of Cloud Computing Adoption among Australian SMEs

Cloud computing is proved to be an effective computing technology for organisations through the advantages that it offers such as cost-effectiveness, IT technical agility and scalability, enhancing businesses processes, and increasing enterprises competitiveness. In Australia, there is an emerging trend that small and medium-sized enterprises (SMEs) begin to adopt this technology in the conventional working practices. However, there is a dearth of prior studies on examining the factors that influence the cloud computing adoption among Australian SMEs. To fill the empirical vacuum, this research-in-progress proposes an integrated framework for examining the determinants of cloud computing service adoption with the consideration of the unique characteristics of Australian SMEs, such as relatively low adoption of cloud computing services, less innovative, and limited knowledge about cloud computing and its benefits and hindrances. To this end, we are conducting consecutive studies to investigate this research issue. An exploratory interview study will be undertaken to identify and verify the unique characteristics of Australian SMEs toward the cloud computing adoption. This is followed by an organisational level survey that examines the effects of those determinants on cloud computing adoption. Finally, a decision model for cloud computing adoption among Australian SMEs will be developed by using a Multi Criteria Decision Approach (MCDA) through rating, prioritising, and ranking of various criteria and alternatives available to the decision makers. Adopting the mixed-method research fashion, this research-in-progress intends to make significant implications to scholars and practitioners alike in the cloud computing research and applications areas.

preprint2015arXiv

A Formal Study on Backward Compatible Dynamic Software Updates

We study the dynamic software update problem for programs interacting with an environment that is not necessarily updated. We argue that such updates should be backward compatible. We propose a general definition of backward compatibility and cases of backward compatible program update. Based on our detailed study of real world program evolution, we propose classes of backward compatible update for interactive programs, which are included at an average of 32% of all studied program changes. The definitions of update classes are parameterized by our novel framework of program equivalence, which generalizes existing results on program equivalence to non-terminating executions. Our study of backward compatible updates is based on a typed extension of W language.

preprint2011arXiv

Symmetric Group Testing and Superimposed Codes

We describe a generalization of the group testing problem termed symmetric group testing. Unlike in classical binary group testing, the roles played by the input symbols zero and one are "symmetric" while the outputs are drawn from a ternary alphabet. Using an information-theoretic approach, we derive sufficient and necessary conditions for the number of tests required for noise-free and noisy reconstructions. Furthermore, we extend the notion of disjunct (zero-false-drop) and separable (uniquely decipherable) codes to the case of symmetric group testing. For the new family of codes, we derive bounds on their size based on probabilistic methods, and provide construction methods based on coding theoretic ideas.