Searcharxiv⌕ Search

arXiv subjects

Hao Guo

Publications and source records attributed to Hao Guo.

At least 127 records · Page 7Linked to original sources
arXiv2023

How Committed Individuals Shape Social Dynamics: A Survey on Coordination Games and Social Dilemma Games

Committed individuals, who features steadfast dedication to advocating strong beliefs, values, and preferences, have garnered much attention across statistical physics, social science, and computer science. This survey delves into the profound impact of committed individuals on social dynamics that emerge from coordination games and social dilemma games. Through separate examinations of their influence on coordination, including social conventions and color coordination games, and social dilemma games, including one-shot settings, repeated settings, and vaccination games, this survey reveals the significant role committed individuals play in shaping social dynamics. Their contributions range from accelerating or overturning social conventions to addressing cooperation dilemmas and expediting solutions for color coordination and vaccination issues. Furthermore, the survey outlines three promising directions for future research: conducting human behavior experiments for empirical validation, leveraging advanced large language models as proxies for committed individuals in complex scenarios, and addressing potential negative impacts of committed individuals.

physics.soc-ph↗
arXiv2023

An Empirical Study of Attention Networks for Semantic Segmentation

Semantic segmentation is a vital problem in computer vision. Recently, a common solution to semantic segmentation is the end-to-end convolution neural network, which is much more accurate than traditional methods.Recently, the decoders based on attention achieve state-of-the-art (SOTA) performance on various datasets. But these networks always are compared with the mIoU of previous SOTA networks to prove their superiority and ignore their characteristics without considering the computation complexity and precision in various categories, which is essential for engineering applications. Besides, the methods to analyze the FLOPs and memory are not consistent between different networks, which makes the comparison hard to be utilized. What's more, various methods utilize attention in semantic segmentation, but the conclusion of these methods is lacking. This paper first conducts experiments to analyze their computation complexity and compare their performance. Then it summarizes suitable scenes for these networks and concludes key points that should be concerned when constructing an attention network. Last it points out some future directions of the attention network.

cs.CV↗
arXiv2023

SoccerNet 2023 Challenges Results

The SoccerNet 2023 challenges were the third annual video understanding challenges organized by the SoccerNet team. For this third edition, the challenges were composed of seven vision-based tasks split into three main themes. The first theme, broadcast video understanding, is composed of three high-level tasks related to describing events occurring in the video broadcasts: (1) action spotting, focusing on retrieving all timestamps related to global actions in soccer, (2) ball action spotting, focusing on retrieving all timestamps related to the soccer ball change of state, and (3) dense video captioning, focusing on describing the broadcast with natural language and anchored timestamps. The second theme, field understanding, relates to the single task of (4) camera calibration, focusing on retrieving the intrinsic and extrinsic camera parameters from images. The third and last theme, player understanding, is composed of three low-level tasks related to extracting information about the players: (5) re-identification, focusing on retrieving the same players across multiple views, (6) multiple object tracking, focusing on tracking players and the ball through unedited video streams, and (7) jersey number recognition, focusing on recognizing the jersey number of players from tracklets. Compared to the previous editions of the SoccerNet challenges, tasks (2-3-7) are novel, including new annotations and data, task (4) was enhanced with more data and annotations, and task (6) now focuses on end-to-end approaches. More information on the tasks, challenges, and leaderboards are available on https://www.soccer-net.org. Baselines and development kits can be found on https://github.com/SoccerNet.

cs.CV↗
arXiv2023

Beamforming in Wireless Coded-Caching Systems

Increased capacity in the access network poses capacity challenges on the transport network due to the aggregated traffic. However, there are spatial and time correlation in the user data demands that could potentially be utilized. To that end, we investigate a wireless transport network architecture that integrates beamforming and coded-caching strategies. Especially, our proposed design entails a server with multiple antennas that broadcasts content to cache nodes responsible for serving users. Traditional caching methods face the limitation of relying on the individual memory with additional overhead. Hence, we develop an efficient genetic algorithm-based scheme for beam optimization in the coded-caching system. By exploiting the advantages of beamforming and coded-caching, the architecture achieves gains in terms of multicast opportunities, interference mitigation, and reduced peak backhaul traffic. A comparative analysis of this joint design with traditional, un-coded caching schemes is also conducted to assess the benefits of the proposed approach. Additionally, we examine the impact of various buffering and decoding methods on the performance of the coded-caching scheme. Our findings suggest that proper beamforming is useful in enhancing the effectiveness of the coded-caching technique, resulting in significant reduction in peak backhaul traffic.

cs.IT↗
arXiv2023

Extending regionalization algorithms to explore spatial process heterogeneity

In spatial regression models, spatial heterogeneity may be considered with either continuous or discrete specifications. The latter is related to delineation of spatially connected regions with homogeneous relationships between variables (spatial regimes). Although various regionalization algorithms have been proposed and studied in the field of spatial analytics, methods to optimize spatial regimes have been largely unexplored. In this paper, we propose two new algorithms for spatial regime delineation, two-stage K-Models and Regional-K-Models. We also extend the classic Automatic Zoning Procedure to spatial regression context. The proposed algorithms are applied to a series of synthetic datasets and two real-world datasets. Results indicate that all three algorithms achieve superior or comparable performance to existing approaches, while the two-stage K-Models algorithm largely outperforms existing approaches on model fitting, region reconstruction, and coefficient estimation. Our work enriches the spatial analytics toolbox to explore spatial heterogeneous processes.

stat.ME↗
arXiv2023

An efficient and low-divergence method for generating inhomogeneous and anisotropic turbulence with arbitrary spectra

In this article, we propose a divergence-free method for the generation of inhomogeneous and anisotropic turbulence. Based on the idea of correlation reconstruction, the method uses the Cholesky decomposition matrix to re-establish the turbulence correlation functions, which avoids the time-consuming procedure that solves eigenvalues and eigenvectors in every location needed by the coordinate transformation in the conventional method and thus reduces the computational complexity and improves the efficiency of generating synthetic turbulence. Through adjusting the generation strategy of specific random vectors, the proposed method, which is based on the classical spectrum-based method widely used to generate uniform isotropic turbulence, can obtain inhomogeneous and anisotropic turbulence with a relatively low divergence level in practice with almost no additional computational burden. There are two versions of this new method: the shifter version and the inverter version. Both versions of the method are highly efficient, easy to implement, and compatible with high-performance computing. Suitable for providing high-quality initial or boundary conditions for scale-resolving turbulence simulations with large grid numbers (such as direct numerical simulation or large eddy simulation), this method can be quickly implemented either based on various open-source CFD codes or common commercial CFD software.

physics.flu-dyn↗
arXiv2023

Aperiodic dynamical quantum phase transitions in multi-band Bloch Hamiltonian and its origin

We investigate the dynamical quantum phase transition (DQPT) in the multi-band Bloch Hamiltonian of the one-dimensional periodic Kitaev model, focusing on quenches from a Bloch band. By analyzing the dynamical free energy and Pancharatnam geometric phase, we show that the critical times of DQPTs deviate from periodic spacing due to the multi-band effect, contrasting with results from two-band models. We propose a geometric interpretation to explain this non-uniform spacing. Additionally, we clarify the conditions needed for DQPT occurrence in the multi-band Bloch Hamiltonian, highlighting that a DQPT only arises when the quench from the Bloch states collapses the band gap at the critical point. Moreover, we establish that the dynamical topological order parameter, defined by the winding number of the Pancharatnam geometric phase, is not quantized but still exhibits discontinuous jumps at DQPT critical times due to periodic modulation. Additionally, we extend our analysis to mixed-state DQPT and find its absence at non-zero temperatures.

cond-mat.stat-mech↗
arXiv2023

Securing Cloud FPGAs Against Power Side-Channel Attacks: A Case Study on Iterative AES

The various benefits of multi-tenanting, such as higher device utilization and increased profit margin, intrigue the cloud field-programmable gate array (FPGA) servers to include multi-tenanting in their infrastructure. However, this property makes these servers vulnerable to power side-channel (PSC) attacks. Logic designs such as ring oscillator (RO) and time-to-digital converter (TDC) are used to measure the power consumed by security critical circuits, such as advanced encryption standard (AES). Firstly, the existing works require higher minimum traces for disclosure (MTD). Hence, in this work, we improve the sensitivity of the TDC-based sensors by manually placing the FPGA primitives inferring these sensors. This enhancement helps to determine the 128-bit AES key using 3.8K traces. Secondly, the existing defenses use ROs to defend against PSC attacks. However, cloud servers such as Amazon Web Services (AWS) block design with combinatorial loops. Hence, we propose a placement-based defense. We study the impact of (i) primitive-level placement on the AES design and (ii) additional logic that resides along with the AES on the correlation power analysis (CPA) attack results. Our results showcase that the AES along with filters and/or processors are sufficient to provide the same level or better security than the existing defenses.

cs.CR↗
arXiv2023

Facilitating Cooperation in Human-Agent Hybrid Populations through Autonomous Agents

Cooperation is a vital social behavior that plays a crucial role in human prosperity, enabling conflict resolution and averting disastrous outcomes. With the increasing presence of autonomous agents (AAs), human-agent interaction becomes more frequent in modern society. We investigate the impact of cooperative and defective AAs on human cooperation within the framework of evolutionary game theory, particularly in one-shot social dilemma games. Our findings reveal that cooperative AAs have a limited impact on prisoner's dilemma, but facilitate cooperation in stag hunt games. Surprisingly, defective AAs, rather than cooperative AAs, promote complete dominance of cooperation in snowdrift games. Meanwhile, in scenarios with weak imitation strength, cooperative AAs are able to maintain or even promote cooperation in all these games. Additionally, the results obtained from structured populations also imply that the effectiveness of AAs in promoting cooperation can be maximized by carefully considering their design and application in a given context.

physics.soc-ph↗
arXiv2023

A Boosted Model Ensembling Approach to Ball Action Spotting in Videos: The Runner-Up Solution to CVPR'23 SoccerNet Challenge

This technical report presents our solution to Ball Action Spotting in videos. Our method reached second place in the CVPR'23 SoccerNet Challenge. Details of this challenge can be found at https://www.soccer-net.org/tasks/ball-action-spotting. Our approach is developed based on a baseline model termed E2E-Spot, which was provided by the organizer of this competition. We first generated several variants of the E2E-Spot model, resulting in a candidate model set. We then proposed a strategy for selecting appropriate model members from this set and assigning an appropriate weight to each model. The aim of this strategy is to boost the performance of the resulting model ensemble. Therefore, we call our approach Boosted Model Ensembling (BME). Our code is available at https://github.com/ZJLAB-AMMI/E2E-Spot-MBS.

cs.CV↗
arXiv2023

Aggregated Zero-knowledge Proof and Blockchain-Empowered Authentication for Autonomous Truck Platooning

Platooning technologies enable trucks to drive cooperatively and automatically, providing benefits including less fuel consumption, greater road capacity, and safety. This paper introduces an aggregated zero-knowledge proof and blockchain-empowered system for privacy-preserving identity verification in the mixed fleet platooning environment. The correctness proof and the security analysis of the proposed authentication scheme are provided, highlighting its increased security and fast performance in comparison to a single-proof design. The blockchain performs the role of verifier within the authentication scheme, reducing unnecessary communication overhead. Moreover, the blockchain improves system resilience by providing fault tolerance to the decentralized verification process. Platooning records are stored directly on the digital ledger to guarantee data immutability and integrity, while the programmable access control policies ensure data privacy. The experimental results demonstrate that the proposed approach can perform authentication on the order of milliseconds, regardless of the number of proofs, highlighting feasibility for real-world deployment in truck platooning.

cs.CR↗
arXiv2023

A Hybrid Blockchain-Edge Architecture for Electronic Health Records Management with Attribute-based Cryptographic Mechanisms

This paper presents a hybrid blockchain-edge architecture for managing Electronic Health Records (EHRs) with attribute-based cryptographic mechanisms. The architecture introduces a novel attribute-based signature aggregation (ABSA) scheme and multi-authority attribute-based encryption (MA-ABE) integrated with Paillier homomorphic encryption (HE) to protect patients' anonymity and safeguard their EHRs. All the EHR activities and access control events are recorded permanently as blockchain transactions. We develop the ABSA module on Hyperledger Ursa cryptography library, MA-ABE module on OpenABE toolset, and blockchain network on Hyperledger Fabric. We measure the execution time of ABSA's signing and verification functions, MA-ABE with different access policies and homomorphic encryption schemes, and compare the results with other existing blockchain-based EHR systems. We validate the access activities and authentication events recorded in blockchain transactions and evaluate the transaction throughput and latency using Hyperledger Caliper. The results show that the performance meets real-world scenarios' requirements while safeguarding EHR and is robust against unauthorized retrievals.

cs.CR↗
arXiv2023

A Hierarchical and Location-aware Consensus Protocol for IoT-Blockchain Applications

Blockchain-based IoT systems can manage IoT devices and achieve a high level of data integrity, security, and provenance. However, incorporating existing consensus protocols in many IoT systems limits scalability and leads to high computational cost and consensus latency. In addition, location-centric characteristics of many IoT applications paired with limited storage and computing power of IoT devices bring about more limitations, primarily due to the location-agnostic designs in blockchains. We propose a hierarchical and location-aware consensus protocol (LH-Raft) for IoT-blockchain applications inspired by the original Raft protocol to address these limitations. The proposed LH-Raft protocol forms local consensus candidate groups based on nodes' reputation and distance to elect the leaders in each sub-layer blockchain. It utilizes a threshold signature scheme to reach global consensus and the local and global log replication to maintain consistency for blockchain transactions. To evaluate the performance of LH-Raft, we first conduct an extensive numerical analysis based on the proposed reputation mechanism and the candidate group formation model. We then compare the performance of LH-Raft against the classical Raft protocol from both theoretical and experimental perspectives. We evaluate the proposed threshold signature scheme using Hyperledger Ursa cryptography library to measure various consensus nodes' signing and verification time. Experimental results show that the proposed LH-Raft protocol is scalable for large IoT applications and significantly reduces the communication cost, consensus latency, and agreement time for consensus processing.

cs.CR↗
arXiv2023

P-CFT: A Privacy-preserving and Crash Fault Tolerant Consensus Algorithm for Permissioned Blockchains

Consensus algorithms play a critical role in blockchains and directly impact their performance. During consensus processing, nodes need to validate and order the pending transactions into a new block, which requires verifying the application-specific data encapsulated within a transaction. This exposes the underlying data to the consensus nodes, presenting privacy concerns. Existing consensus algorithms focus on realizing application security and performance goals, but lack privacy-by-design properties or are resource-heavy and intended for securing permissionless blockchain networks. In this paper, we propose P-CFT, a zero-knowledge and crash fault tolerant consensus algorithm for permissioned blockchains. The proposed consensus algorithm provides inherent data privacy directly to the consensus layer, while still providing guarantees of crash fault tolerance. We conduct experiments using the Hyperledger Ursa cryptographic library, and the results show promise for integrating P-CFT into existing permissioned blockchain systems requiring privacy-preserving and crash fault tolerant features.

cs.CR↗
arXiv2023

A Location-based and Hierarchical Framework for Fast Consensus in Blockchain Networks

Blockchain-based IoT systems can manage IoT devices and achieve a high level of data integrity, security, and provenance. However, incorporating the existing consensus protocols in many IoT systems limits scalability and leads to high computational cost and network latency. We propose a hierar-chical and location-aware consensus protocol for IoI-blockchain applications inspired by the original Raft protocol to address these limitations. The proposed consensus protocol generates the consensus candidate groups based on nodes' individual reputation and distance information to elect the leader in each sub-layer blockchain and uses our threshold signature scheme to reach global consensus. Experimental results show that the proposed consensus protocol is scalable for large IoT applications and significantly reduces the communication cost, network latency, and agreement time by more than 50% compared with the Raft protocol for consensus processing.

cs.CR↗
arXiv2023

Location-aware Verification for Autonomous Truck Platooning Based on Blockchain and Zero-knowledge Proof

Platooning technologies enable trucks to drive cooperatively and automatically, which bring benefits including less fuel consumption, more road capacity and safety. In order to establish trust during dynamic platoon formation, ensure vehicular data integrity, and guard platoons against potential attackers, it is pivotal to verify any given vehicle's identity information before granting it access to join a platoon. To address this concern in dynamic truck platooning, we present a novel location-aware and privacy-preserving verification protocol based on zero-knowledge proof and permissioned blockchain. By performing the verification process within the spatially-local area defined by a given platoon, our system can provide lower latency and communication overhead compared to a location-agnostic blockchain system. We prototype the proposed system and perform benchmark tests on the Hyperledger platform. The experimental results show that our system is suitable for real-world truck platooning.

cs.NI↗
arXiv2023

Small Bots, Big Impact: Solving the Conundrum of Cooperation in Optional Prisoner's Dilemma Game through Simple Strategies

Cooperation plays a crucial role in both nature and human society, and the conundrum of cooperation attracts the attention from interdisciplinary research. In this study, we investigated the evolution of cooperation in optional prisoner's dilemma games by introducing simple bots. We focused on one-shot and anonymous games, where the bots could be programmed to always cooperate, always defect, never participate, or choose each action with equal probability. Our results show that cooperative bots facilitate the emergence of cooperation among ordinary players in both well-mixed populations and a regular lattice under weak imitation scenarios. Introducing loner bots has no impact on the emergence of cooperation in well-mixed populations, but it facilitates the dominance of cooperation in regular lattices under strong imitation scenarios. However, too many loner bots on a regular lattice inhibit the spread of cooperation and can eventually result in a breakdown of cooperation. Our findings emphasize the significance of bot design in promoting cooperation and offer useful insights for encouraging cooperation in real-world scenarios.

physics.soc-ph↗
arXiv2023

PFGE: Parsimonious Fast Geometric Ensembling of DNNs

Ensemble methods are commonly used to enhance the generalization performance of machine learning models. However, they present a challenge in deep learning systems due to the high computational overhead required to train an ensemble of deep neural networks (DNNs). Recent advancements such as fast geometric ensembling (FGE) and snapshot ensembles have addressed this issue by training model ensembles in the same time as a single model. Nonetheless, these techniques still require additional memory for test-time inference compared to single-model-based methods. In this paper, we propose a new method called parsimonious FGE (PFGE), which employs a lightweight ensemble of higher-performing DNNs generated through successive stochastic weight averaging procedures. Our experimental results on CIFAR-{10,100} and ImageNet datasets across various modern DNN architectures demonstrate that PFGE achieves 5x memory efficiency compared to previous methods, without compromising on generalization performance. For those interested, our code is available at https://github.com/ZJLAB-AMMI/PFGE.

cs.LG↗