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

Digital Commons Network™

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

2025

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 158911 - 158922 of 158922

Full-Text Articles in Entire DC Network

Attribute-Based Encryption With Searchable Encryption, Yang Yang Jan 2025

Attribute-Based Encryption With Searchable Encryption, Yang Yang

Research Collection School Of Computing and Information Systems

Attribute-based encryption (ABE) with searchable encryption is a notion that inherits the advantages of both ABE (Goyal et al., 2006) and searchable encryption (SE) (Boneh et al., 2004; Boneh and Waters, 2007) mechanisms to realize secure share and search for the outsourced data. ABE creates fine-grained access control system to prevent sensitive data from being accessed by unauthorized user or external attacker (Bethencourt et al., 2007). SE generates encrypted index for outsourced data such that it can be searched by a keyword trapdoor (or token) (Shi et al., 2007; Naveed et al., 2014), where the outsourced content and search keyword(s) …

Go to article

Adapting Installation Instructions In Rapidly Evolving Software Ecosystems, Haoyu Gao, Christoph Treude, Mansooreh Zahedi Jan 2025

Adapting Installation Instructions In Rapidly Evolving Software Ecosystems, Haoyu Gao, Christoph Treude, Mansooreh Zahedi

Research Collection School Of Computing and Information Systems

files play an important role in providing installation-related instructions to software users and are widely used in open source software systems on platforms such as GitHub. Software projects evolve rapidly alongside their dependencies in dynamic software ecosystems, requiring frequent updates to installation instructions. These instructions are crucial for users to start with a software project. Despite their significance, there is a lack of systematic understanding regarding the documentation efforts invested in README files and the triggers behind them. To fill the research gap, we conducted a qualitative study, investigating 400 GitHub repositories with 1,163 README commits that focused on updates …

Go to article

Adversarial Generative Flow Network For Solving Vehicle Routing Problems, Ni Zhang, Jingfeng Yang, Zhiguang Cao, Xu Chi Jan 2025

Adversarial Generative Flow Network For Solving Vehicle Routing Problems, Ni Zhang, Jingfeng Yang, Zhiguang Cao, Xu Chi

Research Collection School Of Computing and Information Systems

Recent research into solving vehicle routing problems (VRPs) has gained significant traction, particularly through the application of deep (reinforcement) learning for end-to-end solution construction. However, many current construction-based neural solvers predominantly utilize Transformer architectures, which can face scalability challenges and struggle to produce diverse solutions. To address these limitations, we introduce a novel framework beyond Transformer-based approaches, i.e., Adversarial Generative Flow Networks (AGFN). This framework integrates the generative flow network (GFlowNet)-a probabilistic model inherently adept at generating diverse solutions (routes)-with a complementary model for discriminating (or evaluating) the solutions. These models are trained alternately in an adversarial manner to improve …

Go to article

Gnnsynergy: A Multi-View Graph Neural Network For Predicting Anti-Cancer Drug Synergy, Zhifeng Hao, Jianming Zhan, Yuan Fang, Min Wu, Ruichu Cai Jan 2025

Gnnsynergy: A Multi-View Graph Neural Network For Predicting Anti-Cancer Drug Synergy, Zhifeng Hao, Jianming Zhan, Yuan Fang, Min Wu, Ruichu Cai

Research Collection School Of Computing and Information Systems

Drug combinations play very important roles in cancer therapy, as they can enhance curative efficacy and overcome drug resistance. Due to the increasing size of combinatorial space, experimental screening for all the drug combinations becomes infeasible in practice. Therefore, there is a great need to develop accurate computational approaches that can predict potential drug combinations to direct the experimental screening. In this paper, we propose a novel method called GNNSynergy to learn drug embeddings for drug synergy prediction. Given a specific cancer cell line, we propose a multi-view graph neural network framework which considers the current cell line as main …

Go to article

Double Oracle Neural Architecture Search For Game Theoretic Deep Learning Models, Aye Phyu Phyu Aung, Xinrun Wang, Ruiyu Wang, Hau Chan, Bo An, Xiaoli Li, J. Senthilnath Jan 2025

Double Oracle Neural Architecture Search For Game Theoretic Deep Learning Models, Aye Phyu Phyu Aung, Xinrun Wang, Ruiyu Wang, Hau Chan, Bo An, Xiaoli Li, J. Senthilnath

Research Collection School Of Computing and Information Systems

In this paper, we propose a new approach to train deep learning models using game theory concepts including Generative Adversarial Networks (GANs) and Adversarial Training (AT) where we deploy a double-oracle framework using best response oracles. GAN is essentially a two-player zero-sum game between the generator and the discriminator. The same concept can be applied to AT with attacker and classifier as players. Training these models is challenging as a pure Nash equilibrium may not exist and even finding the mixed Nash equilibrium is difficult as training algorithms for both GAN and AT have a large-scale strategy space. Extending our …

Go to article

Recdreamer: Consistent Text-To-3d Generation Via Uniform Score Distillation, Chenxi Zheng, Yihong Lin, Bangzhen Liu, Xuemiao Xu, Yongwei Nie, Shengfeng He Jan 2025

Recdreamer: Consistent Text-To-3d Generation Via Uniform Score Distillation, Chenxi Zheng, Yihong Lin, Bangzhen Liu, Xuemiao Xu, Yongwei Nie, Shengfeng He

Research Collection School Of Computing and Information Systems

Current text-to-3D generation methods based on score distillation often suffer from geometric inconsistencies, leading to repeated patterns across different poses of 3D assets. This issue, known as the Multi-Face Janus problem, arises because existing methods struggle to maintain consistency across varying poses and are biased toward a canonical pose. While recent work has improved pose control and approximation, these efforts are still limited by this inherent bias, which skews the guidance during generation. To address this, we propose a solution called RecDreamer, which reshapes the underlying data distribution to achieve more consistent pose representation. The core idea behind our method …

Go to article

Label Correlated Contrastive Learning For Medical Report Generation, Xinyao Liu, Junchang Xin, Bing Tian Dai, Qi Shen, Zhihong Huang, Zhiqiong Wang Jan 2025

Label Correlated Contrastive Learning For Medical Report Generation, Xinyao Liu, Junchang Xin, Bing Tian Dai, Qi Shen, Zhihong Huang, Zhiqiong Wang

Research Collection School Of Computing and Information Systems

Background and Objective: Automatic generation of medical reports reduces both the burden on radiologists and the possibility of errors due to the inexperience of radiologists. The model that utilizes attention mechanism and contrastive learning can generate medical reports by capturing both general and specific semantics. However, existing contrastive learning methods ignore the specificity of medical data, that is, a patient may suffer from multiple diseases at the same time. This means that the lack of fine-grained relationships for contrastive learning will lead to the problem of insufficient specificity. Methods: To address the above problem, a label correlated contrastive learning method …

Go to article

The Effectiveness Of Local Updates For Decentralized Learning Under Data Heterogeneity, Tongle Wu, Zhize Li, Ying Sun Jan 2025

The Effectiveness Of Local Updates For Decentralized Learning Under Data Heterogeneity, Tongle Wu, Zhize Li, Ying Sun

Research Collection School Of Computing and Information Systems

We revisit two fundamental decentralized optimization methods, Decentralized Gradient Tracking (DGT) and Decentralized Gradient Descent (DGD), with multiple local updates. We consider two settings and demonstrate that incorporating local update steps can reduce communication complexity. Specifically, for  $\mu$-strongly convex and $L$-smooth loss functions, we proved that local DGT  achieves communication complexity {}{$\tilde{\mathcal{O}} \Big(\frac{L}{\mu(K+1)} + \frac{\delta + {}{\mu}}{\mu (1 - \rho)} + \frac{\rho }{(1 - \rho)^2} \cdot \frac{L+ \delta}{\mu}\Big)$}, where $K$ is the number of additional local update}, $\rho$ measures the network connectivity and $\delta$ measures the second-order heterogeneity of the local losses. Our results reveal the tradeoff between communication and …

Go to article

Risk Spillover Effect Of China-Asean Supply Chains: Insights Of Industrial Transfer, Zeyang Bian, Yuning Zhang, Keng Siau, Yaqian Zhang, Jianjia He Jan 2025

Risk Spillover Effect Of China-Asean Supply Chains: Insights Of Industrial Transfer, Zeyang Bian, Yuning Zhang, Keng Siau, Yaqian Zhang, Jianjia He

Research Collection School Of Computing and Information Systems

As labour costs in China increase, labour-intensive industries are migrating to ASEAN countries, attracted by lower labour costs and market potential. This shift not only affects the economies of China and ASEAN but also reshapes the global manufacturing landscape. This paper investigates the correlation and spillover of supply chain risks using production exposure indicators derived from inter-country input-output data and the R-Vine Copula model. We assess the risk spillover of each country within the global supply chain. Our findings indicate that industrial relocation can significantly alter supply chain structures, thereby affecting the concentration and direction of risks. While China's role …

Go to article

More Effective Javascript Breaking Change Detection Via Dynamic Object Relation Graph, Dezhen Kong, Jiakun Liu, Chao Ni, David Lo, Lingfeng Bao Jan 2025

More Effective Javascript Breaking Change Detection Via Dynamic Object Relation Graph, Dezhen Kong, Jiakun Liu, Chao Ni, David Lo, Lingfeng Bao

Research Collection School Of Computing and Information Systems

JavaScript libraries are characterized by their widespread use, frequent code changes, and a high tolerance for backward incompatible changes. Awareness of such breaking changes can help developers adapt to version updates and avoid negative impacts. Several tools have been targeted to or can be used to detect breaking change detection in the JavaScript community. However, these tools detect breaking changes using different ways, and there are currently no systematic reviews of these approaches. From a preliminary study on popular JavaScript libraries, we find that existing approaches, including simple regression testing, model-based testing and type differencing cannot detect many breaking changes …

Go to article

Charge Your Clients: Payable Secure Computation And Its Applications, Cong Zhang, Liqiang Peng, Weiran Liu, Shuaishuai Li, Meng Hao, Lei Zhang, Dongdai Lin Jan 2025

Charge Your Clients: Payable Secure Computation And Its Applications, Cong Zhang, Liqiang Peng, Weiran Liu, Shuaishuai Li, Meng Hao, Lei Zhang, Dongdai Lin

Research Collection School Of Computing and Information Systems

The online realm has witnessed a surge in the buying and selling of data, prompting the emergence of dedicated data marketplaces. These platforms cater to servers (sellers), enabling them to set prices for access to their data, and clients (buyers), who can subsequently purchase these data, thereby streamlining and facilitating such transactions. However, the current data market is primarily confronted with the following issues. Firstly, they fail to protect client privacy, presupposing that clients submit their queries in plaintext. Secondly, these models are susceptible to being impacted by malicious client behavior, for example, enabling clients to potentially engage in arbitrage …

Go to article

Financial Named Entity Recognition: How Far Can Llm Go?, Yi-Te Lu, Yintong Huo Jan 2025

Financial Named Entity Recognition: How Far Can Llm Go?, Yi-Te Lu, Yintong Huo

Research Collection School Of Computing and Information Systems

The surge of large language models (LLMs) has revolutionized the extraction and analysis of crucial information from a growing volume of financial statements, announcements, and business news. Recognition for named entities to construct structured data poses a significant challenge in analyzing financial documents and is a foundational task for intelligent financial analytics. However, how effective are these generic LLMs and their performance under various prompts are yet need a better understanding. To fill in the blank, we present a systematic evaluation of state-of-the-art LLMs and prompting methods in the financial Named Entity Recognition (NER) problem. Specifically, our experimental results highlight …

Go to article

First Prev