Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 1681 - 1710 of 10474

Full-Text Articles in Entire DC Network

Hello, Jarvis, Archan Misra Mar 2024

Hello, Jarvis, Archan Misra

Asian Management Insights

How AI-enabled interactive agents will reshape our workforce of today and tomorrow.


Smart Heuristics For Smart Management, Jochen Reb, Shenghua Luan, Gerd Gigerenzer Mar 2024

Smart Heuristics For Smart Management, Jochen Reb, Shenghua Luan, Gerd Gigerenzer

Asian Management Insights

How leaders can make effective decisions in a VUCA world.


Developing Singapore As A Smart Nation, Josephine Teo Mar 2024

Developing Singapore As A Smart Nation, Josephine Teo

Asian Management Insights

Mrs Josephine Teo, Singapore’s Minister for Communications and Information, and Minister-in-charge of Smart Nation and Cybersecurity, speaks about leading the country’s Smart Nation drive.


Research On The Innovation And Development Of China’S Hydrogen Fuel Cell Vehicle Industry, Xinhua Yu Mar 2024

Research On The Innovation And Development Of China’S Hydrogen Fuel Cell Vehicle Industry, Xinhua Yu

Dissertations and Theses Collection (Open Access)

China's commitment to achieving "carbon peaking and carbon neutrality" has made the transition from conventional energy sources such as coal, oil, and natural gas to renewable energy sources such as solar, wind, and hydrogen an unavoidable trend. In this regard, the integration of new energy technologies into the automobile and transportation sectors has significantly impacted consumers' lifestyles and has emerged as a key focus for major investment institutions. Lithium-ion batteries, known for their advanced technology, cost-effectiveness, and safety, are the leading choice for use in passenger vehicles, gradually replacing conventional fossil fuel sources. This shift is also contributing to the …


The Effect Of Internet Firms’ Data Analytics Capability On Their Innovation Speed And Innovation Quality: A Dynamic Capability Perspective, Yeyu Hua Mar 2024

The Effect Of Internet Firms’ Data Analytics Capability On Their Innovation Speed And Innovation Quality: A Dynamic Capability Perspective, Yeyu Hua

Dissertations and Theses Collection (Open Access)

With the advent of big data era, data plays a pivotal role in sustainingfirms’ competitive advantages. Although a few studies have shown that data analytics capability contributes to firms’ innovative performance, these studies either focus on general innovative performance or specific types of innovation, such as incremental innovation, radical innovation, and supply chaininnovation. In this thesis, I enrich this stream of literature by conducting twostudies to further examine the relationship between data analytics capabilityand innovation speed as well as innovation quality. This thesis consists of twostudies. Study 1 is a survey study, in which I investigate the relationshipbetween data analytics …


Multiobjective Stochastic Optimization: A Case Of Real-Time Matching In Ride-Sourcing Markets, Guodong Lyu, Wang Chi Cheung, Chung-Piaw Teo, Hai Wang Mar 2024

Multiobjective Stochastic Optimization: A Case Of Real-Time Matching In Ride-Sourcing Markets, Guodong Lyu, Wang Chi Cheung, Chung-Piaw Teo, Hai Wang

Research Collection School Of Computing and Information Systems

Problem Definition: The job of any marketplace is to facilitate the matching of supply with demand in real-time. Success is often measured using various metrics. The challenge is to design matching algorithms to balance the trade-offs among multiple objectives in a stochastic environment, to arrive at a “compromise” solution, which minimizes say the ℓp-norm-based distance function (for some 1 ≤p ≤∞) between the attained performance metrics and the target performances.Methodology/Results: We observe that the sample-average-approximation formulation of this multi-objective stochastic optimization problem can be solved by an online algorithm that uses only gradient information from “historical” (i.e., past) sample information, …


Screening Through A Broad Pool: Towards Better Diversity For Lexically Constrained Text Generation, Changsen Yuan, Heyan Huang, Yixin Cao, Qianwen Cao Mar 2024

Screening Through A Broad Pool: Towards Better Diversity For Lexically Constrained Text Generation, Changsen Yuan, Heyan Huang, Yixin Cao, Qianwen Cao

Research Collection School Of Computing and Information Systems

Lexically constrained text generation (CTG) is to generate text that contains given constrained keywords. However, the text diversity of existing models is still unsatisfactory. In this paper, we propose a lightweight dynamic refinement strategy that aims at increasing the randomness of inference to improve generation richness and diversity while maintaining a high level of fluidity and integrity. Our basic idea is to enlarge the number and length of candidate sentences in each iteration, and choose the best for subsequent refinement. On the one hand, different from previous works, which carefully insert one token between two words per action, we insert …


Non-Binary Evaluation Of Next-Basket Food Recommendation, Yue Liu, Palakorn Achananuparp, Ee-Peng Lim Mar 2024

Non-Binary Evaluation Of Next-Basket Food Recommendation, Yue Liu, Palakorn Achananuparp, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Next-basket recommendation (NBR) is a recommendation task that predicts a basket or a set of items a user is likely to adopt next based on his/her history of basket adoption sequences. It enables a wide range of novel applications and services from predicting next basket of items for grocery shopping to recommending food items a user is likely to consume together in the next meal. Even though much progress has been made in the algorithmic NBR research over the years, little research has been done to broaden knowledge about the evaluation of NBR methods, which is largely based on the …


Test-Time Augmentation For 3d Point Cloud Classification And Segmentation, Tuan-Anh Vu, Srinjay Sarkar, Zhiyuan Zhang, Binh-Son Hua, Sai-Kit Yeung Mar 2024

Test-Time Augmentation For 3d Point Cloud Classification And Segmentation, Tuan-Anh Vu, Srinjay Sarkar, Zhiyuan Zhang, Binh-Son Hua, Sai-Kit Yeung

Research Collection School Of Computing and Information Systems

Data augmentation is a powerful technique to enhance the performance of a deep learning task but has received less attention in 3D deep learning. It is well known that when 3D shapes are sparsely represented with low point density, the performance of the downstream tasks drops significantly. This work explores test-time augmentation (TTA) for 3D point clouds. We are inspired by the recent revolution of learning implicit representation and point cloud upsampling, which can produce high-quality 3D surface reconstruction and proximity-to-surface, respectively. Our idea is to leverage the implicit field reconstruction or point cloud upsampling techniques as a systematic way …


Iterative Graph Self-Distillation, Hanlin Zhang, Shuai Lin, Weiyang Liu, Pan Zhou, Jian Tang, Xiaodan Liang, Eric Xing Mar 2024

Iterative Graph Self-Distillation, Hanlin Zhang, Shuai Lin, Weiyang Liu, Pan Zhou, Jian Tang, Xiaodan Liang, Eric Xing

Research Collection School Of Computing and Information Systems

Recently, there has been increasing interest in the challenge of how to discriminatively vectorize graphs. To address this, we propose a method called Iterative Graph Self-Distillation (IGSD) which learns graph-level representation in an unsupervised manner through instance discrimination using a self-supervised contrastive learning approach. IGSD involves a teacher-student distillation process that uses graph diffusion augmentations and constructs the teacher model using an exponential moving average of the student model. The intuition behind IGSD is to predict the teacher network representation of the graph pairs under different augmented views. As a natural extension, we also apply IGSD to semi-supervised scenarios by …


Towards Understanding Convergence And Generalization Of Adamw, Pan Zhou, Xingyu Xie, Zhouchen Lin, Shuicheng Yan Mar 2024

Towards Understanding Convergence And Generalization Of Adamw, Pan Zhou, Xingyu Xie, Zhouchen Lin, Shuicheng Yan

Research Collection School Of Computing and Information Systems

AdamW modifies Adam by adding a decoupled weight decay to decay network weights per training iteration. For adaptive algorithms, this decoupled weight decay does not affect specific optimization steps, and differs from the widely used ℓ2-regularizer which changes optimization steps via changing the first- and second-order gradient moments. Despite its great practical success, for AdamW, its convergence behavior and generalization improvement over Adam and ℓ2-regularized Adam (ℓ2-Adam) remain absent yet. To solve this issue, we prove the convergence of AdamW and justify its generalization advantages over Adam and ℓ2-Adam. Specifically, AdamW provably converges but minimizes a dynamically regularized loss that …


Attack As Detection: Using Adversarial Attack Methods To Detect Abnormal Examples, Zhe Zhao, Guangke Chen, Tong Liu, Taishan Li, Fu Song, Jingyi Wang, Jun Sun Mar 2024

Attack As Detection: Using Adversarial Attack Methods To Detect Abnormal Examples, Zhe Zhao, Guangke Chen, Tong Liu, Taishan Li, Fu Song, Jingyi Wang, Jun Sun

Research Collection School Of Computing and Information Systems

As a new programming paradigm, deep learning (DL) has achieved impressive performance in areas such as image processing and speech recognition, and has expanded its application to solve many real-world problems. However, neural networks and DL are normally black-box systems; even worse, DL-based software are vulnerable to threats from abnormal examples, such as adversarial and backdoored examples constructed by attackers with malicious intentions as well as unintentionally mislabeled samples. Therefore, it is important and urgent to detect such abnormal examples. Although various detection approaches have been proposed respectively addressing some specific types of abnormal examples, they suffer from some limitations; …


Self-Admitted Technical Debts Identification: How Far Are We?, Hao Gu, Shichao Zhang, Qiao Huang, Zhifang Liao, Jiakun Liu, David Lo Mar 2024

Self-Admitted Technical Debts Identification: How Far Are We?, Hao Gu, Shichao Zhang, Qiao Huang, Zhifang Liao, Jiakun Liu, David Lo

Research Collection School Of Computing and Information Systems

Self-admitted technical debt (SATD) is a kind of technical debt that is already acknowledged by the developers and needs additional work or resources to address in the future. In recent years, though many methods have been proposed to detect SATDs, these methods have mainly focused on Java-type code comments published by Maldonado et al. It is unclear whether these methods trained on Maldonado's code comments dataset can find SATD in other programming languages or other software artifacts, such as issue trackers, pull requests, and commit messages effectively. In order to answer the above confusion and investigate how far our community …


Sustainability Forecasting For Deep Learning Packages, Junxiao Han, Yunkun Wang, Zhongxin Liu, Lingfeng Bao, Jiakun Liu, David Lo, Shuiguang Deng Mar 2024

Sustainability Forecasting For Deep Learning Packages, Junxiao Han, Yunkun Wang, Zhongxin Liu, Lingfeng Bao, Jiakun Liu, David Lo, Shuiguang Deng

Research Collection School Of Computing and Information Systems

Deep Learning (DL) technologies have been widely adopted to tackle various tasks. In this process, through software dependencies, a multi-layer DL supply chain (SC) is formed, with DL frameworks acting as the root, DL packages acting as the bridge nodes, and downstream DL projects acting as the periphery. However, most Open Source Software (OSS) projects may fail. Considering the crucial position of DL packages in the DL SC, to foster the sustainable development of DL SCs and DL packages, we aim to forecast the long-term sustainability of DL packages. Here, sustained activity is adopted as the main proxy of sustainability, …


Leveraging Multimodal Features And Item‑Level User Feedback For Bundle Construction, Yunshan Ma, Xiaohao Liu, Yinwei Wei, Zhulin Tao, Xiang Wang, Tat‑Seng Chua Mar 2024

Leveraging Multimodal Features And Item‑Level User Feedback For Bundle Construction, Yunshan Ma, Xiaohao Liu, Yinwei Wei, Zhulin Tao, Xiang Wang, Tat‑Seng Chua

Research Collection School Of Computing and Information Systems

Automatic bundle construction is a crucial prerequisite step in various bundle-aware online services. Previous approaches are mostly designed to model the bundling strategy of existing bundles. However, it is hard to acquire large-scale well-curated bundle dataset, especially for those platforms that have not offered bundle services before. Even for platforms with mature bundle services, there are still many items that are included in few or even zero bundles, which give rise to sparsity and cold-start challenges in the bundle construction models. To tackle these issues, we target at leveraging multimodal features, item-level user feedback signals, and the bundle composition information, …


Faster Rates For Compressed Federated Learning With Client-Variance Reduction, Haoyu Zhao, Konstantin Burlachenko, Zhize Li, Peter Richtarik Mar 2024

Faster Rates For Compressed Federated Learning With Client-Variance Reduction, Haoyu Zhao, Konstantin Burlachenko, Zhize Li, Peter Richtarik

Research Collection School Of Computing and Information Systems

Due to the communication bottleneck in distributed and federated learning applications, algorithms using communication compression have attracted significant attention and are widely used in practice. Moreover, the huge number, high heterogeneity, and limited availability of clients result in high client -variance. This paper addresses these two issues together by proposing compressed and clientvariance reduced methods COFIG and FRECON. We prove an O( (1+\omega)3/2\surdN+ (1+\omega)N2/3 S\epsilon2 S\epsilon2 ) bound on the number of communication rounds of COFIG in the nonconvex setting, where N is the total number of clients, S is the number of clients participating in each round, \epsilon is …


Sigmadiff: Semantics-Aware Deep Graph Matching For Pseudocode Diffing, Lian Gao, Yu Qu, Sheng Yu, Yue Duan, Heng Yin Mar 2024

Sigmadiff: Semantics-Aware Deep Graph Matching For Pseudocode Diffing, Lian Gao, Yu Qu, Sheng Yu, Yue Duan, Heng Yin

Research Collection School Of Computing and Information Systems

Pseudocode diffing precisely locates similar parts and captures differences between the decompiled pseudocode of two given binaries. It is particularly useful in many security scenarios such as code plagiarism detection, lineage analysis, patch, vulnerability analysis, etc. However, existing pseudocode diffing and binary diffing tools suffer from low accuracy and poor scalability, since they either rely on manually-designed heuristics (e.g., Diaphora) or heavy computations like matrix factorization (e.g., DeepBinDiff). To address the limitations, in this paper, we propose a semantics-aware, deep neural network-based model called SIGMADIFF. SIGMADIFF first constructs IR (Intermediate Representation) level interprocedural program dependency graphs (IPDGs). Then it uses …


Ditmos: Delving Into Diverse Tiny-Model Selection On Microcontrollers, Xiao Ma, Shengfeng He, Hezhe Qiao, Dong Ma Mar 2024

Ditmos: Delving Into Diverse Tiny-Model Selection On Microcontrollers, Xiao Ma, Shengfeng He, Hezhe Qiao, Dong Ma

Research Collection School Of Computing and Information Systems

Enabling efficient and accurate deep neural network (DNN) inference on microcontrollers is non-trivial due to the constrained on-chip resources. Current methodologies primarily focus on compressing larger models yet at the expense of model accuracy. In this paper, we rethink the problem from the inverse perspective by constructing small/weak models directly and improving their accuracy. Thus, we introduce DiTMoS, a novel DNN training and inference framework with a selectorclassifiers architecture, where the selector routes each input sample to the appropriate classifier for classification. DiTMoS is grounded on a key insight: a composition of weak models can exhibit high diversity and the …


Win: Weight-Decay-Integrated Nesterov Acceleration For Faster Network Training, Pan Zhou, Xingyu Xie, Zhouchen Lin, Kim-Chuan Toh, Shuicheng Yan Mar 2024

Win: Weight-Decay-Integrated Nesterov Acceleration For Faster Network Training, Pan Zhou, Xingyu Xie, Zhouchen Lin, Kim-Chuan Toh, Shuicheng Yan

Research Collection School Of Computing and Information Systems

Training deep networks on large-scale datasets is computationally challenging. This work explores the problem of “how to accelerate adaptive gradient algorithms in a general manner", and proposes an effective Weight-decay-Integrated Nesterov acceleration (Win) to accelerate adaptive algorithms. Taking AdamW and Adam as examples, per iteration, we construct a dynamical loss that combines the vanilla training loss and a dynamic regularizer inspired by proximal point method, and respectively minimize the first- and second-order Taylor approximations of dynamical loss to update variable. This yields our Win acceleration that uses a conservative step and an aggressive step to update, and linearly combines these …


Stability Verification In Stochastic Control Systems Via Neural Network Supermartingales, Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger Mar 2024

Stability Verification In Stochastic Control Systems Via Neural Network Supermartingales, Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger

Research Collection School Of Computing and Information Systems

We consider the problem of formally verifying almost-sure (a.s.) asymptotic stability in discrete-time nonlinear stochastic control systems. While verifying stability in deterministic control systems is extensively studied in the literature, verifying stability in stochastic control systems is an open problem. The few existing works on this topic either consider only specialized forms of stochasticity or make restrictive assumptions on the system, rendering them inapplicable to learning algorithms with neural network policies. In this work, we present an approach for general nonlinear stochastic control problems with two novel aspects: (a) instead of classical stochastic extensions of Lyapunov functions, we use ranking …


Xfuzz: Machine Learning Guided Cross-Contract Fuzzing, Yinxing Xue, Jiaming Ye, Wei Zhang, Jun Sun, Lei Ma, Haijun Wang, Jianjun Zhao Mar 2024

Xfuzz: Machine Learning Guided Cross-Contract Fuzzing, Yinxing Xue, Jiaming Ye, Wei Zhang, Jun Sun, Lei Ma, Haijun Wang, Jianjun Zhao

Research Collection School Of Computing and Information Systems

Smart contract transactions are increasingly interleaved by cross-contract calls. While many tools have been developed to identify a common set of vulnerabilities, the cross-contract vulnerability is overlooked by existing tools. Cross-contract vulnerabilities are exploitable bugs that manifest in the presence of more than two interacting contracts. Existing methods are however limited to analyze a maximum of two contracts at the same time. Detecting cross-contract vulnerabilities is highly non-trivial. With multiple interacting contracts, the search space is much larger than that of a single contract. To address this problem, we present xFuzz , a machine learning guided smart contract fuzzing framework. …


Pa2blo: Low-Power, Personalized Audio Badge, Hemanth Sabbella, Dulaj Sanjaya Weerakoon, Manoj Gulati, Archan Misra Mar 2024

Pa2blo: Low-Power, Personalized Audio Badge, Hemanth Sabbella, Dulaj Sanjaya Weerakoon, Manoj Gulati, Archan Misra

Research Collection School Of Computing and Information Systems

We present the hardware design and software pipeline for an ultra-low power device, in the form factor of a wearable badge, that supports energy efficient sensing, processing and wireless transfer of human voice commands and interactions. The proposed system, called PA2BLO, is envisioned to support both: (a) real-time, scalable, authorized voice based interaction and control of devices and appliances, and (b) longitudinal, low-power logging of natural voice interactions. PA2BLO in-troduces two key novel capabilities. First, it includes a low power, low-complexity voice authentication module that is able to reliably authenticate an authorized user only using low sampling rate (500 Hz) …


Demystifying Faulty Code: Step-By-Step Reasoning For Explainable Fault Localization, Ratnadira Widyasari, Jia Wei Ang, Truong Giang Nguyen, Neil Sharma, David Lo Mar 2024

Demystifying Faulty Code: Step-By-Step Reasoning For Explainable Fault Localization, Ratnadira Widyasari, Jia Wei Ang, Truong Giang Nguyen, Neil Sharma, David Lo

Research Collection School Of Computing and Information Systems

Fault localization is a critical process that involves identifying specific program elements responsible for program failures. Manually pinpointing these elements, such as classes, methods, or statements, which are associated with a fault is laborious and time-consuming. To overcome this challenge, various fault localization tools have been developed. These tools typically generate a ranked list of suspicious program elements. However, this information alone is insufficient. A prior study emphasized that automated fault localization should offer a rationale. In this study, we investigate the step-by-step reasoning for explainable fault localization. We explore the potential of Large Language Models (LLM) in assisting developers …


Gsword: Gpu-Accelerated Sampling For Subgraph Counting, Chang Ye, Yuchen Li, Shixuan Sun, Wentian Guo Mar 2024

Gsword: Gpu-Accelerated Sampling For Subgraph Counting, Chang Ye, Yuchen Li, Shixuan Sun, Wentian Guo

Research Collection School Of Computing and Information Systems

Subgraph counting is a fundamental component for many downstream applications such as graph representation learning and query optimization. Since obtaining the exact count is often intractable, there have been a plethora of approximation methods on graph sampling techniques. Nonetheless, the state-of-the-art sampling methods still require massive samples to produce accurate approximations on large data graphs. We propose gSWORD, a GPU framework that leverages the massive parallelism of GPUs to accelerate iterative sampling algorithms for subgraph counting. Despite the embarrassingly parallel nature of the samples, there are unique challenges in accelerating subgraph counting due to its irregular computation logic. To address …


Understanding Newcomers' Onboarding Process In Deep Learning Projects, Junxiao Han, Jiahao Zhang, David Lo, Xin Xia, Shuigang Deng, Minghui Wu Mar 2024

Understanding Newcomers' Onboarding Process In Deep Learning Projects, Junxiao Han, Jiahao Zhang, David Lo, Xin Xia, Shuigang Deng, Minghui Wu

Research Collection School Of Computing and Information Systems

Attracting and retaining newcomers are critical for the sustainable development of Open Source Software (OSS) projects. Considerable efforts have been made to help newcomers identify and overcome barriers in the onboarding process. However, fewer studies focus on newcomers’ activities before their successful onboarding. Given the rising popularity of deep learning (DL) techniques, we wonder what the onboarding process of DL newcomers is, and if there exist commonalities or differences in the onboarding process for DL and non-DL newcomers. Therefore, we reported a study to understand the growth trends of DL and non-DL newcomers, mine DL and non-DL newcomers’ activities before …


Reward Penalties On Augmented States For Solving Richly Constrained Rl Effectively, Jiang Hao, Tien Mai, Pradeep Varakanthan, Minh Huy Hoang Mar 2024

Reward Penalties On Augmented States For Solving Richly Constrained Rl Effectively, Jiang Hao, Tien Mai, Pradeep Varakanthan, Minh Huy Hoang

Research Collection School Of Computing and Information Systems

Constrained Reinforcement Learning employs trajectory-based cost constraints (such as expected cost, Value at Risk, or Conditional VaR cost) to compute safe policies. The challenge lies in handling these constraints effectively while optimizing expected reward. Existing methods convert such trajectory-based constraints into local cost constraints, but they rely on cost estimates, leading to either aggressive or conservative solutions with regards to cost. We propose an unconstrained formulation that employs reward penalties over states augmented with costs to compute safe policies. Unlike standard primal-dual methods, our approach penalizes only infeasible trajectories through state augmentation. This ensures that increasing the penalty parameter always …


Transiam: Aggregating Multi-Modal Visual Features With Locality For Medical Image Segmentation, Xuejian Li, Shiqiang Ma, Junhai Xu, Jijun Tang, Shengfeng He, Fei Guo Mar 2024

Transiam: Aggregating Multi-Modal Visual Features With Locality For Medical Image Segmentation, Xuejian Li, Shiqiang Ma, Junhai Xu, Jijun Tang, Shengfeng He, Fei Guo

Research Collection School Of Computing and Information Systems

Automatic segmentation of medical images plays an important role in the diagnosis of diseases. On single-modal data, convolutional neural networks have demonstrated satisfactory performance. However, multi-modal data encompasses a greater amount of information rather than single-modal data. Multi-modal data can be effectively used to improve the segmentation accuracy of regions of interest by analyzing both spatial and temporal information. In this study, we propose a dual-path segmentation model for multi-modal medical images, named TranSiam. Taking into account that there is a significant diversity between the different modalities, TranSiam employs two parallel CNNs to extract the features which are specific to …


From Asset Flow To Status, Action And Intention Discovery: Early Malice Detection In Cryptocurrency, Ling Cheng, Feida Zhu, Yong Wang, Ruicheng Liang, Huiwen Liu Mar 2024

From Asset Flow To Status, Action And Intention Discovery: Early Malice Detection In Cryptocurrency, Ling Cheng, Feida Zhu, Yong Wang, Ruicheng Liang, Huiwen Liu

Research Collection School Of Computing and Information Systems

Cryptocurrency has been subject to illicit activities probably more often than traditional financial assets due to the pseudo-anonymous nature of its transacting entities. An ideal detection model is expected to achieve all three critical properties of early detection, good interpretability, and versatility for various illicit activities. However, existing solutions cannot meet all these requirements, as most of them heavily rely on deep learning without interpretability and are only available for retrospective analysis of a specific illicit type. To tackle all these challenges, we propose Intention Monitor for early malice detection in Bitcoin, where the on-chain record data for a certain …


High Frequency Principal Component Analysis Based On Correlation Matrix That Is Robust To Jumps, Microstructure Noise And Asynchronous Observation Times, Dachuan Chen Mar 2024

High Frequency Principal Component Analysis Based On Correlation Matrix That Is Robust To Jumps, Microstructure Noise And Asynchronous Observation Times, Dachuan Chen

Research Collection School Of Economics

This paper developed the high frequency estimation for the principal component analysis (PCA) based on correlation matrix. This estimation methodology is robust to jumps, microstructure noise and asynchronous observation times simultaneously, which is enabled by the newly proposed Truncated and Smoothed Two-Scales Realized Volatility (Truncated S-TSRV) estimator. The general framework of our methodology is constructed based on the estimation of realized spectral functions with respect to the spot correlation matrix. A new asymptotic representation for the element-wise estimation error of the spot correlation matrix estimate has been derived, resulting in a new bias correction term which is much more complex …


Decentralized Multimedia Data Sharing In Iov: A Learning-Based Equilibrium Of Supply And Demand, Jiani Fan, Minrui Xu, Jiale Guo, Lwin Khin Shar, Jiawen Kang, Dusit Niyato, Kwok-Yan Lam Mar 2024

Decentralized Multimedia Data Sharing In Iov: A Learning-Based Equilibrium Of Supply And Demand, Jiani Fan, Minrui Xu, Jiale Guo, Lwin Khin Shar, Jiawen Kang, Dusit Niyato, Kwok-Yan Lam

Research Collection School Of Computing and Information Systems

The Internet of Vehicles (IoV) has great potential to transform transportation systems by enhancing road safety, reducing traffic congestion, and improving user experience through onboard infotainment applications. Decentralized data sharing can improve security, privacy, reliability, and facilitate infotainment data sharing in IoVs. However, decentralized data sharing may not achieve the expected efficiency if there are IoV users who only want to consume the shared data but are not willing to contribute their own data to the community, resulting in incomplete information observed by other vehicles and infrastructure, which can introduce additional transmission latency. Therefore, in this paper, by modeling the …